tla-ts 0.0.10-dev.a17d6d9fa → 0.0.10-dev.a4b81b6d0

This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
package/dist/transfer.js CHANGED
@@ -73,7 +73,7 @@ It was expecting %2%, but did not find it.`,!1],[5007,`TLC found an error in the
73
73
  `)),qt=`${l}tlc2.tool.EvalException: `,Jt=`${l}util.Assert$TLCRuntimeException: `,Yt=e=>Ft(e)?qt:Jt,Xt=e=>{try{return e()}catch(e){throw e instanceof w?Ft(e)?new w(`${a}${e.message}`):Pt(e.message)?e:new w(`${l}${e.message}`):e}},Zt=[qt,Jt,l,a],Qt=(e,t)=>{let r=Ht.get(e);if(r)return`${r.headline}\n${Qt(r.inner,t)}`;let i=e.message;if(e instanceof n)return i;let a=Zt.find(e=>i.startsWith(e))??``;return`${a}${Rt(i.slice(a.length),t)}`},$t=(e,t)=>{let r=Ht.get(e),a=e.message;if(r)return{code:r.code,message:a,toolMessage:Qt(e,!0)};if(e instanceof i)return{code:t?wt.stackOverflow:wt.general,message:a,toolMessage:a};if(t&&Ft(e))return{code:Pt(a)?.code??wt.general,message:a,toolMessage:a};let o=t&&!a.startsWith(Kt)&&!(e instanceof n),s=e instanceof u?Gt:l,c=o?s:``;return{code:wt.general,message:`${c}${a}`,toolMessage:`${c}${Qt(e,!0)}`}},en=e=>e.kind!==`ModelValue`&&e.kind!==`Set`&&e.kind!==`Function`&&e.kind!==`Interval`&&e.kind!==`InfiniteSet`&&e.kind!==`LazyFunction`,tn=2147483647,nn=1e6;let rn=nn;const an=()=>rn,on=()=>Math.max(rn,10),sn=()=>`Attempted to construct a set with too many elements (>${rn}).`,cn=(e,t)=>{if(e.length===on())throw new u(sn());e.push(t)},ln=e=>typeof e==`object`&&e.kind===`Interval`&&e.high-e.low>=on(),un=(e,t)=>{if(Array.isArray(e))return e.forEach(t);for(let n=e.low;n<=e.high;n++)t(n)},dn=e=>typeof e==`object`&&e.kind!==`ModelValue`&&e.kind!==`Function`&&e.kind!==`LazyFunction`,fn=e=>typeof e==`object`&&(e.kind===`Set`||e.kind===`MixedSet`||e.kind===`Interval`),pn=e=>typeof e==`object`&&(e.kind===`Function`||e.kind===`LazyFunction`),mn=e=>typeof e==`object`&&e.kind===`ModelValue`,hn=e=>typeof e==`object`&&(e.kind===`Set`||e.kind===`MixedSet`),gn=e=>typeof e==`boolean`?`boolean`:typeof e==`number`?`integer`:typeof e==`string`?`string`:e.kind===`ModelValue`?`model value`:dn(e)?`set`:`function`,_n=e=>Number.isInteger(e)&&e<=2147483647&&e>=-2147483648;let vn=!1;const yn=(e,t)=>(vn=!0,e.writtenKeys=t,e),bn=e=>(e.hash!==0||e.fingerprint!==0?void 0:e.writtenKeys)??e.domain,xn=e=>bn(e).map(t=>[t,e.range[e.domain.indexOf(t)]]),Sn=e=>e.domain.every(e=>typeof e==`number`)?e.domain.map((t,n)=>[t,e.range[n]]):xn(e),Cn=(e,t,n,r)=>yn(mi(e,t.map(e=>n[e])),r),wn=e=>{if(!(typeof e!=`object`||e.kind!==`Function`&&e.kind!==`Set`)&&e.hash===0&&e.fingerprint===0){if(e.kind===`Set`)return e.elements.forEach(wn);e.writtenKeys=void 0,e.range.forEach(wn)}},Tn=e=>e.every(e=>typeof e==`string`),En=(e,t)=>e.length>0&&t.length>0&&Tn(e)!==Tn(t),Dn=(e,t)=>{vn&&(e.writtenKeys=void 0,t.writtenKeys=void 0);let n=e.domain,r=t.domain;if(n.length!==r.length)return En(n,r)?Lr(e,t):n.length-r.length;if(n!==r)for(let e=0;e<n.length;e++){let t=$n(n[e],r[e]);if(t!==0)return t}let i=e.range,a=t.range;if(i===a)return 0;for(let e=0;e<i.length;e++){let t=i[e],n=a[e],r=typeof t==`number`&&typeof n==`number`?t-n:$n(t,n);if(r!==0)return r}return 0},On=(e,t)=>{let n=e.elements,r=t.elements;if(n.length!==r.length)return n.length-r.length;if(n===r)return 0;for(let e=0;e<n.length;e++){let t=$n(n[e],r[e]);if(t!==0)return t}return 0},kn=e=>mn(e)?e.type:void 0,An=(e,t,n)=>{let r=kn(e),i=kn(t);if(r===void 0&&i===void 0)return;let a=n?`check equality of`:`compare`;if(mn(e)&&mn(t)){if(r===void 0||i===void 0||r===i)return;throw new w(`Attempted to ${a} the differently-typed model values ${N(L(e))} and ${N(L(t))}`)}throw r===void 0?new w(`Attempted to ${a} the typed model value ${N(L(t))} and the non-model value\n${N(L(e))}`):new w(`Attempted to ${a}${n?``:` the`} typed model value ${N(L(e))} and non-model value\n${N(L(t))}`)},jn=()=>({ranks:Object.create(null),size:0,searchRank:void 0,unorderedString:void 0}),Mn=jn(),Nn=e=>{Object.assign(Mn,jn()),er.clear();for(let t of e)Un(t)},Pn=()=>{Mn.searchRank=Mn.size},Fn=()=>Mn.unorderedString;let In=!1;const Ln={isExpanded:!0,isViewPrinted:!1},Rn=e=>{In=e.version===`1.7.4`,rn=e.maxSetSize??nn,Ln.isExpanded=e.isLazyValueExpanded??!0,Ln.isViewPrinted=e.isViewPrinted??!1},zn=/* @__PURE__ */ new WeakMap,Bn=(e,t)=>(Ln.isViewPrinted&&zn.set(e,t),e),Vn=/* @__PURE__ */ new WeakMap,Hn=(e,t)=>(Vn.set(e,t),e),Un=e=>(Mn.ranks[e]===void 0&&(Mn.ranks[e]=Mn.size++),e),Wn=e=>Mn.ranks[Un(e)],Gn=(e,t)=>{if(e===t)return 0;let n=Mn.ranks,r=n[e],i=n[t],a=Mn.searchRank;return a!==void 0&&(r===void 0||r>=a)&&(i===void 0||i>=a)&&(Mn.unorderedString??=e),r!==void 0&&i!==void 0?r-i:r===void 0?i===void 0&&e<t?-1:1:-1},Kn=e=>typeof e==`object`&&(e.kind===`InfiniteSet`||e.kind===`SequenceSet`),qn=(e,t)=>(Kn(e)||Kn(t))&&(typeof e!=`object`||e.kind!==`SequenceSet`||typeof t!=`object`||t.kind!==`SequenceSet`),Jn=(e,t)=>new w(Kn(e)?`Attempted to compare overridden value ${N(L(e,!0))} with non-overridden value:\n${N(L(t))}`:`Attempted to compare ${gn(e)} ${L(e)} with ${gn(t)} ${L(t)}`),Yn=(e,n,r)=>{if(!Kn(e))throw new w(`Attempted to ${r} the set ${N(L(P(e)?F(e):e,!0))} with the value:\n${N(L(n,!0))}`);if(!Kn(n))throw Jn(e,n);let i=e.kind===`InfiniteSet`?e.name:void 0,a=n.kind===`InfiniteSet`?n.name:void 0;if(i!==void 0&&i===a)return 0;if(i===`Nat`&&a===`Int`||i===`Int`&&a===`Nat`)return i===`Nat`?-1:1;throw new t(`Attempted to compare ${N(L(e,!0))} with the value\n${N(L(n,!0))}`)},Xn={kind:`InfiniteSet`,name:`Any`},Zn=e=>{throw new t(`Attempted to compare ANY with the value\n${N(L(e))}`)},Qn=e=>{vn&&wn(e),e===Xn&&Zn(e),typeof e==`object`&&e.kind===`LazyFunction`&&I(e)},$n=(e,t)=>{if(e===t)return Qn(e),0;if(typeof e==`object`&&typeof t==`object`){let n=e.kind,r=t.kind;if(n===`Function`&&r===`Function`)return Dn(e,t);if(n===`Set`&&r===`Set`)return On(e,t);if(n===`Interval`&&r===`Interval`){let n=Math.max(0,e.high-e.low+1),r=Math.max(0,t.high-t.low+1);return n!==r||n===0?n-r:e.low-t.low}if(n===`ModelValue`&&r===`ModelValue`)return e.type!==void 0&&t.type!==void 0&&An(e,t,!1),e.rank-t.rank;if(n===`ModelValue`||r===`ModelValue`)return An(e,t,!1),n===`ModelValue`?-1:1;if(e===Xn||t===Xn)return Zn(e===Xn?t:e);if(dn(e)&&dn(t)&&qn(e,t))return Yn(e,t,`compare`);let i=dn(e);if(i!==dn(t))throw Jn(e,t);if(n===`Interval`&&r===`Set`){let n=Ri(e)-t.elements.length;if(n!==0)return n}if(n===`Set`&&r===`Interval`){let n=e.elements.length-Ri(t);if(n!==0)return n}return i?On(F(e),F(t)):Dn(I(e),I(t))}if(typeof e==`number`&&typeof t==`number`)return e-t;if(typeof e==`string`&&typeof t==`string`)return Gn(e,t);if(typeof e==`boolean`&&typeof t==`boolean`)return e<t?-1:1;if(An(e,t,!1),mn(e))return-1;if(mn(t))return 1;throw Jn(e,t)},er=/* @__PURE__ */ new Map,tr=32768,nr=e=>{let t=er.get(e);if(t)return t;if(er.size===tr)throw new f(`TLC supports at most ${tr} model values, but model value ${e} exceeds this limit.`);let n={kind:`ModelValue`,name:e,type:e.length>2&&e[1]===`_`?e[0]:void 0,rank:Wn(e),hash:_a(va(ya(e),109)),fingerprint:Oa(ka(e)^60)};return er.set(e,n),n},rr=()=>[...er.values()],ir=e=>({kind:`Set`,elements:e,writtenElements:void 0,isNormalized:!1,hash:0,fingerprint:0,isFingerprinted:!1}),ar=e=>{let t=ir(e);return t.isNormalized=!0,t},or=(e,t)=>({kind:`Function`,domain:e,range:t,hash:0,fingerprint:0,writtenKeys:void 0,functionClass:void 0,lambdaDomain:void 0,isFingerprinted:!1});let sr=!1;const cr=(e,t)=>(t===`lambda`&&(sr=!0),t!==void 0&&(e.functionClass=t),e),lr=e=>typeof e==`object`&&(e.kind===`Function`||e.kind===`LazyFunction`)?e.functionClass:void 0,ur=e=>cr(e,`lambda`),dr=e=>en(e)&&e.isCached===!0;let fr=!1;const pr=e=>(fr=!0,e),mr=/* @__PURE__ */ new Set([`Union`,`SetOperation`,`FilteredSet`,`ProductSet`,`RecordSet`,`FunctionSet`]),hr=e=>{fr&&typeof e==`object`&&en(e)&&mr.has(e.kind)&&(e.isCached=!0)},gr=e=>{(sr||fr)&&typeof e==`object`&&e.kind!==`ModelValue`&&e.kind!==`Interval`&&e.kind!==`InfiniteSet`&&(e.isFingerprinted||(e.isFingerprinted=!0,e.kind===`Function`?(e.functionClass===`lambda`&&(e.functionClass=void 0),e.domain.forEach(gr),e.range.forEach(gr)):e.kind===`Set`||e.kind===`MixedSet`?e.elements.forEach(gr):dn(e)&&P(e)&&(hr(e),F(e).elements.forEach(gr))))},_r=(e,t)=>{if(hr(e),e===t)return Qn(e),!0;if(typeof e!=`object`||typeof t!=`object`)return typeof e!=typeof t&&((typeof e==`object`||typeof t==`object`)&&An(e,t,!0),$n(e,t)===0);if(e.kind===`Function`&&t.kind===`Function`)return Dn(e,t)===0;if(e.kind===`Set`&&t.kind===`Set`)return On(e,t)===0;if(e.kind===`Interval`&&t.kind===`Set`&&Ri(e)!==t.elements.length||e.kind===`Set`&&t.kind===`Interval`&&e.elements.length!==Ri(t))return!1;if(mn(e)||mn(t))return e.kind===`LazyFunction`&&I(e),An(e,t,!0),mn(e)&&mn(t)&&e.name===t.name;if(e.kind===`Subset`&&t.kind===`Subset`)return _r(e.base,t.base);if(e.kind===`FunctionSet`&&t.kind===`FunctionSet`){let n=Fi(e.domain),r=Fi(t.domain);if(n||r)return n===r;let i=Fi(e.range),a=Fi(t.range);return i||a?i===a:_r(e.domain,t.domain)&&_r(e.range,t.range)}if(e.kind===`RecordSet`&&t.kind===`RecordSet`){if(Fi(e))return Fi(t);if(Fi(t))return!1;let n=e=>e.names.map((t,n)=>[t,e.sets[n]]).sort((e,t)=>e[0]<t[0]?-1:1),r=n(t);return e.names.length===t.names.length&&n(e).every((e,t)=>e[0]===r[t][0]&&_r(e[1],r[t][1]))}if(e.kind===`ProductSet`&&t.kind===`ProductSet`)return Fi(e)?Fi(t):!Fi(t)&&e.factors.length===t.factors.length&&e.factors.every((e,n)=>_r(e,t.factors[n]));let n=dn(e)&&dn(t)&&!(P(e)&&P(t));if(n&&qn(e,t))return Yn(e,t,`check equality of`)===0;if(n){if(!Kn(e)){let n=F(e);if(!Kn(t))return On(n,F(t))===0}return Pa(e)===Pa(t)}return $n(e,t)===0},vr=e=>{let t=(e,t)=>{if(e===t)return!0;if(e.length!==t.length)return!1;for(let r=0;r<e.length;r++)if(!n(e[r],t[r]))return!1;return!0},n=(n,r)=>n===r?!0:typeof n!=`object`||typeof r!=`object`?!1:n.kind===`Set`&&r.kind===`Set`?(n.hash===0||r.hash===0||n.hash===r.hash)&&t(n.elements,r.elements):n.kind===`Function`&&r.kind===`Function`?(!e||n.functionClass===r.functionClass)&&(n.hash===0||r.hash===0||n.hash===r.hash)&&t(n.domain,r.domain)&&t(n.range,r.range):Pa(n)===Pa(r);return n},yr=vr(!1),br=vr(!0),xr=(e,t)=>{for(let n=0;n<e.length;n++)e[n]=t(e[n])},Sr=()=>{let e=/* @__PURE__ */ new Map,t=n=>{if(typeof n!=`object`||n.kind!==`Set`&&n.kind!==`Function`)return n;let r=Da(n),i=e.get(r);if(i!==void 0&&!Array.isArray(i)&&(i===n||br(i,n)))return i;if(Array.isArray(i)){for(let e=0;e<i.length;e++)if(i[e]===n||br(i[e],n))return i[e]}return n.kind===`Set`?xr(n.elements,t):(xr(n.domain,t),xr(n.range,t)),i===void 0?e.set(r,n):Array.isArray(i)?i.push(n):e.set(r,[i,n]),n};return e=>{for(let n=0;n<e.length;n++)e[n]=t(e[n]);return e}},Cr=(e,t)=>t.length===0||lr(e)===`tuple`?1:ma(t)?.low,wr=e=>{if(!pn(e))return;let t=I(e);return{domain:t.domain,range:t.range,low:Cr(e,t.domain)}},Tr=e=>{if(!pn(e))return;let t=I(e);return Tn(t.domain)?t:void 0},Er=(e,t,n)=>(An(t,e,n),1),Dr={number:{name:`integer`,other:`non-integer`,equality:`check equality of`},string:{name:`string`,other:`non-string`,equality:`check equality of`},boolean:{name:`boolean`,other:`non-boolean`,equality:`compare equality of`}},Or=(e,t,n)=>{let r=Dr[typeof e==`number`?`number`:typeof e==`string`?`string`:`boolean`];return`Attempted to ${n?r.equality:`compare`} ${r.name} ${N(L(e))} with ${r.other}:\n${N(L(t))}`},kr=e=>e?`check equality of`:`compare`,Ar=(e,t,n,r)=>{let i=wr(n);if(!i){if(mn(n))return Er(n,t,r);throw new w(`Attempted to ${kr(r)} the function ${N(L(t))} with the value:\n${N(L(n))}`)}if(e.range.length!==i.range.length)return e.range.length-i.range.length;let a=()=>jr(e.range,i.range,r);if(e.low!==void 0&&e.range.length===0)return 0;if(e.low!==void 0&&i.low!==void 0)return e.low===i.low?a():e.low-i.low;let o=e.low??i.low;if(o===void 0)return jr(e.domain,i.domain,r)||a();let s=e.low===void 0?e.domain:i.domain;for(let t=0;t<s.length;t++){let n=s[t];if(typeof n!=`number`)throw new w(`Attempted to compare ${r?`an `:``}integer with non-integer${r||e.low!==void 0?`:`:``}\n${N(L(n))}.`);let i=e.low===void 0?n-(o+t):o+t-n;if(i!==0)return i}return a()},jr=(e,t,n)=>{for(let r=0;r<e.length;r++){let i=Ir(e[r],t[r],n);if(i!==0)return i}return 0},Mr=(e,t,n)=>{let r=I(e);if(lr(e)===`tuple`){let i=pn(t)?Ui(t):void 0;return i?r.range.length-i.length||jr(r.range,i,n):Ar({...r,low:1},e,t,n)}if(lr(e)===`record`){let i=Tr(t);if(!i){if(mn(t))return Er(t,e,n);throw new w(`Attempted to ${kr(n)} record:\n${N(L(e))}\nwith non-record\n${N(L(t))}`)}return r.domain.length-i.domain.length||jr(r.domain,i.domain,n)||jr(r.range,i.range,n)}return Ar({...r,low:Cr(e,r.domain)},e,t,n)},Nr=(e,t)=>Kn(e)||Kn(t)||typeof t==`object`&&e.kind===t.kind&&(e.kind===`Interval`||e.kind===`Subset`||e.kind===`FunctionSet`||e.kind===`RecordSet`||e.kind===`ProductSet`),Pr=(e,t)=>{let n=hn(t)?t:F(t);return{elements:F(e).elements,otherElements:F(n).elements}},Fr=(e,t,n)=>{if(Nr(e,t))return n?+!_r(e,t):$n(e,t);if(!hn(e))return Fr(F(e),t,n);if(!dn(t)){if(mn(t))return Er(t,e,n);throw new w(`Attempted to ${kr(n)} the set ${N(L(e))} with the value:\n${N(L(t))}`)}let r=Pr(e,t);return r.elements.length-r.otherElements.length||jr(r.elements,r.otherElements,n)},Ir=(e,t,n)=>{if(typeof e!=`object`){if(typeof t==typeof e)return n?e===t?0:1:$n(e,t);if(mn(t))return Er(t,e,n);throw new w(Or(e,t,n))}return e.kind===`ModelValue`?(e.type!==void 0&&An(e,t,n),mn(t)?n?e.name===t.name?0:1:e.rank-t.rank:-1):pn(e)?Mr(e,t,n):Fr(e,t,n)},Lr=(e,t)=>Ir(e,t,!1),Rr=(e,t)=>Ir(e,t,!0)===0,zr=e=>{let t=[];for(let n of e){let e=Vr(n,t);e.isFound||t.splice(e.index,0,n)}return t},Br=(e,t)=>{let n=Gi.sets;if(n===void 0)return t();n.push(e);let r=t();return n.pop(),r},Vr=(e,t)=>{let n=0,r=t.length;for(;n<r;){let i=n+(r-n>>1),a=Br(e,()=>Lr(e,t[i]));if(a===0)return{index:i,isFound:!0};a<0?r=i:n=i+1}return{index:n,isFound:!1}},Hr=(e,t)=>t.some(t=>Br(t,()=>Rr(t,e))),Ur=e=>e.kind===`MixedSet`||e.isNormalized?e.elements:e.writtenElements??e.elements,Wr=e=>{typeof e==`object`&&(e.kind===`Set`&&(e.isNormalized=!0,e.elements.forEach(Wr)),e.kind===`Function`&&(e.writtenKeys=void 0,e.domain.forEach(Wr),e.range.forEach(Wr)))},Gr=e=>{if(!(typeof e!=`object`||dr(e)))switch(e.kind){case`Set`:e.isNormalized=!0;return;case`MixedSet`:F(e);return;case`FilteredSet`:case`Subset`:return Gr(e.base);case`SetOperation`:return e.operator===`\\cup`?void 0:(Gr(e.left),Gr(e.right));case`FunctionSet`:return Gr(e.domain),Gr(e.range);case`RecordSet`:return e.sets.forEach(Gr);case`ProductSet`:return e.factors.forEach(Gr)}},Kr=(e,t)=>Ki(_r,Rr,e,t),qr=e=>{for(let t=1;t<e.length;t++)if($n(e[t-1],e[t])>=0)return!1;return!0},Jr=e=>{for(let t=0;t<e.length;t++){let n=e[t],r=t>0?e[t-1]:void 0;if(typeof n!=`number`||typeof r==`number`&&r>=n)return!1}return!0},Yr=e=>{for(let t=1;t<e.length;t++)hr(e[t]);if(e.length<2||qr(e))return ir(e);let t=[...e].sort($n),n=[t[0]];for(let e=1;e<t.length;e++)$n(n[n.length-1],t[e])!==0&&n.push(t[e]);return ir(n)},Xr=e=>{if(Jr(e))return ir(e);let t=Ki(Yr,e=>({kind:`MixedSet`,elements:e}),e,void 0);return t.kind===`Set`&&t.elements!==e&&(t.writtenElements=e),t},Zr=ir([]),Qr=(e,t)=>{if(e.elements.length===0||t.elements.length===0)return e;let n=e.elements,r=t.elements,i=[],a=0;for(let e=0;e<n.length;e++){let t=n[e];for(;a<r.length&&$n(r[a],t)<0;)a++;a<r.length&&$n(r[a],t)===0||i.push(t)}return i.length===n.length?e:ir(i)},$r=(e,t)=>{let n=e.elements,r=t.elements,i=[],a=0;for(let e=0;e<n.length;e++){let t=n[e];for(;a<r.length&&$n(r[a],t)<0;)a++;a<r.length&&$n(r[a],t)===0&&i.push(t)}return i.length===n.length?e:ir(i)},ei=(e,t)=>{if(e.elements.length===0)return t;if(t.elements.length===0)return e;let n=e.elements,r=t.elements,i=[],a=[],o=0,s=0;for(;o<n.length&&s<r.length;){let e=$n(n[o],r[s]);e<0?i.push(n[o++]):e>0?(a.push(r[s]),i.push(r[s++])):(i.push(n[o++]),s++)}for(;o<n.length;)i.push(n[o++]);for(;s<r.length;)a.push(r[s]),i.push(r[s++]);if(a.length===0)return e;let c=ir(i);if(e.hash!==0&&e.hash!==Sa){let t=e.hash,n=0;for(;n<a.length;n++){let e=Da(a[n]);if(e===Sa)break;t=t+ba(e)|0}n===a.length&&(c.hash=t)}if(e.fingerprint!==0){let t=e.fingerprint;for(let e=0;e<a.length;e++)t=t+Aa(a[e])|0;c.fingerprint=t}return c},ti=e=>{let t=e.length<2?e:[...e].sort((e,t)=>$n(e[0],t[0])),n=[],r=[];for(let e of t)n.length>0&&$n(n[n.length-1],e[0])===0||(n.push(e[0]),r.push(e[1]));return or(n,r)},ni=e=>{let t=ti(e);return t.domain.length!==e.length||e.every((e,n)=>e[0]===t.domain[n])?t:yn(t,e.map(e=>e[0]))},ri=[],ii=/* @__PURE__ */ new Map,ai=[],oi=/* @__PURE__ */ new WeakMap,si=e=>{let t=ri[e]??ii.get(e)?.deref();if(t)return t;let n=Array.from({length:e},(e,t)=>t+1);return e>1024?ii.set(e,new WeakRef(n)):ri[e]=n,n},ci=e=>{if(Ri(e),e.low===1&&e.high>=1)return si(e.high);let t=[];for(let n=e.low;n<=e.high;n++)t.push(n);return t},li=e=>e.length>0&&(e===ri[e.length]||e===ii.get(e.length)?.deref())||oi.has(e),ui=e=>{let t=F(e).elements;return li(t)&&(typeof e!=`object`||e.kind!==`Interval`)?[...t]:t},di=e=>{let t=ai[e];if(t)return t;let n={kind:`Interval`,low:1,high:e};return ai[e]=n,n},fi=e=>cr(or(si(e.length),e),`tuple`),pi=e=>cr(ti(e),`record`),mi=(e,t)=>cr(or(e,t),`record`),hi=e=>dn(e)&&!Kn(e),gi=(e,t=!1)=>`UNION(${L(e.base,t)})`,_i=(e,t=e=>F(e).elements)=>{if(!hi(e.base))throw new w(`Attempted to enumerate the nonenumerable set:\n${gi(e)}`);return t(e.base)},vi=(e,t,n)=>{if(hi(e))return e;throw new w(t===0?`Attempted to enumerate UNION(s), but some element of s is nonenumerable.`:`Attempted to enumerate the nonenumerable set:\n${N(L(e))}\nwhen enumerating:\n${N(gi(n))}`)},P=e=>{if(typeof e!=`object`)return!1;switch(e.kind){case`Set`:case`MixedSet`:case`Interval`:return!0;case`InfiniteSet`:case`SequenceSet`:return!1;case`Subset`:case`FilteredSet`:return P(e.base);case`FunctionSet`:return P(e.domain)&&P(e.range)||yi(e.domain)===!0||yi(e)===!0;case`RecordSet`:return e.sets.every(P)||yi(e)===!0;case`ProductSet`:return e.factors.every(P)||yi(e)===!0;case`Union`:return P(e.base)&&(hn(e.base)?Ur(e.base):Ai(e.base)).every(P);case`SetOperation`:return e.operator===`\\cup`?P(e.left)&&P(e.right):e.operator===`\\cap`?P(e.left)||P(e.right):P(e.left);default:return!1}},yi=e=>{if(typeof e==`object`)switch(e.kind){case`Set`:case`MixedSet`:return e.elements.length===0;case`Interval`:return e.low>e.high;case`InfiniteSet`:return e.name===`Any`&&void 0;case`Subset`:case`SequenceSet`:return!1;case`FunctionSet`:{let t=yi(e.domain);return t===void 0?void 0:!t&&yi(e.range)}case`RecordSet`:case`ProductSet`:for(let t of e.kind===`RecordSet`?e.sets:e.factors){let e=yi(t);if(e!==!1)return e}return!1;case`SetOperation`:case`FilteredSet`:case`Union`:return P(e)?F(e).elements.length===0:void 0;default:return}},bi=e=>{let t=e.reduce((e,t)=>e*t.length,1),n=[],r=e.map(()=>0);for(let i=0;i<t;i++){n.push(e.map((e,t)=>e[r[t]]));for(let t=e.length-1;t>=0&&(r[t]++,!(r[t]<e[t].length));t--)r[t]=0}return n},xi=(e,t)=>{for(let n=e.length-1;n>=0;n--)if(e[n]<t-e.length+n){e[n]++;for(let t=n+1;t<e.length;t++)e[t]=e[t-1]+1;return!0}return!1},Si=e=>{if(typeof e!=`object`||e.kind!==`Subset`||Kn(e.base))return;let t=F(e.base).elements;if(t.length<=20)return;let n=-1,r=[0],i=e=>{for(e<=n&&(n=-1);n<e;)n===-1?r=[]:xi(r,t.length)||(r=Array.from({length:r.length+1},(e,t)=>t)),n++;return ir(r.map(e=>t[e]))},a=2**t.length,o=e=>typeof e==`string`&&/^\d+$/.test(e)&&Number(e)<a;return new Proxy([],{get:(e,t,n)=>t===`length`?a:o(t)?i(Number(t)):Reflect.get(e,t,n),has:(e,t)=>o(t)||Reflect.has(e,t)})},Ci=e=>{let t=[];for(let n=0;n<=e.length;n++){let r=Array.from({length:n},(e,t)=>t);do t.push(ir(r.map(t=>e[t])));while(xi(r,e.length))}return t},wi=(e,t,n)=>{let r=[];for(let i=0;i<e.length;i++){let a=e[i];if(Kn(a))throw new w(n(a,i));let o=t(a);if(o.length===0)return[[]];r.push(o)}return r},Ti=(e,t=e=>F(e).elements)=>{if(typeof e!=`object`)throw new w(`Expected a set but found ${L(e)}`);switch(e.kind){case`Set`:return e.elements;case`MixedSet`:return zr(e.elements);case`Interval`:{let t=ci(e);return t!==ri[t.length]&&oi.set(t,e),t}case`Subset`:{if(Ri(e.base)===0)return Ci([]);if(!dn(e.base))throw new w(`Attempted to compute the value of an expression of form\nSUBSET S, but S is a non-enumerable value:\n${N(L(e.base))}`);let t=F(e.base).elements;if(t.length>30)throw new w(Li(e));return Ci(t)}case`FunctionSet`:{if(!In&&Fi(e))return[];if(Kn(e.domain))throw new w(`Attempted to enumerate a set of the form [D -> R],but the domain D:\n${N(L(e.domain))}\ncannot be enumerated.`);let n=ui(e.domain);if((n.length>0||In)&&Kn(e.range))throw new w(`Attempted to enumerate a set of the form [D -> R],but the range R:\n${N(L(e.range))}\ncannot be enumerated.`);let r=n.length===0?[]:t(e.range);return bi(n.map(()=>r)).map(e=>or(n,e))}case`RecordSet`:{if(!In&&Fi(e))return[];let n=wi(e.sets,t,(t,n)=>`Attempted to enumerate a set of the form [l1 : v1, ..., ln : vn],\nbut can't enumerate the value of the \`${e.names[n]}' field:\n${N(L(t))}`);return bi(n).map(t=>pi(e.names.map((e,n)=>[e,t[n]])))}case`ProductSet`:{if(!In&&Fi(e))return[];let n=wi(e.factors,t,(e,t)=>`Attempted to enumerate a set of the form s1 \\X s2 ... \\X sn,\nbut can't enumerate s${t}:\n${N(L(e))}`);return bi(n).map(fi)}case`FilteredSet`:if(!dn(e.base)||Kn(e.base))throw new w(`Attempted to enumerate { x \\in S : p(x) } when S:\n${N(L(e.base))}\nis not enumerable`);return F(Xr(Ai(e.base).filter(t=>e.test(t,!1)))).elements;case`Union`:{let t=[];return _i(e).forEach((n,r)=>{let i=vi(n,r,e);if(ln(i))throw new u(sn());Ai(i).forEach(e=>cn(t,e))}),F(Xr(t)).elements}case`SetOperation`:{if(e.operator===`\\cap`&&!hi(e.left)&&!hi(e.right))throw new w(`Attempted to enumerate S \\cap T when neither S:\n${N(L(e.left))}\nnor T:\n${N(L(e.right))}\nis enumerable`);if(e.operator===`\\`&&!hi(e.left))throw new w(`Attempted to enumerate S \\ T when S:\n${N(L(e.left))}\nis not enumerable.`);if(e.operator===`\\cup`)return F(Xr(Di(e))).elements;let t=e.operator===`\\`||hi(e.left),n=t?e.left:e.right,r=t?e.right:e.left,i=[];return un(typeof n==`object`&&n.kind===`Interval`?n:Ai(n),t=>{Ji(t,r)===(e.operator===`\\cap`)&&cn(i,t)}),F(Xr(i)).elements}case`InfiniteSet`:case`SequenceSet`:throw new w(`Attempted to enumerate the non-enumerable set ${L(e)}`);default:throw new w(`Expected a set but found ${L(e)}`)}},F=e=>{if(typeof e==`object`&&e.kind===`Set`)return e;if(typeof e==`object`&&e.kind===`Interval`)return ir(Ti(e));let t=typeof e==`object`&&en(e)?e:void 0;if(t?.enumerated)return t.enumerated;let n=Gi.sets;n?.push(e);let r=Ti(e);n?.pop();let i=typeof e==`object`&&(e.kind===`MixedSet`||e.kind===`Union`||e.kind===`SetOperation`||e.kind===`FilteredSet`||e.kind===`ProductSet`||e.kind===`FunctionSet`||e.kind===`Subset`)?ir(r):Yr(r);return t&&(t.enumerated=i),i},Ei=e=>{if(!(typeof e!=`object`||dr(e)))switch(e.kind){case`MixedSet`:F(e);return;case`FilteredSet`:return hi(e.base)||F(e),Ei(e.base);case`Union`:if(!hn(e.base)&&hi(e.base))return Ei(e.base);_i(e).slice(0,1).forEach(t=>Ei(vi(t,0,e)));return;case`SetOperation`:e.operator===`\\`&&!hi(e.left)&&F(e),e.operator!==`\\cup`||hi(e.left)&&hi(e.right)||F(e),e.operator!==`\\cap`||hi(e.left)?Ei(e.left):Ei(e.right),e.operator===`\\cup`&&Ei(e.right)}},Di=e=>{if(!hi(e.left)||!hi(e.right))throw new w(`Attempted to enumerate S \\cup T when S:\n${N(L(e.left))}\nand T:\n${N(L(e.right))}\nare not both enumerable`);if(Ei(e.left),Ei(e.right),ln(e.left))throw new u(sn());let t=Ai(e.left),n=ln(e.right)?void 0:Ai(e.right);if(!n||t.length+n.length>on())throw new u(sn());return[...t,...n]},Oi=e=>{if(typeof e!=`object`||e.kind!==`SetOperation`||e.operator!==`\\cup`||e.enumerated)return F(e).elements;let t=Br(e,()=>Di(e)),n=F(Xr(t)).elements;return e.enumerated=ir(n),n},ki=(e,t)=>{if(typeof e!=`object`||dr(e))return F(e).elements.some(t);let n=Gi.sets;n?.push(e),Ei(e);let r=Pi(e,r=>{n?.pop();let i=t(r);return n?.push(e),i});return n?.pop(),r},Ai=e=>{let t=[];return ki(e,e=>(t.push(e),!1)),t},ji=e=>e.kind===`ProductSet`?e.factors:e.kind===`RecordSet`?e.sets:e.kind===`FunctionSet`?[e.range]:void 0,Mi=e=>{if(typeof e!=`object`)return!0;switch(e.kind){case`ModelValue`:case`Interval`:return!0;case`Set`:return e.elements.every(Mi);case`Function`:return e.functionClass!==`lambda`&&e.writtenKeys===void 0&&e.domain.every(Mi)&&e.range.every(Mi);case`SetOperation`:return e.operator!==`\\cup`&&Mi(e.left)&&Mi(e.right);case`FilteredSet`:return Mi(e.base);case`ProductSet`:return e.factors.every(Mi);default:return!1}},Ni=e=>typeof e!=`object`||dr(e)?!1:e.kind===`Union`?!0:e.kind===`FilteredSet`?Ni(e.base):e.kind===`SetOperation`?e.operator===`\\cup`||Ni(e.left)||Ni(e.right):ji(e)?.some(Ni)??!1,Pi=(e,t)=>{if(e.kind===`Union`)return _i(e,Ai).some((n,r)=>ki(vi(n,r,e),t));if(e.kind===`FilteredSet`&&hi(e.base))return ki(e.base,n=>e.test(n,!1)&&t(n));if(ji(e)?.some(Ni))return Ti(e,Ai).some(t);if(e.kind!==`SetOperation`)return F(e).elements.some(t);if(e.operator===`\\cup`)return!hi(e.left)||!hi(e.right)?F(e).elements.some(t):ki(e.left,t)||ki(e.right,t);let n=e.operator===`\\`||hi(e.left),r=n?e.left:e.right,i=n?e.right:e.left;return hi(r)?ki(r,n=>Ji(n,i)===(e.operator===`\\cap`)&&t(n)):F(e).elements.some(t)},Fi=e=>{if(typeof e!=`object`||!dn(e))throw Gi.sets?.push(e),new w(`Shouldn't call isEmpty() on value ${L(e)}`);switch(e.kind){case`Set`:case`MixedSet`:return e.elements.length===0;case`Interval`:return e.low>e.high;case`InfiniteSet`:if(e.name===`Any`)throw new w(`Shouldn't call isEmpty() on value ANY`);return!1;case`Subset`:case`SequenceSet`:return!1;case`ProductSet`:return e.factors.some(Fi);case`RecordSet`:return e.sets.some(Fi);case`FunctionSet`:return!Fi(e.domain)&&Fi(e.range);case`Union`:return _i(e).every((t,n)=>Fi(vi(t,n,e)));default:return F(e).elements.length===0}},Ii=(e,t,n)=>e.reduce((e,r)=>{let i=e*Ri(r,t);if(i>2147483647)throw new w(n());return i},1),Li=e=>`Overflow when computing the number of elements in:\n${N(L(e))}`,Ri=(e,t)=>{if(typeof e!=`object`)throw new w(`Attempted to compute the number of elements in the ${gn(e)} ${N(L(e))}.`);switch(e.kind){case`ModelValue`:throw new w(`Attempted to compute the number of elements in the model value ${N(L(e))}.`);case`Function`:return e.domain.length;case`LazyFunction`:return Ri(e.domain,t);case`Interval`:{let t=Math.max(0,e.high-e.low+1);if(t>2147483647)throw new w(`Size of interval value exceeds the maximum representable size (32bits): ${e.low}..${e.high}.`);return t}case`InfiniteSet`:case`SequenceSet`:throw new w(`Attempted to compute the number of elements in the overridden value ${N(L(e))}.`);case`Subset`:{let n=Ri(e.base,t);if(n>=31)throw new w(Li(e));return 2**n}case`FunctionSet`:{if(t!==`1.7.4`){if(Fi(e.domain))return 1;if(Fi(e.range))return 0;if(Ri(e.range,t)===1)return 1}let n=Ri(e.domain,t),r=Ri(e.range,t);if(r<=1)return n===0?1:r;let i=1;for(let t=0;t<n;t++)if(i*=r,i>2147483647)throw new w(Li(e));return i}case`RecordSet`:return t!==`1.7.4`&&Fi(e)?0:Ii(e.sets,t,()=>Li(e));case`ProductSet`:return t!==`1.7.4`&&Fi(e)?0:Ii(e.factors,t,()=>`Overflow when computing the number of elements in ${N(L(e))}`);default:return hr(e),F(e).elements.length}},zi=e=>`Attempted to check if the set ${N(L(e))}is finite.`,Bi=e=>{if(typeof e!=`object`||e.kind===`ModelValue`)throw new w(`Attempted to check if the ${gn(e)} ${N(L(e))} is a finite set.`);switch(e.kind){case`Set`:case`MixedSet`:case`Interval`:case`Function`:return!0;case`LazyFunction`:throw new w(`Attempted to check if the function:\n${N(L(e))}\nis a finite set.`);case`InfiniteSet`:return!1;case`SequenceSet`:return Bi(e.base)&&Fi(e.base);case`Subset`:return Bi(e.base);case`FunctionSet`:{let t=Bi(e.domain);if(t&&Fi(e.domain))return!0;let n=Bi(e.range);return n&&Fi(e.range)?!0:n&&(t||Ri(e.range)===1)}case`RecordSet`:case`ProductSet`:{let t=e.kind===`RecordSet`?e.sets:e.factors,n=!0;for(let e of t)if(!Bi(e))n=!1;else if(Fi(e))return!0;return n}case`Union`:if(!hi(e.base))throw new w(`Attempted to check if the nonenumerable set:\n${gi(e)}\nis a finite set.`);return F(e.base).elements.every(Bi);case`SetOperation`:if(e.operator===`\\cup`)return Bi(e.left)&&Bi(e.right);if(e.operator===`\\cap`){if(!Bi(e.left)&&!Bi(e.right))throw new w(zi(e));return!0}if(Bi(e.left))return!0;if(!Bi(e.right))throw new w(zi(e));return!1;case`FilteredSet`:if(!Bi(e.base))throw new w(`Attempted to check if expression of form {x \\in S : p(x)} is a finite set, but cannot check if S:\n${N(L(e.base))}\nis finite.`);return!0}},Vi=(e,t,n=$n)=>{let r=0,i=e.length-1;for(;r<=i;){let a=r+i>>1,o=n(e[a],t);if(o===0)return a;o<0?r=a+1:i=a-1}return-1},Hi=(e,t)=>{let n=e.elements;if(n.length>on())throw new u(sn());let r=Array.from({length:n.length},()=>!1),i=t.filter(e=>{let t=Vi(n,e);return!r[t]&&(r[t]=!0,!0)}),a=ir(n);return i.some((e,t)=>e!==n[t])&&(a.writtenElements=i),a},Ui=e=>{if(typeof e!=`object`||!pn(e))return;if(e.kind===`LazyFunction`&&(!dn(e.domain)||Kn(e.domain)))throw new w(`To convert a function of form [x \\in S |-> f(x)] to a tuple, the set S must be enumerable.`);let t=I(e);return t.domain.every((e,t)=>e===t+1)?t.range:void 0},Wi=(e,t)=>{let n=`Attempted to check if the value:\n${N(L(e))}\nis an element of the`;if(!pn(t))return`${n} ${gn(t)} ${N(L(t))}`;let r=lr(t);return r===`record`?`Attempted to check if element:\n${N(L(e))}\nis in the record:\n${N(L(t))}`:r===`tuple`?`Attempted to check set membership in a tuple value.`:`${n} function ${N(L(t))}`},Gi={sets:void 0},Ki=(e,t,n,r)=>{let i=Gi.sets,a=Gi.callStack,o=i?.length??0,s=a&&{...a,length:a.expressions.length};try{return e(n,r)}catch(e){if(!(e instanceof w))throw e;return i&&(i.length=o),a&&s&&(a.expressions.length=s.length,a.isFrozen=s.isFrozen,a.fingerprint=s.fingerprint),t(n,r,e)}},qi=e=>(Gi.sets??[]).slice(e).some(e=>typeof e==`object`&&Gi.callStack?.sources.has(e)===!0),Ji=(e,t)=>{let n=Gi.sets;if(n===void 0)return $i(e,t);n.push(t);let r=$i(e,t);return n.pop(),r},Yi=(e,t)=>{let n=t.elements,r=0,i=n.length-1;for(;r<=i;){let t=r+i>>1,a=n[t];if(typeof a!=`number`)return;if(a===e)return!0;a<e?r=t+1:i=t-1}return!1},Xi=(e,t)=>Vi(t.elements,e)!==-1,Zi=(e,t)=>t.isNormalized?Vr(e,t.elements).isFound:Hr(e,Ur(t)),Qi=(e,t)=>{if(e.type!==void 0)throw new w(`Attempted to check if the typed model value ${N(L(e))} is an element of\n${N(L(t))}`);return!1},$i=(e,t)=>{if(typeof e==`number`&&typeof t==`object`){if(t.kind===`Set`)return Yi(e,t)??ea(e,t);if(t.kind===`Interval`)return e>=t.low&&e<=t.high}return ea(e,t)},ea=(e,n)=>{if(!dn(n))throw new w(Wi(e,n));switch(n.kind){case`Set`:return hr(e),Ki(Xi,Zi,e,n);case`MixedSet`:return Hr(e,n.elements);case`Interval`:if(typeof e==`number`)return e>=n.low&&e<=n.high;if(n.low<=n.high&&(!mn(e)||e.type!==void 0))throw new w(`Attempted to check if the value:\n${N(L(e))}\nis in the integer interval ${N(L(n))}`);return!1;case`InfiniteSet`:if(n.name===`Any`)return!0;if(mn(e))return Qi(e,n);if(!(n.name===`STRING`?typeof e==`string`:typeof e==`number`))throw new t(`Attempted to check if the value:\n${N(L(e))}\nis an element of ${n.name}.`);return n.name!==`Nat`||typeof e==`number`&&e>=0;case`Subset`:if(!dn(e)||Kn(e))throw new w(`Attempted to check if the non-enumerable value\n${N(L(e))}\nis element of\n${N(L(n))}`);return F(e).elements.every(e=>Ji(e,n.base));case`FunctionSet`:{if(!pn(e)){if(mn(e))return Qi(e,n);throw new w(`Attempted to check if \n${L(e)}\nwhich is not a TLC function value, is in the set of functions:\n${N(L(n))}`)}let t=I(e),r=Cr(e,t.domain);return(r===void 0?Kr(n.domain,ir(t.domain)):Kr({kind:`Interval`,low:r,high:r+t.domain.length-1},n.domain))&&t.range.every(e=>Ji(e,n.range))}case`RecordSet`:{let t=pn(e)?I(e):void 0;if(!t||!Tn(t.domain)){if(mn(e))return Qi(e,n);throw new w(`Attempted to check if non-record\n${L(e)}\nis in the set of records:\n${N(L(n))}`)}return t.domain.length===n.names.length&&n.names.every((e,r)=>{let i=Vi(t.domain,e);return i!==-1&&Ji(t.range[i],n.sets[r])})}case`ProductSet`:{let t=pn(e)?Ui(e):void 0;if(t===void 0){let t=pn(e)&&I(e).domain.every(e=>typeof e==`number`);if(mn(e))return Qi(e,n);if(t)return!1;throw new w(`Attempted to check if non-tuple\n${N(L(e))}\nis in the set of tuples:\n${N(L(n))}`)}return t.length===n.factors.length&&t.every((e,t)=>Ji(e,n.factors[t]))}case`FilteredSet`:try{return Ji(e,n.base)&&n.test(e,!0)}catch(t){throw!(t instanceof w)||!Ft(t)?t:new w(`Cannot decide if element:\n${N(L(e))}\n is element of:\n${N(L(n.base))}\nand satisfies the predicate ${n.source?.predicate}`)}case`Union`:{if(!hi(n.base))throw new w(`Attempted to check if:\n ${N(L(e))}\nis an element of the non-enumerable set:\n ${N(gi(n))}`);let t=F(n.base).elements;return t.length>1&&t.forEach(e=>{typeof e==`object`&&e.kind===`Set`&&(e.isNormalized=!0)}),t.some(t=>Ji(e,t))}case`SetOperation`:return n.operator===`\\cup`?Ji(e,n.left)||Ji(e,n.right):Ji(e,n.left)&&Ji(e,n.right)===(n.operator===`\\cap`);case`SequenceSet`:{let r=Ui(e);if(r===void 0){if(mn(e))return Qi(e,n);throw new t(`Attempted to check if the value:\n${N(L(e))}\nis an element of ${N(L(n))}.`)}return r.every(e=>Ji(e,n.base))}default:throw new w(Wi(e,n))}},ta=(e,t,n)=>e===t?!0:typeof e!=`object`||typeof t!=`object`||typeof n!=`object`||e.kind!==`Function`||t.kind!==`Function`||n.kind!==`FunctionSet`||e.domain!==t.domain?Ji(e,n):e.range.every((e,r)=>ta(e,t.range[r],n.range)),I=e=>{if(typeof e==`object`&&e.kind===`Function`)return e;if(typeof e==`object`&&e.kind===`LazyFunction`){if(e.enumerated)return e.enumerated;if(P(e.domain)||Ri(e.domain),!dn(e.domain))throw new w(`The domains of formal parameters must be enumerable.`);let t=ui(e.domain);return e.enumerated=or(t,t.map(t=>e.apply(t))),e.enumerated}throw new w(`Expected a function but found ${L(e)}`)},na=(e,t,n)=>{let r=N(L(e)),i=N(L(t)),a=n===`1.7.4`;switch(lr(e)){case`lambda`:return`In applying the function\n${r},\nthe first argument is:\n${i}\nwhich is not in its domain.\n`;case`tuple`:return typeof t==`number`?a?`Attempted to apply tuple\n${r}\nto integer ${t} which is out of domain.`:`Attempted to access index ${t} of tuple\n${r}\nwhich is out of bounds.`:a?`Attempted to apply tuple to a non-integer argument.`:`Attempted to access tuple at a non integral index: ${i}`;case`record`:return typeof t==`string`?a?`Attempted to apply the record\n${r}\nto nonexistent record field ${t}.`:`Attempted to access nonexistent field '${t}' of record\n${r}`:a?`Attempted to apply record to a non-string value ${i}.`:`Attempted to access record by a non-string argument: ${i}`;default:return`Attempted to apply function:\n${r}\nto argument ${i}, which is not in the domain of the function.`}},ra=(e,t)=>{if(!In)return na(e,t);let n=N(L(t));return lr(e)===`tuple`?`Attempted to apply tuple to a non-integer argument ${n}.`:`Attempted to apply record to a non-string argument ${n}.`},ia=(e,t)=>{let n=e[0];if(typeof t==`number`&&typeof n==`number`){let r=t-n;if(e[r]===t)return r}return e.length<=8?e.indexOf(t):-1},aa=e=>new w(`Attempted to apply function with integer domain to the non-integer argument ${N(L(e))}`),oa=(e,t)=>Vi(e.domain,t),sa=(e,t,n)=>{let r=bn(e);throw In||r!==e.domain||r.length<32?r.forEach(e=>Rr(e,t)):Vi(r,t,Lr),n},ca=(e,t,n)=>{let r=e.domain;if(typeof t!=typeof r[0]){let i=lr(e),a=i===`tuple`?`number`:i===`record`?`string`:void 0;if(a!==void 0&&typeof t!==a)throw new w(n(e,t));if(a===void 0&&!In&&typeof t!=`number`&&li(r))throw aa(t)}let i=ia(r,t);return i===-1?Ki(oa,sa,e,t):i},la=(e,t,n,r)=>`In applying the function\n${N(L(e))},\nthe ${t} is:\n${N(L(n))}\nwhich ${r}.\n`,ua=(e,t)=>new w(la(e,`argument list`,t,`does not match its formal parameter`)),da=(e,t,n)=>{let r=e.domain,i=Ui(n);if(i===void 0)throw ua(e,n);if(typeof r!=`object`||r.kind!==`ProductSet`)throw new w(`Attempted to apply a function to ${L(n)}, which is not in its domain`);if(t.forEach((t,a)=>{if(a>=i.length)throw ua(e,n);let o=i[a],s=`argument number ${a+1}`;if(!Ji(o,r.factors[a]))throw new w(la(e,s,o,t===void 0?`is not in the function's domain ${L(r)}`:`is not in its domain`));if(t!==void 0&&Ui(o)?.length!==t)throw new w(la(e,s,o,`does not match its formal parameter`))}),i.length>t.length)throw ua(e,n)},fa=(e,t)=>e.lambdaDomain!==void 0&&e.hash===0&&e.fingerprint===0&&!Ji(t,e.lambdaDomain),pa=(e,t,n)=>{if(typeof e==`object`&&e.kind===`LazyFunction`){if(e.enumerated)return pa(e.enumerated,t,n);let r=e.boundTupleLengths;if(r!==void 0)return da(e,r,t),e.apply(t);if(!Ji(t,e.domain))throw new w(lr(e)===`lambda`?na(e,t):`Attempted to apply a function to ${L(t)}, which is not in its domain`);return e.apply(t)}if(typeof e!=`object`||e.kind!==`Function`)throw new w(`Attempted to apply ${L(e)}, which is not a function`);let r=n??na;if(fa(e,t))throw new w(r(e,t));let i=ca(e,t,r);if(i===-1)throw new w(r(e,t));return e.range[i]},ma=e=>li(e)?oi.get(e)??di(e.length):void 0,ha=e=>{if(typeof e==`object`&&e.kind===`LazyFunction`)return e.domain;let t=I(e);if(t.functionClass===`lambda`&&t.lambdaDomain)return t.lambdaDomain;let n=ma(t.domain);if(n)return n;let r=ir(t.domain);return t.functionClass===`record`?(t.writtenKeys&&(r.writtenElements=t.writtenKeys),r):(r.isNormalized=!0,r)},ga=(e,t,n,r=!1)=>{if(typeof e==`object`&&e.kind===`LazyFunction`&&(r||e.enumerated===void 0)){if(e.boundTupleLengths!==void 0&&Ui(t)===void 0)throw ua(e,t);if(!Ji(t,e.domain))return e;let r=n(e.apply(t));return cr({kind:`LazyFunction`,domain:e.domain,apply:n=>Kr(t,n)?r:e.apply(n),source:e.source,boundTupleLengths:e.boundTupleLengths},lr(e))}if(!pn(e))throw new w(`Attempted to apply EXCEPT construct to the value ${N(L(e))}.`);let i=I(e);if(fa(i,t))return i;let a=ca(i,t,ra);if(a===-1)return i;let o=[...i.range],s=i.range[a],c=n(s);o[a]=c;let l=cr(or(i.domain,o),lr(i));if(l.writtenKeys=i.writtenKeys,l.lambdaDomain=i.lambdaDomain,i.hash!==0&&i.hash!==Sa){let e=Da(c);if(e!==Sa){let t=Da(i.domain[a]);l.hash=s===c?i.hash:i.hash-xa(t,Da(s))+xa(t,e)|0}}if(i.fingerprint!==0){let e=i.domain[a];l.fingerprint=s===c?i.fingerprint:i.fingerprint-ja(e,s)+ja(e,c)|0}return l},_a=e=>{let t=Math.imul(e^e>>>16,2246822507),n=Math.imul(t^t>>>13,3266489909);return n^n>>>16},va=(e,t)=>Math.imul(e^t,16777619),ya=e=>{let t=2166136261;for(let n=0;n<e.length;n++)t=Math.imul(t^e.charCodeAt(n),16777619);return _a(t)},ba=e=>_a(e+2654435769|0),xa=(e,t)=>_a(Math.imul(e,668265261)+t|0),Sa=795548749,Ca=e=>{if(e.kind===`Set`){let t=e.elements,n=1940243425;for(let e=0;e<t.length;e++){let r=Da(t[e]);if(r===Sa)return Sa;n=n+ba(r)|0}return n}let t=1725019383;for(let n=0;n<e.domain.length;n++){let r=Da(e.domain[n]),i=Da(e.range[n]);if(r===Sa||i===Sa)return Sa;t=t+xa(r,i)|0}return t},wa=e=>{if(typeof e!=`object`||e.kind===`ModelValue`)return;if(e.kind===`InfiniteSet`||e.kind===`SequenceSet`)throw new w(`TLC has found a state in which the value of a variable contains ${N(L(e))}`);if(dn(e)){F(e).elements.forEach(wa);return}let t=I(e);t.domain.forEach(wa),t.range.forEach(wa)},Ta=e=>{if(typeof e==`object`&&e.kind!==`ModelValue`)try{Da(e)===Sa&&wa(e);return}catch(e){if(!(e instanceof w))throw e;return e}},Ea=e=>{switch(e.kind){case`Set`:case`MixedSet`:return e.elements;case`Function`:return[...e.domain,...e.range];case`Subset`:case`SequenceSet`:case`FilteredSet`:case`Union`:return[e.base];case`FunctionSet`:return[e.domain,e.range];case`RecordSet`:return e.sets;case`ProductSet`:return e.factors;case`SetOperation`:return[e.left,e.right];case`LazyFunction`:return[e.domain];default:return[]}},Da=e=>typeof e==`number`?_a(e^1540483477):typeof e==`boolean`?e?729683222:682545830:typeof e==`string`?ya(e):e.kind===`Set`||e.kind===`Function`?(e.hash===0&&(e.hash=Ca(e)),e.hash):e.kind===`ModelValue`?e.hash:e.kind===`LazyFunction`?P(e.domain)?Da(I(e)):Sa:P(e)?Da(F(e)):Sa,Oa=e=>{let t=Math.imul(e^e>>>15,739982445),n=Math.imul(t^t>>>12,695872825);return n^n>>>15},ka=e=>{let t=2538058380;for(let n=0;n<e.length;n++)t=Math.imul(t^e.charCodeAt(n),1540483477);return Oa(t)},Aa=e=>Oa(Na(e)+2135587861|0),ja=(e,t)=>Oa(Math.imul(Na(e),374761393)+Na(t)|0),Ma=e=>{if(e.kind===`Set`){let t=e.elements,n=461845907;for(let e=0;e<t.length;e++)n=n+Aa(t[e])|0;return n}let t=1291169091;for(let n=0;n<e.domain.length;n++)t=t+ja(e.domain[n],e.range[n])|0;return t},Na=e=>typeof e==`number`?Oa(e^1759714724):typeof e==`boolean`?e?1000000007:521288629:typeof e==`string`?ka(e):e.kind===`Set`||e.kind===`Function`?(e.fingerprint===0&&(e.fingerprint=Ma(e)),e.fingerprint):e.kind===`ModelValue`?e.fingerprint:e.kind===`LazyFunction`?Na(I(e)):P(e)?Na(F(e)):ka(Pa(e)),Pa=e=>typeof e==`boolean`?e?`T`:`F`:typeof e==`number`?String(e):typeof e==`string`?JSON.stringify(e):Fa(e),Fa=e=>{if(e.kind===`ModelValue`)return`@${e.name}`;if(e.kind===`InfiniteSet`)return`<${e.name}>`;if(e.kind===`SequenceSet`)return`<Seq ${Pa(e.base)}>`;if(e.kind===`FilteredSet`&&!P(e))throw new w(`Attempted to compare the non-enumerable set ${L(e)} with another value`);if(dn(e))return P(e)?`{${F(e).elements.map(Pa).join(`,`)}}`:`<${e.kind} ${L(e)}>`;let t=I(e);return`(${t.domain.map((e,n)=>`${Pa(e)}:${Pa(t.range[n])}`).join(`,`)})`},Ia={'"':`\\"`,"\\":`\\\\`," ":`\\t`,"\n":`\\n`,"\f":`\\f`,"\r":`\\r`},La=e=>`"${e.replace(/["\\\t\n\f\r]/g,e=>Ia[e])}"`,Ra=1999,za=e=>e.reduce((e,t)=>e===0?0:e*Ri(t),1),Ba=e=>{if(e.kind===`Subset`)return Ri(e.base)<=6?F(e):void 0;if(e.kind===`SetOperation`||e.kind===`FilteredSet`||e.kind===`Union`)return F(e);if(e.kind===`FunctionSet`){let t=Fi(e.domain)?0:Ri(e.domain);return(t===0?1:Ri(e.range)**t)<=Ra?F(e):void 0}return za(e.kind===`RecordSet`?e.sets:e.factors)<=Ra?F(e):void 0},Va=(e,t)=>{if(t||e.kind===`Union`||e.kind===`Subset`&&pn(e.base)&&(e.base.kind===`Function`||P(e.base.domain)))return Ba(e);if(P(e))try{return Ba(e)}catch(e){if(e instanceof w)return;throw e}},Ha=(e,t)=>{let n=e=>L(e,t);switch(e.kind){case`Subset`:return typeof e.base==`object`&&e.base.kind===`Interval`?`SUBSET (${n(e.base)})`:`SUBSET ${n(e.base)}`;case`FunctionSet`:return`[${n(e.domain)} -> ${n(e.range)}]`;case`RecordSet`:return`[${e.names.map((t,r)=>`${t}: ${n(e.sets[r])}`).join(`, `)}]`;case`ProductSet`:return`(${e.factors.map(n).join(` \\X `)})`;case`SetOperation`:return`${n(e.left)} ${e.operator} ${n(e.right)}`;case`FilteredSet`:return e.source?`{${e.source.names} \\in ${n(e.base)} : <expression ${e.source.predicate}> }`:`{x \\in ${n(e.base)} : ...}`;case`Union`:return gi(e,t)}},Ua=e=>/^[\p{L}\p{Nd}_]*$/u.test(e)&&/\p{L}/u.test(e)&&(e.length<4||!/^[WS]F_/.test(e)),Wa=e=>{if(P(e.domain))try{return I(e)}catch(e){if(e instanceof w||b(e))return;throw e}},Ga=e=>{let t=[],n=[],r=[],i=(e,a,o)=>{if(typeof e!=`object`)return;let s=e=>i(e,a,!1);switch(e.kind){case`Set`:if(e.elements.forEach(s),e.isNormalized)return;e.isNormalized=!0,t.push(e);return;case`MixedSet`:e.elements.forEach(s),F(e);return;case`Function`:{let t=a||lr(e)===`lambda`;if(e.range.forEach(e=>i(e,t,o)),a||e.writtenKeys===void 0)return;n.push([e,e.writtenKeys]),e.writtenKeys=void 0;return}case`LazyFunction`:if(e.enumerated)return i(e.enumerated,!0,o);o&&r.push(e),s(e.domain);return;case`SetOperation`:s(e.left),s(e.right);return;case`FunctionSet`:s(e.domain),s(e.range);return;case`RecordSet`:e.sets.forEach(s);return;case`ProductSet`:e.factors.forEach(s);return;case`Subset`:case`Union`:case`FilteredSet`:case`SequenceSet`:s(e.base);return;default:return}};try{return e.forEach(e=>i(e,!1,!0)),e.map(e=>L(e,!0,!0))}finally{t.forEach(e=>{e.isNormalized=!1}),r.forEach(e=>{e.enumerated=void 0}),n.forEach(e=>{e[0].writtenKeys=e[1]})}},L=(e,t=!1,n=!1)=>{let r=e=>L(e,t,n);if(typeof e==`boolean`)return e?`TRUE`:`FALSE`;if(typeof e==`number`)return String(e);if(typeof e==`string`)return La(e);switch(e.kind){case`ModelValue`:return e.name;case`Set`:return`{${e.elements.map(r).join(`, `)}}`;case`MixedSet`:return r(F(e));case`Interval`:return e.low<=e.high?`${e.low}..${e.high}`:`{}`;case`InfiniteSet`:return e.name===`Any`?`ANY`:e.name;case`Subset`:case`FunctionSet`:case`RecordSet`:case`ProductSet`:case`SetOperation`:case`FilteredSet`:case`Union`:{let n=Ln.isExpanded?Va(e,t):void 0;return n?r(n):Ha(e,t)}case`SequenceSet`:return`Seq(${r(e.base)})`;case`Function`:case`LazyFunction`:{let i=e.kind===`LazyFunction`?Ln.isExpanded||!e.source?Wa(e):void 0:e;if(i===void 0){let t=e.kind===`LazyFunction`?e.source:void 0;return t?`[${t.parameters.map(e=>`${e.name} \\in ${L(e.domain)}`).join(`, `)} |-> <expression ${t.body}>]`:`<function>`}if(i.domain.length===0&&In&&lr(e)!==`tuple`)return`<< >>`;let a=r=>L(r,t,n&&lr(e)!==`lambda`);if(i.domain.length===0&&lr(e)===`record`)return`[]`;if(i.domain.every((e,t)=>e===t+1))return`<<${i.range.map(a).join(`, `)}>>`;let o=n?i.domain.map((e,t)=>[e,i.range[t]]):Sn(i);return lr(e)===`record`||i.domain.every(e=>typeof e==`string`&&Ua(e))?`[${o.map(e=>`${String(e[0])} |-> ${a(e[1])}`).join(`, `)}]`:`(${o.map(e=>`${r(e[0])} :> ${a(e[1])}`).join(` @@ `)})`}}},Ka=(e,t)=>{if(e===void 0)return!1;try{return _r(e,t)}catch(e){if(e instanceof w)return!1;throw e}},qa=/%(\d+\$)?([-#+ 0,(<]*)(\d+)?(\.\d+)?(.?)/gs,Ja=(e,t)=>{let n=0,r=-1,i=!0,a=e.replace(qa,(e,a,o=``,s,c,l=``)=>{let u=e=>o.includes(`-`)?e.padEnd(Number(s)):e.padStart(Number(s??0)),d=o.includes(`<`),f=o.replace(`<`,``);if(l===`n`&&e===`%n`)return`
74
74
  `;if(l===`%`&&c===void 0&&/^-?$/.test(f))return f===`-`&&s===void 0&&(i=!1),u(`%`);let p=d?r:a===void 0?n++:Number(a.slice(0,-1))-1;r=p;let m=t[p];if(!`sSbBhH`.includes(l)||l===``||!/^-?$/.test(f)||f===`-`&&s===void 0||m===void 0)return i=!1,e;let h=l.toLowerCase(),g=h===`s`?m:h===`b`?`true`:(gt(m)>>>0).toString(16),_=u(c===void 0?g:g.slice(0,Number(c.slice(1))));return l===h?_:_.toUpperCase()});return i?a:void 0},Ya=(e,t)=>{let n=t?void 0:zn.get(e);if(n)return n();let r=Object.entries(e),i=Vn.get(e),a=i!==void 0&&`_format`in e,o=a?e._format:r.length===1?`%s = %s
75
75
  `:`/\\ %s = %s
76
- `;if(typeof o!=`string`)throw new _(`The _format field of the ALIAS ${i} is ${L(o)}, but it must be a string.`);return r.filter(e=>!(a&&e[0]===`_format`)).filter(e=>!t||!Ka(t[e[0]],e[1])).map(e=>{let t=Ja(o,[e[0],N(L(e[1]))]);if(t===void 0)throw new _(`The _format field of the ALIAS ${i} is ${L(o)}, but it must format two strings, the name and the value of a field.`);return t}).join(``)},Xa=[10454148508367108822n,15747411856486957441n,13848313129918172575n,15427004735118145554n,14338780731064426356n,15931650522396165332n,17670238537108149059n,12816660938095048951n,13192168525635896882n,16119298732711755075n,13564417994159519395n,15831473429641889162n,17671735485712653535n,14582471876431321160n,9288673424107444897n,12345523232675890545n,13774063780198914517n,10636128657019767374n,13227535641082688945n,10085966873248490402n,17056045221983369811n,18027133543548002442n,13033986364717636900n,12663388180492401538n,11007194744055901935n,16251515628090973732n,18046429724439772544n,9876734796024595817n,14949643787442512870n,16960057143726945461n,10590203213448744021n,12248592797044284137n,9558805810925624286n,16993321702164258530n,11754329512098378960n,12074934892440206921n,15696745233288286746n,10531590977001201739n,18107999685377398317n,12149369488538049728n,12923655455904407421n,10507099144397364930n,17322088528956367024n,14653973644796244054n,15165509594857513400n,13554280709034297251n,16228911470502883382n,17115369786458865383n,11179220607102683830n,16708422618246866334n,12295941796329322556n,18336630348474106240n,13989616001589685348n,14822072159597151759n,14264172520427195041n,11642530518213145397n,11877331515501935358n,13913116192159715440n,17054474839259161580n,13461230878584418056n,16058025410470398786n,11100471369705097435n,11133782763824505275n,13192312712502684421n,17456091706045076157n,13237272598629075916n,12914531898895761383n,15801841604014567326n,16446055517513626294n,16780923767715884464n,15104658705803254918n,10882049990920163451n,12728112724252049190n,11720209067562733740n,16476221075563830086n,16602801460297162326n,16206898064012585915n,12158475401238648099n,13742285336487677729n,15543703592025073839n,9615783578189153721n,16710542608962839044n,11960730242263336692n,13328718558362718101n,12971616006464047952n,17057853503483465676n,16180230282101315295n,15483523553568578902n,17773465781871025571n,18047252642493037509n,11580640560664688668n,10121963531818974651n,14218267149826330657n,12715294421139777506n,10584764766358778171n,12666843443693621286n,17403948736867619210n,17907955559063099692n,15179434392748515198n,15413469521140985247n,13455040338347572751n,15419348191054617477n,12340568220039846914n,13236419189535069162n,18074463254581147189n,10818750974828329405n,9859349269386152082n,15035006154709018396n,13627907273947709876n,9549035931546940138n,16199589727945564820n,10285831968679942330n,17737018494601061698n,15477896647372134857n,13595764249822586512n,10556855812148546550n,12421897615105552821n,15477767459253848096n,17421607461439241175n,12409061346569762725n,13621778224251023638n,10680972825126675886n,16494492050207190715n,16801324317763555620n,12664650400804916358n,16134230614391269483n,10027806175083075147n,9259037851175017999n,11803214621941906429n,9537357587847606069n,10517495000576890277n];let Za=Xa[0];const Qa=()=>Za,$a=/* @__PURE__ */ new Int32Array(256),eo=/* @__PURE__ */ new Int32Array(256),to=/* @__PURE__ */ new Int32Array(256),no=/* @__PURE__ */ new Int32Array(256),ro=/* @__PURE__ */ new Int32Array(256),io=/* @__PURE__ */ new Int32Array(256),ao=/* @__PURE__ */ new Int32Array(256),oo=/* @__PURE__ */ new Int32Array(256);let so=0,co=0,lo=0,uo=0;const fo=e=>{let t=(e^uo)&255;uo=(uo>>>8|lo<<24)^ro[t],lo=lo>>>8^$a[t]},po=e=>{let t=Xa[e];Za=t;let n=[];for(let e=1n<<63n;n.length<72;)n.push(e),e=e>>1n^((e&1n)==0n?0n:t);let r=n.slice(64,72).reverse();for(let e=0;e<256;e++){let t=r.reduce((t,n,r)=>e>>r&1?t^n:t,0n);$a[e]=Number(BigInt.asIntN(32,t>>32n)),ro[e]=Number(BigInt.asIntN(32,t))}let i=[$a,eo,to,no],a=[ro,io,ao,oo];for(let e=1;e<4;e++){let t=i[e-1],n=a[e-1];for(let r=0;r<256;r++){let o=n[r]&255;a[e][r]=(n[r]>>>8|t[r]<<24)^ro[o],i[e][r]=t[r]>>>8^$a[o]}}so=Number(BigInt.asIntN(32,t>>32n)),co=Number(BigInt.asIntN(32,t))};po(0);const mo=e=>{let t=uo^e,n=t&255,r=t>>>8&255,i=t>>>16&255,a=t>>>24;uo=lo^oo[n]^ao[r]^io[i]^ro[a],lo=no[n]^to[r]^eo[i]^$a[a]},ho=e=>{if(typeof e==`boolean`)return fo(0),fo(e?116:102),2;if(typeof e==`number`)return fo(1),mo(e),5;if(typeof e==`string`){fo(3),mo(e.length);let t=e.length&-4;for(let n=0;n<t;n+=4)mo(e.charCodeAt(n)&255|(e.charCodeAt(n+1)&255)<<8|(e.charCodeAt(n+2)&255)<<16|(e.charCodeAt(n+3)&255)<<24);for(let n=t;n<e.length;n++)fo(e.charCodeAt(n));return 5+e.length}return fo(21),mo(Wn(e.name)+1),5},go=e=>{let t=lo,n=uo;lo=0,uo=0;let r=[ho(e),lo,uo];return lo=t,uo=n,r},_o=e=>`m = (${e} ^ l) & 255; l = ((l >>> 8) | (h << 24)) ^ L0[m]; h = (h >>> 8) ^ H0[m];`,vo=e=>`m = l ^ ${e}; l = h ^ L3[m & 255] ^ L2[(m >>> 8) & 255] ^ L1[(m >>> 16) & 255] ^ L0[m >>> 24]; h = H3[m & 255] ^ H2[(m >>> 8) & 255] ^ H1[(m >>> 16) & 255] ^ H0[m >>> 24];`,yo={integer:e=>`${_o(`1`)} ${vo(e)}`,boolean:e=>`${_o(`0`)} ${_o(`(${e} ? 116 : 102)`)}`,set:e=>`${_o(`5`)} ${vo(e)}`,function:e=>`${_o(`9`)} ${vo(e)}`,scalar:(e,t,n)=>`{ let r = ${e}; for (; r >= 4; r -= 4) { ${vo(`0`)} } for (; r > 0; r--) { ${_o(`0`)} } h ^= ${t}; l ^= ${n}; }`},bo=()=>({H0:$a,H1:eo,H2:to,H3:no,L0:ro,L1:io,L2:ao,L3:oo,initialHigh:so,initialLow:co}),xo=(e,t)=>{let n=lo,r=uo;uo=e[0],lo=e[1],wo(t),e[0]=uo,e[1]=lo,lo=n,uo=r},So=e=>{fo(5),mo(e)},Co=e=>{fo(9),mo(e)},wo=e=>{if(typeof e!=`object`||mn(e))ho(e);else if(pn(e)){let t=I(e);Co(t.domain.length);for(let e=0;e<t.domain.length;e++)wo(t.domain[e]),wo(t.range[e])}else{let t=F(e).elements;So(t.length);for(let e of t)wo(e)}},To=e=>{let t=lo,n=uo;lo=so,uo=co;for(let t of e)wo(t);let r=BigInt(lo>>>0)<<32n|BigInt(uo>>>0);return lo=t,uo=n,r},Eo=(e,t)=>{let n=new BigInt64Array(e),r=new Int32Array(n.buffer),i=lo,a=uo;for(let n=0;n<e;n++)lo=so,uo=co,t(n),r[2*n]=uo,r[2*n+1]=lo;return lo=i,uo=a,n},Do=(e,t)=>Eo(e.length,n=>{for(let r of t)wo(e[n][r])}),Oo=/* @__PURE__ */ new Set([`FiniteSets`,`Sequences`,`Bags`,`Naturals`,`Integers`,`Reals`,`RealTime`,`Randomization`,`TLC`]),ko=1024,Ao=e=>({current:-1,expressions:[],ranges:[],firstChild:[],lastChild:[],nextSibling:[],prefixes:[],isPart:[],isPrimed:[],isUnchanged:[],recursive:[],lets:[],roots:[],primary:[],secondary:[],covered:/* @__PURE__ */ new WeakSet,values:/* @__PURE__ */ new WeakMap,registers:new Uint8Array(e*ko),relations:[]}),jo=(e,t,n,r,i)=>{let a=e.expressions.length;if(e.expressions.push(t),e.ranges.push(n),e.firstChild.push(-1),e.lastChild.push(-1),e.nextSibling.push(-1),e.prefixes.push(-1),e.isPart.push(i),e.isPrimed.push(!1),e.isUnchanged.push(t?.kind===`Unchanged`),e.recursive.push(-1),e.lets.push(void 0),e.roots.push(r===-1?a:e.roots[r]),e.primary.push(0),e.secondary.push(0),t&&e.covered.add(t),r===-1)return a;let o=e.lastChild[r];return o===-1&&(e.firstChild[r]=a),o!==-1&&(e.nextSibling[o]=a),e.lastChild[r]=a,a},Mo=(e,t,n)=>e.relations.find(e=>e.kind===t&&e.expression===n)?.node,No=(e,t,n,r,i)=>{let a=t===`next`?Mo(e,t,r):void 0;if(a!==void 0)return a;let o=jo(e,void 0,r.location.range,-1,!1);return e.relations.push({kind:t,label:n,expression:r,scope:i,node:o}),o},Po=(e,t)=>e!==void 0&&t!==void 0&&e.module===t.module&&e.start.line===t.start.line&&e.start.column===t.start.column&&e.end.line===t.end.line&&e.end.column===t.end.column,Fo=(e,t,n)=>{let r=e===void 0?void 0:n.definitions.get(e),i=r?.kind===`Operator`?r.head:void 0,a=t.location.range;return!r||!i?`Action ${a?g(a):`Unknown location`}`:Po(r.body.location.range,a)||!a?`${r.name} ${g(i)}`:`${r.name} ${g(i)} (${a.start.line} ${a.start.column} ${a.end.line} ${a.end.column})`},Io=e=>`${e.module}:${e.start.line}:${e.start.column}:${e.end.line}:${e.end.column}`,Lo=(e,t)=>e&&t?{module:e.module,start:e.start,end:t.end}:void 0,Ro=(e,t)=>t&&{module:t.module,start:e.range?.start??{line:e.line,column:e.column},end:t.end},zo=e=>{let t=Array.from({length:11},()=>[]);return e.forEach((e,n)=>{if(n>=Math.floor(t.length*.75)){let e=Array.from({length:t.length*2+1},()=>[]);for(let n=t.length-1;n>=0;n--)t[n].forEach(t=>e[(gt(t.name)&2147483647)%e.length].unshift(t));t=e}t[(gt(e.name)&2147483647)%t.length].unshift(e)}),t.toReversed().flat()},Bo=e=>e.flatMap((t,n)=>n>0&&e[n-1].set===t.set?[]:[t.set]),Vo=(e,t)=>e.reduce((e,t)=>({name:t,definition:void 0,scope:void 0,parent:e}),t),Ho=e=>e.flatMap(e=>e.pattern.kind===`Name`?[e.pattern.name]:e.pattern.names),Uo=(e,t,n)=>{let r=new Set(n.map(Io)),i=[],a=[],o=[],s=/* @__PURE__ */ new Map,c=(e,n,r)=>{if(M(e)){for(let e=r;e;e=e.parent)if(e.name===n)return e.definition&&{definition:e.definition,scope:e.scope};return}let i=t.substitutions.get(n)??n;if(t.variableIndex.has(i)||t.constants.has(i))return;let a=t.definitions.get(i),o=a?.location.range?.module??a?.body.location.range?.module;return a&&!Oo.has(o??``)?{definition:a,scope:void 0}:void 0},l=(t,n,o,c=!1,l)=>{let u=jo(e,t,n,i.at(-1)??-1,c);e.isPrimed[u]=n!==void 0&&r.has(Io(n));let d=t&&s.get(t);if(d&&i.forEach(t=>{e.expressions[t]===d&&(e.lets[t]??=[]).push(u)}),l?.kind===`Operator`&&l.isRecursive){let t=i.findLast(e=>a[e]===l);t!==void 0&&(e.recursive[u]=t)}return a[u]=l,i.push(u),o(),i.pop(),u},u=e=>{let t=e.definition;if(o.includes(t))return;o.push(t);let n=t.kind===`Function`?Ho(t.bounds):t.params.map(e=>e.name);m(t.body,Vo(n,e.scope)),t.kind===`Function`&&Bo(t.bounds).forEach(t=>m(t,e.scope)),o.pop()},d=e=>e?.definition.kind===`Operator`&&e.definition.params.length>0,f=(e,t,n,r)=>{if(e.kind===`Lambda`)m(e.body,Vo(e.params,r));else{if(e.kind===`Identifier`){let i=c(e,e.name,r);if(n?.kind===`Operator`&&(n.params[t]?.arity??0)>0||d(i)){i&&u(i);return}}m(e,r)}},p=(t,n,r,a)=>l(n===t.operands.length?t:void 0,r,()=>{let o=t.operands;if(n>2&&!t.isBulleted){let s=t.prefixEnds?.[n-3],c=p(t,n-1,r&&s?{...r,end:s}:r,a);e.prefixes[i.at(-1)??-1]=c,m(o[n-1],a)}else o.slice(0,n).forEach(e=>m(e,a))},n<t.operands.length),m=(e,t)=>{let n=e.location.range,r=e=>e.forEach(e=>m(e,t));switch(e.kind){case`Number`:case`Decimal`:case`String`:case`ExceptAt`:case`Bracket`:case`Subexpression`:case`OperatorReference`:return;case`Label`:case`Lambda`:m(e.body,Vo(e.params,t));return;case`Let`:{let n=e.definitions.reduce((e,t)=>({name:t.name,definition:t,scope:void 0,parent:e}),t);for(let e=n;e!==t&&e;e=e.parent)e.scope=n;e.definitions.forEach(t=>{t.kind===`Operator`&&s.set(t.body,e.body)}),zo(e.definitions).forEach(e=>u({definition:e,scope:n})),m(e.body,n);return}case`Identifier`:{let r=c(e,e.name,t);l(e,n,()=>{r&&u(r)},!1,r?.definition);return}case`Apply`:{let r=c(e,e.operator,t);l(e,n,()=>{r&&u(r),e.args.forEach((e,n)=>f(e,n,r?.definition,t))},!1,r?.definition);return}case`And`:case`Or`:p(e,e.operands.length,n,t);return;case`Case`:l(e,n,()=>{e.arms.forEach(e=>l(void 0,Lo(e.condition.location.range,e.body.location.range),()=>r([e.condition,e.body]),!0));let n=e.other;n&&l(void 0,e.otherRange,()=>m(n,t),!0)});return;case`Record`:case`RecordSet`:l(e,n,()=>e.fields.forEach(e=>l(void 0,Ro(e.location,e.value.location.range),()=>m(e.value,t),!0)));return;case`FunctionApplication`:l(e,n,()=>{m(e.function,t);let n=e.args;n.length===1?m(n[0],t):l(void 0,Lo(n[0]?.location.range,n.at(-1)?.location.range),()=>r(n),!0)});return;case`Forall`:case`Exists`:case`FunctionConstruction`:l(e,n,()=>{m(e.body,Vo(Ho(e.bounds),t)),r(Bo(e.bounds))});return;case`SetMap`:l(e,n,()=>{m(e.expression,Vo(Ho(e.bounds),t)),r(Bo(e.bounds))});return;case`SetFilter`:l(e,n,()=>{m(e.predicate,Vo(Ho([e.bound]),t)),m(e.bound.set,t)});return;case`Choose`:l(e,n,()=>{let n=e.pattern;m(e.body,Vo(n.kind===`Name`?[n.name]:n.names,t)),e.set&&m(e.set,t)});return;case`UnboundedQuantifier`:l(e,n,()=>m(e.body,Vo(e.names,t)));return;case`Except`:l(e,n,()=>{m(e.function,t),e.updates.forEach(e=>{e.path.forEach(e=>{e.kind===`Index`&&r(e.args)}),m(e.value,t)})});return;case`Prime`:case`Unchanged`:case`Enabled`:case`Always`:case`Eventually`:l(e,n,()=>m(e.expression,t));return;case`If`:l(e,n,()=>r([e.condition,e.consequent,e.alternative]));return;case`SetEnumeration`:case`Tuple`:l(e,n,()=>r(e.elements));return;case`Product`:l(e,n,()=>r(e.factors));return;case`FunctionSet`:l(e,n,()=>r([e.domain,e.range]));return;case`FieldAccess`:l(e,n,()=>m(e.record,t));return;case`BoxAction`:case`AngleAction`:l(e,n,()=>r([e.action,e.subscript]));return;case`WeakFairness`:case`StrongFairness`:l(e,n,()=>r([e.subscript,e.action]))}};e.relations.forEach(e=>{i.push(e.node),m(e.expression,void 0),i.pop()})},Wo=(e,t,n)=>{for(let r=e.firstChild[t];r!==-1;r=e.nextSibling[r]){if(e.expressions[r]===n)return r;if(e.isPart[r]){let t=Wo(e,r,n);if(t!==-1)return t}}return-1},Go=(e,t,n)=>{if(e.expressions[t]===n)return t;let r=Wo(e,t,n);if(r!==-1)return r;let i=e.recursive[t],a=i===-1?-1:Wo(e,i,n);return a===-1?e.lets[t]?.find(t=>e.expressions[t]===n)??t:a},Ko=(e,t)=>{for(let n=t;n!==-1;n=e.prefixes[n])e.primary[n]++},qo=(e,t,n)=>{let r=e.current;e.current=t;try{return n()}finally{e.current=r}},Jo=(e,t,n)=>{let r=typeof t==`object`?e.values.get(t):void 0;r!==void 0&&(e.secondary[r]+=n)},Yo=e=>{let t=Number(e>>32n);return t===0?32+Math.clz32(Number(e&4294967295n)):Math.clz32(t)},Xo=(e,t)=>t.forEach((t,n)=>{let r=To([t]),i=Number(r>>BigInt(54)),a=BigInt.asUintN(64,r<<BigInt(10)|1n<<9n),o=n*ko+i;e.registers[o]=Math.max(e.registers[o],Yo(a)+1)}),Zo=(e,t)=>{let n=e.registers.subarray(t*ko,(t+1)*ko),r=n.reduce((e,t)=>e+2**-t,0),i=.7205407583220416*ko*ko/r,a=n.filter(e=>e===0).length;return Math.trunc(i<=2.5*ko?a===0?i:ko*Math.log(ko/a):i>2**64/30?-(2**64)*Math.log(1-i/2**64):i)},Qo=e=>{let t=Math.imul(31,31+e.primary)+e.secondary|0;return t^t>>>16},$o=e=>{let t=16;for(;e.length>t*.75;)t*=2;let n=e=>Qo(e)&t-1;return e.reduce((e,t)=>n(t)<n(e)?t:e)},es=(e,t)=>{e.some(e=>e.primary===t.primary&&e.secondary===t.secondary)||e.push(t)},ts=(e,t)=>e.isPrimed[t]||e.isUnchanged[t],ns=(e,t)=>{let n=[];for(let r=e.firstChild[t];r!==-1;r=e.nextSibling[r])n.push(r);return n},rs=(e,t)=>{let n=e.primary[t.node],r=e.secondary[t.node];return t.kind===`init`?{distinct:n,generated:n+r}:t.kind===`next`?{distinct:r,generated:n}:t.kind===`constraint`?{distinct:r,generated:n+r}:{distinct:0,generated:0}},is=(e,t)=>{let n=[],r=/* @__PURE__ */ new Map,i=t=>{let n=[],a={primary:e.primary[t],secondary:e.secondary[t]};return(a.primary>0||a.secondary>0||ts(e,t))&&es(n,a),ns(e,t).forEach(e=>i(e).forEach(e=>es(n,e))),r.set(t,n),n},a=(t,r,i,a)=>{let o=e.ranges[t];n.push({location:o?g(o):`Unknown location`,depth:r,count:i,cost:a})},o=(t,n)=>a(t,n,e.primary[t],e.secondary[t]),s=(t,n)=>{let c=ns(e,t),l=[];c.forEach(e=>(r.get(e)??i(e)).forEach(e=>es(l,e)));let u={primary:e.primary[t],secondary:e.secondary[t]},d=ts(e,t),f=e=>c.forEach(t=>s(t,e));if(e.isUnchanged[t]){let e=l.filter(e=>e.primary!==0||e.secondary!==0);e.length===0?o(t,n):a(t,n,Math.max(u.primary,$o(e).primary),0);return}if(l.length===0){(u.primary!==0||d)&&o(t,n);return}let p=u.primary===0&&u.secondary===0;if(l.length===1){let e=l[0],r=e.primary===0&&e.secondary===0;if(e.primary<u.primary){o(t,n),f(n+1);return}if(!d&&p&&!r){a(t,n,e.primary,e.secondary);return}if(p&&r){d&&o(t,n),f(d?n+1:n);return}if(u.primary===e.primary&&u.secondary===e.secondary){o(t,n);return}}let m=!p||d;m&&o(t,n),f(m?n+1:n)};return ns(e,t).forEach(e=>{i(e),s(e,0)}),n},as=[`init`,`next`,`invariant`,`constraint`,`implied`],os=(e,t)=>!e||!t?e?1:t?-1:0:e.module===t.module?e.start.line-t.start.line||e.start.column-t.start.column||e.end.line-t.end.line||e.end.column-t.end.column:e.module<t.module?-1:1,ss=e=>as.flatMap(t=>{let n=e.relations.filter(e=>e.kind===t);return t===`next`?n.toSorted((e,t)=>os(e.expression.location.range,t.expression.location.range)).filter((e,t,n)=>t===0||os(n[t-1].expression.location.range,e.expression.location.range)!==0):n}),cs=(e,t,n,r)=>({variables:r.map(r=>{let i=n[r]?.range;return{label:`${t.variables[r]} ${i?g(i):`Unknown location`}`,distinct:Zo(e,r)}}),relations:ss(e).map(t=>({kind:t.kind,label:t.label,...rs(e,t),expressions:is(e,t.node)}))}),ls=(e,t,n)=>{let r=Mo(e,t,n);if(r===void 0)return;let i=e.primary[r],a=e.secondary[r];if(t===`init`)return[[`generated`,i+a],[`distinct`,i]];if(t===`next`)return[[`generated`,i],[`distinct`,a]];let o=e.firstChild[r];return[[`count`,o===-1?i:e.primary[o]]]},us=/* @__PURE__ */ new Set([`=`,`#`,`~`,`<=>`,`/\\`,`\\/`,`=>`,`\\in`,`\\notin`,`\\subseteq`,`\\cup`,`\\cap`,`\\`,`SUBSET`,`UNION`,`DOMAIN`,`+`,`-`,`*`,`^`,`\\div`,`%`,`..`,`Seq`,`IsFiniteSet`]),ds=(e,n)=>us.has(e)?new w(n):new t(n),fs=(e,n,r,i)=>new t(`The ${e} argument of ${n} should be a ${r}, but instead it is:\n${N(L(i))}`),ps=(e,n,r=e)=>{if(!dn(e)||Kn(e))throw new t(`Applying ${n} to the following value,\nwhich is not a finite set:\n${N(L(r))}`);return F(e)},ms=e=>typeof e==`object`&&e.kind===`Operator`,R=(e,t,n)=>{let r=e[t];if(r===void 0||ms(r))throw ds(n,`${n} expects a value as argument ${t+1}`);return r},hs=(e,t,n)=>{let r=R(e,t,n);if(typeof r!=`boolean`)throw ds(n,`${n} expects a boolean but received ${L(r)}`);return r},gs=(e,t,n)=>{let r=e[t];if(r===void 0||!ms(r))throw ds(n,`${n} expects an operator as argument ${t+1}`);return r},_s=(e,t)=>({kind:`Builtin`,name:e,arity:0,evaluate:()=>t,evaluateUnary:void 0,evaluateBinary:void 0}),z=(e,t,n)=>({kind:`Builtin`,name:e,arity:t,evaluate:n,evaluateUnary:t===1?e=>n([e]):void 0,evaluateBinary:t===2?(e,t)=>n([e,t]):void 0}),vs=(e,t,n)=>({kind:`Builtin`,name:e,arity:t,evaluate:n,evaluateUnary:void 0,evaluateBinary:void 0}),ys=(e,t,n)=>({kind:`Builtin`,name:e,arity:t,evaluate:n,evaluateUnary:void 0,evaluateBinary:void 0,isStateLevel:!0}),bs=(e,t)=>({kind:`Builtin`,name:e,arity:2,evaluate:n=>t(R(n,0,e),R(n,1,e)),evaluateUnary:void 0,evaluateBinary:t}),xs=e=>e>2147483647||e<-2147483648,Ss=e=>new t(`Overflow when computing ${e}`),Cs={ModelValue:`ModelValue`,Set:`SetEnumValue`,Interval:`IntervalValue`,InfiniteSet:`UserValue`,SequenceSet:`UserValue`,Subset:`SubsetValue`,FunctionSet:`SetOfFcnsValue`,RecordSet:`SetOfRcdsValue`,ProductSet:`SetOfTuplesValue`,FilteredSet:`SetPredValue`,LazyFunction:`FcnLambdaValue`,Union:`UnionValue`,MixedSet:`SetEnumValue`},ws={"\\cup":`SetCupValue`,"\\cap":`SetCapValue`,"\\":`SetDiffValue`},Ts={BoolValue:`a Boolean value`,IntValue:`an integer`,StringValue:`a string`,RecordValue:`a record`,SetEnumValue:`a set of the form {e1, ... ,eN}`,SetPredValue:`a set of the form {x \\in S : expr}`,TupleValue:`a tuple`,FcnLambdaValue:`a function of the form [x \\in S |-> expr]`,FcnRcdValue:`a function of the form (d1 :> e1 @@ ... @@ dN :> eN)`,SetOfFcnsValue:`a set of the form [S -> T]`,SetOfRcdsValue:`a set of the form [d1 : S1, ... , dN : SN]`,SetOfTuplesValue:`a cartesian product`,SubsetValue:`a set of the form SUBSET S`,SetDiffValue:`a set of the form S \\ T`,SetCapValue:`a set of the form S \\cap T`,SetCupValue:`a set of the form S \\cup T`,ModelValue:`a model value`,UserValue:`a special set constant`,IntervalValue:`a set of the form i..j`,UnionValue:`a set of the form UNION S`},Es={lambda:`FcnLambdaValue`,tuple:`TupleValue`,record:`RecordValue`},Ds=e=>{if(typeof e==`number`)return`IntValue`;if(typeof e==`string`)return`StringValue`;if(typeof e==`boolean`)return`BoolValue`;if(e.kind===`SetOperation`)return ws[e.operator];if(e.kind!==`Function`)return Cs[e.kind];let t=lr(e);return t===void 0?`FcnRcdValue`:Es[t]},Os=e=>Ts[Ds(e)],ks=(e,t)=>new w(`Attempted to apply the operator overridden by the Java method\n${e},\nbut it produced the following error:\n${t}`),As=(e,n)=>{let r=r=>(...i)=>{let a=Gi.sets?.length??0;try{return r(...i)}catch(r){if(!(r instanceof w)||r instanceof T)throw r;let i=qi(a);throw Gi.sets&&(Gi.sets.length=a),e.isLazy!==!0&&r instanceof t&&!i?r:ks(n,r.message)}},i=r(e.evaluate);return{...e,evaluate:(t,r)=>{if(t.length!==e.arity)throw ks(n,`array is not of length ${e.arity}`);return i(t,r)},evaluateUnary:e.evaluateUnary&&r(e.evaluateUnary),evaluateBinary:e.evaluateBinary&&r(e.evaluateBinary)}},js=(e,t)=>{if(typeof e!=`number`)throw ks(t,`Cannot cast tlc2.value.impl.${Ds(e)} to tlc2.value.impl.IntValue`);return e},Ms=(e,t,n,r)=>`public static tlc2.value.impl.${n} tlc2.module.${e}.${t}(${Array.from({length:r},()=>`tlc2.value.impl.IntValue`).join(`,`)})`,Ns=(e,t,n,r)=>{let i=Ms(e,n,`IntValue`,2);return bs(t,(e,n)=>{let a=js(n,i),o=js(e,i),s=r(o,a);if(xs(s))throw Ss(`${o}${t}${a}`);return s})},Ps=(e,n,r)=>{if(typeof e!=`number`)throw new t(`The ${n} argument of ${r} should be an integer, but instead it is:\n${N(L(e))}`);return e},Fs=(e,t,n=e)=>bs(e,(e,r)=>t(Ps(e,`first`,n),Ps(r,`second`,n))),Is=(e,t,n)=>({...ys(e,t,n),isLazy:!0}),Ls=(e,t,n)=>{let r=gs(e,t,n);return()=>r.call([])},Rs=/* @__PURE__ */ new Set([`Apply`,`And`,`Or`,`If`,`FunctionApplication`,`FieldAccess`,`Record`,`Tuple`,`SetEnumeration`,`Prime`,`Unchanged`,`Forall`,`Exists`,`Choose`,`SetFilter`,`FunctionConstruction`]),zs=()=>({implication:d_,negate:f_,equivalent:p_,body:m_,condition:(e,t)=>{if(typeof e!=`boolean`)throw Jg(t,e);return e},junct:(e,t,n)=>{if(typeof e!=`boolean`)throw Yg(t,n,e);return e},apply:pa,expectFunction:s_,tuple:fi,set:Xr,record:mi,writtenRecord:Cn,equal:_r,enumerate:x_,choiceElements:Jv,noChoice:e=>{throw Yv(e)},filterPredicate:qv,isReducible:fn,finiteElements:e=>F(e).elements,addBounded:cn,normalizedSet:ar,isBeyondBound:ln,cardinality:Ri,functionDomain:ui,sortedFunction:or,unassigned:(e,t)=>{throw n_(e,t)},prime:_v,keepLazyContext:c_,extend:(e,t,n)=>({environment:e.environment,scope:t.reduce((e,t,r)=>a_(e,t,n[r]),e.scope),state:e.state,next:e.next,isKeepLazy:e.isKeepLazy})});let Bs,Vs;const Hs=()=>{try{return!!Function(``)}catch(e){if(e instanceof EvalError)return!1;throw e}},Us=(e,t)=>(e.references.push(t),`reference${e.references.length-1}`),Ws=e=>`local${e.counter++}`,Gs=(e,t=/* @__PURE__ */ new Set)=>{let n=ht(e);return n!==void 0&&t.add(n),mt(e).forEach(e=>Gs(e,t)),t},Ks=(e,t,n,r=!1)=>{let i=Gs(t),a=[...n.locals].filter(e=>r||i.has(e[0]));if(a.length===0)return n.context;let o=Us(e,a.map(e=>e[0]));return`extend(${n.context}, ${o}, [${a.map(e=>e[1]).join(`, `)}])`},qs=(e,t,n,r=!1)=>`${Us(e,Ev(t,e.environment))}(${Ks(e,t,n,r)})`,Js=(e,t,n)=>{let r=`helper${e.counter++}`,i=[...t.locals.values()],a={context:`context`,state:`state`,next:`next`,isPrimed:!1,locals:new Map(t.locals)},o=i.map(e=>`, ${e}`).join(``);return e.helpers.push(`function ${r}(context, state, next${o}) { let primed; let applied; ${n(a)} }`),`${r}(${t.context}, ${t.state}, ${t.isPrimed?`undefined`:t.next}${o})`},Ys=(e,t,n,r)=>{let i=Ws(e),a=Ws(e),o=Ws(e);return`for (let ${i} = 0, ${a} = ${t}.low, ${o} = ${a} === undefined ? ${t}.length : ${t}.high - ${a} + 1; ${i} < ${o}; ${i}++) { const ${n} = ${a} === undefined ? ${t}[${i}] : ${a} + ${i}; ${r} }`},Xs=(e,t,n)=>{let r=t.kind===`Forall`;return Js(e,n,n=>{let i=t.bounds.map(()=>Ws(e)),a=t.bounds.map((r,a)=>a>0&&t.bounds[a-1].set===r.set?`const ${i[a]} = ${i[a-1]};`:`const ${i[a]} = enumerate(${rc(e,r.set,n)}, ${Us(e,r.set)}, ${JSON.stringify(e.environment.runtime.version)});`),o=t.bounds.map(t=>{let r=Ws(e);return t.pattern.kind===`Name`&&n.locals.set(t.pattern.name,r),r}),s=`if (body(${rc(e,t.body,n)}, ${Us(e,t)}) !== ${r}) return ${!r};`,c=o.reduce((t,n,r)=>Ys(e,i[r],n,t),s);return`${a.join(` `)} ${c} return ${r};`})},Zs=(e,t,n,r,i)=>Js(e,i,i=>{let a=Ws(e),o=Ws(e),s=Us(e,t),c=`choiceElements(${rc(e,n,i)}, ${s}, ${Us(e,n)}, ${JSON.stringify(e.environment.runtime.version)})`;i.locals.set(r,o);let l=`if (body(${rc(e,t.body,i)}, ${s})) return ${o};`;return`const ${a} = ${c}; ${Ys(e,a,o,l)} return noChoice(${s});`}),Qs=(e,t,n,r)=>Js(e,r,r=>{let i=Ws(e),a=Ws(e),o=Ws(e),s=Ws(e),c=Us(e,t),l=`if (!isReducible(${i})) return ${Us(e,Kv(t,e.environment))}(${i}, ${Ks(e,t,r)});`,u=rc(e,t.bound.set,r);r.locals.set(n,s);let d=`if (filterPredicate(${rc(e,t.predicate,r)}, ${c})) addBounded(${o}, ${s});`;return`const ${i} = ${u}; ${l} const ${a} = ${i}.kind === "Interval" ? ${i} : finiteElements(${i}); const ${o} = []; ${Ys(e,a,s,d)} return normalizedSet(${o});`}),$s=(e,t,n,r)=>Js(e,r,r=>{let i=Ws(e),a=Ws(e),o=Ws(e),s=Ws(e),c=Ws(e),l=Ws(e),u=Us(e,Uv(t,e.environment)),d=Ks(e,t,r),f=`if (context.isKeepLazy || !isReducible(${i})) return ${u}.build(${i}, ${d});`,p=rc(e,t.bounds[0].set,r);r.locals.set(n,c);let m=`const ${l} = ${rc(e,t.body,r)}; if (!${a}) ${s}.push(${l});`;return`const ${i} = ${p}; ${f} const ${a} = isBeyondBound(${i}); const ${o} = ${a} ? ${i} : functionDomain(${i}); if (${a}) cardinality(${i}); const ${s} = []; ${Ys(e,o,c,m)} return ${a} ? ${u}.createLazy(${i}, ${d}) : sortedFunction(${o}, ${s});`}),ec=(e,t,n)=>{let r=t.args;if(t.operator===`=>`){let i=rc(e,r[0],n),a=rc(e,r[1],n),o=Us(e,t);return`(implication(${i}, ${o}, "P") ? implication(${a}, ${o}, "Q") : true)`}if(t.operator===`~`&&r.length===1)return`negate(${rc(e,r[0],n)}, ${Us(e,t)})`;if(t.operator===`<=>`)return`equivalent(${rc(e,r[0],n)}, ${rc(e,r[1],n)}, ${Us(e,t)})`;if(M(t))return qs(e,t,n);let i=J_(t.operator,e.environment);if(i?.kind!==`Builtin`)return qs(e,t,n);if(i.name===`DOMAIN`)return`${Us(e,Qg(t))}(${rc(e,r[0],n)})`;if(i.name===`TLCEval`)return qs(e,t,n,!0);if(i.name===`\\subseteq`&&r.length===2)return`${Us(e,$g(t,i))}(${rc(e,r[0],n)}, ${rc(e,r[1],n)})`;let a=e.environment;if(i.evaluateUnary&&r.length===1&&kv(r[0],a))return`${Us(e,i.evaluateUnary)}(${rc(e,r[0],n)})`;let o=r.length===2&&kv(r[0],a)&&kv(r[1],a);return i.evaluateBinary&&o?`${Us(e,i.evaluateBinary)}(${rc(e,r[0],n)}, ${rc(e,r[1],n)})`:qs(e,t,n)},tc=(e,t,n)=>{switch(e.kind){case`Identifier`:{if(t.locals.has(e.name))return!0;if(M(e))return!1;let r=av(e.name,n);return r?.kind===`Variable`||r?.kind===`Value`}case`Prime`:return tc(e.expression,t,n);case`FieldAccess`:return tc(e.record,t,n);case`FunctionApplication`:return[e.function,...e.args].every(e=>tc(e,t,n));default:return!1}},nc=e=>{switch(e.kind){case`Identifier`:case`Number`:case`String`:return!0;case`FieldAccess`:return nc(e.record);case`FunctionApplication`:return[e.function,...e.args].every(nc);default:return!1}},rc=(e,t,n)=>{let r=(t,r=n)=>rc(e,t,r);switch(t.kind){case`Number`:return _n(t.value)?String(t.value):qs(e,t,n);case`String`:return JSON.stringify(t.value);case`Identifier`:{let r=n.locals.get(t.name);if(r)return r;if(M(t))return qs(e,t,n);let i=av(t.name,e.environment);if(i?.kind===`Variable`){let r=JSON.stringify(t.name),a=Us(e,t);return`(${n.state}?.[${i.index}] ?? unassigned(${r}, ${a}))`}return i?.kind===`Value`?Us(e,i.value):qs(e,t,n)}case`Apply`:return ec(e,t,n);case`And`:case`Or`:{if(t.operands.length===0)return String(t.kind===`And`);let n=Us(e,t),i=t.kind===`And`?` && `:` || `;return`(${t.operands.map((e,t)=>`junct(${r(e)}, ${n}, ${t})`).join(i)})`}case`If`:return`(condition(${r(t.condition)}, ${Us(e,t)}) ? ${r(t.consequent)} : ${r(t.alternative)})`;case`FunctionApplication`:{Rv(t.function);let i={...n,context:`keepLazyContext(${n.context})`},a=`(applied = ${tc(t.function,n,e.environment)?r(t.function):nc(t.function)?r(t.function,i):qs(e,t.function,i)}, typeof applied === "object" && (applied.kind === "Function" || applied.kind === "LazyFunction") ? applied : expectFunction(applied, ${Us(e,t)}))`,o=Zg(e.environment.runtime.version),s=o?`, ${Us(e,o)}`:``;return t.args.length===1?`apply(${a}, ${r(t.args[0])}${s})`:`apply(${a}, tuple([${t.args.map(e=>r(e)).join(`, `)}])${s})`}case`FieldAccess`:return`${Us(e,Xg(t))}(${r(t.record)})`;case`Record`:{let i=Zv(t.fields);if(Qv(i))return qs(e,t,n);let a=Us(e,i.map(e=>e.name)),o=`[${t.fields.map(e=>r(e.value)).join(`, `)}]`,s=t.fields.map(e=>e.name);return s.every((e,t)=>e===i[t].name)?`record(${a}, ${o})`:`writtenRecord(${a}, ${Us(e,i.map(e=>t.fields.indexOf(e)))}, ${o}, ${Us(e,s)})`}case`Tuple`:return`tuple([${t.elements.map(e=>r(e)).join(`, `)}])`;case`SetEnumeration`:return`set([${t.elements.map(e=>r(e)).join(`, `)}])`;case`Prime`:return n.isPrimed?qs(e,t,n):r(t.expression,{context:`(primed ??= prime(${n.context}))`,state:n.next,next:`undefined`,isPrimed:!0,locals:n.locals});case`Unchanged`:return`equal(${r({kind:`Prime`,expression:t.expression,location:t.location})}, ${r(t.expression)})`;case`Forall`:case`Exists`:return t.bounds.every(e=>e.pattern.kind===`Name`)?Xs(e,t,n):qs(e,t,n);case`Choose`:return t.set&&t.pattern.kind===`Name`?Zs(e,t,t.set,t.pattern.name,n):qs(e,t,n);case`FunctionConstruction`:{let r=t.bounds[0];return t.bounds.length===1&&r.pattern.kind===`Name`&&!t.isRecursive&&!Hv(t)?$s(e,t,r.pattern.name,n):qs(e,t,n)}case`SetFilter`:return t.bound.pattern.kind===`Name`?Qs(e,t,t.bound.pattern.name,n):qs(e,t,n);default:return qs(e,t,n)}},ic=(e,t)=>{if(!Rs.has(e.kind)||(Vs??=Hs(),!Vs))return;let n={environment:t,references:[],helpers:[],counter:0},r=rc(n,e,{context:`context`,state:`state`,next:`next`,isPrimed:!1,locals:/* @__PURE__ */ new Map}),i=n.references.map((e,t)=>`reference${t}`),a=`${n.helpers.join(`
76
+ `;if(typeof o!=`string`)throw new _(`The _format field of the ALIAS ${i} is ${L(o)}, but it must be a string.`);return r.filter(e=>!(a&&e[0]===`_format`)).filter(e=>!t||!Ka(t[e[0]],e[1])).map(e=>{let t=Ja(o,[e[0],N(L(e[1]))]);if(t===void 0)throw new _(`The _format field of the ALIAS ${i} is ${L(o)}, but it must format two strings, the name and the value of a field.`);return t}).join(``)},Xa=[10454148508367108822n,15747411856486957441n,13848313129918172575n,15427004735118145554n,14338780731064426356n,15931650522396165332n,17670238537108149059n,12816660938095048951n,13192168525635896882n,16119298732711755075n,13564417994159519395n,15831473429641889162n,17671735485712653535n,14582471876431321160n,9288673424107444897n,12345523232675890545n,13774063780198914517n,10636128657019767374n,13227535641082688945n,10085966873248490402n,17056045221983369811n,18027133543548002442n,13033986364717636900n,12663388180492401538n,11007194744055901935n,16251515628090973732n,18046429724439772544n,9876734796024595817n,14949643787442512870n,16960057143726945461n,10590203213448744021n,12248592797044284137n,9558805810925624286n,16993321702164258530n,11754329512098378960n,12074934892440206921n,15696745233288286746n,10531590977001201739n,18107999685377398317n,12149369488538049728n,12923655455904407421n,10507099144397364930n,17322088528956367024n,14653973644796244054n,15165509594857513400n,13554280709034297251n,16228911470502883382n,17115369786458865383n,11179220607102683830n,16708422618246866334n,12295941796329322556n,18336630348474106240n,13989616001589685348n,14822072159597151759n,14264172520427195041n,11642530518213145397n,11877331515501935358n,13913116192159715440n,17054474839259161580n,13461230878584418056n,16058025410470398786n,11100471369705097435n,11133782763824505275n,13192312712502684421n,17456091706045076157n,13237272598629075916n,12914531898895761383n,15801841604014567326n,16446055517513626294n,16780923767715884464n,15104658705803254918n,10882049990920163451n,12728112724252049190n,11720209067562733740n,16476221075563830086n,16602801460297162326n,16206898064012585915n,12158475401238648099n,13742285336487677729n,15543703592025073839n,9615783578189153721n,16710542608962839044n,11960730242263336692n,13328718558362718101n,12971616006464047952n,17057853503483465676n,16180230282101315295n,15483523553568578902n,17773465781871025571n,18047252642493037509n,11580640560664688668n,10121963531818974651n,14218267149826330657n,12715294421139777506n,10584764766358778171n,12666843443693621286n,17403948736867619210n,17907955559063099692n,15179434392748515198n,15413469521140985247n,13455040338347572751n,15419348191054617477n,12340568220039846914n,13236419189535069162n,18074463254581147189n,10818750974828329405n,9859349269386152082n,15035006154709018396n,13627907273947709876n,9549035931546940138n,16199589727945564820n,10285831968679942330n,17737018494601061698n,15477896647372134857n,13595764249822586512n,10556855812148546550n,12421897615105552821n,15477767459253848096n,17421607461439241175n,12409061346569762725n,13621778224251023638n,10680972825126675886n,16494492050207190715n,16801324317763555620n,12664650400804916358n,16134230614391269483n,10027806175083075147n,9259037851175017999n,11803214621941906429n,9537357587847606069n,10517495000576890277n];let Za=Xa[0];const Qa=()=>Za,$a=/* @__PURE__ */ new Int32Array(256),eo=/* @__PURE__ */ new Int32Array(256),to=/* @__PURE__ */ new Int32Array(256),no=/* @__PURE__ */ new Int32Array(256),ro=/* @__PURE__ */ new Int32Array(256),io=/* @__PURE__ */ new Int32Array(256),ao=/* @__PURE__ */ new Int32Array(256),oo=/* @__PURE__ */ new Int32Array(256);let so=0,co=0,lo=0,uo=0;const fo=e=>{let t=(e^uo)&255;uo=(uo>>>8|lo<<24)^ro[t],lo=lo>>>8^$a[t]},po=e=>{let t=Xa[e];Za=t;let n=[];for(let e=1n<<63n;n.length<72;)n.push(e),e=e>>1n^((e&1n)==0n?0n:t);let r=n.slice(64,72).reverse();for(let e=0;e<256;e++){let t=r.reduce((t,n,r)=>e>>r&1?t^n:t,0n);$a[e]=Number(BigInt.asIntN(32,t>>32n)),ro[e]=Number(BigInt.asIntN(32,t))}let i=[$a,eo,to,no],a=[ro,io,ao,oo];for(let e=1;e<4;e++){let t=i[e-1],n=a[e-1];for(let r=0;r<256;r++){let o=n[r]&255;a[e][r]=(n[r]>>>8|t[r]<<24)^ro[o],i[e][r]=t[r]>>>8^$a[o]}}so=Number(BigInt.asIntN(32,t>>32n)),co=Number(BigInt.asIntN(32,t))};po(0);const mo=e=>{let t=uo^e,n=t&255,r=t>>>8&255,i=t>>>16&255,a=t>>>24;uo=lo^oo[n]^ao[r]^io[i]^ro[a],lo=no[n]^to[r]^eo[i]^$a[a]},ho=e=>{if(typeof e==`boolean`)return fo(0),fo(e?116:102),2;if(typeof e==`number`)return fo(1),mo(e),5;if(typeof e==`string`){fo(3),mo(e.length);let t=e.length&-4;for(let n=0;n<t;n+=4)mo(e.charCodeAt(n)&255|(e.charCodeAt(n+1)&255)<<8|(e.charCodeAt(n+2)&255)<<16|(e.charCodeAt(n+3)&255)<<24);for(let n=t;n<e.length;n++)fo(e.charCodeAt(n));return 5+e.length}return fo(21),mo(Wn(e.name)+1),5},go=e=>{let t=lo,n=uo;lo=0,uo=0;let r=[ho(e),lo,uo];return lo=t,uo=n,r},_o=e=>`m = (${e} ^ l) & 255; l = ((l >>> 8) | (h << 24)) ^ L0[m]; h = (h >>> 8) ^ H0[m];`,vo=e=>`m = l ^ ${e}; l = h ^ L3[m & 255] ^ L2[(m >>> 8) & 255] ^ L1[(m >>> 16) & 255] ^ L0[m >>> 24]; h = H3[m & 255] ^ H2[(m >>> 8) & 255] ^ H1[(m >>> 16) & 255] ^ H0[m >>> 24];`,yo={integer:e=>`${_o(`1`)} ${vo(e)}`,boolean:e=>`${_o(`0`)} ${_o(`(${e} ? 116 : 102)`)}`,set:e=>`${_o(`5`)} ${vo(e)}`,function:e=>`${_o(`9`)} ${vo(e)}`,scalar:(e,t,n)=>`{ let r = ${e}; for (; r >= 4; r -= 4) { ${vo(`0`)} } for (; r > 0; r--) { ${_o(`0`)} } h ^= ${t}; l ^= ${n}; }`},bo=()=>({H0:$a,H1:eo,H2:to,H3:no,L0:ro,L1:io,L2:ao,L3:oo,initialHigh:so,initialLow:co}),xo=(e,t)=>{let n=lo,r=uo;uo=e[0],lo=e[1],wo(t),e[0]=uo,e[1]=lo,lo=n,uo=r},So=e=>{fo(5),mo(e)},Co=e=>{fo(9),mo(e)},wo=e=>{if(typeof e!=`object`||mn(e))ho(e);else if(pn(e)){let t=I(e);Co(t.domain.length);for(let e=0;e<t.domain.length;e++)wo(t.domain[e]),wo(t.range[e])}else{let t=F(e).elements;So(t.length);for(let e of t)wo(e)}},To=e=>{let t=lo,n=uo;lo=so,uo=co;for(let t of e)wo(t);let r=BigInt(lo>>>0)<<32n|BigInt(uo>>>0);return lo=t,uo=n,r},Eo=(e,t)=>{let n=new BigInt64Array(e),r=new Int32Array(n.buffer),i=lo,a=uo;for(let n=0;n<e;n++)lo=so,uo=co,t(n),r[2*n]=uo,r[2*n+1]=lo;return lo=i,uo=a,n},Do=(e,t)=>Eo(e.length,n=>{for(let r of t)wo(e[n][r])}),Oo=/* @__PURE__ */ new Set([`FiniteSets`,`Sequences`,`Bags`,`Naturals`,`Integers`,`Reals`,`RealTime`,`Randomization`,`TLC`]),ko=1024,Ao=e=>({current:-1,expressions:[],ranges:[],firstChild:[],lastChild:[],nextSibling:[],prefixes:[],isPart:[],isPrimed:[],isUnchanged:[],recursive:[],lets:[],roots:[],primary:[],secondary:[],covered:/* @__PURE__ */ new WeakSet,values:/* @__PURE__ */ new WeakMap,registers:new Uint8Array(e*ko),relations:[]}),jo=(e,t,n,r,i)=>{let a=e.expressions.length;if(e.expressions.push(t),e.ranges.push(n),e.firstChild.push(-1),e.lastChild.push(-1),e.nextSibling.push(-1),e.prefixes.push(-1),e.isPart.push(i),e.isPrimed.push(!1),e.isUnchanged.push(t?.kind===`Unchanged`),e.recursive.push(-1),e.lets.push(void 0),e.roots.push(r===-1?a:e.roots[r]),e.primary.push(0),e.secondary.push(0),t&&e.covered.add(t),r===-1)return a;let o=e.lastChild[r];return o===-1&&(e.firstChild[r]=a),o!==-1&&(e.nextSibling[o]=a),e.lastChild[r]=a,a},Mo=(e,t,n)=>e.relations.find(e=>e.kind===t&&e.expression===n)?.node,No=(e,t,n,r,i)=>{let a=t===`next`?Mo(e,t,r):void 0;if(a!==void 0)return a;let o=jo(e,void 0,r.location.range,-1,!1);return e.relations.push({kind:t,label:n,expression:r,scope:i,node:o}),o},Po=(e,t)=>e!==void 0&&t!==void 0&&e.module===t.module&&e.start.line===t.start.line&&e.start.column===t.start.column&&e.end.line===t.end.line&&e.end.column===t.end.column,Fo=(e,t,n)=>{let r=e===void 0?void 0:n.definitions.get(e),i=r?.kind===`Operator`?r.head:void 0,a=t.location.range;return!r||!i?`Action ${a?g(a):`Unknown location`}`:Po(r.body.location.range,a)||!a?`${r.name} ${g(i)}`:`${r.name} ${g(i)} (${a.start.line} ${a.start.column} ${a.end.line} ${a.end.column})`},Io=e=>`${e.module}:${e.start.line}:${e.start.column}:${e.end.line}:${e.end.column}`,Lo=(e,t)=>e&&t?{module:e.module,start:e.start,end:t.end}:void 0,Ro=(e,t)=>t&&{module:t.module,start:e.range?.start??{line:e.line,column:e.column},end:t.end},zo=e=>{let t=Array.from({length:11},()=>[]);return e.forEach((e,n)=>{if(n>=Math.floor(t.length*.75)){let e=Array.from({length:t.length*2+1},()=>[]);for(let n=t.length-1;n>=0;n--)t[n].forEach(t=>e[(gt(t.name)&2147483647)%e.length].unshift(t));t=e}t[(gt(e.name)&2147483647)%t.length].unshift(e)}),t.toReversed().flat()},Bo=e=>e.flatMap((t,n)=>n>0&&e[n-1].set===t.set?[]:[t.set]),Vo=(e,t)=>e.reduce((e,t)=>({name:t,definition:void 0,scope:void 0,parent:e}),t),Ho=e=>e.flatMap(e=>e.pattern.kind===`Name`?[e.pattern.name]:e.pattern.names),Uo=(e,t,n)=>{let r=new Set(n.map(Io)),i=[],a=[],o=[],s=/* @__PURE__ */ new Map,c=(e,n,r)=>{if(M(e)){for(let e=r;e;e=e.parent)if(e.name===n)return e.definition&&{definition:e.definition,scope:e.scope};return}let i=t.substitutions.get(n)??n;if(t.variableIndex.has(i)||t.constants.has(i))return;let a=t.definitions.get(i),o=a?.location.range?.module??a?.body.location.range?.module;return a&&!Oo.has(o??``)?{definition:a,scope:void 0}:void 0},l=(t,n,o,c=!1,l)=>{let u=jo(e,t,n,i.at(-1)??-1,c);e.isPrimed[u]=n!==void 0&&r.has(Io(n));let d=t&&s.get(t);if(d&&i.forEach(t=>{e.expressions[t]===d&&(e.lets[t]??=[]).push(u)}),l?.kind===`Operator`&&l.isRecursive){let t=i.findLast(e=>a[e]===l);t!==void 0&&(e.recursive[u]=t)}return a[u]=l,i.push(u),o(),i.pop(),u},u=e=>{let t=e.definition;if(o.includes(t))return;o.push(t);let n=t.kind===`Function`?Ho(t.bounds):t.params.map(e=>e.name);m(t.body,Vo(n,e.scope)),t.kind===`Function`&&Bo(t.bounds).forEach(t=>m(t,e.scope)),o.pop()},d=e=>e?.definition.kind===`Operator`&&e.definition.params.length>0,f=(e,t,n,r)=>{if(e.kind===`Lambda`)m(e.body,Vo(e.params,r));else{if(e.kind===`Identifier`){let i=c(e,e.name,r);if(n?.kind===`Operator`&&(n.params[t]?.arity??0)>0||d(i)){i&&u(i);return}}m(e,r)}},p=(t,n,r,a)=>l(n===t.operands.length?t:void 0,r,()=>{let o=t.operands;if(n>2&&!t.isBulleted){let s=t.prefixEnds?.[n-3],c=p(t,n-1,r&&s?{...r,end:s}:r,a);e.prefixes[i.at(-1)??-1]=c,m(o[n-1],a)}else o.slice(0,n).forEach(e=>m(e,a))},n<t.operands.length),m=(e,t)=>{let n=e.location.range,r=e=>e.forEach(e=>m(e,t));switch(e.kind){case`Number`:case`Decimal`:case`String`:case`ExceptAt`:case`Bracket`:case`Subexpression`:case`OperatorReference`:return;case`Label`:case`Lambda`:m(e.body,Vo(e.params,t));return;case`Let`:{let n=e.definitions.reduce((e,t)=>({name:t.name,definition:t,scope:void 0,parent:e}),t);for(let e=n;e!==t&&e;e=e.parent)e.scope=n;e.definitions.forEach(t=>{t.kind===`Operator`&&s.set(t.body,e.body)}),zo(e.definitions).forEach(e=>u({definition:e,scope:n})),m(e.body,n);return}case`Identifier`:{let r=c(e,e.name,t);l(e,n,()=>{r&&u(r)},!1,r?.definition);return}case`Apply`:{let r=c(e,e.operator,t);l(e,n,()=>{r&&u(r),e.args.forEach((e,n)=>f(e,n,r?.definition,t))},!1,r?.definition);return}case`And`:case`Or`:p(e,e.operands.length,n,t);return;case`Case`:l(e,n,()=>{e.arms.forEach(e=>l(void 0,Lo(e.condition.location.range,e.body.location.range),()=>r([e.condition,e.body]),!0));let n=e.other;n&&l(void 0,e.otherRange,()=>m(n,t),!0)});return;case`Record`:case`RecordSet`:l(e,n,()=>e.fields.forEach(e=>l(void 0,Ro(e.location,e.value.location.range),()=>m(e.value,t),!0)));return;case`FunctionApplication`:l(e,n,()=>{m(e.function,t);let n=e.args;n.length===1?m(n[0],t):l(void 0,Lo(n[0]?.location.range,n.at(-1)?.location.range),()=>r(n),!0)});return;case`Forall`:case`Exists`:case`FunctionConstruction`:l(e,n,()=>{m(e.body,Vo(Ho(e.bounds),t)),r(Bo(e.bounds))});return;case`SetMap`:l(e,n,()=>{m(e.expression,Vo(Ho(e.bounds),t)),r(Bo(e.bounds))});return;case`SetFilter`:l(e,n,()=>{m(e.predicate,Vo(Ho([e.bound]),t)),m(e.bound.set,t)});return;case`Choose`:l(e,n,()=>{let n=e.pattern;m(e.body,Vo(n.kind===`Name`?[n.name]:n.names,t)),e.set&&m(e.set,t)});return;case`UnboundedQuantifier`:l(e,n,()=>m(e.body,Vo(e.names,t)));return;case`Except`:l(e,n,()=>{m(e.function,t),e.updates.forEach(e=>{e.path.forEach(e=>{e.kind===`Index`&&r(e.args)}),m(e.value,t)})});return;case`Prime`:case`Unchanged`:case`Enabled`:case`Always`:case`Eventually`:l(e,n,()=>m(e.expression,t));return;case`If`:l(e,n,()=>r([e.condition,e.consequent,e.alternative]));return;case`SetEnumeration`:case`Tuple`:l(e,n,()=>r(e.elements));return;case`Product`:l(e,n,()=>r(e.factors));return;case`FunctionSet`:l(e,n,()=>r([e.domain,e.range]));return;case`FieldAccess`:l(e,n,()=>m(e.record,t));return;case`BoxAction`:case`AngleAction`:l(e,n,()=>r([e.action,e.subscript]));return;case`WeakFairness`:case`StrongFairness`:l(e,n,()=>r([e.subscript,e.action]))}};e.relations.forEach(e=>{i.push(e.node),m(e.expression,void 0),i.pop()})},Wo=(e,t,n)=>{for(let r=e.firstChild[t];r!==-1;r=e.nextSibling[r]){if(e.expressions[r]===n)return r;if(e.isPart[r]){let t=Wo(e,r,n);if(t!==-1)return t}}return-1},Go=(e,t,n)=>{if(e.expressions[t]===n)return t;let r=Wo(e,t,n);if(r!==-1)return r;let i=e.recursive[t],a=i===-1?-1:Wo(e,i,n);return a===-1?e.lets[t]?.find(t=>e.expressions[t]===n)??t:a},Ko=(e,t)=>{for(let n=t;n!==-1;n=e.prefixes[n])e.primary[n]++},qo=(e,t,n)=>{let r=e.current;e.current=t;try{return n()}finally{e.current=r}},Jo=(e,t,n)=>{let r=typeof t==`object`?e.values.get(t):void 0;r!==void 0&&(e.secondary[r]+=n)},Yo=e=>{let t=Number(e>>32n);return t===0?32+Math.clz32(Number(e&4294967295n)):Math.clz32(t)},Xo=(e,t)=>t.forEach((t,n)=>{let r=To([t]),i=Number(r>>BigInt(54)),a=BigInt.asUintN(64,r<<BigInt(10)|1n<<9n),o=n*ko+i;e.registers[o]=Math.max(e.registers[o],Yo(a)+1)}),Zo=(e,t)=>{let n=e.registers.subarray(t*ko,(t+1)*ko),r=n.reduce((e,t)=>e+2**-t,0),i=.7205407583220416*ko*ko/r,a=n.filter(e=>e===0).length;return Math.trunc(i<=2.5*ko?a===0?i:ko*Math.log(ko/a):i>2**64/30?-(2**64)*Math.log(1-i/2**64):i)},Qo=e=>{let t=Math.imul(31,31+e.primary)+e.secondary|0;return t^t>>>16},$o=e=>{let t=16;for(;e.length>t*.75;)t*=2;let n=e=>Qo(e)&t-1;return e.reduce((e,t)=>n(t)<n(e)?t:e)},es=(e,t)=>{e.some(e=>e.primary===t.primary&&e.secondary===t.secondary)||e.push(t)},ts=(e,t)=>e.isPrimed[t]||e.isUnchanged[t],ns=(e,t)=>{let n=[];for(let r=e.firstChild[t];r!==-1;r=e.nextSibling[r])n.push(r);return n},rs=(e,t)=>{let n=e.primary[t.node],r=e.secondary[t.node];return t.kind===`init`?{distinct:n,generated:n+r}:t.kind===`next`?{distinct:r,generated:n}:t.kind===`constraint`?{distinct:r,generated:n+r}:{distinct:0,generated:0}},is=(e,t)=>{let n=[],r=/* @__PURE__ */ new Map,i=t=>{let n=[],a={primary:e.primary[t],secondary:e.secondary[t]};return(a.primary>0||a.secondary>0||ts(e,t))&&es(n,a),ns(e,t).forEach(e=>i(e).forEach(e=>es(n,e))),r.set(t,n),n},a=(t,r,i,a)=>{let o=e.ranges[t];n.push({location:o?g(o):`Unknown location`,depth:r,count:i,cost:a})},o=(t,n)=>a(t,n,e.primary[t],e.secondary[t]),s=(t,n)=>{let c=ns(e,t),l=[];c.forEach(e=>(r.get(e)??i(e)).forEach(e=>es(l,e)));let u={primary:e.primary[t],secondary:e.secondary[t]},d=ts(e,t),f=e=>c.forEach(t=>s(t,e));if(e.isUnchanged[t]){let e=l.filter(e=>e.primary!==0||e.secondary!==0);e.length===0?o(t,n):a(t,n,Math.max(u.primary,$o(e).primary),0);return}if(l.length===0){(u.primary!==0||d)&&o(t,n);return}let p=u.primary===0&&u.secondary===0;if(l.length===1){let e=l[0],r=e.primary===0&&e.secondary===0;if(e.primary<u.primary){o(t,n),f(n+1);return}if(!d&&p&&!r){a(t,n,e.primary,e.secondary);return}if(p&&r){d&&o(t,n),f(d?n+1:n);return}if(u.primary===e.primary&&u.secondary===e.secondary){o(t,n);return}}let m=!p||d;m&&o(t,n),f(m?n+1:n)};return ns(e,t).forEach(e=>{i(e),s(e,0)}),n},as=[`init`,`next`,`invariant`,`constraint`,`implied`],os=(e,t)=>!e||!t?e?1:t?-1:0:e.module===t.module?e.start.line-t.start.line||e.start.column-t.start.column||e.end.line-t.end.line||e.end.column-t.end.column:e.module<t.module?-1:1,ss=e=>as.flatMap(t=>{let n=e.relations.filter(e=>e.kind===t);return t===`next`?n.toSorted((e,t)=>os(e.expression.location.range,t.expression.location.range)).filter((e,t,n)=>t===0||os(n[t-1].expression.location.range,e.expression.location.range)!==0):n}),cs=(e,t,n,r)=>({variables:r.map(r=>{let i=n[r]?.range;return{label:`${t.variables[r]} ${i?g(i):`Unknown location`}`,distinct:Zo(e,r)}}),relations:ss(e).map(t=>({kind:t.kind,label:t.label,...rs(e,t),expressions:is(e,t.node)}))}),ls=(e,t,n)=>{let r=Mo(e,t,n);if(r===void 0)return;let i=e.primary[r],a=e.secondary[r];if(t===`init`)return[[`generated`,i+a],[`distinct`,i]];if(t===`next`)return[[`generated`,i],[`distinct`,a]];let o=e.firstChild[r];return[[`count`,o===-1?i:e.primary[o]]]},us=/* @__PURE__ */ new Set([`=`,`#`,`~`,`<=>`,`/\\`,`\\/`,`=>`,`\\in`,`\\notin`,`\\subseteq`,`\\cup`,`\\cap`,`\\`,`SUBSET`,`UNION`,`DOMAIN`,`+`,`-`,`*`,`^`,`\\div`,`%`,`..`,`Seq`,`IsFiniteSet`]),ds=(e,n)=>us.has(e)?new w(n):new t(n),fs=(e,n,r,i)=>new t(`The ${e} argument of ${n} should be a ${r}, but instead it is:\n${N(L(i))}`),ps=(e,n,r=e)=>{if(!dn(e)||Kn(e))throw new t(`Applying ${n} to the following value,\nwhich is not a finite set:\n${N(L(r))}`);return F(e)},ms=e=>typeof e==`object`&&e.kind===`Operator`,R=(e,t,n)=>{let r=e[t];if(r===void 0||ms(r))throw ds(n,`${n} expects a value as argument ${t+1}`);return r},hs=(e,t,n)=>{let r=R(e,t,n);if(typeof r!=`boolean`)throw ds(n,`${n} expects a boolean but received ${L(r)}`);return r},gs=(e,t,n)=>{let r=e[t];if(r===void 0||!ms(r))throw ds(n,`${n} expects an operator as argument ${t+1}`);return r},_s=(e,t)=>({kind:`Builtin`,name:e,arity:0,evaluate:()=>t,evaluateUnary:void 0,evaluateBinary:void 0}),z=(e,t,n)=>({kind:`Builtin`,name:e,arity:t,evaluate:n,evaluateUnary:t===1?e=>n([e]):void 0,evaluateBinary:t===2?(e,t)=>n([e,t]):void 0}),vs=(e,t,n)=>({kind:`Builtin`,name:e,arity:t,evaluate:n,evaluateUnary:void 0,evaluateBinary:void 0}),ys=(e,t,n)=>({kind:`Builtin`,name:e,arity:t,evaluate:n,evaluateUnary:void 0,evaluateBinary:void 0,isStateLevel:!0}),bs=(e,t)=>({kind:`Builtin`,name:e,arity:2,evaluate:n=>t(R(n,0,e),R(n,1,e)),evaluateUnary:void 0,evaluateBinary:t}),xs=e=>e>2147483647||e<-2147483648,Ss=e=>new t(`Overflow when computing ${e}`),Cs={ModelValue:`ModelValue`,Set:`SetEnumValue`,Interval:`IntervalValue`,InfiniteSet:`UserValue`,SequenceSet:`UserValue`,Subset:`SubsetValue`,FunctionSet:`SetOfFcnsValue`,RecordSet:`SetOfRcdsValue`,ProductSet:`SetOfTuplesValue`,FilteredSet:`SetPredValue`,LazyFunction:`FcnLambdaValue`,Union:`UnionValue`,MixedSet:`SetEnumValue`},ws={"\\cup":`SetCupValue`,"\\cap":`SetCapValue`,"\\":`SetDiffValue`},Ts={BoolValue:`a Boolean value`,IntValue:`an integer`,StringValue:`a string`,RecordValue:`a record`,SetEnumValue:`a set of the form {e1, ... ,eN}`,SetPredValue:`a set of the form {x \\in S : expr}`,TupleValue:`a tuple`,FcnLambdaValue:`a function of the form [x \\in S |-> expr]`,FcnRcdValue:`a function of the form (d1 :> e1 @@ ... @@ dN :> eN)`,SetOfFcnsValue:`a set of the form [S -> T]`,SetOfRcdsValue:`a set of the form [d1 : S1, ... , dN : SN]`,SetOfTuplesValue:`a cartesian product`,SubsetValue:`a set of the form SUBSET S`,SetDiffValue:`a set of the form S \\ T`,SetCapValue:`a set of the form S \\cap T`,SetCupValue:`a set of the form S \\cup T`,ModelValue:`a model value`,UserValue:`a special set constant`,IntervalValue:`a set of the form i..j`,UnionValue:`a set of the form UNION S`},Es={lambda:`FcnLambdaValue`,tuple:`TupleValue`,record:`RecordValue`},Ds=e=>{if(typeof e==`number`)return`IntValue`;if(typeof e==`string`)return`StringValue`;if(typeof e==`boolean`)return`BoolValue`;if(e.kind===`SetOperation`)return ws[e.operator];if(e.kind!==`Function`)return Cs[e.kind];let t=lr(e);return t===void 0?`FcnRcdValue`:Es[t]},Os=e=>Ts[Ds(e)],ks=(e,t)=>new w(`Attempted to apply the operator overridden by the Java method\n${e},\nbut it produced the following error:\n${t}`),As=(e,n)=>{let r=r=>(...i)=>{let a=Gi.sets?.length??0;try{return r(...i)}catch(r){if(!(r instanceof w)||r instanceof T)throw r;let i=qi(a);throw Gi.sets&&(Gi.sets.length=a),e.isLazy!==!0&&r instanceof t&&!i?r:ks(n,r.message)}},i=r(e.evaluate);return{...e,evaluate:(t,r)=>{if(t.length!==e.arity)throw ks(n,`array is not of length ${e.arity}`);return i(t,r)},evaluateUnary:e.evaluateUnary&&r(e.evaluateUnary),evaluateBinary:e.evaluateBinary&&r(e.evaluateBinary)}},js=(e,t)=>{if(typeof e!=`number`)throw ks(t,`Cannot cast tlc2.value.impl.${Ds(e)} to tlc2.value.impl.IntValue`);return e},Ms=(e,t,n,r)=>`public static tlc2.value.impl.${n} tlc2.module.${e}.${t}(${Array.from({length:r},()=>`tlc2.value.impl.IntValue`).join(`,`)})`,Ns=(e,t,n,r)=>{let i=Ms(e,n,`IntValue`,2);return bs(t,(e,n)=>{let a=js(n,i),o=js(e,i),s=r(o,a);if(xs(s))throw Ss(`${o}${t}${a}`);return s})},Ps=(e,n,r)=>{if(typeof e!=`number`)throw new t(`The ${n} argument of ${r} should be an integer, but instead it is:\n${N(L(e))}`);return e},Fs=(e,t,n=e)=>bs(e,(e,r)=>t(Ps(e,`first`,n),Ps(r,`second`,n))),Is=(e,t,n)=>({...ys(e,t,n),isLazy:!0}),Ls=(e,t,n)=>{let r=gs(e,t,n);return()=>r.call([])},Rs=/* @__PURE__ */ new Set([`Apply`,`And`,`Or`,`If`,`FunctionApplication`,`FieldAccess`,`Record`,`Tuple`,`SetEnumeration`,`Prime`,`Unchanged`,`Forall`,`Exists`,`Choose`,`SetFilter`,`FunctionConstruction`]),zs=()=>({implication:p_,negate:m_,equivalent:h_,body:g_,condition:(e,t)=>{if(typeof e!=`boolean`)throw Xg(t,e);return e},junct:(e,t,n)=>{if(typeof e!=`boolean`)throw Zg(t,n,e);return e},apply:pa,expectFunction:l_,tuple:fi,set:Xr,record:mi,writtenRecord:Cn,equal:_r,enumerate:C_,choiceElements:Qv,noChoice:e=>{throw $v(e)},filterPredicate:Zv,isReducible:fn,finiteElements:e=>F(e).elements,addBounded:cn,normalizedSet:ar,isBeyondBound:ln,cardinality:Ri,functionDomain:ui,sortedFunction:or,unassigned:(e,t)=>{throw i_(e,t)},prime:yv,keepLazyContext:u_,extend:(e,t,n)=>({environment:e.environment,scope:t.reduce((e,t,r)=>s_(e,t,n[r]),e.scope),state:e.state,next:e.next,isKeepLazy:e.isKeepLazy})});let Bs,Vs;const Hs=()=>{try{return!!Function(``)}catch(e){if(e instanceof EvalError)return!1;throw e}},Us=(e,t)=>(e.references.push(t),`reference${e.references.length-1}`),Ws=e=>`local${e.counter++}`,Gs=(e,t=/* @__PURE__ */ new Set)=>{let n=ht(e);return n!==void 0&&t.add(n),mt(e).forEach(e=>Gs(e,t)),t},Ks=(e,t,n,r=!1)=>{let i=Gs(t),a=[...n.locals].filter(e=>r||i.has(e[0]));if(a.length===0)return n.context;let o=Us(e,a.map(e=>e[0]));return`extend(${n.context}, ${o}, [${a.map(e=>e[1]).join(`, `)}])`},qs=(e,t,n,r=!1)=>`${Us(e,Ov(t,e.environment))}(${Ks(e,t,n,r)})`,Js=(e,t,n)=>{let r=`helper${e.counter++}`,i=[...t.locals.values()],a={context:`context`,state:`state`,next:`next`,isPrimed:!1,locals:new Map(t.locals)},o=i.map(e=>`, ${e}`).join(``);return e.helpers.push(`function ${r}(context, state, next${o}) { let primed; let applied; ${n(a)} }`),`${r}(${t.context}, ${t.state}, ${t.isPrimed?`undefined`:t.next}${o})`},Ys=(e,t,n,r)=>{let i=Ws(e),a=Ws(e),o=Ws(e);return`for (let ${i} = 0, ${a} = ${t}.low, ${o} = ${a} === undefined ? ${t}.length : ${t}.high - ${a} + 1; ${i} < ${o}; ${i}++) { const ${n} = ${a} === undefined ? ${t}[${i}] : ${a} + ${i}; ${r} }`},Xs=(e,t,n)=>{let r=t.kind===`Forall`;return Js(e,n,n=>{let i=t.bounds.map(()=>Ws(e)),a=t.bounds.map((r,a)=>a>0&&t.bounds[a-1].set===r.set?`const ${i[a]} = ${i[a-1]};`:`const ${i[a]} = enumerate(${rc(e,r.set,n)}, ${Us(e,r.set)}, ${JSON.stringify(e.environment.runtime.version)});`),o=t.bounds.map(t=>{let r=Ws(e);return t.pattern.kind===`Name`&&n.locals.set(t.pattern.name,r),r}),s=`if (body(${rc(e,t.body,n)}, ${Us(e,t)}) !== ${r}) return ${!r};`,c=o.reduce((t,n,r)=>Ys(e,i[r],n,t),s);return`${a.join(` `)} ${c} return ${r};`})},Zs=(e,t,n,r,i)=>Js(e,i,i=>{let a=Ws(e),o=Ws(e),s=Us(e,t),c=`choiceElements(${rc(e,n,i)}, ${s}, ${Us(e,n)}, ${JSON.stringify(e.environment.runtime.version)})`;i.locals.set(r,o);let l=`if (body(${rc(e,t.body,i)}, ${s})) return ${o};`;return`const ${a} = ${c}; ${Ys(e,a,o,l)} return noChoice(${s});`}),Qs=(e,t,n,r)=>Js(e,r,r=>{let i=Ws(e),a=Ws(e),o=Ws(e),s=Ws(e),c=Us(e,t),l=`if (!isReducible(${i})) return ${Us(e,Jv(t,e.environment))}(${i}, ${Ks(e,t,r)});`,u=rc(e,t.bound.set,r);r.locals.set(n,s);let d=Xv(t,e.environment)?` else break;`:``,f=`if (filterPredicate(${rc(e,t.predicate,r)}, ${c})) addBounded(${o}, ${s});${d}`;return`const ${i} = ${u}; ${l} const ${a} = ${i}.kind === "Interval" ? ${i} : finiteElements(${i}); const ${o} = []; ${Ys(e,a,s,f)} return normalizedSet(${o});`}),$s=(e,t,n,r)=>Js(e,r,r=>{let i=Ws(e),a=Ws(e),o=Ws(e),s=Ws(e),c=Ws(e),l=Ws(e),u=Us(e,Gv(t,e.environment)),d=Ks(e,t,r),f=`if (context.isKeepLazy || !isReducible(${i})) return ${u}.build(${i}, ${d});`,p=rc(e,t.bounds[0].set,r);r.locals.set(n,c);let m=`const ${l} = ${rc(e,t.body,r)}; if (!${a}) ${s}.push(${l});`;return`const ${i} = ${p}; ${f} const ${a} = isBeyondBound(${i}); const ${o} = ${a} ? ${i} : functionDomain(${i}); if (${a}) cardinality(${i}); const ${s} = []; ${Ys(e,o,c,m)} return ${a} ? ${u}.createLazy(${i}, ${d}) : sortedFunction(${o}, ${s});`}),ec=(e,t,n)=>{let r=t.args;if(t.operator===`=>`){let i=rc(e,r[0],n),a=rc(e,r[1],n),o=Us(e,t);return`(implication(${i}, ${o}, "P") ? implication(${a}, ${o}, "Q") : true)`}if(t.operator===`~`&&r.length===1)return`negate(${rc(e,r[0],n)}, ${Us(e,t)})`;if(t.operator===`<=>`)return`equivalent(${rc(e,r[0],n)}, ${rc(e,r[1],n)}, ${Us(e,t)})`;if(M(t))return qs(e,t,n);let i=X_(t.operator,e.environment);if(i?.kind!==`Builtin`)return qs(e,t,n);if(i.name===`DOMAIN`)return`${Us(e,e_(t))}(${rc(e,r[0],n)})`;if(i.name===`TLCEval`)return qs(e,t,n,!0);if(i.name===`\\subseteq`&&i.evaluateBinary&&r.length===2)return`${Us(e,t_(t,i.evaluateBinary))}(${rc(e,r[0],n)}, ${rc(e,r[1],n)})`;let a=e.environment;if(i.evaluateUnary&&r.length===1&&jv(r[0],a))return`${Us(e,i.evaluateUnary)}(${rc(e,r[0],n)})`;let o=r.length===2&&jv(r[0],a)&&jv(r[1],a);return i.evaluateBinary&&o?`${Us(e,i.evaluateBinary)}(${rc(e,r[0],n)}, ${rc(e,r[1],n)})`:qs(e,t,n)},tc=(e,t,n)=>{switch(e.kind){case`Identifier`:{if(t.locals.has(e.name))return!0;if(M(e))return!1;let r=sv(e.name,n);return r?.kind===`Variable`||r?.kind===`Value`}case`Prime`:return tc(e.expression,t,n);case`FieldAccess`:return tc(e.record,t,n);case`FunctionApplication`:return[e.function,...e.args].every(e=>tc(e,t,n));default:return!1}},nc=e=>{switch(e.kind){case`Identifier`:case`Number`:case`String`:return!0;case`FieldAccess`:return nc(e.record);case`FunctionApplication`:return[e.function,...e.args].every(nc);default:return!1}},rc=(e,t,n)=>{let r=(t,r=n)=>rc(e,t,r);switch(t.kind){case`Number`:return _n(t.value)?String(t.value):qs(e,t,n);case`String`:return JSON.stringify(t.value);case`Identifier`:{let r=n.locals.get(t.name);if(r)return r;if(M(t))return qs(e,t,n);let i=sv(t.name,e.environment);if(i?.kind===`Variable`){let r=JSON.stringify(t.name),a=Us(e,t);return`(${n.state}?.[${i.index}] ?? unassigned(${r}, ${a}))`}return i?.kind===`Value`?Us(e,i.value):qs(e,t,n)}case`Apply`:return ec(e,t,n);case`And`:case`Or`:{if(t.operands.length===0)return String(t.kind===`And`);let n=Us(e,t),i=t.kind===`And`?` && `:` || `;return`(${t.operands.map((e,t)=>`junct(${r(e)}, ${n}, ${t})`).join(i)})`}case`If`:return`(condition(${r(t.condition)}, ${Us(e,t)}) ? ${r(t.consequent)} : ${r(t.alternative)})`;case`FunctionApplication`:{Bv(t.function);let i={...n,context:`keepLazyContext(${n.context})`},a=`(applied = ${tc(t.function,n,e.environment)?r(t.function):nc(t.function)?r(t.function,i):qs(e,t.function,i)}, typeof applied === "object" && (applied.kind === "Function" || applied.kind === "LazyFunction") ? applied : expectFunction(applied, ${Us(e,t)}))`,o=$g(e.environment.runtime.version),s=o?`, ${Us(e,o)}`:``;return t.args.length===1?`apply(${a}, ${r(t.args[0])}${s})`:`apply(${a}, tuple([${t.args.map(e=>r(e)).join(`, `)}])${s})`}case`FieldAccess`:return`${Us(e,Qg(t))}(${r(t.record)})`;case`Record`:{let i=ty(t.fields);if(ny(i))return qs(e,t,n);let a=Us(e,i.map(e=>e.name)),o=`[${t.fields.map(e=>r(e.value)).join(`, `)}]`,s=t.fields.map(e=>e.name);return s.every((e,t)=>e===i[t].name)?`record(${a}, ${o})`:`writtenRecord(${a}, ${Us(e,i.map(e=>t.fields.indexOf(e)))}, ${o}, ${Us(e,s)})`}case`Tuple`:return`tuple([${t.elements.map(e=>r(e)).join(`, `)}])`;case`SetEnumeration`:return`set([${t.elements.map(e=>r(e)).join(`, `)}])`;case`Prime`:return n.isPrimed?qs(e,t,n):r(t.expression,{context:`(primed ??= prime(${n.context}))`,state:n.next,next:`undefined`,isPrimed:!0,locals:n.locals});case`Unchanged`:return`equal(${r({kind:`Prime`,expression:t.expression,location:t.location})}, ${r(t.expression)})`;case`Forall`:case`Exists`:return t.bounds.every(e=>e.pattern.kind===`Name`)?Xs(e,t,n):qs(e,t,n);case`Choose`:return t.set&&t.pattern.kind===`Name`?Zs(e,t,t.set,t.pattern.name,n):qs(e,t,n);case`FunctionConstruction`:{let r=t.bounds[0];return t.bounds.length===1&&r.pattern.kind===`Name`&&!t.isRecursive&&!Wv(t)?$s(e,t,r.pattern.name,n):qs(e,t,n)}case`SetFilter`:return t.bound.pattern.kind===`Name`?Qs(e,t,t.bound.pattern.name,n):qs(e,t,n);default:return qs(e,t,n)}},ic=(e,t)=>{if(!Rs.has(e.kind)||(Vs??=Hs(),!Vs))return;let n={environment:t,references:[],helpers:[],counter:0},r=rc(n,e,{context:`context`,state:`state`,next:`next`,isPrimed:!1,locals:/* @__PURE__ */ new Map}),i=n.references.map((e,t)=>`reference${t}`),a=`${n.helpers.join(`
77
77
  `)}\nreturn (context) => { const state = context.state; const next = context.next; let primed; let applied; return ${r}; };`;return Bs??=zs(),Function(...Object.keys(Bs),...i,a)(...Object.values(Bs),...n.references)},ac=/* @__PURE__ */ `STRING,FALSE,TRUE,BOOLEAN,=,/=,.,',\\lnot,\\neg,\\land,\\lor,\\equiv,=>,SUBSET,UNION,DOMAIN,\\subseteq,\\in,\\notin,\\,\\intersect,\\union,\\times,~>,[],<>,ENABLED,UNCHANGED,\\cdot,-+->,$AngleAct,$BoundedChoose,$BoundedExists,$BoundedForall,$CartesianProd,$Case,$ConjList,$DisjList,$Except,$FcnApply,$FcnConstructor,$IfThenElse,$NonRecursiveFcnSpec,$Pair,$RcdConstructor,$RcdSelect,$RecursiveFcnSpec,$Seq,$SetEnumerate,$SetOfAll,$SetOfFcns,$SetOfRcds,$SF,$SquareAct,$SubsetOf,$TemporalExists,$TemporalForall,$TemporalWhile,$Tuple,$UnboundedChoose,$UnboundedExists,$UnboundedForall,$WF,$Nop,$Qed,$Pfcase,$Have,$Take,$Pick,$Witness,$Suffices`.split(`,`),oc=[[`\\lnot`,`~`,`\\neg`,`¬`],[`[]`,`□`],[`<>`,`◇`],[`\\land`,`/\\`,`∧`],[`\\lor`,`\\/`,`∨`],[`\\equiv`,`<=>`,`≡`,`⇔`],[`/=`,`#`,`≠`],[`\\leq`,`<=`,`=<`,`≤`],[`\\geq`,`>=`,`≥`],[`\\times`,`\\X`,`×`],[`\\intersect`,`\\cap`,`∩`],[`\\union`,`\\cup`,`∪`],[`\\o`,`\\circ`,`∘`],[`\\oplus`,`(+)`,`⊕`],[`\\ominus`,`(-)`,`⊖`],[`\\odot`,`(.)`,`⊙`],[`\\oslash`,`(/)`,`⊘`],[`\\otimes`,`(\\X)`,`⊗`],[`\\approx`,`≈`],[`:=`,`≔`],[`\\asymp`,`≍`],[`\\bigcirc`,`◯`],[`::=`,`⩴`],[`\\bullet`,`●`],[`\\cdot`,`⋅`],[`\\cong`,`≅`],[`\\div`,`÷`],[`\\doteq`,`≐`],[`..`,`‥`],[`...`,`…`],[`!!`,`‼`],[`\\gg`,`≫`],[`=>`,`⇒`],[`\\in`,`∈`],[`=|`,`⫤`],[`~>`,`↝`],[`\\ll`,`≪`],[`-|`,`⊣`],[`\\notin`,`∉`],[`-+->`,`⇸`],[`\\prec`,`≺`],[`\\preceq`,`⪯`],[`\\propto`,`∝`],[`??`,`⁇`],[`|=`,`⊨`],[`|-`,`⊢`],[`\\sim`,`∼`],[`\\simeq`,`≃`],[`\\sqcap`,`⊓`],[`\\sqcup`,`⊔`],[`\\sqsubset`,`⊏`],[`\\sqsubseteq`,`⊑`],[`\\sqsupset`,`⊐`],[`\\sqsupseteq`,`⊒`],[`\\star`,`⋆`],[`\\subset`,`⊂`],[`\\subseteq`,`⊆`],[`\\succ`,`≻`],[`\\succeq`,`⪰`],[`\\supset`,`⊃`],[`\\supseteq`,`⊇`],[`\\uplus`,`⊎`],[`||`,`‖`],[`\\wr`,`≀`],[`^+`,`⁺`]],sc=new Map(oc.flatMap(e=>e.slice(1).map(t=>[t,e[0]]))),cc=e=>e.split(`!`).map(e=>sc.get(e)??(e===`~`?`\\lnot`:e)).join(`!`),lc=/* @__PURE__ */ `STRING,FALSE,TRUE,BOOLEAN,=,/=,.,',\\lnot,\\neg,\\land,\\lor,\\equiv,=>,SUBSET,UNION,DOMAIN,\\subseteq,\\in,\\notin,\\,\\intersect,\\union,\\times,~>,[],<>,ENABLED,UNCHANGED,\\cdot,-+->,$AngleAct,$BoundedChoose,$BoundedExists,$BoundedForall,$CartesianProd,$Case,$ConjList,$DisjList,$Except,$FcnApply,$FcnConstructor,$IfThenElse,$NonRecursiveFcnSpec,$Pair,$RcdConstructor,$RcdSelect,$RecursiveFcnSpec,$Seq,$SetEnumerate,$SetOfAll,$SetOfFcns,$SetOfRcds,$SF,$SquareAct,$SubsetOf,$TemporalExists,$TemporalForall,$TemporalWhile,$Tuple,$UnboundedChoose,$UnboundedExists,$UnboundedForall,$WF,$Nop,$Qed,$Pfcase,$Have,$Take,$Pick,$Witness,$Suffices,***I do not exist***,--TLA+ BUILTINS--,Formal_0,Formal_1,Formal_2,[,^,/,*,-,-.,+,^+,^*,^#,<,\\leq,>,\\geq,...,..,|,||,&&,&,$$,$,??,%%,%,##,++,--,**,//,^^,@@,!!,|-,|=,-|,=|,<:,:>,:=,::=,\\oplus,\\ominus,\\odot,\\oslash,\\otimes,\\uplus,\\sqcap,\\sqcup,\\div,\\wr,\\star,\\o,\\bigcirc,\\bullet,\\prec,\\succ,\\preceq,\\succeq,\\sim,\\simeq,\\ll,\\gg,\\asymp,\\subset,\\supset,\\supseteq,\\approx,\\cong,\\sqsubset,\\sqsubseteq,\\sqsupset,\\sqsupseteq,\\doteq,\\propto,~,¬,□,◇,/\\,∧,\\/,∨,<=>,≡,⇔,#,≠,<=,=<,≤,>=,≥,\\X,×,\\cap,∩,\\cup,∪,\\circ,∘,(+),⊕,(-),⊖,(.),⊙,(/),⊘,(\\X),⊗,≈,≔,≍,◯,⩴,●,⋅,≅,÷,≐,‥,…,‼,≫,⇒,∈,⫤,↝,≪,⊣,∉,⇸,≺,⪯,∝,⁇,⊨,⊢,∼,≃,⊓,⊔,⊏,⊑,⊐,⊒,⋆,⊂,⊆,≻,⪰,⊃,⊇,⊎,‖,≀,⁺,@`.split(`,`),uc=/* @__PURE__ */ `exit.pause.config.spec.coverage.action.install.id.behavior.all.mode.deadlock.seed.fingerprint.worker.traces.depth.aril.sched.revision.timestamp.date.count.tag.calver.impliedinits.impliedactions.invariants.impliedtemporals.temporals.actions.inits.variables.actionconstraints.constraints.stats.duration.generated.diameter.distinct.initial.queue.retries.distinctvalues.levelmean.levelvariance.bfs.beginLine.beginColumn.endLine.endColumn.module.name.location.context.parameters._action`.split(`.`),dc=/* @__PURE__ */ `Not a node.N_ActDecl.N_ActionExpr.N_AssumeDecl.N_AssumeProve.N_Assumption.N_BeginModule.N_Body.N_BoundedQuant.N_Case.N_CaseArm.N_CaseStatement.N_ChooseStatement.N_ConjItem.N_ConjList.N_ConsDecl.N_DisjItem.N_DisjList.N_EndModule.N_Except.N_ExceptComponent.N_ExceptSpec.N_Times.N_Extends.N_FairnessExpr.N_FcnAppl.N_FcnConst.N_FieldSet.N_FieldVal.N_FunctionDefinition.N_FunctionParam.N_GeneralId.N_GenInfixOp.N_GenNonExpPrefixOp.N_GenPostfixOp.N_GenPrefixOp.N_IdentDecl.N_Real.N_IdentifierTuple.N_IdentLHS.N_IdPrefix.N_IdPrefixElement.N_IfThenElse.N_InfixDecl.N_InfixExpr.N_InfixLHS.N_InfixOp.N_InnerProof.N_Instance.N_NonLocalInstance.N_Integer.N_LeafProof.N_LetDefinitions.N_LetIn.N_MaybeBound.N_Module.N_ModuleDefinition.N_NonExpPrefixOp.N_Number.N_NumberedAssumeProve.N_OpApplication.N_OpArgs.N_OperatorDefinition.N_OtherArm.N_ParamDecl.N_ParamDeclaration.N_ParenExpr.N_PostfixDecl.N_PostfixExpr.N_PostfixLHS.N_PostfixOp.N_PrefixDecl.N_PrefixExpr.N_PrefixLHS.N_PrefixOp.N_Proof.N_ProofLet.N_ProofName.N_ProofStatement.N_ProofStep.N_QEDStep.N_QuantBound.N_RcdConstructor.N_RecordComponent.N_SetEnumerate.N_SetOfAll.N_SetOfFcns.N_SetOfRcds.N_String.N_SubsetOf.N_Substitution.N_TempDecl.N_Theorem.N_Tuple.N_UnBoundedOrBoundedChoose.N_UnboundedQuant.N_VariableDeclaration.Token =.Token \\in.N_NewSymb.N_Lambda.N_Recursive.N_Label.N_StructOp.N_NumerableStep.N_TerminalProof.N_UseOrHide.N_NonExprBody.N_DefStep.N_HaveStep.N_TakeStep.N_WitnessStep.N_PickStep.N_CaseStep.N_AssertStep`.split(`.`),fc=/* @__PURE__ */ new Map([[`Naturals`,`-------------------------------- MODULE Naturals ----------------------------
78
78
  Nat == { }
79
79
  a+b == {a, b}
@@ -392,7 +392,7 @@ _PrintCounts == PrintT(_Counts)
392
392
  =============================================================================
393
393
  `]]),pc=/* @__PURE__ */ new Map([[`Bags`,/* @__PURE__ */ new Map([[`IsABag`,`public static tlc2.value.IBoolValue tlc2.module.Bags.IsABag(tlc2.value.impl.Value)`],[`BagCardinality`,`public static tlc2.value.impl.IntValue tlc2.module.Bags.BagCardinality(tlc2.value.impl.Value)`],[`BagIn`,`public static tlc2.value.IBoolValue tlc2.module.Bags.BagIn(tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`CopiesIn`,`public static tlc2.value.impl.IntValue tlc2.module.Bags.CopiesIn(tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`\\oplus`,`public static tlc2.value.impl.Value tlc2.module.Bags.BagCup(tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`\\ominus`,`public static tlc2.value.impl.Value tlc2.module.Bags.BagDiff(tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`BagUnion`,`public static tlc2.value.impl.Value tlc2.module.Bags.BagUnion(tlc2.value.impl.Value)`],[`\\sqsubseteq`,`public static tlc2.value.IBoolValue tlc2.module.Bags.SqSubseteq(tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`BagOfAll`,`public static tlc2.value.impl.Value tlc2.module.Bags.BagOfAll(tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`BagToSet`,`public static tlc2.value.impl.Value tlc2.module.Bags.BagToSet(tlc2.value.impl.Value)`],[`SetToBag`,`public static tlc2.value.impl.Value tlc2.module.Bags.SetToBag(tlc2.value.impl.Value)`]])],[`FiniteSets`,/* @__PURE__ */ new Map([[`IsFiniteSet`,`public static tlc2.value.IBoolValue tlc2.module.FiniteSets.IsFiniteSet(tlc2.value.impl.Value)`],[`Cardinality`,`public static tlc2.value.impl.IntValue tlc2.module.FiniteSets.Cardinality(tlc2.value.impl.Value)`]])],[`Sequences`,/* @__PURE__ */ new Map([[`Seq`,`public static tlc2.value.impl.Value tlc2.module.Sequences.Seq(tlc2.value.impl.Value)`],[`Len`,`public static tlc2.value.impl.IntValue tlc2.module.Sequences.Len(tlc2.value.impl.Value)`],[`Head`,`public static tlc2.value.impl.Value tlc2.module.Sequences.Head(tlc2.value.impl.Value)`],[`Tail`,`public static tlc2.value.impl.Value tlc2.module.Sequences.Tail(tlc2.value.impl.Value)`],[`Append`,`public static tlc2.value.impl.Value tlc2.module.Sequences.Append(tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`\\o`,`public static tlc2.value.impl.Value tlc2.module.Sequences.Concat(tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`SubSeq`,`public static tlc2.value.impl.Value tlc2.module.Sequences.SubSeq(tlc2.value.impl.Value,tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`SelectSeq`,`public static tlc2.value.impl.Value tlc2.module.Sequences.SelectSeq(tlc2.value.impl.Value,tlc2.value.impl.Value)`]])],[`TLC`,/* @__PURE__ */ new Map([[`Print`,`public static tlc2.value.impl.Value tlc2.module.TLC.Print(tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`PrintT`,`public static tlc2.value.impl.Value tlc2.module.TLC.PrintT(tlc2.value.impl.Value)`],[`ToString`,`public static tlc2.value.impl.Value tlc2.module.TLC.ToString(tlc2.value.impl.Value)`],[`Assert`,`public static tlc2.value.impl.Value tlc2.module.TLC.Assert(tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`:>`,`public static tlc2.value.impl.Value tlc2.module.TLC.MakeFcn(tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`@@`,`public static tlc2.value.impl.Value tlc2.module.TLC.CombineFcn(tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`SortSeq`,`public static tlc2.value.impl.Value tlc2.module.TLC.SortSeq(tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`Permutations`,`public static tlc2.value.impl.Value tlc2.module.TLC.Permutations(tlc2.value.impl.Value)`],[`RandomElement`,`public static tlc2.value.impl.Value tlc2.module.TLC.RandomElement(tlc2.value.impl.Value)`],[`TLCEval`,`public static tlc2.value.impl.Value tlc2.module.TLCEval.tlcEval(tlc2.tool.impl.Tool,tla2sany.semantic.ExprOrOpArgNode[],tlc2.util.Context,tlc2.tool.TLCState,tlc2.tool.TLCState,int,tlc2.tool.coverage.CostModel)`]])],[`TLCExt`,/* @__PURE__ */ new Map([[`AssertError`,`public static synchronized tlc2.value.impl.Value tlc2.module.TLCExt.assertError(tlc2.tool.impl.Tool,tla2sany.semantic.ExprOrOpArgNode[],tlc2.util.Context,tlc2.tool.TLCState,tlc2.tool.TLCState,int,tlc2.tool.coverage.CostModel)`],[`PickSuccessor`,`public static synchronized tlc2.value.impl.Value tlc2.module.TLCExt.pickSuccessor(tlc2.tool.impl.Tool,tla2sany.semantic.ExprOrOpArgNode[],tlc2.util.Context,tlc2.tool.TLCState,tlc2.tool.TLCState,int,tlc2.tool.coverage.CostModel)`],[`ToTrace`,`public static tlc2.value.impl.Value tlc2.module.TLCExt.lassoOrdinal(tlc2.value.impl.Value)`],[`CounterExample`,`public static tlc2.value.impl.Value tlc2.module.TLCExt.error(tlc2.tool.impl.Tool,tla2sany.semantic.ExprOrOpArgNode[],tlc2.util.Context,tlc2.tool.TLCState,tlc2.tool.TLCState,int,tlc2.tool.coverage.CostModel) throws java.io.IOException`],[`Trace`,`public static tlc2.value.impl.TupleValue tlc2.module.TLCExt.getTrace(tlc2.tool.impl.Tool,tla2sany.semantic.ExprOrOpArgNode[],tlc2.util.Context,tlc2.tool.TLCState,tlc2.tool.TLCState,int,tlc2.tool.coverage.CostModel) throws java.io.IOException`],[`TLCDefer`,`public static tlc2.value.impl.Value tlc2.module.TLCExt.tlcDefer(tlc2.tool.impl.Tool,tla2sany.semantic.ExprOrOpArgNode[],tlc2.util.Context,tlc2.tool.TLCState,tlc2.tool.TLCState,int,tlc2.tool.coverage.CostModel)`],[`TLCNoOp`,`public static tlc2.value.impl.Value tlc2.module.TLCExt.tlcNoOp(tlc2.value.impl.Value)`],[`TLCModelValue`,`public static synchronized tlc2.value.impl.Value tlc2.module.TLCExt.tlcModelValue(tlc2.value.impl.Value)`],[`TLCCache`,`public static tlc2.value.impl.Value tlc2.module.TLCExt.tlcEval2(tlc2.tool.impl.Tool,tla2sany.semantic.ExprOrOpArgNode[],tlc2.util.Context,tlc2.tool.TLCState,tlc2.tool.TLCState,int,tlc2.tool.coverage.CostModel)`],[`TLCFP`,`public static synchronized tlc2.value.impl.IntValue tlc2.module.TLCExt.tlcFingerprint(tlc2.value.impl.Value)`],[`TLCEvalDefinition`,`public static tlc2.value.impl.Value tlc2.module.TLCExt.tlcDefByName(tlc2.tool.impl.Tool,tla2sany.semantic.ExprOrOpArgNode[],tlc2.util.Context,tlc2.tool.TLCState,tlc2.tool.TLCState,int,tlc2.tool.coverage.CostModel)`],[`TLCGetOrDefault`,`public static tlc2.value.impl.Value tlc2.module.TLCExt.tlcGetOrDefault(tlc2.value.impl.Value,tlc2.value.impl.Value)`]])]]),mc={kind:`Local`},hc=`$subexpression`,gc=/* @__PURE__ */ new WeakSet,_c=/* @__PURE__ */ new WeakMap,vc=/* @__PURE__ */ new WeakMap,yc=/* @__PURE__ */ new WeakMap,bc=/* @__PURE__ */ new WeakMap,xc=/* @__PURE__ */ new WeakMap,Sc=/* @__PURE__ */ new WeakMap,Cc=/* @__PURE__ */ new WeakSet,wc=/* @__PURE__ */ new WeakSet,Tc=e=>wc.has(e)||Ec(xc.get(e))!==void 0,Ec=e=>e?.find(e=>e.isEmpty?Tc(e.node):Cc.has(e.node))?.error,Dc=/* @__PURE__ */ new WeakMap,Oc=e=>{let t=e.lastIndexOf(`@`);return t>0&&t<e.length-1},kc=new Map([...[`~>`,`-+->`,`\\cdot`,`\\X`].map(e=>[e,{key:e,arity:2,kind:`Builtin`}]),[`'`,{key:`'`,arity:1,kind:`Builtin`}]]),Ac=(e,t)=>e.line<t.line||e.line===t.line&&e.column<t.column,jc=(e,t)=>Ac(e,t)?-1:+!!Ac(t,e),Mc=e=>e.kind===`Operator`?e.params.length:0,Nc=e=>e.kind===`Operator`?e.params.map(e=>e.arity):[],Pc=e=>e.name.includes(`!`),Fc=(e,t)=>{for(let n=e;n;n=n.parent)if(n.name===t)return n},Ic=(e,t,n)=>{let r=t.bindings.get(e);return r&&Ac(r.position,t.location)&&(!n||Ac(r.position,n.start))?r:void 0},Lc=(e,t)=>e!==void 0&&t!==void 0&&g(e)===g(t),Rc=(e,t,n,r)=>{if(t===void 0)return!0;if(Lc(t.range,n.range))return!1;let i=n.range;if(i===void 0||r.isGenerated||t.kind!==`Builtin`&&!t.range)return!0;let a=g(i),o=t.range&&g(t.range);return t.kind===`Builtin`?r.errors.push({location:a,message:`Symbol ${cc(e)} is a built-in operator, and cannot be redefined.`}):n.kind===`Parameter`||t.kind!==n.kind||t.arity!==n.arity?r.errors.push({location:a,message:`Multiply-defined symbol '${cc(e)}': this definition or declaration conflicts \nwith the one at ${o}.`}):r.warnings.push({location:a,message:`Multiple declarations or definitions for symbol ${cc(e)}. \nThis duplicates the one at ${o}.`}),!1},zc=(e,t,n,r)=>Rc(t,Fc(e,t)??Ic(t,r,n.range),n,r)?{...n,name:t,parent:e}:e,Bc=(e,t,n)=>{Rc(e,n.bindings.get(e),t,n)&&n.bindings.set(e,{...t,position:n.location})},Vc=(e,t,n,r)=>t.reduce((e,t,i)=>zc(e,t,{kind:`Parameter`,arity:0,range:n?.[i]},r),e),Hc=(e,t,n)=>t.reduce((e,t)=>zc(e,t.name,{kind:`Parameter`,arity:t.arity,range:t.location?.range},n),e),Uc=e=>e.kind===`Name`?[e.name]:e.names,Wc=e=>e.flatMap(e=>Uc(e.pattern)),Gc=(e,t)=>{let n=t.definitions.get(e);return n!==void 0&&(n===t.self?n.isRecursive:n.isRecursive?Ic(e,t,void 0)!==void 0:Ac(n.location,t.location))?n:void 0},Kc=(e,t)=>{let n=Gc(e,t);if(n){let r=n.isRecursive?t.bindings.get(e):void 0;return{key:t.getKey(n),arity:r?.arity??Mc(n),params:r?.params??Nc(n),kind:`Definition`,range:n.location.range}}let r=Ic(e,t,void 0);return r?.isPending?{key:e,arity:r.arity,params:r.params,kind:r.kind}:r?t.imported.get(e):void 0},qc=(e,t)=>t.facts.has(e)||t.bindings.get(e)?.kind===`Theorem`,Jc=(e,t)=>t.bindings.get(e)?.kind===`Theorem`?t.goals.get(e):void 0,Yc=(e,t,n)=>Fc(t,e)??Kc(e,n),Xc=(e,t)=>({module:e.range?.module??``,start:e,end:{line:e.line,column:e.column+t.length-1}}),Zc=(e,t)=>{let n=e.kind===`OperatorReference`?void 0:e.selectorRanges?.at(-1);return n?{module:n.module,start:e.location,end:n.end}:Xc(e.location,e.spelling??t)},Qc=e=>{if(!(e.kind!==`Apply`||e.argumentsRange)){if(e.args.length===2)return`infix`;if(e.args.length===1)return e.operator===`-.`?`prefix`:`postfix`}},$c=`In module --TLA+ BUILTINS--`,el=/* @__PURE__ */ new Set([`Definition`,`Instance`,`Theorem`]),tl=(e,t,n)=>n.errors.push({location:g(t),message:`Cannot take subexpression of \`${cc(e)}'.`}),nl=e=>!/^[\p{L}\d_]/u.test(e),rl=e=>e.startsWith(`<`)&&(e[1]>=`0`&&e[1]<=`9`||e[1]===`*`),il=(e,t)=>typeof e==`number`?e>=1&&e<=t?e-1:-1:e===`<<`?t>0?0:-1:t===2?1:-1,al=(e,t,n)=>{let r=e.split(`!`),i=n??r.map((e,n)=>n===r.length-1?t.length:0);return r.map((e,n)=>{let r=i.slice(0,n).reduce((e,t)=>e+t,0);return{kind:`Name`,name:e,args:t.slice(r,r+i[n])}})},ol=e=>e.kind===`Subexpression`?e.selectors:e.kind===`Identifier`?al(e.name,[],void 0):al(e.operator,e.args,e.argumentCounts),sl=e=>e.filter((t,n)=>n===0||e[n-1].set!==t.set).map(e=>e.set),cl=e=>{switch(e.kind){case`Forall`:case`Exists`:case`FunctionConstruction`:return{names:Wc(e.bounds),body:e.body,sets:sl(e.bounds)};case`SetMap`:return{names:Wc(e.bounds),body:e.expression,sets:sl(e.bounds)};case`SetFilter`:return{names:Uc(e.bound.pattern),body:e.predicate,sets:[e.bound.set]};case`Choose`:return{names:Uc(e.pattern),body:e.body,sets:e.set?[e.set]:[]};case`UnboundedQuantifier`:case`Lambda`:return{names:e.kind===`Lambda`?e.params:e.names,body:e.body,sets:[]};default:return}},ll=e=>{switch(e.kind){case`Apply`:return e.args;case`And`:case`Or`:return e.operands;case`If`:return[e.condition,e.consequent,e.alternative];case`Tuple`:case`SetEnumeration`:return e.elements;case`Record`:case`RecordSet`:return e.fields.map(e=>e.value);case`FunctionApplication`:return[e.function,e.args.length===1?e.args[0]:{kind:`Tuple`,elements:e.args,location:e.location}];case`FieldAccess`:return[e.record,{kind:`String`,value:e.field,location:e.location}];case`Prime`:case`Unchanged`:case`Enabled`:case`Always`:case`Eventually`:return[e.expression];case`BoxAction`:case`AngleAction`:return[e.action,e.subscript];case`WeakFairness`:case`StrongFairness`:return[e.subscript,e.action];case`FunctionSet`:return[e.domain,e.range];case`Product`:return e.factors;case`Except`:return[e.function];default:return}},ul=e=>e.kind===`Identifier`||e.kind===`Apply`||e.kind===`Subexpression`,dl=(e,t)=>e.assumptions.slice(0,t).some(e=>e.kind===`NewSymbol`),fl=(e,t)=>{if(e.kind===`Label`)return e.name===t?e:void 0;if(e.kind!==`Lambda`)return e.kind===`Let`?fl(e.body,t):mt(e).reduce((e,n)=>e??fl(n,t),void 0)},pl=(e,t,n)=>{if(e.kind===`AssumeProve`)return[...e.assumptions,e.conclusion].reduce((r,i,a)=>r??pl(i,t,n||dl(e,a)),void 0);if(!n)return e.kind===`NewSymbol`?e.set&&fl(e.set,t):fl(e,t)},ml=e=>e.kind===`Label`?ml(e.body):e,hl=e=>typeof e==`number`?`argument selector ${e}`:e,gl=`within the scope of a declaration
394
394
  from outside that declaration's scope.`,_l=(e,t,n,r,i)=>{let a=(t,n)=>{let i=(t===void 0?void 0:e.selectorRanges?.[t])??e.location.range;i&&r.errors.push({location:g(i),message:n})},o=n.isSuffices===n.isInProof,s=n.statement,c={node:s,isGoal:!0,isSufficesOpen:n.isSuffices},l=0,u=0;for(let[e,n]of t.slice(1).entries()){let r=e+1,i=c.node;if(n.kind===`Name`){if(t[r-1].kind!==`Name`)return i.kind!==`NewSymbol`&&i.kind!==`AssumeProve`&&ml(i).kind===`Let`?i:a(r-1,`A name selector here must be from a LET clause.`);let e=s.kind===`AssumeProve`?[...s.assumptions,s.conclusion]:[s],l=r===1?e.map((e,t)=>({position:t,label:pl(e,n.name,!1)})).find(e=>e.label!==void 0):{position:0,label:i.kind===`Label`?fl(i.body,n.name):void 0};if(!l?.label)return a(r,`Cannot find label \`${n.name}'.`);if(r===1&&s.kind===`AssumeProve`&&dl(s,l.position)&&o)return a(1,`Accessing subexpression labeled \`${n.name}' of ASSUME/PROVE clause ${gl}`);if(n.args.length!==l.label.params.length)return a(r,`Label \`${n.name}' used with wrong number of arguments.`);c.node=l.label,c.isGoal=!1,c.isSufficesOpen=!1;continue}if(n.kind===`Colon`)return i;let d=n.kind===`Operand`?hl(n.operand):n.kind===`At`?`@`:`!(...)`,f=e=>n.kind===`Operand`?il(n.operand,e):-1,p=`An unexpected null node specified by '${d}'.\nThis is probably due to a previous error.`;if(c.isSufficesOpen){if(f(1)!==0)return a(r,i.kind===`AssumeProve`?`Accessing non-existent subexpression of a SUFFICES`:`Nonexistent operand specified by \`${d}'.`);c.isSufficesOpen=!1;continue}if(i.kind===`NewSymbol`)return i;if(i.kind!==`AssumeProve`){let e=ml(i);if(Cc.has(e))return a(r,`Subexpression selection failed, probably due to an error in the selected expression.`);if([`Number`,`Decimal`,`String`].includes(e.kind))return a(r,`Selecting subexpression of expression that has none.`);if(Tc(e))return a(r,`Choosing operand \`${d}' of subexpression with no operands.`);let t=cl(e);if(t&&n.kind!==`Operand`){let e=n.kind===`Bound`?n.args.length:0;if(n.kind===`Bound`&&e!==t.names.length)return a(r,`Selector with ${e} argument(s) used for quantifier with ${t.names.length} bound identifier(s).`);l+=t.names.length,u+=e,c.node=t.body,c.isGoal=!1;continue}let o=t?.sets,s=e.kind===`Identifier`?[]:o?o.length>0?o:void 0:ll(e);if(!s)return i;let m=e.kind===`Except`,h=f(m?e.updates.length+1:s.length);if(h===-1)return a(r,`Nonexistent operand specified by \`${d}'.`);if(m&&h>0)return a(r,`Selecting subexpression of an EXCEPT not yet implemented.`);if(c.node=s[h],c.isGoal=!1,Cc.has(c.node))return a(r,p);continue}let m=[...i.assumptions,i.conclusion],h=f(m.length);if(h===-1)return a(r,`Nonexistent operand specified by \`${d}'.`);if(dl(i,h)&&(!c.isGoal||o))return a(r,`Accessing ASSUME/PROVE clause ${gl}`);let g=m[h];if(g.kind===`NewSymbol`&&r!==t.length-1)return a(r,`Selected a subexpression of a NEW clause of an ASSUME.`);if(c.node=g,c.isGoal=!1,g.kind!==`NewSymbol`&&g.kind!==`AssumeProve`&&Cc.has(g))return a(r,p)}return c.node.kind===`AssumeProve`?i?c.node:a(void 0,`Selected ASSUME/PROVE instead of expression.`):c.node.kind===`NewSymbol`?i?c.node:a(void 0,`Selected a NEW declaration as an expression or operator.`):l===u?c.node:a(void 0,`Expected ${l} arguments but found ${u}.`)},vl=(e,t)=>{let n=t.isGenerated?void 0:t.hasLabelScope?t.isLabelForbidden?`Label not allowed within scope of declaration in nested ASSUME/PROVE.`:t.isInExcept?`Labels inside EXCEPT clauses are not yet implemented.`:void 0:`Label not in definition or proof step.`;return n===void 0||!e.location.range?!1:(t.errors.push({location:g(e.location.range),message:n}),!0)},yl=(e,t,n)=>{let r=e.location.range;if(!r||n.isGenerated)return;let i=g(r),a=e.params.filter((r,i)=>{let a=Fc(t,r)?.kind===`Parameter`,o=e.paramRanges?.[i];return!a&&o&&n.errors.push({location:g(o),message:`Illegal parameter ${r} of label \`${e.name}'.`}),a});a.filter((e,t)=>a.indexOf(e)!==t).forEach(t=>n.errors.push({location:i,message:`Repeated formal parameter ${t} \nin label \`${e.name}'.`})),n.labelParams.filter(e=>!a.includes(e)).forEach(t=>n.errors.push({location:i,message:`Label ${e.name} must contain formal parameter \`${t}'.`}));let o=[...new Set(a.filter(e=>!n.labelParams.includes(e))),...e.params.filter(e=>!a.includes(e))];o.length>0&&n.errors.push({location:i,message:`Label ${e.name} declares extra parameter(s) ${o.map(e=>`${e} `).join(``)}`}),n.labels.has(e.name)&&n.errors.push({location:i,message:`Duplicate label \`${e.name}'.`}),n.labels.add(e.name)},bl=(e,t,n,r)=>{if(!ul(e))return!1;let i=ol(e),a=i[0],o=i.length>1&&a.kind===`Name`?Fc(t,a.name)?.goal??Jc(a.name,n):void 0;return o&&{node:_l(e,i,o,n,r)}},xl=(e,t,n,r)=>{let i=e.location;if(Pl(e,n,r))return;let a=Dc.get(e);if(a!==void 0)return a;if(Oc(t))return e.kind===`Apply`?e.args.length:0;let o=Fc(n,t);if(o?.isNonFact){r.errors.push({location:g(Zc(e,t)),message:`Step number of non-expression step used as an expression.`});return}let s=o?.goal?.keyword;if(s){r.errors.push({location:g(Zc(e,t)),message:`${s} proof step selected instead of expression.`});return}if(bl(e,n,r,!1)||rl(t)&&o)return e.kind===`Apply`?e.args.length:0;if(o&&e.kind!==`OperatorReference`&&(e.resolution=mc),o)return o.arity;let c=Kc(t,r);if(c)return e.kind===`Identifier`?e.name=c.key:e.operator=c.key,Dc.set(e,c.arity),c.arity;let l=t.includes(`!`)?t.slice(0,t.indexOf(`!`)):``,u=l===``?void 0:Fc(n,l)??Kc(l,r);if(u&&!el.has(u.kind)){tl(l,e.kind!==`OperatorReference`&&e.selectorRanges?.[0]||Zc(e,t),r);return}if(e.kind!==`OperatorReference`&&l!==``&&Il(l,e.kind===`Apply`&&e.argumentCounts?e.args.slice(0,e.argumentCounts[0]):[],e.selectorRanges?.[0],(e.kind===`Apply`?e.argumentRanges?.[0]:void 0)??i.range,n,r))return;if(u||l!==``&&qc(l,r))return e.kind===`Apply`?e.args.length:0;let d=Qc(e),f=e.kind===`OperatorReference`||d!==void 0;if(!nl(t)||rl(t)||!f){r.errors.push({location:g(Zc(e,t)),message:`Unknown operator: \`${cc(t)}'.`});return}let p=e.spelling??t;r.errors.push({location:g(d===`prefix`&&p===`-.`?Xc(i,`-`):Zc(e,t)),message:`Could not find declaration or definition of symbol '${p}'.`}),d&&Cc.add(e),d&&i.range&&r.errors.push({location:g(i.range),message:`Couldn't resolve ${d} operator symbol \`${p}'.`})},Sl=(e,t,n)=>(e.forEach(e=>B(e.set,t,n)),e.reduce((e,t)=>Vc(e,Uc(t.pattern),t.pattern.ranges,n),t)),Cl=(e,t)=>e.kind===`Identifier`&&e.name===t&&M(e)||mt(e).some(e=>Cl(e,t)),wl=(e,t)=>{e.kind===`FunctionConstruction`&&Cl(e.body,t)&&(e.isRecursive=!0),mt(e).forEach(e=>wl(e,t))},Tl=(e,t,n,r)=>{let i={...n,hasLabelScope:!0,labelParams:e.kind===`Function`?Wc(e.bounds):[],labels:/* @__PURE__ */ new Set},a=e.name,o=e.location.range,s=e=>{o&&!i.isGenerated&&i.errors.push({location:g(o),message:e})},c=e.kind===`Function`?Sl(e.bounds,t,i):Hc(t,e.params,i),l=Fc(c,a)??Ic(a,i,o),u=l?.isPending===!0&&r.has(l);return l?.isPending&&!u?s(`Recursive ${e.kind===`Function`?`function`:`operator`} ${cc(a)} defined at wrong LET/IN level.`):l&&!u?s(e.kind===`Function`?`Function name \`${a}' already defined or declared.`:`Operator ${cc(a)} already defined or declared.`):l&&e.kind===`Function`&&l.arity>0?s(`Function ${cc(a)} has operator arguments in its RECURSIVE declaration.`):l&&e.kind===`Operator`&&(l.arity!==e.params.length||e.params.some(e=>e.arity>0))&&s(`Definition of ${cc(a)} has different arity than its RECURSIVE declaration.`),l&&u&&e.kind===`Operator`&&(l.params=Nc(e)),e.kind===`Function`?(B(e.body,{name:a,kind:`Parameter`,arity:0,range:o,parent:c},i),wl(e.body,a),e.isSelfReferential=Cl(e.body,a)):B(e.body,c,i),l&&u?((e.kind===`Operator`||l.arity===0)&&(l.isPending=!1,l.range=o),!1):e.kind===`Function`?l===void 0:Rc(a,Fc(t,a)??Ic(a,i,o),{kind:`Definition`,arity:Mc(e),range:o},i)},El=(e,t,n,r=[],i=[])=>{let a=/* @__PURE__ */ new Set,o=e.filter(e=>e.isRecursive&&i.every(t=>t.name!==e.name)).reduce((e,t)=>{if(Fc(e,t.name)?.isPending)return e;let n={name:t.name,arity:Mc(t),params:Nc(t),kind:`Definition`,parent:e,isPending:!0};return a.add(n),n},t),s=/* @__PURE__ */ new Map,c=(e,t)=>{let r={kind:`Definition`,arity:t.arity,params:Array(t.arity).fill(0),range:t.location.range},i=Rc(t.name,Fc(e,t.name)??Ic(t.name,n,r.range),r,n)?{...r,name:t.name,parent:e,isPending:!0}:void 0;return i&&a.add(i),s.set(t,i),i??e},l=[...n.isGenerated?[]:r,...i].toSorted((e,t)=>jc(e.location,t.location)),u=(e,t)=>{let r=l.findIndex(e=>!t(e));return l.splice(0,r===-1?l.length:r).reduce((e,t)=>`kind`in t?Kl(t,e,n):c(e,t),e)},d=u(e.reduce((e,t)=>{let i=Oc(t.name)?e:u(e,e=>!Ac(t.location,e.location)),o={name:t.name,arity:Mc(t),kind:`Definition`,range:t.location.range,parent:i};if(Pc(t))return{...o,params:Nc(t)};let s=r.some(e=>e.location===t.location),c=n.isGenerated||t.isLocal||Oc(t.name),l=s?{...n,isGenerated:!0,errors:[],warnings:[]}:c?{...n,isGenerated:c}:n;return Tl(t,i,l,a)?{...o,params:Nc(t)}:i},o),()=>!0);return s.forEach((e,t)=>{let r=t.location.range;r&&!n.isGenerated&&(!e||e.isPending)&&n.errors.push({location:g(r),message:`Symbol ${cc(t.name)} declared in RECURSIVE statement but not defined.`})}),d},Dl=(e,t,n)=>{let r=e.split(`!`)[0],i=r===e?void 0:Fc(t,r)??Ic(r,n,void 0);return i?.kind===`Instance`?{name:r,arity:i.arity,range:i.range}:void 0},Ol=(e,t,n)=>{if(!ul(e))return!1;let r=ol(e),i=r.findIndex(e=>e.kind!==`Name`),a=Dl(r.slice(0,i===-1?r.length:i).flatMap(e=>e.kind===`Name`?[e.name]:[]).join(`!`),t,n),o=r[0],s=o.kind===`Name`?o.args.length:0;if(!a||s===a.arity)return!1;let c=(e.kind===`Identifier`?void 0:e.argumentRanges?.[0])??e.location.range;return c&&n.errors.push({location:g(c),message:`The operator ${a.name} requires ${a.arity} arguments.`}),!0},kl=(e,t,n,r,i)=>{let a=e?.kind===`Definition`?e.params:void 0;return!e||!a||a.length===e.arity?!1:(r&&!i.isGenerated&&i.errors.push({location:g(r),message:`Wrong number of arguments (${n}) given to operator '${cc(t)}', \nwhich requires ${a.length} arguments.`}),!0)},Al=(e,t,n)=>{let r=e.location.range,i=e=>{r&&n.errors.push({location:g(r),message:e})},a=vc.get(e);if(e.kind===`Lambda`&&e.operator!==void 0)i(`The operator ${cc(e.operator)} requires 1 arguments.`);else if(a)n.errors.push(a);else if(e.kind===`Lambda`&&r)Cc.add(e),i(`LAMBDA expression used where an expression is required.`);else if(e.kind===`OperatorReference`){let r=xl(e,e.operator,t,n);r!==void 0&&i(`The operator ${cc(e.operator)} requires ${r} arguments.`)}else B(e,t,n)},jl=(e,t,n,r,i,a,o)=>{let s=(e,t)=>{e&&o.errors.push({location:g(e),message:t})},c=(e,c)=>{let l=Dl(r,a,o)?.range??Yc(r,a,o)?.range;l&&s(i,`Operator with incorrect arity passed as argument. \nOperator '${cc(e)}' of arity ${c} is argument number ${n+1} (counting from 1) to operator \`${g(l)}', \nbut an operator of arity ${t} was expected.`)},l=e.location.range;if(t===0)return Al(e,a,o),!0;if(e.kind===`Lambda`){gc.has(e)?B(e,a,o):Fl(e,a,o);let u=e.params.length===t;return!u&&gc.has(e)?s(l,`Expected arity ${t} but found operator of arity ${e.params.length}.`):!u&&l&&e.operator===void 0?s(i,`Lambda expression with arity ${e.params.length} used as argument ${n+1} of operator \`${r}', \nbut an operator of arity ${t} is required.`):!u&&e.operator!==void 0&&c(e.operator,e.params.length),u}if(e.kind===`Subexpression`)return B(e,a,o),!0;if(e.kind===`Apply`&&e.argumentCounts?.at(-1)===0){let t=e.argumentCounts.findIndex(e=>e>0);return s(e.selectorRanges?.[t],`Selector \`${e.operator.split(`!`)[t]}' should not have argument(s).`),!1}if(e.kind!==`Identifier`&&e.kind!==`OperatorReference`)return s(l,`An expression appears as argument number ${n+1} (counting from 1) to operator '${r}', in a position an operator is required.`),!1;let u=e.kind===`Identifier`?e.name:e.operator,d=Yc(u,a,o)?.params??[],f=xl(e,u,a,o);return e.kind===`Identifier`&&f!==void 0&&f!==t&&s(Zc(e,u),`Expected arity ${t} but found operator of arity ${f}.`),e.kind===`OperatorReference`&&f!==void 0&&f!==t&&c(u,f),f===t&&d.every(e=>e===0)},Ml=(e,t,n)=>{let r=e.operator,i=Yc(r,t,n),a=Ol(e,t,n)?void 0:xl(e,r,t,n);if(a!==void 0&&a!==e.args.length&&n.errors.push({location:g(e.argumentsRange??Zc(e,r)),message:`The operator ${cc(r)} requires ${a-(Dl(r,t,n)?.arity??0)} arguments.`}),a!==e.args.length){wc.add(e);return}let o=i&&(i.kind===`Definition`?i.params:e.args.map(()=>0));if(o===void 0){e.args.forEach(e=>Nl(e,t,n));return}let s=e.selectorRanges?.at(-1)??Zc(e,r),c=r===hc,l=e.args.slice(0,o.length).map((e,i)=>{let a=c?bc.get(e):void 0;return jl(e,o[i],a?.index??i,a?.operator??r,a?.range??s,t,c?{...n,isGenerated:!1}:n)});kl(i,r,e.args.length,e.location.range,n)||l.forEach((t,i)=>{!t&&e.location.range&&n.errors.push({location:g(e.location.range),message:`Argument number ${i+1} to operator '${c?`LAMBDA`:r}' \nshould be a ${o[i]}-parameter operator.`})})},Nl=(e,t,n)=>{e.kind===`Identifier`?xl(e,e.name,t,n):B(e,t,n)},Pl=(e,t,n)=>{let r=_c.get(e);return r?(r.applications.forEach(e=>e.args.slice(0,e.params.length).forEach((r,i)=>jl(r,e.params[i],i,e.operator,e.range,t,n))),n.errors.push(Ec(r.nulls)??r.error),!0):!1},Fl=(e,t,n)=>B(e.body,Vc(t,e.params,e.paramRanges,n),{...n,labelParams:[...n.labelParams,...e.params]}),B=(e,t,n)=>{if(gc.has(e)&&!n.isGenerated){let r=Ec(xc.get(e));if(r){n.errors.push(r);return}let i=Sc.get(e);if(i){Object.assign(e,i);let t=Dc.get(i);t!==void 0&&Dc.set(e,t)}B(e,t,{...n,isGenerated:!0});return}let r=e=>e.forEach(e=>B(e,t,n)),i=e=>({...n,labelParams:[...n.labelParams,...e]});switch(e.kind){case`Number`:case`Decimal`:case`String`:return;case`ExceptAt`:!n.isInExcept&&e.location.range&&(wc.add(e),n.errors.push({location:g(e.location.range),message:`@ used where its meaning is not defined.`}));return;case`Identifier`:{let r=e.name,i=Ol(e,t,n)?void 0:xl(e,r,t,n);if(i===0){let i=Yc(r,t,n),a=i?.kind;(a===`Variable`||a===`Theorem`||a?.startsWith(`New`)||qc(r,n))&&wc.add(e),kl(i,r,0,Zc(e,r),n);return}i!==void 0&&n.errors.push({location:g(Zc(e,r)),message:`The operator ${cc(r)} requires ${i} arguments.`}),wc.add(e);return}case`OperatorReference`:xl(e,e.operator,t,n);return;case`Apply`:Ml(e,t,n);return;case`Lambda`:gc.has(e)?Fl(e,t,n):e.location.range&&(Cc.add(e),n.errors.push({location:g(e.location.range),message:`LAMBDA expression used where an expression is required.`}));return;case`And`:case`Or`:r(e.operands);return;case`Prime`:case`Unchanged`:case`Enabled`:case`Always`:case`Eventually`:B(e.expression,t,n);return;case`If`:r([e.condition,e.consequent,e.alternative]);return;case`Case`:r(e.arms.flatMap(e=>[e.condition,e.body])),e.other&&B(e.other,t,n);return;case`Let`:B(e.body,El(e.definitions,t,n,e.instances,e.recursive),n);return;case`Forall`:case`Exists`:case`FunctionConstruction`:B(e.body,Sl(e.bounds,t,n),i(Wc(e.bounds)));return;case`UnboundedQuantifier`:B(e.body,Vc(t,e.names,e.nameRanges,n),i(e.names));return;case`Choose`:e.set&&B(e.set,t,n),B(e.body,Vc(t,Uc(e.pattern),e.pattern.ranges,n),i(Uc(e.pattern)));return;case`SetEnumeration`:case`Tuple`:r(e.elements);return;case`SetFilter`:B(e.predicate,Sl([e.bound],t,n),i(Uc(e.bound.pattern)));return;case`SetMap`:B(e.expression,Sl(e.bounds,t,n),i(Wc(e.bounds)));return;case`FunctionSet`:r([e.domain,e.range]);return;case`Record`:case`RecordSet`:e.fields.forEach((r,i)=>{e.fields.slice(0,i).some(e=>e.name===r.name)&&n.errors.push({location:g(r.location.range??Xc(r.location,r.name)),message:`Non-unique fields in constructor.`}),B(r.value,t,n)});return;case`Except`:B(e.function,t,n),e.updates.forEach(e=>{r(e.path.flatMap(e=>e.kind===`Index`?e.args:[])),B(e.value,t,{...n,isInExcept:!0})});return;case`FunctionApplication`:r([e.function,...e.args]);return;case`FieldAccess`:B(e.record,t,n);return;case`Product`:r(e.factors);return;case`BoxAction`:case`AngleAction`:r([e.action,e.subscript]);return;case`WeakFairness`:case`StrongFairness`:r([e.subscript,e.action]);return;case`Label`:if(vl(e,n))return;B(e.body,t,{...n,labelParams:[],labels:/* @__PURE__ */ new Set}),yl(e,t,n);return;case`Subexpression`:Ll(e,t,n)&&wc.add(e);return}},Il=(e,t,n,r,i,a)=>{let o=Fc(i,e)??Ic(e,a,void 0);return!o?.isPending||!n||!r?!1:t.length===o.arity?(t.forEach(e=>B(e,i,a)),a.errors.push({location:g(n),message:`Subexpression of \`${e}' used inside the operator's definition.`}),!0):(a.errors.push({location:g(r),message:`The operator ${e} requires ${o.arity} arguments.`}),!0)},Ll=(e,t,n)=>{if(Ol(e,t,n)||Pl(e,t,n))return!0;let r=e.selectors[0],i=e.selectorRanges?.[0],a=e.selectors.findIndex(e=>e.kind!==`Name`),o=e.selectors.slice(0,a).flatMap(e=>e.kind===`Name`?[e.name]:[]),s=o.findIndex((e,t)=>t>0&&Kc(o.slice(0,t+1).join(`!`),n)),c=o.length>1&&(Fc(t,o[0])??Ic(o[0],n,void 0))?.kind===`Instance`,l=e.selectorRanges?.[a-1];if(c&&s===-1&&i&&l)return n.errors.push({location:g({module:i.module,start:i.start,end:l.end}),message:`Unknown operator: \`${cc(o.join(`!`))}'.`}),!0;let u=o.slice(0,s+1).join(`!`),d=s>0?Kc(u,n):void 0,f=e.selectors.slice(0,s+1).flatMap(e=>`args`in e?e.args:[]).length,p=e.argumentRanges?.[s]??e.location.range;if(d&&d.arity!==f&&p)return n.errors.push({location:g(p),message:`The operator ${cc(u)} requires ${d.arity} arguments.`}),!0;if(r.kind===`Name`&&e.selectors[1].kind!==`Name`&&i){let e=Fc(t,r.name),a=e??Kc(r.name,n);if(a===void 0&&!qc(r.name,n)||a?.kind===`Instance`)return n.errors.push({location:g(i),message:`Unknown operator: \`${cc(r.name)}'.`}),!0;if(a&&(!el.has(a.kind)||e?.isNonFact))return tl(r.name,i,n),!0}if(r.kind===`Name`&&Il(r.name,r.args,i,e.argumentRanges?.[0]??e.location.range,t,n))return!0;e.selectors.flatMap(e=>`args`in e?e.args:[]).forEach(e=>Nl(e,t,n));let m=bl(e,t,n,!1);return m?m.node===void 0:!1},Rl=(e,t,n,r)=>{if(e.kind===`ModuleFact`)return;if(e.kind===`ExceptAt`&&e.location.range)return r.errors.push({location:g(e.location.range),message:"Unknown operator: `@'."}),$c;let i=Bl(e,t,n,r);if(Ol(e,n,r))return i;let a=bl(e,n,r,!0);if(a){let t=a.node?.kind;return t===void 0?$c:t===`AssumeProve`||t===`NewSymbol`?void 0:e.location.range&&g(e.location.range)}if(e.kind===`Subexpression`)return Ll(e,n,r)?$c:i;let o=e.kind===`Identifier`?e.name:e.kind===`Apply`?e.operator:``;return e.kind===`Identifier`&&Fc(n,o)?.isNonFact?(r.errors.push({location:g(Zc(e,o)),message:`Step number of non-fact used as a fact`}),$c):(!qc(o,r)&&!Fc(n,o)?.goal&&B(e,n,r),i)},zl=(e,t,n)=>{let r=e.location.range,i=e.kind===`Identifier`?e.name:e.kind===`OperatorReference`?e.operator:``;if(i===``||!r)return!0;let a=Fc(t,i)??Kc(i,n)??Ic(i,n,r);return a===void 0&&(qc(i,n)||rl(i))||(a===void 0&&n.errors.push({location:g(r),message:`Unknown operator: \`${cc(i)}'.`}),a&&el.has(a.kind)&&!rl(i))?!0:(n.errors.push({location:g(r),message:`DEF clause entry should describe a defined operator.`}),!1)},Bl=(e,t,n,r)=>{let i=e.location.range&&g(e.location.range);if(gc.has(e))return t.location.range&&g(t.location.range);if(_c.has(e)||e.kind===`ExceptAt`)return $c;switch(e.kind){case`Number`:case`String`:case`Decimal`:case`Let`:case`Label`:return;case`Identifier`:case`Apply`:case`Subexpression`:{let t=ol(e)[0];if(e.kind===`Subexpression`||t.kind!==`Name`)return;let a=e.kind===`Identifier`?e.name:e.operator,o=Fc(n,t.name)?.goal??Jc(t.name,r);if(qc(a,r)||o||rl(a)&&Fc(n,a))return;let s=Yc(a,n,r),c=e.kind===`Apply`?e.args.length:0;return s?.arity===c?i:$c}default:return i}},Vl=(e,t,n)=>{let r=yc.get(e.facts)??e.facts,i=e.facts.map((e,i)=>Rl(e,r[i],t,n)),a=e.defs.filter(e=>zl(e,t,n)).length;i.forEach(t=>{t&&e.kind===`Hide`&&n.errors.push({location:t,message:`The only expression allowed as a fact in a HIDE is
395
- the name of a theorem, assumption, or step.`})});let o=e.location.range;e.facts.length+a===0&&o&&n.errors.push({location:g(o),message:e.kind===`By`?`Empty BY`:`Empty USE or HIDE statement.`})},Hl=(e,t,n)=>(e.set&&B(e.set,t,n),zc(t,e.name,{kind:`New${e.level}`,arity:e.arity,range:e.nameRange},n)),Ul=(e,t,n,r=!1)=>{let i=e.assumptions.reduce((e,t)=>t.kind===`NewSymbol`?{scope:Hl(t,e.scope,e.unit),unit:r?{...e.unit,isLabelForbidden:!0}:e.unit}:(t.kind===`AssumeProve`?Ul(t,e.scope,e.unit,!0):B(t,e.scope,e.unit),e),{scope:t,unit:n});return B(e.conclusion,i.scope,i.unit),i.scope},Wl=(e,t,n)=>e.kind===`AssumeProve`?Ul(e,t,n):(B(e,t,n),t),Gl=(e,t,n)=>{let r=n.hasLabelScope?{...n,hasLabelScope:!1}:n;e?.kind===`By`&&Vl(e,t,r),e?.kind===`Steps`&&e.steps.reduce((e,t)=>Jl(t,e,r),t)},Kl=(e,t,n)=>{let r=eu(e,t,n);return e.name===void 0?r:zc(r,e.name,{kind:`Instance`,arity:e.params.length,range:e.location.range},n)},ql=(e,t)=>{let n=(e,t)=>({statement:t,isSuffices:!1,isInProof:!1,keyword:e});switch(e.kind){case`Have`:return n(`HAVE`,{kind:`Tuple`,elements:[e.expression],location:t});case`Case`:return n(`CASE`,{kind:`Tuple`,elements:[e.expression],location:t});case`Witness`:return n(`WITNESS`,{kind:`Tuple`,elements:e.expressions,location:t});case`Take`:return n(`TAKE`,{kind:`Tuple`,elements:sl(e.bounds),location:t});case`Pick`:return n(`PICK`,e.bounds.length>0?{kind:`Exists`,bounds:e.bounds,body:e.body,location:t}:{kind:`UnboundedQuantifier`,quantifier:`Exists`,names:e.names,body:e.body,location:t});case`Qed`:return n(`QED step`,{kind:`Tuple`,elements:[],location:t});default:return}},Jl=(e,t,n)=>{let r=e.body,i=e.name===void 0?n:{...n,hasLabelScope:!0,labelParams:[],labels:/* @__PURE__ */ new Set},a=ql(r,e.location),o=t=>e.name===void 0?t:{name:e.name,arity:0,kind:`Theorem`,parent:t,goal:a},s=t=>e.name===void 0?t:{name:e.name,arity:0,kind:`Theorem`,parent:t,isNonFact:!0};switch(r.kind){case`Assert`:{let a=Wl(r.statement,t,i),o=r.isSuffices?t:a,s=e.name;if(s===void 0)return Gl(e.proof,o,n),r.isSuffices?a:t;let c={statement:r.statement,isSuffices:r.isSuffices,isInProof:!0,keyword:r.isSuffices&&r.statement.kind!==`AssumeProve`?`SUFFICES`:void 0};return Gl(e.proof,{name:s,arity:0,kind:`Theorem`,parent:o,goal:c},n),c.isInProof=!1,{name:s,arity:0,kind:`Theorem`,parent:r.isSuffices?a:t,goal:c}}case`Use`:case`Hide`:return Vl(r,t,n),s(t);case`Instance`:return s(Kl(r,t,i));case`Define`:return s(r.definitions.reduce((e,t)=>t.kind===`Instance`?Kl(t,e,i):El([t],e,n),t));case`Have`:case`Case`:return B(r.expression,t,i),Gl(e.proof,o(t),n),o(t);case`Witness`:return r.expressions.forEach(e=>B(e,t,i)),o(t);case`Take`:return o(Vc(Sl(r.bounds,t,i),r.names,r.nameRanges,i));case`Pick`:{let a=Vc(Sl(r.bounds,t,i),r.names,r.nameRanges,i);return B(r.body,a,{...i,labelParams:[...i.labelParams,...Wc(r.bounds),...r.names]}),Gl(e.proof,o(t),n),o(a)}default:return Gl(e.proof,o(t),n),o(t)}},Yl=(e,t)=>{let n=e.name!==void 0&&e.statement.kind!==`AssumeProve`?void 0:Wl(e.statement,void 0,t);e.name!==void 0&&Bc(e.name,{kind:`Theorem`,arity:0,range:e.location.range},t);let r=t.goals.get(e.name??``);r&&(r.isInProof=!0),Gl(e.proof,n,t),r&&(r.isInProof=!1)},Xl={line:0,column:0},Zl=(e,t)=>[...e.theorems,...e.assumptions].some(e=>e.name===t.name&&e.location.line===t.location.line&&e.location.column===t.location.column),Ql=(e,t)=>{let n=new Map([...kc,...t]);return e.constants.forEach(e=>n.set(e.name,{key:e.name,arity:e.arity,kind:`Constant`})),e.variables.forEach(e=>n.set(e.name,{key:e.name,arity:0,kind:`Variable`})),n},$l=(e,t,n,r,i)=>{let a=e.params.reduce((e,t)=>({name:t.name,arity:t.arity,kind:`Parameter`,parent:e}),r),o=(e,t)=>i.errors.push({location:t,message:`An operator must be substituted for symbol '${cc(e.name)}', and it must have arity ${e.arity}.`}),s=(e,t)=>{let n=t.location.range;if(e.arity===0){Al(t,a,i);return}if(t.kind===`Lambda`){Fl(t,a,i),t.params.length!==e.arity&&n&&o(e,g(n));return}if(t.kind===`OperatorReference`){let r=xl(t,t.operator,a,i);r===void 0?o(e,$c):r!==e.arity&&n&&o(e,g(n));return}if(t.kind!==`Identifier`){n&&i.errors.push({location:g(n),message:`Arity ${e.arity} operator (not an expression) is expected \nto substitute for CONSTANT '${cc(e.name)}'.`}),o(e,$c);return}let r=xl(t,t.name,a,i);r!==void 0&&r!==e.arity&&i.errors.push({location:g(Zc(t,t.name)),message:`Expected arity ${e.arity} but found operator of arity ${r}.`}),r!==e.arity&&o(e,$c)},c=e.location.range,l=t.filter(e=>Fc(a,e.name)!==void 0||Kc(e.name,i)!==void 0).map(t=>({declaration:t,expression:{kind:`Identifier`,name:t.name,location:e.location}}));l.filter(e=>e.declaration.arity===0).forEach(e=>{let t=xl(e.expression,e.declaration.name,a,i);t&&c&&i.errors.push({location:g(c),message:`Wrong number of arguments (0) given to operator '${cc(e.declaration.name)}', \nwhich requires ${t} arguments.`})});let u=/* @__PURE__ */ new Map;return e.substitutions.forEach(e=>{let n=e.name,r=t.find(e=>e.name===n);if(!r){i.errors.push({location:g(e.nameRange),message:`Identifier '${n}' is not a legal target of a substitution. \nA legal target must be a declared CONSTANT or VARIABLE in the module being instantiated. \n(Also, check for warnings about multiple declarations of this same identifier.)`});return}let a=e.expression;s(r,a);let o=a.location.range;u.has(n)?o&&i.errors.push({location:g(o),message:`Multiple substitutions for symbol '${n}' in substitution.`}):u.set(n,a)}),l.filter(e=>!u.has(e.declaration.name)).forEach(e=>{(e.declaration.arity===0?0:xl(e.expression,e.declaration.name,a,i))!==e.declaration.arity&&c&&o(e.declaration,g(c)),u.set(e.declaration.name,e.expression)}),t.filter(e=>!u.has(e.name)).forEach(e=>{let t=e.location.range;c&&t&&i.errors.push({location:g(c),message:`Substitution missing for symbol ${cc(e.name)} declared at ${g(t)} \nand instantiated in module ${n}.`})}),u},eu=(e,t,n)=>{let r=n.getInstance(e);return $l(e,r.declarations,r.instancer,t,n),[...r.symbols].reduce((e,t)=>zc(e,t[0],t[1],n),t)},tu=(e,t,n,r)=>{let i=Ql(n,r.imported),a=new Map([...n.constants,...n.variables].map(e=>[e.name,e.location])),o={location:e.location,errors:[],warnings:[]};return r.reports.push(o),$l(e,t,n.name,void 0,{imported:i,getInstance:r.getInstance,definitions:r.definitions,getKey:r.getKey,location:e.location,self:void 0,facts:/* @__PURE__ */ new Set,goals:/* @__PURE__ */ new Map,bindings:new Map([...i].map(e=>[e[0],{...e[1],position:a.get(e[0])??Xl}])),errors:o.errors,warnings:o.warnings,hasLabelScope:!1,isLabelForbidden:!1,isInExcept:!1,labelParams:[],labels:/* @__PURE__ */ new Set,isGenerated:!1})},nu=(e,t)=>{let n=[],r=(e,t)=>{e.every(e=>e.location!==t.location||e.message!==t.message)&&e.push(t)};return e.toSorted((e,t)=>jc(e.location,t.location)).forEach(e=>{let i=[],a=[];try{e.check(i,a)}catch(e){if(!(e instanceof s)||!e.sany&&i.length===0)throw e;i.push(...e.sany?.errors??[])}i.forEach(e=>r(n,e)),a.forEach(e=>r(t,e))}),n},ru=(e,t)=>{let n=Ql(e,t.imported),r=new Map(e.theorems.flatMap(e=>e.name!==void 0&&e.statement.kind===`AssumeProve`?[[e.name,{statement:e.statement,isSuffices:!1,isInProof:!1,keyword:void 0}]]:[])),i=new Map([...kc,...t.bound].map(e=>[e[0],{...e[1],position:Xl}])),a=/* @__PURE__ */ new Set,o=[],s=(e,a,o,s)=>({location:e,check:(c,l)=>s({imported:n,getInstance:t.getInstance,definitions:t.definitions,getKey:t.getKey,location:e,self:a,facts:t.facts,goals:r,bindings:i,errors:c,warnings:l,hasLabelScope:o,isLabelForbidden:!1,isInExcept:!1,labelParams:[],labels:/* @__PURE__ */ new Set,isGenerated:!1})}),c=(e,t)=>e.map(e=>s(e.location,void 0,!1,n=>Bc(e.name,{kind:t,arity:e.arity,range:e.location.range},n)));return nu([...e.units.flatMap(e=>{let t=e.kind===`Variables`?{type:`A VARIABLE declaration`,location:e.location}:e.kind===`Constants`?{type:`A declaration`,location:e.location}:e.kind===`Module`?{type:`A MODULE `,location:e.module.location}:e.kind===`Theorem`?{type:`A THEOREM`,location:e.theorem.location}:e.kind===`Assumption`?{type:`An ASSUME`,location:e.assumption.location}:e.kind===`Use`?{type:`A USE or HIDE`,location:e.use.location}:void 0,n=t?.location.range;return!t||!n?[]:[{location:t.location,check:e=>{o.some(e=>e.binding?.isPending)&&e.push({location:g(n),message:`${t.type} may not appear within a recursive definition section.`})}}]}),...t.reports.map(e=>({location:e.location,check:(t,n)=>{t.push(...e.errors),n.push(...e.warnings)}})),...c(e.constants,`Constant`),...c(e.variables,`Variable`),...e.units.flatMap(e=>e.kind===`Recursive`?e.declarations:[]).map(e=>s(e.location,void 0,!1,t=>{let n={kind:`Definition`,arity:e.arity,params:Array(e.arity).fill(0),range:e.location.range,position:e.location,isPending:!0},r=Rc(e.name,i.get(e.name),n,t);r&&(i.set(e.name,n),a.add(n)),o.push({declaration:e,binding:r?n:void 0})})),...e.definitions.map(t=>s(t.location,t,!0,n=>{Zl(e,t)?B(t.body,void 0,n):Tl(t,void 0,n,a)&&i.set(t.name,{kind:`Definition`,arity:Mc(t),range:t.location.range,position:t.location})})),...e.instances.map(e=>s(e.location,void 0,!1,n=>{Hc(void 0,e.params,n),t.instanced.get(e)?.forEach((e,t)=>Bc(t,e,n)),e.name!==void 0&&Bc(e.name,{kind:`Instance`,arity:e.params.length,range:e.location.range},n)})),...e.assumptions.map(e=>s(e.location,void 0,e.name!==void 0,t=>{B(e.expression,void 0,t),e.name!==void 0&&Bc(e.name,{kind:`Theorem`,arity:0,range:e.location.range},t)})),...e.theorems.map(e=>s(e.location,void 0,e.name!==void 0,t=>Yl(e,t))),...e.uses.map(e=>s(e.location,void 0,!1,t=>Vl(e,void 0,t))),{location:e.location.range?.end??e.location,check:e=>o.forEach(t=>{let n=t.declaration.location.range;n&&(!t.binding||t.binding.isPending)&&e.push({location:g(n),message:`Symbol ${cc(t.declaration.name)} declared in RECURSIVE statement but not defined.`})})}],t.warnings)},iu=/* @__PURE__ */ new WeakSet,au=/* @__PURE__ */ new WeakMap,ou=(e,t)=>{if(t.length===0)return e;let n={...e};return iu.has(e)&&iu.add(n),au.set(n,[...t,...au.get(e)??[]]),n},su=(e,t,n=/* @__PURE__ */ new Set)=>{let r=pu(e,(e,r)=>su(e,t,r.length===0?n:/* @__PURE__ */ new Set([...n,...r])));return r.kind===`Identifier`&&M(r)&&!n.has(r.name)?{...r,name:t.get(r.name)??r.name}:r.kind===`Apply`&&M(r)&&!n.has(r.operator)||r.kind===`OperatorReference`&&!n.has(r.operator)?{...r,operator:t.get(r.operator)??r.operator}:r},cu=(e,t)=>e.map(e=>({pattern:e.pattern,set:t(e.set)})),lu=/* @__PURE__ */ new WeakMap,uu=e=>lu.get(e)??e.name,du=(e,t)=>(uu(t)!==e.name&&lu.set(e,uu(t)),e),fu=(e,t)=>du(e.kind===`Function`?{...e,bounds:cu(e.bounds,e=>t(e,[])),body:t(e.body,Wc(e.bounds))}:{...e,body:t(e.body,e.params.map(e=>e.name))},e),pu=(e,t)=>{let n=e=>t(e,[]);switch(e.kind){case`Number`:case`Decimal`:case`String`:case`Identifier`:case`OperatorReference`:case`ExceptAt`:return e;case`Apply`:return{...e,args:e.args.map(n)};case`Lambda`:return{...e,body:t(e.body,e.params)};case`And`:case`Or`:return{...e,operands:e.operands.map(n)};case`Prime`:case`Unchanged`:case`Enabled`:case`Always`:case`Eventually`:return{...e,expression:n(e.expression)};case`If`:return{...e,condition:n(e.condition),consequent:n(e.consequent),alternative:n(e.alternative)};case`Case`:return{...e,arms:e.arms.map(e=>({condition:n(e.condition),body:n(e.body)})),other:e.other?n(e.other):void 0};case`Let`:{let n=e.definitions.map(e=>e.name);return{...e,definitions:e.definitions.map(e=>fu(e,(e,r)=>t(e,[...n,...r]))),body:t(e.body,n)}}case`Forall`:case`Exists`:case`FunctionConstruction`:return{...e,bounds:cu(e.bounds,n),body:t(e.body,Wc(e.bounds))};case`UnboundedQuantifier`:return{...e,body:t(e.body,e.names)};case`Choose`:return{...e,set:e.set?n(e.set):void 0,body:t(e.body,Uc(e.pattern))};case`SetEnumeration`:case`Tuple`:return{...e,elements:e.elements.map(n)};case`SetFilter`:return{...e,bound:{pattern:e.bound.pattern,set:n(e.bound.set)},predicate:t(e.predicate,Uc(e.bound.pattern))};case`SetMap`:return{...e,bounds:cu(e.bounds,n),expression:t(e.expression,Wc(e.bounds))};case`FunctionSet`:return{...e,domain:n(e.domain),range:n(e.range)};case`Record`:case`RecordSet`:return{...e,fields:e.fields.map(e=>({...e,value:n(e.value)}))};case`Except`:return{...e,function:n(e.function),updates:e.updates.map(e=>({path:e.path.map(e=>e.kind===`Index`?{kind:`Index`,args:e.args.map(n)}:e),value:n(e.value)}))};case`FunctionApplication`:return{...e,function:n(e.function),args:e.args.map(n)};case`Bracket`:return{...e,args:e.args.map(n)};case`FieldAccess`:return{...e,record:n(e.record)};case`Product`:return{...e,factors:e.factors.map(n)};case`BoxAction`:case`AngleAction`:return{...e,action:n(e.action),subscript:n(e.subscript)};case`WeakFairness`:case`StrongFairness`:return{...e,subscript:n(e.subscript),action:n(e.action)};case`Label`:return{...e,body:n(e.body)};case`Subexpression`:return{...e,selectors:e.selectors.map(e=>`args`in e?{...e,args:e.args.map(n)}:e)}}},mu=(e,t)=>{pu(e,(e,n)=>(t(e,n),e))},hu=`LAMBDA`,gu=e=>`${e}@SUBSTITUTION`,_u=e=>e.kind===`Identifier`||e.kind===`Tuple`&&e.elements.every(_u),vu=(e,t)=>{if(e.kind!==`Identifier`)return!_u(e)&&e.kind!==`OperatorReference`&&e.kind!==`Lambda`&&e.kind!==`Number`&&e.kind!==`String`;let n=M(e)?void 0:t.getOuterDefinition(e.name);return n?.kind===`Operator`&&n.params.length===0&&!_u(n.body)},yu=(e,t=/* @__PURE__ */ new Set)=>{let n=ht(e),r=n===void 0||t.has(n)?[]:[n];return mu(e,(e,n)=>r.push(...yu(e,n.length===0?t:/* @__PURE__ */ new Set([...t,...n])))),r},bu=e=>{let t=/* @__PURE__ */ new Map;return n=>{if(!e.substitutedNames.has(n))return n;let r=t.get(n)??e.instantiation.createName(n);return t.set(n,r),r}},xu=(e,t,n)=>new Map([...e,...t.map(e=>[e,n(e)])]),Su=(e,t)=>e.kind===`Name`?{kind:`Name`,name:t(e.name)}:{kind:`Tuple`,names:e.names.map(t)},Cu=(e,t)=>e.map(e=>({pattern:Su(e.pattern,t),set:e.set})),wu=(e,t)=>e.kind===`Function`?{...e,bounds:Cu(e.bounds,t)}:{...e,params:e.params.map(e=>({name:t(e.name),arity:e.arity}))},Tu=(e,t,n)=>{let r=e=>t.get(e)??e;switch(e.kind){case`Identifier`:return{...e,name:r(e.name)};case`Apply`:case`OperatorReference`:return{...e,operator:r(e.operator)};case`Label`:return{...e,params:e.params.map(r)};case`Lambda`:return{...e,params:e.params.map(n)};case`Let`:return{...e,definitions:e.definitions.map(e=>du({...wu(e,n),name:n(e.name)},e))};case`Forall`:case`Exists`:case`FunctionConstruction`:case`SetMap`:return{...e,bounds:Cu(e.bounds,n)};case`UnboundedQuantifier`:return{...e,names:e.names.map(n)};case`Choose`:return{...e,pattern:Su(e.pattern,n)};case`SetFilter`:return{...e,bound:{pattern:Su(e.bound.pattern,n),set:e.bound.set}};default:return e}},Eu=e=>`${e}@ENABLED`,Du=(e,t)=>e.modes.get(t)??e,Ou=(e,t,n)=>e.kind===`Identifier`&&!n.has(e.name)&&!M(e)&&t.instantiation.variables.has(e.name),ku=(e,t,n)=>{if(e.kind===`Tuple`){let r=e.elements.map(e=>ku(e,t,n));return r.every(e=>e!==void 0)?r.flat():void 0}if(e.kind!==`Identifier`)return;if(Ou(e,t,n))return[e.name];let r=M(e)?void 0:t.instantiation.getDefinition(e.name);return r?.kind===`Operator`&&r.params.length===0?ku(r.body,t,/* @__PURE__ */ new Map):void 0},Au=(e,t,n)=>{if(t.mode===`Normal`)return;if(t.mode===`Primed`)return Ou(e,t,n)&&e.kind===`Identifier`?{kind:`Identifier`,name:Eu(e.name),location:e.location}:void 0;if(e.kind===`Prime`)return{...e,expression:Iu(e.expression,Du(t,`Primed`),n)};if(e.kind===`AngleAction`){let r=e.location;return{kind:`And`,operands:[Iu(e.action,t,n),{kind:`Apply`,operator:`#`,args:[{kind:`Prime`,expression:Iu(e.subscript,Du(t,`Primed`),n),location:r},Iu(e.subscript,t,n)],location:r}],location:r}}if(e.kind!==`Unchanged`)return;let r=ku(e.expression,t,n);if(r!==void 0)return{kind:`And`,operands:r.map(r=>({kind:`Apply`,operator:`=`,args:[{kind:`Prime`,expression:{kind:`Identifier`,name:Eu(r),location:e.location},location:e.location},Iu({kind:`Identifier`,name:r,location:e.location},t,n)],location:e.location})),location:e.location}},ju=(e,t)=>({kind:`Identifier`,name:e,location:t,resolution:mc}),Mu=(e,t)=>e.map(e=>ju(e.name,t)),Nu=(e,t,n,r,i)=>({kind:`Operator`,name:e,params:n,body:r.length===0?{kind:`Identifier`,name:t,location:i}:{kind:`Apply`,operator:t,args:Mu(r,i),location:i},isLocal:!0,isRecursive:!1,location:i}),Pu=(e,t,n,r)=>{let i=Array.from({length:n},(e,t)=>`argument${t}`);return{kind:`Lambda`,params:i,body:{kind:`Apply`,operator:e,args:[...Mu(t,r),...i.map(e=>ju(e,r))],location:r},location:r}},Fu=(e,t)=>e.instantiation.isParameterized(t)?Ru(e,t):void 0,Iu=(e,t,n)=>{let r=e=>Iu(e,t,n),i=t.instantiation,a=i.params,o=t=>!n.has(t)&&!M(e);if(e.kind===`Enabled`&&t.mode===`Normal`)return{...e,expression:Iu(e.expression,Du(t,`Enabled`),n)};if((e.kind===`WeakFairness`||e.kind===`StrongFairness`)&&t.mode===`Normal`)return{...e,subscript:r(e.subscript),action:r(e.action),enabled:Iu(e.enabled??{kind:`AngleAction`,action:e.action,subscript:e.subscript,location:e.location},Du(t,`Enabled`),n)};let c=Au(e,t,n);if(c)return c;if(e.kind===`Identifier`&&o(e.name)){let n=i.substitutions.get(e.name),r=t.bindings;if(n&&(r===void 0||!vu(n,i)))return ou(n,[e]);if(n&&r){let t=gu(e.name);return r.set(t,n),ju(t,e.location)}let o=Fu(t,e.name);if(o===void 0)return e;if(a.length===0)return{...e,name:o};let s=i.getDefinition(e.name);return s&&Mc(s)>0?Pu(o,a,Mc(s),e.location):{kind:`Apply`,operator:o,args:Mu(a,e.location),location:e.location}}if(e.kind===`Apply`&&o(e.operator)){let n=e.args.map(r),o=i.substitutions.get(e.operator),c=i.substitutions.size>0||a.length>0||iu.has(e),l=e=>(c&&iu.add(e),e);if(o?.kind===`Identifier`||o?.kind===`OperatorReference`){let t=o.kind===`Identifier`?o.name:o.operator;return l({...e,operator:t,args:n,resolution:o.kind===`Identifier`?o.resolution:void 0})}if(o?.kind===`Apply`)return l({...e,operator:o.operator,args:[...o.args,...n],resolution:o.resolution});if(o?.kind===`Lambda`)return{kind:`Let`,definitions:[{kind:`Operator`,name:hu,params:o.params.map(e=>({name:e,arity:0})),body:o.body,isLocal:!0,isRecursive:!1,location:o.location}],body:{...e,operator:hu,args:n,resolution:mc},location:e.location};if(o)throw new s(`The operator ${e.operator} can only be substituted by an operator at line ${e.location.line}, column ${e.location.column}`);let u=Fu(t,e.operator);return u===void 0?l({...e,args:n}):{...e,operator:u,args:[...Mu(a,e.location),...n]}}if(e.kind===`OperatorReference`&&o(e.operator)){let n=i.substitutions.get(e.operator);if(n?.kind===`Identifier`||n?.kind===`OperatorReference`||n?.kind===`Lambda`)return ou(n,[e]);let r=Fu(t,e.operator);if(r===void 0)return e;let o=i.getDefinition(e.operator);return a.length>0&&o?Pu(r,a,Mc(o),e.location):{...e,operator:r}}let l=bu(t),u=pu(e,(e,i)=>i.length===0?r(e):Iu(e,t,xu(n,i,l)));return Tu(u,n,l)},Lu=(e,t,n)=>t.length===0?e:e.kind===`Operator`?{...e,params:[...t,...e.params]}:{kind:`Operator`,name:e.name,params:t,body:{kind:`Let`,definitions:[e],body:ju(e.name,n),location:n},isLocal:e.isLocal,isRecursive:!1,location:e.location},Ru=(e,t)=>{let n=e.copies.get(t);if(n!==void 0)return n;let r=e.instantiation,i=r.getDefinition(t);return i?r.addDefinition(t,i.name,n=>{e.copies.set(t,n);let a=bu(e),o=/* @__PURE__ */ new Map,s=i.kind===`Operator`&&e.mode===`Normal`?{...e,bindings:o}:e,c=wu(fu(i,(e,t)=>Iu(e,s,xu(/* @__PURE__ */ new Map,t,a))),a),l=c.kind!==`Operator`||o.size===0?c.body:{kind:`Let`,definitions:[...o].map(e=>({kind:`Operator`,name:e[0],params:[],body:e[1],isLocal:!0,isRecursive:!1,location:e[1].location})),body:c.body,location:{line:c.body.location.line,column:c.body.location.column}},u=r.frame;return u&&au.set(l,[u,...au.get(i.body)??[]]),Lu({...c,body:l},r.params,i.location)}):t},zu=e=>{let t=/* @__PURE__ */ new Map,n=new Set([...e.substitutions.values()].flatMap(e=>yu(e))),r=r=>{let i={instantiation:e,substitutedNames:n,copies:/* @__PURE__ */ new Map,mode:r,modes:t};return t.set(r,i),i},i=r(`Normal`);return r(`Enabled`),r(`Primed`),{getKey:e=>Fu(i,e)??e,getQualifiedKey:t=>{let n=Fu(i,t);if(n!==void 0)return n;let r=e.getDefinition(t);return r?e.addDefinition(t,r.name,()=>Lu(r,e.params,r.location)):t}}},Bu=e=>e.kind===`Let`&&e.instances!==void 0||mt(e).some(Bu),Vu=(e,t,n)=>{let r=e.kind===`Let`?[...n,...e.definitions]:n,i=pu(e,e=>Vu(e,t,r));if(i.kind!==`Let`||!i.instances)return i;let a=i.instances.reduce((e,n)=>{let i=e.findIndex(e=>Ac(n.location,e.location)),a=i===-1?e.length:i;return[...e.slice(0,a),...t(n,r),...e.slice(a)]},i.definitions);return{...i,definitions:a}},Hu=e=>e.name===void 0&&e.statement.kind!==`AssumeProve`?e.statement:void 0,Uu=(e,t)=>e.definitions.some(e=>Bu(e.body))||e.assumptions.some(e=>Bu(e.expression))||e.theorems.some(e=>{let t=Hu(e);return t!==void 0&&Bu(t)})?{...e,definitions:e.definitions.map(e=>fu(e,e=>Vu(e,t,[]))),assumptions:e.assumptions.map(e=>({...e,expression:Vu(e.expression,t,[])})),theorems:e.theorems.map(e=>{let n=Hu(e);return n===void 0?e:{...e,statement:Vu(n,t,[])}})}:e,Wu=new Map([[`Nat`,0,[],[],[]],[`+`,0,[0,0],[2,2],[1,1]],[`-`,0,[0,0],[2,2],[1,1]],[`*`,0,[0,0],[3,3],[0,0]],[`^`,0,[0,0],[2,2],[1,1]],[`<`,0,[0,0],[2,2],[1,1]],[`>`,0,[0,0],[2,2],[1,1]],[`<=`,0,[0,0],[2,2],[1,1]],[`>=`,0,[0,0],[2,2],[1,1]],[`%`,0,[0,0],[2,2],[1,1]],[`\\div`,0,[0,0],[2,2],[1,1]],[`..`,0,[0,0],[2,2],[1,1]],[`Int`,0,[],[],[]],[`-.`,0,[0],[2],[1]],[`Seq`,0,[0],[2],[1]],[`Len`,0,[0],[2],[1]],[`\\o`,0,[0,0],[2,2],[1,1]],[`Append`,0,[0,0],[2,2],[1,1]],[`Head`,0,[0],[2],[1]],[`Tail`,0,[0],[2],[1]],[`SubSeq`,0,[0,0,0],[2,2,2],[1,1,1]],[`SelectSeq`,0,[0,1],[2,2],[1,1],[],[`1,0,0`]],[`IsFiniteSet`,0,[0],[2],[1]],[`Cardinality`,0,[0],[2],[1]],[`IsABag`,0,[0],[2],[1]],[`BagToSet`,0,[0],[2],[1]],[`SetToBag`,0,[0],[3],[1]],[`BagIn`,0,[0,0],[2,2],[1,1]],[`EmptyBag`,0,[],[],[]],[`\\oplus`,0,[0,0],[2,2],[1,1]],[`\\ominus`,0,[0,0],[2,2],[1,1]],[`BagUnion`,0,[0],[2],[1]],[`\\sqsubseteq`,0,[0,0],[2,2],[1,1]],[`SubBag`,0,[0],[2],[1]],[`BagOfAll`,0,[1,0],[2,2],[1,1]],[`BagCardinality`,0,[0],[2],[1]],[`CopiesIn`,0,[0,0],[2,2],[1,1]],[`Print`,0,[0,0],[3,3],[0,1]],[`PrintT`,0,[0],[3],[0]],[`Assert`,0,[0,0],[2,3],[1,0]],[`JavaTime`,0,[],[],[]],[`TLCGet`,0,[0],[3],[0]],[`TLCSet`,0,[0,0],[3,3],[0,0]],[`:>`,0,[0,0],[2,3],[1,1]],[`@@`,0,[0,0],[2,2],[1,1]],[`Permutations`,0,[0],[2],[1]],[`SortSeq`,0,[0,2],[2,2],[1,1],[],[`1,0,0`,`1,0,1`]],[`RandomElement`,0,[0],[3],[1]],[`Any`,0,[],[],[]],[`ToString`,0,[0],[2],[1]],[`TLCEval`,0,[0],[3],[1]],[`AssertEq`,0,[0,0],[2,2],[1,1]],[`AssertError`,0,[0,0],[2,3],[1,0]],[`TLCGetOrDefault`,0,[0,0],[3,3],[0,0]],[`TLCGetAndSet`,0,[0,2,0,0],[3,3,3,3],[0,0,0,0],[],[`1,2,1`]],[`Trace`,0,[],[],[]],[`CounterExample`,0,[],[],[]],[`ToTrace`,0,[0],[3],[0]],[`TLCModelValue`,0,[0],[2],[1]],[`TLCDefer`,0,[0],[3],[0]],[`TLCNoOp`,0,[0],[3],[1]],[`PickSuccessor`,0,[0],[3],[1]],[`TLCCache`,0,[0,0],[3,3],[1,0]],[`TLCFP`,0,[0],[3],[0]],[`TLCEvalDefinition`,0,[0],[3],[0]],[`ToJson`,0,[0],[2],[1]],[`ToJsonArray`,0,[0],[2],[1]],[`ToJsonObject`,0,[0],[2],[1]],[`JsonSerialize`,0,[0,0],[3,3],[0,0]],[`JsonDeserialize`,0,[0],[3],[0]],[`ndJsonSerialize`,0,[0,0],[3,3],[0,0]],[`ndJsonDeserialize`,0,[0],[3],[0]],[`RandomSubset`,0,[0,0],[2,2],[1,1]],[`RandomSetOfSubsets`,0,[0,0,0],[2,3,2],[1,0,1]],[`TestRandomSetOfSubsets`,0,[0,0,0],[2,3,2],[1,0,1]],[`_Track`,0,[0,0],[3,2],[0,0]],[`_Counts`,0,[],[],[]],[`_CheckName`,0,[0],[2],[1]],[`_PrintCounts`,0,[],[],[]]].map(e=>[e[0],{name:e[0],level:e[1],params:/* @__PURE__ */ new Set,constraints:/* @__PURE__ */ new Map,argConstraints:/* @__PURE__ */ new Map,argParams:/* @__PURE__ */ new Set,formals:e[2].map((e,t)=>({name:`$${t}`,arity:e})),maxLevels:e[3],weights:e[4],minMaxLevels:e[5]??[],conditions:new Set(e[6]),nonLeibniz:/* @__PURE__ */ new Set}])),Gu={Naturals:{Nat:[14,1,14,16],"+":[15,1,15,19],"-":[17,1,17,33],"*":[18,1,18,17],"^":[19,1,19,19],"<":[20,1,20,19],">":[21,1,21,19],"<=":[22,1,22,19],">=":[23,1,23,19],"%":[33,1,33,20],"\\div":[34,1,34,20],"..":[35,1,35,20]},Integers:{Int:[18,1,18,12],"-.":[22,1,22,13]},Sequences:{Seq:[20,1,20,41],Len:[25,1,25,44],"\\o":[30,1,31,76],Append:[36,1,36,26],Head:[41,1,41,15],Tail:[42,1,42,61],SubSeq:[48,1,48,50],SelectSeq:[53,1,65,14]},FiniteSets:{IsFiniteSet:[14,1,19,68],Cardinality:[21,1,27,11]},Bags:{IsABag:[20,1,24,41],BagToSet:[26,1,26,23],SetToBag:[31,1,31,30],BagIn:[36,1,36,31],EmptyBag:[41,1,41,24],"\\oplus":[43,1,49,46],"\\ominus":[51,1,60,50],BagUnion:[74,1,79,58],"\\sqsubseteq":[81,1,87,42],SubBag:[89,1,110,11],BagOfAll:[122,1,130,66],BagCardinality:[132,1,138,8],CopiesIn:[140,1,145,33]},TLC:{Print:[17,1,17,22],PrintT:[18,1,18,19],Assert:[24,1,25,54],JavaTime:[26,1,26,32],TLCGet:[75,1,75,28],TLCSet:[76,1,76,20],":>":[78,1,78,27],"@@":[79,1,80,50],Permutations:[81,1,82,54],SortSeq:[88,1,92,40],RandomElement:[110,1,110,41],Any:[119,1,119,22],ToString:[121,1,121,58],TLCEval:[145,1,145,15]},TLCExt:{AssertEq:[14,1,20,14],AssertError:[23,1,26,72],TLCGetOrDefault:[30,1,31,17],TLCGetAndSet:[33,1,35,57],Trace:[41,1,57,6],CounterExample:[61,1,75,8],ToTrace:[77,1,87,12],TLCModelValue:[91,1,120,29],TLCDefer:[122,1,134,6],TLCNoOp:[138,1,145,5],PickSuccessor:[148,1,162,37],TLCCache:[166,1,173,12],TLCFP:[175,1,181,24],TLCEvalDefinition:[185,1,190,6]},Randomization:{RandomSubset:[30,1,30,64],RandomSetOfSubsets:[48,1,49,67],TestRandomSetOfSubsets:[61,1,62,71]},Json:{ToJson:[46,1,55,37],ToJsonArray:[57,1,64,42],ToJsonObject:[66,1,73,43],JsonSerialize:[75,1,80,6],JsonDeserialize:[82,1,87,19],ndJsonSerialize:[89,1,95,6],ndJsonDeserialize:[97,1,103,19]},_Possible:{_Track:[10,1,17,38],_Counts:[24,1,30,14],_CheckName:[32,1,35,35],_PrintCounts:[37,1,37,31]}},Ku=(e,t)=>{let n=Gu[e]?.[t];return n&&{module:e,start:{line:n[0],column:n[1]},end:{line:n[2],column:n[3]}}},qu=(e,t)=>`${e}${t}`,Ju=(e,t,n)=>`${e}${t}${n}`,Yu=e=>{let t=e.split(`\0`);return{operator:t[0],index:Number(t[1]),param:t[2]}},Xu=(e,t,n)=>`${e},${t},${n}`,Zu=(e=0)=>({level:e,params:/* @__PURE__ */ new Set,constraints:/* @__PURE__ */ new Map,argConstraints:/* @__PURE__ */ new Map,argParams:/* @__PURE__ */ new Set}),Qu=(e,t,n)=>e.set(t,Math.min(n,e.get(t)??3)),$u=(e,t,n)=>e.set(t,Math.max(n,e.get(t)??0)),ed=(e,t)=>{t.constraints.forEach((t,n)=>Qu(e.constraints,n,t)),t.argConstraints.forEach((t,n)=>$u(e.argConstraints,n,t)),t.argParams.forEach(t=>e.argParams.add(t))},V=(e,t,n,r)=>({...Zu(t),name:e,formals:[],maxLevels:n,weights:r,minMaxLevels:[],conditions:/* @__PURE__ */ new Set,nonLeibniz:/* @__PURE__ */ new Set}),td=(e,t)=>e.formals.length===0&&e.maxLevels.length>0?e.maxLevels[Math.min(t,e.maxLevels.length-1)]:e.maxLevels[t]??3,nd=(e,t)=>e.formals.length===0&&e.weights.length>0?e.weights[Math.min(t,e.weights.length-1)]:e.weights[t]??1,rd=new Map([[`=`,0,[2,2],[1,1]],[`#`,0,[2,2],[1,1]],[`\\in`,0,[2,2],[1,1]],[`\\notin`,0,[2,2],[1,1]],[`\\subseteq`,0,[2,2],[1,1]],[`\\cup`,0,[2,2],[1,1]],[`\\cap`,0,[2,2],[1,1]],[`\\`,0,[2,2],[1,1]],[`=>`,0,[3,3],[1,1]],[`<=>`,0,[3,3],[1,1]],[`/\\`,0,[3,3],[1,1]],[`\\/`,0,[3,3],[1,1]],[`~`,0,[3],[1]],[`SUBSET`,0,[2],[1]],[`UNION`,0,[2],[1]],[`DOMAIN`,0,[2],[1]],[`~>`,3,[3,3],[0,0]],[`-+->`,3,[3,3],[0,0]],[`\\cdot`,2,[2,2],[0,0]],[`TRUE`,0,[],[]],[`FALSE`,0,[],[]],[`BOOLEAN`,0,[],[]],[`STRING`,0,[],[]]].map(e=>[e[0],{...V(e[0],e[1],[...e[2]],[...e[3]]),nonLeibniz:new Set(e[1]>1?[0,1]:[])}])),id=V(`'`,2,[1],[0]),ad=V(`UNCHANGED`,2,[1],[0]),od=V(`ENABLED`,1,[2],[0]),sd=V(`[]`,3,[3],[0]),cd=V(`<>`,3,[3],[0]),ld=V(`$ConjList`,0,[3],[1]),ud=V(`$DisjList`,0,[3],[1]),dd=V(`$IfThenElse`,0,[3],[1]),fd=V(`$Case`,0,[3],[1]),pd=V(`$BoundedForall`,0,[3],[1]),md=V(`$BoundedExists`,0,[3],[1]),hd=V(`$UnboundedForall`,0,[3],[1]),gd=V(`$UnboundedExists`,0,[3],[1]),_d=V(`$TemporalForall`,3,[3],[0]),vd=V(`$TemporalExists`,3,[3],[0]),yd=V(`$BoundedChoose`,0,[2],[1]),bd=V(`$UnboundedChoose`,0,[2],[1]),xd=V(`$SetEnumerate`,0,[2],[1]),Sd=V(`$Tuple`,0,[2],[1]),Cd=V(`$SetOfFcns`,0,[2],[1]),wd=V(`$CartesianProd`,0,[2],[1]),Td=V(`$SubsetOf`,0,[2],[1]),Ed=V(`$SetOfAll`,0,[2],[1]),Dd=V(`$FcnConstructor`,0,[3],[1]),Od=V(`$RcdConstructor`,0,[3],[1]),kd=V(`$SetOfRcds`,0,[2],[1]),Ad=V(`$Except`,0,[2],[1]),jd=V(`$Pair`,0,[3],[1]),Md=V(`$Seq`,0,[2],[1]),Nd=V(`$FcnApply`,0,[2,2],[1,1]),Pd=V(`$RcdSelect`,0,[2,0],[1,1]),Fd=V(`$SquareAct`,2,[2,1],[0,0]),Id=V(`$AngleAct`,2,[2,1],[0,0]),Ld=V(`$WF`,3,[1,2],[0,0]),Rd=V(`$SF`,3,[1,2],[0,0]),zd=(e,t)=>t.length===0?e:new Map([...e,...t.map(e=>[e.name,{kind:`Formal`,arity:e.arity}])]),Bd=e=>e.map(e=>({name:e,arity:0})),Vd=(e,t)=>t.location.range?h(`${e}.`,t.location.range):new s(`${e} at line ${t.location.line}, column ${t.location.column}`),Hd=/* @__PURE__ */ new Set([`/\\`,`\\/`,`=>`,`<=>`]),Ud=e=>e.kind!==`Let`&&e.kind!==`Label`,Wd=e=>{let t=/* @__PURE__ */ new Map,n=(t,n)=>{let r=n.get(t);if(r?.kind===`Formal`)return{kind:`Declared`,name:t,level:0,arity:r.arity};if(r?.kind===`Let`)return{kind:`Defined`,levels:y(r.definition,r.scope)};if(e.constants.has(t))return{kind:`Declared`,name:t,level:0,arity:0};if(e.variables.has(t))return{kind:`Declared`,name:t,level:1,arity:0};let i=e.getDefinition(t);if(i){let n=y(i,/* @__PURE__ */ new Map),r=e.getQualifiedName?.(t);return{kind:`Defined`,levels:r?{...n,name:r}:n}}let a=rd.get(t)??Wu.get(t);return a?{kind:`Defined`,levels:a}:{kind:`Declared`,name:t,level:0,arity:0}},r=(e,t,n)=>{let r=Zu(Math.max(t,...n.map(e=>e.data.level)));return r.params.add(e),n.forEach((t,n)=>{t.data.params.forEach(t=>{r.params.add(t),r.argParams.add(Ju(e,n,t))}),$u(r.argConstraints,qu(e,n),t.data.level),ed(r,t.data)}),r},i=(e,t,n=[],r=[])=>{let i=e=>r.includes(e);t.forEach((t,n)=>{if(t.kind===`Value`&&t.data.level>td(e,n))throw new s(`Level error in applying operator ${cc(e.name)}:\nThe level of argument ${n+1} exceeds the maximum level allowed by the operator`)});let a=n=>{let r=e.formals.findIndex(e=>e.name===n);return r===-1?void 0:t[r]},o=(t,n,r)=>e.conditions.has(Xu(t,n,r)),c=Zu(Math.max(e.level,...t.filter((t,n)=>nd(e,n)===1).map(e=>e.data.level),...n.map(e=>e.level)));return e.params.forEach(e=>c.params.add(e)),t.forEach((t,n)=>{nd(e,n)===1&&t.data.params.forEach(e=>c.params.add(e))}),n.forEach(e=>e.params.forEach(e=>c.params.add(e))),r.forEach(e=>c.params.delete(e)),e.constraints.forEach((e,t)=>Qu(c.constraints,t,e)),t.forEach(e=>e.data.constraints.forEach((e,t)=>{i(t)||Qu(c.constraints,t,e)})),n.forEach(e=>e.constraints.forEach((e,t)=>Qu(c.constraints,t,e))),t.forEach((t,n)=>t.data.params.forEach(t=>{i(t)||Qu(c.constraints,t,td(e,n))})),t.forEach((e,n)=>{if(e.kind!==`Operator`)return;let r=e.data;t.forEach((e,t)=>r.formals.forEach((i,a)=>{o(n,t,a)&&e.data.params.forEach(e=>Qu(c.constraints,e,td(r,a)))}))}),e.argParams.forEach(e=>{let t=Yu(e),n=a(t.operator);n?.kind===`Operator`&&Qu(c.constraints,t.param,td(n.data,t.index))}),[e.argConstraints,...t.map(e=>e.data.argConstraints),...n.map(e=>e.argConstraints)].forEach(e=>e.forEach((e,t)=>$u(c.argConstraints,t,e))),t.forEach((n,r)=>{if(n.kind!==`Declared`)return;let i=n.declared;Array.from({length:i.arity},(t,n)=>$u(c.argConstraints,qu(i.name,n),e.minMaxLevels[r]?.[n]??0)),t.forEach((e,t)=>Array.from({length:i.arity},(n,a)=>{o(r,t,a)&&$u(c.argConstraints,qu(i.name,a),e.data.level)}))}),e.argParams.forEach(e=>{let t=Yu(e),n=a(t.operator);n&&$u(c.argConstraints,qu(t.operator,t.index),n.data.level)}),t.forEach(e=>e.data.argParams.forEach(e=>{i(Yu(e).param)||c.argParams.add(e)})),n.forEach(e=>e.argParams.forEach(e=>c.argParams.add(e))),e.argParams.forEach(e=>{let t=Yu(e),n=a(t.operator);if(n)n.kind===`Declared`&&c.argParams.add(Ju(n.declared.name,t.index,t.param));else{let n=a(t.param);if(!n){c.argParams.add(e);return}n.data.params.forEach(e=>c.argParams.add(Ju(t.operator,t.index,e)))}}),t.forEach((e,n)=>{if(e.kind!==`Declared`)return;let r=e.declared;t.forEach((e,t)=>Array.from({length:r.arity},(i,a)=>{o(n,t,a)&&e.data.params.forEach(e=>c.argParams.add(Ju(r.name,a,e)))}))}),c},a=(e,t)=>{if(e.kind===`Lambda`)return{kind:`Operator`,data:v(`LAMBDA`,Bd(e.params),e.body,t)};let r=e.kind===`OperatorReference`?e.operator:e.kind===`Identifier`?e.name:void 0;if(r!==void 0){let i=n(r,t);if(i.kind===`Defined`&&(i.levels.formals.length>0||e.kind===`OperatorReference`))return{kind:`Operator`,data:i.levels};if(i.kind===`Declared`&&i.arity>0){let e=Zu();return e.params.add(r),{kind:`Declared`,data:e,declared:{name:r,arity:i.arity}}}if(e.kind===`OperatorReference`)return{kind:`Value`,data:Zu()}}return{kind:`Value`,data:m(e,t)}},o=(e,t)=>e.map(e=>a(e,t)),c=(e,t,n,r=[],a=Wc(r))=>{let c=o(t,zd(n,Bd(a))),l=r.map(e=>m(e.set,n)),u=i(e,c,l,a),d=r[l.findIndex(e=>e.level>2)]?.pattern;if(d){let t=d.ranges?.[0];throw new s(`Level error in applying operator ${e.name}:\nThe level of the range for the bounded variable ${t?g(t):Uc(d)[0]} \nexceeds the maximum level allowed by the operator`)}return u},l=(e,t)=>e.kind===`Declared`?r(e.name,e.level,t):i(e.levels,t),u=(e,t,n)=>{let r=e.map(e=>e.data.level);if(r.includes(2)&&r.includes(3))throw Vd(`${n} has both temporal formula and action as arguments`,t)},d=(e,t)=>{if((e.operator===`~>`||e.operator===`-+->`)&&t.some(e=>e.data.level===2))throw Vd(`Action used where only temporal formula or state predicate allowed`,e);Hd.has(e.operator)&&u(t,e,cc(e.operator))},f=(e,t)=>{let n=e.expression,r=e.kind===`Always`?`BoxAction`:`AngleAction`;if(t===2&&Ud(n)&&n.kind!==r)throw Vd(e.kind===`Always`?`[] followed by action not of form [A]_v`:`<> followed by action not of form <<A>>_v`,e)},p=(e,t)=>{let n=new Map(t);e.definitions.forEach(e=>n.set(e.name,{kind:`Let`,definition:e,scope:n}));let r=m(e.body,n),i={level:r.level,params:new Set(r.params),constraints:new Map(r.constraints),argConstraints:new Map(r.argConstraints),argParams:new Set(r.argParams)};return e.definitions.forEach(e=>ed(i,y(e,n))),i},m=(e,t)=>{try{return h(e,t)}catch(t){throw!(t instanceof s)||t.sany?t:Vd(t.message,e)}},h=(e,t)=>{switch(e.kind){case`Number`:case`Decimal`:case`String`:case`ExceptAt`:return Zu();case`Identifier`:return l(n(e.name,t),[]);case`Apply`:{let r=o(e.args,t);return d(e,r),l(n(e.operator,t),r)}case`OperatorReference`:case`Lambda`:return a(e,t).data;case`And`:case`Or`:{let n=o(e.operands,t),r=e.kind===`And`;return u(n,e,e.isBulleted?`${r?`Conjunction`:`Disjunction`} list`:r?`\\land`:`\\lor`),i(r?ld:ud,n)}case`Prime`:return c(id,[e.expression],t);case`Unchanged`:return c(ad,[e.expression],t);case`Enabled`:return c(od,[e.expression],t);case`Always`:case`Eventually`:{let n=a(e.expression,t);return f(e,n.data.level),i(e.kind===`Always`?sd:cd,[n])}case`If`:return c(dd,[e.condition,e.consequent,e.alternative],t);case`Case`:return c(fd,[...e.arms.flatMap(e=>[e.condition,e.body]),...e.other?[e.other]:[]],t);case`Let`:return p(e,t);case`Forall`:case`Exists`:{let n=c(e.kind===`Forall`?pd:md,[e.body],t,e.bounds),r=n.level===3?e.bounds.find(e=>m(e.set,t).level===2):void 0;if(r)throw Vd(`Action-level bound of quantified temporal formula`,r.set);return n}case`UnboundedQuantifier`:return c(e.isTemporal?e.quantifier===`Forall`?_d:vd:e.quantifier===`Forall`?hd:gd,[e.body],t,[],e.names);case`Choose`:return c(e.set?yd:bd,[e.body],t,e.set?[{pattern:e.pattern,set:e.set}]:[],Uc(e.pattern));case`SetEnumeration`:return c(xd,e.elements,t);case`Tuple`:return c(Sd,e.elements,t);case`FunctionSet`:return c(Cd,[e.domain,e.range],t);case`Product`:return c(wd,e.factors,t);case`SetFilter`:return c(Td,[e.predicate],t,[e.bound]);case`SetMap`:return c(Ed,[e.expression],t,e.bounds);case`FunctionConstruction`:return c(Dd,[e.body],t,e.bounds);case`Record`:return c(Od,e.fields.map(e=>e.value),t);case`RecordSet`:return c(kd,e.fields.map(e=>e.value),t);case`Except`:return i(Ad,[a(e.function,t),...e.updates.map(e=>({kind:`Value`,data:i(jd,[{kind:`Value`,data:i(Md,e.path.map(e=>e.kind===`Field`?{kind:`Value`,data:Zu()}:e.args.length===1?a(e.args[0],t):{kind:`Value`,data:c(Sd,e.args,t)}))},a(e.value,t)])}))]);case`FunctionApplication`:return i(Nd,[a(e.function,t),e.args.length===1?a(e.args[0],t):{kind:`Value`,data:c(Sd,e.args,t)}]);case`Bracket`:return Zu();case`FieldAccess`:return i(Pd,[a(e.record,t),{kind:`Value`,data:Zu()}]);case`BoxAction`:case`AngleAction`:return c(e.kind===`BoxAction`?Fd:Id,[e.action,e.subscript],t);case`WeakFairness`:case`StrongFairness`:return c(e.kind===`WeakFairness`?Ld:Rd,[e.subscript,e.action],t);case`Label`:return m(e.body,t);case`Subexpression`:return Zu()}},_=(e,t,r=!1,i=/* @__PURE__ */ new Set)=>{let a=(e,n=r,a=t)=>_(e,a,n,i),o=(e,o)=>{let s=n(e,t);s.kind===`Declared`?(r&&i.add(e),o.forEach(e=>a(e))):o.forEach((e,t)=>a(e,r||s.levels.nonLeibniz.has(t)))};switch(e.kind){case`Identifier`:return o(e.name,[]),i;case`Apply`:return o(e.operator,e.args),i;case`Lambda`:case`Let`:return i;case`Prime`:case`Unchanged`:case`Enabled`:case`Always`:case`Eventually`:case`BoxAction`:case`AngleAction`:case`WeakFairness`:case`StrongFairness`:return mt(e).forEach(e=>a(e,!0)),i;case`UnboundedQuantifier`:return a(e.body,r||e.isTemporal===!0,zd(t,Bd(e.names))),i;default:return mu(e,(e,n)=>a(e,r,zd(t,Bd(n)))),i}},v=(e,t,n,r)=>{let i=zd(r,t),a=m(n,i),o=e=>t.some(t=>t.name===e),s=_(n,i),c={...Zu(a.level),name:e,formals:t,nonLeibniz:new Set(t.flatMap((e,t)=>s.has(e.name)?[t]:[])),maxLevels:t.map(e=>Math.min(3,a.constraints.get(e.name)??3)),weights:t.map(e=>+!!a.params.has(e.name)),minMaxLevels:t.map(e=>Array.from({length:e.arity},(t,n)=>a.argConstraints.get(qu(e.name,n))??0)),conditions:new Set(t.flatMap((e,n)=>t.flatMap((t,r)=>Array.from({length:e.arity},(e,t)=>t).filter(n=>a.argParams.has(Ju(e.name,n,t.name))).map(e=>Xu(n,r,e)))))};return a.params.forEach(e=>{o(e)||c.params.add(e)}),a.constraints.forEach((e,t)=>{o(t)||c.constraints.set(t,e)}),a.argConstraints.forEach((e,t)=>{o(Yu(t).operator)||c.argConstraints.set(t,e)}),a.argParams.forEach(e=>{let t=Yu(e);o(t.operator)&&o(t.param)||c.argParams.add(e)}),c},y=(e,n)=>{let r=t.get(e);if(r)return r;let i=e.kind===`Operator`?e.params:[];t.set(e,{...Zu(),name:e.name,formals:i,maxLevels:i.map(()=>3),weights:i.map(()=>0),minMaxLevels:i.map(()=>[]),conditions:/* @__PURE__ */ new Set,nonLeibniz:/* @__PURE__ */ new Set});let a=e.kind===`Function`?{kind:`FunctionConstruction`,bounds:e.bounds,body:e.body,location:e.location}:e.body,o=v(e.name,i,a,n);return t.set(e,o),o};return{analyze:m,analyzeDefinition:y,toOperand:a}},Gd=(e,t,n)=>{let r=new Map(t),i=e.assumptions.flatMap(e=>{if(e.kind===`NewSymbol`){let t=e.set&&n.analyze(e.set,r);return r.set(e.name,{kind:`Formal`,arity:e.arity}),t?[t]:[]}return[e.kind===`AssumeProve`?Gd(e,r,n):n.analyze(e,r)]});i.push(n.analyze(e.conclusion,r));let a=Zu(Math.max(...i.map(e=>e.level)));return i.forEach(e=>{e.params.forEach(e=>a.params.add(e)),ed(a,e)}),a},Kd=(e,t,n,r)=>{let i=Wd(t),a=e=>Math.max(0,...e.map(e=>i.analyze(e,/* @__PURE__ */ new Map).level)),o=e=>{let t=e.body;return t.kind===`Have`||t.kind===`Case`?a([t.expression]):t.kind===`Witness`?a(t.expressions):t.kind===`Take`?a(t.bounds.map(e=>e.set)):t.kind===`Pick`?a([t.body,...t.bounds.map(e=>e.set)]):t.kind===`Assert`?t.statement.kind===`AssumeProve`?Gd(t.statement,/* @__PURE__ */ new Map,i).level:a([t.statement]):0},s=e=>e?.kind===`Steps`?e.steps.flatMap(e=>{let t=g(e.statement),n=()=>o(e)===0;return e.body.kind===`Have`||e.body.kind===`Take`||e.body.kind===`Witness`?n()?[]:[{location:t,message:`Non-constant TAKE, WITNESS, or HAVE for temporal goal.`}]:e.body.kind===`Case`?[...n()?[]:[{location:t,message:`Non-constant CASE for temporal goal.`}],...s(e.proof)]:e.body.kind===`Qed`?s(e.proof):[]}):[],l=e=>e?.kind===`Steps`?e.steps.flatMap(e=>{let t=e.body,n=()=>o(e)===3,r=t.kind===`Pick`&&t.bounds.length>0&&n()?t.bounds.filter(e=>a([e.set])!==0).flatMap(e=>e.set.location.range?[{location:g(e.set.location.range),message:`Non-constant bound of temporal PICK.`}]:[]):[];return[...l(e.proof),...r,...e.proof?.kind===`Steps`&&n()?s(e.proof):[]]}):[],u=nu([...e.definitions.filter(e=>!e.name.includes(`!`)).map(e=>({location:e.location,check:()=>i.analyzeDefinition(e,/* @__PURE__ */ new Map)})),...e.assumptions.map(e=>({location:e.location,check:()=>{let t=i.analyze(e.expression,/* @__PURE__ */ new Map).level,n=e.location.range;if(t!==0&&n)throw h(`Level error: assumptions must be level 0 (Constant), \nbut this one has level ${t}.`,n)}})),...e.theorems.map(e=>({location:e.location,check:()=>{let t=e.statement.kind===`AssumeProve`?Gd(e.statement,/* @__PURE__ */ new Map,i):i.analyze(e.statement,/* @__PURE__ */ new Map),n=[...l(e.proof),...t.level===3?s(e.proof):[]];if(n.length>0)throw c(n)}})),...n],r);if(u.length>0)throw c(u,!1,void 0,r)},qd=/* @__PURE__ */ new Set([`Prime`,`Unchanged`,`BoxAction`,`AngleAction`]),Jd=/* @__PURE__ */ new Set([`Always`,`Eventually`,`WeakFairness`,`StrongFairness`]),Yd=/* @__PURE__ */ new Set([...qd,...Jd,`Enabled`]),Xd=/* @__PURE__ */ new Set([`~>`,`-+->`]),Zd=/* @__PURE__ */ new Set([...Xd,`\\cdot`]),Qd=/* @__PURE__ */ new Set([`Print`,`PrintT`,`Assert`,`JavaTime`,`RandomElement`,`TLCGet`,`TLCSet`]),$d=/* @__PURE__ */ new Set([`UNION`,`\\cup`]),ef=/* @__PURE__ */ new Set([`RandomSubset`,`RandomSetOfSubsets`,`TestRandomSetOfSubsets`,`RandomSubsetSet`]),tf=(e,t)=>Qd.has(e)||t.builtins.get(e)?.isStateLevel===!0,nf=(e,t,n)=>{let r=new Uint32Array(n),i=[],a=e=>{let t=e.kind;if(qd.has(t)||t===`Apply`&&e.operator===`\\cdot`)return 96;if(t===`Enabled`)return 32;if(Jd.has(t)||t===`UnboundedQuantifier`&&e.isTemporal===!0||t===`Apply`&&Xd.has(e.operator))return 224},o=(e,n,s)=>{let c=e.kind,l=s?1:513;(Yd.has(c)||c===`UnboundedQuantifier`&&e.isTemporal===!0||c===`Apply`&&Zd.has(e.operator))&&(r[0]|=l),Yd.has(c)&&(r[0]|=16);let u=a(e);n&&u!==void 0&&(r[0]|=u);let d=n&&u===void 0,f=ht(e);if(f!==void 0&&M(e)&&t.variableIndex.has(f)&&(s||(r[0]|=512),d&&(r[0]|=32)),f!==void 0&&!M(e)){let e=t.substitutions.get(f)??f,n=t.definitions.get(e),a=t.constants.has(f),o=t.variableIndex.get(f);if((o!==void 0||t.builtins.get(f)?.isStateLevel||n&&t.variableIndex.has(n.name))&&(r[0]|=l),o!==void 0&&(d&&(r[0]|=32),a||(r[1+(o>>>5)]|=1<<(o&31))),n)i.push({callee:n,isOverridden:a,isLevelCounted:d,isOperatorArgument:s||c===`OperatorReference`||c===`Identifier`&&n.kind===`Operator`&&n.params.length>0});else{tf(f,t)&&(r[0]|=2|(f===`Assert`?0:4)),$d.has(f)&&(r[0]|=8),ef.has(f)&&(r[0]|=256),!a&&tf(e,t)&&(r[0]|=16);let n=t.builtins.get(e);d&&!a&&o===void 0&&n?.isStateLevel&&!n.isLevelConstant&&(r[0]|=n.isActionLevel?96:32)}}mt(e).forEach(e=>o(e,d,s||c===`Lambda`))};return e.forEach(e=>o(e,!0,!1)),{row:r,edges:i}},rf=(e,t,n,r)=>{let i=n.length,a=e.slice(),o=new Int32Array(i).fill(-1),s=new Int32Array(i),c=new Int32Array(i).fill(-1),l=[],u=[],d=0,f=0,p=(e,n)=>{for(let i=0;i<t;i++){let o=a[n*t+i];a[e*t+i]|=i===0?o&r:o}},m=e=>{u.push(e,0),o[e]=s[e]=d++,l.push(e)};for(let e=0;e<i;e++)if(o[e]===-1)for(m(e);u.length>0;){let e=u[u.length-2],t=u[u.length-1],r=n[e];if(t<r.length){u[u.length-1]=t+1;let n=r[t];o[n]===-1?m(n):c[n]===-1&&(s[e]=Math.min(s[e],o[n]));continue}if(u.length-=2,u.length>0){let t=u[u.length-2];s[t]=Math.min(s[t],s[e])}if(s[e]!==o[e])continue;let i=[];for(;;){let t=l.pop()??e;if(c[t]=f,i.push(t),t===e)break}f++;let a=i[0];i.forEach(e=>{e!==a&&p(a,e),n[e].forEach(e=>{c[e]!==c[a]&&p(a,e)})}),i.forEach(e=>{e!==a&&p(e,a)})}return a},af=(e,t)=>e.kind===`Operator`&&e.params.length===0&&!(t&513),of=e=>{let t=[...new Set(e.definitions.values())],n=new Map(t.map((e,t)=>[e,t])),r=1+(e.variables.length+31>>>5),i=new Uint32Array(t.length*r),a=new Uint32Array(t.length*r),o=t.map((t,n)=>{let o=nf(pt(t),e,r);return i.set(o.row,n*r),a[n*r]=o.row[0]&270,o.edges}),s=e=>n.get(e.callee)??-1,c=o.map(e=>new Int32Array(e.filter(e=>!e.isOverridden).map(s))),l=rf(i,r,c,17),u=o.map(e=>new Int32Array(e.filter(e=>!e.isOverridden&&e.isLevelCounted).map(s))),d=rf(i,r,u,224),f=o.map(e=>new Int32Array(e.filter(e=>!e.isOverridden&&!e.isOperatorArgument).map(s))),p=rf(i,r,f,512),m=o.map(e=>new Int32Array(e.map(s).filter(e=>!af(t[e],l[e*r]|p[e*r])))),h=rf(a,r,m,270);return{ids:n,rows:l.map((e,t)=>t%r===0?e&17|p[t]&512|d[t]&224|h[t]&270:e),words:r}},sf=(e,t)=>{let n=t.facts,r=n.ids.get(e);return r===void 0?cf(pt(e),t):n.rows.subarray(r*n.words,(r+1)*n.words)},cf=(e,t)=>{let n=t.facts.words,r=nf(e,t,n),i=r.row;return r.edges.forEach(e=>{let r=sf(e.callee,t);if(!e.isOverridden){i[0]|=r[0]&17,e.isOperatorArgument||(i[0]|=r[0]&512),e.isLevelCounted&&(i[0]|=r[0]&224);for(let e=1;e<n;e++)i[e]|=r[e]}af(e.callee,r[0])||(i[0]|=r[0]&270)}),i},lf=(e,t)=>!(sf(e,t)[0]&513),uf=(e,t)=>!(sf(e,t)[0]&512),df={any:2,repeated:4,streamed:8,replayed:260},ff=(e,t,n)=>(cf(e,t)[0]&df[n])!==0,pf=(e,t,n=`any`)=>(sf(e,t)[0]&df[n])!==0,mf=(e,t)=>{let n=sf(e,t)[0]&224;return n===224?3:n===96?2:+(n===32)},hf=e=>{let t=[];for(let n=1;n<e.length;n++)for(let r=e[n];r!==0;r&=r-1)t.push((n-1<<5)+(31-Math.clz32(r&-r)));return t},gf=(e,t)=>{let n=cf([e],t);return n[0]&16?void 0:hf(n)},_f=(e,t)=>!!(cf([e],t)[0]&1),vf=(e,n,r)=>new t(`Applying ${e} to the following value,\nwhich is not ${n}:\n${N(L(r))}`),yf=e=>pn(e)?I(e):void 0,bf=`a function with a finite domain`,xf=(e,t,n)=>{let r=R(e,t,n),i=yf(r);if(!i)throw vf(n,bf,r);return i},Sf=(e,t)=>{let n=R(e,1,t),r=yf(n),i=r&&Ef(r,R(e,0,t));if(!r||i!==void 0&&typeof i!=`number`)throw fs(`second`,t,`bag`,n);return i},Cf=(e,t,n)=>{let r=t[n];if(!r||!Tf(r))throw fs(n===0?`first`:`second`,`(+)`,`bag`,R(e,n,`(+)`));return r},wf=(e,t)=>{if(!dn(e)||!P(e))throw t();return F(e).elements},Tf=e=>e.range.every(e=>typeof e==`number`&&e>0),Ef=(e,t)=>{let n=e.domain.findIndex(e=>Kr(t,e));return n===-1?void 0:e.range[n]},Df=(e,t)=>{if(typeof e==`number`)return e;throw t()},Of=(e,t,n)=>{let r=Df(e,n)+Df(t,n);if(xs(r))throw Ss(`${e}+${t}`);return r},kf=(e,t,n,r,i)=>{let a=Df(e.range[t],r),o=Ef(n,e.domain[t]);if(o===void 0)return a;let s=a-Df(o,i);if(xs(s))throw Ss(`${a}-${o}`);return s},Af=(e,t,n,r,i=e.length)=>{let a=e.slice(0,i).find(e=>Kr(t,e[0]));a?a[1]=Of(a[1],n,r):e.push([t,n])},jf=e=>e.domain.map((t,n)=>[t,e.range[n]]),Mf=or([],[]),Nf=e=>[_s(`EmptyBag`,Mf),z(`IsABag`,1,e=>{let t=yf(R(e,0,`IsABag`));return t!==void 0&&Tf(t)}),z(`BagCardinality`,1,e=>{let t=R(e,0,`BagCardinality`),n=xf(e,0,`BagCardinality`),r=()=>vf(`BagCardinality`,`a bag`,t);return n.range.reduce((e,t)=>{if(typeof t!=`number`||t<=0)throw r();return Of(e,t,r)},0)}),z(`BagIn`,2,e=>{let t=Sf(e,`BagIn`);return t!==void 0&&t>0}),z(`CopiesIn`,2,e=>Sf(e,`CopiesIn`)??0),z(`\\oplus`,2,e=>{let t=[0,1].map(t=>yf(R(e,t,`(+)`))),n=Cf(e,t,0),r=Cf(e,t,1),i=jf(n),a=()=>fs(`second`,`(+)`,`bag`,R(e,1,`(+)`));return r.domain.forEach((e,t)=>Af(i,e,r.range[t],a,n.domain.length)),ti(i)}),z(`\\ominus`,2,e=>{let t=R(e,0,`(-)`),n=R(e,1,`(-)`),r=yf(t),i=yf(n);if(!r)throw fs(`first`,`(-)`,`bag`,t);if(!i)throw fs(`second`,`(-)`,`bag`,n);let a=()=>fs(`first`,`(-)`,`bag`,t),o=()=>fs(`second`,`(-)`,`bag`,n);return ti(r.domain.flatMap((e,t)=>{let n=kf(r,t,i,a,o);return n>0?[[e,n]]:[]}))}),z(`BagUnion`,1,e=>{let n=R(e,0,`BagUnion`),r=wf(n,()=>vf(`BagUnion`,`a finite enumerable set`,n));if(r.length<2)return r[0]??Mf;let i=()=>new t(`Attempted to apply BagUnion to the following set, whose\nelement is not a bag:\n${N(L(n))}`),a=e=>{let t=yf(e);if(!t)throw i();return t},o=jf(a(r[0]));return r.slice(1).forEach(e=>{let t=a(e);t.domain.forEach((e,n)=>Af(o,e,t.range[n],i))}),ti(o)}),z(`\\sqsubseteq`,2,e=>{let t=R(e,0,`\\sqsubseteq`),n=R(e,1,`\\sqsubseteq`),r=yf(t),i=yf(n);if(!r)throw vf(`\\sqsubseteq`,bf,t);if(!i)throw vf(`\\sqsubseteq`,bf,n);let a=()=>vf(`\\sqsubseteq`,`a bag`,t),o=()=>vf(`\\sqsubseteq`,`a bag`,n);return r.domain.every((e,t)=>{let n=Ef(i,e);return Df(r.range[t],a)<=(n===void 0?0:Df(n,o))})}),vs(`BagOfAll`,2,e=>{let t=gs(e,0,`BagOfAll`),n=R(e,1,`BagOfAll`),r=yf(n);if(!r)throw fs(`second`,`BagOfAll`,`function with a finite domain`,n);let i=[],a=()=>fs(`second`,`BagOfAll`,`bag`,n);return r.domain.forEach((e,n)=>Af(i,t.call([e]),r.range[n],a)),ti(i)}),z(`SubBag`,1,t=>{let n=R(t,0,`SubBag`);if(!pn(n))throw new w(`Attempted to apply the operator DOMAIN to a non-function\n(${Os(n)})\nline 106, col 58 to line 106, col 65 of module Bags`);let r=I(n),i=F(Xr(r.range)).elements,a=i.find(e=>typeof e!=`number`);a!==void 0&&e.get(`>=`)?.evaluateBinary?.(i[0],a);let o=r.range.filter(e=>typeof e==`number`);if(o.some(e=>e<1))throw new w(`Attempted to apply a function to ${L(r)}, which is not in its domain`);return Yr(r.domain.reduce((e,t,n)=>e.flatMap(e=>[e,...Array.from({length:o[n]},(n,r)=>[...e,[t,r+1]])]),[[]]).map(e=>or(e.map(e=>e[0]),e.map(e=>e[1]))))}),z(`BagToSet`,1,e=>ha(xf(e,0,`BagToSet`))),z(`SetToBag`,1,e=>{let t=R(e,0,`SetToBag`),n=wf(t,()=>vf(`BagToSet`,bf,t));return or([...n],n.map(()=>1))})],Pf={emptyArray:1,nonemptyArray:2,emptyObject:3,danglingName:4,nonemptyObject:5,emptyDocument:6,nonemptyDocument:7},H={none:0,beginObject:1,endObject:2,beginArray:3,endArray:4,true:5,false:6,null:7,singleQuoted:8,doubleQuoted:9,unquoted:10,singleQuotedName:12,doubleQuotedName:13,unquotedName:14,number:16,eof:17},Ff={none:0,sign:1,digit:2,decimal:3,fractionDigit:4,exponentE:5,exponentSign:6,exponentDigit:7},If=[{lower:`true`,upper:`TRUE`,token:H.true},{lower:`false`,upper:`FALSE`,token:H.false},{lower:`null`,upper:`NULL`,token:H.null}],Lf=/* @__PURE__ */ new Map([[`t`,` `],[`b`,`\b`],[`n`,`
395
+ the name of a theorem, assumption, or step.`})});let o=e.location.range;e.facts.length+a===0&&o&&n.errors.push({location:g(o),message:e.kind===`By`?`Empty BY`:`Empty USE or HIDE statement.`})},Hl=(e,t,n)=>(e.set&&B(e.set,t,n),zc(t,e.name,{kind:`New${e.level}`,arity:e.arity,range:e.nameRange},n)),Ul=(e,t,n,r=!1)=>{let i=e.assumptions.reduce((e,t)=>t.kind===`NewSymbol`?{scope:Hl(t,e.scope,e.unit),unit:r?{...e.unit,isLabelForbidden:!0}:e.unit}:(t.kind===`AssumeProve`?Ul(t,e.scope,e.unit,!0):B(t,e.scope,e.unit),e),{scope:t,unit:n});return B(e.conclusion,i.scope,i.unit),i.scope},Wl=(e,t,n)=>e.kind===`AssumeProve`?Ul(e,t,n):(B(e,t,n),t),Gl=(e,t,n)=>{let r=n.hasLabelScope?{...n,hasLabelScope:!1}:n;e?.kind===`By`&&Vl(e,t,r),e?.kind===`Steps`&&e.steps.reduce((e,t)=>Jl(t,e,r),t)},Kl=(e,t,n)=>{let r=eu(e,t,n);return e.name===void 0?r:zc(r,e.name,{kind:`Instance`,arity:e.params.length,range:e.location.range},n)},ql=(e,t)=>{let n=(e,t)=>({statement:t,isSuffices:!1,isInProof:!1,keyword:e});switch(e.kind){case`Have`:return n(`HAVE`,{kind:`Tuple`,elements:[e.expression],location:t});case`Case`:return n(`CASE`,{kind:`Tuple`,elements:[e.expression],location:t});case`Witness`:return n(`WITNESS`,{kind:`Tuple`,elements:e.expressions,location:t});case`Take`:return n(`TAKE`,{kind:`Tuple`,elements:sl(e.bounds),location:t});case`Pick`:return n(`PICK`,e.bounds.length>0?{kind:`Exists`,bounds:e.bounds,body:e.body,location:t}:{kind:`UnboundedQuantifier`,quantifier:`Exists`,names:e.names,body:e.body,location:t});case`Qed`:return n(`QED step`,{kind:`Tuple`,elements:[],location:t});default:return}},Jl=(e,t,n)=>{let r=e.body,i=e.name===void 0?n:{...n,hasLabelScope:!0,labelParams:[],labels:/* @__PURE__ */ new Set},a=ql(r,e.location),o=t=>e.name===void 0?t:{name:e.name,arity:0,kind:`Theorem`,parent:t,goal:a},s=t=>e.name===void 0?t:{name:e.name,arity:0,kind:`Theorem`,parent:t,isNonFact:!0};switch(r.kind){case`Assert`:{let a=Wl(r.statement,t,i),o=r.isSuffices?t:a,s=e.name;if(s===void 0)return Gl(e.proof,o,n),r.isSuffices?a:t;let c={statement:r.statement,isSuffices:r.isSuffices,isInProof:!0,keyword:r.isSuffices&&r.statement.kind!==`AssumeProve`?`SUFFICES`:void 0};return Gl(e.proof,{name:s,arity:0,kind:`Theorem`,parent:o,goal:c},n),c.isInProof=!1,{name:s,arity:0,kind:`Theorem`,parent:r.isSuffices?a:t,goal:c}}case`Use`:case`Hide`:return Vl(r,t,n),s(t);case`Instance`:return s(Kl(r,t,i));case`Define`:return s(r.definitions.reduce((e,t)=>t.kind===`Instance`?Kl(t,e,i):El([t],e,n),t));case`Have`:case`Case`:return B(r.expression,t,i),Gl(e.proof,o(t),n),o(t);case`Witness`:return r.expressions.forEach(e=>B(e,t,i)),o(t);case`Take`:return o(Vc(Sl(r.bounds,t,i),r.names,r.nameRanges,i));case`Pick`:{let a=Vc(Sl(r.bounds,t,i),r.names,r.nameRanges,i);return B(r.body,a,{...i,labelParams:[...i.labelParams,...Wc(r.bounds),...r.names]}),Gl(e.proof,o(t),n),o(a)}default:return Gl(e.proof,o(t),n),o(t)}},Yl=(e,t)=>{let n=e.name!==void 0&&e.statement.kind!==`AssumeProve`?void 0:Wl(e.statement,void 0,t);e.name!==void 0&&Bc(e.name,{kind:`Theorem`,arity:0,range:e.location.range},t);let r=t.goals.get(e.name??``);r&&(r.isInProof=!0),Gl(e.proof,n,t),r&&(r.isInProof=!1)},Xl={line:0,column:0},Zl=(e,t)=>[...e.theorems,...e.assumptions].some(e=>e.name===t.name&&e.location.line===t.location.line&&e.location.column===t.location.column),Ql=(e,t)=>{let n=new Map([...kc,...t]);return e.constants.forEach(e=>n.set(e.name,{key:e.name,arity:e.arity,kind:`Constant`})),e.variables.forEach(e=>n.set(e.name,{key:e.name,arity:0,kind:`Variable`})),n},$l=(e,t,n,r,i)=>{let a=e.params.reduce((e,t)=>({name:t.name,arity:t.arity,kind:`Parameter`,parent:e}),r),o=(e,t)=>i.errors.push({location:t,message:`An operator must be substituted for symbol '${cc(e.name)}', and it must have arity ${e.arity}.`}),s=(e,t)=>{let n=t.location.range;if(e.arity===0){Al(t,a,i);return}if(t.kind===`Lambda`){Fl(t,a,i),t.params.length!==e.arity&&n&&o(e,g(n));return}if(t.kind===`OperatorReference`){let r=xl(t,t.operator,a,i);r===void 0?o(e,$c):r!==e.arity&&n&&o(e,g(n));return}if(t.kind!==`Identifier`){n&&i.errors.push({location:g(n),message:`Arity ${e.arity} operator (not an expression) is expected \nto substitute for CONSTANT '${cc(e.name)}'.`}),o(e,$c);return}let r=xl(t,t.name,a,i);r!==void 0&&r!==e.arity&&i.errors.push({location:g(Zc(t,t.name)),message:`Expected arity ${e.arity} but found operator of arity ${r}.`}),r!==e.arity&&o(e,$c)},c=e.location.range,l=t.filter(e=>Fc(a,e.name)!==void 0||Kc(e.name,i)!==void 0).map(t=>({declaration:t,expression:{kind:`Identifier`,name:t.name,location:e.location}}));l.filter(e=>e.declaration.arity===0).forEach(e=>{let t=xl(e.expression,e.declaration.name,a,i);t&&c&&i.errors.push({location:g(c),message:`Wrong number of arguments (0) given to operator '${cc(e.declaration.name)}', \nwhich requires ${t} arguments.`})});let u=/* @__PURE__ */ new Map;return e.substitutions.forEach(e=>{let n=e.name,r=t.find(e=>e.name===n);if(!r){i.errors.push({location:g(e.nameRange),message:`Identifier '${n}' is not a legal target of a substitution. \nA legal target must be a declared CONSTANT or VARIABLE in the module being instantiated. \n(Also, check for warnings about multiple declarations of this same identifier.)`});return}let a=e.expression;s(r,a);let o=a.location.range;u.has(n)?o&&i.errors.push({location:g(o),message:`Multiple substitutions for symbol '${n}' in substitution.`}):u.set(n,a)}),l.filter(e=>!u.has(e.declaration.name)).forEach(e=>{(e.declaration.arity===0?0:xl(e.expression,e.declaration.name,a,i))!==e.declaration.arity&&c&&o(e.declaration,g(c)),u.set(e.declaration.name,e.expression)}),t.filter(e=>!u.has(e.name)).forEach(e=>{let t=e.location.range;c&&t&&i.errors.push({location:g(c),message:`Substitution missing for symbol ${cc(e.name)} declared at ${g(t)} \nand instantiated in module ${n}.`})}),u},eu=(e,t,n)=>{let r=n.getInstance(e);return $l(e,r.declarations,r.instancer,t,n),[...r.symbols].reduce((e,t)=>zc(e,t[0],t[1],n),t)},tu=(e,t,n,r)=>{let i=Ql(n,r.imported),a=new Map([...n.constants,...n.variables].map(e=>[e.name,e.location])),o={location:e.location,errors:[],warnings:[]};return r.reports.push(o),$l(e,t,n.name,void 0,{imported:i,getInstance:r.getInstance,definitions:r.definitions,getKey:r.getKey,location:e.location,self:void 0,facts:/* @__PURE__ */ new Set,goals:/* @__PURE__ */ new Map,bindings:new Map([...i].map(e=>[e[0],{...e[1],position:a.get(e[0])??Xl}])),errors:o.errors,warnings:o.warnings,hasLabelScope:!1,isLabelForbidden:!1,isInExcept:!1,labelParams:[],labels:/* @__PURE__ */ new Set,isGenerated:!1})},nu=(e,t)=>{let n=[],r=(e,t)=>{e.every(e=>e.location!==t.location||e.message!==t.message)&&e.push(t)};return e.toSorted((e,t)=>jc(e.location,t.location)).forEach(e=>{let i=[],a=[];try{e.check(i,a)}catch(e){if(!(e instanceof s)||!e.sany&&i.length===0)throw e;i.push(...e.sany?.errors??[])}i.forEach(e=>r(n,e)),a.forEach(e=>r(t,e))}),n},ru=(e,t)=>{let n=Ql(e,t.imported),r=new Map(e.theorems.flatMap(e=>e.name!==void 0&&e.statement.kind===`AssumeProve`?[[e.name,{statement:e.statement,isSuffices:!1,isInProof:!1,keyword:void 0}]]:[])),i=new Map([...kc,...t.bound].map(e=>[e[0],{...e[1],position:Xl}])),a=/* @__PURE__ */ new Set,o=[],s=(e,a,o,s)=>({location:e,check:(c,l)=>s({imported:n,getInstance:t.getInstance,definitions:t.definitions,getKey:t.getKey,location:e,self:a,facts:t.facts,goals:r,bindings:i,errors:c,warnings:l,hasLabelScope:o,isLabelForbidden:!1,isInExcept:!1,labelParams:[],labels:/* @__PURE__ */ new Set,isGenerated:!1})}),c=(e,t)=>e.map(e=>s(e.location,void 0,!1,n=>Bc(e.name,{kind:t,arity:e.arity,range:e.location.range},n)));return nu([...e.units.flatMap(e=>{let t=e.kind===`Variables`?{type:`A VARIABLE declaration`,location:e.location}:e.kind===`Constants`?{type:`A declaration`,location:e.location}:e.kind===`Module`?{type:`A MODULE `,location:e.module.location}:e.kind===`Theorem`?{type:`A THEOREM`,location:e.theorem.location}:e.kind===`Assumption`?{type:`An ASSUME`,location:e.assumption.location}:e.kind===`Use`?{type:`A USE or HIDE`,location:e.use.location}:void 0,n=t?.location.range;return!t||!n?[]:[{location:t.location,check:e=>{o.some(e=>e.binding?.isPending)&&e.push({location:g(n),message:`${t.type} may not appear within a recursive definition section.`})}}]}),...t.reports.map(e=>({location:e.location,check:(t,n)=>{t.push(...e.errors),n.push(...e.warnings)}})),...c(e.constants,`Constant`),...c(e.variables,`Variable`),...e.units.flatMap(e=>e.kind===`Recursive`?e.declarations:[]).map(e=>s(e.location,void 0,!1,t=>{let n={kind:`Definition`,arity:e.arity,params:Array(e.arity).fill(0),range:e.location.range,position:e.location,isPending:!0},r=Rc(e.name,i.get(e.name),n,t);r&&(i.set(e.name,n),a.add(n)),o.push({declaration:e,binding:r?n:void 0})})),...e.definitions.map(t=>s(t.location,t,!0,n=>{Zl(e,t)?B(t.body,void 0,n):Tl(t,void 0,n,a)&&i.set(t.name,{kind:`Definition`,arity:Mc(t),range:t.location.range,position:t.location})})),...e.instances.map(e=>s(e.location,void 0,!1,n=>{Hc(void 0,e.params,n),t.instanced.get(e)?.forEach((e,t)=>Bc(t,e,n)),e.name!==void 0&&Bc(e.name,{kind:`Instance`,arity:e.params.length,range:e.location.range},n)})),...e.assumptions.map(e=>s(e.location,void 0,e.name!==void 0,t=>{B(e.expression,void 0,t),e.name!==void 0&&Bc(e.name,{kind:`Theorem`,arity:0,range:e.location.range},t)})),...e.theorems.map(e=>s(e.location,void 0,e.name!==void 0,t=>Yl(e,t))),...e.uses.map(e=>s(e.location,void 0,!1,t=>Vl(e,void 0,t))),{location:e.location.range?.end??e.location,check:e=>o.forEach(t=>{let n=t.declaration.location.range;n&&(!t.binding||t.binding.isPending)&&e.push({location:g(n),message:`Symbol ${cc(t.declaration.name)} declared in RECURSIVE statement but not defined.`})})}],t.warnings)},iu=/* @__PURE__ */ new WeakSet,au=/* @__PURE__ */ new WeakMap,ou=(e,t)=>{if(t.length===0)return e;let n={...e};return iu.has(e)&&iu.add(n),au.set(n,[...t,...au.get(e)??[]]),n},su=(e,t,n=/* @__PURE__ */ new Set)=>{let r=pu(e,(e,r)=>su(e,t,r.length===0?n:/* @__PURE__ */ new Set([...n,...r])));return r.kind===`Identifier`&&M(r)&&!n.has(r.name)?{...r,name:t.get(r.name)??r.name}:r.kind===`Apply`&&M(r)&&!n.has(r.operator)||r.kind===`OperatorReference`&&!n.has(r.operator)?{...r,operator:t.get(r.operator)??r.operator}:r},cu=(e,t)=>e.map(e=>({pattern:e.pattern,set:t(e.set)})),lu=/* @__PURE__ */ new WeakMap,uu=e=>lu.get(e)??e.name,du=(e,t)=>(uu(t)!==e.name&&lu.set(e,uu(t)),e),fu=(e,t)=>du(e.kind===`Function`?{...e,bounds:cu(e.bounds,e=>t(e,[])),body:t(e.body,Wc(e.bounds))}:{...e,body:t(e.body,e.params.map(e=>e.name))},e),pu=(e,t)=>{let n=e=>t(e,[]);switch(e.kind){case`Number`:case`Decimal`:case`String`:case`Identifier`:case`OperatorReference`:case`ExceptAt`:return e;case`Apply`:return{...e,args:e.args.map(n)};case`Lambda`:return{...e,body:t(e.body,e.params)};case`And`:case`Or`:return{...e,operands:e.operands.map(n)};case`Prime`:case`Unchanged`:case`Enabled`:case`Always`:case`Eventually`:return{...e,expression:n(e.expression)};case`If`:return{...e,condition:n(e.condition),consequent:n(e.consequent),alternative:n(e.alternative)};case`Case`:return{...e,arms:e.arms.map(e=>({condition:n(e.condition),body:n(e.body)})),other:e.other?n(e.other):void 0};case`Let`:{let n=e.definitions.map(e=>e.name);return{...e,definitions:e.definitions.map(e=>fu(e,(e,r)=>t(e,[...n,...r]))),body:t(e.body,n)}}case`Forall`:case`Exists`:case`FunctionConstruction`:return{...e,bounds:cu(e.bounds,n),body:t(e.body,Wc(e.bounds))};case`UnboundedQuantifier`:return{...e,body:t(e.body,e.names)};case`Choose`:return{...e,set:e.set?n(e.set):void 0,body:t(e.body,Uc(e.pattern))};case`SetEnumeration`:case`Tuple`:return{...e,elements:e.elements.map(n)};case`SetFilter`:return{...e,bound:{pattern:e.bound.pattern,set:n(e.bound.set)},predicate:t(e.predicate,Uc(e.bound.pattern))};case`SetMap`:return{...e,bounds:cu(e.bounds,n),expression:t(e.expression,Wc(e.bounds))};case`FunctionSet`:return{...e,domain:n(e.domain),range:n(e.range)};case`Record`:case`RecordSet`:return{...e,fields:e.fields.map(e=>({...e,value:n(e.value)}))};case`Except`:return{...e,function:n(e.function),updates:e.updates.map(e=>({path:e.path.map(e=>e.kind===`Index`?{kind:`Index`,args:e.args.map(n)}:e),value:n(e.value)}))};case`FunctionApplication`:return{...e,function:n(e.function),args:e.args.map(n)};case`Bracket`:return{...e,args:e.args.map(n)};case`FieldAccess`:return{...e,record:n(e.record)};case`Product`:return{...e,factors:e.factors.map(n)};case`BoxAction`:case`AngleAction`:return{...e,action:n(e.action),subscript:n(e.subscript)};case`WeakFairness`:case`StrongFairness`:return{...e,subscript:n(e.subscript),action:n(e.action)};case`Label`:return{...e,body:n(e.body)};case`Subexpression`:return{...e,selectors:e.selectors.map(e=>`args`in e?{...e,args:e.args.map(n)}:e)}}},mu=(e,t)=>{pu(e,(e,n)=>(t(e,n),e))},hu=`LAMBDA`,gu=e=>`${e}@SUBSTITUTION`,_u=e=>e.kind===`Identifier`||e.kind===`Tuple`&&e.elements.every(_u),vu=(e,t)=>{if(e.kind!==`Identifier`)return!_u(e)&&e.kind!==`OperatorReference`&&e.kind!==`Lambda`&&e.kind!==`Number`&&e.kind!==`String`;let n=M(e)?void 0:t.getOuterDefinition(e.name);return n?.kind===`Operator`&&n.params.length===0&&!_u(n.body)},yu=(e,t=/* @__PURE__ */ new Set)=>{let n=ht(e),r=n===void 0||t.has(n)?[]:[n];return mu(e,(e,n)=>r.push(...yu(e,n.length===0?t:/* @__PURE__ */ new Set([...t,...n])))),r},bu=e=>{let t=/* @__PURE__ */ new Map;return n=>{if(!e.substitutedNames.has(n))return n;let r=t.get(n)??e.instantiation.createName(n);return t.set(n,r),r}},xu=(e,t,n)=>new Map([...e,...t.map(e=>[e,n(e)])]),Su=(e,t)=>e.kind===`Name`?{kind:`Name`,name:t(e.name)}:{kind:`Tuple`,names:e.names.map(t)},Cu=(e,t)=>e.map(e=>({pattern:Su(e.pattern,t),set:e.set})),wu=(e,t)=>e.kind===`Function`?{...e,bounds:Cu(e.bounds,t)}:{...e,params:e.params.map(e=>({name:t(e.name),arity:e.arity}))},Tu=(e,t,n)=>{let r=e=>t.get(e)??e;switch(e.kind){case`Identifier`:return{...e,name:r(e.name)};case`Apply`:case`OperatorReference`:return{...e,operator:r(e.operator)};case`Label`:return{...e,params:e.params.map(r)};case`Lambda`:return{...e,params:e.params.map(n)};case`Let`:return{...e,definitions:e.definitions.map(e=>du({...wu(e,n),name:n(e.name)},e))};case`Forall`:case`Exists`:case`FunctionConstruction`:case`SetMap`:return{...e,bounds:Cu(e.bounds,n)};case`UnboundedQuantifier`:return{...e,names:e.names.map(n)};case`Choose`:return{...e,pattern:Su(e.pattern,n)};case`SetFilter`:return{...e,bound:{pattern:Su(e.bound.pattern,n),set:e.bound.set}};default:return e}},Eu=e=>`${e}@ENABLED`,Du=(e,t)=>e.modes.get(t)??e,Ou=(e,t,n)=>e.kind===`Identifier`&&!n.has(e.name)&&!M(e)&&t.instantiation.variables.has(e.name),ku=(e,t,n)=>{if(e.kind===`Tuple`){let r=e.elements.map(e=>ku(e,t,n));return r.every(e=>e!==void 0)?r.flat():void 0}if(e.kind!==`Identifier`)return;if(Ou(e,t,n))return[e.name];let r=M(e)?void 0:t.instantiation.getDefinition(e.name);return r?.kind===`Operator`&&r.params.length===0?ku(r.body,t,/* @__PURE__ */ new Map):void 0},Au=(e,t,n)=>{if(t.mode===`Normal`)return;if(t.mode===`Primed`)return Ou(e,t,n)&&e.kind===`Identifier`?{kind:`Identifier`,name:Eu(e.name),location:e.location}:void 0;if(e.kind===`Prime`)return{...e,expression:Iu(e.expression,Du(t,`Primed`),n)};if(e.kind===`AngleAction`){let r=e.location;return{kind:`And`,operands:[Iu(e.action,t,n),{kind:`Apply`,operator:`#`,args:[{kind:`Prime`,expression:Iu(e.subscript,Du(t,`Primed`),n),location:r},Iu(e.subscript,t,n)],location:r}],location:r}}if(e.kind!==`Unchanged`)return;let r=ku(e.expression,t,n);if(r!==void 0)return{kind:`And`,operands:r.map(r=>({kind:`Apply`,operator:`=`,args:[{kind:`Prime`,expression:{kind:`Identifier`,name:Eu(r),location:e.location},location:e.location},Iu({kind:`Identifier`,name:r,location:e.location},t,n)],location:e.location})),location:e.location}},ju=(e,t)=>({kind:`Identifier`,name:e,location:t,resolution:mc}),Mu=(e,t)=>e.map(e=>ju(e.name,t)),Nu=(e,t,n,r,i)=>({kind:`Operator`,name:e,params:n,body:r.length===0?{kind:`Identifier`,name:t,location:i}:{kind:`Apply`,operator:t,args:Mu(r,i),location:i},isLocal:!0,isRecursive:!1,location:i}),Pu=(e,t,n,r)=>{let i=Array.from({length:n},(e,t)=>`argument${t}`);return{kind:`Lambda`,params:i,body:{kind:`Apply`,operator:e,args:[...Mu(t,r),...i.map(e=>ju(e,r))],location:r},location:r}},Fu=(e,t)=>e.instantiation.isParameterized(t)?Ru(e,t):void 0,Iu=(e,t,n)=>{let r=e=>Iu(e,t,n),i=t.instantiation,a=i.params,o=t=>!n.has(t)&&!M(e);if(e.kind===`Enabled`&&t.mode===`Normal`)return{...e,expression:Iu(e.expression,Du(t,`Enabled`),n)};if((e.kind===`WeakFairness`||e.kind===`StrongFairness`)&&t.mode===`Normal`)return{...e,subscript:r(e.subscript),action:r(e.action),enabled:Iu(e.enabled??{kind:`AngleAction`,action:e.action,subscript:e.subscript,location:e.location},Du(t,`Enabled`),n)};let c=Au(e,t,n);if(c)return c;if(e.kind===`Identifier`&&o(e.name)){let n=i.substitutions.get(e.name),r=t.bindings;if(n&&(r===void 0||!vu(n,i)))return ou(n,[e]);if(n&&r){let t=gu(e.name);return r.set(t,n),ju(t,e.location)}let o=Fu(t,e.name);if(o===void 0)return e;if(a.length===0)return{...e,name:o};let s=i.getDefinition(e.name);return s&&Mc(s)>0?Pu(o,a,Mc(s),e.location):{kind:`Apply`,operator:o,args:Mu(a,e.location),location:e.location}}if(e.kind===`Apply`&&o(e.operator)){let n=e.args.map(r),o=i.substitutions.get(e.operator),c=i.substitutions.size>0||a.length>0||iu.has(e),l=e=>(c&&iu.add(e),e);if(o?.kind===`Identifier`||o?.kind===`OperatorReference`){let t=o.kind===`Identifier`?o.name:o.operator;return l({...e,operator:t,args:n,resolution:o.kind===`Identifier`?o.resolution:void 0})}if(o?.kind===`Apply`)return l({...e,operator:o.operator,args:[...o.args,...n],resolution:o.resolution});if(o?.kind===`Lambda`)return{kind:`Let`,definitions:[{kind:`Operator`,name:hu,params:o.params.map(e=>({name:e,arity:0})),body:o.body,isLocal:!0,isRecursive:!1,location:o.location}],body:{...e,operator:hu,args:n,resolution:mc},location:e.location};if(o)throw new s(`The operator ${e.operator} can only be substituted by an operator at line ${e.location.line}, column ${e.location.column}`);let u=Fu(t,e.operator);return u===void 0?l({...e,args:n}):{...e,operator:u,args:[...Mu(a,e.location),...n]}}if(e.kind===`OperatorReference`&&o(e.operator)){let n=i.substitutions.get(e.operator);if(n?.kind===`Identifier`||n?.kind===`OperatorReference`||n?.kind===`Lambda`)return ou(n,[e]);let r=Fu(t,e.operator);if(r===void 0)return e;let o=i.getDefinition(e.operator);return a.length>0&&o?Pu(r,a,Mc(o),e.location):{...e,operator:r}}let l=bu(t),u=pu(e,(e,i)=>i.length===0?r(e):Iu(e,t,xu(n,i,l)));return Tu(u,n,l)},Lu=(e,t,n)=>t.length===0?e:e.kind===`Operator`?{...e,params:[...t,...e.params]}:{kind:`Operator`,name:e.name,params:t,body:{kind:`Let`,definitions:[e],body:ju(e.name,n),location:n},isLocal:e.isLocal,isRecursive:!1,location:e.location},Ru=(e,t)=>{let n=e.copies.get(t);if(n!==void 0)return n;let r=e.instantiation,i=r.getDefinition(t);return i?r.addDefinition(t,i.name,n=>{e.copies.set(t,n);let a=bu(e),o=/* @__PURE__ */ new Map,s=i.kind===`Operator`&&e.mode===`Normal`?{...e,bindings:o}:e,c=wu(fu(i,(e,t)=>Iu(e,s,xu(/* @__PURE__ */ new Map,t,a))),a),l=c.kind!==`Operator`||o.size===0?c.body:{kind:`Let`,definitions:[...o].map(e=>({kind:`Operator`,name:e[0],params:[],body:e[1],isLocal:!0,isRecursive:!1,location:e[1].location})),body:c.body,location:{line:c.body.location.line,column:c.body.location.column}},u=r.frame;return u&&au.set(l,[u,...au.get(i.body)??[]]),Lu({...c,body:l},r.params,i.location)}):t},zu=e=>{let t=/* @__PURE__ */ new Map,n=new Set([...e.substitutions.values()].flatMap(e=>yu(e))),r=r=>{let i={instantiation:e,substitutedNames:n,copies:/* @__PURE__ */ new Map,mode:r,modes:t};return t.set(r,i),i},i=r(`Normal`);return r(`Enabled`),r(`Primed`),{getKey:e=>Fu(i,e)??e,getQualifiedKey:t=>{let n=Fu(i,t);if(n!==void 0)return n;let r=e.getDefinition(t);return r?e.addDefinition(t,r.name,()=>Lu(r,e.params,r.location)):t}}},Bu=e=>e.kind===`Let`&&e.instances!==void 0||mt(e).some(Bu),Vu=(e,t,n)=>{let r=e.kind===`Let`?[...n,...e.definitions]:n,i=pu(e,e=>Vu(e,t,r));if(i.kind!==`Let`||!i.instances)return i;let a=i.instances.reduce((e,n)=>{let i=e.findIndex(e=>Ac(n.location,e.location)),a=i===-1?e.length:i;return[...e.slice(0,a),...t(n,r),...e.slice(a)]},i.definitions);return{...i,definitions:a}},Hu=e=>e.name===void 0&&e.statement.kind!==`AssumeProve`?e.statement:void 0,Uu=(e,t)=>e.definitions.some(e=>Bu(e.body))||e.assumptions.some(e=>Bu(e.expression))||e.theorems.some(e=>{let t=Hu(e);return t!==void 0&&Bu(t)})?{...e,definitions:e.definitions.map(e=>fu(e,e=>Vu(e,t,[]))),assumptions:e.assumptions.map(e=>({...e,expression:Vu(e.expression,t,[])})),theorems:e.theorems.map(e=>{let n=Hu(e);return n===void 0?e:{...e,statement:Vu(n,t,[])}})}:e,Wu=new Map([[`Nat`,0,[],[],[]],[`+`,0,[0,0],[2,2],[1,1]],[`-`,0,[0,0],[2,2],[1,1]],[`*`,0,[0,0],[3,3],[0,0]],[`^`,0,[0,0],[2,2],[1,1]],[`<`,0,[0,0],[2,2],[1,1]],[`>`,0,[0,0],[2,2],[1,1]],[`<=`,0,[0,0],[2,2],[1,1]],[`>=`,0,[0,0],[2,2],[1,1]],[`%`,0,[0,0],[2,2],[1,1]],[`\\div`,0,[0,0],[2,2],[1,1]],[`..`,0,[0,0],[2,2],[1,1]],[`Int`,0,[],[],[]],[`-.`,0,[0],[2],[1]],[`Seq`,0,[0],[2],[1]],[`Len`,0,[0],[2],[1]],[`\\o`,0,[0,0],[2,2],[1,1]],[`Append`,0,[0,0],[2,2],[1,1]],[`Head`,0,[0],[2],[1]],[`Tail`,0,[0],[2],[1]],[`SubSeq`,0,[0,0,0],[2,2,2],[1,1,1]],[`SelectSeq`,0,[0,1],[2,2],[1,1],[],[`1,0,0`]],[`IsFiniteSet`,0,[0],[2],[1]],[`Cardinality`,0,[0],[2],[1]],[`IsABag`,0,[0],[2],[1]],[`BagToSet`,0,[0],[2],[1]],[`SetToBag`,0,[0],[3],[1]],[`BagIn`,0,[0,0],[2,2],[1,1]],[`EmptyBag`,0,[],[],[]],[`\\oplus`,0,[0,0],[2,2],[1,1]],[`\\ominus`,0,[0,0],[2,2],[1,1]],[`BagUnion`,0,[0],[2],[1]],[`\\sqsubseteq`,0,[0,0],[2,2],[1,1]],[`SubBag`,0,[0],[2],[1]],[`BagOfAll`,0,[1,0],[2,2],[1,1]],[`BagCardinality`,0,[0],[2],[1]],[`CopiesIn`,0,[0,0],[2,2],[1,1]],[`Print`,0,[0,0],[3,3],[0,1]],[`PrintT`,0,[0],[3],[0]],[`Assert`,0,[0,0],[2,3],[1,0]],[`JavaTime`,0,[],[],[]],[`TLCGet`,0,[0],[3],[0]],[`TLCSet`,0,[0,0],[3,3],[0,0]],[`:>`,0,[0,0],[2,3],[1,1]],[`@@`,0,[0,0],[2,2],[1,1]],[`Permutations`,0,[0],[2],[1]],[`SortSeq`,0,[0,2],[2,2],[1,1],[],[`1,0,0`,`1,0,1`]],[`RandomElement`,0,[0],[3],[1]],[`Any`,0,[],[],[]],[`ToString`,0,[0],[2],[1]],[`TLCEval`,0,[0],[3],[1]],[`AssertEq`,0,[0,0],[2,2],[1,1]],[`AssertError`,0,[0,0],[2,3],[1,0]],[`TLCGetOrDefault`,0,[0,0],[3,3],[0,0]],[`TLCGetAndSet`,0,[0,2,0,0],[3,3,3,3],[0,0,0,0],[],[`1,2,1`]],[`Trace`,0,[],[],[]],[`CounterExample`,0,[],[],[]],[`ToTrace`,0,[0],[3],[0]],[`TLCModelValue`,0,[0],[2],[1]],[`TLCDefer`,0,[0],[3],[0]],[`TLCNoOp`,0,[0],[3],[1]],[`PickSuccessor`,0,[0],[3],[1]],[`TLCCache`,0,[0,0],[3,3],[1,0]],[`TLCFP`,0,[0],[3],[0]],[`TLCEvalDefinition`,0,[0],[3],[0]],[`ToJson`,0,[0],[2],[1]],[`ToJsonArray`,0,[0],[2],[1]],[`ToJsonObject`,0,[0],[2],[1]],[`JsonSerialize`,0,[0,0],[3,3],[0,0]],[`JsonDeserialize`,0,[0],[3],[0]],[`ndJsonSerialize`,0,[0,0],[3,3],[0,0]],[`ndJsonDeserialize`,0,[0],[3],[0]],[`RandomSubset`,0,[0,0],[2,2],[1,1]],[`RandomSetOfSubsets`,0,[0,0,0],[2,3,2],[1,0,1]],[`TestRandomSetOfSubsets`,0,[0,0,0],[2,3,2],[1,0,1]],[`_Track`,0,[0,0],[3,2],[0,0]],[`_Counts`,0,[],[],[]],[`_CheckName`,0,[0],[2],[1]],[`_PrintCounts`,0,[],[],[]]].map(e=>[e[0],{name:e[0],level:e[1],params:/* @__PURE__ */ new Set,constraints:/* @__PURE__ */ new Map,argConstraints:/* @__PURE__ */ new Map,argParams:/* @__PURE__ */ new Set,formals:e[2].map((e,t)=>({name:`$${t}`,arity:e})),maxLevels:e[3],weights:e[4],minMaxLevels:e[5]??[],conditions:new Set(e[6]),nonLeibniz:/* @__PURE__ */ new Set}])),Gu={Naturals:{Nat:[14,1,14,16],"+":[15,1,15,19],"-":[17,1,17,33],"*":[18,1,18,17],"^":[19,1,19,19],"<":[20,1,20,19],">":[21,1,21,19],"<=":[22,1,22,19],">=":[23,1,23,19],"%":[33,1,33,20],"\\div":[34,1,34,20],"..":[35,1,35,20]},Integers:{Int:[18,1,18,12],"-.":[22,1,22,13]},Sequences:{Seq:[20,1,20,41],Len:[25,1,25,44],"\\o":[30,1,31,76],Append:[36,1,36,26],Head:[41,1,41,15],Tail:[42,1,42,61],SubSeq:[48,1,48,50],SelectSeq:[53,1,65,14]},FiniteSets:{IsFiniteSet:[14,1,19,68],Cardinality:[21,1,27,11]},Bags:{IsABag:[20,1,24,41],BagToSet:[26,1,26,23],SetToBag:[31,1,31,30],BagIn:[36,1,36,31],EmptyBag:[41,1,41,24],"\\oplus":[43,1,49,46],"\\ominus":[51,1,60,50],BagUnion:[74,1,79,58],"\\sqsubseteq":[81,1,87,42],SubBag:[89,1,110,11],BagOfAll:[122,1,130,66],BagCardinality:[132,1,138,8],CopiesIn:[140,1,145,33]},TLC:{Print:[17,1,17,22],PrintT:[18,1,18,19],Assert:[24,1,25,54],JavaTime:[26,1,26,32],TLCGet:[75,1,75,28],TLCSet:[76,1,76,20],":>":[78,1,78,27],"@@":[79,1,80,50],Permutations:[81,1,82,54],SortSeq:[88,1,92,40],RandomElement:[110,1,110,41],Any:[119,1,119,22],ToString:[121,1,121,58],TLCEval:[145,1,145,15]},TLCExt:{AssertEq:[14,1,20,14],AssertError:[23,1,26,72],TLCGetOrDefault:[30,1,31,17],TLCGetAndSet:[33,1,35,57],Trace:[41,1,57,6],CounterExample:[61,1,75,8],ToTrace:[77,1,87,12],TLCModelValue:[91,1,120,29],TLCDefer:[122,1,134,6],TLCNoOp:[138,1,145,5],PickSuccessor:[148,1,162,37],TLCCache:[166,1,173,12],TLCFP:[175,1,181,24],TLCEvalDefinition:[185,1,190,6]},Randomization:{RandomSubset:[30,1,30,64],RandomSetOfSubsets:[48,1,49,67],TestRandomSetOfSubsets:[61,1,62,71]},Json:{ToJson:[46,1,55,37],ToJsonArray:[57,1,64,42],ToJsonObject:[66,1,73,43],JsonSerialize:[75,1,80,6],JsonDeserialize:[82,1,87,19],ndJsonSerialize:[89,1,95,6],ndJsonDeserialize:[97,1,103,19]},_Possible:{_Track:[10,1,17,38],_Counts:[24,1,30,14],_CheckName:[32,1,35,35],_PrintCounts:[37,1,37,31]}},Ku=(e,t)=>{let n=Gu[e]?.[t];return n&&{module:e,start:{line:n[0],column:n[1]},end:{line:n[2],column:n[3]}}},qu=(e,t)=>`${e}${t}`,Ju=(e,t,n)=>`${e}${t}${n}`,Yu=e=>{let t=e.split(`\0`);return{operator:t[0],index:Number(t[1]),param:t[2]}},Xu=(e,t,n)=>`${e},${t},${n}`,Zu=(e=0)=>({level:e,params:/* @__PURE__ */ new Set,constraints:/* @__PURE__ */ new Map,argConstraints:/* @__PURE__ */ new Map,argParams:/* @__PURE__ */ new Set}),Qu=(e,t,n)=>e.set(t,Math.min(n,e.get(t)??3)),$u=(e,t,n)=>e.set(t,Math.max(n,e.get(t)??0)),ed=(e,t)=>{t.constraints.forEach((t,n)=>Qu(e.constraints,n,t)),t.argConstraints.forEach((t,n)=>$u(e.argConstraints,n,t)),t.argParams.forEach(t=>e.argParams.add(t))},V=(e,t,n,r)=>({...Zu(t),name:e,formals:[],maxLevels:n,weights:r,minMaxLevels:[],conditions:/* @__PURE__ */ new Set,nonLeibniz:/* @__PURE__ */ new Set}),td=(e,t)=>e.formals.length===0&&e.maxLevels.length>0?e.maxLevels[Math.min(t,e.maxLevels.length-1)]:e.maxLevels[t]??3,nd=(e,t)=>e.formals.length===0&&e.weights.length>0?e.weights[Math.min(t,e.weights.length-1)]:e.weights[t]??1,rd=new Map([[`=`,0,[2,2],[1,1]],[`#`,0,[2,2],[1,1]],[`\\in`,0,[2,2],[1,1]],[`\\notin`,0,[2,2],[1,1]],[`\\subseteq`,0,[2,2],[1,1]],[`\\cup`,0,[2,2],[1,1]],[`\\cap`,0,[2,2],[1,1]],[`\\`,0,[2,2],[1,1]],[`=>`,0,[3,3],[1,1]],[`<=>`,0,[3,3],[1,1]],[`/\\`,0,[3,3],[1,1]],[`\\/`,0,[3,3],[1,1]],[`~`,0,[3],[1]],[`SUBSET`,0,[2],[1]],[`UNION`,0,[2],[1]],[`DOMAIN`,0,[2],[1]],[`~>`,3,[3,3],[0,0]],[`-+->`,3,[3,3],[0,0]],[`\\cdot`,2,[2,2],[0,0]],[`TRUE`,0,[],[]],[`FALSE`,0,[],[]],[`BOOLEAN`,0,[],[]],[`STRING`,0,[],[]]].map(e=>[e[0],{...V(e[0],e[1],[...e[2]],[...e[3]]),nonLeibniz:new Set(e[1]>1?[0,1]:[])}])),id=V(`'`,2,[1],[0]),ad=V(`UNCHANGED`,2,[1],[0]),od=V(`ENABLED`,1,[2],[0]),sd=V(`[]`,3,[3],[0]),cd=V(`<>`,3,[3],[0]),ld=V(`$ConjList`,0,[3],[1]),ud=V(`$DisjList`,0,[3],[1]),dd=V(`$IfThenElse`,0,[3],[1]),fd=V(`$Case`,0,[3],[1]),pd=V(`$BoundedForall`,0,[3],[1]),md=V(`$BoundedExists`,0,[3],[1]),hd=V(`$UnboundedForall`,0,[3],[1]),gd=V(`$UnboundedExists`,0,[3],[1]),_d=V(`$TemporalForall`,3,[3],[0]),vd=V(`$TemporalExists`,3,[3],[0]),yd=V(`$BoundedChoose`,0,[2],[1]),bd=V(`$UnboundedChoose`,0,[2],[1]),xd=V(`$SetEnumerate`,0,[2],[1]),Sd=V(`$Tuple`,0,[2],[1]),Cd=V(`$SetOfFcns`,0,[2],[1]),wd=V(`$CartesianProd`,0,[2],[1]),Td=V(`$SubsetOf`,0,[2],[1]),Ed=V(`$SetOfAll`,0,[2],[1]),Dd=V(`$FcnConstructor`,0,[3],[1]),Od=V(`$RcdConstructor`,0,[3],[1]),kd=V(`$SetOfRcds`,0,[2],[1]),Ad=V(`$Except`,0,[2],[1]),jd=V(`$Pair`,0,[3],[1]),Md=V(`$Seq`,0,[2],[1]),Nd=V(`$FcnApply`,0,[2,2],[1,1]),Pd=V(`$RcdSelect`,0,[2,0],[1,1]),Fd=V(`$SquareAct`,2,[2,1],[0,0]),Id=V(`$AngleAct`,2,[2,1],[0,0]),Ld=V(`$WF`,3,[1,2],[0,0]),Rd=V(`$SF`,3,[1,2],[0,0]),zd=(e,t)=>t.length===0?e:new Map([...e,...t.map(e=>[e.name,{kind:`Formal`,arity:e.arity}])]),Bd=e=>e.map(e=>({name:e,arity:0})),Vd=(e,t)=>t.location.range?h(`${e}.`,t.location.range):new s(`${e} at line ${t.location.line}, column ${t.location.column}`),Hd=/* @__PURE__ */ new Set([`/\\`,`\\/`,`=>`,`<=>`]),Ud=e=>e.kind!==`Let`&&e.kind!==`Label`,Wd=e=>{let t=/* @__PURE__ */ new Map,n=(t,n)=>{let r=n.get(t);if(r?.kind===`Formal`)return{kind:`Declared`,name:t,level:0,arity:r.arity};if(r?.kind===`Let`)return{kind:`Defined`,levels:y(r.definition,r.scope)};if(e.constants.has(t))return{kind:`Declared`,name:t,level:0,arity:0};if(e.variables.has(t))return{kind:`Declared`,name:t,level:1,arity:0};let i=e.getDefinition(t);if(i){let n=y(i,/* @__PURE__ */ new Map),r=e.getQualifiedName?.(t);return{kind:`Defined`,levels:r?{...n,name:r}:n}}let a=rd.get(t)??Wu.get(t);return a?{kind:`Defined`,levels:a}:{kind:`Declared`,name:t,level:0,arity:0}},r=(e,t,n)=>{let r=Zu(Math.max(t,...n.map(e=>e.data.level)));return r.params.add(e),n.forEach((t,n)=>{t.data.params.forEach(t=>{r.params.add(t),r.argParams.add(Ju(e,n,t))}),$u(r.argConstraints,qu(e,n),t.data.level),ed(r,t.data)}),r},i=(e,t,n=[],r=[])=>{let i=e=>r.includes(e);t.forEach((t,n)=>{if(t.kind===`Value`&&t.data.level>td(e,n))throw new s(`Level error in applying operator ${cc(e.name)}:\nThe level of argument ${n+1} exceeds the maximum level allowed by the operator`)});let a=n=>{let r=e.formals.findIndex(e=>e.name===n);return r===-1?void 0:t[r]},o=(t,n,r)=>e.conditions.has(Xu(t,n,r)),c=Zu(Math.max(e.level,...t.filter((t,n)=>nd(e,n)===1).map(e=>e.data.level),...n.map(e=>e.level)));return e.params.forEach(e=>c.params.add(e)),t.forEach((t,n)=>{nd(e,n)===1&&t.data.params.forEach(e=>c.params.add(e))}),n.forEach(e=>e.params.forEach(e=>c.params.add(e))),r.forEach(e=>c.params.delete(e)),e.constraints.forEach((e,t)=>Qu(c.constraints,t,e)),t.forEach(e=>e.data.constraints.forEach((e,t)=>{i(t)||Qu(c.constraints,t,e)})),n.forEach(e=>e.constraints.forEach((e,t)=>Qu(c.constraints,t,e))),t.forEach((t,n)=>t.data.params.forEach(t=>{i(t)||Qu(c.constraints,t,td(e,n))})),t.forEach((e,n)=>{if(e.kind!==`Operator`)return;let r=e.data;t.forEach((e,t)=>r.formals.forEach((i,a)=>{o(n,t,a)&&e.data.params.forEach(e=>Qu(c.constraints,e,td(r,a)))}))}),e.argParams.forEach(e=>{let t=Yu(e),n=a(t.operator);n?.kind===`Operator`&&Qu(c.constraints,t.param,td(n.data,t.index))}),[e.argConstraints,...t.map(e=>e.data.argConstraints),...n.map(e=>e.argConstraints)].forEach(e=>e.forEach((e,t)=>$u(c.argConstraints,t,e))),t.forEach((n,r)=>{if(n.kind!==`Declared`)return;let i=n.declared;Array.from({length:i.arity},(t,n)=>$u(c.argConstraints,qu(i.name,n),e.minMaxLevels[r]?.[n]??0)),t.forEach((e,t)=>Array.from({length:i.arity},(n,a)=>{o(r,t,a)&&$u(c.argConstraints,qu(i.name,a),e.data.level)}))}),e.argParams.forEach(e=>{let t=Yu(e),n=a(t.operator);n&&$u(c.argConstraints,qu(t.operator,t.index),n.data.level)}),t.forEach(e=>e.data.argParams.forEach(e=>{i(Yu(e).param)||c.argParams.add(e)})),n.forEach(e=>e.argParams.forEach(e=>c.argParams.add(e))),e.argParams.forEach(e=>{let t=Yu(e),n=a(t.operator);if(n)n.kind===`Declared`&&c.argParams.add(Ju(n.declared.name,t.index,t.param));else{let n=a(t.param);if(!n){c.argParams.add(e);return}n.data.params.forEach(e=>c.argParams.add(Ju(t.operator,t.index,e)))}}),t.forEach((e,n)=>{if(e.kind!==`Declared`)return;let r=e.declared;t.forEach((e,t)=>Array.from({length:r.arity},(i,a)=>{o(n,t,a)&&e.data.params.forEach(e=>c.argParams.add(Ju(r.name,a,e)))}))}),c},a=(e,t)=>{if(e.kind===`Lambda`)return{kind:`Operator`,data:v(`LAMBDA`,Bd(e.params),e.body,t)};let r=e.kind===`OperatorReference`?e.operator:e.kind===`Identifier`?e.name:void 0;if(r!==void 0){let i=n(r,t);if(i.kind===`Defined`&&(i.levels.formals.length>0||e.kind===`OperatorReference`))return{kind:`Operator`,data:i.levels};if(i.kind===`Declared`&&i.arity>0){let e=Zu();return e.params.add(r),{kind:`Declared`,data:e,declared:{name:r,arity:i.arity}}}if(e.kind===`OperatorReference`)return{kind:`Value`,data:Zu()}}return{kind:`Value`,data:m(e,t)}},o=(e,t)=>e.map(e=>a(e,t)),c=(e,t,n,r=[],a=Wc(r))=>{let c=o(t,zd(n,Bd(a))),l=r.map(e=>m(e.set,n)),u=i(e,c,l,a),d=r[l.findIndex(e=>e.level>2)]?.pattern;if(d){let t=d.ranges?.[0];throw new s(`Level error in applying operator ${e.name}:\nThe level of the range for the bounded variable ${t?g(t):Uc(d)[0]} \nexceeds the maximum level allowed by the operator`)}return u},l=(e,t)=>e.kind===`Declared`?r(e.name,e.level,t):i(e.levels,t),u=(e,t,n)=>{let r=e.map(e=>e.data.level);if(r.includes(2)&&r.includes(3))throw Vd(`${n} has both temporal formula and action as arguments`,t)},d=(e,t)=>{if((e.operator===`~>`||e.operator===`-+->`)&&t.some(e=>e.data.level===2))throw Vd(`Action used where only temporal formula or state predicate allowed`,e);Hd.has(e.operator)&&u(t,e,cc(e.operator))},f=(e,t)=>{let n=e.expression,r=e.kind===`Always`?`BoxAction`:`AngleAction`;if(t===2&&Ud(n)&&n.kind!==r)throw Vd(e.kind===`Always`?`[] followed by action not of form [A]_v`:`<> followed by action not of form <<A>>_v`,e)},p=(e,t)=>{let n=new Map(t);e.definitions.forEach(e=>n.set(e.name,{kind:`Let`,definition:e,scope:n}));let r=m(e.body,n),i={level:r.level,params:new Set(r.params),constraints:new Map(r.constraints),argConstraints:new Map(r.argConstraints),argParams:new Set(r.argParams)};return e.definitions.forEach(e=>ed(i,y(e,n))),i},m=(e,t)=>{try{return h(e,t)}catch(t){throw!(t instanceof s)||t.sany?t:Vd(t.message,e)}},h=(e,t)=>{switch(e.kind){case`Number`:case`Decimal`:case`String`:case`ExceptAt`:return Zu();case`Identifier`:return l(n(e.name,t),[]);case`Apply`:{let r=o(e.args,t);return d(e,r),l(n(e.operator,t),r)}case`OperatorReference`:case`Lambda`:return a(e,t).data;case`And`:case`Or`:{let n=o(e.operands,t),r=e.kind===`And`;return u(n,e,e.isBulleted?`${r?`Conjunction`:`Disjunction`} list`:r?`\\land`:`\\lor`),i(r?ld:ud,n)}case`Prime`:return c(id,[e.expression],t);case`Unchanged`:return c(ad,[e.expression],t);case`Enabled`:return c(od,[e.expression],t);case`Always`:case`Eventually`:{let n=a(e.expression,t);return f(e,n.data.level),i(e.kind===`Always`?sd:cd,[n])}case`If`:return c(dd,[e.condition,e.consequent,e.alternative],t);case`Case`:return c(fd,[...e.arms.flatMap(e=>[e.condition,e.body]),...e.other?[e.other]:[]],t);case`Let`:return p(e,t);case`Forall`:case`Exists`:{let n=c(e.kind===`Forall`?pd:md,[e.body],t,e.bounds),r=n.level===3?e.bounds.find(e=>m(e.set,t).level===2):void 0;if(r)throw Vd(`Action-level bound of quantified temporal formula`,r.set);return n}case`UnboundedQuantifier`:return c(e.isTemporal?e.quantifier===`Forall`?_d:vd:e.quantifier===`Forall`?hd:gd,[e.body],t,[],e.names);case`Choose`:return c(e.set?yd:bd,[e.body],t,e.set?[{pattern:e.pattern,set:e.set}]:[],Uc(e.pattern));case`SetEnumeration`:return c(xd,e.elements,t);case`Tuple`:return c(Sd,e.elements,t);case`FunctionSet`:return c(Cd,[e.domain,e.range],t);case`Product`:return c(wd,e.factors,t);case`SetFilter`:return c(Td,[e.predicate],t,[e.bound]);case`SetMap`:return c(Ed,[e.expression],t,e.bounds);case`FunctionConstruction`:return c(Dd,[e.body],t,e.bounds);case`Record`:return c(Od,e.fields.map(e=>e.value),t);case`RecordSet`:return c(kd,e.fields.map(e=>e.value),t);case`Except`:return i(Ad,[a(e.function,t),...e.updates.map(e=>({kind:`Value`,data:i(jd,[{kind:`Value`,data:i(Md,e.path.map(e=>e.kind===`Field`?{kind:`Value`,data:Zu()}:e.args.length===1?a(e.args[0],t):{kind:`Value`,data:c(Sd,e.args,t)}))},a(e.value,t)])}))]);case`FunctionApplication`:return i(Nd,[a(e.function,t),e.args.length===1?a(e.args[0],t):{kind:`Value`,data:c(Sd,e.args,t)}]);case`Bracket`:return Zu();case`FieldAccess`:return i(Pd,[a(e.record,t),{kind:`Value`,data:Zu()}]);case`BoxAction`:case`AngleAction`:return c(e.kind===`BoxAction`?Fd:Id,[e.action,e.subscript],t);case`WeakFairness`:case`StrongFairness`:return c(e.kind===`WeakFairness`?Ld:Rd,[e.subscript,e.action],t);case`Label`:return m(e.body,t);case`Subexpression`:return Zu()}},_=(e,t,r=!1,i=/* @__PURE__ */ new Set)=>{let a=(e,n=r,a=t)=>_(e,a,n,i),o=(e,o)=>{let s=n(e,t);s.kind===`Declared`?(r&&i.add(e),o.forEach(e=>a(e))):o.forEach((e,t)=>a(e,r||s.levels.nonLeibniz.has(t)))};switch(e.kind){case`Identifier`:return o(e.name,[]),i;case`Apply`:return o(e.operator,e.args),i;case`Lambda`:case`Let`:return i;case`Prime`:case`Unchanged`:case`Enabled`:case`Always`:case`Eventually`:case`BoxAction`:case`AngleAction`:case`WeakFairness`:case`StrongFairness`:return mt(e).forEach(e=>a(e,!0)),i;case`UnboundedQuantifier`:return a(e.body,r||e.isTemporal===!0,zd(t,Bd(e.names))),i;default:return mu(e,(e,n)=>a(e,r,zd(t,Bd(n)))),i}},v=(e,t,n,r)=>{let i=zd(r,t),a=m(n,i),o=e=>t.some(t=>t.name===e),s=_(n,i),c={...Zu(a.level),name:e,formals:t,nonLeibniz:new Set(t.flatMap((e,t)=>s.has(e.name)?[t]:[])),maxLevels:t.map(e=>Math.min(3,a.constraints.get(e.name)??3)),weights:t.map(e=>+!!a.params.has(e.name)),minMaxLevels:t.map(e=>Array.from({length:e.arity},(t,n)=>a.argConstraints.get(qu(e.name,n))??0)),conditions:new Set(t.flatMap((e,n)=>t.flatMap((t,r)=>Array.from({length:e.arity},(e,t)=>t).filter(n=>a.argParams.has(Ju(e.name,n,t.name))).map(e=>Xu(n,r,e)))))};return a.params.forEach(e=>{o(e)||c.params.add(e)}),a.constraints.forEach((e,t)=>{o(t)||c.constraints.set(t,e)}),a.argConstraints.forEach((e,t)=>{o(Yu(t).operator)||c.argConstraints.set(t,e)}),a.argParams.forEach(e=>{let t=Yu(e);o(t.operator)&&o(t.param)||c.argParams.add(e)}),c},y=(e,n)=>{let r=t.get(e);if(r)return r;let i=e.kind===`Operator`?e.params:[];t.set(e,{...Zu(),name:e.name,formals:i,maxLevels:i.map(()=>3),weights:i.map(()=>0),minMaxLevels:i.map(()=>[]),conditions:/* @__PURE__ */ new Set,nonLeibniz:/* @__PURE__ */ new Set});let a=e.kind===`Function`?{kind:`FunctionConstruction`,bounds:e.bounds,body:e.body,location:e.location}:e.body,o=v(e.name,i,a,n);return t.set(e,o),o};return{analyze:m,analyzeDefinition:y,toOperand:a}},Gd=(e,t,n)=>{let r=new Map(t),i=e.assumptions.flatMap(e=>{if(e.kind===`NewSymbol`){let t=e.set&&n.analyze(e.set,r);return r.set(e.name,{kind:`Formal`,arity:e.arity}),t?[t]:[]}return[e.kind===`AssumeProve`?Gd(e,r,n):n.analyze(e,r)]});i.push(n.analyze(e.conclusion,r));let a=Zu(Math.max(...i.map(e=>e.level)));return i.forEach(e=>{e.params.forEach(e=>a.params.add(e)),ed(a,e)}),a},Kd=(e,t,n,r)=>{let i=Wd(t),a=e=>Math.max(0,...e.map(e=>i.analyze(e,/* @__PURE__ */ new Map).level)),o=e=>{let t=e.body;return t.kind===`Have`||t.kind===`Case`?a([t.expression]):t.kind===`Witness`?a(t.expressions):t.kind===`Take`?a(t.bounds.map(e=>e.set)):t.kind===`Pick`?a([t.body,...t.bounds.map(e=>e.set)]):t.kind===`Assert`?t.statement.kind===`AssumeProve`?Gd(t.statement,/* @__PURE__ */ new Map,i).level:a([t.statement]):0},s=e=>e?.kind===`Steps`?e.steps.flatMap(e=>{let t=g(e.statement),n=()=>o(e)===0;return e.body.kind===`Have`||e.body.kind===`Take`||e.body.kind===`Witness`?n()?[]:[{location:t,message:`Non-constant TAKE, WITNESS, or HAVE for temporal goal.`}]:e.body.kind===`Case`?[...n()?[]:[{location:t,message:`Non-constant CASE for temporal goal.`}],...s(e.proof)]:e.body.kind===`Qed`?s(e.proof):[]}):[],l=e=>e?.kind===`Steps`?e.steps.flatMap(e=>{let t=e.body,n=()=>o(e)===3,r=t.kind===`Pick`&&t.bounds.length>0&&n()?t.bounds.filter(e=>a([e.set])!==0).flatMap(e=>e.set.location.range?[{location:g(e.set.location.range),message:`Non-constant bound of temporal PICK.`}]:[]):[];return[...l(e.proof),...r,...e.proof?.kind===`Steps`&&n()?s(e.proof):[]]}):[],u=nu([...e.definitions.filter(e=>!e.name.includes(`!`)).map(e=>({location:e.location,check:()=>i.analyzeDefinition(e,/* @__PURE__ */ new Map)})),...e.assumptions.map(e=>({location:e.location,check:()=>{let t=i.analyze(e.expression,/* @__PURE__ */ new Map).level,n=e.location.range;if(t!==0&&n)throw h(`Level error: assumptions must be level 0 (Constant), \nbut this one has level ${t}.`,n)}})),...e.theorems.map(e=>({location:e.location,check:()=>{let t=e.statement.kind===`AssumeProve`?Gd(e.statement,/* @__PURE__ */ new Map,i):i.analyze(e.statement,/* @__PURE__ */ new Map),n=[...l(e.proof),...t.level===3?s(e.proof):[]];if(n.length>0)throw c(n)}})),...n],r);if(u.length>0)throw c(u,!1,void 0,r)},qd=/* @__PURE__ */ new Set([`Prime`,`Unchanged`,`BoxAction`,`AngleAction`]),Jd=/* @__PURE__ */ new Set([`Always`,`Eventually`,`WeakFairness`,`StrongFairness`]),Yd=/* @__PURE__ */ new Set([...qd,...Jd,`Enabled`]),Xd=/* @__PURE__ */ new Set([`~>`,`-+->`]),Zd=/* @__PURE__ */ new Set([...Xd,`\\cdot`]),Qd=/* @__PURE__ */ new Set([`Print`,`PrintT`,`Assert`,`JavaTime`,`RandomElement`,`TLCGet`,`TLCSet`]),$d=/* @__PURE__ */ new Set([`UNION`,`\\cup`]),ef=/* @__PURE__ */ new Set([`RandomSubset`,`RandomSetOfSubsets`,`TestRandomSetOfSubsets`,`RandomSubsetSet`]),tf=(e,t)=>Qd.has(e)||t.builtins.get(e)?.isStateLevel===!0,nf=(e,t,n)=>{let r=new Uint32Array(n),i=[],a=e=>{let t=e.kind;if(qd.has(t)||t===`Apply`&&e.operator===`\\cdot`)return 96;if(t===`Enabled`)return 32;if(Jd.has(t)||t===`UnboundedQuantifier`&&e.isTemporal===!0||t===`Apply`&&Xd.has(e.operator))return 224},o=(e,n,s)=>{let c=e.kind,l=s?1:513;(Yd.has(c)||c===`UnboundedQuantifier`&&e.isTemporal===!0||c===`Apply`&&Zd.has(e.operator))&&(r[0]|=l),Yd.has(c)&&(r[0]|=16);let u=a(e);n&&u!==void 0&&(r[0]|=u);let d=n&&u===void 0,f=ht(e);if(f!==void 0&&M(e)&&t.variableIndex.has(f)&&(s||(r[0]|=512),d&&(r[0]|=32)),f!==void 0&&!M(e)){let e=t.substitutions.get(f)??f,n=t.definitions.get(e),a=t.constants.has(f),o=t.variableIndex.get(f);if((o!==void 0||t.builtins.get(f)?.isStateLevel||n&&t.variableIndex.has(n.name))&&(r[0]|=l),o!==void 0&&(d&&(r[0]|=32),a||(r[1+(o>>>5)]|=1<<(o&31))),n)i.push({callee:n,isOverridden:a,isLevelCounted:d,isOperatorArgument:s||c===`OperatorReference`||c===`Identifier`&&n.kind===`Operator`&&n.params.length>0});else{tf(e,t)&&(r[0]|=2|(e===`Assert`?0:4)),$d.has(e)&&(r[0]|=8),ef.has(e)&&(r[0]|=256),!a&&tf(e,t)&&(r[0]|=16);let n=t.builtins.get(e);d&&!a&&o===void 0&&n?.isStateLevel&&!n.isLevelConstant&&(r[0]|=n.isActionLevel?96:32)}}mt(e).forEach(e=>o(e,d,s||c===`Lambda`))};return e.forEach(e=>o(e,!0,!1)),{row:r,edges:i}},rf=(e,t,n,r)=>{let i=n.length,a=e.slice(),o=new Int32Array(i).fill(-1),s=new Int32Array(i),c=new Int32Array(i).fill(-1),l=[],u=[],d=0,f=0,p=(e,n)=>{for(let i=0;i<t;i++){let o=a[n*t+i];a[e*t+i]|=i===0?o&r:o}},m=e=>{u.push(e,0),o[e]=s[e]=d++,l.push(e)};for(let e=0;e<i;e++)if(o[e]===-1)for(m(e);u.length>0;){let e=u[u.length-2],t=u[u.length-1],r=n[e];if(t<r.length){u[u.length-1]=t+1;let n=r[t];o[n]===-1?m(n):c[n]===-1&&(s[e]=Math.min(s[e],o[n]));continue}if(u.length-=2,u.length>0){let t=u[u.length-2];s[t]=Math.min(s[t],s[e])}if(s[e]!==o[e])continue;let i=[];for(;;){let t=l.pop()??e;if(c[t]=f,i.push(t),t===e)break}f++;let a=i[0];i.forEach(e=>{e!==a&&p(a,e),n[e].forEach(e=>{c[e]!==c[a]&&p(a,e)})}),i.forEach(e=>{e!==a&&p(e,a)})}return a},af=(e,t)=>e.kind===`Operator`&&e.params.length===0&&!(t&513),of=e=>{let t=[...new Set(e.definitions.values())],n=new Map(t.map((e,t)=>[e,t])),r=1+(e.variables.length+31>>>5),i=new Uint32Array(t.length*r),a=new Uint32Array(t.length*r),o=t.map((t,n)=>{let o=nf(pt(t),e,r);return i.set(o.row,n*r),a[n*r]=o.row[0]&270,o.edges}),s=e=>n.get(e.callee)??-1,c=o.map(e=>new Int32Array(e.filter(e=>!e.isOverridden).map(s))),l=rf(i,r,c,17),u=o.map(e=>new Int32Array(e.filter(e=>!e.isOverridden&&e.isLevelCounted).map(s))),d=rf(i,r,u,224),f=o.map(e=>new Int32Array(e.filter(e=>!e.isOverridden&&!e.isOperatorArgument).map(s))),p=rf(i,r,f,512),m=o.map(e=>new Int32Array(e.map(s).filter(e=>!af(t[e],l[e*r]|p[e*r])))),h=rf(a,r,m,270);return{ids:n,rows:l.map((e,t)=>t%r===0?e&17|p[t]&512|d[t]&224|h[t]&270:e),words:r}},sf=(e,t)=>{let n=t.facts,r=n.ids.get(e);return r===void 0?cf(pt(e),t):n.rows.subarray(r*n.words,(r+1)*n.words)},cf=(e,t)=>{let n=t.facts.words,r=nf(e,t,n),i=r.row;return r.edges.forEach(e=>{let r=sf(e.callee,t);if(!e.isOverridden){i[0]|=r[0]&17,e.isOperatorArgument||(i[0]|=r[0]&512),e.isLevelCounted&&(i[0]|=r[0]&224);for(let e=1;e<n;e++)i[e]|=r[e]}af(e.callee,r[0])||(i[0]|=r[0]&270)}),i},lf=(e,t)=>!(sf(e,t)[0]&513),uf=(e,t)=>!(sf(e,t)[0]&512),df={any:2,repeated:4,streamed:8,replayed:260,varying:258},ff=(e,t,n)=>(cf(e,t)[0]&df[n])!==0,pf=(e,t,n=`any`)=>(sf(e,t)[0]&df[n])!==0,mf=(e,t)=>{let n=sf(e,t)[0]&224;return n===224?3:n===96?2:+(n===32)},hf=e=>{let t=[];for(let n=1;n<e.length;n++)for(let r=e[n];r!==0;r&=r-1)t.push((n-1<<5)+(31-Math.clz32(r&-r)));return t},gf=(e,t)=>{let n=cf([e],t);return n[0]&16?void 0:hf(n)},_f=(e,t)=>!!(cf([e],t)[0]&1),vf=(e,n,r)=>new t(`Applying ${e} to the following value,\nwhich is not ${n}:\n${N(L(r))}`),yf=e=>pn(e)?I(e):void 0,bf=`a function with a finite domain`,xf=(e,t,n)=>{let r=R(e,t,n),i=yf(r);if(!i)throw vf(n,bf,r);return i},Sf=(e,t)=>{let n=R(e,1,t),r=yf(n),i=r&&Ef(r,R(e,0,t));if(!r||i!==void 0&&typeof i!=`number`)throw fs(`second`,t,`bag`,n);return i},Cf=(e,t,n)=>{let r=t[n];if(!r||!Tf(r))throw fs(n===0?`first`:`second`,`(+)`,`bag`,R(e,n,`(+)`));return r},wf=(e,t)=>{if(!dn(e)||!P(e))throw t();return F(e).elements},Tf=e=>e.range.every(e=>typeof e==`number`&&e>0),Ef=(e,t)=>{let n=e.domain.findIndex(e=>Kr(t,e));return n===-1?void 0:e.range[n]},Df=(e,t)=>{if(typeof e==`number`)return e;throw t()},Of=(e,t,n)=>{let r=Df(e,n)+Df(t,n);if(xs(r))throw Ss(`${e}+${t}`);return r},kf=(e,t,n,r,i)=>{let a=Df(e.range[t],r),o=Ef(n,e.domain[t]);if(o===void 0)return a;let s=a-Df(o,i);if(xs(s))throw Ss(`${a}-${o}`);return s},Af=(e,t,n,r,i=e.length)=>{let a=e.slice(0,i).find(e=>Kr(t,e[0]));a?a[1]=Of(a[1],n,r):e.push([t,n])},jf=e=>e.domain.map((t,n)=>[t,e.range[n]]),Mf=or([],[]),Nf=e=>[_s(`EmptyBag`,Mf),z(`IsABag`,1,e=>{let t=yf(R(e,0,`IsABag`));return t!==void 0&&Tf(t)}),z(`BagCardinality`,1,e=>{let t=R(e,0,`BagCardinality`),n=xf(e,0,`BagCardinality`),r=()=>vf(`BagCardinality`,`a bag`,t);return n.range.reduce((e,t)=>{if(typeof t!=`number`||t<=0)throw r();return Of(e,t,r)},0)}),z(`BagIn`,2,e=>{let t=Sf(e,`BagIn`);return t!==void 0&&t>0}),z(`CopiesIn`,2,e=>Sf(e,`CopiesIn`)??0),z(`\\oplus`,2,e=>{let t=[0,1].map(t=>yf(R(e,t,`(+)`))),n=Cf(e,t,0),r=Cf(e,t,1),i=jf(n),a=()=>fs(`second`,`(+)`,`bag`,R(e,1,`(+)`));return r.domain.forEach((e,t)=>Af(i,e,r.range[t],a,n.domain.length)),ti(i)}),z(`\\ominus`,2,e=>{let t=R(e,0,`(-)`),n=R(e,1,`(-)`),r=yf(t),i=yf(n);if(!r)throw fs(`first`,`(-)`,`bag`,t);if(!i)throw fs(`second`,`(-)`,`bag`,n);let a=()=>fs(`first`,`(-)`,`bag`,t),o=()=>fs(`second`,`(-)`,`bag`,n);return ti(r.domain.flatMap((e,t)=>{let n=kf(r,t,i,a,o);return n>0?[[e,n]]:[]}))}),z(`BagUnion`,1,e=>{let n=R(e,0,`BagUnion`),r=wf(n,()=>vf(`BagUnion`,`a finite enumerable set`,n));if(r.length<2)return r[0]??Mf;let i=()=>new t(`Attempted to apply BagUnion to the following set, whose\nelement is not a bag:\n${N(L(n))}`),a=e=>{let t=yf(e);if(!t)throw i();return t},o=jf(a(r[0]));return r.slice(1).forEach(e=>{let t=a(e);t.domain.forEach((e,n)=>Af(o,e,t.range[n],i))}),ti(o)}),z(`\\sqsubseteq`,2,e=>{let t=R(e,0,`\\sqsubseteq`),n=R(e,1,`\\sqsubseteq`),r=yf(t),i=yf(n);if(!r)throw vf(`\\sqsubseteq`,bf,t);if(!i)throw vf(`\\sqsubseteq`,bf,n);let a=()=>vf(`\\sqsubseteq`,`a bag`,t),o=()=>vf(`\\sqsubseteq`,`a bag`,n);return r.domain.every((e,t)=>{let n=Ef(i,e);return Df(r.range[t],a)<=(n===void 0?0:Df(n,o))})}),vs(`BagOfAll`,2,e=>{let t=gs(e,0,`BagOfAll`),n=R(e,1,`BagOfAll`),r=yf(n);if(!r)throw fs(`second`,`BagOfAll`,`function with a finite domain`,n);let i=[],a=()=>fs(`second`,`BagOfAll`,`bag`,n);return r.domain.forEach((e,n)=>Af(i,t.call([e]),r.range[n],a)),ti(i)}),z(`SubBag`,1,t=>{let n=R(t,0,`SubBag`);if(!pn(n))throw new w(`Attempted to apply the operator DOMAIN to a non-function\n(${Os(n)})\nline 106, col 58 to line 106, col 65 of module Bags`);let r=I(n),i=F(Xr(r.range)).elements,a=i.find(e=>typeof e!=`number`);a!==void 0&&e.get(`>=`)?.evaluateBinary?.(i[0],a);let o=r.range.filter(e=>typeof e==`number`);if(o.some(e=>e<1))throw new w(`Attempted to apply a function to ${L(r)}, which is not in its domain`);return Yr(r.domain.reduce((e,t,n)=>e.flatMap(e=>[e,...Array.from({length:o[n]},(n,r)=>[...e,[t,r+1]])]),[[]]).map(e=>or(e.map(e=>e[0]),e.map(e=>e[1]))))}),z(`BagToSet`,1,e=>ha(xf(e,0,`BagToSet`))),z(`SetToBag`,1,e=>{let t=R(e,0,`SetToBag`),n=wf(t,()=>vf(`BagToSet`,bf,t));return or([...n],n.map(()=>1))})],Pf={emptyArray:1,nonemptyArray:2,emptyObject:3,danglingName:4,nonemptyObject:5,emptyDocument:6,nonemptyDocument:7},H={none:0,beginObject:1,endObject:2,beginArray:3,endArray:4,true:5,false:6,null:7,singleQuoted:8,doubleQuoted:9,unquoted:10,singleQuotedName:12,doubleQuotedName:13,unquotedName:14,number:16,eof:17},Ff={none:0,sign:1,digit:2,decimal:3,fractionDigit:4,exponentE:5,exponentSign:6,exponentDigit:7},If=[{lower:`true`,upper:`TRUE`,token:H.true},{lower:`false`,upper:`FALSE`,token:H.false},{lower:`null`,upper:`NULL`,token:H.null}],Lf=/* @__PURE__ */ new Map([[`t`,` `],[`b`,`\b`],[`n`,`
396
396
  `],[`r`,`\r`],[`f`,`\f`]]),Rf=1024,zf=e=>{let t=+!!e.startsWith(``),n=t,r=0,i=t,a=!0,o=H.none,s=0,c=[Pf.emptyDocument],l=[void 0],u=[0],d=()=>`$${c.map((e,t)=>e===Pf.emptyArray||e===Pf.nonemptyArray?`[${u[t]}]`:e===Pf.emptyDocument||e===Pf.nonemptyDocument?``:`.${l[t]??``}`).join(``)}`,f=()=>` at line ${r+1} column ${n-i+1} path ${d()}`,p=e=>new w(`com.google.gson.stream.MalformedJsonException: ${e}${f()}
397
397
  See https://github.com/google/gson/blob/main/Troubleshooting.md#malformed-json`),m=()=>new w(`java.io.EOFException: End of input${f()}`),h=()=>{if(!a)throw p(`Use JsonReader.setStrictness(Strictness.LENIENT) to accept malformed JSON`)},g=e=>`/\\;#=`.includes(e)?(h(),!1):!`{}[]:, \f\r
398
398
  `.includes(e),_=()=>{for(;n<e.length;){let t=e[n++];if(t===`
@@ -401,7 +401,7 @@ See https://github.com/google/gson/blob/main/Troubleshooting.md#malformed-json`)
401
401
  `)r++,i=n;else if(t===`/`){if(n===e.length)return t;h();let r=e[n];if(r!==`*`&&r!==`/`)return t;if(n++,r===`/`)_();else if(v(`*/`))n+=2;else throw p(`Unterminated comment`)}else if(t===`#`)h(),_();else if(t!==` `&&t!==`\r`&&t!==` `)return t}},ee=()=>{let e=y();if(e===void 0)throw m();return e},b=()=>{let t=If.find(t=>e[n]===t.lower[0]||e[n]===t.upper[0]);if(!t)return H.none;let r=t.lower.length;for(let i=0;i<r;i++){let r=e[n+i];if(r!==t.lower[i]&&r!==t.upper[i])return H.none}return n+r<e.length&&g(e[n+r])?H.none:(n+=r,t.token)},x=()=>{let t=Ff.none,r=!1,i=0;for(;n+i<e.length;i++){if(i===Rf)return H.none;let a=e[n+i];if(a===`-`){if(t===Ff.none)t=Ff.sign;else if(t===Ff.exponentE)t=Ff.exponentSign;else return H.none}else if(a===`+`){if(t!==Ff.exponentE)return H.none;t=Ff.exponentSign}else if(a===`e`||a===`E`){if(t!==Ff.digit&&t!==Ff.fractionDigit)return H.none;t=Ff.exponentE}else if(a===`.`){if(t!==Ff.digit)return H.none;t=Ff.decimal}else if(a<`0`||a>`9`){if(g(a))return H.none;break}else if(t===Ff.sign||t===Ff.none)r=a===`0`,t=Ff.digit;else if(t===Ff.digit){if(r)return H.none}else t===Ff.decimal?t=Ff.fractionDigit:(t===Ff.exponentE||t===Ff.exponentSign)&&(t=Ff.exponentDigit)}return i===Rf||t!==Ff.digit&&t!==Ff.fractionDigit&&t!==Ff.exponentDigit?H.none:(s=i,H.number)},te=()=>{let t=c.length-1,r=c[t];if(r===Pf.emptyArray)c[t]=Pf.nonemptyArray;else if(r===Pf.nonemptyArray){let e=ee();if(e===`]`)return H.endArray;if(e===`;`)h();else if(e!==`,`)throw p(`Unterminated array`)}else if(r===Pf.emptyObject||r===Pf.nonemptyObject){if(c[t]=Pf.danglingName,r===Pf.nonemptyObject){let e=ee();if(e===`}`)return H.endObject;if(e===`;`)h();else if(e!==`,`)throw p(`Unterminated object`)}let e=ee();if(e===`"`)return H.doubleQuotedName;if(e===`'`)return h(),H.singleQuotedName;if(e===`}`){if(r!==Pf.nonemptyObject)return H.endObject;throw p(`Expected name`)}if(h(),n--,g(e))return H.unquotedName;throw p(`Expected name`)}else if(r===Pf.danglingName){c[t]=Pf.nonemptyObject;let r=ee();if(r===`=`)h(),e[n]===`>`&&n++;else if(r!==`:`)throw p(`Expected ':'`)}else if(r===Pf.emptyDocument){if(y()===void 0)return H.eof;n--,e.startsWith(`)]}'
402
402
  `,n)&&(n+=5),c[t]=Pf.nonemptyDocument}else if(r===Pf.nonemptyDocument){if(y()===void 0)return H.eof;h(),n--}let i=y();if(i===void 0){if(r===Pf.emptyDocument)return H.eof;throw m()}if(i===`]`&&r===Pf.emptyArray)return H.endArray;if(i===`]`||i===`;`||i===`,`){if(r!==Pf.emptyArray&&r!==Pf.nonemptyArray)throw p(`Unexpected value`);return h(),n--,H.null}if(i===`'`)return h(),H.singleQuoted;if(i===`"`)return H.doubleQuoted;if(i===`[`)return H.beginArray;if(i===`{`)return H.beginObject;n--;let a=b();if(a!==H.none)return a;let o=x();if(o!==H.none)return o;if(!g(e[n]))throw p(`Expected value`);return h(),H.unquoted},S=()=>(o===H.none&&(o=te()),o),ne=()=>{if(n===e.length)throw p(`Unterminated escape sequence`);let t=e[n++];if(t===`u`){if(n+4>e.length)throw p(`Unterminated escape sequence`);let t=e.slice(n,n+4);if(!/^[\da-fA-F]{4}$/.test(t))throw p(`Malformed Unicode escape \\u${t}`);return n+=4,String.fromCharCode(Number.parseInt(t,16))}let a=Lf.get(t);if(a!==void 0)return a;if(t===`
403
403
  `)return r++,i=n,t;if(`'"\\/`.includes(t))return t;throw p(`Invalid escape sequence`)},C=t=>{let a=``,o=n;for(;n<e.length;){let s=e[n++];if(s===t)return a+e.slice(o,n-1);s===`\\`?(a+=e.slice(o,n-1)+ne(),o=n):s===`
404
- `&&(r++,i=n)}throw p(`Unterminated string`)},re=()=>{let t=n;for(;n<e.length&&g(e[n]);)n++;return e.slice(t,n)},T=e=>{if(c.length-1>=255)throw new w(`com.google.gson.stream.MalformedJsonException: Nesting limit 255 reached${f()}`);c.push(e),l.push(void 0),u.push(0),o=H.none},ie=()=>{c.pop(),l.pop(),u.pop(),u[c.length-1]++,o=H.none},ae=()=>{let e=S();return e!==H.endObject&&e!==H.endArray&&e!==H.eof},oe=()=>{let e=S(),t=e===H.unquotedName?re():C(e===H.singleQuotedName?`'`:`"`);return o=H.none,l[c.length-1]=t,t},se=t=>t===H.true||t===H.false?t===H.true:t===H.null?null:t===H.number?(n+=s,{literal:e.slice(n-s,n)}):t===H.unquoted?re():C(t===H.singleQuoted?`'`:`"`),ce=()=>{let e=S();if(e===H.beginArray){T(Pf.emptyArray);let e=[];for(;ae();)e.push(ce());return ie(),e}if(e===H.beginObject){T(Pf.emptyObject);let e=/* @__PURE__ */ new Map;for(;ae();)e.set(oe(),ce());return ie(),e}let t=se(e);return o=H.none,u[c.length-1]++,t};if(S()===H.eof)return null;let le=ce();return a=!1,le!==null&&S(),le},Bf=/* @__PURE__ */ new Set([`READ`,`WRITE`,`APPEND`,`TRUNCATE_EXISTING`,`CREATE`,`CREATE_NEW`,`DELETE_ON_CLOSE`,`SPARSE`,`SYNC`,`DSYNC`]),Vf=/* @__PURE__ */ new Set([`utf-8`,`utf8`,`unicode-1-1-utf-8`]),Hf=/* @__PURE__ */ new Set([`us-ascii`,`iso-8859-1`,`utf-16`,`utf-16be`,`utf-16le`]),Uf=e=>{if(!pn(e))return;let t=I(e),n=t.domain.flatMap((e,n)=>typeof e==`string`?[[e,t.range[n]]]:[]);return n.length===t.domain.length?pi(n):void 0},Wf=(e,t)=>{let n=`tlc2.value.impl.${Ds(e)}`,r=`tlc2.value.impl.${t}`;return new w(`class ${n} cannot be cast to class ${r} (${n} and ${r} are in unnamed module of loader 'app')`)},Gf=e=>new w(`Cannot convert value: unsupported value type tlc2.value.impl.${Ds(e)}`),Kf=e=>JSON.stringify(e).replaceAll(`\u2028`,`\\u2028`).replaceAll(`\u2029`,`\\u2029`),qf=e=>`[${e.map(Zf).join(`,`)}]`,Jf=e=>`{${Sn(e).map(e=>`${Kf(typeof e[0]==`string`?e[0]:L(e[0]))}:${Zf(e[1])}`).join(`,`)}}`,Yf=e=>{let t=I(e),n=Ui(t);return n?qf(n):Jf(t)},Xf=e=>e===`FcnRcdValue`||e===`FcnLambdaValue`,Zf=e=>typeof e==`string`?Kf(e):typeof e==`object`?e.kind===`ModelValue`?Kf(e.name):Ds(e)===`RecordValue`?Jf(I(e)):Qf(e):String(e),Qf=e=>{let t=Ds(e);if(t===`TupleValue`)return qf(I(e).range);if(Xf(t))return Yf(e);if(hi(e))return qf(F(e).elements);throw Gf(e)},$f=e=>e.map(e=>`${Zf(e)}\n`).join(``),ep=e=>{let t=Ds(e);if(t===`RecordValue`)return Jf(I(e));if(t===`TupleValue`)return`{${I(e).range.map((e,t)=>`"${t}":${Zf(e)}`).join(`,`)}}`;if(Xf(t))return Yf(e);throw Gf(e)},tp=e=>{if(e===null)throw new w(`Cannot convert value: unsupported JSON value null`);if(typeof e==`boolean`)return e;if(typeof e==`string`)return Un(e);if(Array.isArray(e))return fi(e.map(tp));if(e instanceof Map)return pi([...e].map(e=>[Un(e[0]),tp(e[1])]));let t=Number(e.literal);if(!/^-?\d+$/.test(e.literal)||xs(t))throw new w(`Cannot convert value: expected a 32-bit integer JSON number, but found ${e.literal}`);return t||0},np=e=>{if(typeof e!=`string`)throw new w(`Cannot cast tlc2.value.impl.${Ds(e)} to tlc2.value.impl.StringValue`);return e},rp=(e,t)=>{let n=pa(e,t);if(typeof n!=`string`)throw Wf(n,`StringValue`);return n},ip=e=>{if(!Vf.has(e.toLowerCase()))throw Hf.has(e.toLowerCase())?new p(`IOUtils!Serialize does not support the charset ${e}`):new w(/^[a-zA-Z\d][\w.:+-]*$/.test(e)?`java.nio.charset.UnsupportedCharsetException: ${e}`:`java.nio.charset.IllegalCharsetNameException: ${e}`)},ap=(e,t,n,r)=>{let i=n.find(e=>!Bf.has(e));if(i!==void 0)throw new w(`java.lang.IllegalArgumentException: No enum constant java.nio.file.StandardOpenOption.${i}`);if(n.includes(`READ`))throw new w(`java.lang.IllegalArgumentException: READ not allowed`);let a=new Set(n.length===0?[`CREATE`,`TRUNCATE_EXISTING`]:n);if(a.has(`APPEND`)&&a.has(`TRUNCATE_EXISTING`))throw new w(`java.lang.IllegalArgumentException: APPEND + TRUNCATE_EXISTING not allowed`);if(a.has(`DELETE_ON_CLOSE`))throw new p(`IOUtils!Serialize does not support DELETE_ON_CLOSE`);let o=e.readFile?.(t);if(o===void 0&&!a.has(`CREATE`)&&!a.has(`CREATE_NEW`))throw new w(`java.nio.file.NoSuchFileException: ${t}`);if(o!==void 0&&a.has(`CREATE_NEW`))throw new w(`java.nio.file.FileAlreadyExistsException: ${t}`);o===void 0||a.has(`TRUNCATE_EXISTING`)?e.writeFile?.(t,r):e.writeFile?.(t,a.has(`APPEND`)?o+r:r+o.slice(r.length))},op=(e,t)=>{let n=t.lastIndexOf(`/`);n!==-1&&e.makeDirectory?.(t.slice(0,Math.max(n,1)))},sp=(e,t)=>{let n=e.readFile?.(t);if(n===void 0)throw new w(`${t} (No such file or directory)`);return n},cp=e=>[As(ys(`ToJson`,1,e=>Un(Zf(R(e,0,`ToJson`)))),`public static tlc2.value.impl.StringValue tlc2.module.Json.toJson(tlc2.value.IValue) throws java.io.IOException`),As(ys(`ToJsonArray`,1,e=>Un(Qf(R(e,0,`ToJsonArray`)))),`public static tlc2.value.impl.StringValue tlc2.module.Json.toJsonArray(tlc2.value.IValue) throws java.io.IOException`),As(ys(`ToJsonObject`,1,e=>Un(ep(R(e,0,`ToJsonObject`)))),`public static tlc2.value.impl.StringValue tlc2.module.Json.toJsonObject(tlc2.value.IValue) throws java.io.IOException`),As(ys(`JsonSerialize`,2,t=>{let n=np(R(t,0,`JsonSerialize`)),r=R(t,1,`JsonSerialize`);if(!Ui(r)&&!Uf(r))throw fs(`second`,`JsonSerialize`,`sequence or record`,r);return op(e,n),e.writeFile?.(n,Zf(r)),!0}),`public static synchronized tlc2.value.impl.BoolValue tlc2.module.Json.serialize(tlc2.value.impl.StringValue,tlc2.value.impl.Value) throws java.io.IOException`),As(ys(`ndJsonSerialize`,2,t=>{let n=np(R(t,0,`ndJsonSerialize`)),r=R(t,1,`ndJsonSerialize`),i=Ui(r);if(!i)throw fs(`second`,`ndJsonSerialize`,`sequence`,r);return op(e,n),e.writeFile?.(n,$f(i)),!0}),`public static synchronized tlc2.value.impl.BoolValue tlc2.module.Json.ndSerialize(tlc2.value.impl.StringValue,tlc2.value.impl.Value) throws java.io.IOException`),As(ys(`JsonDeserialize`,1,t=>tp(zf(sp(e,np(R(t,0,`JsonDeserialize`)))))),`public static tlc2.value.IValue tlc2.module.Json.deserialize(tlc2.value.impl.StringValue) throws java.io.IOException`),As(ys(`ndJsonDeserialize`,1,t=>fi(sp(e,np(R(t,0,`ndJsonDeserialize`))).split(/\r\n|\r|\n/).map(e=>e.replace(/^[^!-\uffff]+|[^!-\uffff]+$/g,``)).filter(e=>e!==``).map(e=>tp(zf(e))))),`public static tlc2.value.IValue tlc2.module.Json.ndDeserialize(tlc2.value.impl.StringValue) throws java.io.IOException`)],lp=(e,t)=>[As(Is(`Serialize`,3,(n,r)=>{let i=Ls(n,2,`Serialize`)(),a=Uf(i);if(!a)throw fs(`third`,`ndJsonSerialize`,`sequence`,i);if(rp(a,`format`)!==`NDJSON`)return t(`Serialize`,n,r);let o=Ls(n,0,`Serialize`)(),s=Ui(o);if(!s)throw fs(`first`,`Serialize`,`sequence`,o);let c=Ls(n,1,`Serialize`)();if(typeof c!=`string`)throw fs(`second`,`ndJsonSerialize`,`sequence`,c);let l=pa(a,`openOptions`);if(Ds(l)!==`TupleValue`)throw Wf(l,`TupleValue`);let u=rp(a,`charset`),d=I(l).range.map(e=>{if(typeof e!=`string`)throw Wf(e,`StringValue`);return e});return ip(u),ap(e,c,d,$f(s)),!0}),`public static synchronized tlc2.value.impl.Value tlc2.module.Json.textSerialize(tlc2.tool.impl.Tool,tla2sany.semantic.ExprOrOpArgNode[],tlc2.util.Context,tlc2.tool.TLCState,tlc2.tool.TLCState,int,tlc2.tool.coverage.CostModel)`)],up={boolean:0,integer:1,string:3,record:4,set:5,tuple:7,function:9,modelValue:21,interval:23,handle:26},dp=e=>{let t=[],n=/* @__PURE__ */ new Map,r=/* @__PURE__ */ new Map,i=0,a=rr(),o=e=>t.push(e&255),s=e=>{o(e>>8),o(e)},c=e=>{s(e>>16),s(e)},l=e=>e>32767?c(-e):s(e),u=e=>{o(up.string),c(0),c(-1),c(e.length),e.split(``).forEach(e=>o(e.charCodeAt(0)))},d=e=>{o(up.handle),l(e)},f=e=>{if(typeof e==`boolean`){o(up.boolean),o(+!!e);return}if(typeof e==`number`){o(up.integer),c(e);return}if(typeof e==`string`){i++,u(e);return}if(e.kind===`ModelValue`){o(up.modelValue),s(a.indexOf(e));return}if(e.kind===`Interval`){o(up.interval),c(e.low),c(e.high);return}let t=n.get(e);if(t!==void 0){d(t);return}if(n.set(e,i++),dn(e)){let t=F(e).elements;o(up.set),c(t.length),t.forEach(f);return}let p=I(e),m=lr(e);m===`tuple`?(o(up.tuple),l(p.range.length),p.range.forEach(f)):m===`record`?(o(up.record),c(p.domain.length),p.domain.forEach((e,t)=>{let n=String(e),a=r.get(n);a===void 0?(r.set(n,i++),u(n)):d(a),f(p.range[t])})):(o(up.function),l(p.domain.length),o(1),p.domain.forEach((e,t)=>{f(e),f(p.range[t])}))};return f(e),ae(Uint8Array.from(t))},fp=e=>[As(ys(`_TLCTraceSerialize`,2,t=>{let n=np(R(t,1,`_TLCTraceSerialize`));return e.writeFile?.(n,dp(R(t,0,`_TLCTraceSerialize`))),!0}),`public static final tlc2.value.IValue tlc2.module._TLCTrace.ioSerialize(tlc2.value.IValue,tlc2.value.impl.StringValue) throws java.io.IOException`)],pp=25214903917n,mp=(1n<<48n)-1n,hp=e=>{let t=(BigInt.asUintN(64,e)^pp)&mp,n=e=>(t=t*pp+11n&mp,Number(BigInt.asIntN(32,t>>BigInt(48-e))));return{setSeed:e=>{t=(BigInt.asUintN(64,e)^pp)&mp},nextInt:e=>{let t=n(31),r=e-1;if((e&r)===0)return Number(BigInt(e)*BigInt(t)>>31n);for(let i=t;;i=n(31)){let t=i%e;if(i-t+r<=2147483647)return t}},nextLong:()=>BigInt.asIntN(64,(BigInt(n(32))<<32n)+BigInt(n(32))),nextDouble:()=>(n(26)*2**27+n(27))*2**-53}},gp=[],_p=e=>{for(let t=2;t*t<=e;t++)if(e%t===0)return!1;return!0},vp=()=>{for(let e=1277011;gp.length<1341;e++)_p(e)&&gp.push(e);return gp},yp=e=>{let t=vp(),n=t.length;for(;n===t.length;)n=Math.floor(e.nextDouble()*t.length);return t[n]},bp=e=>{let t=[],n=e;for(let e=2;e*e<=n;e++)for(;n%e===0;)t.push(e),n/=e;return n>1&&t.push(n),t},xp=e=>{for(let t=Math.max(e,9);;t++){let e=bp(t),n=new Set(e);if(t%4!=0&&n.size!==e.length)return{modulus:BigInt(t),multiplier:BigInt([...n].reduce((e,t)=>e*t,1)+1)}}},Sp=(e,t,n)=>{if(t<=0)return[];let r=xp(t),i=BigInt(n.nextInt(t)),a=BigInt(yp(n));return Array.from({length:e},()=>{do i=(r.multiplier*i+a)%r.modulus;while(i>=t);return i})},Cp=(e,t,n)=>{if(t<=0)return[];let r=BigInt(t<191?191:tn),i=BigInt(n.nextInt(t));return Array.from({length:Math.min(e,t)},(e,n)=>(r*BigInt(n)+i)%BigInt(t))},wp=(1n<<63n)-1n-24n,Tp=(e,t,n)=>{let r=n.nextLong(),i=BigInt.asIntN(64,r<0n?-r:r);return Array.from({length:e},(e,n)=>{let r=(wp*BigInt(n)+i)%t;return r<0n?r+t:r})},Ep=(e,t)=>e.reduceRight((e,t)=>({remaining:e.remaining/BigInt(t.length),elements:[t[Number(e.remaining%BigInt(t.length))],...e.elements]}),{remaining:t,elements:[]}).elements,Dp=e=>{if(typeof e==`object`){if(e.kind===`FunctionSet`){let t=ui(e.domain),n=F(e.range).elements;return{lists:t.map(()=>n),create:e=>or(t,e)}}if(e.kind===`RecordSet`)return{lists:e.sets.map(e=>F(e).elements),create:t=>pi(e.names.map((e,n)=>[e,t[n]]))};if(e.kind===`ProductSet`)return{lists:e.factors.map(e=>F(e).elements),create:fi}}},Op=(e,t)=>t===`1.7.4`&&typeof e==`object`&&e.kind===`ProductSet`?e.factors:void 0,kp=(e,t,n,r)=>{if(Fi(t))return[];let i=r===`1.7.4`?Cp:Sp;if(typeof t==`object`&&t.kind===`Interval`)return i(e,Math.max(0,t.high-t.low+1),n).map(e=>t.low+Number(e));let a=Op(t,r)?void 0:Dp(t);if(a){let t=a.lists.reduce((e,t)=>e*BigInt(t.length),1n);return(t>BigInt(2147483647)?Tp(e,t,n):i(e,Number(t),n)).map(e=>a.create(Ep(a.lists,e)))}let o=F(t).elements;return i(e,o.length,n).map(e=>o[Number(e)])},Ap=(e,t)=>{if(typeof e==`object`&&e.kind===`FunctionSet`){let n=[...ps(e.domain,`RandomElement`,e).elements];return or(n,n.map(()=>Ap(e.range,t)))}if(typeof e==`object`&&e.kind===`RecordSet`)return pi(e.names.map((n,r)=>[n,Ap(e.sets[r],t)]));if(typeof e==`object`&&e.kind===`ProductSet`)return fi(e.factors.map(e=>Ap(e,t)));if(typeof e==`object`&&e.kind===`Interval`){let n=Math.max(0,e.high-e.low+1),r=Math.floor(t.nextDouble()*n);if(r>=n)throw new w(`Attempted to retrieve out-of-bounds element from the interval value ${N(L(e))}.`);return e.low+r}let n=ps(e,`RandomElement`).elements,r=Math.floor(t.nextDouble()*n.length);if(r>=n.length)throw new w(`Index ${r} out of bounds for length ${n.length}`);return n[r]},jp=(e,t,n)=>{if(typeof e!=`number`||e<0)throw fs(t,n,`nonnegative integer`,e);return e},Mp=(e,t,n,r)=>Yr(Array.from({length:t},()=>Yr(e.filter(()=>r.nextDouble()<n)))),Np=(e,t)=>{let n=`RandomSetOfSubsets`,r=jp(R(e,0,n),`first`,n),i=jp(R(e,1,n),`second`,n),a=R(e,2,n);if(!dn(a)||!P(a))throw fs(`third`,n,`finite set`,a);let o=F(a).elements;if(o.length<31&&r>2**o.length)throw fs(`first`,n,`nonnegative integer that is smaller than the subset's size of 2^${o.length}`,r);if(o.length<i)throw fs(`second`,n,`nonnegative integer in range 0..Cardinality(S)`,i);return Mp(o,r,o.length===0?0:i/o.length,t.getRandom())},Pp=/^[+-]?(?:NaN|Infinity|(?:\d+\.?\d*|\.\d+)(?:[eE][+-]?\d+)?[fFdD]?)$/,Fp=/^([+-]?)0[xX]([0-9a-fA-F]*)(?:\.([0-9a-fA-F]*))?[pP]([+-]?\d+)[fFdD]?$/,Ip=e=>{let t=e.replace(/^[^!-\uffff]+|[^!-\uffff]+$/g,``);if(Pp.test(t))return Number(t.replace(/[fFdD]$/,``));let n=Fp.exec(t);if(!n)return;let r=n[3]??``,i=`${n[2]}${r}`;if(i===``)return;let a=Number.parseInt(i,16)*2**(Number(n[4])-4*r.length);return n[1]===`-`?-a:a},Lp=e=>z(`RandomSubsetSet`,3,t=>{let n=`RandomSubsetSetProbability`,r=jp(R(t,0,n),`first`,n),i=R(t,1,n);if(typeof i!=`string`)throw fs(`second`,n,`string literal representing a probability`,i);let a=Ip(i);if(a===void 0||a<0||a>1)throw fs(`second`,n,`string literal does not represent a parsable probability`,i);let o=R(t,2,n);if(!dn(o)||Kn(o)||!Bi(o))throw fs(`third`,n,`finite set`,o);let s=Ri(o);if(32-Math.clz32(r)>s&&r>1<<s)throw fs(`first`,n,`nonnegative integer that is smaller than the subset's size of 2^${s}`,r);return Mp(F(o).elements,r,a,e.getRandom())}),Rp=e=>[As(z(`RandomSubset`,2,t=>{let n=jp(R(t,0,`RandomSubset`),`first`,`RandomSubset`),r=R(t,1,`RandomSubset`);if(!hi(r)||!Bi(r))throw fs(`second`,`RandomSubset`,`a finite set`,r);let i=Op(r,e.version);if(i&&i.reduce((e,t)=>e*F(t).elements.length,1)>on())throw new w(sn());return Yr(kp(n,r,e.getRandom(),e.version))}),`public static tlc2.value.impl.Value tlc2.module.Randomization.RandomSubset(tlc2.value.impl.Value,tlc2.value.impl.Value)`),z(`RandomSetOfSubsets`,3,t=>Np(t,e)),z(`TestRandomSetOfSubsets`,3,t=>fi(Array.from({length:5},()=>F(Np(t,e)).elements.length)))],zp=(e,t=0n)=>{let n=hp(t),r=hp(t),i,a=!1,o={getLevel:()=>0,getBehavior:()=>[],getSpecification:()=>pi([]),counterExample:void 0,deferred:void 0,isSeen:()=>!1,markExplored:void 0,getSuccessorAction:()=>void 0,toRecord:()=>({}),setLivenessSource:()=>{},getCurrentState:()=>void 0,getFingerprint:To,getSimulationValue:void 0,getRandom:()=>{let e=a?void 0:o.getCurrentState();return e===void 0?n:(e!==i&&(r.setSeed(o.getFingerprint(e)^BigInt.asUintN(64,t)),i=e),r)},reseedRandom:()=>{i=void 0},evaluateAtStartup:e=>{let t=a;a=!0;try{return e()}finally{a=t}},pause:void 0,readLine:void 0,warn:()=>{},isWarningEnabled:!0,isTool:!1,version:`master`,seed:t,generatedStates:0,distinctStates:0,initialStates:0,queueSize:0,diameter:1,registers:/* @__PURE__ */ new Map,namedRegisters:/* @__PURE__ */ new Map,properties:/* @__PURE__ */ new Map,possibleCounts:/* @__PURE__ */ new Map,isStopped:!1,isStarted:!1,checkDeadlock:e,startedAt:Date.now()};return o},Bp=e=>ti([...e.possibleCounts].map(e=>[e[0],e[1]])),Vp=e=>e.possibleCounts.size===0?e.namedRegisters:new Map([...e.namedRegisters,[`s:_possible`,Bp(e)]]),Hp=e=>pi([[`name`,e??`UnnamedAction`],[`location`,pi([[`beginLine`,0],[`beginColumn`,0],[`endLine`,0],[`endColumn`,0],[`module`,`--TLA+ BUILTINS--`]])]]),Up=/* @__PURE__ */ new WeakSet,Wp=e=>cr(ni(e),`record`),Gp=(e,t,n=!0)=>{[`state`,`action`,`console`].forEach(Un);let r=[[`action`,Yr(e)],[`state`,Yr(t)]],i=Wp(n?r:[...r,[`console`,!1]]);return Up.add(i),i},Kp=(e,t,n,r=!0)=>{let i=e.map((e,t)=>fi([t+1,pi(Object.entries(e))])),a=i.slice(1).map((e,n)=>fi([i[n],t[n],e])),o=n?[fi([i[i.length-1],n.action,i[n.start]])]:[];return Gp([...a,...o],i,r)},qp=(e,t)=>{if(typeof t==`number`)return e.registers.get(t);if(typeof t==`string`&&t.startsWith(`s:`))return Vp(e).get(t)},Jp=(e,n,r,i)=>{if(typeof r==`number`&&r>=0)e.registers.set(r,i);else if(r===`exit`)i===!0&&(e.isStopped=!0);else if(r===`pause`){if(i!==!0||!e.pause)return;n(`Press enter to resume model checking.`),e.pause()}else if(typeof r==`string`&&r.startsWith(`s:`))e.namedRegisters.set(r,i);else if(typeof r==`string`&&r.startsWith(`-D`))e.properties.set(r.slice(2),L(i));else throw new t(`The first argument of TLCSet should be a nonnegative integer, but instead it is:\n${N(L(r))}`)},Yp=e=>e.kind===`Number`?e.text??String(e.value):e.kind===`Decimal`?e.text:U(e),Xp=e=>e.every(e=>e!==void 0),Zp=(e,t,n)=>{if(e.kind===`Prime`||e.kind===`Unchanged`)return 2;let r=e.kind===`Identifier`?e.name:e.kind===`Apply`?e.operator:void 0,i=r!==void 0&&!M(e);if(i&&t.variableIndex.has(r))return 1;let a=mt(e).map(e=>Zp(e,t,n)),o=i?h_(r,t):void 0;return o&&!n.has(o)&&(n.add(o),a.push(Zp(o.body,t,n))),Math.max(0,...a)},Qp=(e,n)=>{let r=/* @__PURE__ */ new Map,i=/* @__PURE__ */ new WeakMap,a=e=>{let t=i.get(e)??/* @__PURE__ */ new Map;return i.set(e,t),t};return[Is(`AssertError`,2,e=>{let t=gs(e,0,`AssertError`).expression;if(t&&t.kind!==`String`)throw new w(`In computing AssertError, a non-string expression (${Yp(t)}) was used as the err of an AssertError(err, exp).`);let r=Ls(e,0,`AssertError`)();try{Ls(e,1,`AssertError`)()}catch(e){if(e instanceof w)return Rt(e.message,n.isTool)===r;throw e}return!1}),ys(`TLCGetOrDefault`,2,e=>qp(n,R(e,0,`TLCGetOrDefault`))??R(e,1,`TLCGetOrDefault`)),ys(`Trace`,0,(e,t)=>{let r=t?.environment.variables??[],i=t?.state??r.map(()=>void 0);if(!t||!Xp(i)){let e=r.filter((e,t)=>i[t]===void 0);throw new w(`In evaluating TLCExt!Trace, the state is not completely specified yet (variable${e.length>1?`s`:``} ${e.join(`, `)} undefined).`)}return t.state?fi(n.getBehavior(i).map(e=>{let r=t.environment.variables.map((t,n)=>[t,e[n]]),i=n.getSimulationValue?.(`action`,e);return pi(i===void 0?r:[[`_action`,i],...r])})):fi([pi([])])}),ys(`CounterExample`,0,()=>n.counterExample??Gp([],[])),z(`ToTrace`,1,e=>{let n=R(e,0,`ToTrace`);if(typeof n!=`object`||!Up.has(n))throw new t(`The argument of ToTrace should be a CounterExample, but instead it is:\n${N(L(n))}`);let r=F(pa(n,`state`)).elements.map(e=>Ui(e)??[]);return fi(r.sort((e,t)=>Number(e[0])-Number(t[0])).map(e=>e[1]))}),z(`TLCModelValue`,1,e=>{let n=R(e,0,`TLCModelValue`);if(typeof n!=`string`)throw new t(`The argument of ModelValue should be a string, but instead it is:\n${N(L(n))}`);return nr(n)}),Is(`TLCDefer`,1,(e,t)=>{let r=gs(e,0,`TLCDefer`).expression;return t&&r&&(n.deferred=e=>{W(r,{...t,next:e})}),!0}),z(`TLCNoOp`,1,e=>R(e,0,`TLCNoOp`)),{...Is(`PickSuccessor`,1,(t,r)=>{let i=r?.next??(r?.environment.variables??[]).map(()=>void 0);if(n.getSimulationValue===void 0&&(!Xp(i)||r?.next&&n.isSeen(i)))return!0;let a=gs(t,0,`PickSuccessor`),o=a.call([]);if(typeof o!=`boolean`)throw new w(`In evaluating TLCExt!PickSuccessor, a non-boolean expression (${Os(o)}) was used as the condition of an IF.\n${a.expression?Yp(a.expression):``}`);if(o||!r?.next||!Xp(i)||!r.state||!Xp(r.state))return!0;let s=r.state,c=n.getSuccessorAction(s,i),l=t=>e(Dt(n.isTool,wt.moduleOverrideStdout,Tt.none,t));for(;;){l(`Extend behavior of length ${n.getLevel(s)} with a "${c?.name}" step [<Action ${c?.location.range&&g(c.location.range)}>]? (Yes/no/explored/states/diff):`);let e=n.readLine?.();if(e===void 0)throw new T;if(/^[\0-\x20]*$/.test(e)||e.toLowerCase().startsWith(`y`))return!0;if(e[0]===`s`)l(`${Ya(n.toRecord(s)).trimEnd()}\n~>\n${Ya(n.toRecord(i)).trimEnd()}`);else if(e[0]===`d`)l(Ya(n.toRecord(i),n.toRecord(s)));else if(e[0]===`e`){if(n.markExplored)return n.markExplored(i),!0;if(n.getSimulationValue===void 0)throw new p(`tla-ts can't mark a state explored while it searches depth first.`);l(`Marking a state explored is unsupported by the current TLC mode. Is TLC running in simulation mode?`)}else if(e[0]===`n`)return!1}}),isActionLevel:!0},Is(`TLCCache`,2,(e,t)=>{let i=gs(e,0,`TLCCache`),o=Pa(Ls(e,1,`TLCCache`)()),s=i.expression;if(!s||!t)return i.call([]);let c=Zp(s,t.environment,/* @__PURE__ */ new Set);if(c===2)return i.call([]);let l=c===1;if(l&&t.state&&n.getSimulationValue===void 0)return i.call([]),i.call([]);let u=l&&t.state?a(t.state):r,d=u.get(s)??/* @__PURE__ */ new Map;u.set(s,d);let f=d.get(o);if(f!==void 0)return f;let p=i.call([]);return d.set(o,p),p}),z(`TLCFP`,1,e=>{let t=R(e,0,`TLCFP`),n=Ta(t);if(n)throw n;return Number(BigInt.asIntN(32,To([t])))}),Is(`TLCEvalDefinition`,1,(e,n)=>{let r=Ls(e,0,`TLCEvalDefinition`)();if(typeof r!=`string`)throw new t(`The argument of TLCEvalDefinition should be a string, but instead it is:\n${N(L(r))}`);let i=n?h_(r,n.environment):void 0,a=i?void 0:n?.environment.builtins.get(r);if(a?.arity===0)return a.evaluate([],n);if(!i||!n)throw new t(`The argument of TLCEvalDefinition should be a name of a definition reachable from the root module, but instead it is:\n${N(L(r))}`);if(i.kind===`Operator`&&i.params.length>0){let e=i.params.map(e=>e.arity===0?e.name:`${e.name}(${Array.from({length:e.arity},()=>`_`).join(`,`)})`);throw new t(`The argument of TLCEvalDefinition should be a a zero-arity definition, but instead it is:\n${r}(${e.join(`, `)})`)}return i.kind===`Operator`?W(i.body,n):W({kind:`Identifier`,name:r,location:i.location},n)})]},$p=(e,t)=>[ys(`_Track`,2,e=>{let n=String(R(e,1,`_Track`)),r=t.possibleCounts.get(n)??0;return t.possibleCounts.set(n,R(e,0,`_Track`)===!0?r+1:r),!0}),ys(`_Counts`,0,()=>Bp(t)),ys(`_CheckName`,1,n=>{let r=String(R(n,0,`_CheckName`));return t.possibleCounts.get(r)?!0:(e(L(Bp(t),!0)),!1)}),ys(`_PrintCounts`,0,()=>(e(L(Bp(t),!0)),!0))],em=e=>`${e.getUTCFullYear()}.${zt(e.getUTCMonth()+1)}.${zt(e.getUTCDate())}.${zt(e.getUTCHours())}${zt(e.getUTCMinutes())}${zt(e.getUTCSeconds())}`,tm=e=>ti([...e].map(e=>[e[0],fi([e[1]])])),nm=/* @__PURE__ */ new Set([`diameter`,`generated`,`distinct`,`queue`,`stats`,`config`]),rm=/* @__PURE__ */ new Set([`diameter`,`distinct`,`queue`,`duration`,`level`]),im=/* @__PURE__ */ new Set([`diameter`,`distinct`,`queue`,`level`]),am=(e,n,r)=>{if(e.version===`1.7.4`?!rm.has(n)||!e.isStarted&&im.has(n):!e.isStarted&&nm.has(n))throw new t(`TLCGet(${n}) was undefined.`);let i=e.getSimulationValue?.(n,r);if(i!==void 0)return i;let a=Math.floor((Date.now()-e.startedAt)/1e3);switch(n){case`level`:return r===void 0?0:e.getLevel(r);case`diameter`:return e.diameter;case`generated`:return e.generatedStates;case`distinct`:return e.distinctStates;case`queue`:return e.queueSize;case`duration`:return a;case`stats`:return Wp([[`queue`,e.queueSize],[`distinct`,e.distinctStates],[`initial`,e.initialStates],[`generated`,e.generatedStates],[`diameter`,e.diameter],[`duration`,a],[`worker`,0]]);case`config`:return Wp([[`mode`,`bfs`],[`deadlock`,e.checkDeadlock],[`worker`,1],[`seed`,String(e.seed)],[`fingerprint`,String(BigInt.asIntN(64,Qa()))],[`install`,`unknown`]]);case`revision`:{let t=/* @__PURE__ */ new Date;return Wp([[`count`,0],[`timestamp`,Math.floor(t.getTime()/1e3)],[`date`,Un(`${t.toISOString().slice(0,19)}.${t.getUTCMilliseconds()}Z`)],[`tag`,`development`],[`calver`,Un(em(new Date(e.startedAt)))]])}case`spec`:return e.getSpecification();case`action`:return Hp(void 0);case`all`:return tm(e.registers);case`all:named`:return tm(Vp(e))}if(n.startsWith(`s:`)){let r=Vp(e).get(n);if(r===void 0)throw new t(`TLCGet(${n}) was undefined.`);return r}if(n.startsWith(`-D`))return Un(e.properties.get(n.slice(2))??n);throw new t(`TLCGet(${n}) was undefined.`)},om=(e,n,r)=>{if(typeof n==`number`&&n>=0){let r=e.registers.get(n);if(r===void 0)throw new t(`TLCGet(${n}) was undefined.`);return r}if(typeof n!=`string`)throw new t(`The argument of TLCGet should be a nonnegative integer, but instead it is:\n${N(L(n))}`);return am(e,n,r?.state)},sm=e=>e.length===0?[[]]:e.flatMap((t,n)=>sm([...e.slice(0,n),...e.slice(n+1)]).map(e=>[t,...e])),cm=e=>{typeof e==`object`&&((e.kind===`Set`||e.kind===`MixedSet`)&&F(e).elements.forEach(cm),e.kind===`Function`&&e.range.forEach(cm))},lm=e=>{if(typeof e!=`object`)return e;switch(e.kind){case`Function`:return e.functionClass===void 0?e:or(e.domain,e.range);case`ModelValue`:case`MixedSet`:case`InfiniteSet`:case`SequenceSet`:return e;case`LazyFunction`:return I(e);default:return F(e)}},um=(e,n)=>[z(`Print`,2,t=>(e(Ga([R(t,0,`Print`),R(t,1,`Print`)]).map(N).join(` `)),R(t,1,`Print`))),z(`PrintT`,1,t=>(e(N(Ga([R(t,0,`PrintT`)])[0])),!0)),z(`Assert`,2,e=>{if(R(e,0,`Assert`)!==!0)throw new t(`The first argument of Assert evaluated to FALSE; the second argument was:\n${N(L(R(e,1,`Assert`)))}`,S.assertViolation);return!0}),z(`JavaTime`,0,()=>Math.floor(Date.now()/1e3)&2147483647),z(`:>`,2,e=>ti([[R(e,0,`:>`),R(e,1,`:>`)]])),z(`@@`,2,e=>{let t=R(e,0,`@@`),n=R(e,1,`@@`),r=pn(t)?I(t):void 0,i=pn(n)?I(n):void 0;if(!r)throw fs(`first`,`@@`,`function`,t);if(!i)throw fs(`second`,`@@`,`function`,n);let a=xn(r),o=xn(i).filter(e=>!a.some(t=>Kr(e[0],t[0])));return ni([...a,...o])}),z(`ToString`,1,e=>Un(L(R(e,0,`ToString`),!0))),{...Is(`TLCEval`,1,(e,t)=>{let n=lm(Ls(e,0,`TLCEval`)());return t===void 0&&cm(n),n}),isStateLevel:!1},z(`Permutations`,1,e=>{let t=ps(R(e,0,`Permutations`),`Permutations`).elements;return Yr(sm(t).map(e=>ti(t.map((t,n)=>[t,e[n]]))))}),vs(`SortSeq`,2,e=>{let t=R(e,0,`SortSeq`),n=Ui(t);if(!n)throw fs(`first`,`SortSeq`,`natural number`,t);let r=gs(e,1,`SortSeq`),i=(e,t)=>{let n=r.call([e,t]);if(typeof n==`boolean`)return n;throw fs(`second`,`SortSeq`,`boolean function`,n)},a=n.slice(0,1);return n.slice(1).forEach(e=>{let t=a.length;for(;t>0&&i(e,a[t-1]);)t--;a.splice(t,0,e)}),fi(a)}),n.version===`1.7.4`?As({...ys(`TLCGet`,1,(e,t)=>om(n,R(e,0,`TLCGet`),t)),isLevelConstant:!0},`public static tlc2.value.impl.Value tlc2.module.TLC.TLCGet(tlc2.value.impl.Value)`):As(Is(`TLCGet`,1,(e,t)=>om(n,Ls(e,0,`TLCGet`)(),t)),`public static tlc2.value.impl.Value tlc2.module.TLCGetSet.TLCGetEval(tlc2.tool.impl.Tool,tla2sany.semantic.ExprOrOpArgNode[],tlc2.util.Context,tlc2.tool.TLCState,tlc2.tool.TLCState,int,tlc2.tool.coverage.CostModel)`),ys(`TLCSet`,2,t=>(Jp(n,e,R(t,0,`TLCSet`),R(t,1,`TLCSet`)),!0)),_s(`Any`,Xn),z(`RandomElement`,1,e=>Ap(R(e,0,`RandomElement`),n.getRandom()))],dm=`----------------------------- MODULE Bags --------------------------------
404
+ `&&(r++,i=n)}throw p(`Unterminated string`)},re=()=>{let t=n;for(;n<e.length&&g(e[n]);)n++;return e.slice(t,n)},T=e=>{if(c.length-1>=255)throw new w(`com.google.gson.stream.MalformedJsonException: Nesting limit 255 reached${f()}`);c.push(e),l.push(void 0),u.push(0),o=H.none},ie=()=>{c.pop(),l.pop(),u.pop(),u[c.length-1]++,o=H.none},ae=()=>{let e=S();return e!==H.endObject&&e!==H.endArray&&e!==H.eof},oe=()=>{let e=S(),t=e===H.unquotedName?re():C(e===H.singleQuotedName?`'`:`"`);return o=H.none,l[c.length-1]=t,t},se=t=>t===H.true||t===H.false?t===H.true:t===H.null?null:t===H.number?(n+=s,{literal:e.slice(n-s,n)}):t===H.unquoted?re():C(t===H.singleQuoted?`'`:`"`),ce=()=>{let e=S();if(e===H.beginArray){T(Pf.emptyArray);let e=[];for(;ae();)e.push(ce());return ie(),e}if(e===H.beginObject){T(Pf.emptyObject);let e=/* @__PURE__ */ new Map;for(;ae();)e.set(oe(),ce());return ie(),e}let t=se(e);return o=H.none,u[c.length-1]++,t};if(S()===H.eof)return null;let le=ce();return a=!1,le!==null&&S(),le},Bf=/* @__PURE__ */ new Set([`READ`,`WRITE`,`APPEND`,`TRUNCATE_EXISTING`,`CREATE`,`CREATE_NEW`,`DELETE_ON_CLOSE`,`SPARSE`,`SYNC`,`DSYNC`]),Vf=/* @__PURE__ */ new Set([`utf-8`,`utf8`,`unicode-1-1-utf-8`]),Hf=/* @__PURE__ */ new Set([`us-ascii`,`iso-8859-1`,`utf-16`,`utf-16be`,`utf-16le`]),Uf=e=>{if(!pn(e))return;let t=I(e),n=t.domain.flatMap((e,n)=>typeof e==`string`?[[e,t.range[n]]]:[]);return n.length===t.domain.length?pi(n):void 0},Wf=(e,t)=>{let n=`tlc2.value.impl.${Ds(e)}`,r=`tlc2.value.impl.${t}`;return new w(`class ${n} cannot be cast to class ${r} (${n} and ${r} are in unnamed module of loader 'app')`)},Gf=e=>new w(`Cannot convert value: unsupported value type tlc2.value.impl.${Ds(e)}`),Kf=e=>JSON.stringify(e).replaceAll(`\u2028`,`\\u2028`).replaceAll(`\u2029`,`\\u2029`),qf=e=>`[${e.map(Zf).join(`,`)}]`,Jf=e=>`{${Sn(e).map(e=>`${Kf(typeof e[0]==`string`?e[0]:L(e[0]))}:${Zf(e[1])}`).join(`,`)}}`,Yf=e=>{let t=I(e),n=Ui(t);return n?qf(n):Jf(t)},Xf=e=>e===`FcnRcdValue`||e===`FcnLambdaValue`,Zf=e=>typeof e==`string`?Kf(e):typeof e==`object`?e.kind===`ModelValue`?Kf(e.name):Ds(e)===`RecordValue`?Jf(I(e)):Qf(e):String(e),Qf=e=>{let t=Ds(e);if(t===`TupleValue`)return qf(I(e).range);if(Xf(t))return Yf(e);if(hi(e))return qf(F(e).elements);throw Gf(e)},$f=e=>e.map(e=>`${Zf(e)}\n`).join(``),ep=e=>{let t=Ds(e);if(t===`RecordValue`)return Jf(I(e));if(t===`TupleValue`)return`{${I(e).range.map((e,t)=>`"${t}":${Zf(e)}`).join(`,`)}}`;if(Xf(t))return Yf(e);throw Gf(e)},tp=e=>{if(e===null)throw new w(`Cannot convert value: unsupported JSON value null`);if(typeof e==`boolean`)return e;if(typeof e==`string`)return Un(e);if(Array.isArray(e))return fi(e.map(tp));if(e instanceof Map)return pi([...e].map(e=>[Un(e[0]),tp(e[1])]));let t=Number(e.literal);if(!/^-?\d+$/.test(e.literal)||xs(t))throw new w(`Cannot convert value: expected a 32-bit integer JSON number, but found ${e.literal}`);return t||0},np=e=>{if(typeof e!=`string`)throw new w(`Cannot cast tlc2.value.impl.${Ds(e)} to tlc2.value.impl.StringValue`);return e},rp=(e,t)=>{let n=pa(e,t);if(typeof n!=`string`)throw Wf(n,`StringValue`);return n},ip=e=>{if(!Vf.has(e.toLowerCase()))throw Hf.has(e.toLowerCase())?new p(`IOUtils!Serialize does not support the charset ${e}`):new w(/^[a-zA-Z\d][\w.:+-]*$/.test(e)?`java.nio.charset.UnsupportedCharsetException: ${e}`:`java.nio.charset.IllegalCharsetNameException: ${e}`)},ap=(e,t,n,r)=>{let i=n.find(e=>!Bf.has(e));if(i!==void 0)throw new w(`java.lang.IllegalArgumentException: No enum constant java.nio.file.StandardOpenOption.${i}`);if(n.includes(`READ`))throw new w(`java.lang.IllegalArgumentException: READ not allowed`);let a=new Set(n.length===0?[`CREATE`,`TRUNCATE_EXISTING`]:n);if(a.has(`APPEND`)&&a.has(`TRUNCATE_EXISTING`))throw new w(`java.lang.IllegalArgumentException: APPEND + TRUNCATE_EXISTING not allowed`);if(a.has(`DELETE_ON_CLOSE`))throw new p(`IOUtils!Serialize does not support DELETE_ON_CLOSE`);let o=e.readFile?.(t);if(o===void 0&&!a.has(`CREATE`)&&!a.has(`CREATE_NEW`))throw new w(`java.nio.file.NoSuchFileException: ${t}`);if(o!==void 0&&a.has(`CREATE_NEW`))throw new w(`java.nio.file.FileAlreadyExistsException: ${t}`);o===void 0||a.has(`TRUNCATE_EXISTING`)?e.writeFile?.(t,r):e.writeFile?.(t,a.has(`APPEND`)?o+r:r+o.slice(r.length))},op=(e,t)=>{let n=t.lastIndexOf(`/`);n!==-1&&e.makeDirectory?.(t.slice(0,Math.max(n,1)))},sp=(e,t)=>{let n=e.readFile?.(t);if(n===void 0)throw new w(`${t} (No such file or directory)`);return n},cp=e=>[As(ys(`ToJson`,1,e=>Un(Zf(R(e,0,`ToJson`)))),`public static tlc2.value.impl.StringValue tlc2.module.Json.toJson(tlc2.value.IValue) throws java.io.IOException`),As(ys(`ToJsonArray`,1,e=>Un(Qf(R(e,0,`ToJsonArray`)))),`public static tlc2.value.impl.StringValue tlc2.module.Json.toJsonArray(tlc2.value.IValue) throws java.io.IOException`),As(ys(`ToJsonObject`,1,e=>Un(ep(R(e,0,`ToJsonObject`)))),`public static tlc2.value.impl.StringValue tlc2.module.Json.toJsonObject(tlc2.value.IValue) throws java.io.IOException`),As(ys(`JsonSerialize`,2,t=>{let n=np(R(t,0,`JsonSerialize`)),r=R(t,1,`JsonSerialize`);if(!Ui(r)&&!Uf(r))throw fs(`second`,`JsonSerialize`,`sequence or record`,r);return op(e,n),e.writeFile?.(n,Zf(r)),!0}),`public static synchronized tlc2.value.impl.BoolValue tlc2.module.Json.serialize(tlc2.value.impl.StringValue,tlc2.value.impl.Value) throws java.io.IOException`),As(ys(`ndJsonSerialize`,2,t=>{let n=np(R(t,0,`ndJsonSerialize`)),r=R(t,1,`ndJsonSerialize`),i=Ui(r);if(!i)throw fs(`second`,`ndJsonSerialize`,`sequence`,r);return op(e,n),e.writeFile?.(n,$f(i)),!0}),`public static synchronized tlc2.value.impl.BoolValue tlc2.module.Json.ndSerialize(tlc2.value.impl.StringValue,tlc2.value.impl.Value) throws java.io.IOException`),As(ys(`JsonDeserialize`,1,t=>tp(zf(sp(e,np(R(t,0,`JsonDeserialize`)))))),`public static tlc2.value.IValue tlc2.module.Json.deserialize(tlc2.value.impl.StringValue) throws java.io.IOException`),As(ys(`ndJsonDeserialize`,1,t=>fi(sp(e,np(R(t,0,`ndJsonDeserialize`))).split(/\r\n|\r|\n/).map(e=>e.replace(/^[^!-\uffff]+|[^!-\uffff]+$/g,``)).filter(e=>e!==``).map(e=>tp(zf(e))))),`public static tlc2.value.IValue tlc2.module.Json.ndDeserialize(tlc2.value.impl.StringValue) throws java.io.IOException`)],lp=(e,t)=>[As(Is(`Serialize`,3,(n,r)=>{let i=Ls(n,2,`Serialize`)(),a=Uf(i);if(!a)throw fs(`third`,`ndJsonSerialize`,`sequence`,i);if(rp(a,`format`)!==`NDJSON`)return t(`Serialize`,n,r);let o=Ls(n,0,`Serialize`)(),s=Ui(o);if(!s)throw fs(`first`,`Serialize`,`sequence`,o);let c=Ls(n,1,`Serialize`)();if(typeof c!=`string`)throw fs(`second`,`ndJsonSerialize`,`sequence`,c);let l=pa(a,`openOptions`);if(Ds(l)!==`TupleValue`)throw Wf(l,`TupleValue`);let u=rp(a,`charset`),d=I(l).range.map(e=>{if(typeof e!=`string`)throw Wf(e,`StringValue`);return e});return ip(u),ap(e,c,d,$f(s)),!0}),`public static synchronized tlc2.value.impl.Value tlc2.module.Json.textSerialize(tlc2.tool.impl.Tool,tla2sany.semantic.ExprOrOpArgNode[],tlc2.util.Context,tlc2.tool.TLCState,tlc2.tool.TLCState,int,tlc2.tool.coverage.CostModel)`)],up={boolean:0,integer:1,string:3,record:4,set:5,tuple:7,function:9,modelValue:21,interval:23,handle:26},dp=e=>{let t=[],n=/* @__PURE__ */ new Map,r=/* @__PURE__ */ new Map,i=0,a=rr(),o=e=>t.push(e&255),s=e=>{o(e>>8),o(e)},c=e=>{s(e>>16),s(e)},l=e=>e>32767?c(-e):s(e),u=e=>{o(up.string),c(0),c(-1),c(e.length),e.split(``).forEach(e=>o(e.charCodeAt(0)))},d=e=>{o(up.handle),l(e)},f=e=>{if(typeof e==`boolean`){o(up.boolean),o(+!!e);return}if(typeof e==`number`){o(up.integer),c(e);return}if(typeof e==`string`){i++,u(e);return}if(e.kind===`ModelValue`){o(up.modelValue),s(a.indexOf(e));return}if(e.kind===`Interval`){o(up.interval),c(e.low),c(e.high);return}let t=n.get(e);if(t!==void 0){d(t);return}if(n.set(e,i++),dn(e)){let t=F(e).elements;o(up.set),c(t.length),t.forEach(f);return}let p=I(e),m=lr(e);m===`tuple`?(o(up.tuple),l(p.range.length),p.range.forEach(f)):m===`record`?(o(up.record),c(p.domain.length),p.domain.forEach((e,t)=>{let n=String(e),a=r.get(n);a===void 0?(r.set(n,i++),u(n)):d(a),f(p.range[t])})):(o(up.function),l(p.domain.length),o(1),p.domain.forEach((e,t)=>{f(e),f(p.range[t])}))};return f(e),ae(Uint8Array.from(t))},fp=e=>[As(ys(`_TLCTraceSerialize`,2,t=>{let n=np(R(t,1,`_TLCTraceSerialize`));return e.writeFile?.(n,dp(R(t,0,`_TLCTraceSerialize`))),!0}),`public static final tlc2.value.IValue tlc2.module._TLCTrace.ioSerialize(tlc2.value.IValue,tlc2.value.impl.StringValue) throws java.io.IOException`)],pp=25214903917n,mp=(1n<<48n)-1n,hp=e=>{let t=(BigInt.asUintN(64,e)^pp)&mp,n=e=>(t=t*pp+11n&mp,Number(BigInt.asIntN(32,t>>BigInt(48-e))));return{setSeed:e=>{t=(BigInt.asUintN(64,e)^pp)&mp},nextInt:e=>{let t=n(31),r=e-1;if((e&r)===0)return Number(BigInt(e)*BigInt(t)>>31n);for(let i=t;;i=n(31)){let t=i%e;if(i-t+r<=2147483647)return t}},nextLong:()=>BigInt.asIntN(64,(BigInt(n(32))<<32n)+BigInt(n(32))),nextDouble:()=>(n(26)*2**27+n(27))*2**-53}},gp=[],_p=e=>{for(let t=2;t*t<=e;t++)if(e%t===0)return!1;return!0},vp=()=>{for(let e=1277011;gp.length<1341;e++)_p(e)&&gp.push(e);return gp},yp=e=>{let t=vp(),n=t.length;for(;n===t.length;)n=Math.floor(e.nextDouble()*t.length);return t[n]},bp=e=>{let t=[],n=e;for(let e=2;e*e<=n;e++)for(;n%e===0;)t.push(e),n/=e;return n>1&&t.push(n),t},xp=e=>{for(let t=Math.max(e,9);;t++){let e=bp(t),n=new Set(e);if(t%4!=0&&n.size!==e.length)return{modulus:BigInt(t),multiplier:BigInt([...n].reduce((e,t)=>e*t,1)+1)}}},Sp=(e,t,n)=>{if(t<=0)return[];let r=xp(t),i=BigInt(n.nextInt(t)),a=BigInt(yp(n));return Array.from({length:e},()=>{do i=(r.multiplier*i+a)%r.modulus;while(i>=t);return i})},Cp=(e,t,n)=>{if(t<=0)return[];let r=BigInt(t<191?191:tn),i=BigInt(n.nextInt(t));return Array.from({length:Math.min(e,t)},(e,n)=>(r*BigInt(n)+i)%BigInt(t))},wp=(1n<<63n)-1n-24n,Tp=(e,t,n)=>{let r=n.nextLong(),i=BigInt.asIntN(64,r<0n?-r:r);return Array.from({length:e},(e,n)=>{let r=(wp*BigInt(n)+i)%t;return r<0n?r+t:r})},Ep=(e,t)=>e.reduceRight((e,t)=>({remaining:e.remaining/BigInt(t.length),elements:[t[Number(e.remaining%BigInt(t.length))],...e.elements]}),{remaining:t,elements:[]}).elements,Dp=e=>{if(typeof e==`object`){if(e.kind===`FunctionSet`){let t=ui(e.domain),n=F(e.range).elements;return{lists:t.map(()=>n),create:e=>or(t,e)}}if(e.kind===`RecordSet`)return{lists:e.sets.map(e=>F(e).elements),create:t=>pi(e.names.map((e,n)=>[e,t[n]]))};if(e.kind===`ProductSet`)return{lists:e.factors.map(e=>F(e).elements),create:fi}}},Op=(e,t)=>t===`1.7.4`&&typeof e==`object`&&e.kind===`ProductSet`?e.factors:void 0,kp=(e,t,n,r)=>{if(Fi(t))return[];let i=r===`1.7.4`?Cp:Sp;if(typeof t==`object`&&t.kind===`Interval`)return i(e,Math.max(0,t.high-t.low+1),n).map(e=>t.low+Number(e));let a=Op(t,r)?void 0:Dp(t);if(a){let t=a.lists.reduce((e,t)=>e*BigInt(t.length),1n);return(t>BigInt(2147483647)?Tp(e,t,n):i(e,Number(t),n)).map(e=>a.create(Ep(a.lists,e)))}let o=F(t).elements;return i(e,o.length,n).map(e=>o[Number(e)])},Ap=(e,t)=>{if(typeof e==`object`&&e.kind===`FunctionSet`){let n=[...ps(e.domain,`RandomElement`,e).elements];return or(n,n.map(()=>Ap(e.range,t)))}if(typeof e==`object`&&e.kind===`RecordSet`)return pi(e.names.map((n,r)=>[n,Ap(e.sets[r],t)]));if(typeof e==`object`&&e.kind===`ProductSet`)return fi(e.factors.map(e=>Ap(e,t)));if(typeof e==`object`&&e.kind===`Interval`){let n=Math.max(0,e.high-e.low+1),r=Math.floor(t.nextDouble()*n);if(r>=n)throw new w(`Attempted to retrieve out-of-bounds element from the interval value ${N(L(e))}.`);return e.low+r}let n=ps(e,`RandomElement`).elements,r=Math.floor(t.nextDouble()*n.length);if(r>=n.length)throw new w(`Index ${r} out of bounds for length ${n.length}`);return n[r]},jp=(e,t,n)=>{if(typeof e!=`number`||e<0)throw fs(t,n,`nonnegative integer`,e);return e},Mp=(e,t,n,r)=>Yr(Array.from({length:t},()=>Yr(e.filter(()=>r.nextDouble()<n)))),Np=(e,t)=>{let n=`RandomSetOfSubsets`,r=jp(R(e,0,n),`first`,n),i=jp(R(e,1,n),`second`,n),a=R(e,2,n);if(!dn(a)||!P(a))throw fs(`third`,n,`finite set`,a);let o=F(a).elements;if(o.length<31&&r>2**o.length)throw fs(`first`,n,`nonnegative integer that is smaller than the subset's size of 2^${o.length}`,r);if(o.length<i)throw fs(`second`,n,`nonnegative integer in range 0..Cardinality(S)`,i);return Mp(o,r,o.length===0?0:i/o.length,t.getRandom())},Pp=/^[+-]?(?:NaN|Infinity|(?:\d+\.?\d*|\.\d+)(?:[eE][+-]?\d+)?[fFdD]?)$/,Fp=/^([+-]?)0[xX]([0-9a-fA-F]*)(?:\.([0-9a-fA-F]*))?[pP]([+-]?\d+)[fFdD]?$/,Ip=e=>{let t=e.replace(/^[^!-\uffff]+|[^!-\uffff]+$/g,``);if(Pp.test(t))return Number(t.replace(/[fFdD]$/,``));let n=Fp.exec(t);if(!n)return;let r=n[3]??``,i=`${n[2]}${r}`;if(i===``)return;let a=Number.parseInt(i,16)*2**(Number(n[4])-4*r.length);return n[1]===`-`?-a:a},Lp=e=>z(`RandomSubsetSet`,3,t=>{let n=`RandomSubsetSetProbability`,r=jp(R(t,0,n),`first`,n),i=R(t,1,n);if(typeof i!=`string`)throw fs(`second`,n,`string literal representing a probability`,i);let a=Ip(i);if(a===void 0||a<0||a>1)throw fs(`second`,n,`string literal does not represent a parsable probability`,i);let o=R(t,2,n);if(!dn(o)||Kn(o)||!Bi(o))throw fs(`third`,n,`finite set`,o);let s=Ri(o);if(32-Math.clz32(r)>s&&r>1<<s)throw fs(`first`,n,`nonnegative integer that is smaller than the subset's size of 2^${s}`,r);return Mp(F(o).elements,r,a,e.getRandom())}),Rp=e=>[As(z(`RandomSubset`,2,t=>{let n=jp(R(t,0,`RandomSubset`),`first`,`RandomSubset`),r=R(t,1,`RandomSubset`);if(!hi(r)||!Bi(r))throw fs(`second`,`RandomSubset`,`a finite set`,r);let i=Op(r,e.version);if(i&&i.reduce((e,t)=>e*F(t).elements.length,1)>on())throw new w(sn());return Yr(kp(n,r,e.getRandom(),e.version))}),`public static tlc2.value.impl.Value tlc2.module.Randomization.RandomSubset(tlc2.value.impl.Value,tlc2.value.impl.Value)`),z(`RandomSetOfSubsets`,3,t=>Np(t,e)),z(`TestRandomSetOfSubsets`,3,t=>fi(Array.from({length:5},()=>F(Np(t,e)).elements.length)))],zp=(e,t=0n)=>{let n=hp(t),r=hp(t),i,a=!1,o={getLevel:()=>0,getBehavior:()=>[],getSpecification:()=>pi([]),counterExample:void 0,deferred:void 0,isSeen:()=>!1,markExplored:void 0,getSuccessorAction:()=>void 0,toRecord:()=>({}),setLivenessSource:()=>{},getCurrentState:()=>void 0,getFingerprint:To,getSimulationValue:void 0,getRandom:()=>{let e=a?void 0:o.getCurrentState();return e===void 0?n:(e!==i&&(r.setSeed(o.getFingerprint(e)^BigInt.asUintN(64,t)),i=e),r)},reseedRandom:()=>{i=void 0},evaluateAtStartup:e=>{let t=a;a=!0;try{return e()}finally{a=t}},pause:void 0,readLine:void 0,warn:()=>{},isWarningEnabled:!0,isTool:!1,version:`master`,seed:t,generatedStates:0,distinctStates:0,initialStates:0,queueSize:0,diameter:1,registers:/* @__PURE__ */ new Map,namedRegisters:/* @__PURE__ */ new Map,properties:/* @__PURE__ */ new Map,possibleCounts:/* @__PURE__ */ new Map,isStopped:!1,isStarted:!1,checkDeadlock:e,startedAt:Date.now()};return o},Bp=e=>ti([...e.possibleCounts].map(e=>[e[0],e[1]])),Vp=e=>e.possibleCounts.size===0?e.namedRegisters:new Map([...e.namedRegisters,[`s:_possible`,Bp(e)]]),Hp=e=>pi([[`name`,e??`UnnamedAction`],[`location`,pi([[`beginLine`,0],[`beginColumn`,0],[`endLine`,0],[`endColumn`,0],[`module`,`--TLA+ BUILTINS--`]])]]),Up=/* @__PURE__ */ new WeakSet,Wp=e=>cr(ni(e),`record`),Gp=(e,t,n=!0)=>{[`state`,`action`,`console`].forEach(Un);let r=[[`action`,Yr(e)],[`state`,Yr(t)]],i=Wp(n?r:[...r,[`console`,!1]]);return Up.add(i),i},Kp=(e,t,n,r=!0)=>{let i=e.map((e,t)=>fi([t+1,pi(Object.entries(e))])),a=i.slice(1).map((e,n)=>fi([i[n],t[n],e])),o=n?[fi([i[i.length-1],n.action,i[n.start]])]:[];return Gp([...a,...o],i,r)},qp=(e,t)=>{if(typeof t==`number`)return e.registers.get(t);if(typeof t==`string`&&t.startsWith(`s:`))return Vp(e).get(t)},Jp=(e,n,r,i)=>{if(typeof r==`number`&&r>=0)e.registers.set(r,i);else if(r===`exit`)i===!0&&(e.isStopped=!0);else if(r===`pause`){if(i!==!0||!e.pause)return;n(`Press enter to resume model checking.`),e.pause()}else if(typeof r==`string`&&r.startsWith(`s:`))e.namedRegisters.set(r,i);else if(typeof r==`string`&&r.startsWith(`-D`))e.properties.set(r.slice(2),L(i));else throw new t(`The first argument of TLCSet should be a nonnegative integer, but instead it is:\n${N(L(r))}`)},Yp=e=>e.kind===`Number`?e.text??String(e.value):e.kind===`Decimal`?e.text:U(e),Xp=e=>e.every(e=>e!==void 0),Zp=(e,t,n)=>{if(e.kind===`Prime`||e.kind===`Unchanged`)return 2;let r=e.kind===`Identifier`?e.name:e.kind===`Apply`?e.operator:void 0,i=r!==void 0&&!M(e);if(i&&t.variableIndex.has(r))return 1;let a=mt(e).map(e=>Zp(e,t,n)),o=i?__(r,t):void 0;return o&&!n.has(o)&&(n.add(o),a.push(Zp(o.body,t,n))),Math.max(0,...a)},Qp=(e,n)=>{let r=/* @__PURE__ */ new Map,i=/* @__PURE__ */ new WeakMap,a=e=>{let t=i.get(e)??/* @__PURE__ */ new Map;return i.set(e,t),t};return[Is(`AssertError`,2,e=>{let t=gs(e,0,`AssertError`).expression;if(t&&t.kind!==`String`)throw new w(`In computing AssertError, a non-string expression (${Yp(t)}) was used as the err of an AssertError(err, exp).`);let r=Ls(e,0,`AssertError`)();try{Ls(e,1,`AssertError`)()}catch(e){if(e instanceof w)return Rt(e.message,n.isTool)===r;throw e}return!1}),ys(`TLCGetOrDefault`,2,e=>qp(n,R(e,0,`TLCGetOrDefault`))??R(e,1,`TLCGetOrDefault`)),ys(`Trace`,0,(e,t)=>{let r=t?.environment.variables??[],i=t?.state??r.map(()=>void 0);if(!t||!Xp(i)){let e=r.filter((e,t)=>i[t]===void 0);throw new w(`In evaluating TLCExt!Trace, the state is not completely specified yet (variable${e.length>1?`s`:``} ${e.join(`, `)} undefined).`)}return t.state?fi(n.getBehavior(i).map(e=>{let r=t.environment.variables.map((t,n)=>[t,e[n]]),i=n.getSimulationValue?.(`action`,e);return pi(i===void 0?r:[[`_action`,i],...r])})):fi([pi([])])}),ys(`CounterExample`,0,()=>n.counterExample??Gp([],[])),z(`ToTrace`,1,e=>{let n=R(e,0,`ToTrace`);if(typeof n!=`object`||!Up.has(n))throw new t(`The argument of ToTrace should be a CounterExample, but instead it is:\n${N(L(n))}`);let r=F(pa(n,`state`)).elements.map(e=>Ui(e)??[]);return fi(r.sort((e,t)=>Number(e[0])-Number(t[0])).map(e=>e[1]))}),z(`TLCModelValue`,1,e=>{let n=R(e,0,`TLCModelValue`);if(typeof n!=`string`)throw new t(`The argument of ModelValue should be a string, but instead it is:\n${N(L(n))}`);return nr(n)}),Is(`TLCDefer`,1,(e,t)=>{let r=gs(e,0,`TLCDefer`).expression;return t&&r&&(n.deferred=e=>{W(r,{...t,next:e})}),!0}),z(`TLCNoOp`,1,e=>R(e,0,`TLCNoOp`)),{...Is(`PickSuccessor`,1,(t,r)=>{let i=r?.next??(r?.environment.variables??[]).map(()=>void 0);if(n.getSimulationValue===void 0&&(!Xp(i)||r?.next&&n.isSeen(i)))return!0;let a=gs(t,0,`PickSuccessor`),o=a.call([]);if(typeof o!=`boolean`)throw new w(`In evaluating TLCExt!PickSuccessor, a non-boolean expression (${Os(o)}) was used as the condition of an IF.\n${a.expression?Yp(a.expression):``}`);if(o||!r?.next||!Xp(i)||!r.state||!Xp(r.state))return!0;let s=r.state,c=n.getSuccessorAction(s,i),l=t=>e(Dt(n.isTool,wt.moduleOverrideStdout,Tt.none,t));for(;;){l(`Extend behavior of length ${n.getLevel(s)} with a "${c?.name}" step [<Action ${c?.location.range&&g(c.location.range)}>]? (Yes/no/explored/states/diff):`);let e=n.readLine?.();if(e===void 0)throw new T;if(/^[\0-\x20]*$/.test(e)||e.toLowerCase().startsWith(`y`))return!0;if(e[0]===`s`)l(`${Ya(n.toRecord(s)).trimEnd()}\n~>\n${Ya(n.toRecord(i)).trimEnd()}`);else if(e[0]===`d`)l(Ya(n.toRecord(i),n.toRecord(s)));else if(e[0]===`e`){if(n.markExplored)return n.markExplored(i),!0;if(n.getSimulationValue===void 0)throw new p(`tla-ts can't mark a state explored while it searches depth first.`);l(`Marking a state explored is unsupported by the current TLC mode. Is TLC running in simulation mode?`)}else if(e[0]===`n`)return!1}}),isActionLevel:!0},Is(`TLCCache`,2,(e,t)=>{let i=gs(e,0,`TLCCache`),o=Pa(Ls(e,1,`TLCCache`)()),s=i.expression;if(!s||!t)return i.call([]);let c=Zp(s,t.environment,/* @__PURE__ */ new Set);if(c===2)return i.call([]);let l=c===1;if(l&&t.state&&n.getSimulationValue===void 0)return i.call([]),i.call([]);let u=l&&t.state?a(t.state):r,d=u.get(s)??/* @__PURE__ */ new Map;u.set(s,d);let f=d.get(o);if(f!==void 0)return f;let p=i.call([]);return d.set(o,p),p}),z(`TLCFP`,1,e=>{let t=R(e,0,`TLCFP`),n=Ta(t);if(n)throw n;return Number(BigInt.asIntN(32,To([t])))}),Is(`TLCEvalDefinition`,1,(e,n)=>{let r=Ls(e,0,`TLCEvalDefinition`)();if(typeof r!=`string`)throw new t(`The argument of TLCEvalDefinition should be a string, but instead it is:\n${N(L(r))}`);let i=n?__(r,n.environment):void 0,a=i?void 0:n?.environment.builtins.get(r);if(a?.arity===0)return a.evaluate([],n);if(!i||!n)throw new t(`The argument of TLCEvalDefinition should be a name of a definition reachable from the root module, but instead it is:\n${N(L(r))}`);if(i.kind===`Operator`&&i.params.length>0){let e=i.params.map(e=>e.arity===0?e.name:`${e.name}(${Array.from({length:e.arity},()=>`_`).join(`,`)})`);throw new t(`The argument of TLCEvalDefinition should be a a zero-arity definition, but instead it is:\n${r}(${e.join(`, `)})`)}return i.kind===`Operator`?W(i.body,n):W({kind:`Identifier`,name:r,location:i.location},n)})]},$p=(e,t)=>[ys(`_Track`,2,e=>{let n=String(R(e,1,`_Track`)),r=t.possibleCounts.get(n)??0;return t.possibleCounts.set(n,R(e,0,`_Track`)===!0?r+1:r),!0}),ys(`_Counts`,0,()=>Bp(t)),ys(`_CheckName`,1,n=>{let r=String(R(n,0,`_CheckName`));return t.possibleCounts.get(r)?!0:(e(L(Bp(t),!0)),!1)}),ys(`_PrintCounts`,0,()=>(e(L(Bp(t),!0)),!0))],em=e=>`${e.getUTCFullYear()}.${zt(e.getUTCMonth()+1)}.${zt(e.getUTCDate())}.${zt(e.getUTCHours())}${zt(e.getUTCMinutes())}${zt(e.getUTCSeconds())}`,tm=e=>ti([...e].map(e=>[e[0],fi([e[1]])])),nm=/* @__PURE__ */ new Set([`diameter`,`generated`,`distinct`,`queue`,`stats`,`config`]),rm=/* @__PURE__ */ new Set([`diameter`,`distinct`,`queue`,`duration`,`level`]),im=/* @__PURE__ */ new Set([`diameter`,`distinct`,`queue`,`level`]),am=(e,n,r)=>{if(e.version===`1.7.4`?!rm.has(n)||!e.isStarted&&im.has(n):!e.isStarted&&nm.has(n))throw new t(`TLCGet(${n}) was undefined.`);let i=e.getSimulationValue?.(n,r);if(i!==void 0)return i;let a=Math.floor((Date.now()-e.startedAt)/1e3);switch(n){case`level`:return r===void 0?0:e.getLevel(r);case`diameter`:return e.diameter;case`generated`:return e.generatedStates;case`distinct`:return e.distinctStates;case`queue`:return e.queueSize;case`duration`:return a;case`stats`:return Wp([[`queue`,e.queueSize],[`distinct`,e.distinctStates],[`initial`,e.initialStates],[`generated`,e.generatedStates],[`diameter`,e.diameter],[`duration`,a],[`worker`,0]]);case`config`:return Wp([[`mode`,`bfs`],[`deadlock`,e.checkDeadlock],[`worker`,1],[`seed`,String(e.seed)],[`fingerprint`,String(BigInt.asIntN(64,Qa()))],[`install`,`unknown`]]);case`revision`:{let t=/* @__PURE__ */ new Date;return Wp([[`count`,0],[`timestamp`,Math.floor(t.getTime()/1e3)],[`date`,Un(`${t.toISOString().slice(0,19)}.${t.getUTCMilliseconds()}Z`)],[`tag`,`development`],[`calver`,Un(em(new Date(e.startedAt)))]])}case`spec`:return e.getSpecification();case`action`:return Hp(void 0);case`all`:return tm(e.registers);case`all:named`:return tm(Vp(e))}if(n.startsWith(`s:`)){let r=Vp(e).get(n);if(r===void 0)throw new t(`TLCGet(${n}) was undefined.`);return r}if(n.startsWith(`-D`))return Un(e.properties.get(n.slice(2))??n);throw new t(`TLCGet(${n}) was undefined.`)},om=(e,n,r)=>{if(typeof n==`number`&&n>=0){let r=e.registers.get(n);if(r===void 0)throw new t(`TLCGet(${n}) was undefined.`);return r}if(typeof n!=`string`)throw new t(`The argument of TLCGet should be a nonnegative integer, but instead it is:\n${N(L(n))}`);return am(e,n,r?.state)},sm=e=>e.length===0?[[]]:e.flatMap((t,n)=>sm([...e.slice(0,n),...e.slice(n+1)]).map(e=>[t,...e])),cm=e=>{typeof e==`object`&&((e.kind===`Set`||e.kind===`MixedSet`)&&F(e).elements.forEach(cm),e.kind===`Function`&&e.range.forEach(cm))},lm=e=>{if(typeof e!=`object`)return e;switch(e.kind){case`Function`:return e.functionClass===void 0?e:or(e.domain,e.range);case`ModelValue`:case`MixedSet`:case`InfiniteSet`:case`SequenceSet`:return e;case`LazyFunction`:return I(e);default:return F(e)}},um=(e,n)=>[z(`Print`,2,t=>(e(Ga([R(t,0,`Print`),R(t,1,`Print`)]).map(N).join(` `)),R(t,1,`Print`))),z(`PrintT`,1,t=>(e(N(Ga([R(t,0,`PrintT`)])[0])),!0)),z(`Assert`,2,e=>{if(R(e,0,`Assert`)!==!0)throw new t(`The first argument of Assert evaluated to FALSE; the second argument was:\n${N(L(R(e,1,`Assert`)))}`,S.assertViolation);return!0}),z(`JavaTime`,0,()=>Math.floor(Date.now()/1e3)&2147483647),z(`:>`,2,e=>ti([[R(e,0,`:>`),R(e,1,`:>`)]])),z(`@@`,2,e=>{let t=R(e,0,`@@`),n=R(e,1,`@@`),r=pn(t)?I(t):void 0,i=pn(n)?I(n):void 0;if(!r)throw fs(`first`,`@@`,`function`,t);if(!i)throw fs(`second`,`@@`,`function`,n);let a=xn(r),o=xn(i).filter(e=>!a.some(t=>Kr(e[0],t[0])));return ni([...a,...o])}),z(`ToString`,1,e=>Un(L(R(e,0,`ToString`),!0))),{...Is(`TLCEval`,1,(e,t)=>{let n=lm(Ls(e,0,`TLCEval`)());return t===void 0&&cm(n),n}),isStateLevel:!1},z(`Permutations`,1,e=>{let t=ps(R(e,0,`Permutations`),`Permutations`).elements;return Yr(sm(t).map(e=>ti(t.map((t,n)=>[t,e[n]]))))}),vs(`SortSeq`,2,e=>{let t=R(e,0,`SortSeq`),n=Ui(t);if(!n)throw fs(`first`,`SortSeq`,`natural number`,t);let r=gs(e,1,`SortSeq`),i=(e,t)=>{let n=r.call([e,t]);if(typeof n==`boolean`)return n;throw fs(`second`,`SortSeq`,`boolean function`,n)},a=n.slice(0,1);return n.slice(1).forEach(e=>{let t=a.length;for(;t>0&&i(e,a[t-1]);)t--;a.splice(t,0,e)}),fi(a)}),n.version===`1.7.4`?As({...ys(`TLCGet`,1,(e,t)=>om(n,R(e,0,`TLCGet`),t)),isLevelConstant:!0},`public static tlc2.value.impl.Value tlc2.module.TLC.TLCGet(tlc2.value.impl.Value)`):As(Is(`TLCGet`,1,(e,t)=>om(n,Ls(e,0,`TLCGet`)(),t)),`public static tlc2.value.impl.Value tlc2.module.TLCGetSet.TLCGetEval(tlc2.tool.impl.Tool,tla2sany.semantic.ExprOrOpArgNode[],tlc2.util.Context,tlc2.tool.TLCState,tlc2.tool.TLCState,int,tlc2.tool.coverage.CostModel)`),ys(`TLCSet`,2,t=>(Jp(n,e,R(t,0,`TLCSet`),R(t,1,`TLCSet`)),!0)),_s(`Any`,Xn),z(`RandomElement`,1,e=>Ap(R(e,0,`RandomElement`),n.getRandom()))],dm=`----------------------------- MODULE Bags --------------------------------
405
405
  (**************************************************************************)
406
406
  (* A bag, also called a multiset, is a set that can contain multiple *)
407
407
  (* copies of the same element. A bag can have infinitely many elements, *)
@@ -1778,16 +1778,16 @@ _TEPosition ==
1778
1778
  ELSE TLCGet("level") + 1
1779
1779
 
1780
1780
  =============================================================================
1781
- `]]),mm=(e=`master`)=>e===`1.7.4`?pm:fm,hm=(e,t)=>e.every(e=>Ji(e,t)),gm=Yr([!1,!0]);Wr(gm);const _m=(e,t,n)=>{if(n-t===1)return e[t];let r=t+n>>1;return ei(_m(e,t,r),_m(e,r,n))},vm=[`\\cup`,`\\cap`,`\\`],ym=e=>typeof e==`object`&&e.kind===`MixedSet`,bm=e=>e.kind===`Interval`||e.kind===`Set`&&e.isNormalized,xm=(e,t,n)=>{t.kind===`Interval`&&Ri(t);let r=t.kind===`Interval`?t:Ur(t);if(e!==`\\cup`){let i=e===`\\cap`,a=[];return un(r,e=>{Ji(e,n)===i&&cn(a,e)}),bm(t)?ar(a):Xr(a)}if(Fi(t))return n;if(!fn(n))return pr({kind:`SetOperation`,operator:e,left:t,right:n});let i=[];return un(r,e=>cn(i,e)),un(n.kind===`Interval`?n:F(n).elements,e=>{Ji(e,t)||cn(i,e)}),Xr(i)},Sm=(e,t)=>{let n=(t,n)=>hs([Ls(t,n,e)()],0,e);return{...z(e,2,e=>t(n(e,0),()=>n(e,1))),evaluateBinary:void 0,isLazy:!0}},Cm=[_s(`TRUE`,!0),_s(`FALSE`,!1),_s(`BOOLEAN`,gm),_s(`STRING`,{kind:`InfiniteSet`,name:`STRING`}),bs(`=`,Kr),bs(`#`,(e,t)=>!Kr(e,t)),z(`~`,1,e=>!hs(e,0,`~`)),z(`<=>`,2,e=>hs(e,0,`<=>`)===hs(e,1,`<=>`)),Sm(`/\\`,(e,t)=>e&&t()),Sm(`\\/`,(e,t)=>e||t()),Sm(`=>`,(e,t)=>!e||t()),z(`\\in`,2,e=>Ji(R(e,0,`\\in`),R(e,1,`\\in`))),z(`\\notin`,2,e=>!Ji(R(e,0,`\\notin`),R(e,1,`\\notin`))),bs(`\\subseteq`,(e,t)=>{if(!dn(e))throw new w(`\\subseteq expects a set but received ${L(e)}`);if(typeof e==`object`&&e.kind===`Subset`&&typeof t==`object`&&t.kind===`Subset`&&P(e.base))return hm(F(e.base).elements,t.base);if(typeof e==`object`&&e.kind===`Interval`){if(typeof t==`object`&&t.kind===`Interval`&&t.low<=e.low&&t.high>=e.high)return!0;for(let n=e.low;n<=e.high;n++)if(!Ji(n,t))return!1;return!0}return!ki(e,e=>!Ji(e,t))}),...vm.map(e=>z(e,2,t=>{let n=R(t,0,e),r=R(t,1,e),i=e!==`\\cup`&&typeof r==`object`&&r.kind===`Interval`&&typeof n==`object`&&n.kind!==`Interval`;if(fn(n)&&fn(r)&&!ym(n)&&!ym(r)&&!i&&!ln(n)&&!ln(r)){if(e===`\\cup`&&Fi(n))return r;let t=e===`\\cup`?ei:e===`\\cap`?$r:Qr;return Ki((n,r)=>{let i=F(n),a=F(r),o=t(i,a);if(e===`\\cup`){let e=Ur(i),t=Qr(a,i).elements,n=e===i.elements&&(t.length===0||$n(e[e.length-1],t[0])<0);if(e.length+t.length>on())throw new u(sn());if(n&&!i.isNormalized)return o;let r=o===i?ir(o.elements):o;return n||(r.writtenElements=[...e,...t]),r}return o===n||(o.isNormalized=bm(n),i.writtenElements&&!i.isNormalized&&(o.writtenElements=i.writtenElements.filter(e=>Ji(e,o)))),o},(t,n)=>xm(e,t,n),n,r)}return fn(n)?xm(e,n,r):e!==`\\`&&fn(r)?xm(e,r,n):pr({kind:`SetOperation`,operator:e,left:n,right:r})})),z(`SUBSET`,1,e=>({kind:`Subset`,base:R(e,0,`SUBSET`)})),z(`UNION`,1,e=>{let t=R(e,0,`UNION`),n=hn(t)?Ur(t):[],r=n.filter(hn);if(!hn(t)||r.length!==n.length)return pr({kind:`Union`,base:t});let i=r.flatMap(Ur),a=()=>{let e={kind:`MixedSet`,elements:[]};return i.forEach(t=>{Ji(t,e)||cn(e.elements,t)}),Xr(e.elements)};return ym(t)||r.some(ym)?a():r.length===0?Zr:Ki(e=>Hi(_m(e,0,e.length),i),a,r.map(F),void 0)}),z(`DOMAIN`,1,e=>{let t=R(e,0,`DOMAIN`);if(!pn(t))throw new w(`DOMAIN expects a function but received ${L(t)}`);return ha(t)})],wm=Ms(`Integers`,`Neg`,`IntValue`,1),Tm=e=>{let n=Ms(e,`DotDot`,`IntervalValue`,2);return[Ns(e,`+`,`Plus`,(e,t)=>e+t),Ns(e,`-`,`Minus`,(e,t)=>e-t),Ns(e,`*`,`Times`,(e,t)=>e*t),Ns(e,`^`,`Expt`,(e,n)=>{if(n<0)throw new t(`The second argument of ^ should be a natural number, but instead it is:\n${n}`);if(e===0&&n===0)throw new t(`0^0 is undefined.`);return e**n}),Ns(e,`\\div`,`Divide`,(e,n)=>{if(n===0)throw new t(`The second argument of \\div is 0.`);let r=Math.floor(e/n);if(xs(r))throw Ss(`${e} \\div ${n}`);return r}),Ns(e,`%`,`Mod`,(e,n)=>{if(n<=0)throw new t(`The second argument of % should be a positive number, but instead it is:\n${n}`);return(e%n+n)%n}),z(`..`,2,e=>{let t=R(e,0,`..`),r=js(R(e,1,`..`),n);return{kind:`Interval`,low:js(t,n),high:r}})]},Em=Tm(`Naturals`),Dm=Tm(`Integers`),Om=e=>{let t=Em.indexOf(e);return t===-1?void 0:Dm[t]},km=e=>{let t=(t,n=`tlc2.value.IBoolValue`)=>`public static ${n} tlc2.module.${e}.${t}(tlc2.value.impl.Value,tlc2.value.impl.Value)`,n=e===`Integers`;return[As(Fs(`<`,(e,t)=>e<t),t(`LT`)),As(Fs(`>`,(e,t)=>e>t),n?t(`GT`,`tlc2.value.impl.BoolValue`):t(`GT`)),As(Fs(`<=`,(e,t)=>e<=t),t(`LE`)),As(Fs(`>=`,(e,t)=>e>=t,n?`>=`:`>`),t(`GEQ`))]},Am=[_s(`Nat`,{kind:`InfiniteSet`,name:`Nat`}),...Em,...km(`Naturals`)],jm=[_s(`Int`,{kind:`InfiniteSet`,name:`Int`}),...Dm,...km(`Integers`),z(`-.`,1,e=>{let t=js(R(e,0,`-`),wm);if(xs(-t))throw Ss(`-${t}`);return-t})],Mm=(e,n,r)=>{let i=R(e,n,r),a=Ui(i);if(!a)throw new t(`${r}\n${N(L(i))}`);return a},Nm=(e,t,n)=>{let r=R(e,t,n);return typeof r==`string`?r:Mm(e,t,n)},Pm=(e,t,n)=>{let r=R(e,t,`SubSeq`);if(typeof r!=`number`)throw fs(n,`SubSeq`,`natural number`,r);return r},Fm=(e,t,n)=>typeof e==`string`?Un(e.slice(t,n)):fi(e.slice(t,n)),Im=(e,t)=>`The ${e}argument of ${t} should be a sequence, but instead it is:`,Lm=(e,t)=>`Evaluating an expression of the form ${e} when s is not a ${t}:`,Rm=(e,t)=>{let n=pc.get(e);return n?t.map(e=>{let t=n.get(e.name);return t?As(e,t):e}):t},zm=e=>Rm(`Sequences`,[z(`Seq`,1,e=>({kind:`SequenceSet`,base:R(e,0,`Seq`)})),z(`Len`,1,e=>Nm(e,0,Im(``,`Len`)).length),z(`\\o`,2,e=>{let n=Nm(e,0,Lm(`s \\o t`,`sequence`));if(typeof n!=`string`){let t=Mm(e,1,Lm(`t \\o s`,`sequence`)),r=n.length===0?R(e,1,`\\o`):t.length===0?R(e,0,`\\o`):void 0;return r!==void 0&&lr(r)===`tuple`?r:fi([...n,...t])}let r=R(e,1,`\\o`);if(typeof r!=`string`)throw new t(`${Lm(`t \\o s`,`string`)}\n${N(L(r))}`);return Un(n+r)}),z(`Append`,2,t=>fi([...Mm(t,0,Lm(e===`1.7.4`?`Append(v, s)`:`Append(s, v)`,`sequence`)),R(t,1,`Append`)])),z(`Head`,1,e=>{let n=Mm(e,0,Im(``,`Head`));if(n.length===0)throw new t(`Attempted to apply Head to the empty sequence.`);return n[0]}),z(`Tail`,1,e=>{let n=Nm(e,0,Im(``,`Tail`));if(n.length===0)throw new t(`Attempted to apply Tail to the empty sequence.`);return Fm(n,1)}),z(`SubSeq`,3,e=>{let n=Nm(e,0,Im(`first `,`SubSeq`)),r=Pm(e,1,`second`),i=Pm(e,2,`third`);if(r>i)return Fm(n,0,0);let a=r<1||r>n.length?{position:`second`,value:r}:i>n.length?{position:`third`,value:i}:void 0;if(a)throw new t(`The ${a.position} argument of SubSeq must be in the domain of its first argument:\n${N(L(R(e,0,`SubSeq`)))}\n, but instead it is\n${a.value}`);return Fm(n,r-1,i)}),vs(`SelectSeq`,2,e=>{let n=gs(e,1,`SelectSeq`);return fi(Mm(e,0,Im(`first `,`SelectSeq`)).filter(e=>{let r=n.call([e]);if(typeof r!=`boolean`)throw new t(`The second argument of SelectSeq should be a boolean-valued operator, but instead it is:\n<Operator ${n.name}>`);return r}))})]),Bm=e=>Rm(`FiniteSets`,[z(`IsFiniteSet`,1,e=>Bi(R(e,0,`IsFiniteSet`))),z(`Cardinality`,1,n=>{let r=R(n,0,`Cardinality`);if(!dn(r)||typeof r==`object`&&(r.kind===`InfiniteSet`||r.kind===`SequenceSet`))throw new t(`Attempted to compute cardinality of the value\n${N(L(r))}`);return Ri(r,e)})]),Vm=[As(z(`Warshall`,1,e=>{let n=R(e,0,`Warshall`);if(!dn(n)||Kn(n))throw new t(`Applying TransitiveClosure to the following value,\nwhich is not an enumerable set:\n${N(L(n))}`);Ri(n);let r=[],i=/* @__PURE__ */ new Map,a=e=>{let t=Pa(e),n=i.get(t)??r.length;return n===r.length&&(i.set(t,n),r.push(e)),n},o=F(n).elements.map(e=>{let n=Ui(e);if(n?.length!==2)throw new t(`Attempted to apply TransitiveClosure to a set containing\nthe following value:\n${N(L(e))}`);return[a(n[0]),a(n[1])]}),s=r.map(()=>r.map(()=>!1));o.forEach(e=>{s[e[0]][e[1]]=!0});for(let e=0;e<r.length;e++)for(let t=0;t<r.length;t++)if(s[t][e])for(let n=0;n<r.length;n++)s[e][n]&&(s[t][n]=!0);return Xr(r.flatMap((e,t)=>r.flatMap((n,r)=>s[t][r]?[fi([e,n])]:[])))}),`public static tlc2.value.impl.Value tlc2.module.TransitiveClosure.Warshall(tlc2.value.impl.Value)`)],Hm=(e,t,n,r,i,a)=>{if(e===`TransitiveClosure`)return Vm;if(e===`AnySet`)return[_s(`ANY`,Xn)];if(e===`IOUtils`)return lp(r,a);if(e===`_TLCTrace`)return fp(r);if(!mm(n.version).has(e))return;let o=Gm(e,t,n,r,i);return e===`Randomization`&&o?[...o,Lp(n)]:o},Um=/* @__PURE__ */ new Map([[`Integers`,[`Naturals`]],[`Sequences`,[`Naturals`]],[`FiniteSets`,[`Naturals`,`Sequences`]],[`TLC`,[`Naturals`,`Sequences`,`FiniteSets`]],[`Randomization`,[`Naturals`,`FiniteSets`,`Sequences`]],[`_Possible`,[`TLC`,`TLCExt`,`Naturals`,`Sequences`,`FiniteSets`,`Integers`]],[`Json`,[`Sequences`,`FiniteSets`,`TLC`,`Naturals`]],[`Bags`,[`Naturals`]],[`TLCExt`,[`TLC`,`Integers`,`Naturals`,`Sequences`,`FiniteSets`]]]),Wm=/* @__PURE__ */ new Map([[`Integers`,[`Naturals`]]]),Gm=(e,t,n,r,i)=>{switch(e){case`Naturals`:return Am;case`Integers`:return jm;case`Sequences`:return zm(n.version);case`FiniteSets`:return Bm(n.version);case`TLC`:return Rm(`TLC`,um(t,n));case`Randomization`:return Rp(n);case`_Possible`:return $p(t,n);case`Json`:return cp(r);case`Bags`:return Rm(`Bags`,Nf(i));case`TLCExt`:return Rm(`TLCExt`,Qp(t,n));default:return}},Km=(e,t,n)=>{let r=e.callStack;if(!r)return n();let i=r.expressions.at(-1)!==t&&au.get(t)||[];r.expressions.push(...i,t);let a=Gi.sets,o=a??[],s=o.length;Gi.sets=o;try{return n()}catch(e){throw bv(r,o.slice(s),e),e}finally{r.isFrozen||(r.expressions.length-=i.length+1),o.length=s,Gi.sets=a}},qm=(e,t,n)=>e.coverage?Go(e.coverage,t,n):-1,Jm=(e,t,n)=>e.coverage?qo(e.coverage,t,n):n(),Ym=(e,t,n,r)=>Jm(e,t,()=>W(n,r)),Xm=(e,t,n,r)=>{let i=Ym(e,t,n,r),a=e.coverage;if(a?.covered.has(n))for(let e=t;e!==-1;e=a.prefixes[e])a.primary[e]--;return i},Zm=(e,t,n)=>e.isInit?{environment:e.environment,scope:t,state:n,next:void 0}:{environment:e.environment,scope:t,state:e.current,next:n},Qm=e=>!e.includes(void 0),$m=e=>e.variables.map(()=>void 0),eh=(e,t,n)=>{let r=[...e];return r[t]=n,r},th=(e,t)=>{let n=e.operands[0].location,r=e.location.range,i=e.prefixEnds?.[t-2],a=r&&i?{...n,range:{...r,end:i}}:e.location;return{...e,operands:e.operands.slice(0,t),location:a}},nh=(e,t)=>e.coverage?e.coverage.prefixes[t]:-1,rh=e=>e.kind===`Identifier`?e.name:void 0,ih=(e,t,n)=>{if(t.kind===`Label`)return ih(e,t.body,n);let r=rh(t);if(r===void 0)return;let i=i_(n,r);if(i?.kind===`Thunk`)return ih(e,i.expression,i.scope);if(i)return;let a=e.variableIndex.get(r);if(a!==void 0)return a;let o=J_(r,e);return o?.kind===`Closure`&&o.params.length===0?ih(e,o.body,o.scope):void 0},ah=(e,t,n)=>{if(t.kind===`Prime`)return ih(e,t.expression,n);if(t.kind===`Label`)return ah(e,t.body,n);let r=rh(t);if(r===void 0)return;let i=i_(n,r);if(i?.kind===`Thunk`)return ah(e,i.expression,i.scope);if(i)return;let a=J_(r,e);return a?.kind===`Closure`&&a.params.length===0?ah(e,a.body,a.scope):void 0},oh=e=>{if(typeof e!=`boolean`)throw new w(`TLC expected a boolean expression.`);return e},sh=e=>!e.isEnabled&&(e.isInit||e.environment.runtime.isWarningEnabled),ch=(e,t,n,r)=>{let i=uh(e,t,n,r);return i&&e.coverage&&!e.isInit&&Ko(e.coverage,r),i},lh=(e,t,n)=>{let r=e.coverage;return r&&e.isInit&&(Ko(r,n),Ko(r,r.roots[n])),e.onState(t),!0},uh=(e,t,n,r)=>t===void 0?Qm(n)?lh(e,n,r):(e.onIncomplete?.(n),!1):Qm(n)&&sh(e)?fh(e,t,n,r):t.kind===`Predicate`?ph(e,t.expression,t.rest,t.scope,n,t.node):t.kind===`Unchanged`?kh(e,t.expression,t.rest,t.scope,n,t.node):dh(e,t,n)&&ch(e,t.rest,n,t.node),dh=(e,t,n)=>{let r=e.environment,i=Ym(e,t.node,t.expression,{environment:r,scope:t.scope,state:e.current,next:void 0}),a=(()=>{try{return Ym(e,t.node,t.expression,{environment:r,scope:t.scope,state:n,next:void 0})}catch(t){throw e.isEnabled?r_(t,r.runtime.version):t}})();try{return!Kr(i,a)}catch(t){throw e.callStack&&bv(e.callStack,[i],t),t}},fh=(e,t,n,r)=>{for(let i=t;i!==void 0;i=i.rest){if(i.kind===`Unchanged`)return kh(e,i.expression,i.rest,i.scope,n,i.node);if(!(i.kind===`Changed`?dh(e,i,n):oh(Ym(e,i.node,i.expression,Zm(e,i.scope,n))))){let t=e.coverage;return t&&e.isInit&&t.secondary[t.roots[r]]++,!1}}return lh(e,n,r)},ph=(e,t,n,r,i,a)=>mh(e,t,n,r,i,qm(e,a,t)),mh=(e,t,n,r,i,a)=>Km(e,t,()=>{switch(t.kind){case`Let`:{let o=Zm(e,r,i),s=t.definitions,c=e.coverage?dv(s,o,{impure:new Set(s),streamed:/* @__PURE__ */ new Set}):dv(s,o);return ph(e,t.body,n,c,i,a)}case`Label`:return ph(e,t.body,n,r,i,a);default:if(Ch.has(t.kind))throw new w(`The state relation is not a boolean expression.`);return Km(e,t,()=>Dh(e,t,n,r,i,a))}}),hh=(e,t,n,r,i)=>oh(t)&&ch(e,n,r,i),gh=/* @__PURE__ */ new Set([`=`,`#`,`~`,`<=>`,`/\\`,`\\/`,`=>`,`\\in`,`\\notin`,`\\subseteq`,`\\cup`,`\\cap`,`\\`,`SUBSET`,`UNION`,`DOMAIN`,`~>`,`-+->`,`\\cdot`]),_h=(e,t,n,r,i,a)=>{let o=Zm(e,r,i);if(t.kind===`Identifier`){let s=i_(r,t.name);if(s?.kind===`Thunk`&&s.cache===void 0){let t=e.coverage?.values.get(s)??a;return ph(e,s.expression,n,s.scope,i,t)}if(s?.kind===`Operator`&&s.operator.kind===`Closure`&&s.operator.params.length===0)return ph(e,s.operator.body,n,s.operator.scope,i,a);let c=s?void 0:e.environment.definitions.get(t.name),l=s?void 0:J_(t.name,e.environment);return l?.kind===`Closure`&&l.params.length===0&&!e.environment.variableIndex.has(t.name)&&!(c&&lf(c,e.environment))?ph(e,l.body,n,l.scope,i,a):hh(e,Xm(e,a,t,o),n,i,a)}let s=Y_(t,o);if(s?.kind===`Closure`&&s.params.length===t.args.length){let r=Jm(e,a,()=>sv(s,t.args,o));return ph(e,s.body,n,r,i,a)}let c=gh.has(t.operator)?Ym(e,a,t,o):Xm(e,a,t,o);return hh(e,c,n,i,a)},vh=(e,t,n,r,i,a)=>{let o=n[r];return o===void 0?ch(e,t,eh(n,r,i),a):Kr(o,i)&&ch(e,t,n,a)},yh=(e,t,n,r,i)=>({kind:e,expression:t,scope:n,node:r,rest:i}),bh=(e,t,n)=>(e.coverage&&Jo(e.coverage,t,n.length+1),n),xh=(e,t,n,r,i,a)=>{let[o,s]=t.args,c=e.isInit?ih(e.environment,o,r):ah(e.environment,o,r),l=Zm(e,r,i);if(c===void 0)return Ym(e,a,t,l)===!0&&ch(e,n,i,a);let u=Ym(e,a,s,l),d=i[c];if(t.operator===`=`)return vh(e,n,i,c,u,a);let f=t.operator===`\\subseteq`?{kind:`Subset`,base:u}:u;if(typeof f==`object`&&f!==u&&e.callStack?.sources.set(f,s),d!==void 0)return Ym(e,a,t,l)===!0&&ch(e,n,i,a);if(!hi(f))throw new w(`The right side of \\IN is not enumerable.`);return bh(e,f,Ai(f)).reduce((t,r)=>ch(e,n,eh(i,c,r),a)||t,!1)},Sh=/* @__PURE__ */ new Set([`=`,`\\in`,`\\subseteq`]),Ch=/* @__PURE__ */ new Set([`Number`,`Decimal`,`String`]),wh={Always:`[]`,Eventually:`<>`,WeakFairness:`WF`,StrongFairness:`SF`},Th=e=>{let t=e.kind===`Apply`&&(e.operator===`~>`||e.operator===`-+->`)?e.operator===`~>`?`a ~> b`:`a -+-> formula`:wh[e.kind];if(t!==void 0)return`In computing ENABLED, TLC encountered a temporal formula (${t}).\n${U(e)}`;if(e.kind===`UnboundedQuantifier`)return e.isTemporal?`In computing ENABLED, TLC encountered temporal quantifier.\n${U(e)}`:`In computing ENABLED, TLC encountered unbounded quantifier. Make sure that the expression is of form ${e.quantifier===`Forall`?`\\A`:`\\E`} x \\in S: P(x).\n${U(e)}`;if(e.kind===`Choose`&&e.set===void 0)return`In computing ENABLED, TLC encountered unbounded CHOOSE. Make sure that the expression is of form CHOOSE x \\in S: P(x).\n${U(e)}`},Eh=(e,t,n,r)=>{let i=[],a=e.environment.runtime.version,o=Jm(e,r,()=>w_(t.bounds,t=>{let r=W(t,n),i=x_(r,t,a);return Array.isArray(i)&&bh(e,r,i),i}));return E_(t.bounds,o,n.scope,e=>(i.push(e),!1)),i},Dh=(e,t,n,r,i,a)=>{let o=Zm(e,r,i);switch(t.kind){case`Identifier`:return _h(e,t,n,r,i,a);case`Apply`:return Sh.has(t.operator)&&t.args.length===2?xh(e,t,n,r,i,a):t.operator===`=>`&&t.args.length===2?oh(Ym(e,a,t.args[0],o))?ph(e,t.args[1],n,r,i,a):ch(e,n,i,a):_h(e,t,n,r,i,a);case`And`:{let o=t.operands;if(t.isBulleted||o.length===2){let t=o.slice(1).reduceRight((e,t)=>yh(`Predicate`,t,r,a,e),n);return ph(e,o[0],t,r,i,a)}let s=o[o.length-1];return mh(e,th(t,o.length-1),yh(`Predicate`,s,r,a,n),r,i,nh(e,a))}case`Or`:{let o=t.operands;if(t.isBulleted||o.length===2)return o.reduce((t,o)=>ph(e,o,n,r,i,a)||t,!1);let s=mh(e,th(t,o.length-1),n,r,i,nh(e,a)),c=ph(e,o[o.length-1],n,r,i,a);return s||c}case`Exists`:return Eh(e,t,o,a).reduce((r,o)=>ph(e,t.body,n,o,i,a)||r,!1);case`Forall`:{let r=Eh(e,t,o,a);if(r.length===0)return ch(e,n,i,a);let s=r.slice(1).reduce((e,n)=>yh(`Predicate`,t.body,n,a,e),n);return ph(e,t.body,s,r[0],i,a)}case`If`:return ph(e,oh(Ym(e,a,t.condition,o))?t.consequent:t.alternative,n,r,i,a);case`Case`:{let s=t.arms.find(t=>oh(Ym(e,a,t.condition,o)))?.body??t.other;if(s===void 0)throw new w(`TLC encountered a CASE with no conditions true.`);return ph(e,s,n,r,i,a)}case`FunctionApplication`:{let r=M_(Ym(e,a,t.function,e.isInit?o:c_(o)));if(r){let s=Jm(e,a,()=>N_(r,t,o));return ph(e,r.body,n,s,i,a)}break}case`Unchanged`:if(!e.isInit)return kh(e,t.expression,n,r,i,a);break;case`BoxAction`:if(!e.isInit){let o=ph(e,t.action,n,r,i,a);return kh(e,t.subscript,n,r,i,a)||o}break;case`AngleAction`:if(!e.isInit)return ph(e,t.action,yh(`Changed`,t.subscript,r,a,n),r,i,a)}let s=e.isEnabled?Th(t):void 0;if(s!==void 0)throw new w(s);return hh(e,Ym(e,a,t,o),n,i,a)},Oh=(e,t,n)=>e.runtime.warn(wt.unchangedVariableChanged,`The variable ${e.variables[t]} was changed while it is specified as UNCHANGED at\n${U(n)}`),kh=(e,t,n,r,i,a)=>Km(e,t,()=>{let o=qm(e,a,t),s=ih(e.environment,t,r);if(s!==void 0){let r=e.current?.[s];if(r===void 0)return!1;let a=i[s];return a!==void 0&&!Kr(a,r)?(Oh(e.environment,s,t),!1):vh(e,n,i,s,r,o)}if(t.kind===`Tuple`){let[a,...s]=t.elements;if(a===void 0)return ch(e,n,i,o);let c=s.reduceRight((e,t)=>yh(`Unchanged`,t,r,o,e),n);return kh(e,a,c,r,i,o)}if(t.kind===`Identifier`){let a=i_(r,t.name);if(a?.kind===`Thunk`)return kh(e,a.expression,n,a.scope,i,o);let s=a?void 0:J_(t.name,e.environment);if(s?.kind===`Closure`&&s.params.length===0)return kh(e,s.body,n,s.scope,i,o)}if(e.isEnabled&&t.kind===`Apply`){let a=Zm(e,r,i),s=Y_(t,a);if(s?.kind===`Closure`&&s.params.length===t.args.length)return kh(e,s.body,n,sv(s,t.args,a),i,o)}let c=e.environment,l=Ym(e,o,t,{environment:c,scope:r,state:e.current,next:void 0}),u=Ym(e,o,t,{environment:c,scope:r,state:i,next:void 0});return Kr(l,u)&&ch(e,n,i,o)}),Ah=(e,t,n,r,i)=>({environment:e,callStack:e.callStack,coverage:e.coverage,isInit:t===`init`,isEnabled:t===`enabled`,current:n,onState:r,onIncomplete:i}),jh=/* @__PURE__ */ Error(`The replay found a successor`),Mh=(e,t,n,r)=>{let i=()=>{throw jh},a=Ah(r,`enabled`,n,i,i),o=a.callStack,s=o?.expressions.length??0;try{if(e.kind===`AngleAction`&&e.location===e.action.location){let n=yh(`Changed`,e.subscript,t,-1,void 0);ph(a,e.action,n,t,$m(r),-1)}else ph(a,e,void 0,t,$m(r),-1);return!1}catch(e){if(e!==jh)throw e;return o&&(o.expressions.length=s,o.isFrozen=!1),!0}},Nh=(e,t,n,r)=>{let[i,...a]=e;if(i===void 0)return;let o=Ah(t,`init`,void 0,n,r),s=a.reduceRight((e,t)=>yh(`Predicate`,t.expression,t.scope,t.node??-1,e),void 0);ph(o,i.expression,s,i.scope,$m(t),i.node??-1)},Ph=(e,t,n,r)=>{e.some(e=>Ch.has(e.expression.kind))||e.forEach(e=>{let i=[];Fh(e,-1,t,n,e=>i.push(e)),i.forEach(t=>r(t,e))})},Fh=(e,t,n,r,i,a)=>{let o=Ah(r,`next`,n,i,a);ph(o,e.expression,void 0,e.scope,$m(r),t)},Ih=(e,t)=>{let n=[],r=e=>({environment:t,scope:e,state:void 0,next:void 0}),i=(e,r)=>{if(ih(t,e,void 0)!==void 0&&e.kind===`Identifier`){n.push(e);return}if(e.kind===`Tuple`){e.elements.forEach(e=>i(e,r));return}if(e.kind!==`Identifier`)return;let a=i_(r,e.name)?void 0:J_(e.name,t);a?.kind===`Closure`&&a.params.length===0&&i(a.body,a.scope)},a=(e,o,s)=>{switch(e.kind){case`Let`:a(e.body,dv(e.definitions,r(o)),s);return;case`Label`:a(e.body,o,s);return;case`FunctionApplication`:a(e.function,o,s);return;case`If`:a(e.consequent,o,s),a(e.alternative,o,s);return;case`Case`:e.arms.forEach(e=>a(e.body,o,s)),e.other&&a(e.other,o,s);return;case`And`:case`Or`:e.operands.forEach(e=>a(e,o,s));return;case`Exists`:case`Forall`:a(e.body,o,s);return;case`Unchanged`:i(e.expression,o);return;case`AngleAction`:a(e.action,o,s);return;case`BoxAction`:a(e.action,o,s),n.push(e.subscript);return;case`Identifier`:case`Apply`:{if(e.kind===`Apply`){if(e.operator===`=>`){e.args.forEach(e=>a(e,o,s));return}if(e.operator===`=`||e.operator===`\\in`){ah(t,e.args[0],o)!==void 0&&n.push(e);return}}let i=e.kind===`Identifier`?e.name:e.operator,c=i_(o,i);if(c?.kind===`Thunk`){a(c.expression,c.scope,s);return}let l=e.kind===`Apply`?Y_(e,r(o)):c?.kind===`Operator`?c.operator:c?void 0:J_(i,t);if(l?.kind!==`Closure`||s.has(l.body)||t.definitions.get(i)?.isRecursive)return;let u=e.kind===`Apply`?e.args:[];if(l.params.length!==u.length)return;s.add(l.body),a(l.body,sv(l,u,r(o)),s),s.delete(l.body)}}};return e.forEach(e=>a(e.expression,e.scope,/* @__PURE__ */ new Set)),n.flatMap(e=>e.location.range??[])},Lh=/* @__PURE__ */ new WeakMap,Rh=/* @__PURE__ */ new WeakMap,zh=(e,t,n)=>e.isInit?{environment:e.environment,scope:t,state:n,next:void 0}:{environment:e.environment,scope:t,state:e.current,next:n},Bh=(e,t,n)=>{let r=e.slice();return r[t]=n,r},Vh=e=>e.isInit?`initial states`:e.isEnabled?`ENABLED`:`next states`,Hh=(e,t)=>{let n=new w(t);return e.isInit?n:x(n,S.error)},Uh=(e,t,n,r)=>{let i=qg(n);return r&&Ch.has(n.kind)?e.isEnabled?`Attempted to compute ENABLED on a non-boolean expression.\n${i}`:`The ${e.isInit?`init`:`next`} state relation is not a boolean expression.\n${i}`:`In computing ${Vh(e)}, TLC expected a boolean expression,\nbut instead found ${L(t)}.\n${i}`},Wh=(e,t,n)=>{let r=Os(t),i=U(n);return e.isEnabled?`In computing ENABLED, a non-boolean expression(${r}) was used as the guard condition of an IF.\n${i}`:`In computing ${Vh(e)}, a non-boolean expression (${r}) was used as the condition of an IF.${e.isInit?`
1782
- `:``}${i}`},Gh=(e,t,n)=>Jh(e,t,W(t,n)),Kh=new Set(Cm.map(e=>e.name)),qh=e=>e.kind===`Apply`?Kh.has(e.operator):e.kind!==`Identifier`&&!Ch.has(e.kind),Jh=(e,t,r,i=!0)=>{if(typeof r==`boolean`)return r;let a=Uh(e,r,t,i);throw e.isInit&&i&&qh(t)?new n(a):Hh(e,a)},Yh=(e,t,n,r)=>r.environment.callStack?W(n,r):(e[t]??=Dv(n,r.environment))(r),Xh=e=>e===`=`||e===`\\in`||e===`\\subseteq`,Zh=(e,t,n)=>{let r=n?Lh:Rh,i=r.get(e);if(i)return i;let a=jg(e,t,n),o=n?void 0:Ag(e,t),s=o?(e,t,n,r,i,s)=>(e.generator?o:a)(e,t,n,r,i,s):a;return r.set(e,s),s},Qh=(e,t)=>{if(t.constants.has(e))return;let n=h_(e,t);return n?.kind===`Operator`&&n.params.length===0?n:void 0},$h=(e,t,n,r=/* @__PURE__ */ new Set)=>{if(e.kind===`Prime`&&n)return $h(e.expression,t,!1,r);if(e.kind!==`Identifier`||M(e))return;let i=t.variableIndex.get(e.name);if(i!==void 0)return n?void 0:i;let a=Qh(e.name,t);if(a&&!r.has(a))return r.add(a),$h(a.body,t,n,r)},eg=(e,t,n)=>$h(e,t,!n),tg=(e,t,n,r,i)=>{if(e.kind===`Prime`&&i)return tg(e.expression,t,n,r,!1);if(e.kind===`Let`){let a=dv(e.definitions,zh(r,t,n));return tg(e.body,a,n,r,i)}if(e.kind!==`Identifier`)return;let a=i_(t,e.name);if(a?.kind===`Thunk`&&!a.isReleased)return tg(a.expression,a.scope,n,r,i);if(a)return;let o=r.environment.variableIndex.get(e.name);if(o!==void 0)return i?void 0:o;let s=Qh(e.name,r.environment);if(s)return tg(s.body,void 0,n,r,i)},ng=(e,t)=>e.kind===`Let`||e.kind===`Identifier`&&(t||M(e))||!t&&e.kind===`Prime`,rg=(e,t,n=/* @__PURE__ */ new Set)=>{if(e.kind===`Tuple`){let r=e.elements.map(e=>rg(e,t,n));return r.every(e=>e!==void 0)?r.flat():void 0}if(e.kind!==`Identifier`||n.has(e.name))return;let r=t.variableIndex.get(e.name);if(r!==void 0)return[{index:r,expression:e}];let i=Qh(e.name,t);if(i)return n.add(e.name),rg(i.body,t,n)},ig=/* @__PURE__ */ new Set([`Label`,`And`,`Or`,`Exists`,`Forall`,`If`,`Case`,`Let`,`Unchanged`,`BoxAction`,`AngleAction`,`FunctionApplication`]),ag=(e,t,n)=>ig.has(e.kind)?!1:e.kind===`Identifier`?t.variableIndex.has(e.name)||t.constants.has(e.name):e.kind===`Apply`?e.operator===`=>`||Xh(e.operator)&&(ng(e.args[0],n)||eg(e.args[0],t,n)!==void 0)||M(e)?!1:t.definitions.get(t.substitutions.get(e.operator)??e.operator)===void 0&&t.builtins.has(e.operator):!0,og=/* @__PURE__ */ new Set,sg=(e,t)=>{if(M(e))return e.kind===`Identifier`?t.has(e.name)?[]:[e.name]:void 0;let n=[],r=!0;return mu(e,(e,i)=>{let a=r?sg(e,i.length===0?t:/* @__PURE__ */ new Set([...t,...i])):[];a?n.push(...a):r=!1}),r?n:void 0},cg=(e,t,n)=>{if(e.kind===`Or`||e.kind===`Exists`)return!0;let r=e.kind===`Identifier`?e.name:e.kind===`Apply`?e.operator:void 0,i=r===void 0||M(e)?void 0:h_(r,t);return i&&!n.has(i)&&(n.add(i),cg(i.body,t,n))?!0:mt(e).some(e=>cg(e,t,n))},lg=(e,t,n)=>{if(e.kind===`Apply`&&e.operator===`=`){let r=eg(e.args[0],t,n);if(r!==void 0)return{kind:`Assign`,expression:e,index:r,value:e.args[1]}}if(!n&&e.kind===`Unchanged`){let n=rg(e.expression,t);if(n)return{kind:`Unchanged`,expression:e,variables:n}}return ag(e,t,n)?{kind:`Guard`,expression:e}:{kind:`Branch`,expression:e,runner:Zh(e,t,n)}},ug=(e,t)=>{if(e.bounds.length<2||e.body.kind!==`And`)return;let n=e.bounds.flatMap(e=>e.pattern.kind===`Name`?[e.pattern.name]:[]);if(n.length!==e.bounds.length)return;let r=new Set(n.slice(0,-1)),i=e.body.operands,a=i.findIndex(e=>{if(gf(e,t)===void 0||cg(e,t,/* @__PURE__ */ new Set))return!0;let n=sg(e,og);return!n||n.some(e=>r.has(e))}),o=a===-1?i.length:a;if(o!==0)return{names:n,guards:i.slice(0,o),rest:i.slice(o)}},dg=(e,t,n)=>{let r=e.map(e=>lg(e,t,n)),i=[],a=[],o=(e,t,n,s,c,l)=>{let u=s,d,f=sh(t);for(let s=e;s<r.length;s++){if(s>0&&f&&Ng(u)){d??=zh(t,n,u);for(let e=s;e<r.length;e++){let n=r[e],i=t.current,o=i&&n.kind===`Unchanged`?n.variables.find(e=>{let t=u[e.index];return t!==void 0&&!Kr(t,i[e.index])}):void 0;if(o){Oh(t.environment,o.index,o.expression);return}let s=n.expression,c=Yh(a,e,s,d);if(!Jh(t,s,c,!1)){t.onUnsatisfied?.(u,s);return}}l(u,c);return}let e=r[s];if(e.kind===`Guard`){d??=zh(t,n,u);let r=Yh(i,s,e.expression,d);if(!Jh(t,e.expression,r))return;continue}if(e.kind===`Assign`){d??=zh(t,n,u);let r=Yh(i,s,e.value,d),a=u[e.index];if(a===void 0)u=Bh(u,e.index,r),d=void 0;else if(!Kr(a,r))return;continue}if(e.kind===`Unchanged`){let n=t.current;if(!n)return;let r;for(let i of e.variables){let e=(r??u)[i.index];if(e===void 0)r??=u.slice(),r[i.index]=n[i.index];else if(!Kr(e,n[i.index])){Oh(t.environment,i.index,i.expression);return}}r&&(u=r,d=void 0);continue}let p=s+1;e.runner(t,n,u,c,!0,(e,r)=>o(p,t,n,e,r,l));return}l(u,c)};return(e,t,n,r,i,a)=>o(0,e,t,n,r,a)},fg=e=>{let t=Th(e);return(n,r,i,a,o,s)=>{if(n.isEnabled&&t!==void 0)throw Hh(n,t);Gh(n,e,zh(n,r,i))&&s(i,a)}},pg=(e,t)=>{let n=e.args[1];return(r,i,a,o,s,c)=>{let l=t(r,i,a),u=zh(r,i,a);if(a[l]!==void 0){Gh(r,e,u)&&c(a,o);return}let d=W(n,u),f=e.operator===`\\subseteq`?{kind:`Subset`,base:d}:d;if(!hi(f)){let t=r.isEnabled?`The right side of \\IN is not enumerable.`:`In computing ${Vh(r)}, the right side of \\IN is not enumerable.`;throw Hh(r,`${t}\n${U(e)}`)}let p=Ai(f);if(r.generator){for(let e of kp(p.length,f,r.environment.runtime.getRandom(),r.environment.runtime.version))if(c(Bh(a,l,e),o),r.successors>0||r.isStopped)return}for(let e=0;e<p.length&&!r.isStopped;e++)c(Bh(a,l,p[e]),o)}},mg=/* @__PURE__ */ new WeakMap,hg=e=>{let t=mg.get(e);if(t)return t;let n=e.kind===`Tuple`?{kind:`And`,operands:e.elements.map(hg),location:e.location}:{kind:`Unchanged`,expression:e,location:e.location};return mg.set(e,n),n},gg=(e,t)=>{let n=e.args[0],r=fg(e),i=(e,r,i)=>tg(n,r,i,e,!t)??-1,a=pg(e,i);return(t,n,o,s,c,l)=>{let u=i(t,n,o);if(u===-1||o[u]!==void 0){r(t,n,o,s,c,l);return}if(e.operator!==`=`){a(t,n,o,s,c,l);return}let d=W(e.args[1],zh(t,n,o));l(Bh(o,u,d),s)}},_g=(e,t,n)=>{let r=U(e);return(i,a,o,s,c,l)=>{let u=zh(i,a,o),d=W(e.function,n?u:c_(u)),f=M_(d);if(f!==void 0){Zh(f.body,t,n)(i,N_(f,e,u),o,s,c,l);return}if(!pn(d))throw Hh(i,`In computing ${Vh(i)}, a non-function (${Os(d)}) was applied as a function.\n${r}`);let p=W(e,u);if(typeof p!=`boolean`)throw Hh(i,`In computing ${Vh(i)}, TLC expected a boolean expression,\nbut didn't find one.\n${r}`);p&&l(o,s)}},vg=(e,t)=>{let n=hg(e);return rg(e,t)?dg([n],t,!1):e.kind===`Tuple`?Zh(n,t,!1):(r,i,a,o,s,c)=>{let l=e.kind===`Identifier`?i_(i,e.name):void 0;if(l?.kind===`Thunk`&&!l.isReleased){Zh(hg(l.expression),t,!1)(r,l.scope,a,o,s,c);return}let u=zh(r,i,a);if(r.isEnabled&&e.kind===`Apply`){let n=Y_(e,u);if(n?.kind===`Closure`&&n.params.length===e.args.length){Zh(hg(n.body),t,!1)(r,sv(n,e.args,u),a,o,s,c);return}}Gh(r,n,u)&&c(a,o)}},yg=(e,t,n)=>{let r=e.operator,i=fg(e),a=M(e)?void 0:J_(r,t);if(a?.kind===`Builtin`)return i;if(a?.kind===`Closure`){let i=Mv(a,e.args,t),o;return(e,s,c,l,u,d)=>{o??=Zh(a.body,t,n),o(e,i(zh(e,s,c)),c,u?l:r,u,d)}}return(a,o,s,c,l,u)=>{let d=zh(a,o,s),f=Y_(e,d);f?.kind===`Closure`?Zh(f.body,t,n)(a,sv(f,e.args,d),s,l?c:r,l,u):i(a,o,s,c,l,u)}},bg=(e,t,n)=>{let r=fg(e),i=M(e)?void 0:Qh(e.name,t),a;return(o,s,c,l,u,d)=>{let f=i_(s,e.name);f?.kind===`Thunk`&&!f.isReleased?Zh(f.expression,t,n)(o,f.scope,c,l,u,d):f||!i||e.location.range&&U_(i,t)!==void 0?r(o,s,c,l,u,d):(a??=Zh(i.body,t,n),a(o,void 0,c,u?l:i.name,u,d))}},xg=(e,t)=>{if(e.kind!==`Apply`||e.operator!==`=`||M(e))return;let n=e.args[0],r=e.args[1];if(n.kind!==`FunctionApplication`||r.kind!==`String`)return;let i=n.args.length===1?n.args[0]:void 0;if(i?.kind!==`Identifier`||!M(i))return;let a=$h(n.function,t,!1);if(a!==void 0)return{variable:a,argument:i.name,labels:/* @__PURE__ */ new Set([r.value])}},Sg=e=>e.kind===`And`?e.operands.flatMap(Sg):[e],Cg=(e,t)=>(e.kind===`Identifier`||e.kind===`Apply`&&(e.operator===`=`||e.operator===`#`))&&ag(e,t,!1),wg=e=>{let t=[];return(n,r,i)=>{let a=zh(n,r,i);for(let r=0;r<e.length;r++){let i=e[r];if(!Jh(n,i,Yh(t,r,i,a)))return}}},Tg=(e,t,n)=>{if(n.has(e))return;if(n.add(e),e.kind===`And`){let n=Sg(e),r=n.findIndex(e=>!Cg(e,t)||xg(e,t)),i=r===-1?void 0:xg(n[r],t);return i?{...i,before:r===0?void 0:wg(n.slice(0,r))}:void 0}if(e.kind===`Or`){let r=e.operands.map(e=>Tg(e,t,n)),i=r[0],a=r.every(e=>e!==void 0&&e.before===void 0&&e.variable===i?.variable&&e.argument===i.argument);if(!i||!a)return;let o=new Set(r.flatMap(e=>[...e?.labels??[]]));return{variable:i.variable,argument:i.argument,labels:o,before:void 0}}if(e.kind!==`Apply`||M(e))return;let r=J_(e.operator,t);if(r?.kind!==`Closure`||r.scope!==void 0)return;let i=Tg(r.body,t,n),a=r.params.findIndex(e=>e.arity===0&&e.name===i?.argument),o=e.args[a];if(!i||o?.kind!==`Identifier`||!M(o))return;let s=i.before,c=s&&Mv(r,e.args,t);return{variable:i.variable,argument:o.name,labels:i.labels,before:s&&c&&((e,t,n)=>s(e,c(zh(e,t,n)),n))}},Eg=(e,t,n)=>{let r=i_(t,n.argument),i=e.current?.[n.variable];if(r?.kind!==`Value`||typeof i!=`object`||i.kind!==`Function`)return;let a=i.domain.indexOf(r.value),o=a===-1?void 0:i.range[a];return typeof o==`string`?o:void 0},Dg=(e,t,n)=>{let r=e.map(e=>Zh(e,t,n)),i=n?[]:e.map(e=>Tg(e,t,/* @__PURE__ */ new Set)),a=i.find(e=>e!==void 0),o=i.map(e=>e?.variable===a?.variable&&e?.argument===a?.argument?e:void 0);return(e,t,n,i,s,c)=>{let l=a&&Eg(e,t,a);for(let a=0;a<r.length&&!e.isStopped;a++){let u=o[a];l!==void 0&&u?.labels.has(l)===!1?u.before?.(e,t,n):r[a](e,t,n,i,s,c)}}},Og=e=>(t,n,r,i,a,o)=>{let s=t.generator;if(!s)throw Error(`A random choice needs the run's generator`);let c=Math.floor(s.nextDouble()*e.length),l=yp(s);for(let s=0;s<e.length;s++)if(e[(c+s*l)%e.length](t,n,r,i,a,o),t.successors>0||t.isStopped)return},kg=(e,t)=>{let n=Zh(e.body,t,!1);return(r,i,a,o,s,c)=>{let l=zh(r,i,a),u=t.runtime.version,d=w_(e.bounds,e=>W(e,l)).map((n,r)=>kp(y_(n,e.bounds[r].set,u).length,n,t.runtime.getRandom(),u)),f=(t,i)=>{if(t<0)return n(r,i,a,o,s,c),r.successors>0||r.isStopped;let l=e.bounds[t].pattern;return d[t].some(e=>f(t-1,o_(i,l,e)))};f(d.length-1,i)}},Ag=(e,t)=>{if(e.kind===`Exists`)return kg(e,t);if(e.kind!==`Or`)return;let n=e.operands.map(e=>Zh(e,t,!1));return e.isBulleted?Og(n):n.reduce((e,t)=>Og([e,t]))},jg=(e,t,n)=>{let r=e=>Zh(e,t,n);switch(e.kind){case`And`:return dg(e.operands,t,n);case`Or`:return Dg(e.operands,t,n);case`Exists`:{let i=r(e.body),a=e.bounds[0];if(e.bounds.length===1&&a.pattern.kind===`Name`){let e=a.pattern.name;return(n,r,o,s,c,l)=>{let u=y_(W(a.set,zh(n,r,o)),a.set,t.runtime.version);for(let t=0;t<u.length&&!n.isStopped;t++)i(n,a_(r,e,u[t]),o,s,c,l)}}let o=n?void 0:ug(e,t);if(o){let r=dg(o.rest,t,n);return(n,i,a,s,c,l)=>{let u=zh(n,i,a),d=w_(e.bounds,e=>y_(W(e,u),e,t.runtime.version));if(d.some(e=>e.length===0))return;let f=(e,t)=>{if(e<0)r(n,t,a,s,c,l);else for(let r of d[e]){if(n.isStopped)return;let i=a_(t,o.names[e],r);if(e===d.length-1){let e=zh(n,i,a);if(!o.guards.every(t=>Gh(n,t,e)))continue}f(e-1,i)}};f(d.length-1,i)}}return(t,n,r,a,o,s)=>{D_(e.bounds,zh(t,n,r),e=>(i(t,e,r,a,o,s),t.isStopped))}}case`Forall`:{let i=r(e.body),a=!n&&gf(e,t)!==void 0&&!cg(e.body,t,/* @__PURE__ */ new Set)?sg(e,og):void 0;return(t,n,r,o,s,c)=>{let l=[];D_(e.bounds,zh(t,n,r),e=>(l.push(e),!1));let u=[...l.slice(0,1),...l.slice(1).reverse()];if(a?.every(e=>i_(n,e)?.kind===`Value`)){u.every(n=>Gh(t,e.body,zh(t,n,r)))&&c(r,o);return}let d=(n,r,a)=>{n===u.length?c(r,a):n>0&&t.isInit&&Ng(r)?u.slice(n).every(n=>Gh(t,e.body,zh(t,n,r)))&&c(r,a):i(t,u[n],r,a,!0,(e,t)=>d(n+1,e,t))};d(0,r,o)}}case`If`:{let t=r(e.consequent),n=r(e.alternative);return(r,i,a,o,s,c)=>{let l=W(e.condition,zh(r,i,a));if(typeof l!=`boolean`)throw Hh(r,Wh(r,l,e));(l?t:n)(r,i,a,o,s,c)}}case`Case`:{let t=e.arms.map(e=>({condition:e.condition,source:e.body,body:r(e.body)})),n=e.other?r(e.other):void 0;return(r,i,a,o,s,c)=>{let l=zh(r,i,a),u=t.find(e=>{let t=W(e.condition,l);if(typeof t==`boolean`)return t;throw Hh(r,`In computing ${Vh(r)}, a non-boolean expression${r.isEnabled?``:` `}(${Os(t)}) was used as a guard condition of a CASE.\n${qg(e.source)}`)})?.body??n;if(!u)throw Hh(r,`In computing ${Vh(r)}, TLC encountered a CASE with no conditions true.\n${U(e)}`);u(r,i,a,o,s,c)}}case`Let`:{let n=r(e.body),i=pv(e.definitions,t);return(t,r,a,o,s,c)=>n(t,dv(e.definitions,zh(t,r,a),i),a,o,s,c)}case`Unchanged`:return n?()=>{throw new w(`UNCHANGED appears in an initial predicate at ${Wg(e)}`)}:vg(e.expression,t);case`AngleAction`:{let n=r(e.action),i={kind:`Unchanged`,expression:e.subscript,location:e.subscript.location},a=(e,n,r)=>{try{return Gh(e,i,zh(e,n,r))}catch(n){throw e.isEnabled?r_(n,t.runtime.version):n}};return(e,t,r,i,o,s)=>n(e,t,r,i,o,(n,r)=>{a(e,t,n)||s(n,r)})}case`BoxAction`:return Dg([e.action,hg(e.subscript)],t,n);case`Label`:return r(e.body);case`Identifier`:return bg(e,t,n);case`FunctionApplication`:return _g(e,t,n);case`Apply`:{let i=e.args;if(Xh(e.operator)){let r=eg(i[0],t,n);if(r!==void 0)return e.operator===`=`?dg([e],t,n):pg(e,()=>r);if(ng(i[0],n))return gg(e,n)}if(e.operator===`=>`){let t=r(i[1]);return(n,r,a,o,s,c)=>{let l=W(i[0],zh(n,r,a));if(typeof l!=`boolean`){let t=Os(l),r=U(e);throw Hh(n,n.isInit?`In computing initial states of a predicate of form P => Q, P was ${t}\n.${r}`:n.isEnabled?`While computing ENABLED of an expression of the form P => Q, P was ${t}.\n${r}`:`In computing next states of a predicate of the form P => Q, P was\n${t}.\n${r}`)}l?t(n,r,a,o,s,c):c(a,o)}}return yg(e,t,n)}default:return fg(e)}},Mg=e=>e.variables.map(()=>void 0),Ng=e=>{for(let t=0;t<e.length;t++)if(e[t]===void 0)return!1;return!0},Pg=(e,t)=>{let n=t.state;if(!n||!Ng(n))throw new w(`ENABLED needs a complete state at ${Wg(e)}`);let r=t.environment;if(r.callStack)return Mh(e,t.scope,n,r);let i={environment:r,isInit:!1,isEnabled:!0,current:n,isStopped:!1,generator:void 0,successors:0};return Zh(e,r,!1)(i,t.scope,Mg(r),void 0,!1,()=>{i.isStopped=!0}),i.isStopped},Fg=(e,t,n,i,a)=>{let o={environment:t,isInit:!0,isEnabled:!1,current:void 0,isStopped:!1,generator:void 0,successors:0};Zh(e,t,!0)(o,i,Mg(t),void 0,!1,e=>{if(!o.isStopped){if(!Ng(e)){if(a){o.isStopped=a([...e]);return}throw x(new r([...e]),S.error)}o.isStopped=n(e)}})},Ig=(e,t,n)=>{let r=[];return Fg(e,t,e=>(r.push(e),!1),n),r},Lg=(e,t,n,r,i,a,o)=>{let s={environment:n,isInit:!1,isEnabled:!1,current:t,isStopped:!1,generator:a,successors:0,onUnsatisfied:o};return Zh(e,n,!1)(s,i,Mg(n),void 0,!1,(e,t)=>{if(!s.isStopped){if(!Ng(e)){let r=n.variables.filter((t,n)=>e[n]===void 0);throw new re(`Successor state is not completely specified by action ${t??`Next`}. The following variables are not assigned: ${r.join(`, `)}`,e,t,r)}s.successors++,s.isStopped=r({state:e,action:t})}}),s.successors},Rg=(e,t,n,r)=>{let i={environment:n,isInit:!1,isEnabled:!1,current:t,isStopped:!1,generator:void 0,successors:0};return Zh(e,n,!1)(i,r,Mg(n),void 0,!1,e=>{Ng(e)||i.successors++}),i.successors>0},zg=(e,t,n,r)=>{let i=[];return Lg(e,t,n,e=>(i.push(e),!1),r),i},Bg=/* @__PURE__ */ new Set([`SUBSET`,`UNION`,`DOMAIN`,`\\cup`,`\\cap`,`\\`]),Vg=/* @__PURE__ */ new Set([`SetEnumeration`,`SetFilter`,`SetMap`,`Tuple`,`FunctionSet`,`Record`,`RecordSet`,`Product`]),Hg=e=>Vg.has(e.kind)||e.kind===`Apply`&&Bg.has(e.operator),Ug=(e,t)=>{if(e.kind===`FunctionApplication`||e.kind===`Except`)return e.function;if(e.kind===`Apply`&&e.args.length===2){if([`\\subseteq`,`=`,`#`,`\\`].includes(e.operator))return e.args[0];if(e.operator===`\\cap`||e.operator===`\\cup`){let n=t.get(e.args[0]);return n!==void 0&&fn(n)?e.args[0]:e.args[1]}return e.operator===`\\in`||e.operator===`\\notin`?e.args[1]:void 0}},Wg=e=>`line ${e.location.line}, column ${e.location.column}`,U=e=>{let t=e.location.range;return t?g(t):Wg(e)},Gg={Always:`[]A`,Eventually:`<>A`,WeakFairness:`WF`,StrongFairness:`SF`},Kg=(e,t)=>new w(`TLC encountered a temporal formula (${e}) when evaluating a predicate or action.\n${U(t)}`),qg=e=>e.kind===`Number`?e.text??String(e.value):U(e),Jg=(e,t)=>new w(`A non-boolean expression (${Os(t)}) was used as the condition of an IF.\n${U(e)}`),Yg=(e,t,n)=>{let r=e.location.range;if(r?.start.line===e.location.line&&r.start.column===e.location.column||!r)return new w(`A non-boolean expression (${Os(n)}) was used as a formula in a ${e.kind===`And`?`conjunction`:`disjunction`}.\n${qg(e.operands[t])}`);let i=e.prefixEnds?.[Math.max(t,1)-1]??r.end;return new w(`Attempted to evaluate an expression of form P ${e.kind===`And`?`/\\`:`\\/`} Q when ${t===0?`P`:`Q`} was\n${Os(n)}.\n${U({...e,location:{...e.location,range:{...r,end:i}}})}`)},Xg=e=>{let t=e.field,n=n=>`Attempted to select nonexistent field "${t}" from the record\n${N(L(n))}\n${U(e)}`,r=e=>`Attempted to apply function:\n${N(L(e))}\nto argument "${t}", which is not in the domain of the function.`;return i=>{if(!pn(i))throw new w(`Attempted to select field "${t}" from a non-record value ${N(L(i))}\n${U(e)}`);let a=lr(i);if(a===`tuple`)throw aa(t);return pa(i.kind===`LazyFunction`?I(i):i,t,a===`record`?n:r)}},Zg=e=>e===`1.7.4`?(t,n)=>na(t,n,e):void 0,Qg=e=>t=>{if(!pn(t))throw new w(`Attempted to apply the operator DOMAIN to a non-function\n(${Os(t)})\n${U(e)}`);return ha(t)},$g=(e,t)=>(n,r)=>{if(!dn(n)||Kn(n))throw new w(`Attempted to evaluate an expression of form S \\subseteq T, but S was not enumerable.\n${U(e)}`);return t.evaluateBinary?t.evaluateBinary(n,r):t.evaluate([n,r])},e_=e=>x(new w(`TLC can't handle real numbers.\n${e.text}`),S.configParseError),t_=e=>x(new w(`TLC can't handle a number this big.\n${e.text??e.value}`),S.error),n_=(e,t)=>new ie(`In evaluation, the identifier ${e} is either undefined or not an operator.\n${U(t)}`,e),r_=(e,t)=>e instanceof ie&&t!==`1.7.4`?new w(`The action formula A appearing in a WF_v(A) or SF_v(A) operator does not specify the primed value of the variable ${e.variable} occurring in the state formula v.\n`):e,i_=(e,t)=>{for(let n=e;n;n=n.parent)if(n.name===t)return n.binding},a_=(e,t,n)=>({name:t,binding:{kind:`Value`,value:n},parent:e}),o_=(e,t,n)=>{if(t.kind===`Name`)return a_(e,t.name,n);let r=Ui(n);if(!r||r.length!==t.names.length){let e=t.ranges?.[0];throw new w(`Argument mismatch in operator application.${e?g(e):``}`)}return t.names.reduce((e,t,n)=>a_(e,t,r[n]),e)},s_=(e,t)=>{if(pn(e))return e;throw new w(`A non-function (${Os(e)}) was applied as a function.\n${U(t)}`)},c_=e=>e.isKeepLazy?e:{environment:e.environment,scope:e.scope,state:e.state,next:e.next,isKeepLazy:!0},l_=(e,t)=>({environment:e.environment,scope:t,state:e.state,next:e.next,isKeepLazy:e.isKeepLazy}),u_=(e,t)=>{if(typeof e!=`boolean`)throw new w(`Expected ${t} to be a boolean but found ${L(e)}`);return e},d_=(e,t,n)=>{if(typeof e!=`boolean`)throw new w(`Attempted to evaluate an expression of form P => Q when ${n} was\n${Os(e)}.\n${U(t)}`);return e},f_=(e,t)=>{if(typeof e!=`boolean`)throw new w(`Attempted to apply the operator ~ to a non-boolean\n(${Os(e)})\n${U(t)}`);return!e},p_=(e,t,n)=>{if(typeof e!=`boolean`||typeof t!=`boolean`)throw new w(`Attempted to evaluate an expression of form P <=> Q when P or Q was not a boolean.\n${U(n)}`);return e===t},m_=(e,t)=>{if(typeof e!=`boolean`)throw new w(`TLC expected a boolean value, but did not find one. ${qg(t)}`);return e},h_=(e,t)=>t.definitions.get(t.substitutions.get(e)??e),g_=(e,t)=>{let n=`universally (\\A) or existentially (\\E) quantify over ${t}, because this would require checking an\ninfinite number of cases.`;if(typeof e==`object`&&e.kind===`SequenceSet`)return`In TLA+, Seq(S) represents the set of all finite sequences whose elements come from the set S. Even when S\nis a finite set, the number of possible sequences in Seq(S) is unbounded because sequences can have any\nfinite length (e.g., length 0, 1, 2, and so on). As a result, TLC cannot evaluate expressions that\n${n} Note that for a finite set of sequences s, TLC handles s \\subseteq Seq(S).\nSee https://explain.tlapl.us/seq-unenumerable for additional details.`;if(typeof e==`object`&&e.kind===`InfiniteSet`&&e.name!==`STRING`&&e.name!==`Any`)return`The set ${e.name} contains infinitely many elements. As a result, TLC cannot evaluate expressions that\n${n} Note that TLC handles set membership like T \\subseteq ${e.name} for any finite set T.`},__=(e,t,n)=>{if(!dn(e)||Kn(e)){let r=L(e),i=n===`1.7.4`?void 0:g_(e,r);throw new w(i===void 0?`TLC encountered a non-enumerable quantifier bound\n${r}.\n${qg(t)}`:`TLC encountered the non-enumerable quantifier bound\n${r}\n${qg(t)}\n${i}`)}},v_=(e,t,n)=>(__(e,t,n),typeof e==`object`&&e.kind===`Interval`?ci(e):Si(e)??Oi(e)),y_=(e,t,n)=>n===`1.7.4`?(__(e,t,n),Si(e)??Ai(e)):v_(e,t,n),b_=e=>{if(typeof e==`object`&&e.kind===`Interval`)return Ri(e),e},x_=(e,t,n)=>b_(e)??y_(e,t,n),S_=(e,t,n)=>b_(e)??v_(e,t,n),C_=(e,t)=>{if(Array.isArray(e))return e.some(t);for(let n=e.low;n<=e.high;n++)if(t(n))return!0;return!1},w_=(e,t)=>e.reduce((n,r,i)=>(n.push(i>0&&e[i-1].set===r.set?n[i-1]:t(r.set,i)),n),[]),T_=(e,t)=>w_(e,e=>x_(W(e,t),e,t.environment.runtime.version)),E_=(e,t,n,r)=>{let i=(n,a)=>n<0?r(a):C_(t[n],t=>i(n-1,o_(a,e[n].pattern,t)));return i(e.length-1,n)},D_=(e,t,n)=>E_(e,T_(e,t),t.scope,n),O_=(e,t)=>{let n=w_(e,e=>W(e,t));return n.length===1?n[0]:{kind:`ProductSet`,factors:n}},k_=(e,t,n)=>{if(e.length===1)return o_(t,e[0].pattern,n);let r=Ui(n)??[];return e.reduce((e,t,n)=>o_(e,t.pattern,r[n]),t)},A_=e=>typeof e==`object`&&e.kind===`LazyFunction`&&`lambda`in e,j_=e=>Object.assign(e.value,{lambda:e}),M_=e=>A_(e)?e.lambda:void 0,N_=(e,t,n)=>{let r=e.value,i=t.args.map(e=>W(e,n)),a=i.length===1?i[0]:fi(i),o=(e,n,i)=>`In applying the function\n${N(L(r))},\nthe ${e} is:\n${N(L(n))}${i}.\n${U(t.function)}`,s=e.bounds;if(s.length===1){if(!Ji(a,r.domain))throw new w(o(`first argument`,a,`which is not in its domain`));return k_(s,e.scope,a)}let c=Ui(a),l=typeof r.domain==`object`&&r.domain.kind===`ProductSet`?r.domain.factors:[];if(c===void 0)throw new w(`Attempted to apply a function to an argument not in its domain.\n${U(t.function)}`);let u=()=>new w(`In applying the function\n${N(L(r))},\nthe argument list is:\n${N(L(a))}\nwhich does not match its formal parameter.\n`);if(s.forEach((e,t)=>{if(t>=c.length)throw u();let n=c[t],r=`argument number ${t+1}`;if(!Ji(n,l[t]))throw new w(o(r,n,`${e.pattern.kind===`Name`?``:`
1783
- `}which is not in its domain`));if(e.pattern.kind===`Tuple`&&Ui(n)?.length!==e.pattern.names.length)throw new w(o(r,n,`which does not match its formal parameter`))}),c.length>s.length)throw u();return k_(s,e.scope,a)},P_=(e,t)=>{if(t.location.range)return{parameters:e.flatMap((t,n)=>n>0&&e[n-1].set===t.set?[]:[{index:n,name:t.pattern.kind===`Name`?t.pattern.name:`<<${t.pattern.names.join(`, `)}>>`}]),body:qg(t)}},F_=(e,t,n)=>{if(!e)return;let r=t.length>1&&typeof n==`object`&&n.kind===`ProductSet`?n.factors:[n];return{parameters:e.parameters.map(e=>({name:e.name,domain:r[e.index]})),body:e.body}},I_=(e,t,n,r)=>{let i={kind:`LazyFunction`,domain:e,source:n,boundTupleLengths:r,apply:e=>t(e,i)};return i},L_=e=>e.length===1?void 0:e.map(e=>e.pattern.kind===`Tuple`?e.pattern.names.length:void 0),R_=e=>({kind:`FunctionConstruction`,bounds:e.bounds,body:e.body,location:e.location}),z_=(e,t)=>{let n=O_(e.bounds,t),r=I_(n,(n,r)=>W(e.body,l_(t,k_(e.bounds,a_(void 0,e.name,r),n))),F_(P_(e.bounds,e.body),e.bounds,n),L_(e.bounds));j_({value:r,bounds:e.bounds,body:e.body,scope:a_(void 0,e.name,r)});let i=Object.assign(r,{rebind:n=>{let i=z_(e,{...t,environment:n});return i.enumerated=r.enumerated,i}});return e.bounds.length===1?ur(i):i},B_=(e,t)=>{if(typeof t!=`object`||lr(t)!==`lambda`||e.kind===`Operator`||e.isSelfReferential||t.kind!==`LazyFunction`||!fn(t.domain))return t;try{let e=I(t);return or(e.domain,e.range)}catch(e){if(e instanceof w)return t;throw e}},V_=(e,t)=>e.kind===`Operator`&&e.params.length>0?()=>{throw new w(`Operator ${e.name} requires ${e.params.length} arguments`)}:e.kind===`Function`?e.isSelfReferential?t=>z_(e,t):Dv(R_(e),t):Dv(e.body,t),H_=(e,t)=>{let n=t.definitionEvaluators.get(e);if(n)return n;let r=V_(e,t),i=t.facts.ids.get(e),a=t.startupValues,o=i===void 0?e=>r(l_(e,void 0)):e=>a[i]??r(l_(e,void 0));return t.definitionEvaluators.set(e,o),o},U_=(e,t)=>{let n=t.facts.ids.get(e);return n===void 0?void 0:t.startupValues[n]},W_=(e,t)=>e.forEach(e=>{if(e.kind===`Operator`&&e.params.length>0)return;let n=e.name;if(t.constants.has(n)||t.substitutions.has(n)||!uf(e,t))return;let r=t.facts.ids.get(e);if(r===void 0||t.startupValues[r]!==void 0)return;let i={environment:t,scope:void 0,state:void 0,next:void 0};try{let n=t.runtime.evaluateAtStartup(()=>B_(e,V_(e,t)(i)));Wr(n),t.startupValues[r]=n}catch(e){if(!(e instanceof w)&&!b(e))throw e}}),G_=(e,t)=>{if(t===void 0||e===t)return!0;try{return t.every((t,n)=>t===void 0||e?.[n]!==void 0&&_r(e[n],t))}catch(e){if(e instanceof w)return!1;throw e}},K_=(e,t)=>{let n=e.cache;if(n!==void 0&&G_(t.state,e.state)&&G_(t.next,e.next))return n;let r=t.environment.coverage,i=r?.current===-1?void 0:r?.values.get(e),a=r&&i!==void 0?qo(r,i,()=>W(e.expression,l_(t,e.scope))):W(e.expression,l_(t,e.scope));return(!e.isStreamed||Mi(a))&&(e.cache=a,e.state=t.state,e.next=t.next),e.cache!==void 0&&e.state===void 0&&e.next===void 0&&(e.scope=void 0,e.isReleased=!0),a},q_=e=>({kind:`Closure`,name:e.name,params:e.params,body:e.body,scope:void 0}),J_=(e,t)=>{let n=t.substitutions.get(e);if(n!==void 0)return J_(n,t);let r=t.definitions.get(e);return r?.kind===`Operator`?q_(r):t.builtins.get(e)},Y_=(e,t)=>M(e)?X_(e.operator,t):J_(e.operator,t.environment)??X_(e.operator,t),X_=(e,t)=>{let n=i_(t.scope,e);if(n?.kind===`Operator`)return n.operator;if(!n)return J_(e,t.environment)},Z_=e=>e.kind===`Closure`?e.params.length:e.arity,Q_=(e,t)=>{if(e.kind===`Lambda`)return{kind:`Closure`,name:`LAMBDA`,params:e.params.map(e=>({name:e,arity:0})),body:e.body,scope:t.scope};let n=e.kind===`OperatorReference`?e.operator:e.kind===`Identifier`?e.name:void 0,r=n===void 0?void 0:X_(n,t);if(!r)throw new w(`Expected an operator argument at ${Wg(e)}`);return r},$_=(e,t,n)=>{if(e.kind===`Builtin`&&e.isLazy)return e.evaluate(t.map(e=>({kind:`Operator`,name:`argument`,arity:0,call:()=>e})),n);if(e.kind===`Builtin`)return e.evaluate(t,n);if(e.kind===`Operator`)return e.call(t);let r=e.params.reduce((e,n,r)=>a_(e,n.name,t[r]),e.scope);return W(e.body,l_(n,r))},ev=(e,t)=>e.kind===`Operator`?e:{kind:`Operator`,name:e.name,arity:Z_(e),call:n=>$_(e,n,t)},tv=(e,t)=>{if(e.kind===`Lambda`||e.kind===`OperatorReference`)return!0;if(e.kind!==`Identifier`)return!1;let n=X_(e.name,t);return n!==void 0&&Z_(n)>0},nv=(e,t)=>e.map(e=>tv(e,t)?ev(Q_(e,t),t):W(e,t)),rv=(e,t)=>new w(`Operator ${e.name} expects ${e.params.length} arguments but received ${t}`),iv=(e,t)=>({kind:`Thunk`,expression:e,scope:t.scope,state:t.state,next:t.next,cache:void 0,isStreamed:!1}),av=(e,t)=>{let n=t.variableIndex.get(e);if(n!==void 0)return{kind:`Variable`,index:n};let r=t.constants.get(e);if(r!==void 0)return{kind:`Value`,value:r};let i=t.substitutions.get(e);if(i!==void 0)return av(i,t);let a=t.definitions.get(e);if(a)return{kind:`Definition`,definition:a};let o=t.builtins.get(e);if(o&&o.arity===0&&!o.isStateLevel)return{kind:`Value`,value:o.evaluate([])}},ov=(e,t)=>{if(e.kind===`String`||e.kind===`Number`&&_n(e.value)){let t={kind:`Value`,value:e.value,argument:e};return()=>t}let n=t.coverage;if(n)return t=>{let r=iv(e,t);return n.current!==-1&&n.values.set(r,n.current),r};if(e.kind===`Identifier`){let n=M(e)?void 0:av(e.name,t);if(n?.kind===`Value`){let e={kind:`Value`,value:n.value};return()=>e}if(n===void 0&&!t.callStack)return t=>{let n=i_(t.scope,e.name);return n?.kind===`Value`||n?.kind===`Thunk`?n:iv(e,t)}}return t=>iv(e,t)},sv=(e,t,n,r)=>{if(t.length!==e.params.length)throw rv(e,t.length);let i=e.scope;for(let a=0;a<t.length;a++){let o=e.params[a],s=o.arity>0?{kind:`Operator`,operator:Q_(t[a],n)}:(r?.[a]??ov(t[a],n.environment))(n);i={name:o.name,binding:s,parent:i}}return i},cv=(e,t,n,r)=>e.kind===`Closure`?W(e.body,l_(n,sv(e,t,n,r))):e.kind===`Operator`?e.call(t.map(e=>W(e,n))):e.isLazy?e.evaluate(Av(t,n),n):e.evaluate(nv(t,n),n),lv=/* @__PURE__ */ new WeakMap,uv=e=>{let t=lv.get(e);if(t)return t;let n={kind:`FunctionConstruction`,bounds:e.bounds,body:e.body,location:e.location,isRecursive:!0};return lv.set(e,n),n},dv=(e,t,n)=>{let r=e.map(e=>({name:e.name,binding:{kind:`Value`,value:!1},parent:void 0})),i=r.reduce((e,t)=>(t.parent=e,t),t.scope);e.forEach((e,a)=>{r[a].binding=e.kind===`Function`?{kind:`Thunk`,expression:uv(e),scope:i,state:t.state,next:t.next,cache:void 0,isStreamed:!1}:e.params.length>0||n?.impure.has(e)?{kind:`Operator`,operator:{kind:`Closure`,name:e.name,params:e.params,body:e.body,scope:i}}:{kind:`Thunk`,expression:e.body,scope:i,state:t.state,next:t.next,cache:void 0,isStreamed:n?.streamed.has(e)??!1}});let a=t.environment.coverage;return a&&a.current!==-1&&r.forEach(e=>{e.binding.kind===`Thunk`&&a.values.set(e.binding,a.current)}),i},fv=(e,t,n)=>{let r=i_(n.scope,e);if(r?.kind===`Value`)return r.value;if(r?.kind===`Thunk`)return K_(r,n);if(r?.kind===`Operator`){if(Z_(r.operator)===0)return $_(r.operator,[],n);throw new w(`Operator ${e} is used without arguments`)}let i=av(e,n.environment);if(i?.kind===`Variable`){let r=n.state?.[i.index];if(r===void 0)throw n_(e,t);return r}if(i?.kind===`Value`)return i.value;if(i?.kind===`Definition`)return H_(i.definition,n.environment)(n);let a=n.environment.builtins.get(e);if(a?.arity===0)return a.evaluate([],n);throw new w(`In evaluation, the identifier ${e} is either undefined or not an operator.\n${U(t)}`)},pv=(e,t)=>({impure:new Set(e.filter(e=>pf(e,t))),streamed:new Set(e.filter(e=>pf(e,t,`streamed`)))}),mv=e=>[...e.facts.ids.keys()].some(t=>pf(t,e)),hv=e=>[...e.facts.ids.keys()].some(t=>pf(t,e,`repeated`)),gv=e=>typeof e==`object`&&(e.kind===`FilteredSet`||e.kind===`LazyFunction`)&&`rebind`in e,_v=e=>({environment:e.environment,scope:e.scope,state:e.next,next:void 0,isKeepLazy:e.isKeepLazy}),vv=e=>t=>{let n=e(t);return _r(n,e(_v(t)))},yv=(e,t,n,r)=>i=>{r.expressions.push(e);let a=Gi.sets,o=Gi.callStack,s=a??[],c=s.length;Gi.sets=s,Gi.callStack=r;try{let a=t(i),o=gv(a)?a.rebind(n):a;return r.values.set(e,o),typeof o==`object`&&o.kind!==`FilteredSet`&&Hg(e)&&r.sources.set(o,e),o}catch(t){t instanceof u&&!r.isFrozen&&(r.expressions.length=0,r.isFrozen=!0);let n=t instanceof Error?r.failures.get(t):void 0;t instanceof Error&&r.failures.set(t,e);let i=Ug(e,r.values),a=i&&!mt(e).some(e=>e===n)?r.values.get(i):void 0,o=e.kind===`FunctionApplication`&&a!==void 0&&!pn(a)?void 0:a;throw bv(r,[o,...s.slice(c).filter(e=>e!==o)],t),t}finally{r.isFrozen||r.expressions.pop(),s.length=c,Gi.sets=a,Gi.callStack=o}},bv=(e,t,n)=>{let r=[...new Set(t)].flatMap(t=>{let n=typeof t==`object`?e.sources.get(t):void 0;return n?[n]:[]});if(r.length>0&&n instanceof w){e.isFrozen||e.expressions.push(...r);let t=e.fingerprint;e.fingerprint={sources:[...r,...t?.sources??[]],reason:t?.reason??n.message}}e.isFrozen=!0},xv=(e,t,n)=>{if(!(n instanceof w))return;e.isFrozen||e.expressions.push(t),e.isFrozen=!0;let r=e.fingerprint;e.fingerprint={sources:[t,...r?.sources??[]],reason:r?.reason??n.message}},Sv=e=>({...e,coverage:void 0,evaluators:/* @__PURE__ */ new WeakMap,entryEvaluators:/* @__PURE__ */ new WeakMap,definitionEvaluators:/* @__PURE__ */ new WeakMap,callStack:{expressions:[],isFrozen:!1,sources:/* @__PURE__ */ new WeakMap,values:/* @__PURE__ */ new WeakMap,failures:/* @__PURE__ */ new WeakMap}}),Cv=(e,t,n)=>{let r=e.location.range,i=e.prefixEnds;if(!n||e.isBulleted||!r||!i||t.length<3)return;let a=i.slice(0,t.length-2).map(t=>({...e,location:{...e.location,range:{...r,end:t}}})).reverse(),o=e.kind===`And`;return r=>{n.expressions.push(...a);for(let i=0;i<t.length;i++){i>=2&&!n.isFrozen&&n.expressions.pop();let s=t[i](r);if(typeof s!=`boolean`)throw Yg(e,i,s);if(s!==o)return n.isFrozen||(n.expressions.length-=a.length-Math.max(i-1,0)),s}return o}},wv=(e,t,n,r)=>i=>{if(r.expressions.at(-1)===e)return n(i);r.expressions.push(...t);try{return n(i)}finally{r.isFrozen||(r.expressions.length-=t.length)}},Tv=(e,t,n)=>r=>{let i=n.current;if(i===-1||!n.covered.has(e))return t(r);let a=Go(n,i,e);Ko(n,a),n.current=a;try{let i=t(r);return typeof i==`object`&&e.kind===`SetEnumeration`&&n.values.set(i,a),i}finally{n.current=i}},Ev=(e,t)=>{let n=t.evaluators.get(e);if(n)return n;let r=ey(e,t),i=t.callStack,a=i&&au.get(e),o=i?yv(e,r,t,i):r,s=i&&a?wv(e,a,o,i):o,c=t.coverage,l=c?Tv(e,s,c):s;return t.evaluators.set(e,l),l},Dv=(e,t)=>{if(t.callStack||t.coverage)return Ev(e,t);let n=t.entryEvaluators.get(e);if(n)return n;let r=ic(e,t)??Ev(e,t);return t.entryEvaluators.set(e,r),r},W=(e,t)=>Dv(e,t.environment)(t),Ov=(e,t)=>{let n=e.name,r=M(e)?void 0:av(n,t);if(r?.kind===`Variable`){let t=r.index;return r=>{let i=r.state?.[t];if(i===void 0)throw n_(n,e);return i}}if(r?.kind===`Value`){let e=r.value;return()=>e}if(r?.kind===`Definition`){let e=r.definition,n;return r=>(n??=H_(e,t))(r)}return t=>fv(n,e,t)},kv=(e,t)=>{if(e.kind===`Lambda`||e.kind===`OperatorReference`)return!1;if(e.kind!==`Identifier`||M(e))return!0;let n=J_(e.name,t);return n===void 0||Z_(n)===0},Av=(e,t)=>e.map(e=>({kind:`Operator`,name:`argument`,arity:0,call:()=>W(e,t),expression:e})),jv=(e,t,n)=>{if(e.isLazy)return n=>e.evaluate(Av(t,n),n);let r=e.evaluateUnary;if(r&&t.length===1&&kv(t[0],n)){let e=Ev(t[0],n);return t=>r(e(t))}let i=e.evaluateBinary,a=t.length===2&&kv(t[0],n)&&kv(t[1],n);if(i&&a){let e=Ev(t[0],n),r=Ev(t[1],n);return t=>i(e(t),r(t))}return n=>e.evaluate(nv(t,n),n)},Mv=(e,t,n)=>{if(t.length!==e.params.length)return()=>{throw rv(e,t.length)};let r=e.params,i=t.map((e,t)=>r[t].arity>0?void 0:ov(e,n));return n=>{let a=e.scope;for(let e=0;e<t.length;e++){let o=i[e],s=o?o(n):{kind:`Operator`,operator:Q_(t[e],n)};a={name:r[e].name,binding:s,parent:a}}return a}},Nv=(e,t,n)=>{let r=Mv(e,t,n),i;return t=>(i??=Dv(e.body,n),i({environment:n,scope:r(t),state:t.state,next:t.next,isKeepLazy:t.isKeepLazy}))},Pv=(e,t)=>{let n=e.args;if(e.operator===`=>`){let r=Ev(n[0],t),i=Ev(n[1],t);return t=>!d_(r(t),e,`P`)||d_(i(t),e,`Q`)}if(e.operator===`~`&&n.length===1){let r=Ev(n[0],t);return t=>f_(r(t),e)}if(e.operator===`<=>`){let r=Ev(n[0],t),i=Ev(n[1],t);return t=>p_(r(t),i(t),e)}if(e.operator===`~>`||e.operator===`-+->`)return()=>{throw Kg(e.operator===`~>`?`a ~> b`:`a -+-> formula`,e)};let r=M(e)?void 0:J_(e.operator,t);if(r?.kind===`Closure`)return Nv(r,n,t);if(r?.kind===`Builtin`&&r.name===`DOMAIN`){let r=Ev(n[0],t),i=Qg(e);return e=>i(r(e))}if(r?.kind===`Builtin`&&r.name===`TLCEval`&&n.length===1){let i=!iu.has(e)&&!_f(n[0],t),a=t.tlcEvalValues;return t=>{if(!i||t.scope!==void 0)return r.evaluate(Av(n,t),t);let o=a.get(e);if(o!==void 0)return o;let s=r.evaluate(Av(n,t),void 0);return a.set(e,s),s}}if(r?.kind===`Builtin`&&r.name===`\\subseteq`&&n.length===2){let i=Ev(n[0],t),a=Ev(n[1],t),o=$g(e,r);return e=>o(i(e),a(e))}if(r?.kind===`Builtin`)return jv(r,n,t);if(e.operator===`\\cdot`&&n.length===2)return()=>{throw new w(t.runtime.version===`1.7.4`?`The current version of TLC does not support action composition.`:`The current version of TLC does not support action composition. An incomplete implementation can be enabled via the tlc2.tool.impl.Tool.cdot=true java property.`)};let i=n.map(e=>ov(e,t));return r=>{let a=X_(e.operator,r);if(a)return cv(a,n,r,i);throw t.definitions.get(e.operator)?.kind===`Function`?new w(`${e.operator} is a function; apply it with brackets`):new w(`Unknown operator ${e.operator} at ${Wg(e)}`)}},Fv=(e,t)=>{let n=e.kind===`Forall`,r=Ev(e.body,t),i=e.bounds[0];if(e.bounds.length===1&&i.pattern.kind===`Name`){let a=i.pattern.name,o=Ev(i.set,t);return s=>C_(x_(o(s),i.set,t.runtime.version),t=>m_(r(l_(s,a_(s.scope,a,t))),e)!==n)?!n:n}let a=e.bounds;if(a.every(e=>e.pattern.kind===`Name`)){let i=a.map(e=>e.pattern.kind===`Name`?e.pattern.name:``);return o=>{let s=w_(a,e=>x_(Ev(e,t)(o),e,t.runtime.version)),c=(t,a)=>t<0?m_(r(l_(o,a)),e)!==n:C_(s[t],e=>c(t-1,a_(a,i[t],e)));return c(a.length-1,o.scope)?!n:n}}return t=>D_(a,t,i=>m_(r(l_(t,i)),e)!==n)?!n:n},Iv=(e,t)=>{if(e.kind===`Tuple`)return fi(e.names.map(e=>{let n=i_(t,e);return n?.kind===`Value`&&n.value}));let n=i_(t,e.name);return n?.kind===`Value`?n.value:void 0},Lv=/* @__PURE__ */ new WeakSet,Rv=e=>{(e.kind===`FunctionConstruction`||e.kind===`Except`)&&Lv.add(e)},zv=/* @__PURE__ */ new WeakMap,Bv=e=>{if(zv.has(e))return zv.get(e);let t=/* @__PURE__ */ new Set,n=e=>{if(e.kind===`Subexpression`)return!1;let r=ht(e);return r!==void 0&&t.add(r),e.kind===`ExceptAt`&&t.add(`@`),mt(e).every(n)},r=n(e)?[...t]:void 0;return zv.set(e,r),r},Vv=(e,t)=>t===void 0||e===void 0?e:t.reduce((t,n)=>{let r=i_(e,n);return r?{name:n,binding:r,parent:t}:t},{name:``,binding:{kind:`Value`,value:!1},parent:void 0}),Hv=e=>Lv.has(e),Uv=(e,t)=>{let n=Hv(e),r=Ev(e.body,t),i=e.bounds,a=i[0],o=i.length===1&&a.pattern.kind===`Name`,s=(e,t)=>{if(o&&a.pattern.kind===`Name`){let n=a.pattern.name,i=e=>r(l_(t,a_(t.scope,n,e)));if(ln(e))return Ri(e),un(e,i),d(e,t);let o=ui(e),s=or(o,o.map(i));return fn(e)?s:(s.lambdaDomain=e,ur(s))}let n=[],s=w_(i,(n,r)=>S_(i.length>1&&typeof e==`object`&&e.kind===`ProductSet`?e.factors[r]:e,n,t.environment.runtime.version));return E_(i,s,t.scope,e=>{let o=i.length===1?Iv(a.pattern,e)??!1:fi(i.map(t=>Iv(t.pattern,e)??!1));return n.push([o,r(l_(t,e))]),!1}),ti(n)},c=P_(i,e.body),l=L_(i),u=Bv(e.body),d=(t,n)=>{let a=Vv(n.scope,u),o=l_(n,a),s=j_({value:I_(t,e=>r(l_(o,k_(i,a,e))),F_(c,i,t),l),bounds:i,body:e.body,scope:a});return i.length===1?ur(s):s},f=t.callStack;return{build:(t,r)=>{if(e.isRecursive||n||r.isKeepLazy||!P(t))return d(t,r);if(!(i.length===1?fn(t):typeof t==`object`&&t.kind===`ProductSet`&&t.factors.every(fn))){if(f)return d(t,r);try{return s(t,r)}catch(e){if(!(e instanceof w))throw e;return d(t,r)}}if(!f)return s(t,r);try{return s(t,r)}catch(t){throw xv(f,e,t),t}},createLazy:d}},Wv=(e,t)=>{let n=Uv(e,t).build,r=e.bounds;if(r.length===1&&r[0].pattern.kind===`Name`){let e=Ev(r[0].set,t);return t=>n(e(t),t)}return e=>n(O_(r,e),e)},Gv=(e,t)=>{let n=Lv.has(e);n&&Rv(e.function);let r=Ev(e.function,t),i=e.updates.map(e=>({path:e.path.map(e=>e.kind===`Field`?{kind:`Field`,name:e.name,args:[]}:{kind:`Index`,name:``,args:e.args.map(e=>Ev(e,t))}),value:Ev(e.value,t)})),a=(e,t)=>e.kind===`Field`?e.name:e.args.length===1?e.args[0](t):fi(e.args.map(e=>e(t))),o=(e,t,r,i,s)=>r===t.length?s(l_(i,a_(i.scope,`@`,e))):ga(e,a(t[r],i),e=>o(e,t,r+1,i,s),n&&r===0);return t=>{let n=r(t);for(let r of i){let i=!1;n=o(n,r.path,0,t,e=>(i=!0,r.value(e))),i||t.environment.runtime.warn(wt.exceptAppliedToUnknownField,`The EXCEPT was applied to non-existing fields of the value at\n${U(e.function)}`)}return n}},Kv=(e,t)=>{let n=Ev(e.predicate,t),r=e.bound.pattern,i=qg(e.predicate),a=e.predicate.location.range&&{names:r.kind===`Name`?r.name:r.names.join(`, `),predicate:i},o=t.coverage,s=(e,t,n)=>{if(!o||e===-1)return n();t||o.secondary[e]++;let r=qo(o,t?-1:e,n);return!t&&r===!0&&o.secondary[e]++,r},c=(t,n,o,l)=>({kind:`FilteredSet`,base:t,test:(e,t)=>{if(r.kind===`Tuple`&&Ui(e)?.length!==r.names.length)throw new w(`Attempted to check if the value:\n${N(L(e))}\nis an element of a set of ${r.names.length}-tuples.`);let a=s(l,t,()=>o(l_(n,o_(n.scope,r,e))));if(typeof a!=`boolean`)throw new w(`${t?`The evaluation of predicate`:`Evaluating predicate`} ${i} yielded non-Boolean value.`);return a},source:a,rebind:r=>c(t,{...n,environment:r},Ev(e.predicate,r),-1)});return(e,t,r=-1)=>c(e,t,n,r)},qv=(e,t)=>{if(typeof e!=`boolean`)throw new w(`Attempted to evaluate an expression of form {x \\in S : P(x)} when P was ${Os(e)}.\n${qg(t.predicate)}`);return e},Jv=(e,t,n,r)=>{if(!dn(e)||Kn(e))throw new w(`Attempted to compute the value of an expression of\nform CHOOSE x \\in S: P, but S was not enumerable.\n${U(t)}`);return Gr(e),S_(e,n,r)},Yv=e=>new w(`Attempted to compute the value of an expression of form\nCHOOSE x \\in S: P, but no element of S satisfied P.\n${U(e)}`),Xv=(e,t)=>{if(e.kind===`SetFilter`){let n=Ev(e.predicate,t),r=Ev(e.bound.set,t),i=Kv(e,t),a=e.bound.pattern,o=t.coverage;return t=>{let s=r(t);if(!fn(s))return i(s,t,o?.current);let c=[],l=r=>{let i=n(l_(t,o_(t.scope,a,r)));qv(i,e)&&cn(c,r)},u=s.kind===`Interval`?s:F(s).elements;return un(u,l),o&&o.current!==-1&&(o.secondary[o.current]+=(Array.isArray(u)?u.length:u.high-u.low+1)+c.length),ar(c)}}if(e.kind===`SetMap`){let n=Ev(e.expression,t);return t=>{let r=[];return D_(e.bounds,t,e=>(cn(r,n(l_(t,e))),!1)),Xr(r)}}let n=e.set;if(!n)return()=>{throw new w(`TLC attempted to evaluate an unbounded CHOOSE.\nMake sure that the expression is of form CHOOSE x \\in S: P(x).\n${U(e)}`)};let r=Ev(e.body,t),i=Ev(n,t);return t=>{let a=Jv(i(t),e,n,t.environment.runtime.version),o,s=e.pattern;if(C_(a,n=>{if(s.kind===`Tuple`&&Ui(n)?.length!==s.names.length)throw new w(`Attempted to compute the value of an expression of form\nCHOOSE <<x1, ... , xN>> \\in S: P, but S was not a set\nof N-tuples.\n${U(e)}`);let i=o_(t.scope,s,n);return m_(r(l_(t,i)),e)?(o=Iv(s,i),!0):!1}),o===void 0)throw Yv(e);return o}},Zv=e=>[...e].sort((e,t)=>$n(e.name,t.name)),Qv=e=>e.some((t,n)=>n>0&&e[n-1].name===t.name),$v=(e,t)=>{let n=Zv(e),r=e.map(e=>Ev(e.value,t));if(Qv(n))return t=>pi(e.map((e,n)=>[e.name,r[n](t)]));let i=n.map(e=>e.name),a=e.map(e=>e.name);if(a.some((e,t)=>e!==i[t])){let t=n.map(t=>e.indexOf(t));return e=>Cn(i,t,r.map(t=>t(e)),a)}return e=>mi(i,r.map(t=>t(e)))},ey=(e,t)=>{let n=e=>Ev(e,t);switch(e.kind){case`Number`:{let t=e.value;return _n(t)?()=>t:()=>{throw t_(e)}}case`Decimal`:return()=>{throw e_(e)};case`String`:{let t=e.value;return()=>t}case`Identifier`:return Ov(e,t);case`Apply`:return Pv(e,t);case`Bracket`:return()=>{throw new w(`A bracket without a function or subscript is not an expression at ${Wg(e)}`)};case`OperatorReference`:case`Lambda`:return()=>{throw new w(`An operator cannot be used as a value at ${Wg(e)}`)};case`And`:{let r=e.operands.map(n);return Cv(e,r,t.callStack)??(t=>{for(let n=0;n<r.length;n++){let i=r[n](t);if(typeof i!=`boolean`)throw Yg(e,n,i);if(!i)return!1}return!0})}case`Or`:{let r=e.operands.map(n);return Cv(e,r,t.callStack)??(t=>{for(let n=0;n<r.length;n++){let i=r[n](t);if(typeof i!=`boolean`)throw Yg(e,n,i);if(i)return!0}return!1})}case`Prime`:{let t=n(e.expression);return e=>t(_v(e))}case`Unchanged`:return vv(n(e.expression));case`If`:{let t=n(e.condition),r=n(e.consequent),i=n(e.alternative);return n=>{let a=t(n);if(typeof a!=`boolean`)throw Jg(e,a);return a?r(n):i(n)}}case`Case`:{let t=e.arms.map(e=>({source:e.condition,condition:n(e.condition),body:n(e.body)})),r=e.other?n(e.other):void 0;return n=>{for(let e of t){let t=e.condition(n);if(typeof t!=`boolean`)throw new w(`A non-boolean expression (${Os(t)}) was used as a condition of a CASE. ${qg(e.source)}`);if(t)return e.body(n)}if(r)return r(n);throw new w(`Attempted to evaluate a CASE with no conditions true.\n${U(e)}`)}}case`Let`:{let t=n(e.body);return n=>t(l_(n,dv(e.definitions,n)))}case`Forall`:case`Exists`:return Fv(e,t);case`UnboundedQuantifier`:return()=>{let t=e.quantifier===`Forall`?`\\A`:`\\E`;throw e.isTemporal?Kg(e.quantifier===`Forall`?`\\AA`:`\\EE`,e):new w(`TLC attempted to evaluate an unbounded ${t}.\nMake sure that the expression is of form ${t} x \\in S: P(x).\n${U(e)}`)};case`Choose`:case`SetFilter`:case`SetMap`:return Xv(e,t);case`SetEnumeration`:{let t=e.elements.map(n);return e=>Xr(t.map(t=>t(e)))}case`Tuple`:{let t=e.elements.map(n);return e=>fi(t.map(t=>t(e)))}case`FunctionConstruction`:return Wv(e,t);case`FunctionSet`:{let t=n(e.domain),r=n(e.range);return e=>({kind:`FunctionSet`,domain:t(e),range:r(e)})}case`Record`:return $v(e.fields,t);case`RecordSet`:{let t=Zv(e.fields),r=t.map(e=>e.name),i=t.map(t=>e.fields.indexOf(t)),a=e.fields.map(e=>n(e.value));return i.every((e,t)=>e===t)?e=>({kind:`RecordSet`,names:r,sets:a.map(t=>t(e))}):e=>{let t=a.map(t=>t(e));return{kind:`RecordSet`,names:r,sets:i.map(e=>t[e])}}}case`Except`:return Gv(e,t);case`ExceptAt`:return t=>{let n=i_(t.scope,`@`);if(n?.kind!==`Value`)throw new w(`@ appears outside an EXCEPT at ${Wg(e)}`);return n.value};case`FunctionApplication`:{Rv(e.function);let r=n(e.function),i=t=>s_(r(c_(t)),e),a=e.args.map(n),o=Zg(t.runtime.version);if(a.length===1){let e=a[0];return t=>pa(i(t),e(t),o)}return e=>pa(i(e),fi(a.map(t=>t(e))),o)}case`FieldAccess`:{let t=n(e.record),r=Xg(e);return e=>r(t(e))}case`Product`:{let t=e.factors.map(n);return e=>({kind:`ProductSet`,factors:t.map(t=>t(e))})}case`BoxAction`:case`AngleAction`:{let t=n(e.action),r=vv(n(e.subscript)),i=e.kind===`BoxAction`,a=i?`[A]_e`:`<A>_e`;return n=>{let o=t(n);if(typeof o!=`boolean`)throw new w(`Attempted to evaluate an expression of form ${a}, but A was not a boolean.\n${U(e)}`);return i?o||r(n):o&&!r(n)}}case`Enabled`:{let t=e.expression;return e=>Pg(t,e)}case`Label`:return n(e.body);case`Subexpression`:return()=>{throw new w(`The subexpression reference at ${Wg(e)} does not name a subexpression`)};case`Always`:case`Eventually`:case`WeakFairness`:case`StrongFairness`:return()=>{throw Kg(Gg[e.kind],e)}}},ty=e=>{let t=Math.imul(e^e>>>16,2146121005),n=Math.imul(t^t>>>15,2221713035);return n^n>>>16},ny=(e,t)=>{let n=2166136261,r=1779033703;for(let t=0;t<e.length;t++)n=Math.imul(n^Da(e[t]),16777619),r=Math.imul(r^Na(e[t]),1540483477);t[0]=ty(n)||1,t[1]=ty(r)},ry=()=>{let e=/* @__PURE__ */ new Int32Array(8192),t=0,n=(e,t,n)=>{let r=e.length/2-1;for(let i=t&r;;i=i+1&r){let r=e[i*2];if(r===0||r===t&&e[i*2+1]===n)return i}},r=()=>{let t=e,r=new Int32Array(t.length*2);for(let e=0;e<t.length;e+=2){if(t[e]===0)continue;let i=n(r,t[e],t[e+1]);r[i*2]=t[e],r[i*2+1]=t[e+1]}e=r};return{insert:(i,a)=>{t*4>=e.length&&r();let o=n(e,i,a);return e[o*2]!==i&&(e[o*2]=i,e[o*2+1]=a,t++,!0)}}},iy=e=>({slots:new Int32Array(1<<17),size:0,shift:16,states:e}),ay=e=>{let t=2166136261;for(let n=0;n<e.length;n++)t=va(t,Da(e[n]));return t&1073741823},oy=(e,t)=>{for(let n=0;n<t.length;n++)if(!yr(e[n],t[n]))return!1;return!0},sy=(e,t)=>Math.imul(t,2654435761)>>>e.shift<<1,cy=(e,t,n)=>{let r=e.slots.length-1;for(let i=sy(e,t);;i=i+2&r){let r=e.slots[i+1];if(r===0)return-1;if(e.slots[i]===t&&oy(e.states[r-1],n))return r-1}},ly=(e,t,n)=>{let r=e.slots.length-1,i=sy(e,t);for(;e.slots[i+1]!==0;)i=i+2&r;e.slots[i]=t,e.slots[i+1]=n},uy=(e,t,n)=>{if(e.size++,e.size*4>e.slots.length){let t=e.slots;e.slots=new Int32Array(t.length*2),e.shift--;for(let n=0;n<t.length;n+=2)t[n+1]!==0&&ly(e,t[n],t[n+1])}ly(e,t,n+1)},dy=(e,t)=>{let n=e.length-1;for(let r=Number(t>>32n)&n;;r=r+1&n){let n=Atomics.load(e,r);if(n===t)return!1;if(n!==0n)continue;let i=Atomics.compareExchange(e,r,0n,t);if(i===0n)return!0;if(i===t)return!1}},fy=()=>({slots:new BigInt64Array(new SharedArrayBuffer(8192)),used:new Int32Array(new SharedArrayBuffer(4))}),py=(e,t,n)=>{let r=BigInt.asIntN(64,BigInt(t)<<32n|BigInt(n>>>0));return dy(e.slots,r)?(Atomics.add(e.used,0,1),!0):!1},my=e=>Atomics.load(e.used,0)*2>=e.slots.length,hy=e=>{let t=new BigInt64Array(new SharedArrayBuffer(e.slots.byteLength*2));for(let n of e.slots)n!==0n&&dy(t,n);return{slots:t,used:e.used}},gy={kind:`Boolean`,value:!0},_y={kind:`Boolean`,value:!1},vy=e=>e?gy:_y,yy=e=>e.kind===`State`||e.kind===`Enabled`||e.kind===`Action`,by=e=>e.kind===`State`||e.kind===`Enabled`||e.kind===`Boolean`,xy=(e,t)=>({kind:e,body:t}),Sy=(e,t,n)=>({kind:e,operands:[t,n]}),Cy=(e,t)=>({kind:e,operands:t.flatMap(t=>t.kind===e?Cy(e,t.operands).operands:[t])}),wy=e=>{switch(e.kind){case`Boolean`:return 0;case`State`:case`Enabled`:return 1;case`Action`:case`Next`:return 2;case`Not`:return wy(e.body);case`Always`:case`Eventually`:return 3;case`And`:case`Or`:return e.operands.reduce((e,t)=>Math.max(e,wy(t)),0)}},Ty=e=>{switch(e.kind){case`Action`:return!0;case`Boolean`:case`State`:case`Enabled`:return!1;case`Not`:case`Always`:case`Eventually`:case`Next`:return Ty(e.body);case`And`:case`Or`:return e.operands.some(Ty)}},Ey=/* @__PURE__ */ new WeakMap;let Dy=0;const Oy=e=>{let t=Ey.get(e);if(t!==void 0)return t;let n=(()=>{switch(e.kind){case`Boolean`:return String(e.value);case`State`:case`Enabled`:case`Action`:return`#${Dy++}`;case`And`:case`Or`:return`${e.kind}(${e.operands.map(Oy).join(`,`)})`;default:return`${e.kind}(${Oy(e.body)})`}})();return Ey.set(e,n),n},ky=(e,t)=>e===t||Oy(e)===Oy(t),Ay=(e,t)=>{let n=Oy(t);return e.some(e=>e===t||Oy(e)===n)},jy=e=>e===`And`?`Or`:`And`,My=(e,t)=>{switch(e.kind){case`Boolean`:return t?vy(!e.value):e;case`State`:case`Enabled`:case`Action`:case`Next`:return t?xy(`Not`,e):e;case`Not`:return My(e.body,!t);case`And`:case`Or`:return Cy(t?jy(e.kind):e.kind,e.operands.map(e=>My(e,t)));case`Always`:case`Eventually`:{let n=t===(e.kind===`Always`)?`Eventually`:`Always`;return xy(n,My(e.body,t))}}},Ny=e=>{switch(e.kind){case`Boolean`:return vy(!e.value);case`Not`:return e.body;case`And`:case`Or`:return Cy(jy(e.kind),e.operands.map(Ny));case`Always`:return xy(`Eventually`,Ny(e.body));case`Eventually`:return xy(`Always`,Ny(e.body));default:return xy(`Not`,e)}},Py=e=>{switch(e.kind){case`And`:case`Or`:{let t=e.kind===`Or`,n=[];for(let r of e.operands){let e=Py(r);if(e.kind!==`Boolean`)n.push(e);else if(e.value===t)return vy(t)}return n.length===0?vy(!t):n.length===1?n[0]:Cy(e.kind,n)}case`Not`:{let t=Py(e.body);return t.kind===`Boolean`?vy(!t.value):xy(`Not`,t)}case`Always`:case`Eventually`:{let t=Py(e.body);return xy(e.kind,t.kind===e.kind?t.body:t)}default:return e}},Fy=e=>e.kind===`Always`&&e.body.kind===`Eventually`?e.body.body:void 0,Iy=e=>{switch(e.kind){case`And`:{let t=[],n=1;for(let r of e.operands){let e=Iy(r);if(e.kind===`And`)t.push(...e.operands);else{if(e.kind===`Or`&&(n*=e.operands.length,n>2147483647))throw new w(`TLC cannot handle the temporal formula because it exceeds the maximum supported size in disjunctive normal form.`);t.push(e)}}if(n===1)return{kind:`And`,operands:t};let r=Array.from({length:n},()=>[]),i=1,a=n;for(let e of t){if(e.kind!==`Or`){r.forEach(t=>t.push(e));continue}a/=e.operands.length;let t=0;for(let n=0;n<i;n++)for(let n of e.operands)for(let e=0;e<a;e++)r[t++].push(n);i*=e.operands.length}return{kind:`Or`,operands:r.map(e=>Cy(`And`,e))}}case`Or`:{let t=[],n=[];for(let r of e.operands){let e=Iy(r);for(let r of e.kind===`Or`?e.operands:[e]){let e=Fy(r);e?t.push(e):n.push(r)}}if(t.length>0){let e=t.length===1?t[0]:Cy(`Or`,t);n.push(xy(`Always`,xy(`Eventually`,e)))}return Cy(`Or`,n)}case`Not`:return yy(e.body)?e:Iy(Ny(e.body));default:return e}},Ly=e=>{switch(e.kind){case`And`:case`Or`:return e.operands.length===1?Ly(e.operands[0]):Cy(e.kind,e.operands.map(Ly));case`Not`:return e.body.kind===`Not`?Ly(e.body.body):xy(`Not`,Ly(e.body));case`Always`:case`Eventually`:case`Next`:return xy(e.kind,Ly(e.body));default:return e}},Ry=e=>{switch(e.kind){case`And`:case`Or`:{if(e.operands.length===1)return Ry(e.operands[0]);let t=Math.floor(e.operands.length/2);return Sy(e.kind,Ry(Cy(e.kind,e.operands.slice(0,t))),Ry(Cy(e.kind,e.operands.slice(t))))}case`Not`:case`Always`:case`Eventually`:case`Next`:return xy(e.kind,Ry(e.body));default:return e}},zy=(e,t)=>{e.kind===`Eventually`&&!Ay(t,e)&&t.push(e),`body`in e&&zy(e.body,t),`operands`in e&&e.operands.forEach(e=>zy(e,t))},By=e=>{let t=e.filter(by),n=e.flatMap(e=>e.kind===`Not`&&by(e.body)?[e.body]:[]);return!t.some(e=>Ay(n,e))},Vy=e=>{let t=[...e],n=[];for(;t.length>0;){let e=t.pop();if(!e)break;switch(e.kind){case`Not`:t.push(e.body);break;case`Next`:n.push(e),t.push(e.body);break;case`Always`:case`Eventually`:n.push(e,xy(`Next`,e)),t.push(e.body);break;case`And`:case`Or`:t.push(...e.operands),n.push(e);break;case`Action`:throw new w(`TLC encountered actions while constructing the tableau`);default:n.push(e)}}return n},Hy=(e,t,n)=>{if(e.kind===t&&`body`in e)return{first:e.body,second:xy(`Next`,e)};if(e.kind===n&&`operands`in e)return{first:e.operands[0],second:e.operands[1]}},Uy=(e,t,n)=>e.flatMap(e=>{let r=Hy(e,t,n);return r?[{whole:e,first:r.first,second:r.second}]:[]}),Wy=e=>[...new Set(e.map(Oy))].sort().join(`|`),Gy=(e,t)=>{let n=new Set(t.map(Wy));return[...e.filter(e=>!n.has(Wy(e))),...t]},Ky=e=>{let t=Vy(e),n=Uy(t,`Always`,`And`),r=Uy(t,`Eventually`,`Or`),i=e=>{for(let t of e){let n=Hy(t,`Eventually`,`Or`);if(n&&!(Ay(e,n.first)||Ay(e,n.second)))return Gy(a([...e,n.first]),a([...e,n.second]))}let t=r.find(t=>(Ay(e,t.first)||Ay(e,t.second))&&!Ay(e,t.whole));return t?a([...e,t.whole]):[e]},a=e=>{if(!By(e))return[];let t=[...e];for(let e=0;e<t.length;e++){let n=Hy(t[e],`Always`,`And`);n&&(Ay(t,n.first)||t.push(n.first),Ay(t,n.second)||t.push(n.second))}let r=!0;for(;r;){r=!1;for(let e of n)Ay(t,e.first)&&Ay(t,e.second)&&!Ay(t,e.whole)&&(t.push(e.whole),r=!0)}return t.length>e.length&&!By(t)?[]:i(t)};return a(e)},qy=e=>({particle:e,successors:[],statePredicates:e.filter(e=>wy(e)<=1)}),Jy=e=>{let t=Ky([e]).map(qy),n=t.length,r=/* @__PURE__ */ new Map;t.forEach((e,t)=>{let n=Wy(e.particle);r.has(n)||r.set(n,t)});for(let e=0;e<t.length;e++){let n=t[e].particle.flatMap(e=>e.kind===`Next`?[e.body]:[]);for(let i of Ky(n)){let n=Wy(i),a=r.get(n);a===void 0&&(r.set(n,t.length),t.push(qy(i))),t[e].successors.push(a??t.length-1)}}return{nodes:t,initialCount:n}},Yy=(e,t)=>!Ay(e,t)||Ay(e,t.body),Xy=(e,t)=>{if(e.kind===`Eventually`&&e.body.kind===`Always`&&wy(e.body.body)<3){t.eventuallyAlways.push(e.body.body);return}let n=Fy(e);if(n){let e=wy(n);if(e<=1){t.infinitelyOftenStates.push(n);return}if(e===2){t.infinitelyOftenActions.push(n);return}}if(Ty(e))throw new w(`Temporal formulas containing actions must be of forms <>[]A or []<>A.`);t.formulas.push(e)},Zy=(e,t)=>{let n=e.findIndex(e=>ky(e,t));return n===-1?(e.push(t),e.length-1):n},Qy=e=>{let t=Iy(Py(My(e,!1)));if(t.kind===`Boolean`&&!t.value)return[];let n=[];for(let e of t.kind===`Or`?t.operands:[t]){let t=Ly(e),r={eventuallyAlways:[],infinitelyOftenStates:[],infinitelyOftenActions:[],formulas:[]};for(let e of t.kind===`And`?t.operands:[t])Xy(e,r);let i=r.formulas,a=i.length===0?void 0:i.length===1?i[0]:Cy(`And`,i),o=n.find(e=>e.formula===void 0||a===void 0?e.formula===a:ky(e.formula,a));o?o.classifications.push(r):n.push({formula:a,classifications:[r]})}return n.map(e=>{let t=e.formula&&Ry(e.formula),n=[];t&&zy(t,n);let r=[],i=[],a=e.classifications.map(e=>({infinitelyOftenActions:e.infinitelyOftenActions.map(e=>Zy(i,e)),infinitelyOftenStates:e.infinitelyOftenStates.map(e=>Zy(r,e)),eventuallyAlways:e.eventuallyAlways.map(e=>Zy(i,e))}));return{tableau:t&&Jy(t),promises:n,stateChecks:r,actionChecks:i,models:a}})},$y=()=>x(new w(`Temporal formula is a tautology (its negation is unsatisfiable).`),S.livenessEvaluationFailure),eb=/* @__PURE__ */ new Set([`~>`,`-+->`]),tb=/* @__PURE__ */ new WeakSet,nb=/* @__PURE__ */ new Map([[`/\\`,`And`],[`\\/`,`Or`]]),rb=(e,t)=>({environment:e,scope:t,state:void 0,next:void 0}),ib=(e,t)=>new w(`TLC cannot handle the temporal formula ${U(e)}${t===void 0?``:`:\n${t}`}`),ab=(e,t,n,r=/* @__PURE__ */ new Set,i=/* @__PURE__ */ new Set)=>{let a=(e,t,r)=>{if(i.has(e))return 0;i.add(e);let a=ab(t,r,n,/* @__PURE__ */ new Set,i);return i.delete(e),a},o=e=>{let n=i_(t,e);if(!n)return;if(n.kind===`Value`)return 0;if(n.kind===`Thunk`)return n.isReleased?0:a(n,n.expression,n.scope);let r=n.operator;return r.kind===`Closure`?a(r,r.body,r.scope):0},s=e=>{if(n.variableIndex.has(e))return 1;if(n.constants.has(e))return 0;let t=h_(e,n);if(t)return mf(t,n);let r=n.builtins.get(n.substitutions.get(e)??e);if(r)return r.isActionLevel?2:r.isStateLevel&&!r.isLevelConstant?1:0},c=(e,t)=>r.has(e)?0:M(t)?o(e)??s(e)??0:s(e)??o(e)??0,l=e=>{let a=0;return pu(e,(e,o)=>(a=Math.max(a,ab(e,t,n,o.length===0?r:/* @__PURE__ */ new Set([...r,...o]),i)),e)),a};switch(e.kind){case`Prime`:case`Unchanged`:case`BoxAction`:case`AngleAction`:return 2;case`Enabled`:return 1;case`Always`:case`Eventually`:case`WeakFairness`:case`StrongFairness`:return 3;case`UnboundedQuantifier`:return e.isTemporal?3:l(e);case`Identifier`:return c(e.name,e);case`OperatorReference`:return c(e.operator,e);case`Apply`:{if(eb.has(e.operator))return 3;if(e.operator===`\\cdot`)return 2;let r=c(e.operator,e),i=Math.max(r,l(e)),o=M(e)?void 0:J_(e.operator,n);return i===r||o?.kind!==`Closure`||o.params.length!==e.args.length?i:a(o,o.body,sv(o,e.args,rb(n,t)))}default:return l(e)}},ob=(e,t)=>{try{return T_(e,t)}catch(e){if(!(e instanceof w))throw e;if(!Ft(e))return;throw x(new w(`${a}${e.message}`),S.error)}},sb=(e,t,n,r,i={name:void 0,path:[],expanding:/* @__PURE__ */ new Set,isSubstituted:!1})=>{let a=(e,t,a=i.name,o=i.expanding,s)=>sb(e,t,n,r,{name:a,path:s?.kind===`Operator`&&s.params.length===0?[...i.path,s.name]:i.path,expanding:o,isSubstituted:i.isSubstituted||s!==void 0&&n.substitutedDefinitions.has(s)});if(e.kind===`And`)return e.operands.flatMap(e=>a(e,t,U(e)));if(e.kind===`Label`)return a(e.body,t);if(e.kind===`Let`)return a(e.body,cb(e,t,n));if(e.kind===`Identifier`){let r=M(e)?i_(t,e.name):void 0;if(r?.kind===`Thunk`&&!r.isReleased)return a(r.expression,r.scope,tb.has(r)?e.name:i.name);let o=n.constants.has(e.name)?void 0:h_(e.name,n);if(!r&&o?.kind===`Operator`&&o.params.length===0&&(mf(o,n)>0||U_(o,n)===void 0)){if(i.expanding.has(o))throw m();return a(o.body,void 0,!i.isSubstituted&&n.instanceNames.get(e.name)||o.name,/* @__PURE__ */ new Set([...i.expanding,o]),o)}}let o=rb(n,t);if(e.kind===`Apply`&&n.runtime.version!==`1.7.4`&&(r||ab(e,t,n)===3)){let t=Y_(e,o),r=M(e)?void 0:h_(e.operator,n),s=t?.kind===`Closure`&&t.params.every(e=>n.instanceParams.has(e));if(t?.kind===`Closure`&&t.params.length===e.args.length&&!r?.isRecursive&&(!i.isSubstituted||s))return a(t.body,sv(t,e.args,o),i.isSubstituted&&r?r.name:e.operator,i.expanding,r)}let s=r&&e.kind===`Forall`&&e.bounds.every(e=>ab(e.set,t,n)===0),c=s?ob(e.bounds,o):void 0;if(s&&c){let n=[];if(E_(e.bounds,c,t,t=>(n.push(...a(e.body,t,U(e.body))),!1)),n.length===0)throw $y();return n}return[{expression:e,scope:t,name:i.name,path:i.path}]},cb=(e,t,n)=>{let r=dv(e.definitions,rb(n,t),pv(e.definitions,n));for(let e=r;e&&e!==t;e=e.parent)e.binding.kind===`Thunk`&&tb.add(e.binding);return r},lb=(e,t,n)=>{let r=n.runtime.version===`1.7.4`,a=(e,t,i)=>{let a=i===0&&!r?ab(e,t,n):i;if(a===0){let r=W(e,rb(n,t));if(typeof r!=`boolean`)throw new w(`TLC expected a boolean value, but did not find one. ${qg(e)}`);return vy(r)}return a===1?{kind:`State`,expression:e,scope:t}:e.kind===`AngleAction`?{kind:`Action`,expression:e.action,subscript:e.subscript,scope:t}:{kind:`Action`,expression:e,subscript:void 0,scope:t}},o=0,s=(e,t,r,i)=>{if(o>=100)throw m();o++;let s=p(e,t);o--;let c=wy(s),l=c===0&&ab(r,i,n)>2;return c>2||l?s:a(r,i,c)},c=(e,t)=>{let i=e.kind===`Identifier`?e.name:e.operator,a=rb(n,t),o=M(e)||h_(i,n)===void 0?i_(t,i):void 0;if(o?.kind===`Thunk`&&!o.isReleased&&tb.has(o))return l(e,()=>s(o.expression,o.scope,e,t));let c=o?.kind===`Operator`?o.operator:o?void 0:M(e)?X_(i,a):J_(i,n),u=e.kind===`Apply`?e.args:[],f=c?.kind===`Builtin`&&u.length===2?nb.get(c.name):void 0;if(f){let n=u.map(e=>p(e,t));return d(e,t,Cy(f,n))}if(c?.kind!==`Closure`)throw ib(e);let m=!M(e)&&h_(i,n)?.isRecursive===!0;return l(e,()=>(r&&u.filter(e=>e.kind!==`Lambda`&&e.kind!==`OperatorReference`).forEach(e=>W(e,a)),s(c.body,sv(c,u,a),e,t)),m)},l=(e,t,n=!1)=>{try{return t()}catch(t){let a=t instanceof i||n&&!r;throw!(t instanceof w)||a?t:ib(e)}},u=(e,t)=>{let r=ab(e,t,n),o=[],s=e.kind===`Forall`;try{D_(e.bounds,rb(n,t),t=>(o.push(p(e.body,t)),!1))}catch(n){if(!(n instanceof w)||n instanceof i)throw n;if(r<=2)return a(e,t,r);throw ib(e,s&&!Ft(n)?n.message:void 0)}return o.length===0?vy(s):d(e,t,Cy(s?`And`:`Or`,o))},d=(e,t,n)=>{let r=wy(n);return r>2?n:a(e,t,r)},f=(e,t)=>{let n=e.operands,r=e.location.range,i=e.prefixEnds;return e.isBulleted||!r||!i?d(e,t,Cy(e.kind,n.map(e=>p(e,t)))):n.slice(1).reduce((a,o,s)=>{let c=s===n.length-2?e:{...e,operands:n.slice(0,s+2),prefixEnds:i.slice(0,s+1),location:{...e.location,range:{...r,end:i[s]}}};return d(c,t,Cy(e.kind,[a,p(o,t)]))},p(n[0],t))},p=(e,t)=>{let i=ab(e,t,n);switch(e.kind){case`Label`:return p(e.body,t);case`Let`:return p(e.body,cb(e,t,n));case`Apply`:{let n=e.args;if(e.operator===`~`&&!M(e))return d(e,t,xy(`Not`,p(n[0],t)));if(e.operator===`=>`)return d(e,t,Sy(`Or`,xy(`Not`,p(n[0],t)),p(n[1],t)));break}case`And`:case`Or`:return f(e,t);case`Forall`:case`Exists`:return u(e,t);case`If`:{if(!r&&ab(e.condition,t,n)===0){let r=W(e.condition,rb(n,t));if(typeof r==`boolean`)return p(r?e.consequent:e.alternative,t)}let i=p(e.condition,t);return d(e,t,Sy(`Or`,Sy(`And`,i,p(e.consequent,t)),Sy(`And`,xy(`Not`,i),p(e.alternative,t))))}}if(i<=2)return a(e,t,i);switch(e.kind){case`Identifier`:return c(e,t);case`Apply`:return e.operator===`~>`?xy(`Always`,Sy(`Or`,xy(`Not`,p(e.args[0],t)),xy(`Eventually`,p(e.args[1],t)))):c(e,t);case`Always`:case`Eventually`:return xy(e.kind,p(e.expression,t));case`WeakFairness`:case`StrongFairness`:{let n={kind:`AngleAction`,action:e.action,subscript:e.subscript,location:e.action.location},r={kind:`Enabled`,step:e.enabled??n,scope:t},i=xy(`Not`,r),a={kind:`Action`,expression:e.action,subscript:e.subscript,scope:t,enabled:r};return e.kind===`WeakFairness`?xy(`Always`,xy(`Eventually`,Sy(`Or`,i,a))):Sy(`Or`,xy(`Eventually`,xy(`Always`,i)),xy(`Always`,xy(`Eventually`,a)))}default:throw ib(e)}};return p(e,t)},ub=e=>({holdsState:(t,n)=>{let r={environment:e,scope:t.scope,state:n,next:void 0},i=t.kind===`State`?W(t.expression,r):Pg(t.step,r);if(typeof i!=`boolean`)throw new w(`A state predicate was evaluated to a non-boolean value.`);return i},holdsAction:(t,n,r)=>{let i=t.scope,a=t.subscript;if(a&&Kr(W(a,{environment:e,scope:i,state:n,next:void 0}),W(a,{environment:e,scope:i,state:r,next:void 0})))return!1;let o=W(t.expression,{environment:e,scope:i,state:n,next:r});if(typeof o!=`boolean`)throw new w(`Encountered an action predicate that's not a boolean.`);return o}}),db=(e,t,n,r,i)=>{let a=e=>db(e,t,n,r,i);switch(e.kind){case`Boolean`:return e.value;case`State`:case`Enabled`:{let n=i.get(e);if(n!==void 0)return n;let a=r.holdsState(e,t);return i.set(e,a),a}case`Action`:return e.enabled&&i.get(e.enabled)===!1?!1:n!==void 0&&r.holdsAction(e,t,n);case`Not`:return!a(e.body);case`And`:return e.operands.every(a);case`Or`:return e.operands.some(a);case`Next`:return db(e.body,n??t,void 0,r,/* @__PURE__ */ new Map);case`Always`:case`Eventually`:throw new w(`TLC cannot evaluate a temporal formula in a single step`)}},fb=(e,t,n,r,i)=>{let a=e=>e+1<t.length?e+1:n,o=e=>t.map((e,t)=>t).filter(t=>t>=Math.min(e,n)),s=(e,a=r)=>fb(e,t,n,a,i);switch(e.kind){case`Not`:return!s(e.body);case`And`:return e.operands.every(e=>s(e));case`Or`:return e.operands.some(e=>s(e));case`Next`:return s(e.body,a(r));case`Always`:return o(r).every(t=>s(e.body,t));case`Eventually`:return o(r).some(t=>s(e.body,t));default:return db(e,t[r],t[a(r)],ub(i),/* @__PURE__ */ new Map)}},pb=`UnnamedAction`,mb={module:`--TLA+ BUILTINS--`,start:{line:0,column:0},end:{line:0,column:0}},hb=e=>{let t=e.range??mb;return pi([[`beginLine`,t.start.line],[`beginColumn`,t.start.column],[`endLine`,t.end.line],[`endColumn`,t.end.column],[`module`,t.module]])},gb=(e,t)=>{let n=[[`name`,e.name],[`location`,hb(e.location)]];return e.parameters.length>0&&n.push([`context`,pi(e.parameters)],[`parameters`,fi(e.parameters.map(e=>e[0]))]),t!==void 0&&n.push([`coverage`,t]),pi(n)},_b=(e,t,n)=>({name:e,location:t.location,parameters:[],expression:t,scope:n}),vb=(e,t)=>({environment:e,scope:t,state:void 0,next:void 0}),yb=e=>e.kind===`Identifier`?e.name:e.kind===`Apply`?e.operator:void 0,bb=e=>e.kind===`Apply`?e.args:[],xb=(e,t,n)=>{let r=yb(e);if(r===void 0)return;if(M(e)){let e=i_(t,r);return e?.kind===`Operator`&&e.operator.kind===`Closure`?e.operator:void 0}if(n.constants.has(r)||n.variableIndex.has(r))return;let i=J_(r,n);return i?.kind===`Closure`?i:void 0},Sb=(e,t)=>{try{return W(e,vb(t,void 0)),!0}catch(e){if(e instanceof v)return!1;throw e}},Cb=(e,t)=>e?.kind===`Operator`&&e.params.length===0&&uf(e,t)&&Sb(e.body,t),wb=(e,t)=>e?.kind===`Operator`&&e.body.kind!==`Number`&&e.body.kind!==`String`&&Cb(e,t),Tb=(e,t)=>{let n=h_(e.name,t);return n?.body===e.body&&wb(n,t)},Eb=(e,t)=>{if(e.kind!==`Identifier`||!M(e))return;let n=i_(t,e.name);return n?.kind===`Thunk`?n:void 0},Db=(e,t,n)=>{if(e.kind===`Let`)return{expression:e.body,scope:cb(e,t,n)};let r=Eb(e,t);return r&&{expression:r.expression,scope:r.scope}},Ob=(e,t,n,r)=>t.kind===`Apply`?sv(e,t.args,vb(r,n)):e.scope,kb=(e,t)=>(e?.params??[]).flatMap(e=>{let n=i_(t,e.name);return n?.kind===`Value`?[[e.name,n.value]]:[]}),Ab=(e,t)=>{try{return e()}catch(e){if(e instanceof v)return t();throw e}},jb=(e,t,n,r,i)=>{let a=bb(t),o=()=>[{name:e.name,location:t.location,parameters:[],expression:t,scope:n}];return r&&a.length===0?[{...e,parameters:[],expression:r.body,scope:r.scope}]:r?a.some(e=>ab(e,n,i)!==0)?o():Ab(()=>[{...e,parameters:a.map((e,t)=>[r.params[t].name.replace(/#\d+$/,``),W(e,vb(i,n))]),expression:t,scope:n}],o):[{...e,parameters:[],expression:t,scope:n}]},Mb=(e,t,n,r,i)=>{let a=()=>({name:n?.name??pb,location:e.location,parameters:kb(n,t),expression:e,scope:t});if(Ch.has(e.kind))throw x(new w(`${l}The next state relation is not a boolean expression.\n${qg(e)}`),S.error);switch(e.kind){case`Let`:return Mb(e.body,cb(e,t,r),n,r,i);case`Label`:return Mb(e.body,t,n,r,i);case`Or`:return e.operands.flatMap(e=>Mb(e,t,n,r,i));case`Exists`:return Ab(()=>{let o=[];return D_(e.bounds,vb(r,t),t=>(o.push(...Mb(e.body,t,n,r,i)),!1)),o.length===0?[a()]:o},()=>[a()])}let o=M(e)?void 0:i.get(yb(e)??``),s=xb(e,t,r);if(o)return jb(o,e,t,s,r);if(!s)return[a()];let c=bb(e),u=M(e)?s.name:r.instanceNames.get(yb(e)??``)??s.name,d=()=>[{name:u,location:e.location,parameters:[],expression:e,scope:t}];return Tb(s,r)||c.some(e=>ab(e,t,r)!==0)?d():Ab(()=>{let e=c.reduce((e,n,i)=>({name:s.params[i].name,binding:{kind:`Value`,value:W(n,vb(r,t))},parent:e}),s.scope);return Mb(s.body,e,{...s,name:u},r,i)},d)},Nb=(e,t,n,r,i,a=[])=>{let o=(e,t,o=a)=>Nb(e,t,n,r,i,o),s=(e,t,n)=>_b(e,ou(t,a),n),c=Db(e,t,n);if(c){o(c.expression,c.scope);return}let l=xb(e,t,n);if(l&&Tb(l,n))return;let u=l?[...a,...au.get(l.body)??[]]:a;if(l&&l.params.length===0){if(ab(l.body,l.scope,n)===1){r.inits.push(s(l.name,l.body,l.scope));return}o(l.body,l.scope,u);return}if(l&&e.kind===`Apply`&&l.params.length===e.args.length){o(l.body,sv(l,e.args,vb(n,t)),u);return}if(e.kind===`And`){e.operands.forEach(e=>o(e,t));return}if(e.kind===`Always`){if(e.expression.kind===`BoxAction`){i.push({expression:e.expression.action,scope:t,frames:a});return}r.temporals.push(s(pb,e,t));return}let d=ab(e,t,n);d<=1?r.inits.push(s(pb,e,t)):d===3&&r.temporals.push(s(pb,e,t))},Pb=(e,t,n,r,i)=>{let a=(t,n)=>Pb(e,t,n,r,i),o=Db(t,n,r);if(o){a(o.expression,o.scope);return}let s=xb(t,n,r);if(s&&Tb(s,r))return;if(s&&s.params.length===bb(t).length){a(s.body,Ob(s,t,n,r));return}if(t.kind===`Forall`&&Ab(()=>(D_(t.bounds,vb(r,n),e=>(a(t.body,e),!1)),!0),()=>!1))return;if(t.kind===`And`){t.operands.forEach(e=>a(e,n));return}if(t.kind===`Always`){let a=t.expression;a.kind===`BoxAction`?i.impliedActions.push(_b(e,a)):ab(a,n,r)<2?i.invariants.push(_b(e,a)):i.impliedTemporals.push(_b(e,t));return}let c=ab(t,n,r);c<=1?i.impliedInits.push(_b(e,t)):c===3&&i.impliedTemporals.push(_b(e,t))},Fb=(e,t)=>{let n=h_(e,t);return n?.kind===`Operator`&&!wb(n,t)?n:void 0},Ib=(e,t,n)=>{let r={inits:[],actions:[],temporals:[]},i=[],a=e.specification===void 0?void 0:Fb(e.specification,t);a&&(Nb(a.body,void 0,t,r,i),i.forEach(e=>r.actions.push(...e.frames.length>0?[{name:pb,location:e.frames[0].location,parameters:[],expression:ou(e.expression,e.frames),scope:e.scope}]:Mb(e.expression,e.scope,void 0,t,n))));let o=e.init===void 0?void 0:J_(e.init,t);o?.kind===`Closure`&&r.inits.push(_b(e.init??``,o.body));let s=e.next===void 0?void 0:J_(e.next,t);return s?.kind===`Closure`&&r.actions.push(...Mb(s.body,s.scope,s,t,n)),r},Lb=(e,t,n)=>{let r=[],i=(e,t)=>{if(e.kind===`Number`||e.kind===`Decimal`||e.kind===`String`)return!1;if(e.kind===`Tuple`)return e.elements.every(e=>i(e,t));if(e.kind===`Label`)return i(e.body,t);let a=Db(e,t,n);if(a)return i(a.expression,a.scope);let o=e.kind===`Identifier`&&M(e)?i_(t,e.name):void 0;if(o?.kind===`Value`&&o.argument)return i(o.argument,t);if(e.kind===`Identifier`&&!M(e)&&n.variableIndex.has(e.name))return r.push(e.name),!0;let s=xb(e,t,n);if(!s||s.params.length!==bb(e).length)return!0;let c=h_(s.name,n);return c?.body===s.body&&Cb(c,n)?!0:i(s.body,Ob(s,e,t,n))};return i(e,t)?r:void 0},Rb=e=>e.parameters.length===0?``:`(${e.parameters.map(e=>L(e[1])).join(`,`)})`,zb=(e,t,n=!1)=>`${e.name===pb?n?`Initial predicate`:`Action`:e.name}${t===`1.7.4`?``:Rb(e)} ${g(e.location.range??mb)}`,Bb=e=>`${e.name}${Rb(e)}`,Vb=(e,t,n,r)=>{let i={invariants:[],impliedInits:[],impliedActions:[],impliedTemporals:[]};t.invariants.forEach(e=>{let t=Fb(e,n);t&&i.invariants.push(_b(e,t.body))}),t.properties.forEach(e=>{let t=Fb(e,n);t&&Pb(e,t.body,void 0,n,i)});let a=n.coverage,o=(e,t)=>Yr(e.map(e=>{let n=a&&t&&ls(a,t,e.expression);return gb(e,n&&pi(n))})),s=e=>Yr(e.flatMap(e=>{let t=Fb(e,n);return t?[pi([[`name`,t.name],[`location`,hb(t.location)]])]:[]}));return pi([[`inits`,o(e.inits,`init`)],[`actions`,o(e.actions,`next`)],[`temporals`,o(e.temporals)],[`invariants`,o(i.invariants,`invariant`)],[`impliedinits`,o(i.impliedInits,`implied`)],[`impliedactions`,o(i.impliedActions,`implied`)],[`impliedtemporals`,o(i.impliedTemporals)],[`variables`,Yr(n.variables.map((e,t)=>pi([[`name`,e],[`location`,hb(r[t])],...a?[[`coverage`,pi([[`distinct`,Zo(a,t)]])]]:[]])))],[`actionconstraints`,s(t.actionConstraints)],[`constraints`,s(t.constraints)]])},Hb=e=>{switch(e.kind){case`Always`:return!0;case`Eventually`:case`Not`:case`Next`:return Hb(e.body);case`And`:case`Or`:return e.operands.some(Hb);default:return!1}},Ub=e=>e.eventuallyAlways.length===0&&e.infinitelyOftenStates.length===0&&e.infinitelyOftenActions.length===0,Wb=e=>e.promises.some(e=>Hb(e.body))||e.models.some(e=>!Ub(e)),Gb=(e,t)=>e.every((e,n)=>yr(e,t[n])),Kb=e=>e.filter((t,n)=>n===0||e[n-1]!==t),qb=e=>({data:e(1024),length:0,create:e}),Jb=(e,t,n,r=0,i=n.length-r)=>{let a=t+i;if(a>e.data.length){let t=e.create(Math.max(2*e.data.length,a));t.set(e.data),e.data=t}for(let a=0;a<i;a++)e.data[t+a]=n[r+a];e.length=Math.max(e.length,a)},Yb=(e,t,n)=>{let r=e.slots.length/3-1,i=Math.imul(Math.imul(t,2654435761)^n,2246822507)>>>e.shift;for(let a=i;;a=a+1&r){let r=a*3,i=e.slots[r];if(i===0||i===t+1&&e.slots[r+1]===n)return r}},Xb=e=>new Int32Array(e).fill(-1),Zb=(e,t)=>(e.edgeStarts[t]??-1)!==-1,Qb=(e,t)=>{let n=e.edgeStarts[t];return e.edgeTargets.data.subarray(n,n+e.edgeCounts[t])},$b=(e,t,n)=>e.stateResults.data[e.nodeStates[t]*e.solution.stateChecks.length+n]===1,ex=(e,t,n)=>(e.nodeStates.push(t),e.nodeTableaux.push(n),e.edgeStarts.push(-1),e.edgeCounts.push(0),e.nextSiblings.push(-1),e.nodeStates.length-1),tx=(e,t)=>{let n=[];for(let r=e.firstNodes.data[t]??-1;r!==-1;r=e.nextSiblings[r])n.push(r);return n},nx=2**53-1,rx=(e,t,n)=>{let r=t.map(e=>lb(e.expression,e.scope,n)),i=e.map(e=>xy(`Not`,lb(e.expression,e.scope,n))),a=i.length===1?i[0]:Cy(`Or`,i);return{formula:r.length===0?a:Cy(`And`,[...r,a]),negations:i}},ix=e=>{switch(e.kind){case`State`:return[e];case`Enabled`:return[{expression:e.step,scope:e.scope}];case`Action`:return[e.expression,e.subscript].flatMap(t=>t?[{expression:t,scope:e.scope}]:[])}},ax=(e,t)=>{switch(e.kind){case`Boolean`:return;case`State`:case`Enabled`:case`Action`:t.add(e);return;case`And`:case`Or`:e.operands.forEach(e=>ax(e,t));return;default:ax(e.body,t)}},ox=e=>{let t=/* @__PURE__ */ new Set;for(let n of e)[...n.stateChecks,...n.actionChecks,...n.tableau?.nodes.flatMap(e=>e.statePredicates)??[]].forEach(e=>ax(e,t));return[...t]},sx=e=>ox(e).flatMap(e=>ix(e).map(e=>e.expression)),cx=(e,t,n,r)=>{if(e.length===0)return;let i=rx(e,t,n),a=/* @__PURE__ */ new Set;ax(i.formula,a);let o=[...a].flatMap(ix),s=o.every(e=>e.scope===void 0)?!ff(o.map(e=>e.expression),n,`repeated`):!hv(n),c={environment:n,atoms:ub(n)},l=Qy(i.formula),u=lx(l,{atoms:{holdsState:(e,t)=>c.atoms.holdsState(e,t),holdsAction:(e,t,n)=>c.atoms.holdsAction(e,t,n)},isShared:s,isSame:Gb,evaluateFrom:(e,t)=>{n.runtime.setLivenessSource(e);try{return t()}finally{n.runtime.setLivenessSource(void 0)}}},r,n.runtime.version!==`1.7.4`),d=(e,t)=>{if(e===void 0)return t();c.atoms=ub(e);try{return t()}finally{c.atoms=ub(n)}};return{branches:u.branches,solutions:l,addInitialState:(e,t,n)=>d(n,()=>u.addInitialState(e,t)),addState:(e,t,n,r)=>d(r,()=>u.addState(e,t,n,r!==void 0)),storeState:u.storeState,getStateCounts:u.getStateCounts,findViolation:u.findViolation,getViolatedProperties:(t,r)=>[...new Set(e.filter((e,a)=>!fb(i.negations[a].body,t,r,0,n)).map(e=>e.name))]}},lx=(e,t,n,r)=>{let i=/* @__PURE__ */ new Map,a=1,o=t.isShared,s=t.atoms,c=t.evaluateFrom,l=/* @__PURE__ */ new Map,u=[],d=e=>{let t=l.get(e)??l.size;return l.set(e,t),u[t]=e,t},f=e=>{if(e.kind===`State`||e.kind===`Enabled`)return[d(e)*2+1];if(e.kind===`Not`){let t=e.body;return t.kind===`State`||t.kind===`Enabled`?[d(t)*2]:void 0}if(e.kind!==`And`)return;let t=e.operands.map(f);return t.every(e=>e!==void 0)?t.flat():void 0},p=e=>new Int8Array(e*l.size).fill(-1),m=e=>new Int8Array(e*i.size).fill(-1),h=(e,t,n,r,i)=>o?e(t,n,r,i):e(t,p(1),0,i),g=e=>{switch(e.kind){case`Boolean`:{let t=e.value;return()=>t}case`State`:case`Enabled`:{let t=d(e);return(n,r,i)=>(r[i+t]===-1&&(r[i+t]=+!!s.holdsState(e,n)),r[i+t]===1)}case`Action`:{let t=e.enabled&&d(e.enabled);return(n,r,i,a)=>(t===void 0||r[i+t]!==0)&&a!==void 0&&s.holdsAction(e,n,a)}case`Not`:{let t=g(e.body);return(e,n,r,i)=>!t(e,n,r,i)}case`And`:{let t=e.operands.map(g);return(e,n,r,i)=>t.every(t=>t(e,n,r,i))}case`Or`:{let t=e.operands.map(g);return(e,n,r,i)=>t.some(t=>t(e,n,r,i))}case`Next`:{let t=g(e.body);return(e,n,r,i)=>t(i??e,p(1),0,void 0)}case`Always`:case`Eventually`:return()=>{throw new w(`TLC cannot evaluate a temporal formula in a single step`)}}},_=e.map(e=>({solution:e,checks:{states:e.stateChecks.map(g),actions:e.actionChecks.map(g),nodes:e.tableau?.nodes.map(e=>{let t=o?f({kind:`And`,operands:e.statePredicates}):void 0;return t?Int32Array.from(t):e.statePredicates.map(g)})??[]},actionIds:Int32Array.from(e.actionChecks,e=>{let t=Oy(e),n=i.get(t)??i.size;return i.set(t,n),n}),nodeStates:[],nodeTableaux:[],edgeStarts:[],edgeCounts:[],edgeTargets:qb(e=>new Int32Array(e)),edgeActions:qb(e=>new Uint8Array(e)),stateResults:qb(e=>new Uint8Array(e)),initial:[],firstNodes:qb(Xb),lastNodes:qb(Xb),nextSiblings:[],nodeIds:{slots:/* @__PURE__ */ new Int32Array(3072),size:0,shift:22},isDone:[],stateCount:0,errorNode:void 0})),v=(e,t,n,r,i)=>c(t,()=>{let t=e.checks.states,a=new Uint8Array(t.length);return t.forEach((e,t)=>{a[t]=+!!h(e,n,r,i)}),a}),y=(e,t,n,r,i,a,s,l,u,d)=>c(t,()=>{let t=e.checks.actions;for(let c=0;c<t.length;c++){if(!o){u[d+c]=+!!h(t[c],n,r,i,a);continue}let f=l+e.actionIds[c];s[f]===-1&&(s[f]=+!!t[c](n,r,i,a)),u[d+c]=s[f]}}),ee=(e,t,n,r,i)=>{let a=e.checks.nodes[t];if(!(a instanceof Int32Array))return a.every(e=>h(e,n,r,i));for(let e=0;e<a.length;e++){let t=a[e],o=i+(t>>1);if(r[o]===-1&&(r[o]=+!!s.holdsState(u[t>>1],n)),r[o]!==(t&1))return!1}return!0},b=(e,t,n,r,i,a)=>c(n,()=>ee(e,t,r,i,a)),x=(e,t)=>{if(!r)return!1;let n=e.nodes[t];return n.particle.length===0&&n.successors.length===1&&n.successors[0]===t},te=(e,t,n)=>{if(!e.solution.tableau)return t;let r=e.nodeIds.slots,i=Yb(e.nodeIds,t,n);return r[i]===0?void 0:r[i+2]},S=(e,t,n,r)=>{let i=e.nodeIds;if(++i.size*2>i.slots.length/3){let e=i.slots;i.slots=new Int32Array(e.length*2),i.shift--;for(let t=0;t<e.length;t+=3)e[t]!==0&&i.slots.set(e.subarray(t,t+3),Yb(i,e[t]-1,e[t+1]))}if(i.slots.set([t+1,n,r],Yb(i,t,n)),t<0)return r;let a=e.lastNodes.data[t]??-1;return a===-1?Jb(e.firstNodes,t,[r]):e.nextSiblings[a]=r,Jb(e.lastNodes,t,[r]),r},ne=(e,t)=>t<0?e.checks.nodes.some((n,r)=>te(e,t,r)!==void 0):e.isDone[t]===!0||(e.firstNodes.data[t]??-1)!==-1,C=(e,t,n)=>(ne(e,t)||e.stateCount++,S(e,t,n,ex(e,t,n))),re=(e,t,n,r,i,a)=>{let o=e.edgeTargets.length,s=e.solution.actionChecks.length;Jb(e.edgeTargets,o,n),i.forEach((t,n)=>Jb(e.edgeActions,(o+n)*s,r,t*s,s)),Jb(e.stateResults,e.nodeStates[t]*a.length,a),e.edgeStarts[t]=o,e.edgeCounts[t]=n.length},T={slots:/* @__PURE__ */ new Int32Array},ie=(e,r,i)=>{let o=[...i,{index:e,state:r}],s=16*a;T.slots=T.slots.length===s?T.slots.fill(0):new Int32Array(s);let c=e=>{let r=T.slots,i=o[e];for(let a=(n.getFingerprint(i)&2147483647)%r.length;;a=(a+1)%r.length){let n=r[a];if(n===0)return r[a]=e+1,!0;let s=o[n-1];if(s.index===i.index&&t.isSame(s.state,i.state))return!1}},l=0;for(let e=0;e<o.length;e++){if(l>=T.slots.length>>1){let e=T.slots;T.slots=new Int32Array(2*e.length+1);for(let t of e)t!==0&&c(t-1)}c(e)&&l++}T.slots.length>s&&a++;let u=[];for(let e of T.slots)e!==0&&u.push(o[e-1]);return u},ae=(e,t,r,a,o,s,c)=>{let l=v(e,a,r,s,c),u=t.nodes[e.nodeTableaux[o]],d=e.checks.actions.length,f=[],h=[],g=new Uint8Array(d);u.successors.length>0&&y(e,a,r,s,c,r,m(1),0,g,0);for(let n of u.successors){if(!b(e,n,a,r,s,c))continue;if(x(t,n)&&e.errorNode===void 0&&e.solution.models.some(Ub)){e.errorNode=o;return}let i=te(e,a,n);if(i!==void 0&&h.includes(i))continue;let l=i??C(e,a,n);h.push(l),f.push(0),i===void 0&&ae(e,t,r,a,l,s,c)}let _=[g],ee=1;if(n.forEachActionSuccessors(a,r,n=>{let o=m(n.length),l=new Uint8Array(n.length*d);_.push(l);for(let m=0;m<n.length;m++){let g=n[m],_=p(1);y(e,a,r,s,c,g.state,o,m*i.size,l,m*d);let v=e.isDone[g.index]===!0;for(let n of u.successors){if(!b(e,n,a,g.state,_,0))continue;let r=te(e,g.index,n);if(r!==void 0&&h.includes(r))continue;let i=r??C(e,g.index,n);h.push(i),f.push(ee+m),r===void 0&&v&&ae(e,t,g.state,g.index,i,_,0)}}ee+=n.length}),h.length>0){let t=new Uint8Array(ee*d);for(let e=0,n=0;e<_.length;e++)t.set(_[e],n),n+=_[e].length;re(e,o,h,t,f,l)}},oe=(e,t,n,r,i,a,o)=>{let s=l.size,u=new Uint8Array(t.nodes.length*n.length);c(o,()=>{for(let i=0;i<t.nodes.length;i++)for(let t=0;t<n.length;t++)ee(e,i,n[t].state,r,t*s)&&(u[i*n.length+t]=1)}),ne(e,o)||e.stateCount++,e.isDone[o]=!0;for(let c of tx(e,o)){let o=[],l=[];n.forEach((i,a)=>{let d=e.isDone[i.index]===!0;for(let f of t.nodes[e.nodeTableaux[c]].successors){if(u[f*n.length+a]===0)continue;let c=te(e,i.index,f);if(c!==void 0&&o.includes(c))continue;let p=c??C(e,i.index,f);o.push(p),l.push(a),c===void 0&&d&&ae(e,t,i.state,i.index,p,r,a*s)}}),re(e,c,o,i,l,a)}return e.errorNode===void 0?void 0:le(e,e.errorNode)},se=(e,t,n,r,i)=>{for(;e.nodeStates.length<=i;)ex(e,e.nodeStates.length,-1);let a=[],o=[];t.forEach((t,n)=>{Zb(e,t.index)&&a.includes(t.index)||(a.push(t.index),o.push(n))}),Zb(e,i)||e.stateCount++,re(e,i,a,n,o,r)},ce=(e,t)=>{if(e.initial.includes(t))return[t];let n=/* @__PURE__ */ new Map,r=[];for(let t of e.initial)Zb(e,t)&&(r.push(t),n.set(t,-1));for(let i=0;i<r.length;i++){let a=r[i];for(let i of Qb(e,a))if(!(i===a&&e.solution.tableau)){if(i===t){let e=[t];for(let t=a;t!==-1;t=n.get(t)??-1)e.push(t);return e}Zb(e,i)&&!n.has(i)&&(n.set(i,a),r.push(i))}}throw new w(`Couldn't re-create liveness trace (path) starting at: ${t}`)},le=(e,t)=>Kb(ce(e,t).reverse().map(t=>e.nodeStates[t])),E=(e,t)=>{let n=e.solution,r=n.actionChecks.length,i=(t,n,i)=>e.edgeActions.data[(e.edgeStarts[t]+n)*r+i]===1,a=(e,n)=>t.eventuallyAlways.every(t=>i(e,n,t)),o=new Float64Array(e.nodeStates.length).fill(-1),s=e.initial.filter(t=>Zb(e,t)),c=[],l=t=>{let n=Qb(e,t).indexOf(t);return n!==-1&&a(t,n)},u=(t,r)=>n.tableau!==void 0&&Yy(n.tableau.nodes[e.nodeTableaux[t]].particle,r),d=r=>{let s=c.pop()??r;if(s===r&&!l(s)){o[s]=nx;return}let d=/* @__PURE__ */ new Set,p=/* @__PURE__ */ new Map;for(let t=s;;t=c.pop()??r){d.add(t);let n=p.get(e.nodeStates[t]);if(n?n.push(t):p.set(e.nodeStates[t],[t]),o[t]=nx,t===r)break}let m=t.infinitelyOftenStates.every(t=>[...d].some(n=>$b(e,n,t))),h=t.infinitelyOftenActions.every(t=>[...d].some(n=>Qb(e,n).some((e,r)=>d.has(e)&&a(n,r)&&i(n,r,t)))),g=n.promises.every(e=>[...d].some(t=>u(t,e)));if(m&&h&&g)return f(r,d,p)},f=(r,o,s)=>{let c=le(e,r),l=[],d=/* @__PURE__ */ new Set([r]),f=t.infinitelyOftenStates.map(()=>!1),m=t.infinitelyOftenActions.map(()=>!1),h=n.promises.map(()=>!1),g=f.length+m.length+h.length,_=r,v=e=>{l.push(_),_=e};for(;g>0;){let r=g;for(;t.infinitelyOftenStates.forEach((t,n)=>{!f[n]&&$b(e,_,t)&&(f[n]=!0,g--)}),n.promises.forEach((e,t)=>{!h[t]&&u(_,e)&&(h[t]=!0,g--)}),!(g<=0);){let n=-1,c=-1,u=g;if(Qb(e,_).some((r,l)=>{if(s.has(e.nodeStates[r])){if(!o.has(r)||!a(_,l))return!1;n=r,t.infinitelyOftenActions.forEach((e,t)=>{!m[t]&&i(_,l,e)&&(m[t]=!0,g--)})}return g<u?(v(r),d.clear(),!0):(o.has(r)&&!d.has(r)&&(c=r),!1)}))break;if(g<r){v(n),d.clear();break}for(;c===-1;){let t=l.pop();if(t===void 0)throw new w(`TLC failed to build the counterexample of a liveness property`);_=t,c=Qb(e,t).find(e=>o.has(e)&&!d.has(e))??-1}v(c),d.add(c)}}let y=p(r,_,s);for(let t=l.length-1;t>=0;t--){let n=e.nodeStates[l[t]];y[y.length-1]!==n&&y.push(n)}let ee=c[c.length-1];return y[y.length-1]===ee&&y.pop(),{prefix:c.slice(0,-1),cycle:[ee,...y.reverse()],isCycleConstrained:Wb(n)}},p=(t,n,r)=>{if(n===t)return[];let i=e.nodeStates[n],o=/* @__PURE__ */ new Map,s=/* @__PURE__ */ new Set([i]),c=[];for(let n=i,l=-1,u=0;;u++){for(let u of r.get(n)??[])for(let[d,f]of Qb(e,u).entries()){if(f===u||!a(u,d))continue;if(f===t){let e=[];for(let t=n,r=l;t!==i;)e.push(t),t=r,r=o.get(t)??-1;return e.push(i),e}let p=e.nodeStates[f];r.has(p)&&!s.has(p)&&(s.add(p),c.push([p,n]))}o.set(n,l);let d=c[u];if(d===void 0)throw new w(`TLC failed to build the counterexample of a liveness property`);n=d[0],l=d[1]}};for(let t=0;t<s.length;t++){let n=[s[t],-1,0],r=0;for(;n.length>=3;){let t=n.pop()??0,i=n.pop(),l=n.pop()??0;if(i===-42){if(o[l]===t){let e=d(l);if(e)return e}n.push(Math.min(n.pop()??t,t));continue}if(o[l]!==-1){n.push(Math.min(t,o[l]));continue}o[l]=r,n.push(t,l,-42),c.push(l);let u=r++;Qb(e,l).forEach((t,r)=>{Zb(e,t)&&(a(l,r)?o[t]===-1?n.push(t,-1):u=Math.min(u,o[t]):o[t]===-1&&s.push(t))}),n.push(u)}}};return{branches:_.length,addInitialState:(e,t)=>{let n=p(1);for(let r of _){let i=r.solution.tableau;if(!i)r.initial.push(e);else for(let a=0;a<i.initialCount;a++)b(r,a,void 0,t,n,0)&&r.initial.push(te(r,e,a)??C(r,e,a))}},addState:(e,t,n,r)=>{let a=ie(e,t,n),o=p(a.length),s=a.findIndex(t=>t.index===e)*l.size,c=m(a.length);for(let n of _){let l=n.checks.actions.length,u=new Uint8Array(a.length*l);a.forEach((r,a)=>y(n,e,t,o,s,r.state,c,a*i.size,u,a*l));let d=v(n,e,t,o,s),f=n.solution.tableau;if(r&&(f?tx(n,e).some(e=>n.edgeCounts[e]>0):a.every(e=>Zb(n,e.index))))throw new w(`The behavior graph holds every edge of the state already.`);if(!f){se(n,a,u,d,e);continue}let p=oe(n,f,a,o,u,d,e);if(p)return p}},storeState:(e,t)=>{for(let n of _){let r=n.solution.tableau;if(!r)continue;let i=[];for(let t=0;t<r.nodes.length;t++){let r=te(n,e,t);r!==void 0&&i.push(r)}for(let e of i.sort((e,t)=>e-t))n.nodeStates[e]=t,S(n,t,n.nodeTableaux[e],e)}},getStateCounts:()=>_.map(e=>e.stateCount),findViolation:()=>{for(let e of _)for(let t of e.solution.models){let n=E(e,t);if(n)return n}}}},ux=e=>{switch(e.kind){case`Number`:if(!_n(e.value))throw x(new t(`TLC can't handle a number this big.\n${e.value}`),S.error);return e.value;case`String`:case`Boolean`:return e.value;case`ModelValue`:return nr(e.name);case`Set`:return F({kind:`MixedSet`,elements:e.elements.map(ux)})}},dx=e=>{try{return ux(e)}catch(e){throw!(e instanceof w)||e instanceof t||e instanceof f?e:x(new w(`${l}${e.message}`),S.error)}},fx=(e,t,n)=>{let r=`{ ${n.map(e=>`<${[...e[0],e[1]].map(e=>L(e)).join(`, `)}>`).join(`, `)}}`;return{kind:`Builtin`,name:e,arity:t,evaluate:e=>{let t=n.find(t=>{if(t[0].length!==e.length)throw new w(`Attempted to apply the operator ${r}\nwith wrong number of arguments.`);return t[0].every((t,n)=>{let r=e[n];return(typeof r!=`object`||r.kind!==`Operator`)&&_r(t,r)})});if(t)return t[1];throw new w(`Attempted to apply operator:\n${r}\nto arguments (${e.map(e=>typeof e==`object`&&e.kind===`Operator`?e.name:L(e)).join(`, `)}), which is undefined.`)},evaluateUnary:void 0,evaluateBinary:void 0}},px=e=>new C(`In the configuration file, the identifier ${e} appears\non the right-hand side of a <- after already appearing on the\nleft-hand side of one.`),mx=(e,t)=>{let n=e=>t.root.visible.get(e)?.key??e,r=t.root.constants.map(e=>e.name),i=t.root.variables,a=e=>{let n=t.moduleSymbols.get(e.module??``)?.get(e.name);return n?.kind===`Definition`?n:void 0},o=e=>{if(e.module===void 0)return[e.name,n(e.name)];let t=a(e);return t?[t.key]:[]},s=e=>e.module===t.root.module.name?[]:o(e),c=e=>{let n=t.definitions.get(e);return n?.kind===`Operator`?n.params.length:t.root.constants.find(t=>t.name===e)?.arity??t.builtins.get(e)?.arity??0},l=/* @__PURE__ */ new Map,u=/* @__PURE__ */ new Set,d=(e,n)=>{t.builtins.set(e,n),t.definitions.delete(e),l.delete(e),u.add(e)};e.constants.filter(e=>e.args===void 0).forEach(e=>{let t=dx(e.value);Wr(t),s(e).forEach(e=>{let n=c(e);n===0?l.set(e,t):d(e,{kind:`Builtin`,name:e,arity:n,evaluate:()=>t,evaluateUnary:void 0,evaluateBinary:void 0,isLazy:!0})})});let f=/* @__PURE__ */ new Map;e.constants.forEach(e=>{if(e.args===void 0)return;let t=`${e.module??``}!${e.name}`,n=f.get(t)??{name:e.name,module:e.module,rows:[]};if(n.rows.length>0&&n.rows[0][0].length!==e.args.length)throw new C(`The arity of the operator ${e.name} is inconsistent in the configuration file.`);n.rows.push([e.args.map(ux),ux(e.value)]),f.set(t,n)}),f.forEach(e=>s(e).forEach(t=>d(t,fx(e.name,c(t),e.rows))));let p=new Map(e.substitutions.flatMap(e=>o(e).map(t=>[t,n(e.target)])));[...p.keys()].forEach(e=>l.delete(e));let m=(e,a,o)=>{let s=n(a),c=t.definitions.get(s);if(!(c!==void 0||t.builtins.has(s)||l.has(s)||r.includes(a)||i.includes(a)))throw new C(`The configuration file substitutes for ${e} with the undefined identifier ${a}.`);if(c?.kind===`Operator`&&c.params.length!==o)throw new C(`The configuration file substitutes for ${e} with ${a} of different number of arguments.`)};e.substitutions.filter(e=>e.module===void 0).forEach(n=>{let i=n.name,a=n.target;if(!r.includes(i)&&!t.root.visible.has(i))throw new C(`In the configuration file, the identifier ${i} does not appear in the specification.`);if(e.substitutions.some(e=>e.name===a))throw px(a);m(i,a,t.root.constants.find(e=>e.name===i)?.arity??t.root.visible.get(i)?.arity)});let h=e.substitutions.filter(e=>e.module!==void 0);[...t.moduleSymbols.keys()].forEach(e=>{let t=h.filter(t=>t.module===e);t.forEach(e=>{let n=a(e);if(n){if(t.some(t=>t.name===e.target))throw px(e.target);m(e.name,e.target,n.arity)}});let n=t.find(e=>!a(e));if(n)throw new C(`In the configuration file, the identifier ${n.name} does not appear in the specification.`)});let g=h.find(e=>!t.moduleSymbols.has(e.module??``));if(g)throw new C(`In the configuration file, the module name ${g.module} is not a module in the specification.`);let _=new Set([...e.constants,...e.substitutions].filter(e=>e.module!==void 0).flatMap(s)),v=(e,n)=>{if(_.has(e))return{key:e,prefix:n};let r=t.copySources.get(e);return r&&v(r.source,n+r.prefix)};t.copySources.forEach((e,n)=>{let r=v(e.source,e.prefix),i=t.definitions.get(n);if(!r||!i)return;let a=i.kind===`Operator`?i.params:[],o=Nu(n,r.key,a,a.slice(r.prefix),i.location);t.definitions.set(n,o),t.root.visible.forEach((e,r)=>{e.key===n&&r!==n&&t.definitions.set(r,o)})}),t.operatorConstants.forEach((e,t)=>l.set(t,e));let y=r.filter(e=>!l.has(e)&&!p.has(e)&&!u.has(e));if(y.length>0){let e=t.order.getDeclarationOrder(`constant`).find(e=>y.includes(e))??y[0];throw new C(`The constant parameter ${e} is not assigned a value by the configuration file.`)}return{constants:l,substitutions:p}},hx=`tlc2/value/impl/`,gx={utf8:1,integer:3,float:4,long:5,double:6,class:7,string:8,methodHandle:15,methodType:16,module:19,package:20},_x={iconstM1:2,iconst0:3,iconst5:8,bipush:16,sipush:17,ldc:18,ldcW:19,dup:89,areturn:176,getstatic:178,invokespecial:183,invokestatic:184,new:187},vx=e=>{let t=new DataView(e.buffer,e.byteOffset,e.byteLength),n=0,r=e=>{let t=n;return n+=e,t};return{readUint8:()=>t.getUint8(r(1)),readUint16:()=>t.getUint16(r(2)),readUint32:()=>t.getUint32(r(4)),readInt32:()=>t.getInt32(r(4)),readBytes:t=>e.subarray(r(t),n)}},yx=/* @__PURE__ */ new Map([[`B`,`byte`],[`C`,`char`],[`D`,`double`],[`F`,`float`],[`I`,`int`],[`J`,`long`],[`S`,`short`],[`Z`,`boolean`],[`V`,`void`]]),bx=[[1,`public`],[4,`protected`],[2,`private`],[1024,`abstract`],[8,`static`],[16,`final`],[32,`synchronized`],[256,`native`],[2048,`strictfp`]],xx=e=>[...e.matchAll(/(\[*)(?:L([^;]*);|([BCDFIJSZV]))/g)].map(e=>`${e[2]?.replaceAll(`/`,`.`)??yx.get(e[3])}${`[]`.repeat(e[1].length)}`),Sx=(e,t)=>e[e[t].first].text,Cx=(e,t)=>Sx(e,t).replaceAll(`/`,`.`),wx=e=>{let t=vx(e);if(t.readUint32()!==3405691582)throw new s(`A module override is not a class file`);t.readUint16(),t.readUint16();let n=[],r=t.readUint16(),i=new TextDecoder;for(let e=1;e<r;e++){let r=t.readUint8(),a={tag:r,text:``,value:0,first:0,second:0};n[e]=a,r===gx.utf8?a.text=i.decode(t.readBytes(t.readUint16())):r===gx.integer?a.value=t.readInt32():r===gx.float?t.readUint32():r===gx.long||r===gx.double?(t.readBytes(8),e++):r===gx.class||r===gx.string||r===gx.methodType||r===gx.module||r===gx.package?a.first=t.readUint16():r===gx.methodHandle?(t.readUint8(),a.first=t.readUint16()):(a.first=t.readUint16(),a.second=t.readUint16())}t.readUint16();let a=Cx(n,t.readUint16());t.readUint16(),t.readBytes(t.readUint16()*2);for(let e=t.readUint16();e>0;e--){t.readBytes(6);for(let e=t.readUint16();e>0;e--)t.readUint16(),t.readBytes(t.readUint32())}let o=[];for(let e=t.readUint16();e>0;e--){let e=t.readUint16(),r=n[t.readUint16()].text,i=n[t.readUint16()].text,s=i.indexOf(`)`),c=xx(i.slice(1,s)),l=Array.from({length:t.readUint16()},()=>({name:n[t.readUint16()].text,reader:vx(t.readBytes(t.readUint32()))}));if(!(e&1&&e&8))continue;let u=l.find(e=>e.name===`Code`)?.reader;u?.readBytes(4);let d=l.find(e=>e.name===`Exceptions`)?.reader,f=d?Array.from({length:d.readUint16()},()=>Cx(n,d.readUint16())):[],p=bx.filter(t=>(e&t[0])!==0).map(e=>e[1]),m=xx(i.slice(s+1))[0],h=f.length===0?``:` throws ${f.join(`,`)}`;o.push({name:r,arity:c.length,code:u?.readBytes(u.readUint32()),signature:`${p.join(` `)} ${m} ${a}.${r}(${c.join(`,`)})${h}`})}return{pool:n,methods:o}},Tx=(e,t)=>{let n=e[t],r=e[n.second];return{className:Sx(e,n.first),name:e[r.first].text}},Ex=(e,t,n,r)=>{let i=()=>new p(`The Java override ${n}.${e.name} computes its value, which tla-ts cannot run`),a=e.code;if(!a)throw i();let o=[],s=()=>{let e=o.pop();if(e===void 0)throw i();return e},c=e=>{let n=t[e];if(n.tag===gx.integer)return n.value;if(n.tag===gx.string)return t[n.first].text;throw i()};for(let e=0;e<a.length;){let n=a[e],l=()=>a[e+1]<<8|a[e+2];if(n>=_x.iconstM1&&n<=_x.iconst5)o.push(n-_x.iconst0),e+=1;else if(n===_x.bipush)o.push(a[e+1]<<24>>24),e+=2;else if(n===_x.sipush)o.push(l()<<16>>16),e+=3;else if(n===_x.ldc)o.push(c(a[e+1])),e+=2;else if(n===_x.ldcW)o.push(c(l())),e+=3;else if(n===_x.dup){let t=s();o.push(t,t),e+=1}else if(n===_x.getstatic){let n=Tx(t,l());if(n.className!==`${hx}BoolValue`||n.name!==`ValTrue`&&n.name!==`ValFalse`)throw i();o.push({kind:`Identifier`,name:n.name===`ValTrue`?`TRUE`:`FALSE`,location:r}),e+=3}else if(n===_x.invokestatic){let n=Tx(t,l()),a=s();if(n.className!==`${hx}IntValue`||n.name!==`gen`||typeof a!=`number`)throw i();o.push({kind:`Number`,value:a,location:r}),e+=3}else if(n===_x.new)o.push({className:Sx(t,l()),value:void 0}),e+=3;else if(n===_x.invokespecial){let n=Tx(t,l()),a=s(),o=s();if(!(n.className===`${hx}StringValue`&&n.name===`<init>`&&typeof a==`string`&&typeof o==`object`&&`className`in o))throw i();o.value={kind:`String`,value:a,location:r},e+=3}else if(n===_x.areturn){let e=s();if(typeof e!=`object`)throw i();if(`className`in e){if(!e.value)throw i();return e.value}return e}else throw i()}throw i()},Dx=(e,t,n)=>{if(!t)return{module:e,overrides:[]};let r=wx(t),i=new Map(e.definitions.filter(e=>n||!e.isLocal).map(e=>[e.name,e.kind===`Operator`?e.params.length:0])),a=e=>i.get(e.name)===e.arity,o=e.definitions.map(t=>{if(t.kind!==`Operator`)return t;let n=r.methods.find(e=>e.name===t.name&&a(e));return n?{...t,body:Ex(n,r.pool,e.name,t.location)}:t});return{module:{...e,definitions:o},overrides:r.methods.map(t=>({module:e.name,operator:t.name,signature:t.signature,isMatched:a(t)}))}},Ox=A(`EOF`),kx=A(`IDENTIFIER`),Ax=A(`DEFBREAK`),jx=(e,t)=>Array.from({length:A(t)-A(e)+1},(t,n)=>A(e)+n),Mx=new Set(jx(`op_57`,`op_119`)),Nx=new Set(jx(`op_1`,`op_119`)),Px=new Set(jx(`op_57`,`op_70`)),Fx=/* @__PURE__ */ new Set([...jx(`ACTION`,`EXCEPT`),A(`EXTENDS`),...jx(`IF`,`SF`),A(`STATE`),...jx(`THEN`,`WITH`),A(`US`),...jx(`op_112`,`op_116`)]),Ix=(e,t,n,r,...i)=>i.map(i=>[i,{name:i,low:t,high:n,isLeftAssociative:r,fix:e}]),Lx=new Map([...Ix(`postfix`,160,160,!0,`[`),...Ix(`postfix`,150,150,!1,`'`,`^+`,`^*`,`^#`),...Ix(`prefix`,120,120,!1,`-.`),...Ix(`prefix`,100,130,!1,`SUBSET`,`UNION`,`DOMAIN`),...Ix(`prefix`,40,150,!1,`[]`,`<>`,`ENABLED`,`UNCHANGED`),...Ix(`prefix`,40,40,!0,`\\lnot`),...Ix(`nfix`,100,130,!0,`\\times`),...Ix(`infix`,140,140,!1,`^`,`^^`),...Ix(`infix`,130,130,!1,`/`,`//`,`\\oslash`,`\\div`),...Ix(`infix`,130,130,!0,`*`,`&&`,`&`,`**`,`\\odot`,`\\otimes`,`\\star`,`\\o`,`\\bigcirc`,`\\bullet`),...Ix(`infix`,110,110,!0,`-`,`--`,`\\ominus`),...Ix(`infix`,100,110,!0,`|`,`||`,`%%`),...Ix(`infix`,100,110,!1,`%`),...Ix(`infix`,100,100,!0,`+`,`++`,`\\oplus`),...Ix(`infix`,90,140,!1,`\\wr`),...Ix(`infix`,90,130,!0,`$$`,`$`,`??`,`##`,`\\uplus`,`\\sqcap`,`\\sqcup`),...Ix(`infix`,90,130,!1,`!!`),...Ix(`infix`,90,90,!1,`...`,`..`),...Ix(`infix`,80,80,!0,`\\intersect`,`\\union`),...Ix(`infix`,80,80,!1,`\\`),...Ix(`infix`,70,70,!1,`<:`,`:>`),...Ix(`infix`,60,60,!0,`@@`),...Ix(`infix`,50,140,!0,`\\cdot`),...Ix(`infix`,50,50,!1,`=`,`/=`,`<`,`>`,`\\in`,`\\notin`,`\\leq`,`\\geq`,`\\subseteq`,`\\subset`,`\\supseteq`,`\\supset`,`\\sqsubseteq`,`\\sqsubset`,`\\sqsupseteq`,`\\sqsupset`,`\\prec`,`\\preceq`,`\\succ`,`\\succeq`,`\\sim`,`\\simeq`,`\\approx`,`\\cong`,`\\asymp`,`\\doteq`,`\\propto`,`\\ll`,`\\gg`,`|-`,`|=`,`-|`,`=|`,`:=`,`::=`),...Ix(`infix`,30,30,!0,`\\land`,`\\lor`),...Ix(`infix`,20,20,!1,`~>`,`\\equiv`,`-+->`),...Ix(`infix`,10,10,!1,`=>`)]),Rx=new Map([...Lx,...oc.flatMap(e=>e.slice(1).map(t=>[t,Lx.get(e[0])]))]),zx=Rx.get(`[`),Bx={name:`$$_void`,low:0,high:0,isLeftAssociative:!1,fix:`infix`},Vx=e=>({type:`tokens`,kinds:new Set(e)}),Hx=e=>typeof e==`string`?e.startsWith(`<`)?Vx([A(e.slice(1,-1))]):{type:`call`,name:e}:e,G=(...e)=>({type:`sequence`,units:e.map(Hx)}),K=(...e)=>({type:`choice`,alternatives:e.map(e=>typeof e!=`string`&&e.type===`sequence`?e:G(e))}),Ux=e=>(...t)=>({type:e,body:G(...t)}),q=Ux(`zeroOrMore`),Wx=Ux(`oneOrMore`),J=Ux(`optional`),Y=e=>({type:`action`,run:t=>e(t)??void 0}),X=e=>Y(t=>{t.expecting=e}),Z=e=>({type:`lookahead`,amount:e.amount??(e.expansion?2147483647:0),expansion:e.expansion&&G(...e.expansion),semantic:e.semantic}),Gx=(e,t)=>(t.next===void 0&&(t.next=e.readToken()),t.next),Kx=(e,t)=>{let n=e.isLookingAhead?e.scanPosition:e.token;for(let r=0;r<t;r++)n=Gx(e,n);return n},qx=(...e)=>{let t=e.map(A);return e=>t.includes(Kx(e,1).kind)},Jx=(e,t=Kx(e,1).beginColumn)=>{let n=e.junctions.at(-1);return n===void 0||n.column<t},Yx=e=>{let t=Kx(e,1),n=e.junctions.at(-1);return n?.column===t.beginColumn&&n.kind===t.kind},Xx=e=>qx(`CASESEP`)(e)&&Jx(e),Zx=e=>{let t=Kx(e,1);Fx.has(t.kind)&&(t.kind=kx)},Qx=(e,t,n=t)=>`line ${t.beginLine}, col ${t.beginColumn} to line ${n.beginLine}, col ${n.beginColumn+n.image.length-1} of module ${e.moduleName}`,$x=(e,t)=>({kind:e,heirs:t,first:t[0].first,last:t[t.length-1].last}),eS=(e,t)=>{let n=e.frames[e.frames.length-1].heirs;return n[n.length-t]},tS=e=>e.operatorStacks[e.operatorStacks.length-1],nS=(e,t)=>e.low>t.high,rS=(e,t)=>e.high<t.low,iS=e=>e.fix===`prefix`?e:Rx.get(`${e.name}.`),aS=(e,t)=>{let n=e[t-2].node,r=e[t-1];e.splice(t-2,2,{node:r.operator===zx?$x(`FcnAppl`,[n,...r.node.heirs]):$x(`PostfixExpr`,[n,r.node]),operator:void 0})},oS=(e,t)=>{let n=e.length-1;if(t.fix!==`infix`&&t.fix!==`nfix`){e.splice(n-2,2,{node:$x(`PrefixExpr`,[e[n-2].node,e[n-1].node]),operator:void 0});return}let r=e[n-3].node,i=t.fix===`nfix`;e.splice(n-3,3,{node:$x(i?`Times`:`InfixExpr`,[...i&&r.kind===`Times`?r.heirs:[r],e[n-2].node,e[n-1].node]),operator:void 0})},sS=e=>{let t=tS(e),n=t.length-1,r=t[n],i=t[n-1],a=t[n-2];if(r.operator===void 0||r.operator.fix===`prefix`)return;if(i.operator?.fix===`postfix`)return aS(t,n),sS(e);if(i.operator!==void 0){let t=iS(r.operator);return t!==void 0&&nS(i.operator,t)?`\n Precedence conflict between ops ${i.operator.name} in block ${Qx(e,i.node.first,i.node.last)} and ${t.name}.`:void 0}if(a===void 0)return;if(a.operator===void 0)return`Expression at location ${Qx(e,a.node.first,a.node.last)} and expression at location ${Qx(e,i.node.first,i.node.last)} follow each other without any intervening operator.`;if(r.operator.fix===`postfix`)return rS(a.operator,r.operator)?void 0:nS(a.operator,r.operator)?(oS(t,a.operator),sS(e)):`Precedence conflict between ops ${a.operator.name} in block ${Qx(e,r.node.first,r.node.last)} and ${r.operator.name}.`;let o=iS(a.operator),s=o!==void 0&&(n===2||t[n-3].operator!==void 0)?o:a.operator;if(rS(s,r.operator))return;if(!nS(s,r.operator)&&!(s===r.operator&&s.isLeftAssociative))return`\n Precedence conflict between ops ${s.name} in block ${Qx(e,a.node.first,a.node.last)} and ${r.operator.name}.`;if(s.fix!==`postfix`)return oS(t,s),sS(e);let c=Qx(e,a.node.first,a.node.last);return a.node.first.beginLine<i.node.first.beginLine&&r.operator.name===`=`?`\n *** Hint *** You may have mistyped ==\n Illegal combination of operators ${s.name} in block ${c} and =.`:r.operator===Bx?`\n Error following expression at ${c}, missing operator or separator.`:`\n Illegal combination of operators ${s.name} in block ${c} and ${r.operator.name}.`},cS=e=>Y(t=>{let n=tS(t),r=eS(t,1);if(!e(r))n.push({node:r,operator:void 0});else return n.push({node:r,operator:t.lastOperator}),n.length===1?void 0:sS(t)}),lS=cS(()=>!1),uS=cS(()=>!0),dS=Y(e=>{e.lastOperator=Rx.get(e.token.image)}),fS=e=>{let t=e[e.length-1],n=t.kind===`BangExt`?t.heirs[t.heirs.length-1]:t;return n.kind===`OpArgs`?n:void 0},pS=e=>{if(e.kind===`GeneralId`)return!0;let t=e.kind===`OpApplication`&&e.heirs.length===2?fS(e.heirs):void 0;return t!==void 0&&t.heirs.every((e,t)=>t%2==0||e.kind===`GeneralId`)},mS=(e,t)=>{for(let n of t.heirs){if(n.kind===`Junctions`)continue;if(!Jx(e,n.first.beginColumn))return n;let t=mS(e,n);if(t!==void 0)return t}},hS=e=>{let t=[`EOF`,`THEOREM`,`PROPOSITION`,`ASSUMPTION`,`END_MODULE`].map(A),n=(e,...t)=>t.some(t=>e.kind===A(t)),r=e=>e!==void 0&&Mx.has(e.kind),i=e.token,a=Gx(e,i);i.next=void 0;let o=Gx(e,a);for(a.next=i;!t.includes(o.kind)&&!n(a,`THEOREM`,`PROPOSITION`);){if(n(a,`DEF`)){let e=i;if(n(e,`RBR`,`RSB`)){let t=1;for(;e.next!==void 0&&(e=e.next,!(n(e,`LBR`,`LSB`)&&t===1));)n(e,`LBR`,`LSB`)&&t>1&&t--,n(e,`RBR`,`RSB`)&&t++;e.next===void 0?e=void 0:e.next.kind===kx&&(e=e.next)}else if(e.kind===kx){let t=e.next;!r(t)||Px.has(t.kind)||Nx.has(t.kind)&&t.next?.kind!==kx||(e=t.next?.kind===A(`SUBSTITUTE`)?i:Nx.has(t.kind)?t.next:t)}else r(e)&&(e=e.next);e!==void 0&&e.next?.kind!==Ax&&(e.next={kind:Ax,image:`Beginning of definition`,beginLine:e.beginLine,beginColumn:e.beginColumn,next:e.next});break}i=a,a=o,o=Gx(e,a),a.next=i}for(;i!==void 0;)a.next=o,o=a,a=i,i=a.next;a.next=o},gS=e=>{let t=Kx(e,1);if(t.kind===A(`LAB`)){let n=1;for(;n!==0;)if(t=Gx(e,t),t.kind===A(`LAB`)&&n++,t.kind===A(`RAB`)&&n--,t.kind===Ox)return!1;return Gx(e,t).kind===A(`IN`)}if(t.kind!==kx)return!1;for(t=Gx(e,t);t.kind===A(`COMMA`);){if(t=Gx(e,t),t.kind!==kx)return!1;t=Gx(e,t)}return t.kind===A(`IN`)},_S=e=>e.image[1]===`*`?-1:e.image[1]===`+`?-2:Number.parseInt(e.image.slice(1)),vS=e=>e.proofLevels.at(-1)??-1,yS=e=>{let t=Kx(e,1);return t.image.length<2?!1:t.image[1]===`*`?e.proofLevels.length===0:t.image[1]===`+`?!0:qx(`ProofStepLexeme`,`BareLevelLexeme`,`UnnumberedStepLexeme`,`ProofStepDotLexeme`)(e)?e.proofLevels.length===0||vS(e)>=0&&_S(t)>vS(e):qx(`BY`,`PROOF`,`OBVIOUS`,`OMITTED`)(e)},bS=(e,t)=>{let n=_S(t),r=e.proofLevels.length-1,i=e.proofLevels[r-1]??-1,a=e.proofLevels[r]<0;return a&&(e.proofLevels[r]=n<0?i+1:n),n===-1?!0:n===-2?a:a?n>i:e.proofLevels[r]===n},xS=e=>Y(t=>bS(t,t.token)?void 0:`${Qx(t,t.token)}: ${e}`),SS=Vx([`op_26`,`op_29`,`op_58`,`CASESEP`,`op_61`,`op_112`,`op_113`,`op_114`,`op_115`,`op_116`].map(A)),CS=Vx([...SS.kinds,A(`op_76`)]),wS=Vx(Nx),TS=Vx(Px),ES=Vx([`ProofStepLexeme`,`ProofImplicitStepLexeme`,`ProofStepDotLexeme`,`BareLevelLexeme`,`UnnumberedStepLexeme`].map(A)),DS=()=>q(Z({expansion:[K(SS,`<op_77>`)],semantic:Jx}),K(`PrefixOp`,`InfixOp`),uS),OS=()=>K(G(Z({expansion:[`OpenStart`],semantic:Jx}),`OpenExpression`,lS),G(Z({semantic:Jx}),`ExtendableExpr`)),kS=()=>K(G(`<MODULE>`,X(`identifier`),`Identifier`),`Expression`),AS=()=>K(G(Z({semantic:e=>qx(`ASSUME`,`BOXASSUME`)(e)||Kx(e,2).kind===A(`COLONCOLON`)&&[A(`ASSUME`),A(`BOXASSUME`)].includes(Kx(e,3).kind)}),`AssumeProve`),`NewSymb`,`Expression`),jS=()=>[`JuncItem`,q(Z({semantic:Yx}),`JuncItem`)],MS=e=>Y(t=>{t.expecting=e,Zx(t)}),NS=e=>Y(t=>{t.isTerminalProof=e}),PS=(e,...t)=>G(...t.slice(0,-1),X(`==`),`<DEF>`,Y(t=>{hS(t),t.expecting=e}),t[t.length-1]),Q=(e,t,n)=>({message:e,body:G(...t),exit:n}),FS={CompilationUnit:Q(void 0,[Y(hS),J(`Prelude`),`Module`]),Prelude:Q(void 0,[`<BEGIN_PRAGMA>`,q(K(`<NUMBER>`,`<IDENTIFIER>`))]),Module:Q(`Module definition`,[X(`---- MODULE`),`BeginModule`,X(`EXTENDS clause or module body`),`Extends`,X(`Module body`),`Body`,X(`==== or more Module body`),`EndModule`]),BeginModule:Q(`Begin module`,[X(`---- MODULE (beginning of module)`),K(`<_BM0>`,`<_BM1>`,`<_BM2>`),MS(`Identifier`),`Identifier`,Y(e=>{e.moduleName??=e.token.image,e.expecting=`----`}),`<SEPARATOR>`]),EndModule:Q(void 0,[`<END_MODULE>`]),Extends:Q(`Extends`,[J(`<EXTENDS>`,MS(`Identifier`),`Identifier`,X(`comma or module body`),q(`<COMMA>`,MS(`Identifier`),`Identifier`))]),Body:Q(`Module body`,[X(`LOCAL, INSTANCE, PROOF, ASSUMPTION, THEOREM, RECURSIVE, declaration, or definition`),q(K(`<SEPARATOR>`,`VariableDeclaration`,`ParamDeclaration`,G(Z({amount:2}),`OperatorOrFunctionDefinition`),`Recursive`,G(Z({amount:2}),`Instance`),G(Z({amount:2}),`Assumption`),G(Z({amount:2}),`Theorem`),G(Z({amount:1}),`Module`,Y(hS)),G(Z({semantic:e=>qx(`USE`)(e)&&Kx(e,2).kind!==A(`ONLY`)||qx(`HIDE`)(e)}),`UseOrHideOrBy`)))]),VariableDeclaration:Q(`variable declaration`,[`<VARIABLE>`,X(`Identifier`),`Identifier`,X(`comma or module body`),q(`<COMMA>`,X(`Identifier`),`Identifier`)]),ParamDeclaration:Q(`Parameter declaration`,[X(`CONSTANT`),`ParamSubDecl`,X(`Identifier, operator or _`),`ConstantDeclarationItems`,X(`,`),q(`<COMMA>`,X(`Identifier, operator or _`),`ConstantDeclarationItems`)]),ParamSubDecl:Q(`Parameter declaration item`,[`<CONSTANT>`]),Recursive:Q(`Recursive`,[X(`RECURSIVE`),`<RECURSIVE>`,X(`Identifier, operator or _`),`ConstantDeclarationItems`,X(`,`),q(`<COMMA>`,X(`Identifier, operator or _`),`ConstantDeclarationItems`,X("`,' or `)'"))]),ConstantDeclarationItems:Q(`Constant declaration items`,[X(`Identifier, _ or prefix op`),K(G(`Identifier`,X(`(, comma, or Module Body`),J(Z({amount:2}),`<LBR>`,X(`_`),`<US>`,X(`comma or )`),q(`<COMMA>`,X(`_`),`<US>`,X(`comma or )`)),`<RBR>`)),G(`NonExpPrefixOp`,X(`_`),`<US>`),G(`<US>`,X(`prefix or postfix operator`),K(G(`InfixOp`,X(`_`),`<US>`),`PostfixOp`)))]),OperatorOrFunctionDefinition:Q(`Definition`,[X(`LOCAL, Identifier or Operator Symbol`),J(`<LOCAL>`),`<DEFBREAK>`,X(`LOCAL, Identifier or Operator Symbol`),K(PS(`Expression`,Z({expansion:[`<IDENTIFIER>`,`<LSB>`]}),`Identifier`,X(`[`),`<LSB>`,X(`Identifier`),`QuantBound`,X(`COMMA or ]`),q(`<COMMA>`,X(`Identifier`),`QuantBound`),`<RSB>`,`Expression`),PS(`Expression`,Z({expansion:[`<IDENTIFIER>`,TS]}),`PostfixLHS`,`Expression`),PS(`Expression`,Z({expansion:[`<IDENTIFIER>`,wS]}),`InfixLHS`,`Expression`),PS(`Expression or Instance`,Z({expansion:[`<IDENTIFIER>`,K(`<LBR>`,`<DEF>`)]}),`IdentLHS`,K(`Expression`,`Instantiation`)),PS(`Expression`,`PrefixLHS`,`Expression`))]),IdentifierTuple:Q(`Identifier tuple`,[`<LAB>`,X(`Identifier or >>`),J(`Identifier`,X(`COMMA or >>`),q(`<COMMA>`,X(`COMMA or >>`),`Identifier`,X(`COMMA or >>`))),`<RAB>`]),IdentLHS:Q(`Identifier LHS`,[`Identifier`,X(`( or ==`),J(`<LBR>`,X(`Identifier Declaration, prefix op, _ or )`),K(`IdentDecl`,`SomeFixDecl`),X(`COMMA or )`),q(`<COMMA>`,X(`Identifier Declaration, prefix op or _`),K(`IdentDecl`,`SomeFixDecl`),X(`COMMA or )`)),`<RBR>`)]),PrefixLHS:Q(`Prefix LHS`,[CS,X(`Identifier`),`Identifier`]),InfixLHS:Q(`Infix LHS`,[`Identifier`,wS,`Identifier`]),PostfixLHS:Q(`Postfix LHS`,[`Identifier`,TS]),IdentDecl:Q(`Identifier Declation`,[`Identifier`,X(`( or ...`),J(`<LBR>`,X(`_`),`<US>`,X(`COMMA or )`),q(`<COMMA>`,X(`_`),`<US>`,X(`COMMA or )`)),`<RBR>`)]),SomeFixDecl:Q(`Op. Symbol Declaration`,[K(G(`NonExpPrefixOp`,X(`_`),`<US>`),G(`<US>`,X(`infix or postfix operator`),K(G(`InfixOp`,X(`_`),`<US>`),`PostfixOp`)))]),Instance:Q(`Instance`,[X(`LOCAL or instance`),J(`<LOCAL>`),`Instantiation`,X(`COMMA or Module Body`)]),Instantiation:Q(`NonLocalInstance`,[`<INSTANCE>`,MS(`Module identifier`),`Identifier`,X(`WITH or another definition.`),J(`<WITH>`,X(``),`Substitution`,X(``),q(Z({amount:3}),`<COMMA>`,X(``),`Substitution`,X(``)))]),Substitution:Q(`Substitution`,[K(`Identifier`,`NonExpPrefixOp`,`InfixOp`,`PostfixOp`),X(`<-`),`<SUBSTITUTE>`,X(`Expression or Op. Symbol`),`OpOrExpr`]),PrefixOp:Q(void 0,[SS,dS]),NonExpPrefixOp:Q(void 0,[CS,dS]),InfixOp:Q(`Infix Op`,[wS,dS]),PostfixOp:Q(void 0,[TS,dS]),Identifier:Q(void 0,[`<IDENTIFIER>`]),Assumption:Q(`Assumption`,[X(`ASSUM...`),K(`<ASSUMPTION>`,`<ASSUME>`),J(Z({amount:2}),J(`<DEFBREAK>`),`Identifier`,X(`==`),`<DEF>`),Y(e=>{hS(e),e.expecting=`Expression`}),`Expression`]),AssumeProve:Q(`Assume-Prove`,[K(G(`Identifier`,`<COLONCOLON>`,`AssumeProve`),G(K(`<ASSUME>`,`<BOXASSUME>`),X(`Expression, Declaration, or AssumeProve`),AS(),X("PROVE or `,'"),q(`<COMMA>`,X(`Expression, Declaration, or AssumeProve`),AS(),X("PROVE or `,'")),K(`<PROVE>`,`<BOXPROVE>`),X(`Expression`),`Expression`))]),NewSymb:Q(`NEW symbol declaration`,[X(`NEW, CONSTANT, VARIABLE, STATE, ACTION, or TEMPORAL`),K(G(Z({amount:2}),K(G(Z({amount:2}),`<NEW>`,`<CONSTANT>`),`<NEW>`,`<CONSTANT>`),X(`Constant declaration`),K(G(Z({amount:2}),`IdentDecl`,J(`<IN>`,Y(e=>{let t=eS(e,2);return t.heirs.length>1?`declared symbol with arguments before \\in at ${Qx(e,t.first,t.last)}`:void 0}),X(`Expression`),`Expression`)),`SomeFixDecl`)),G(Z({amount:2}),J(`<NEW>`),`<VARIABLE>`,X(`Identifier`),`Identifier`),G(Z({amount:2}),J(`<NEW>`),K(`<STATE>`,`<ACTION>`,`<TEMPORAL>`),X(`Declaration`),K(`IdentDecl`,`SomeFixDecl`)))]),MaybeBound:Q(`Domain binding`,[J(`<IN>`,X(`Expression`),`Expression`)]),Theorem:Q(`Theorem`,[X(`THEOREM, PROPOSITION`),K(`<THEOREM>`,`<PROPOSITION>`),X(`Identifier, Assume-Prove or Expression`),J(Z({amount:2}),`Identifier`,X(`==`),`<DEF>`),Y(hS),K(G(Z({amount:3}),Z({semantic:qx(`ASSUME`,`BOXASSUME`)}),`AssumeProve`),`Expression`),J(Z({semantic:yS}),`Proof`)]),Proof:Q(`Proof`,[Y(e=>{e.proofLevels.push(-1)}),K(G(Z({semantic:e=>qx(`BY`)(e)||Kx(e,2).kind===A(`BY`)}),`UseOrHideOrBy`),G(Z({amount:2}),J(`<PROOF>`),K(`<OBVIOUS>`,`<OMITTED>`)),G(J(Z({amount:2}),`<PROOF>`),q(Z({semantic:e=>Kx(e,2).kind!==A(`QED`)}),`Step`,X(`a proof step`)),`QEDStep`)),Y(e=>{e.proofLevels.pop()})]),UseOrHideOrBy:Q(`UseOrHideOrBy`,[K(G(J(`<PROOF>`),`<BY>`,NS(!0),J(`<ONLY>`)),G(`<USE>`,NS(!1),J(`<ONLY>`)),G(`<HIDE>`,NS(!1))),X("an expression, `MODULE' or `DEF'"),J(kS(),q(`<COMMA>`,X(`MODULE or expression`),kS(),Y(e=>{e.expecting=e.isTerminalProof?`comma, DEF, or [.]`:`comma, DEF, or proof step`}))),J(`<DF>`,X(`MODULE or expression`),kS(),q(`<COMMA>`,X(`MODULE or expression`),kS(),Y(e=>{e.expecting=e.isTerminalProof?`comma or [.]`:`comma or proof step`}))),Y(e=>{e.isTerminalProof&&(e.expecting=`[.]`)})]),QEDStep:Q(`QED step`,[X(`Step number`),ES,xS(`QED step's number has bad level.`),X(`QED`),`<QED>`,J(Z({semantic:yS}),`Proof`)]),Step:Q(`Step`,[X(`Step number`),ES,xS(`step's number has bad level.`),X(`proof step`),K(G(Z({semantic:qx(`USE`,`HIDE`)}),`UseOrHideOrBy`),G(Z({semantic:qx(`INSTANCE`)}),`Instantiation`),G(Z({semantic:qx(`DEFBREAK`,`DEFINE`)}),`DefStep`),`HaveStep`,`TakeStep`,`WitnessStep`,`PickStep`,`CaseStep`,`AssertStep`),J(Z({semantic:yS}),Y(e=>{let t=eS(e,1);return[`PickStep`,`CaseStep`,`AssertStep`].includes(t.kind)?void 0:`${Qx(e,t.first,t.last)}: proof of step that does not take a proof.`}),`Proof`)]),DefStep:Q(`DefStep`,[J(`<DEFINE>`),Wx(Z({amount:2}),`OperatorOrFunctionDefinition`)]),HaveStep:Q(`HaveStep`,[`<HAVE>`,X(`expression`),`Expression`]),TakeStep:Q(`TakeStep`,[`<TAKE>`,X(`identifier`),K(G(Z({expansion:[K(G(`<IDENTIFIER>`,q(`<COMMA>`,`<IDENTIFIER>`),`<IN>`),`<LAB>`)]}),`QuantBound`,X(`comma or step`),q(`<COMMA>`,X(`identifier or tuple of identifiers`),`QuantBound`,X(`comma or proof step`))),G(`Identifier`,X(`comma or proof step`),q(`<COMMA>`,X(`identifier`),`Identifier`,X(`comma or proof step`))))]),WitnessStep:Q(`WitnessStep`,[`<WITNESS>`,X(`expression`),`Expression`,q(`<COMMA>`,X(`expression`),`Expression`,X(`comma or colon`))]),PickStep:Q(`PickStep`,[`<PICK>`,X(`identifier`),K(G(Z({expansion:[`<IDENTIFIER>`,q(`<COMMA>`,`<IDENTIFIER>`),`<COLON>`]}),`Identifier`,X(`comma, or colon`),q(`<COMMA>`,X(`identifier`),`Identifier`,X(`comma or colon`))),G(`QuantBound`,X(`comma or colon`),q(`<COMMA>`,X(`identifier or tuple of identifiers`),`QuantBound`,X(`comma or colon`)))),`<COLON>`,X(`expression`),`Expression`]),CaseStep:Q(`CaseStep`,[`<CASE>`,X(`expression`),`Expression`]),AssertStep:Q(`AssertStep`,[J(`<SUFFICES>`,X(`expression or ASSUME/PROVE`)),K(`Expression`,G(Z({semantic:qx(`ASSUME`,`BOXASSUME`)}),`AssumeProve`))]),ParenthesesExpression:Q(void 0,[K(`ParenExpr`,`BraceCases`,`SBracketCases`,`TupleOrAction`,`FairnessExpr`)]),OpenExpression:Q(void 0,[K(`SomeQuant`,`SomeTQuant`,`IfThenElse`,`Case`,`LetIn`,`UnboundOrBoundChoose`)]),String:Q(`String`,[`<STRING_LITERAL>`]),Number:Q(void 0,[`<NUMBER_LITERAL>`,J(Z({amount:2}),`<DOT>`,`<NUMBER_LITERAL>`)]),OpArgs:Q(`Optional Arguments`,[`<LBR>`,`OpOrExpr`,q(`<COMMA>`,`OpOrExpr`),`<RBR>`]),OpOrExpr:Q(void 0,[K(G(Z({amount:2,expansion:[K(CS,wS,TS),Vx([`COMMA`,`RBR`,`DEFBREAK`,`LOCAL`,`INSTANCE`,`THEOREM`,`ASSUME`,`END_MODULE`,`SEPARATOR`,`_BM0`,`ASSUMPTION`,`CONSTANT`,`VARIABLE`,`RECURSIVE`].map(A))],semantic:Jx}),K(`NonExpPrefixOp`,G(`InfixOp`,Y(e=>e.token.image===`\\X`||e.token.image===`\\times`?`${Qx(e,e.token)}: \\X may not be used as an infix operator.`:void 0)),`PostfixOp`)),G(Z({expansion:[`<LAMBDA>`],semantic:Jx}),`Lambda`),`Expression`)],e=>{e.node=e.heirs[0]}),ParenExpr:Q(void 0,[`<LBR>`,`Expression`,`<RBR>`]),SomeQuant:Q(`Quantified form`,[K(`<EXISTS>`,`<FORALL>`),K(G(Z({expansion:[`<IDENTIFIER>`,q(`<COMMA>`,`<IDENTIFIER>`),`<COLON>`]}),`Identifier`,q(`<COMMA>`,`Identifier`)),G(`QuantBound`,q(`<COMMA>`,`QuantBound`))),`<COLON>`,`Expression`]),SomeTQuant:Q(`Bound Quantified Expression`,[K(`<T_EXISTS>`,`<T_FORALL>`),`Identifier`,q(`<COMMA>`,`Identifier`),`<COLON>`,`Expression`]),QuantBound:Q(`Quant Bound`,[K(`IdentifierTuple`,G(`Identifier`,q(`<COMMA>`,`Identifier`,X(`, or \\in`)))),`<IN>`,`Expression`]),BraceCases:Q(`Some { } form`,[`<LBC>`,J(K(G(Z({semantic:gS}),K(`IdentifierTuple`,`Identifier`),X(`\\in`),`<IN>`,`Expression`,X(`':', ',' or '}'`),J(K(G(`<COLON>`,`Expression`),Wx(`<COMMA>`,`Expression`)))),G(Z({expansion:[K(`IdentifierTuple`,`<IDENTIFIER>`),`<COMMA>`]}),`Expression`,q(`<COMMA>`,`Expression`)),G(Z({expansion:[K(`IdentifierTuple`,`<IDENTIFIER>`),`<COLON>`]}),`Expression`,`<COLON>`,`QuantBound`,q(`<COMMA>`,`QuantBound`)),G(`Expression`,J(K(G(`<COLON>`,Y(e=>{let t=eS(e,2);return t.kind===`InfixExpr`&&t.heirs[1].first.image===`\\in`?`Form {a \\in b : c \\in d }, at line ${e.token.beginLine}, is not allowed`:void 0}),`QuantBound`,q(`<COMMA>`,`QuantBound`)),Wx(`<COMMA>`,`Expression`)))))),`<RBC>`]),SBracketCases:Q(`Some [] Form`,[`<LSB>`,K(G(Z({semantic:gS}),`QuantBound`,q(`<COMMA>`,`QuantBound`),`<MAPTO>`,`Expression`,`<RSB>`),G(Z({expansion:[`<IDENTIFIER>`,`<MAPTO>`]}),`FieldVal`,q(`<COMMA>`,`FieldVal`),`<RSB>`),G(Z({semantic:e=>Kx(e,2).kind===A(`MAPTO`)&&Fx.has(Kx(e,1).kind)}),Y(e=>{Kx(e,1).kind=kx}),`FieldVal`,q(`<COMMA>`,`FieldVal`),`<RSB>`),G(Z({expansion:[`<IDENTIFIER>`,`<COLON>`]}),`FieldSet`,q(`<COMMA>`,`FieldSet`),`<RSB>`),G(`Expression`,K(G(q(`<COMMA>`,`Expression`),`<RSB>`,Y(e=>{let t=e.frames[e.frames.length-1];t.node=$x(`FcnAppl`,t.heirs),e.lastOperator=zx})),G(`<ARROW>`,`Expression`,`<RSB>`),G(`<EXCEPT>`,`ExceptSpec`,q(`<COMMA>`,`ExceptSpec`),`<RSB>`),G(`<ARSB>`,`ReducedExpression`))))]),FieldVal:Q(`Field Value`,[`Identifier`,`<MAPTO>`,`Expression`]),FieldSet:Q(`Field Set`,[`Identifier`,`<COLON>`,`Expression`]),ExceptSpec:Q(`Except Spec`,[`<BANG>`,Wx(`ExceptComponent`,X(`= or ,`)),`<EQUALS>`,`Expression`]),ExceptComponent:Q(`Except Component`,[K(G(`<DOT>`,Y(Zx),`Identifier`,Y(e=>{e.token.image===`@`&&e.pushedErrors.push(`@ used in !.@`)})),G(`<LSB>`,`Expression`,q(`<COMMA>`,`Expression`),`<RSB>`))]),TupleOrAction:Q(`Some << -- >> or >>_ Form`,[`<LAB>`,J(`Expression`,q(`<COMMA>`,`Expression`)),K(`<RAB>`,G(`<ARAB>`,`ReducedExpression`))]),NoOpExtension:Q(void 0,[`Identifier`,J(Z({amount:2}),`OpArgs`),K(G(`<BANG>`,`NoOpExtension`),Y(e=>{e.isFairnessHooked=e.token.kind===A(`RBR`)}))]),ReducedExpression:Q(`restricted form of expression`,[K(`NoOpExtension`,`ParenExpr`,`BraceCases`,`SBracketCases`,`TupleOrAction`)]),FairnessExpr:Q(`Fairness Expression`,[Y(e=>{e.isFairnessHooked=!1,e.isFairnessParenthesized.push(!1)}),K(`<WF>`,`<SF>`),`ReducedExpression`,J(Z({amount:2}),`<LBR>`,`Expression`,`<RBR>`,Y(e=>{e.isFairnessParenthesized[e.isFairnessParenthesized.length-1]=!0}))],(e,t)=>t.isFairnessParenthesized.pop()||t.isFairnessHooked?void 0:`Ill-structured fairness expression at line ${e.heirs[0].first.beginLine}, column ${e.heirs[0].first.beginColumn}`),IfThenElse:Q(`IF THEN ELSE`,[`<IF>`,`Expression`,`<THEN>`,`Expression`,`<ELSE>`,`Expression`]),Case:Q(`CASE Expression`,[`<CASE>`,`CaseArm`,q(Z({semantic:e=>Xx(e)&&Kx(e,2).kind!==A(`OTHER`)}),`<CASESEP>`,`CaseArm`),J(Z({semantic:Xx}),`<CASESEP>`,`OtherArm`)]),CaseArm:Q(`Case Arm`,[`Expression`,`<ARROW>`,`Expression`]),OtherArm:Q(`Case Other Arm`,[`<OTHER>`,`<ARROW>`,`Expression`]),LetIn:Q(`Case Other Arm`,[`<LET>`,`LetDefinitions`,`<LETIN>`,`Expression`]),LetDefinitions:Q(`Let Definitions`,[Wx(K(`OperatorOrFunctionDefinition`,`Recursive`))]),Junctions:Q(`AND-OR Junction`,[Y(e=>{let t=Kx(e,1);e.junctions.push({kind:t.kind,column:t.beginColumn})}),K(G(Z({expansion:[`<OR>`]}),...jS()),G(Z({expansion:[`<AND>`]}),...jS())),Y(e=>{e.junctions.pop()})]),JuncItem:Q(`Junction Item`,[K(`<OR>`,`<AND>`),`Expression`],(e,t)=>{let n=mS(t,e.heirs[1]);return n&&`Item at ${Qx(t,n.first,n.last)} is not properly indented inside conjunction or disjunction list item at ${Qx(t,e.heirs[0].first,e.heirs[1].last)}`}),UnboundOrBoundChoose:Q(`(Un)Bounded Choose`,[`<CHOOSE>`,K(`Identifier`,`IdentifierTuple`),`MaybeBound`,`<COLON>`,`Expression`]),Lambda:Q(`Lambda`,[`<LAMBDA>`,X(`Identifier`),`Identifier`,X("`,' or `:'"),q(`<COMMA>`,X(`Identifier`),`Identifier`,X("`,' or `:'")),`<COLON>`,X(`Expression`),`Expression`]),Expression:Q(`Expression`,[Y(e=>{e.operatorStacks.push([])}),DS(),OS()],(e,t)=>{let n=tS(t);n.push({node:e.heirs[0],operator:Bx});let r=sS(t);return e.node=n[0].node,t.operatorStacks.pop(),r}),ExtendableExpr:Q(`ExtendableExpr`,[K(G(Z({expansion:[K(`<AND>`,`<OR>`)],semantic:e=>{let t=e.operatorStacks.at(-1)?.at(-1);return t===void 0||t.operator!==void 0&&t.operator.fix!==`postfix`}}),`Junctions`),`ParenthesesExpression`,`PrimitiveExp`),lS,q(K(G(Z({expansion:[`PostfixOp`],semantic:Jx}),`PostfixOp`,uS),G(Z({expansion:[`<DOT>`],semantic:Jx}),`<DOT>`,Y(Zx),Z({semantic:Jx}),`Identifier`,Y(e=>{let t=tS(e);t[t.length-1].operator!==void 0&&aS(t,t.length),t[t.length-1]={node:$x(`RecordComponent`,[t[t.length-1].node,eS(e,2),eS(e,1)]),operator:void 0}})),G(Z({expansion:[`<LSB>`],semantic:Jx}),X(`function argument`),`SBracketCases`,cS(e=>e.kind===`FcnAppl`)))),J(K(G(Z({expansion:[`InfixOp`],semantic:Jx}),`InfixOp`,uS,DS(),OS()),G(Z({expansion:[`<COLONCOLON>`],semantic:Jx}),`<COLONCOLON>`,Y(e=>{let t=tS(e);if(!pS(t[t.length-1].node))return`\`::' at ${Qx(e,e.token)} does not follow a label.`;t.pop()}),`Expression`,Y(e=>{let t=tS(e),n=eS(e,1),r=t.at(-1)?.operator;if((n.kind===`InfixExpr`||n.kind===`PostfixExpr`)&&r!==void 0&&e.lastOperator!==void 0&&!rS(r,e.lastOperator)){let t=eS(e,3);return`Removing label at ${Qx(e,t.first,t.last)} would change expression parsing.`}t.push({node:$x(`Label`,[eS(e,3),eS(e,2),n]),operator:void 0})}))))]),PrimitiveExp:Q(`Primitive expression`,[K(G(Z({expansion:[`String`],semantic:Jx}),`String`),G(Z({expansion:[`<NUMBER_LITERAL>`],semantic:Jx}),`Number`),G(K(`Identifier`,G(K(`<ProofStepLexeme>`,`<ProofImplicitStepLexeme>`),Y(e=>vS(e)<0&&e.proofLevels.length<=1?`${Qx(e,e.token)}: Step number used outside proof.`:e.token.image[1]===`+`?`${Qx(e,e.token)}: <+> step number used in an expression.`:void 0)),`InfixOp`,`PostfixOp`,G(Z({expansion:[`<op_76>`]}),`NonExpPrefixOp`)),J(Z({amount:2}),`OpArgs`),q(`BangExt`)))],e=>{let t=e.heirs[0];e.node=t.kind===`String`||t.kind===`Number`?t:fS(e.heirs)===void 0?e.heirs.length===1?$x(`GeneralId`,e.heirs):void 0:$x(`OpApplication`,e.heirs)}),BangExt:Q(`Bang Extension`,[`<BANG>`,K(G(K(G(Z({expansion:[`Identifier`],semantic:e=>Kx(e,1).image!==`@`}),`Identifier`),`NonExpPrefixOp`,`InfixOp`,`PostfixOp`),J(Z({amount:2}),`OpArgs`)),`OpArgs`,`StructOp`)]),StructOp:Q(`StructOp`,[X("`<<' , `>>' , `:' , `@' , or number"),K(`<LAB>`,`<RAB>`,`<COLON>`,`Number`,G(Z({semantic:e=>Kx(e,1).image===`@`}),`<IDENTIFIER>`))],(e,t)=>{let n=e.heirs[0];return n.kind===`Number`&&n.heirs.length>1?`Illegal structural term at ${Qx(t,n.first,n.last)}`:void 0}),OpenStart:Q(void 0,[K(`<CASE>`,`<CHOOSE>`,`<EXISTS>`,`<FORALL>`,`<IF>`,`<LET>`,`<T_EXISTS>`,`<T_FORALL>`)])},IS=/* @__PURE__ */ new Map,LS=e=>{let t=IS.get(e);if(t)return t;let n={first:/* @__PURE__ */ new Set,isNullable:!0,hasSemanticStart:!1},r=e=>{let t=LS(e);for(let e of t.first)n.first.add(e);return n.hasSemanticStart||=t.hasSemanticStart,t.isNullable};if(e.type===`tokens`)n.first=e.kinds,n.isNullable=!1;else if(e.type===`call`)Object.assign(n,LS(FS[e.name].body));else if(e.type===`lookahead`)n.hasSemanticStart=e.semantic!==void 0;else if(e.type===`sequence`){let t=e.units[0];n.hasSemanticStart=t?.type===`lookahead`&&t.semantic!==void 0,n.isNullable=e.units.every((e,t)=>t===0&&e.type===`lookahead`||r(e))}else e.type===`choice`?n.isNullable=e.alternatives.map(r).some(Boolean):e.type!==`action`&&(n.isNullable=r(e.body)||e.type!==`oneOrMore`);return IS.set(e,n),n},RS=(e,t)=>{e.isLookingAhead=!0;let n=t(e);return e.isLookingAhead=!1,n},zS=(e,t)=>{if(e.scanPosition===e.lastPosition&&(e.remaining--,e.lastPosition=Gx(e,e.scanPosition)),e.scanPosition=Gx(e,e.scanPosition),e.isRescanning){let t=0,n=e.token;for(;n!==void 0&&n!==e.scanPosition;)t++,n=n.next;n!==void 0&&t<100&&(e.farthestRescan=Math.max(e.farthestRescan,t))}return t.has(e.scanPosition.kind)?e.remaining===0&&e.scanPosition===e.lastPosition?`done`:`matched`:`failed`},BS=(e,t)=>{if(t.type===`tokens`)return zS(e,t.kinds);if(t.type===`call`)return BS(e,FS[t.name].body);if(t.type===`action`)return`matched`;if(t.type===`lookahead`)return t.semantic===void 0||RS(e,t.semantic)?`matched`:`failed`;if(t.type===`sequence`){for(let[n,r]of t.units.entries()){if(n===0&&r.type===`lookahead`)continue;let t=BS(e,r);if(t!==`matched`)return t}return`matched`}let n=e.scanPosition;if(t.type===`choice`){for(let r of t.alternatives){let t=r.units[0],i=t?.type!==`lookahead`||t.semantic===void 0||RS(e,t.semantic)?BS(e,r):`failed`;if(i!==`failed`)return i;e.scanPosition=n}return`failed`}let r=BS(e,t.body);if(r===`failed`)return e.scanPosition=n,t.type===`oneOrMore`?`failed`:`matched`;if(r===`done`||t.type===`optional`)return r;for(;;){let n=e.scanPosition,r=BS(e,t.body);if(r===`done`)return r;if(r===`failed`)return e.scanPosition=n,`matched`}},VS=(e,t,n)=>{e.remaining=t,e.scanPosition=e.token,e.lastPosition=e.token;let r=BS(e,n)!==`failed`,i={generation:e.generation+t-e.remaining,first:e.token,amount:t},a=e.calls.get(n)??[],o=a.findIndex(t=>t.generation<=e.generation);return o===-1?a.push(i):a[o]=i,e.calls.set(n,a),r},HS=(e,t)=>t.findIndex(t=>{let n=t.units[0],r=n?.type===`lookahead`?n:void 0,i=r?.amount??1,a=r?.expansion??t,o=r?.semantic;return i===0||LS(a).isNullable?o===void 0||o(e):i===1&&o===void 0&&!LS(a).hasSemanticStart?LS(a).first.has(Kx(e,1).kind)?!0:(e.failedSwitchGeneration=e.generation,!1):VS(e,i,a)&&(o===void 0||o(e))}),US=e=>{e.isRescanning=!0;for(let[t,n]of e.calls)for(let r of n.filter(t=>t.generation>e.generation))if(e.remaining=r.amount,e.scanPosition=r.first,e.lastPosition=r.first,BS(e,t)===`done`)break;e.isRescanning=!1;let t=Math.max(+(e.failedSwitchGeneration===e.generation),e.farthestRescan),n=[],r=Gx(e,e.token),i=r;for(let r=0;r<t;r++){if(i.kind===Ox){n.push(`<EOF>`);break}n.push(i.image),r<t-1&&(i=Gx(e,i))}return`Encountered "${n.join(` `)}" at line ${r.beginLine}, column ${r.beginColumn} and token "${$e(e.token.image)}" `},WS=(e,t)=>{let n=e.expecting===``?``:`Was expecting "${e.expecting}"\n`,r=e.messages.slice(-5).reverse().map(e=>`${e.name} starting at line ${e.token.beginLine}, column ${e.token.beginColumn}.\n`).join(``);return e.report=`${n}${t??US(e)}\n\nResidual stack trace follows:\n${r}`,!1},GS=(e,t)=>{let n=Gx(e,e.token);return t.has(n.kind)?(e.token=n,e.generation++,e.frames[e.frames.length-1].heirs.push({kind:`token`,heirs:[],first:n,last:n}),!0):(e.failedSwitchGeneration=e.generation,WS(e))},KS=(e,t)=>{let n=FS[t];n.message!==void 0&&(e.messages.push({name:n.message,token:Kx(e,1)}),e.expecting=``);let r={heirs:[],node:void 0};if(e.frames.push(r),!qS(e,n.body))return!1;e.frames.pop(),n.message!==void 0&&(e.messages.pop(),e.expecting=``);let i=n.exit?.(r,e);if(typeof i==`string`)return WS(e,i);let a=r.node??(r.heirs.length===0?void 0:$x(t,r.heirs));return a!==void 0&&e.frames.at(-1)?.heirs.push(a),!0},qS=(e,t)=>{if(t.type===`tokens`)return GS(e,t.kinds);if(t.type===`call`)return KS(e,t.name);if(t.type===`action`){let n=t.run(e);return n===void 0||WS(e,n)}if(t.type===`lookahead`)return t.semantic===void 0||t.semantic(e)||WS(e);if(t.type===`sequence`)return t.units.every((t,n)=>n===0&&t.type===`lookahead`||qS(e,t));if(t.type===`choice`){let n=HS(e,t.alternatives);return n===-1?WS(e):qS(e,t.alternatives[n])}if(t.type===`oneOrMore`&&!qS(e,t.body))return!1;if(t.type===`optional`)return HS(e,[t.body])===-1||qS(e,t.body);for(;HS(e,[t.body])===0;)if(!qS(e,t.body))return!1;return!0},JS=e=>{let t=Ze(e),n={kind:Ox,image:``,beginLine:0,beginColumn:0,next:void 0},r={readToken:()=>{let e=t();return typeof e==`string`?(r.lexicalError??=e,{...n,next:void 0}):e},lexicalError:void 0,token:n,generation:0,failedSwitchGeneration:-1,scanPosition:n,lastPosition:n,remaining:0,isLookingAhead:!1,isRescanning:!1,farthestRescan:0,calls:/* @__PURE__ */ new Map,expecting:`nothing`,messages:[],pushedErrors:[],moduleName:void 0,junctions:[],frames:[],operatorStacks:[],lastOperator:void 0,proofLevels:[],isTerminalProof:!1,isFairnessHooked:!1,isFairnessParenthesized:[],report:void 0},i=qS(r,{type:`call`,name:`CompilationUnit`});if(r.lexicalError!==void 0)return r.lexicalError;let a=[...r.pushedErrors,...i||r.report===void 0?[]:[`***Parse Error***\n${r.report}`]];return a.length===0?void 0:a.join(`
1784
- `)},YS={low:15,high:15},XS={low:16,high:16},$=(e,t,n)=>({low:e,high:t,isAssociative:n}),ZS=new Map([[`=>`,$(1,1,!1)],[`<=>`,$(2,2,!1)],[`~>`,$(2,2,!1)],[`-+->`,$(2,2,!1)],[`/\\`,$(3,3,!0)],[`\\/`,$(3,3,!0)],...(/* @__PURE__ */ `=.#.<.>.<=.>=.\\in.\\notin.\\subseteq.\\subset.\\supseteq.\\supset.\\sqsubseteq.\\sqsupseteq.\\sqsubset.\\sqsupset.\\prec.\\preceq.\\succ.\\succeq.\\sim.\\simeq.\\approx.\\cong.\\asymp.\\doteq.\\propto.\\ll.\\gg.|-.-|.|=.=|.:=.::=`.split(`.`)).map(e=>[e,$(5,5,!1)]),[`\\cdot`,$(5,14,!0)],[`@@`,$(6,6,!0)],[`:>`,$(7,7,!1)],[`<:`,$(7,7,!1)],[`\\cup`,$(8,8,!0)],[`\\cap`,$(8,8,!0)],[`\\`,$(8,8,!1)],[`..`,$(9,9,!1)],[`...`,$(9,9,!1)],[`##`,$(9,13,!0)],[`$`,$(9,13,!0)],[`$$`,$(9,13,!0)],[`??`,$(9,13,!0)],[`!!`,$(9,13,!1)],[`\\sqcap`,$(9,13,!0)],[`\\sqcup`,$(9,13,!0)],[`\\uplus`,$(9,13,!0)],[`\\wr`,$(9,14,!1)],[`+`,$(10,10,!0)],[`++`,$(10,10,!0)],[`(+)`,$(10,10,!0)],[`\\oplus`,$(10,10,!0)],[`%`,$(10,11,!1)],[`%%`,$(10,11,!0)],[`|`,$(10,11,!0)],[`||`,$(10,11,!0)],[`\\X`,$(10,13,!1)],[`-`,$(11,11,!0)],[`--`,$(11,11,!0)],[`(-)`,$(11,11,!0)],[`\\ominus`,$(11,11,!0)],[`*`,$(13,13,!0)],[`**`,$(13,13,!0)],[`/`,$(13,13,!1)],[`//`,$(13,13,!1)],[`\\div`,$(13,13,!1)],[`\\o`,$(13,13,!0)],[`(.)`,$(13,13,!0)],[`\\odot`,$(13,13,!0)],[`(/)`,$(13,13,!1)],[`\\oslash`,$(13,13,!1)],[`(\\X)`,$(13,13,!0)],[`\\otimes`,$(13,13,!0)],[`&`,$(13,13,!0)],[`&&`,$(13,13,!0)],[`\\star`,$(13,13,!0)],[`\\bullet`,$(13,13,!0)],[`\\bigcirc`,$(13,13,!0)],[`^`,$(14,14,!1)],[`^^`,$(14,14,!1)]]),QS=(e,t)=>t.isAssociative||e===`%`||e===`\\X`,$S=/* @__PURE__ */ new Map([[`~`,{low:4,high:4}],[`[]`,{low:4,high:15}],[`<>`,{low:4,high:15}],[`ENABLED`,{low:4,high:15}],[`UNCHANGED`,{low:4,high:15}],[`SUBSET`,{low:8,high:8}],[`UNION`,{low:8,high:8}],[`DOMAIN`,{low:9,high:9}],[`-`,{low:12,high:12}],[`-.`,{low:12,high:12}]]),eC={low:17,high:17},tC=/* @__PURE__ */ new Set([`(`,`[`,`{`,`<<`,`@`,`\\A`,`\\E`,`\\AA`,`\\EE`,`IF`,`CASE`,`LET`,`CHOOSE`,`LAMBDA`,`WF_`,`SF_`]),nC=/* @__PURE__ */ new Set([`(`,`{`,`<<`]),rC=/* @__PURE__ */ new Set([`^+`,`^*`,`^#`]),iC=/* @__PURE__ */ new Set([...rC,`'`]),aC=/* @__PURE__ */ new Set([`-`,`~`,`-.`]),oC=/* @__PURE__ */ new Set([`-.`,`~`,`[]`,`<>`,`ENABLED`,`UNCHANGED`,`SUBSET`,`UNION`,`DOMAIN`]),sC=/* @__PURE__ */ new Set([`-`,`~`,`/\\`,`\\/`,`SUBSET`,`UNION`,`DOMAIN`,`ENABLED`,`UNCHANGED`,`[]`,`<>`]),cC=/* @__PURE__ */ new Set([`+`,`-`,`/`,`\\X`]),lC=/* @__PURE__ */ new Set([`SUBSET`,`UNION`,`DOMAIN`,`ENABLED`,`UNCHANGED`,`[]`,`<>`,...iC]),uC=/* @__PURE__ */ new Set([`<<`,`>>`,`:`,`@`,`(`]),dC=/* @__PURE__ */ new Set([`ASSUME`,`ASSUMPTION`,`AXIOM`,`CONSTANT`,`CONSTANTS`,`COROLLARY`,`INSTANCE`,`LEMMA`,`LOCAL`,`PROPOSITION`,`RECURSIVE`,`THEOREM`,`VARIABLE`,`VARIABLES`]),fC=/* @__PURE__ */ new Set([`THEOREM`,`LEMMA`,`COROLLARY`,`PROPOSITION`]),pC=/* @__PURE__ */ new Set([`BY`,`PROOF`,`OBVIOUS`,`OMITTED`]),mC=/* @__PURE__ */ new Set([`Qed`,`Pick`,`Case`,`Assert`]),hC=/* @__PURE__ */ new Set(/* @__PURE__ */ `, . _ ( ) [ ] { } << >> ]_ >>_ == ! @ : :: ; -> <- |-> \\A \\AA \\E \\EE \\forall \\exists WF_ SF_ (*{ }*)`.split(` `)),gC=/* @__PURE__ */ new Set([``,`*`,`-`]),_C={Obvious:`n OBVIOUS`,Omitted:`n OMITTED`,By:` BY`},vC=(e,t)=>e.line-t.line||e.column-t.column,yC=(e,t)=>({start:vC(e.start,t.start)<=0?e.start:t.start,stop:vC(e.stop,t.stop)>=0?e.stop:t.stop}),bC=e=>({start:{line:e.start.line,column:e.start.column},stop:{line:e.end.line,column:e.end.column+1}}),xC={printed:``,set:``},SC={printed:`
1785
- `,set:``},CC={printed:`
1781
+ `]]),mm=(e=`master`)=>e===`1.7.4`?pm:fm,hm=(e,t)=>e.every(e=>Ji(e,t)),gm=Yr([!1,!0]);Wr(gm);const _m=(e,t,n)=>{if(n-t===1)return e[t];let r=t+n>>1;return ei(_m(e,t,r),_m(e,r,n))},vm=[`\\cup`,`\\cap`,`\\`],ym=e=>typeof e==`object`&&e.kind===`MixedSet`,bm=e=>e.kind===`Interval`||e.kind===`Set`&&e.isNormalized,xm=(e,t,n)=>{t.kind===`Interval`&&Ri(t);let r=t.kind===`Interval`?t:Ur(t);if(e!==`\\cup`){let i=e===`\\cap`,a=[];return un(r,e=>{Ji(e,n)===i&&cn(a,e)}),bm(t)?ar(a):Xr(a)}if(Fi(t))return n;if(!fn(n))return pr({kind:`SetOperation`,operator:e,left:t,right:n});let i=[];return un(r,e=>cn(i,e)),un(n.kind===`Interval`?n:F(n).elements,e=>{Ji(e,t)||cn(i,e)}),Xr(i)},Sm=(e,t)=>{let n=t.elements,r=0,i=n.length;for(;r<i;){let t=r+i>>1,a=n[t];if(typeof a!=`number`)return;a<e.low?r=t+1:i=t}for(let t=e.low;t<=e.high;t++,r++){if(r===n.length)return!1;let e=n[r];if(e!==t)return typeof e!=`number`&&void 0}return!0},Cm=(e,t)=>{if(typeof t==`object`&&t.kind===`Interval`&&t.low<=e.low&&t.high>=e.high)return!0;let n=typeof t==`object`&&t.kind===`Set`?Sm(e,t):void 0;if(n!==void 0)return n;for(let n=e.low;n<=e.high;n++)if(!Ji(n,t))return!1;return!0},wm=(e,t)=>{let n=(t,n)=>hs([Ls(t,n,e)()],0,e);return{...z(e,2,e=>t(n(e,0),()=>n(e,1))),evaluateBinary:void 0,isLazy:!0}},Tm=[_s(`TRUE`,!0),_s(`FALSE`,!1),_s(`BOOLEAN`,gm),_s(`STRING`,{kind:`InfiniteSet`,name:`STRING`}),bs(`=`,Kr),bs(`#`,(e,t)=>!Kr(e,t)),z(`~`,1,e=>!hs(e,0,`~`)),z(`<=>`,2,e=>hs(e,0,`<=>`)===hs(e,1,`<=>`)),wm(`/\\`,(e,t)=>e&&t()),wm(`\\/`,(e,t)=>e||t()),wm(`=>`,(e,t)=>!e||t()),z(`\\in`,2,e=>Ji(R(e,0,`\\in`),R(e,1,`\\in`))),z(`\\notin`,2,e=>!Ji(R(e,0,`\\notin`),R(e,1,`\\notin`))),bs(`\\subseteq`,(e,t)=>{if(typeof e==`object`&&e.kind===`Interval`)return Cm(e,t);if(!dn(e))throw new w(`\\subseteq expects a set but received ${L(e)}`);return typeof e==`object`&&e.kind===`Subset`&&typeof t==`object`&&t.kind===`Subset`&&P(e.base)?hm(F(e.base).elements,t.base):!ki(e,e=>!Ji(e,t))}),...vm.map(e=>z(e,2,t=>{let n=R(t,0,e),r=R(t,1,e),i=e!==`\\cup`&&typeof r==`object`&&r.kind===`Interval`&&typeof n==`object`&&n.kind!==`Interval`;if(fn(n)&&fn(r)&&!ym(n)&&!ym(r)&&!i&&!ln(n)&&!ln(r)){if(e===`\\cup`&&Fi(n))return r;let t=e===`\\cup`?ei:e===`\\cap`?$r:Qr;return Ki((n,r)=>{let i=F(n),a=F(r),o=t(i,a);if(e===`\\cup`){let e=Ur(i),t=Qr(a,i).elements,n=e===i.elements&&(t.length===0||$n(e[e.length-1],t[0])<0);if(e.length+t.length>on())throw new u(sn());if(n&&!i.isNormalized)return o;let r=o===i?ir(o.elements):o;return n||(r.writtenElements=[...e,...t]),r}return o===n||(o.isNormalized=bm(n),i.writtenElements&&!i.isNormalized&&(o.writtenElements=i.writtenElements.filter(e=>Ji(e,o)))),o},(t,n)=>xm(e,t,n),n,r)}return fn(n)?xm(e,n,r):e!==`\\`&&fn(r)?xm(e,r,n):pr({kind:`SetOperation`,operator:e,left:n,right:r})})),z(`SUBSET`,1,e=>({kind:`Subset`,base:R(e,0,`SUBSET`)})),z(`UNION`,1,e=>{let t=R(e,0,`UNION`),n=hn(t)?Ur(t):[],r=n.filter(hn);if(!hn(t)||r.length!==n.length)return pr({kind:`Union`,base:t});let i=r.flatMap(Ur),a=()=>{let e={kind:`MixedSet`,elements:[]};return i.forEach(t=>{Ji(t,e)||cn(e.elements,t)}),Xr(e.elements)};return ym(t)||r.some(ym)?a():r.length===0?Zr:Ki(e=>Hi(_m(e,0,e.length),i),a,r.map(F),void 0)}),z(`DOMAIN`,1,e=>{let t=R(e,0,`DOMAIN`);if(!pn(t))throw new w(`DOMAIN expects a function but received ${L(t)}`);return ha(t)})],Em=Ms(`Integers`,`Neg`,`IntValue`,1),Dm=e=>{let n=Ms(e,`DotDot`,`IntervalValue`,2);return[Ns(e,`+`,`Plus`,(e,t)=>e+t),Ns(e,`-`,`Minus`,(e,t)=>e-t),Ns(e,`*`,`Times`,(e,t)=>e*t),Ns(e,`^`,`Expt`,(e,n)=>{if(n<0)throw new t(`The second argument of ^ should be a natural number, but instead it is:\n${n}`);if(e===0&&n===0)throw new t(`0^0 is undefined.`);return e**n}),Ns(e,`\\div`,`Divide`,(e,n)=>{if(n===0)throw new t(`The second argument of \\div is 0.`);let r=Math.floor(e/n);if(xs(r))throw Ss(`${e} \\div ${n}`);return r}),Ns(e,`%`,`Mod`,(e,n)=>{if(n<=0)throw new t(`The second argument of % should be a positive number, but instead it is:\n${n}`);return(e%n+n)%n}),bs(`..`,(e,t)=>{let r=js(t,n);return{kind:`Interval`,low:js(e,n),high:r}})]},Om=Dm(`Naturals`),km=Dm(`Integers`),Am=e=>{let t=Om.indexOf(e);return t===-1?void 0:km[t]},jm=e=>{let t=(t,n=`tlc2.value.IBoolValue`)=>`public static ${n} tlc2.module.${e}.${t}(tlc2.value.impl.Value,tlc2.value.impl.Value)`,n=e===`Integers`;return[As(Fs(`<`,(e,t)=>e<t),t(`LT`)),As(Fs(`>`,(e,t)=>e>t),n?t(`GT`,`tlc2.value.impl.BoolValue`):t(`GT`)),As(Fs(`<=`,(e,t)=>e<=t),t(`LE`)),As(Fs(`>=`,(e,t)=>e>=t,n?`>=`:`>`),t(`GEQ`))]},Mm=[_s(`Nat`,{kind:`InfiniteSet`,name:`Nat`}),...Om,...jm(`Naturals`)],Nm=[_s(`Int`,{kind:`InfiniteSet`,name:`Int`}),...km,...jm(`Integers`),z(`-.`,1,e=>{let t=js(R(e,0,`-`),Em);if(xs(-t))throw Ss(`-${t}`);return-t})],Pm=(e,n,r)=>{let i=R(e,n,r),a=Ui(i);if(!a)throw new t(`${r}\n${N(L(i))}`);return a},Fm=(e,t,n)=>{let r=R(e,t,n);return typeof r==`string`?r:Pm(e,t,n)},Im=(e,t,n)=>{let r=R(e,t,`SubSeq`);if(typeof r!=`number`)throw fs(n,`SubSeq`,`natural number`,r);return r},Lm=(e,t,n)=>typeof e==`string`?Un(e.slice(t,n)):fi(e.slice(t,n)),Rm=(e,t)=>`The ${e}argument of ${t} should be a sequence, but instead it is:`,zm=(e,t)=>`Evaluating an expression of the form ${e} when s is not a ${t}:`,Bm=(e,t)=>{let n=pc.get(e);return n?t.map(e=>{let t=n.get(e.name);return t?As(e,t):e}):t},Vm=e=>Bm(`Sequences`,[z(`Seq`,1,e=>({kind:`SequenceSet`,base:R(e,0,`Seq`)})),z(`Len`,1,e=>Fm(e,0,Rm(``,`Len`)).length),z(`\\o`,2,e=>{let n=Fm(e,0,zm(`s \\o t`,`sequence`));if(typeof n!=`string`){let t=Pm(e,1,zm(`t \\o s`,`sequence`)),r=n.length===0?R(e,1,`\\o`):t.length===0?R(e,0,`\\o`):void 0;return r!==void 0&&lr(r)===`tuple`?r:fi([...n,...t])}let r=R(e,1,`\\o`);if(typeof r!=`string`)throw new t(`${zm(`t \\o s`,`string`)}\n${N(L(r))}`);return Un(n+r)}),z(`Append`,2,t=>fi([...Pm(t,0,zm(e===`1.7.4`?`Append(v, s)`:`Append(s, v)`,`sequence`)),R(t,1,`Append`)])),z(`Head`,1,e=>{let n=Pm(e,0,Rm(``,`Head`));if(n.length===0)throw new t(`Attempted to apply Head to the empty sequence.`);return n[0]}),z(`Tail`,1,e=>{let n=Fm(e,0,Rm(``,`Tail`));if(n.length===0)throw new t(`Attempted to apply Tail to the empty sequence.`);return Lm(n,1)}),z(`SubSeq`,3,e=>{let n=Fm(e,0,Rm(`first `,`SubSeq`)),r=Im(e,1,`second`),i=Im(e,2,`third`);if(r>i)return Lm(n,0,0);let a=r<1||r>n.length?{position:`second`,value:r}:i>n.length?{position:`third`,value:i}:void 0;if(a)throw new t(`The ${a.position} argument of SubSeq must be in the domain of its first argument:\n${N(L(R(e,0,`SubSeq`)))}\n, but instead it is\n${a.value}`);return Lm(n,r-1,i)}),vs(`SelectSeq`,2,e=>{let n=gs(e,1,`SelectSeq`);return fi(Pm(e,0,Rm(`first `,`SelectSeq`)).filter(e=>{let r=n.call([e]);if(typeof r!=`boolean`)throw new t(`The second argument of SelectSeq should be a boolean-valued operator, but instead it is:\n<Operator ${n.name}>`);return r}))})]),Hm=e=>Bm(`FiniteSets`,[z(`IsFiniteSet`,1,e=>Bi(R(e,0,`IsFiniteSet`))),z(`Cardinality`,1,n=>{let r=R(n,0,`Cardinality`);if(!dn(r)||typeof r==`object`&&(r.kind===`InfiniteSet`||r.kind===`SequenceSet`))throw new t(`Attempted to compute cardinality of the value\n${N(L(r))}`);return Ri(r,e)})]),Um=[As(z(`Warshall`,1,e=>{let n=R(e,0,`Warshall`);if(!dn(n)||Kn(n))throw new t(`Applying TransitiveClosure to the following value,\nwhich is not an enumerable set:\n${N(L(n))}`);Ri(n);let r=[],i=/* @__PURE__ */ new Map,a=e=>{let t=Pa(e),n=i.get(t)??r.length;return n===r.length&&(i.set(t,n),r.push(e)),n},o=F(n).elements.map(e=>{let n=Ui(e);if(n?.length!==2)throw new t(`Attempted to apply TransitiveClosure to a set containing\nthe following value:\n${N(L(e))}`);return[a(n[0]),a(n[1])]}),s=r.map(()=>r.map(()=>!1));o.forEach(e=>{s[e[0]][e[1]]=!0});for(let e=0;e<r.length;e++)for(let t=0;t<r.length;t++)if(s[t][e])for(let n=0;n<r.length;n++)s[e][n]&&(s[t][n]=!0);return Xr(r.flatMap((e,t)=>r.flatMap((n,r)=>s[t][r]?[fi([e,n])]:[])))}),`public static tlc2.value.impl.Value tlc2.module.TransitiveClosure.Warshall(tlc2.value.impl.Value)`)],Wm=(e,t,n,r,i,a)=>{if(e===`TransitiveClosure`)return Um;if(e===`AnySet`)return[_s(`ANY`,Xn)];if(e===`IOUtils`)return lp(r,a);if(e===`_TLCTrace`)return fp(r);if(!mm(n.version).has(e))return;let o=qm(e,t,n,r,i);return e===`Randomization`&&o?[...o,Lp(n)]:o},Gm=/* @__PURE__ */ new Map([[`Integers`,[`Naturals`]],[`Sequences`,[`Naturals`]],[`FiniteSets`,[`Naturals`,`Sequences`]],[`TLC`,[`Naturals`,`Sequences`,`FiniteSets`]],[`Randomization`,[`Naturals`,`FiniteSets`,`Sequences`]],[`_Possible`,[`TLC`,`TLCExt`,`Naturals`,`Sequences`,`FiniteSets`,`Integers`]],[`Json`,[`Sequences`,`FiniteSets`,`TLC`,`Naturals`]],[`Bags`,[`Naturals`]],[`TLCExt`,[`TLC`,`Integers`,`Naturals`,`Sequences`,`FiniteSets`]]]),Km=/* @__PURE__ */ new Map([[`Integers`,[`Naturals`]]]),qm=(e,t,n,r,i)=>{switch(e){case`Naturals`:return Mm;case`Integers`:return Nm;case`Sequences`:return Vm(n.version);case`FiniteSets`:return Hm(n.version);case`TLC`:return Bm(`TLC`,um(t,n));case`Randomization`:return Rp(n);case`_Possible`:return $p(t,n);case`Json`:return cp(r);case`Bags`:return Bm(`Bags`,Nf(i));case`TLCExt`:return Bm(`TLCExt`,Qp(t,n));default:return}},Jm=(e,t,n)=>{let r=e.callStack;if(!r)return n();let i=r.expressions.at(-1)!==t&&au.get(t)||[];r.expressions.push(...i,t);let a=Gi.sets,o=a??[],s=o.length;Gi.sets=o;try{return n()}catch(e){throw Sv(r,o.slice(s),e),e}finally{r.isFrozen||(r.expressions.length-=i.length+1),o.length=s,Gi.sets=a}},Ym=(e,t,n)=>e.coverage?Go(e.coverage,t,n):-1,Xm=(e,t,n)=>e.coverage?qo(e.coverage,t,n):n(),Zm=(e,t,n,r)=>Xm(e,t,()=>W(n,r)),Qm=(e,t,n,r)=>{let i=Zm(e,t,n,r),a=e.coverage;if(a?.covered.has(n))for(let e=t;e!==-1;e=a.prefixes[e])a.primary[e]--;return i},$m=(e,t,n)=>e.isInit?{environment:e.environment,scope:t,state:n,next:void 0}:{environment:e.environment,scope:t,state:e.current,next:n},eh=e=>!e.includes(void 0),th=e=>e.variables.map(()=>void 0),nh=(e,t,n)=>{let r=[...e];return r[t]=n,r},rh=(e,t)=>{let n=e.operands[0].location,r=e.location.range,i=e.prefixEnds?.[t-2],a=r&&i?{...n,range:{...r,end:i}}:e.location;return{...e,operands:e.operands.slice(0,t),location:a}},ih=(e,t)=>e.coverage?e.coverage.prefixes[t]:-1,ah=e=>e.kind===`Identifier`?e.name:void 0,oh=(e,t,n)=>{if(t.kind===`Label`)return oh(e,t.body,n);let r=ah(t);if(r===void 0)return;let i=o_(n,r);if(i?.kind===`Thunk`)return oh(e,i.expression,i.scope);if(i)return;let a=e.variableIndex.get(r);if(a!==void 0)return a;let o=X_(r,e);return o?.kind===`Closure`&&o.params.length===0?oh(e,o.body,o.scope):void 0},sh=(e,t,n)=>{if(t.kind===`Prime`)return oh(e,t.expression,n);if(t.kind===`Label`)return sh(e,t.body,n);let r=ah(t);if(r===void 0)return;let i=o_(n,r);if(i?.kind===`Thunk`)return sh(e,i.expression,i.scope);if(i)return;let a=X_(r,e);return a?.kind===`Closure`&&a.params.length===0?sh(e,a.body,a.scope):void 0},ch=e=>{if(typeof e!=`boolean`)throw new w(`TLC expected a boolean expression.`);return e},lh=e=>!e.isEnabled&&(e.isInit||e.environment.runtime.isWarningEnabled),uh=(e,t,n,r)=>{let i=fh(e,t,n,r);return i&&e.coverage&&!e.isInit&&Ko(e.coverage,r),i},dh=(e,t,n)=>{let r=e.coverage;return r&&e.isInit&&(Ko(r,n),Ko(r,r.roots[n])),e.onState(t),!0},fh=(e,t,n,r)=>t===void 0?eh(n)?dh(e,n,r):e.onIncomplete?.(n)??!1:eh(n)&&lh(e)?mh(e,t,n,r):t.kind===`Predicate`?hh(e,t.expression,t.rest,t.scope,n,t.node):t.kind===`Unchanged`?jh(e,t.expression,t.rest,t.scope,n,t.node):ph(e,t,n)&&uh(e,t.rest,n,t.node),ph=(e,t,n)=>{let r=e.environment,i=Zm(e,t.node,t.expression,{environment:r,scope:t.scope,state:e.current,next:void 0}),a=(()=>{try{return Zm(e,t.node,t.expression,{environment:r,scope:t.scope,state:n,next:void 0})}catch(t){throw e.isEnabled?a_(t,r.runtime.version):t}})();try{return!Kr(i,a)}catch(t){throw e.callStack&&Sv(e.callStack,[i],t),t}},mh=(e,t,n,r)=>{for(let i=t;i!==void 0;i=i.rest){if(i.kind===`Unchanged`)return jh(e,i.expression,i.rest,i.scope,n,i.node);if(!(i.kind===`Changed`?ph(e,i,n):ch(Zm(e,i.node,i.expression,$m(e,i.scope,n))))){let t=e.coverage;return t&&e.isInit&&t.secondary[t.roots[r]]++,!1}}return dh(e,n,r)},hh=(e,t,n,r,i,a)=>gh(e,t,n,r,i,Ym(e,a,t)),gh=(e,t,n,r,i,a)=>Jm(e,t,()=>{switch(t.kind){case`Let`:{let o=$m(e,r,i),s=t.definitions,c=e.coverage?pv(s,o,{impure:new Set(s),streamed:/* @__PURE__ */ new Set}):pv(s,o);return hh(e,t.body,n,c,i,a)}case`Label`:return hh(e,t.body,n,r,i,a);default:if(Th.has(t.kind))throw new w(`The state relation is not a boolean expression.`);return Jm(e,t,()=>kh(e,t,n,r,i,a))}}),_h=(e,t,n,r,i)=>ch(t)&&uh(e,n,r,i),vh=/* @__PURE__ */ new Set([`=`,`#`,`~`,`<=>`,`/\\`,`\\/`,`=>`,`\\in`,`\\notin`,`\\subseteq`,`\\cup`,`\\cap`,`\\`,`SUBSET`,`UNION`,`DOMAIN`,`~>`,`-+->`,`\\cdot`]),yh=(e,t,n,r,i,a)=>{let o=$m(e,r,i);if(t.kind===`Identifier`){let s=o_(r,t.name);if(s?.kind===`Thunk`&&s.cache===void 0){let t=e.coverage?.values.get(s)??a;return hh(e,s.expression,n,s.scope,i,t)}if(s?.kind===`Operator`&&s.operator.kind===`Closure`&&s.operator.params.length===0)return hh(e,s.operator.body,n,s.operator.scope,i,a);let c=s?void 0:e.environment.definitions.get(t.name),l=s?void 0:X_(t.name,e.environment);return l?.kind===`Closure`&&l.params.length===0&&!e.environment.variableIndex.has(t.name)&&!(c&&lf(c,e.environment))?hh(e,l.body,n,l.scope,i,a):_h(e,Qm(e,a,t,o),n,i,a)}let s=Z_(t,o);if(s?.kind===`Closure`&&s.params.length===t.args.length){let r=Xm(e,a,()=>lv(s,t.args,o));return hh(e,s.body,n,r,i,a)}let c=vh.has(t.operator)?Zm(e,a,t,o):Qm(e,a,t,o);return _h(e,c,n,i,a)},bh=(e,t,n,r,i,a)=>{let o=n[r];return o===void 0?uh(e,t,nh(n,r,i),a):Kr(o,i)&&uh(e,t,n,a)},xh=(e,t,n,r,i)=>({kind:e,expression:t,scope:n,node:r,rest:i}),Sh=(e,t,n)=>(e.coverage&&Jo(e.coverage,t,n.length+1),n),Ch=(e,t,n,r,i,a)=>{let[o,s]=t.args,c=e.isInit?oh(e.environment,o,r):sh(e.environment,o,r),l=$m(e,r,i);if(c===void 0)return Zm(e,a,t,l)===!0&&uh(e,n,i,a);let u=Zm(e,a,s,l),d=i[c];if(t.operator===`=`)return bh(e,n,i,c,u,a);let f=t.operator===`\\subseteq`?{kind:`Subset`,base:u}:u;if(typeof f==`object`&&f!==u&&e.callStack?.sources.set(f,s),d!==void 0)return Zm(e,a,t,l)===!0&&uh(e,n,i,a);if(!hi(f))throw new w(`The right side of \\IN is not enumerable.`);return Sh(e,f,Ai(f)).reduce((t,r)=>uh(e,n,nh(i,c,r),a)||t,!1)},wh=/* @__PURE__ */ new Set([`=`,`\\in`,`\\subseteq`]),Th=/* @__PURE__ */ new Set([`Number`,`Decimal`,`String`]),Eh={Always:`[]`,Eventually:`<>`,WeakFairness:`WF`,StrongFairness:`SF`},Dh=e=>{let t=e.kind===`Apply`&&(e.operator===`~>`||e.operator===`-+->`)?e.operator===`~>`?`a ~> b`:`a -+-> formula`:Eh[e.kind];if(t!==void 0)return`In computing ENABLED, TLC encountered a temporal formula (${t}).\n${U(e)}`;if(e.kind===`UnboundedQuantifier`)return e.isTemporal?`In computing ENABLED, TLC encountered temporal quantifier.\n${U(e)}`:`In computing ENABLED, TLC encountered unbounded quantifier. Make sure that the expression is of form ${e.quantifier===`Forall`?`\\A`:`\\E`} x \\in S: P(x).\n${U(e)}`;if(e.kind===`Choose`&&e.set===void 0)return`In computing ENABLED, TLC encountered unbounded CHOOSE. Make sure that the expression is of form CHOOSE x \\in S: P(x).\n${U(e)}`},Oh=(e,t,n,r)=>{let i=[],a=e.environment.runtime.version,o=Xm(e,r,()=>E_(t.bounds,t=>{let r=W(t,n),i=C_(r,t,a);return Array.isArray(i)&&Sh(e,r,i),i}));return O_(t.bounds,o,n.scope,e=>(i.push(e),!1)),i},kh=(e,t,n,r,i,a)=>{let o=$m(e,r,i);switch(t.kind){case`Identifier`:return yh(e,t,n,r,i,a);case`Apply`:return wh.has(t.operator)&&t.args.length===2?Ch(e,t,n,r,i,a):t.operator===`=>`&&t.args.length===2?ch(Zm(e,a,t.args[0],o))?hh(e,t.args[1],n,r,i,a):uh(e,n,i,a):yh(e,t,n,r,i,a);case`And`:{let o=t.operands;if(t.isBulleted||o.length===2){let t=o.slice(1).reduceRight((e,t)=>xh(`Predicate`,t,r,a,e),n);return hh(e,o[0],t,r,i,a)}let s=o[o.length-1];return gh(e,rh(t,o.length-1),xh(`Predicate`,s,r,a,n),r,i,ih(e,a))}case`Or`:{let o=t.operands;if(t.isBulleted||o.length===2)return o.reduce((t,o)=>hh(e,o,n,r,i,a)||t,!1);let s=gh(e,rh(t,o.length-1),n,r,i,ih(e,a)),c=hh(e,o[o.length-1],n,r,i,a);return s||c}case`Exists`:return Oh(e,t,o,a).reduce((r,o)=>hh(e,t.body,n,o,i,a)||r,!1);case`Forall`:{let r=Oh(e,t,o,a);if(r.length===0)return uh(e,n,i,a);let s=r.slice(1).reduce((e,n)=>xh(`Predicate`,t.body,n,a,e),n);return hh(e,t.body,s,r[0],i,a)}case`If`:return hh(e,ch(Zm(e,a,t.condition,o))?t.consequent:t.alternative,n,r,i,a);case`Case`:{let s=t.arms.find(t=>ch(Zm(e,a,t.condition,o)))?.body??t.other;if(s===void 0)throw new w(`TLC encountered a CASE with no conditions true.`);return hh(e,s,n,r,i,a)}case`FunctionApplication`:{let r=P_(Zm(e,a,t.function,e.isInit?o:u_(o)));if(r){let s=Xm(e,a,()=>F_(r,t,o));return hh(e,r.body,n,s,i,a)}break}case`Unchanged`:if(!e.isInit)return jh(e,t.expression,n,r,i,a);break;case`BoxAction`:if(!e.isInit){let o=hh(e,t.action,n,r,i,a);return jh(e,t.subscript,n,r,i,a)||o}break;case`AngleAction`:if(!e.isInit)return hh(e,t.action,xh(`Changed`,t.subscript,r,a,n),r,i,a)}let s=e.isEnabled?Dh(t):void 0;if(s!==void 0)throw new w(s);return _h(e,Zm(e,a,t,o),n,i,a)},Ah=(e,t,n)=>e.runtime.warn(wt.unchangedVariableChanged,`The variable ${e.variables[t]} was changed while it is specified as UNCHANGED at\n${U(n)}`),jh=(e,t,n,r,i,a)=>Jm(e,t,()=>{let o=Ym(e,a,t),s=oh(e.environment,t,r);if(s!==void 0){let r=e.current?.[s];if(r===void 0)return!1;e.isEnabled&&e.coverage&&Ko(e.coverage,o);let a=i[s];return a!==void 0&&!Kr(a,r)?(Ah(e.environment,s,t),!1):bh(e,n,i,s,r,o)}if(t.kind===`Tuple`){let[a,...s]=t.elements;if(a===void 0)return uh(e,n,i,o);let c=s.reduceRight((e,t)=>xh(`Unchanged`,t,r,o,e),n);return jh(e,a,c,r,i,o)}if(t.kind===`Identifier`){let a=o_(r,t.name);if(a?.kind===`Thunk`)return jh(e,a.expression,n,a.scope,i,o);let s=a?void 0:X_(t.name,e.environment);if(s?.kind===`Closure`&&s.params.length===0)return jh(e,s.body,n,s.scope,i,o)}if(e.isEnabled&&t.kind===`Apply`){let a=$m(e,r,i),s=Z_(t,a);if(s?.kind===`Closure`&&s.params.length===t.args.length)return jh(e,s.body,n,lv(s,t.args,a),i,o)}let c=e.environment,l=Zm(e,o,t,{environment:c,scope:r,state:e.current,next:void 0}),u=Zm(e,o,t,{environment:c,scope:r,state:i,next:void 0});return Kr(l,u)&&uh(e,n,i,o)}),Mh=(e,t,n,r,i)=>({environment:e,callStack:e.callStack,coverage:t===`enabled`&&e.coverage?.current===-1?void 0:e.coverage,isInit:t===`init`,isEnabled:t===`enabled`,current:n,onState:r,onIncomplete:i}),Nh=/* @__PURE__ */ Error(`The replay found a successor`),Ph=(e,t,n,r)=>{let i=()=>{throw Nh},a=r.coverage?.current??-1,o=Mh(r,`enabled`,n,i,i),s=o.callStack,c=s?.expressions.length??0;try{if(e.kind===`AngleAction`&&e.location===e.action.location){let n=xh(`Changed`,e.subscript,t,a,void 0);hh(o,e.action,n,t,th(r),a)}else hh(o,e,void 0,t,th(r),a);return!1}catch(e){if(e!==Nh)throw e;return s&&(s.expressions.length=c,s.isFrozen=!1),!0}},Fh=(e,t,n,r)=>{let[i,...a]=e;if(i===void 0)return;let o=Mh(t,`init`,void 0,n,r),s=a.reduceRight((e,t)=>xh(`Predicate`,t.expression,t.scope,t.node??-1,e),void 0);hh(o,i.expression,s,i.scope,th(t),i.node??-1)},Ih=(e,t,n,r)=>{if(e.some(e=>Th.has(e.expression.kind)))return;let i=n.coverage;e.forEach(e=>{let a=[],o=e.node??-1;Lh(e,o,t,n,e=>{i&&o!==-1&&i.primary[o]++,a.push(e)}),a.forEach(t=>r(t,e))})},Lh=(e,t,n,r,i,a)=>{let o=Mh(r,`next`,n,i,a);hh(o,e.expression,void 0,e.scope,th(r),t)},Rh=(e,t)=>{let n=[],r=e=>({environment:t,scope:e,state:void 0,next:void 0}),i=(e,r)=>{if(oh(t,e,void 0)!==void 0&&e.kind===`Identifier`){n.push(e);return}if(e.kind===`Tuple`){e.elements.forEach(e=>i(e,r));return}if(e.kind!==`Identifier`)return;let a=o_(r,e.name)?void 0:X_(e.name,t);a?.kind===`Closure`&&a.params.length===0&&i(a.body,a.scope)},a=(e,o,s)=>{switch(e.kind){case`Let`:a(e.body,pv(e.definitions,r(o)),s);return;case`Label`:a(e.body,o,s);return;case`FunctionApplication`:a(e.function,o,s);return;case`If`:a(e.consequent,o,s),a(e.alternative,o,s);return;case`Case`:e.arms.forEach(e=>a(e.body,o,s)),e.other&&a(e.other,o,s);return;case`And`:case`Or`:e.operands.forEach(e=>a(e,o,s));return;case`Exists`:case`Forall`:a(e.body,o,s);return;case`Unchanged`:i(e.expression,o);return;case`AngleAction`:a(e.action,o,s);return;case`BoxAction`:a(e.action,o,s),n.push(e.subscript);return;case`Identifier`:case`Apply`:{if(e.kind===`Apply`){if(e.operator===`=>`){e.args.forEach(e=>a(e,o,s));return}if(e.operator===`=`||e.operator===`\\in`){sh(t,e.args[0],o)!==void 0&&n.push(e);return}}let i=e.kind===`Identifier`?e.name:e.operator,c=o_(o,i);if(c?.kind===`Thunk`){a(c.expression,c.scope,s);return}let l=e.kind===`Apply`?Z_(e,r(o)):c?.kind===`Operator`?c.operator:c?void 0:X_(i,t);if(l?.kind!==`Closure`||s.has(l.body)||t.definitions.get(i)?.isRecursive)return;let u=e.kind===`Apply`?e.args:[];if(l.params.length!==u.length)return;s.add(l.body),a(l.body,lv(l,u,r(o)),s),s.delete(l.body)}}};return e.forEach(e=>a(e.expression,e.scope,/* @__PURE__ */ new Set)),n.flatMap(e=>e.location.range??[])},zh=/* @__PURE__ */ new WeakMap,Bh=/* @__PURE__ */ new WeakMap,Vh=(e,t,n)=>e.isInit?{environment:e.environment,scope:t,state:n,next:void 0}:{environment:e.environment,scope:t,state:e.current,next:n},Hh=(e,t,n)=>{let r=e.slice();return r[t]=n,r},Uh=e=>e.isInit?`initial states`:e.isEnabled?`ENABLED`:`next states`,Wh=(e,t)=>{let n=new w(t);return e.isInit?n:x(n,S.error)},Gh=(e,t,n,r)=>{let i=Yg(n);return r&&Th.has(n.kind)?e.isEnabled?`Attempted to compute ENABLED on a non-boolean expression.\n${i}`:`The ${e.isInit?`init`:`next`} state relation is not a boolean expression.\n${i}`:`In computing ${Uh(e)}, TLC expected a boolean expression,\nbut instead found ${L(t)}.\n${i}`},Kh=(e,t,n)=>{let r=Os(t),i=U(n);return e.isEnabled?`In computing ENABLED, a non-boolean expression(${r}) was used as the guard condition of an IF.\n${i}`:`In computing ${Uh(e)}, a non-boolean expression (${r}) was used as the condition of an IF.${e.isInit?`
1782
+ `:``}${i}`},qh=(e,t,n)=>Xh(e,t,W(t,n)),Jh=new Set(Tm.map(e=>e.name)),Yh=e=>e.kind===`Apply`?Jh.has(e.operator):e.kind!==`Identifier`&&!Th.has(e.kind),Xh=(e,t,r,i=!0)=>{if(typeof r==`boolean`)return r;let a=Gh(e,r,t,i);throw e.isInit&&i&&Yh(t)?new n(a):Wh(e,a)},Zh=(e,t,n,r)=>r.environment.callStack?W(n,r):(e[t]??=kv(n,r.environment))(r),Qh=e=>e===`=`||e===`\\in`||e===`\\subseteq`,$h=(e,t,n)=>{let r=n?zh:Bh,i=r.get(e);if(i)return i;let a=Ng(e,t,n),o=n?void 0:Mg(e,t),s=o?(e,t,n,r,i,s)=>(e.generator?o:a)(e,t,n,r,i,s):a;return r.set(e,s),s},eg=(e,t)=>{if(t.constants.has(e))return;let n=__(e,t);return n?.kind===`Operator`&&n.params.length===0?n:void 0},tg=(e,t,n,r=/* @__PURE__ */ new Set)=>{if(e.kind===`Prime`&&n)return tg(e.expression,t,!1,r);if(e.kind!==`Identifier`||M(e))return;let i=t.variableIndex.get(e.name);if(i!==void 0)return n?void 0:i;let a=eg(e.name,t);if(a&&!r.has(a))return r.add(a),tg(a.body,t,n,r)},ng=(e,t,n)=>tg(e,t,!n),rg=(e,t,n,r,i)=>{if(e.kind===`Prime`&&i)return rg(e.expression,t,n,r,!1);if(e.kind===`Let`){let a=pv(e.definitions,Vh(r,t,n));return rg(e.body,a,n,r,i)}if(e.kind!==`Identifier`)return;let a=o_(t,e.name);if(a?.kind===`Thunk`&&!a.isReleased)return rg(a.expression,a.scope,n,r,i);if(a)return;let o=r.environment.variableIndex.get(e.name);if(o!==void 0)return i?void 0:o;let s=eg(e.name,r.environment);if(s)return rg(s.body,void 0,n,r,i)},ig=(e,t)=>e.kind===`Let`||e.kind===`Identifier`&&(t||M(e))||!t&&e.kind===`Prime`,ag=(e,t,n=/* @__PURE__ */ new Set)=>{if(e.kind===`Tuple`){let r=e.elements.map(e=>ag(e,t,n));return r.every(e=>e!==void 0)?r.flat():void 0}if(e.kind!==`Identifier`||n.has(e.name))return;let r=t.variableIndex.get(e.name);if(r!==void 0)return[{index:r,expression:e}];let i=eg(e.name,t);if(i)return n.add(e.name),ag(i.body,t,n)},og=/* @__PURE__ */ new Set([`Label`,`And`,`Or`,`Exists`,`Forall`,`If`,`Case`,`Let`,`Unchanged`,`BoxAction`,`AngleAction`,`FunctionApplication`]),sg=(e,t,n)=>og.has(e.kind)?!1:e.kind===`Identifier`?t.variableIndex.has(e.name)||t.constants.has(e.name):e.kind===`Apply`?e.operator===`=>`||Qh(e.operator)&&(ig(e.args[0],n)||ng(e.args[0],t,n)!==void 0)||M(e)?!1:t.definitions.get(t.substitutions.get(e.operator)??e.operator)===void 0&&t.builtins.has(e.operator):!0,cg=/* @__PURE__ */ new Set,lg=(e,t)=>{if(M(e))return e.kind===`Identifier`?t.has(e.name)?[]:[e.name]:void 0;let n=[],r=!0;return mu(e,(e,i)=>{let a=r?lg(e,i.length===0?t:/* @__PURE__ */ new Set([...t,...i])):[];a?n.push(...a):r=!1}),r?n:void 0},ug=(e,t,n)=>{if(e.kind===`Or`||e.kind===`Exists`)return!0;let r=e.kind===`Identifier`?e.name:e.kind===`Apply`?e.operator:void 0,i=r===void 0||M(e)?void 0:__(r,t);return i&&!n.has(i)&&(n.add(i),ug(i.body,t,n))?!0:mt(e).some(e=>ug(e,t,n))},dg=(e,t,n)=>{if(e.kind===`Apply`&&e.operator===`=`){let r=ng(e.args[0],t,n);if(r!==void 0)return{kind:`Assign`,expression:e,index:r,value:e.args[1]}}if(!n&&e.kind===`Unchanged`){let n=ag(e.expression,t);if(n)return{kind:`Unchanged`,expression:e,variables:n}}return sg(e,t,n)?{kind:`Guard`,expression:e}:{kind:`Branch`,expression:e,runner:$h(e,t,n)}},fg=(e,t)=>{if(e.bounds.length<2||e.body.kind!==`And`)return;let n=e.bounds.flatMap(e=>e.pattern.kind===`Name`?[e.pattern.name]:[]);if(n.length!==e.bounds.length)return;let r=new Set(n.slice(0,-1)),i=e.body.operands,a=i.findIndex(e=>{if(gf(e,t)===void 0||ug(e,t,/* @__PURE__ */ new Set))return!0;let n=lg(e,cg);return!n||n.some(e=>r.has(e))}),o=a===-1?i.length:a;if(o!==0)return{names:n,guards:i.slice(0,o),rest:i.slice(o)}},pg=(e,t,n)=>{let r=e.map(e=>dg(e,t,n)),i=[],a=[],o=(e,t,n,s,c,l)=>{let u=s,d,f=lh(t);for(let s=e;s<r.length;s++){if(s>0&&f&&Fg(u)){d??=Vh(t,n,u);for(let e=s;e<r.length;e++){let n=r[e],i=t.current,o=i&&n.kind===`Unchanged`?n.variables.find(e=>{let t=u[e.index];return t!==void 0&&!Kr(t,i[e.index])}):void 0;if(o){Ah(t.environment,o.index,o.expression);return}let s=n.expression,c=Zh(a,e,s,d);if(!Xh(t,s,c,!1)){t.onUnsatisfied?.(u,s);return}}l(u,c);return}let e=r[s];if(e.kind===`Guard`){d??=Vh(t,n,u);let r=Zh(i,s,e.expression,d);if(!Xh(t,e.expression,r))return;continue}if(e.kind===`Assign`){d??=Vh(t,n,u);let r=Zh(i,s,e.value,d),a=u[e.index];if(a===void 0)u=Hh(u,e.index,r),d=void 0;else if(!Kr(a,r))return;continue}if(e.kind===`Unchanged`){let n=t.current;if(!n)return;let r;for(let i of e.variables){let e=(r??u)[i.index];if(e===void 0)r??=u.slice(),r[i.index]=n[i.index];else if(!Kr(e,n[i.index])){Ah(t.environment,i.index,i.expression);return}}r&&(u=r,d=void 0);continue}let p=s+1;e.runner(t,n,u,c,!0,(e,r)=>o(p,t,n,e,r,l));return}l(u,c)};return(e,t,n,r,i,a)=>o(0,e,t,n,r,a)},mg=e=>{let t=Dh(e);return(n,r,i,a,o,s)=>{if(n.isEnabled&&t!==void 0)throw Wh(n,t);qh(n,e,Vh(n,r,i))&&s(i,a)}},hg=(e,t)=>{let n=e.args[1];return(r,i,a,o,s,c)=>{let l=t(r,i,a),u=Vh(r,i,a);if(a[l]!==void 0){qh(r,e,u)&&c(a,o);return}let d=W(n,u),f=e.operator===`\\subseteq`?{kind:`Subset`,base:d}:d;if(!hi(f)){let t=r.isEnabled?`The right side of \\IN is not enumerable.`:`In computing ${Uh(r)}, the right side of \\IN is not enumerable.`;throw Wh(r,`${t}\n${U(e)}`)}let p=Ai(f);if(r.generator){for(let e of kp(p.length,f,r.environment.runtime.getRandom(),r.environment.runtime.version))if(c(Hh(a,l,e),o),r.successors>0||r.isStopped)return}for(let e=0;e<p.length&&!r.isStopped;e++)c(Hh(a,l,p[e]),o)}},gg=/* @__PURE__ */ new WeakMap,_g=e=>{let t=gg.get(e);if(t)return t;let n=e.kind===`Tuple`?{kind:`And`,operands:e.elements.map(_g),location:e.location}:{kind:`Unchanged`,expression:e,location:e.location};return gg.set(e,n),n},vg=(e,t)=>{let n=e.args[0],r=mg(e),i=(e,r,i)=>rg(n,r,i,e,!t)??-1,a=hg(e,i);return(t,n,o,s,c,l)=>{let u=i(t,n,o);if(u===-1||o[u]!==void 0){r(t,n,o,s,c,l);return}if(e.operator!==`=`){a(t,n,o,s,c,l);return}let d=W(e.args[1],Vh(t,n,o));l(Hh(o,u,d),s)}},yg=(e,t,n)=>{let r=U(e);return(i,a,o,s,c,l)=>{let u=Vh(i,a,o),d=W(e.function,n?u:u_(u)),f=P_(d);if(f!==void 0){$h(f.body,t,n)(i,F_(f,e,u),o,s,c,l);return}if(!pn(d))throw Wh(i,`In computing ${Uh(i)}, a non-function (${Os(d)}) was applied as a function.\n${r}`);let p=W(e,u);if(typeof p!=`boolean`)throw Wh(i,`In computing ${Uh(i)}, TLC expected a boolean expression,\nbut didn't find one.\n${r}`);p&&l(o,s)}},bg=(e,t)=>{let n=_g(e);return ag(e,t)?pg([n],t,!1):e.kind===`Tuple`?$h(n,t,!1):(r,i,a,o,s,c)=>{let l=e.kind===`Identifier`?o_(i,e.name):void 0;if(l?.kind===`Thunk`&&!l.isReleased){$h(_g(l.expression),t,!1)(r,l.scope,a,o,s,c);return}let u=Vh(r,i,a);if(r.isEnabled&&e.kind===`Apply`){let n=Z_(e,u);if(n?.kind===`Closure`&&n.params.length===e.args.length){$h(_g(n.body),t,!1)(r,lv(n,e.args,u),a,o,s,c);return}}qh(r,n,u)&&c(a,o)}},xg=(e,t,n)=>{let r=e.operator,i=mg(e),a=M(e)?void 0:X_(r,t);if(a?.kind===`Builtin`)return i;if(a?.kind===`Closure`){let i=Pv(a,e.args,t),o;return(e,s,c,l,u,d)=>{o??=$h(a.body,t,n),o(e,i(Vh(e,s,c)),c,u?l:r,u,d)}}return(a,o,s,c,l,u)=>{let d=Vh(a,o,s),f=Z_(e,d);f?.kind===`Closure`?$h(f.body,t,n)(a,lv(f,e.args,d),s,l?c:r,l,u):i(a,o,s,c,l,u)}},Sg=(e,t,n)=>{let r=mg(e),i=M(e)?void 0:eg(e.name,t),a;return(o,s,c,l,u,d)=>{let f=o_(s,e.name);f?.kind===`Thunk`&&!f.isReleased?$h(f.expression,t,n)(o,f.scope,c,l,u,d):f||!i||e.location.range&&G_(i,t)!==void 0?r(o,s,c,l,u,d):(a??=$h(i.body,t,n),a(o,void 0,c,u?l:i.name,u,d))}},Cg=(e,t)=>{if(e.kind!==`Apply`||e.operator!==`=`||M(e))return;let n=e.args[0],r=e.args[1];if(n.kind!==`FunctionApplication`||r.kind!==`String`)return;let i=n.args.length===1?n.args[0]:void 0;if(i?.kind!==`Identifier`||!M(i))return;let a=tg(n.function,t,!1);if(a!==void 0)return{variable:a,argument:i.name,labels:/* @__PURE__ */ new Set([r.value])}},wg=e=>e.kind===`And`?e.operands.flatMap(wg):[e],Tg=(e,t)=>(e.kind===`Identifier`||e.kind===`Apply`&&(e.operator===`=`||e.operator===`#`))&&sg(e,t,!1),Eg=e=>{let t=[];return(n,r,i)=>{let a=Vh(n,r,i);for(let r=0;r<e.length;r++){let i=e[r];if(!Xh(n,i,Zh(t,r,i,a)))return}}},Dg=(e,t,n)=>{if(n.has(e))return;if(n.add(e),e.kind===`And`){let n=wg(e),r=n.findIndex(e=>!Tg(e,t)||Cg(e,t)),i=r===-1?void 0:Cg(n[r],t);return i?{...i,before:r===0?void 0:Eg(n.slice(0,r))}:void 0}if(e.kind===`Or`){let r=e.operands.map(e=>Dg(e,t,n)),i=r[0],a=r.every(e=>e!==void 0&&e.before===void 0&&e.variable===i?.variable&&e.argument===i.argument);if(!i||!a)return;let o=new Set(r.flatMap(e=>[...e?.labels??[]]));return{variable:i.variable,argument:i.argument,labels:o,before:void 0}}if(e.kind!==`Apply`||M(e))return;let r=X_(e.operator,t);if(r?.kind!==`Closure`||r.scope!==void 0)return;let i=Dg(r.body,t,n),a=r.params.findIndex(e=>e.arity===0&&e.name===i?.argument),o=e.args[a];if(!i||o?.kind!==`Identifier`||!M(o))return;let s=i.before,c=s&&Pv(r,e.args,t);return{variable:i.variable,argument:o.name,labels:i.labels,before:s&&c&&((e,t,n)=>s(e,c(Vh(e,t,n)),n))}},Og=(e,t,n)=>{let r=o_(t,n.argument),i=e.current?.[n.variable];if(r?.kind!==`Value`||typeof i!=`object`||i.kind!==`Function`)return;let a=i.domain.indexOf(r.value),o=a===-1?void 0:i.range[a];return typeof o==`string`?o:void 0},kg=(e,t,n)=>{let r=e.map(e=>$h(e,t,n)),i=n?[]:e.map(e=>Dg(e,t,/* @__PURE__ */ new Set)),a=i.find(e=>e!==void 0),o=i.map(e=>e?.variable===a?.variable&&e?.argument===a?.argument?e:void 0);return(e,t,n,i,s,c)=>{let l=a&&Og(e,t,a);for(let a=0;a<r.length&&!e.isStopped;a++){let u=o[a];l!==void 0&&u?.labels.has(l)===!1?u.before?.(e,t,n):r[a](e,t,n,i,s,c)}}},Ag=e=>(t,n,r,i,a,o)=>{let s=t.generator;if(!s)throw Error(`A random choice needs the run's generator`);let c=Math.floor(s.nextDouble()*e.length),l=yp(s);for(let s=0;s<e.length;s++)if(e[(c+s*l)%e.length](t,n,r,i,a,o),t.successors>0||t.isStopped)return},jg=(e,t)=>{let n=$h(e.body,t,!1);return(r,i,a,o,s,c)=>{let l=Vh(r,i,a),u=t.runtime.version,d=E_(e.bounds,e=>W(e,l)).map((n,r)=>kp(x_(n,e.bounds[r].set,u).length,n,t.runtime.getRandom(),u)),f=(t,i)=>{if(t<0)return n(r,i,a,o,s,c),r.successors>0||r.isStopped;let l=e.bounds[t].pattern;return d[t].some(e=>f(t-1,c_(i,l,e)))};f(d.length-1,i)}},Mg=(e,t)=>{if(e.kind===`Exists`)return jg(e,t);if(e.kind!==`Or`)return;let n=e.operands.map(e=>$h(e,t,!1));return e.isBulleted?Ag(n):n.reduce((e,t)=>Ag([e,t]))},Ng=(e,t,n)=>{let r=e=>$h(e,t,n);switch(e.kind){case`And`:return pg(e.operands,t,n);case`Or`:return kg(e.operands,t,n);case`Exists`:{let i=r(e.body),a=e.bounds[0];if(e.bounds.length===1&&a.pattern.kind===`Name`){let e=a.pattern.name;return(n,r,o,s,c,l)=>{let u=x_(W(a.set,Vh(n,r,o)),a.set,t.runtime.version);for(let t=0;t<u.length&&!n.isStopped;t++)i(n,s_(r,e,u[t]),o,s,c,l)}}let o=n?void 0:fg(e,t);if(o){let r=pg(o.rest,t,n);return(n,i,a,s,c,l)=>{let u=Vh(n,i,a),d=E_(e.bounds,e=>x_(W(e,u),e,t.runtime.version));if(d.some(e=>e.length===0))return;let f=(e,t)=>{if(e<0)r(n,t,a,s,c,l);else for(let r of d[e]){if(n.isStopped)return;let i=s_(t,o.names[e],r);if(e===d.length-1){let e=Vh(n,i,a);if(!o.guards.every(t=>qh(n,t,e)))continue}f(e-1,i)}};f(d.length-1,i)}}return(t,n,r,a,o,s)=>{k_(e.bounds,Vh(t,n,r),e=>(i(t,e,r,a,o,s),t.isStopped))}}case`Forall`:{let i=r(e.body),a=!n&&gf(e,t)!==void 0&&!ug(e.body,t,/* @__PURE__ */ new Set)?lg(e,cg):void 0;return(t,n,r,o,s,c)=>{let l=[];k_(e.bounds,Vh(t,n,r),e=>(l.push(e),!1));let u=[...l.slice(0,1),...l.slice(1).reverse()];if(a?.every(e=>o_(n,e)?.kind===`Value`)){u.every(n=>qh(t,e.body,Vh(t,n,r)))&&c(r,o);return}let d=(n,r,a)=>{n===u.length?c(r,a):n>0&&t.isInit&&Fg(r)?u.slice(n).every(n=>qh(t,e.body,Vh(t,n,r)))&&c(r,a):i(t,u[n],r,a,!0,(e,t)=>d(n+1,e,t))};d(0,r,o)}}case`If`:{let t=r(e.consequent),n=r(e.alternative);return(r,i,a,o,s,c)=>{let l=W(e.condition,Vh(r,i,a));if(typeof l!=`boolean`)throw Wh(r,Kh(r,l,e));(l?t:n)(r,i,a,o,s,c)}}case`Case`:{let t=e.arms.map(e=>({condition:e.condition,source:e.body,body:r(e.body)})),n=e.other?r(e.other):void 0;return(r,i,a,o,s,c)=>{let l=Vh(r,i,a),u=t.find(e=>{let t=W(e.condition,l);if(typeof t==`boolean`)return t;throw Wh(r,`In computing ${Uh(r)}, a non-boolean expression${r.isEnabled?``:` `}(${Os(t)}) was used as a guard condition of a CASE.\n${Yg(e.source)}`)})?.body??n;if(!u)throw Wh(r,`In computing ${Uh(r)}, TLC encountered a CASE with no conditions true.\n${U(e)}`);u(r,i,a,o,s,c)}}case`Let`:{let n=r(e.body),i=hv(e.definitions,t);return(t,r,a,o,s,c)=>n(t,pv(e.definitions,Vh(t,r,a),i),a,o,s,c)}case`Unchanged`:return n?()=>{throw new w(`UNCHANGED appears in an initial predicate at ${Kg(e)}`)}:bg(e.expression,t);case`AngleAction`:{let n=r(e.action),i={kind:`Unchanged`,expression:e.subscript,location:e.subscript.location},a=(e,n,r)=>{try{return qh(e,i,Vh(e,n,r))}catch(n){throw e.isEnabled?a_(n,t.runtime.version):n}};return(e,t,r,i,o,s)=>n(e,t,r,i,o,(n,r)=>{a(e,t,n)||s(n,r)})}case`BoxAction`:return kg([e.action,_g(e.subscript)],t,n);case`Label`:return r(e.body);case`Identifier`:return Sg(e,t,n);case`FunctionApplication`:return yg(e,t,n);case`Apply`:{let i=e.args;if(Qh(e.operator)){let r=ng(i[0],t,n);if(r!==void 0)return e.operator===`=`?pg([e],t,n):hg(e,()=>r);if(ig(i[0],n))return vg(e,n)}if(e.operator===`=>`){let t=r(i[1]);return(n,r,a,o,s,c)=>{let l=W(i[0],Vh(n,r,a));if(typeof l!=`boolean`){let t=Os(l),r=U(e);throw Wh(n,n.isInit?`In computing initial states of a predicate of form P => Q, P was ${t}\n.${r}`:n.isEnabled?`While computing ENABLED of an expression of the form P => Q, P was ${t}.\n${r}`:`In computing next states of a predicate of the form P => Q, P was\n${t}.\n${r}`)}l?t(n,r,a,o,s,c):c(a,o)}}return xg(e,t,n)}default:return mg(e)}},Pg=e=>e.variables.map(()=>void 0),Fg=e=>{for(let t=0;t<e.length;t++)if(e[t]===void 0)return!1;return!0},Ig=(e,t)=>{let n=t.state;if(!n||!Fg(n))throw new w(`ENABLED needs a complete state at ${Kg(e)}`);let r=t.environment;if(r.callStack||r.coverage&&r.coverage.current!==-1)return Ph(e,t.scope,n,r);let i={environment:r,isInit:!1,isEnabled:!0,current:n,isStopped:!1,generator:void 0,successors:0};return $h(e,r,!1)(i,t.scope,Pg(r),void 0,!1,()=>{i.isStopped=!0}),i.isStopped},Lg=(e,t,n,i,a)=>{let o={environment:t,isInit:!0,isEnabled:!1,current:void 0,isStopped:!1,generator:void 0,successors:0};$h(e,t,!0)(o,i,Pg(t),void 0,!1,e=>{if(!o.isStopped){if(!Fg(e)){if(a){o.isStopped=a([...e]);return}throw x(new r([...e]),S.error)}o.isStopped=n(e)}})},Rg=(e,t,n)=>{let r=[];return Lg(e,t,e=>(r.push(e),!1),n),r},zg=(e,t,n,r,i,a,o)=>{let s={environment:n,isInit:!1,isEnabled:!1,current:t,isStopped:!1,generator:a,successors:0,onUnsatisfied:o};return $h(e,n,!1)(s,i,Pg(n),void 0,!1,(e,t)=>{if(!s.isStopped){if(!Fg(e)){let r=n.variables.filter((t,n)=>e[n]===void 0);throw new re(`Successor state is not completely specified by action ${t??`Next`}. The following variables are not assigned: ${r.join(`, `)}`,e,t,r)}s.successors++,s.isStopped=r({state:e,action:t})}}),s.successors},Bg=(e,t,n,r)=>{let i={environment:n,isInit:!1,isEnabled:!1,current:t,isStopped:!1,generator:void 0,successors:0};return $h(e,n,!1)(i,r,Pg(n),void 0,!1,e=>{Fg(e)||i.successors++}),i.successors>0},Vg=(e,t,n,r)=>{let i=[];return zg(e,t,n,e=>(i.push(e),!1),r),i},Hg=/* @__PURE__ */ new Set([`SUBSET`,`UNION`,`DOMAIN`,`\\cup`,`\\cap`,`\\`]),Ug=/* @__PURE__ */ new Set([`SetEnumeration`,`SetFilter`,`SetMap`,`Tuple`,`FunctionSet`,`Record`,`RecordSet`,`Product`]),Wg=e=>Ug.has(e.kind)||e.kind===`Apply`&&Hg.has(e.operator),Gg=(e,t)=>{if(e.kind===`FunctionApplication`||e.kind===`Except`)return e.function;if(e.kind===`Apply`&&e.args.length===2){if([`\\subseteq`,`=`,`#`,`\\`].includes(e.operator))return e.args[0];if(e.operator===`\\cap`||e.operator===`\\cup`){let n=t.get(e.args[0]);return n!==void 0&&fn(n)?e.args[0]:e.args[1]}return e.operator===`\\in`||e.operator===`\\notin`?e.args[1]:void 0}},Kg=e=>`line ${e.location.line}, column ${e.location.column}`,U=e=>{let t=e.location.range;return t?g(t):Kg(e)},qg={Always:`[]A`,Eventually:`<>A`,WeakFairness:`WF`,StrongFairness:`SF`},Jg=(e,t)=>new w(`TLC encountered a temporal formula (${e}) when evaluating a predicate or action.\n${U(t)}`),Yg=e=>e.kind===`Number`?e.text??String(e.value):U(e),Xg=(e,t)=>new w(`A non-boolean expression (${Os(t)}) was used as the condition of an IF.\n${U(e)}`),Zg=(e,t,n)=>{let r=e.location.range;if(r?.start.line===e.location.line&&r.start.column===e.location.column||!r)return new w(`A non-boolean expression (${Os(n)}) was used as a formula in a ${e.kind===`And`?`conjunction`:`disjunction`}.\n${Yg(e.operands[t])}`);let i=e.prefixEnds?.[Math.max(t,1)-1]??r.end;return new w(`Attempted to evaluate an expression of form P ${e.kind===`And`?`/\\`:`\\/`} Q when ${t===0?`P`:`Q`} was\n${Os(n)}.\n${U({...e,location:{...e.location,range:{...r,end:i}}})}`)},Qg=e=>{let t=e.field,n=n=>`Attempted to select nonexistent field "${t}" from the record\n${N(L(n))}\n${U(e)}`,r=e=>`Attempted to apply function:\n${N(L(e))}\nto argument "${t}", which is not in the domain of the function.`;return i=>{if(!pn(i))throw new w(`Attempted to select field "${t}" from a non-record value ${N(L(i))}\n${U(e)}`);let a=lr(i);if(a===`tuple`)throw aa(t);return pa(i.kind===`LazyFunction`?I(i):i,t,a===`record`?n:r)}},$g=e=>e===`1.7.4`?(t,n)=>na(t,n,e):void 0,e_=e=>t=>{if(!pn(t))throw new w(`Attempted to apply the operator DOMAIN to a non-function\n(${Os(t)})\n${U(e)}`);return ha(t)},t_=(e,t)=>(n,r)=>{if(!dn(n)||Kn(n))throw new w(`Attempted to evaluate an expression of form S \\subseteq T, but S was not enumerable.\n${U(e)}`);return t(n,r)},n_=e=>x(new w(`TLC can't handle real numbers.\n${e.text}`),S.configParseError),r_=e=>x(new w(`TLC can't handle a number this big.\n${e.text??e.value}`),S.error),i_=(e,t)=>new ie(`In evaluation, the identifier ${e} is either undefined or not an operator.\n${U(t)}`,e),a_=(e,t)=>e instanceof ie&&t!==`1.7.4`?new w(`The action formula A appearing in a WF_v(A) or SF_v(A) operator does not specify the primed value of the variable ${e.variable} occurring in the state formula v.\n`):e,o_=(e,t)=>{for(let n=e;n;n=n.parent)if(n.name===t)return n.binding},s_=(e,t,n)=>({name:t,binding:{kind:`Value`,value:n},parent:e}),c_=(e,t,n)=>{if(t.kind===`Name`)return s_(e,t.name,n);let r=Ui(n);if(!r||r.length!==t.names.length){let e=t.ranges?.[0];throw new w(`Argument mismatch in operator application.${e?g(e):``}`)}return t.names.reduce((e,t,n)=>s_(e,t,r[n]),e)},l_=(e,t)=>{if(pn(e))return e;throw new w(`A non-function (${Os(e)}) was applied as a function.\n${U(t)}`)},u_=e=>e.isKeepLazy?e:{environment:e.environment,scope:e.scope,state:e.state,next:e.next,isKeepLazy:!0},d_=(e,t)=>({environment:e.environment,scope:t,state:e.state,next:e.next,isKeepLazy:e.isKeepLazy}),f_=(e,t)=>{if(typeof e!=`boolean`)throw new w(`Expected ${t} to be a boolean but found ${L(e)}`);return e},p_=(e,t,n)=>{if(typeof e!=`boolean`)throw new w(`Attempted to evaluate an expression of form P => Q when ${n} was\n${Os(e)}.\n${U(t)}`);return e},m_=(e,t)=>{if(typeof e!=`boolean`)throw new w(`Attempted to apply the operator ~ to a non-boolean\n(${Os(e)})\n${U(t)}`);return!e},h_=(e,t,n)=>{if(typeof e!=`boolean`||typeof t!=`boolean`)throw new w(`Attempted to evaluate an expression of form P <=> Q when P or Q was not a boolean.\n${U(n)}`);return e===t},g_=(e,t)=>{if(typeof e!=`boolean`)throw new w(`TLC expected a boolean value, but did not find one. ${Yg(t)}`);return e},__=(e,t)=>t.definitions.get(t.substitutions.get(e)??e),v_=(e,t)=>{let n=`universally (\\A) or existentially (\\E) quantify over ${t}, because this would require checking an\ninfinite number of cases.`;if(typeof e==`object`&&e.kind===`SequenceSet`)return`In TLA+, Seq(S) represents the set of all finite sequences whose elements come from the set S. Even when S\nis a finite set, the number of possible sequences in Seq(S) is unbounded because sequences can have any\nfinite length (e.g., length 0, 1, 2, and so on). As a result, TLC cannot evaluate expressions that\n${n} Note that for a finite set of sequences s, TLC handles s \\subseteq Seq(S).\nSee https://explain.tlapl.us/seq-unenumerable for additional details.`;if(typeof e==`object`&&e.kind===`InfiniteSet`&&e.name!==`STRING`&&e.name!==`Any`)return`The set ${e.name} contains infinitely many elements. As a result, TLC cannot evaluate expressions that\n${n} Note that TLC handles set membership like T \\subseteq ${e.name} for any finite set T.`},y_=(e,t,n)=>{if(!dn(e)||Kn(e)){let r=L(e),i=n===`1.7.4`?void 0:v_(e,r);throw new w(i===void 0?`TLC encountered a non-enumerable quantifier bound\n${r}.\n${Yg(t)}`:`TLC encountered the non-enumerable quantifier bound\n${r}\n${Yg(t)}\n${i}`)}},b_=(e,t,n)=>(y_(e,t,n),typeof e==`object`&&e.kind===`Interval`?ci(e):Si(e)??Oi(e)),x_=(e,t,n)=>n===`1.7.4`?(y_(e,t,n),Si(e)??Ai(e)):b_(e,t,n),S_=e=>{if(typeof e==`object`&&e.kind===`Interval`)return Ri(e),e},C_=(e,t,n)=>S_(e)??x_(e,t,n),w_=(e,t,n)=>S_(e)??b_(e,t,n),T_=(e,t)=>{if(Array.isArray(e))return e.some(t);for(let n=e.low;n<=e.high;n++)if(t(n))return!0;return!1},E_=(e,t)=>e.reduce((n,r,i)=>(n.push(i>0&&e[i-1].set===r.set?n[i-1]:t(r.set,i)),n),[]),D_=(e,t)=>E_(e,e=>C_(W(e,t),e,t.environment.runtime.version)),O_=(e,t,n,r)=>{let i=(n,a)=>n<0?r(a):T_(t[n],t=>i(n-1,c_(a,e[n].pattern,t)));return i(e.length-1,n)},k_=(e,t,n)=>O_(e,D_(e,t),t.scope,n),A_=(e,t)=>{let n=E_(e,e=>W(e,t));return n.length===1?n[0]:{kind:`ProductSet`,factors:n}},j_=(e,t,n)=>{if(e.length===1)return c_(t,e[0].pattern,n);let r=Ui(n)??[];return e.reduce((e,t,n)=>c_(e,t.pattern,r[n]),t)},M_=e=>typeof e==`object`&&e.kind===`LazyFunction`&&`lambda`in e,N_=e=>Object.assign(e.value,{lambda:e}),P_=e=>M_(e)?e.lambda:void 0,F_=(e,t,n)=>{let r=e.value,i=t.args.map(e=>W(e,n)),a=i.length===1?i[0]:fi(i),o=(e,n,i)=>`In applying the function\n${N(L(r))},\nthe ${e} is:\n${N(L(n))}${i}.\n${U(t.function)}`,s=e.bounds;if(s.length===1){if(!Ji(a,r.domain))throw new w(o(`first argument`,a,`which is not in its domain`));return j_(s,e.scope,a)}let c=Ui(a),l=typeof r.domain==`object`&&r.domain.kind===`ProductSet`?r.domain.factors:[];if(c===void 0)throw new w(`Attempted to apply a function to an argument not in its domain.\n${U(t.function)}`);let u=()=>new w(`In applying the function\n${N(L(r))},\nthe argument list is:\n${N(L(a))}\nwhich does not match its formal parameter.\n`);if(s.forEach((e,t)=>{if(t>=c.length)throw u();let n=c[t],r=`argument number ${t+1}`;if(!Ji(n,l[t]))throw new w(o(r,n,`${e.pattern.kind===`Name`?``:`
1783
+ `}which is not in its domain`));if(e.pattern.kind===`Tuple`&&Ui(n)?.length!==e.pattern.names.length)throw new w(o(r,n,`which does not match its formal parameter`))}),c.length>s.length)throw u();return j_(s,e.scope,a)},I_=(e,t)=>{if(t.location.range)return{parameters:e.flatMap((t,n)=>n>0&&e[n-1].set===t.set?[]:[{index:n,name:t.pattern.kind===`Name`?t.pattern.name:`<<${t.pattern.names.join(`, `)}>>`}]),body:Yg(t)}},L_=(e,t,n)=>{if(!e)return;let r=t.length>1&&typeof n==`object`&&n.kind===`ProductSet`?n.factors:[n];return{parameters:e.parameters.map(e=>({name:e.name,domain:r[e.index]})),body:e.body}},R_=(e,t,n,r)=>{let i={kind:`LazyFunction`,domain:e,source:n,boundTupleLengths:r,apply:e=>t(e,i)};return i},z_=e=>e.length===1?void 0:e.map(e=>e.pattern.kind===`Tuple`?e.pattern.names.length:void 0),B_=e=>({kind:`FunctionConstruction`,bounds:e.bounds,body:e.body,location:e.location}),V_=(e,t)=>{let n=A_(e.bounds,t),r=R_(n,(n,r)=>W(e.body,d_(t,j_(e.bounds,s_(void 0,e.name,r),n))),L_(I_(e.bounds,e.body),e.bounds,n),z_(e.bounds));N_({value:r,bounds:e.bounds,body:e.body,scope:s_(void 0,e.name,r)});let i=Object.assign(r,{rebind:n=>{let i=V_(e,{...t,environment:n});return i.enumerated=r.enumerated,i}});return e.bounds.length===1?ur(i):i},H_=(e,t)=>{if(typeof t!=`object`||lr(t)!==`lambda`||e.kind===`Operator`||e.isSelfReferential||t.kind!==`LazyFunction`||!fn(t.domain))return t;try{let e=I(t);return or(e.domain,e.range)}catch(e){if(e instanceof w)return t;throw e}},U_=(e,t)=>e.kind===`Operator`&&e.params.length>0?()=>{throw new w(`Operator ${e.name} requires ${e.params.length} arguments`)}:e.kind===`Function`?e.isSelfReferential?t=>V_(e,t):kv(B_(e),t):kv(e.body,t),W_=(e,t)=>{let n=t.definitionEvaluators.get(e);if(n)return n;let r=U_(e,t),i=t.facts.ids.get(e),a=t.startupValues,o=i===void 0?e=>r(d_(e,void 0)):e=>a[i]??r(d_(e,void 0));return t.definitionEvaluators.set(e,o),o},G_=(e,t)=>{let n=t.facts.ids.get(e);return n===void 0?void 0:t.startupValues[n]},K_=(e,t)=>e.forEach(e=>{if(e.kind===`Operator`&&e.params.length>0)return;let n=e.name;if(t.constants.has(n)||t.substitutions.has(n)||!uf(e,t))return;let r=t.facts.ids.get(e);if(r===void 0||t.startupValues[r]!==void 0)return;let i={environment:t,scope:void 0,state:void 0,next:void 0};try{let n=t.runtime.evaluateAtStartup(()=>H_(e,U_(e,t)(i)));Wr(n),t.startupValues[r]=n}catch(e){if(!(e instanceof w)&&!b(e))throw e}}),q_=(e,t)=>{if(t===void 0||e===t)return!0;try{return t.every((t,n)=>t===void 0||e?.[n]!==void 0&&_r(e[n],t))}catch(e){if(e instanceof w)return!1;throw e}},J_=(e,t)=>{let n=e.cache;if(n!==void 0&&q_(t.state,e.state)&&q_(t.next,e.next))return n;let r=t.environment.coverage,i=r?.current===-1?void 0:r?.values.get(e),a=r&&i!==void 0?qo(r,i,()=>W(e.expression,d_(t,e.scope))):W(e.expression,d_(t,e.scope));return(!e.isStreamed||Mi(a))&&(e.cache=a,e.state=t.state,e.next=t.next),e.cache!==void 0&&e.state===void 0&&e.next===void 0&&(e.scope=void 0,e.isReleased=!0),a},Y_=e=>({kind:`Closure`,name:e.name,params:e.params,body:e.body,scope:void 0}),X_=(e,t)=>{let n=t.substitutions.get(e);if(n!==void 0)return X_(n,t);let r=t.definitions.get(e);return r?.kind===`Operator`?Y_(r):t.builtins.get(e)},Z_=(e,t)=>M(e)?Q_(e.operator,t):X_(e.operator,t.environment)??Q_(e.operator,t),Q_=(e,t)=>{let n=o_(t.scope,e);if(n?.kind===`Operator`)return n.operator;if(!n)return X_(e,t.environment)},$_=e=>e.kind===`Closure`?e.params.length:e.arity,ev=(e,t)=>{if(e.kind===`Lambda`)return{kind:`Closure`,name:`LAMBDA`,params:e.params.map(e=>({name:e,arity:0})),body:e.body,scope:t.scope};let n=e.kind===`OperatorReference`?e.operator:e.kind===`Identifier`?e.name:void 0,r=n===void 0?void 0:Q_(n,t);if(!r)throw new w(`Expected an operator argument at ${Kg(e)}`);return r},tv=(e,t,n)=>{if(e.kind===`Builtin`&&e.isLazy)return e.evaluate(t.map(e=>({kind:`Operator`,name:`argument`,arity:0,call:()=>e})),n);if(e.kind===`Builtin`)return e.evaluate(t,n);if(e.kind===`Operator`)return e.call(t);let r=e.params.reduce((e,n,r)=>s_(e,n.name,t[r]),e.scope);return W(e.body,d_(n,r))},nv=(e,t)=>e.kind===`Operator`?e:{kind:`Operator`,name:e.name,arity:$_(e),call:n=>tv(e,n,t)},rv=(e,t)=>{if(e.kind===`Lambda`||e.kind===`OperatorReference`)return!0;if(e.kind!==`Identifier`)return!1;let n=Q_(e.name,t);return n!==void 0&&$_(n)>0},iv=(e,t)=>e.map(e=>rv(e,t)?nv(ev(e,t),t):W(e,t)),av=(e,t)=>new w(`Operator ${e.name} expects ${e.params.length} arguments but received ${t}`),ov=(e,t)=>({kind:`Thunk`,expression:e,scope:t.scope,state:t.state,next:t.next,cache:void 0,isStreamed:!1}),sv=(e,t)=>{let n=t.variableIndex.get(e);if(n!==void 0)return{kind:`Variable`,index:n};let r=t.constants.get(e);if(r!==void 0)return{kind:`Value`,value:r};let i=t.substitutions.get(e);if(i!==void 0)return sv(i,t);let a=t.definitions.get(e);if(a)return{kind:`Definition`,definition:a};let o=t.builtins.get(e);if(o&&o.arity===0&&!o.isStateLevel)return{kind:`Value`,value:o.evaluate([])}},cv=(e,t)=>{if(e.kind===`String`||e.kind===`Number`&&_n(e.value)){let t={kind:`Value`,value:e.value,argument:e};return()=>t}let n=t.coverage;if(n)return t=>{let r=ov(e,t);return n.current!==-1&&n.values.set(r,n.current),r};if(e.kind===`Identifier`){let n=M(e)?void 0:sv(e.name,t);if(n?.kind===`Value`){let e={kind:`Value`,value:n.value};return()=>e}if(n===void 0&&!t.callStack)return t=>{let n=o_(t.scope,e.name);return n?.kind===`Value`||n?.kind===`Thunk`?n:ov(e,t)}}return t=>ov(e,t)},lv=(e,t,n,r)=>{if(t.length!==e.params.length)throw av(e,t.length);let i=e.scope;for(let a=0;a<t.length;a++){let o=e.params[a],s=o.arity>0?{kind:`Operator`,operator:ev(t[a],n)}:(r?.[a]??cv(t[a],n.environment))(n);i={name:o.name,binding:s,parent:i}}return i},uv=(e,t,n,r)=>e.kind===`Closure`?W(e.body,d_(n,lv(e,t,n,r))):e.kind===`Operator`?e.call(t.map(e=>W(e,n))):e.isLazy?e.evaluate(Mv(t,n),n):e.evaluate(iv(t,n),n),dv=/* @__PURE__ */ new WeakMap,fv=e=>{let t=dv.get(e);if(t)return t;let n={kind:`FunctionConstruction`,bounds:e.bounds,body:e.body,location:e.location,isRecursive:!0};return dv.set(e,n),n},pv=(e,t,n)=>{let r=e.map(e=>({name:e.name,binding:{kind:`Value`,value:!1},parent:void 0})),i=r.reduce((e,t)=>(t.parent=e,t),t.scope);e.forEach((e,a)=>{r[a].binding=e.kind===`Function`?{kind:`Thunk`,expression:fv(e),scope:i,state:t.state,next:t.next,cache:void 0,isStreamed:!1}:e.params.length>0||n?.impure.has(e)?{kind:`Operator`,operator:{kind:`Closure`,name:e.name,params:e.params,body:e.body,scope:i}}:{kind:`Thunk`,expression:e.body,scope:i,state:t.state,next:t.next,cache:void 0,isStreamed:n?.streamed.has(e)??!1}});let a=t.environment.coverage;return a&&a.current!==-1&&r.forEach(e=>{e.binding.kind===`Thunk`&&a.values.set(e.binding,a.current)}),i},mv=(e,t,n)=>{let r=o_(n.scope,e);if(r?.kind===`Value`)return r.value;if(r?.kind===`Thunk`)return J_(r,n);if(r?.kind===`Operator`){if($_(r.operator)===0)return tv(r.operator,[],n);throw new w(`Operator ${e} is used without arguments`)}let i=sv(e,n.environment);if(i?.kind===`Variable`){let r=n.state?.[i.index];if(r===void 0)throw i_(e,t);return r}if(i?.kind===`Value`)return i.value;if(i?.kind===`Definition`)return W_(i.definition,n.environment)(n);let a=n.environment.builtins.get(e);if(a?.arity===0)return a.evaluate([],n);throw new w(`In evaluation, the identifier ${e} is either undefined or not an operator.\n${U(t)}`)},hv=(e,t)=>({impure:new Set(e.filter(e=>pf(e,t))),streamed:new Set(e.filter(e=>pf(e,t,`streamed`)))}),gv=e=>[...e.facts.ids.keys()].some(t=>pf(t,e)),_v=e=>[...e.facts.ids.keys()].some(t=>pf(t,e,`repeated`)),vv=e=>typeof e==`object`&&(e.kind===`FilteredSet`||e.kind===`LazyFunction`)&&`rebind`in e,yv=e=>({environment:e.environment,scope:e.scope,state:e.next,next:void 0,isKeepLazy:e.isKeepLazy}),bv=e=>t=>{let n=e(t);return _r(n,e(yv(t)))},xv=(e,t,n,r)=>i=>{r.expressions.push(e);let a=Gi.sets,o=Gi.callStack,s=a??[],c=s.length;Gi.sets=s,Gi.callStack=r;try{let a=t(i),o=vv(a)?a.rebind(n):a;return r.values.set(e,o),typeof o==`object`&&o.kind!==`FilteredSet`&&Wg(e)&&r.sources.set(o,e),o}catch(t){t instanceof u&&!r.isFrozen&&(r.expressions.length=0,r.isFrozen=!0);let n=t instanceof Error?r.failures.get(t):void 0;t instanceof Error&&r.failures.set(t,e);let i=Gg(e,r.values),a=i&&!mt(e).some(e=>e===n)?r.values.get(i):void 0,o=e.kind===`FunctionApplication`&&a!==void 0&&!pn(a)?void 0:a;throw Sv(r,[o,...s.slice(c).filter(e=>e!==o)],t),t}finally{r.isFrozen||r.expressions.pop(),s.length=c,Gi.sets=a,Gi.callStack=o}},Sv=(e,t,n)=>{let r=[...new Set(t)].flatMap(t=>{let n=typeof t==`object`?e.sources.get(t):void 0;return n?[n]:[]});if(r.length>0&&n instanceof w){e.isFrozen||e.expressions.push(...r);let t=e.fingerprint;e.fingerprint={sources:[...r,...t?.sources??[]],reason:t?.reason??n.message}}e.isFrozen=!0},Cv=(e,t,n)=>{if(!(n instanceof w))return;e.isFrozen||e.expressions.push(t),e.isFrozen=!0;let r=e.fingerprint;e.fingerprint={sources:[t,...r?.sources??[]],reason:r?.reason??n.message}},wv=e=>({...e,evaluators:/* @__PURE__ */ new WeakMap,entryEvaluators:/* @__PURE__ */ new WeakMap,definitionEvaluators:/* @__PURE__ */ new WeakMap,callStack:{expressions:[],isFrozen:!1,sources:/* @__PURE__ */ new WeakMap,values:/* @__PURE__ */ new WeakMap,failures:/* @__PURE__ */ new WeakMap}}),Tv=(e,t,n)=>{let r=e.location.range,i=e.prefixEnds;if(!n||e.isBulleted||!r||!i||t.length<3)return;let a=i.slice(0,t.length-2).map(t=>({...e,location:{...e.location,range:{...r,end:t}}})).reverse(),o=e.kind===`And`;return r=>{n.expressions.push(...a);for(let i=0;i<t.length;i++){i>=2&&!n.isFrozen&&n.expressions.pop();let s=t[i](r);if(typeof s!=`boolean`)throw Zg(e,i,s);if(s!==o)return n.isFrozen||(n.expressions.length-=a.length-Math.max(i-1,0)),s}return o}},Ev=(e,t,n,r)=>i=>{if(r.expressions.at(-1)===e)return n(i);r.expressions.push(...t);try{return n(i)}finally{r.isFrozen||(r.expressions.length-=t.length)}},Dv=(e,t,n)=>r=>{let i=n.current;if(i===-1||!n.covered.has(e))return t(r);let a=Go(n,i,e);Ko(n,a),n.current=a;try{let i=t(r);return typeof i==`object`&&e.kind===`SetEnumeration`&&n.values.set(i,a),i}finally{n.current=i}},Ov=(e,t)=>{let n=t.evaluators.get(e);if(n)return n;let r=iy(e,t),i=t.callStack,a=i&&au.get(e),o=i?xv(e,r,t,i):r,s=i&&a?Ev(e,a,o,i):o,c=t.coverage,l=c?Dv(e,s,c):s;return t.evaluators.set(e,l),l},kv=(e,t)=>{if(t.callStack||t.coverage)return Ov(e,t);let n=t.entryEvaluators.get(e);if(n)return n;let r=ic(e,t)??Ov(e,t);return t.entryEvaluators.set(e,r),r},W=(e,t)=>kv(e,t.environment)(t),Av=(e,t)=>{let n=e.name,r=M(e)?void 0:sv(n,t);if(r?.kind===`Variable`){let t=r.index;return r=>{let i=r.state?.[t];if(i===void 0)throw i_(n,e);return i}}if(r?.kind===`Value`){let e=r.value;return()=>e}if(r?.kind===`Definition`){let e=r.definition,n;return r=>(n??=W_(e,t))(r)}return t=>mv(n,e,t)},jv=(e,t)=>{if(e.kind===`Lambda`||e.kind===`OperatorReference`)return!1;if(e.kind!==`Identifier`||M(e))return!0;let n=X_(e.name,t);return n===void 0||$_(n)===0},Mv=(e,t)=>e.map(e=>({kind:`Operator`,name:`argument`,arity:0,call:()=>W(e,t),expression:e})),Nv=(e,t,n)=>{if(e.isLazy)return n=>e.evaluate(Mv(t,n),n);let r=e.evaluateUnary;if(r&&t.length===1&&jv(t[0],n)){let e=Ov(t[0],n);return t=>r(e(t))}let i=e.evaluateBinary,a=t.length===2&&jv(t[0],n)&&jv(t[1],n);if(i&&a){let e=Ov(t[0],n),r=Ov(t[1],n);return t=>i(e(t),r(t))}return n=>e.evaluate(iv(t,n),n)},Pv=(e,t,n)=>{if(t.length!==e.params.length)return()=>{throw av(e,t.length)};let r=e.params,i=t.map((e,t)=>r[t].arity>0?void 0:cv(e,n));return n=>{let a=e.scope;for(let e=0;e<t.length;e++){let o=i[e],s=o?o(n):{kind:`Operator`,operator:ev(t[e],n)};a={name:r[e].name,binding:s,parent:a}}return a}},Fv=(e,t,n)=>{let r=Pv(e,t,n),i;return t=>(i??=kv(e.body,n),i({environment:n,scope:r(t),state:t.state,next:t.next,isKeepLazy:t.isKeepLazy}))},Iv=(e,t)=>{let n=e.args;if(e.operator===`=>`){let r=Ov(n[0],t),i=Ov(n[1],t);return t=>!p_(r(t),e,`P`)||p_(i(t),e,`Q`)}if(e.operator===`~`&&n.length===1){let r=Ov(n[0],t);return t=>m_(r(t),e)}if(e.operator===`<=>`){let r=Ov(n[0],t),i=Ov(n[1],t);return t=>h_(r(t),i(t),e)}if(e.operator===`~>`||e.operator===`-+->`)return()=>{throw Jg(e.operator===`~>`?`a ~> b`:`a -+-> formula`,e)};let r=M(e)?void 0:X_(e.operator,t);if(r?.kind===`Closure`)return Fv(r,n,t);if(r?.kind===`Builtin`&&r.name===`DOMAIN`){let r=Ov(n[0],t),i=e_(e);return e=>i(r(e))}if(r?.kind===`Builtin`&&r.name===`TLCEval`&&n.length===1){let i=!iu.has(e)&&!_f(n[0],t),a=t.tlcEvalValues;return t=>{if(!i||t.scope!==void 0)return r.evaluate(Mv(n,t),t);let o=a.get(e);if(o!==void 0)return o;let s=r.evaluate(Mv(n,t),void 0);return a.set(e,s),s}}if(r?.kind===`Builtin`&&r.name===`\\subseteq`&&r.evaluateBinary&&n.length===2){let i=Ov(n[0],t),a=Ov(n[1],t),o=t_(e,r.evaluateBinary);return e=>o(i(e),a(e))}if(r?.kind===`Builtin`)return Nv(r,n,t);if(e.operator===`\\cdot`&&n.length===2)return()=>{throw new w(t.runtime.version===`1.7.4`?`The current version of TLC does not support action composition.`:`The current version of TLC does not support action composition. An incomplete implementation can be enabled via the tlc2.tool.impl.Tool.cdot=true java property.`)};let i=n.map(e=>cv(e,t));return r=>{let a=Q_(e.operator,r);if(a)return uv(a,n,r,i);throw t.definitions.get(e.operator)?.kind===`Function`?new w(`${e.operator} is a function; apply it with brackets`):new w(`Unknown operator ${e.operator} at ${Kg(e)}`)}},Lv=(e,t)=>{let n=e.kind===`Forall`,r=Ov(e.body,t),i=e.bounds[0];if(e.bounds.length===1&&i.pattern.kind===`Name`){let a=i.pattern.name,o=Ov(i.set,t);return s=>T_(C_(o(s),i.set,t.runtime.version),t=>g_(r(d_(s,s_(s.scope,a,t))),e)!==n)?!n:n}let a=e.bounds;if(a.every(e=>e.pattern.kind===`Name`)){let i=a.map(e=>e.pattern.kind===`Name`?e.pattern.name:``);return o=>{let s=E_(a,e=>C_(Ov(e,t)(o),e,t.runtime.version)),c=(t,a)=>t<0?g_(r(d_(o,a)),e)!==n:T_(s[t],e=>c(t-1,s_(a,i[t],e)));return c(a.length-1,o.scope)?!n:n}}return t=>k_(a,t,i=>g_(r(d_(t,i)),e)!==n)?!n:n},Rv=(e,t)=>{if(e.kind===`Tuple`)return fi(e.names.map(e=>{let n=o_(t,e);return n?.kind===`Value`&&n.value}));let n=o_(t,e.name);return n?.kind===`Value`?n.value:void 0},zv=/* @__PURE__ */ new WeakSet,Bv=e=>{(e.kind===`FunctionConstruction`||e.kind===`Except`)&&zv.add(e)},Vv=/* @__PURE__ */ new WeakMap,Hv=e=>{if(Vv.has(e))return Vv.get(e);let t=/* @__PURE__ */ new Set,n=e=>{if(e.kind===`Subexpression`)return!1;let r=ht(e);return r!==void 0&&t.add(r),e.kind===`ExceptAt`&&t.add(`@`),mt(e).every(n)},r=n(e)?[...t]:void 0;return Vv.set(e,r),r},Uv=(e,t)=>t===void 0||e===void 0?e:t.reduce((t,n)=>{let r=o_(e,n);return r?{name:n,binding:r,parent:t}:t},{name:``,binding:{kind:`Value`,value:!1},parent:void 0}),Wv=e=>zv.has(e),Gv=(e,t)=>{let n=Wv(e),r=Ov(e.body,t),i=e.bounds,a=i[0],o=i.length===1&&a.pattern.kind===`Name`,s=(e,t)=>{if(o&&a.pattern.kind===`Name`){let n=a.pattern.name,i=e=>r(d_(t,s_(t.scope,n,e)));if(ln(e))return Ri(e),un(e,i),d(e,t);let o=ui(e),s=or(o,o.map(i));return fn(e)?s:(s.lambdaDomain=e,ur(s))}let n=[],s=E_(i,(n,r)=>w_(i.length>1&&typeof e==`object`&&e.kind===`ProductSet`?e.factors[r]:e,n,t.environment.runtime.version));return O_(i,s,t.scope,e=>{let o=i.length===1?Rv(a.pattern,e)??!1:fi(i.map(t=>Rv(t.pattern,e)??!1));return n.push([o,r(d_(t,e))]),!1}),ti(n)},c=I_(i,e.body),l=z_(i),u=Hv(e.body),d=(t,n)=>{let a=Uv(n.scope,u),o=d_(n,a),s=N_({value:R_(t,e=>r(d_(o,j_(i,a,e))),L_(c,i,t),l),bounds:i,body:e.body,scope:a});return i.length===1?ur(s):s},f=t.callStack;return{build:(t,r)=>{if(e.isRecursive||n||r.isKeepLazy||!P(t))return d(t,r);if(!(i.length===1?fn(t):typeof t==`object`&&t.kind===`ProductSet`&&t.factors.every(fn))){if(f)return d(t,r);try{return s(t,r)}catch(e){if(!(e instanceof w))throw e;return d(t,r)}}if(!f)return s(t,r);try{return s(t,r)}catch(t){throw Cv(f,e,t),t}},createLazy:d}},Kv=(e,t)=>{let n=Gv(e,t).build,r=e.bounds;if(r.length===1&&r[0].pattern.kind===`Name`){let e=Ov(r[0].set,t);return t=>n(e(t),t)}return e=>n(A_(r,e),e)},qv=(e,t)=>{let n=zv.has(e);n&&Bv(e.function);let r=Ov(e.function,t),i=e.updates.map(e=>({path:e.path.map(e=>e.kind===`Field`?{kind:`Field`,name:e.name,args:[]}:{kind:`Index`,name:``,args:e.args.map(e=>Ov(e,t))}),value:Ov(e.value,t)})),a=(e,t)=>e.kind===`Field`?e.name:e.args.length===1?e.args[0](t):fi(e.args.map(e=>e(t))),o=(e,t,r,i,s)=>r===t.length?s(d_(i,s_(i.scope,`@`,e))):ga(e,a(t[r],i),e=>o(e,t,r+1,i,s),n&&r===0);return t=>{let n=r(t);for(let r of i){let i=!1;n=o(n,r.path,0,t,e=>(i=!0,r.value(e))),i||t.environment.runtime.warn(wt.exceptAppliedToUnknownField,`The EXCEPT was applied to non-existing fields of the value at\n${U(e.function)}`)}return n}},Jv=(e,t)=>{let n=Ov(e.predicate,t),r=e.bound.pattern,i=Yg(e.predicate),a=e.predicate.location.range&&{names:r.kind===`Name`?r.name:r.names.join(`, `),predicate:i},o=t.coverage,s=(e,t,n)=>{if(!o||e===-1)return n();t||o.secondary[e]++;let r=qo(o,t?-1:e,n);return!t&&r===!0&&o.secondary[e]++,r},c=(t,n,o,l)=>({kind:`FilteredSet`,base:t,test:(e,t)=>{if(r.kind===`Tuple`&&Ui(e)?.length!==r.names.length)throw new w(`Attempted to check if the value:\n${N(L(e))}\nis an element of a set of ${r.names.length}-tuples.`);let a=s(l,t,()=>o(d_(n,c_(n.scope,r,e))));if(typeof a!=`boolean`)throw new w(`${t?`The evaluation of predicate`:`Evaluating predicate`} ${i} yielded non-Boolean value.`);return a},source:a,rebind:r=>c(t,{...n,environment:r},Ov(e.predicate,r),-1)});return(e,t,r=-1)=>c(e,t,n,r)},Yv=e=>M(e)||e.kind===`OperatorReference`||mt(e).some(Yv),Xv=(e,t)=>e.bound.pattern.kind===`Name`&&!t.coverage&&!Yv(e.predicate)&&!ff([e.predicate],t,`varying`),Zv=(e,t)=>{if(typeof e!=`boolean`)throw new w(`Attempted to evaluate an expression of form {x \\in S : P(x)} when P was ${Os(e)}.\n${Yg(t.predicate)}`);return e},Qv=(e,t,n,r)=>{if(!dn(e)||Kn(e))throw new w(`Attempted to compute the value of an expression of\nform CHOOSE x \\in S: P, but S was not enumerable.\n${U(t)}`);return Gr(e),w_(e,n,r)},$v=e=>new w(`Attempted to compute the value of an expression of form\nCHOOSE x \\in S: P, but no element of S satisfied P.\n${U(e)}`),ey=(e,t)=>{if(e.kind===`SetFilter`){let n=Ov(e.predicate,t),r=Ov(e.bound.set,t),i=Jv(e,t),a=e.bound.pattern,o=t.coverage,s=Xv(e,t);return t=>{let c=r(t);if(!fn(c))return i(c,t,o?.current);let l=[],u=c.kind===`Interval`?c:F(c).elements,d=Array.isArray(u)?u.length:u.high-u.low+1;for(let r=0;r<d;r++){let i=Array.isArray(u)?u[r]:u.low+r,o=n(d_(t,c_(t.scope,a,i)));if(Zv(o,e))cn(l,i);else if(s)break}return o&&o.current!==-1&&(o.secondary[o.current]+=d+l.length),ar(l)}}if(e.kind===`SetMap`){let n=Ov(e.expression,t);return t=>{let r=[];return k_(e.bounds,t,e=>(cn(r,n(d_(t,e))),!1)),Xr(r)}}let n=e.set;if(!n)return()=>{throw new w(`TLC attempted to evaluate an unbounded CHOOSE.\nMake sure that the expression is of form CHOOSE x \\in S: P(x).\n${U(e)}`)};let r=Ov(e.body,t),i=Ov(n,t);return t=>{let a=Qv(i(t),e,n,t.environment.runtime.version),o,s=e.pattern;if(T_(a,n=>{if(s.kind===`Tuple`&&Ui(n)?.length!==s.names.length)throw new w(`Attempted to compute the value of an expression of form\nCHOOSE <<x1, ... , xN>> \\in S: P, but S was not a set\nof N-tuples.\n${U(e)}`);let i=c_(t.scope,s,n);return g_(r(d_(t,i)),e)?(o=Rv(s,i),!0):!1}),o===void 0)throw $v(e);return o}},ty=e=>[...e].sort((e,t)=>$n(e.name,t.name)),ny=e=>e.some((t,n)=>n>0&&e[n-1].name===t.name),ry=(e,t)=>{let n=ty(e),r=e.map(e=>Ov(e.value,t));if(ny(n))return t=>pi(e.map((e,n)=>[e.name,r[n](t)]));let i=n.map(e=>e.name),a=e.map(e=>e.name);if(a.some((e,t)=>e!==i[t])){let t=n.map(t=>e.indexOf(t));return e=>Cn(i,t,r.map(t=>t(e)),a)}return e=>mi(i,r.map(t=>t(e)))},iy=(e,t)=>{let n=e=>Ov(e,t);switch(e.kind){case`Number`:{let t=e.value;return _n(t)?()=>t:()=>{throw r_(e)}}case`Decimal`:return()=>{throw n_(e)};case`String`:{let t=e.value;return()=>t}case`Identifier`:return Av(e,t);case`Apply`:return Iv(e,t);case`Bracket`:return()=>{throw new w(`A bracket without a function or subscript is not an expression at ${Kg(e)}`)};case`OperatorReference`:case`Lambda`:return()=>{throw new w(`An operator cannot be used as a value at ${Kg(e)}`)};case`And`:{let r=e.operands.map(n);return Tv(e,r,t.callStack)??(t=>{for(let n=0;n<r.length;n++){let i=r[n](t);if(typeof i!=`boolean`)throw Zg(e,n,i);if(!i)return!1}return!0})}case`Or`:{let r=e.operands.map(n);return Tv(e,r,t.callStack)??(t=>{for(let n=0;n<r.length;n++){let i=r[n](t);if(typeof i!=`boolean`)throw Zg(e,n,i);if(i)return!0}return!1})}case`Prime`:{let t=n(e.expression);return e=>t(yv(e))}case`Unchanged`:return bv(n(e.expression));case`If`:{let t=n(e.condition),r=n(e.consequent),i=n(e.alternative);return n=>{let a=t(n);if(typeof a!=`boolean`)throw Xg(e,a);return a?r(n):i(n)}}case`Case`:{let t=e.arms.map(e=>({source:e.condition,condition:n(e.condition),body:n(e.body)})),r=e.other?n(e.other):void 0;return n=>{for(let e of t){let t=e.condition(n);if(typeof t!=`boolean`)throw new w(`A non-boolean expression (${Os(t)}) was used as a condition of a CASE. ${Yg(e.source)}`);if(t)return e.body(n)}if(r)return r(n);throw new w(`Attempted to evaluate a CASE with no conditions true.\n${U(e)}`)}}case`Let`:{let t=n(e.body);return n=>t(d_(n,pv(e.definitions,n)))}case`Forall`:case`Exists`:return Lv(e,t);case`UnboundedQuantifier`:return()=>{let t=e.quantifier===`Forall`?`\\A`:`\\E`;throw e.isTemporal?Jg(e.quantifier===`Forall`?`\\AA`:`\\EE`,e):new w(`TLC attempted to evaluate an unbounded ${t}.\nMake sure that the expression is of form ${t} x \\in S: P(x).\n${U(e)}`)};case`Choose`:case`SetFilter`:case`SetMap`:return ey(e,t);case`SetEnumeration`:{let t=e.elements.map(n);return e=>Xr(t.map(t=>t(e)))}case`Tuple`:{let t=e.elements.map(n);return e=>fi(t.map(t=>t(e)))}case`FunctionConstruction`:return Kv(e,t);case`FunctionSet`:{let t=n(e.domain),r=n(e.range);return e=>({kind:`FunctionSet`,domain:t(e),range:r(e)})}case`Record`:return ry(e.fields,t);case`RecordSet`:{let t=ty(e.fields),r=t.map(e=>e.name),i=t.map(t=>e.fields.indexOf(t)),a=e.fields.map(e=>n(e.value));return i.every((e,t)=>e===t)?e=>({kind:`RecordSet`,names:r,sets:a.map(t=>t(e))}):e=>{let t=a.map(t=>t(e));return{kind:`RecordSet`,names:r,sets:i.map(e=>t[e])}}}case`Except`:return qv(e,t);case`ExceptAt`:return t=>{let n=o_(t.scope,`@`);if(n?.kind!==`Value`)throw new w(`@ appears outside an EXCEPT at ${Kg(e)}`);return n.value};case`FunctionApplication`:{Bv(e.function);let r=n(e.function),i=t=>l_(r(u_(t)),e),a=e.args.map(n),o=$g(t.runtime.version);if(a.length===1){let e=a[0];return t=>pa(i(t),e(t),o)}return e=>pa(i(e),fi(a.map(t=>t(e))),o)}case`FieldAccess`:{let t=n(e.record),r=Qg(e);return e=>r(t(e))}case`Product`:{let t=e.factors.map(n);return e=>({kind:`ProductSet`,factors:t.map(t=>t(e))})}case`BoxAction`:case`AngleAction`:{let t=n(e.action),r=bv(n(e.subscript)),i=e.kind===`BoxAction`,a=i?`[A]_e`:`<A>_e`;return n=>{let o=t(n);if(typeof o!=`boolean`)throw new w(`Attempted to evaluate an expression of form ${a}, but A was not a boolean.\n${U(e)}`);return i?o||r(n):o&&!r(n)}}case`Enabled`:{let t=e.expression;return e=>Ig(t,e)}case`Label`:return n(e.body);case`Subexpression`:return()=>{throw new w(`The subexpression reference at ${Kg(e)} does not name a subexpression`)};case`Always`:case`Eventually`:case`WeakFairness`:case`StrongFairness`:return()=>{throw Jg(qg[e.kind],e)}}},ay=e=>{let t=Math.imul(e^e>>>16,2146121005),n=Math.imul(t^t>>>15,2221713035);return n^n>>>16},oy=(e,t)=>{let n=2166136261,r=1779033703;for(let t=0;t<e.length;t++)n=Math.imul(n^Da(e[t]),16777619),r=Math.imul(r^Na(e[t]),1540483477);t[0]=ay(n)||1,t[1]=ay(r)},sy=()=>{let e=/* @__PURE__ */ new Int32Array(8192),t=0,n=(e,t,n)=>{let r=e.length/2-1;for(let i=t&r;;i=i+1&r){let r=e[i*2];if(r===0||r===t&&e[i*2+1]===n)return i}},r=()=>{let t=e,r=new Int32Array(t.length*2);for(let e=0;e<t.length;e+=2){if(t[e]===0)continue;let i=n(r,t[e],t[e+1]);r[i*2]=t[e],r[i*2+1]=t[e+1]}e=r};return{insert:(i,a)=>{t*4>=e.length&&r();let o=n(e,i,a);return e[o*2]!==i&&(e[o*2]=i,e[o*2+1]=a,t++,!0)}}},cy=e=>({slots:new Int32Array(1<<17),size:0,shift:16,states:e}),ly=e=>{let t=2166136261;for(let n=0;n<e.length;n++)t=va(t,Da(e[n]));return t&1073741823},uy=(e,t)=>{for(let n=0;n<t.length;n++)if(!yr(e[n],t[n]))return!1;return!0},dy=(e,t)=>Math.imul(t,2654435761)>>>e.shift<<1,fy=(e,t,n)=>{let r=e.slots.length-1;for(let i=dy(e,t);;i=i+2&r){let r=e.slots[i+1];if(r===0)return-1;if(e.slots[i]===t&&uy(e.states[r-1],n))return r-1}},py=(e,t,n)=>{let r=e.slots.length-1,i=dy(e,t);for(;e.slots[i+1]!==0;)i=i+2&r;e.slots[i]=t,e.slots[i+1]=n},my=(e,t,n)=>{if(e.size++,e.size*4>e.slots.length){let t=e.slots;e.slots=new Int32Array(t.length*2),e.shift--;for(let n=0;n<t.length;n+=2)t[n+1]!==0&&py(e,t[n],t[n+1])}py(e,t,n+1)},hy=(e,t)=>{let n=e.length-1;for(let r=Number(t>>32n)&n;;r=r+1&n){let n=Atomics.load(e,r);if(n===t)return!1;if(n!==0n)continue;let i=Atomics.compareExchange(e,r,0n,t);if(i===0n)return!0;if(i===t)return!1}},gy=()=>({slots:new BigInt64Array(new SharedArrayBuffer(8192)),used:new Int32Array(new SharedArrayBuffer(4))}),_y=(e,t,n)=>{let r=BigInt.asIntN(64,BigInt(t)<<32n|BigInt(n>>>0));return hy(e.slots,r)?(Atomics.add(e.used,0,1),!0):!1},vy=e=>Atomics.load(e.used,0)*2>=e.slots.length,yy=e=>{let t=new BigInt64Array(new SharedArrayBuffer(e.slots.byteLength*2));for(let n of e.slots)n!==0n&&hy(t,n);return{slots:t,used:e.used}},by={kind:`Boolean`,value:!0},xy={kind:`Boolean`,value:!1},Sy=e=>e?by:xy,Cy=e=>e.kind===`State`||e.kind===`Enabled`||e.kind===`Action`,wy=e=>e.kind===`State`||e.kind===`Enabled`||e.kind===`Boolean`,Ty=(e,t)=>({kind:e,body:t}),Ey=(e,t,n)=>({kind:e,operands:[t,n]}),Dy=(e,t)=>({kind:e,operands:t.flatMap(t=>t.kind===e?Dy(e,t.operands).operands:[t])}),Oy=e=>{switch(e.kind){case`Boolean`:return 0;case`State`:case`Enabled`:return 1;case`Action`:case`Next`:return 2;case`Not`:return Oy(e.body);case`Always`:case`Eventually`:return 3;case`And`:case`Or`:return e.operands.reduce((e,t)=>Math.max(e,Oy(t)),0)}},ky=e=>{switch(e.kind){case`Action`:return!0;case`Boolean`:case`State`:case`Enabled`:return!1;case`Not`:case`Always`:case`Eventually`:case`Next`:return ky(e.body);case`And`:case`Or`:return e.operands.some(ky)}},Ay=/* @__PURE__ */ new WeakMap;let jy=0;const My=e=>{let t=Ay.get(e);if(t!==void 0)return t;let n=(()=>{switch(e.kind){case`Boolean`:return String(e.value);case`State`:case`Enabled`:case`Action`:return`#${jy++}`;case`And`:case`Or`:return`${e.kind}(${e.operands.map(My).join(`,`)})`;default:return`${e.kind}(${My(e.body)})`}})();return Ay.set(e,n),n},Ny=(e,t)=>e===t||My(e)===My(t),Py=(e,t)=>{let n=My(t);return e.some(e=>e===t||My(e)===n)},Fy=e=>e===`And`?`Or`:`And`,Iy=(e,t)=>{switch(e.kind){case`Boolean`:return t?Sy(!e.value):e;case`State`:case`Enabled`:case`Action`:case`Next`:return t?Ty(`Not`,e):e;case`Not`:return Iy(e.body,!t);case`And`:case`Or`:return Dy(t?Fy(e.kind):e.kind,e.operands.map(e=>Iy(e,t)));case`Always`:case`Eventually`:{let n=t===(e.kind===`Always`)?`Eventually`:`Always`;return Ty(n,Iy(e.body,t))}}},Ly=e=>{switch(e.kind){case`Boolean`:return Sy(!e.value);case`Not`:return e.body;case`And`:case`Or`:return Dy(Fy(e.kind),e.operands.map(Ly));case`Always`:return Ty(`Eventually`,Ly(e.body));case`Eventually`:return Ty(`Always`,Ly(e.body));default:return Ty(`Not`,e)}},Ry=e=>{switch(e.kind){case`And`:case`Or`:{let t=e.kind===`Or`,n=[];for(let r of e.operands){let e=Ry(r);if(e.kind!==`Boolean`)n.push(e);else if(e.value===t)return Sy(t)}return n.length===0?Sy(!t):n.length===1?n[0]:Dy(e.kind,n)}case`Not`:{let t=Ry(e.body);return t.kind===`Boolean`?Sy(!t.value):Ty(`Not`,t)}case`Always`:case`Eventually`:{let t=Ry(e.body);return Ty(e.kind,t.kind===e.kind?t.body:t)}default:return e}},zy=e=>e.kind===`Always`&&e.body.kind===`Eventually`?e.body.body:void 0,By=e=>{switch(e.kind){case`And`:{let t=[],n=1;for(let r of e.operands){let e=By(r);if(e.kind===`And`)t.push(...e.operands);else{if(e.kind===`Or`&&(n*=e.operands.length,n>2147483647))throw new w(`TLC cannot handle the temporal formula because it exceeds the maximum supported size in disjunctive normal form.`);t.push(e)}}if(n===1)return{kind:`And`,operands:t};let r=Array.from({length:n},()=>[]),i=1,a=n;for(let e of t){if(e.kind!==`Or`){r.forEach(t=>t.push(e));continue}a/=e.operands.length;let t=0;for(let n=0;n<i;n++)for(let n of e.operands)for(let e=0;e<a;e++)r[t++].push(n);i*=e.operands.length}return{kind:`Or`,operands:r.map(e=>Dy(`And`,e))}}case`Or`:{let t=[],n=[];for(let r of e.operands){let e=By(r);for(let r of e.kind===`Or`?e.operands:[e]){let e=zy(r);e?t.push(e):n.push(r)}}if(t.length>0){let e=t.length===1?t[0]:Dy(`Or`,t);n.push(Ty(`Always`,Ty(`Eventually`,e)))}return Dy(`Or`,n)}case`Not`:return Cy(e.body)?e:By(Ly(e.body));default:return e}},Vy=e=>{switch(e.kind){case`And`:case`Or`:return e.operands.length===1?Vy(e.operands[0]):Dy(e.kind,e.operands.map(Vy));case`Not`:return e.body.kind===`Not`?Vy(e.body.body):Ty(`Not`,Vy(e.body));case`Always`:case`Eventually`:case`Next`:return Ty(e.kind,Vy(e.body));default:return e}},Hy=e=>{switch(e.kind){case`And`:case`Or`:{if(e.operands.length===1)return Hy(e.operands[0]);let t=Math.floor(e.operands.length/2);return Ey(e.kind,Hy(Dy(e.kind,e.operands.slice(0,t))),Hy(Dy(e.kind,e.operands.slice(t))))}case`Not`:case`Always`:case`Eventually`:case`Next`:return Ty(e.kind,Hy(e.body));default:return e}},Uy=(e,t)=>{e.kind===`Eventually`&&!Py(t,e)&&t.push(e),`body`in e&&Uy(e.body,t),`operands`in e&&e.operands.forEach(e=>Uy(e,t))},Wy=e=>{let t=e.filter(wy),n=e.flatMap(e=>e.kind===`Not`&&wy(e.body)?[e.body]:[]);return!t.some(e=>Py(n,e))},Gy=e=>{let t=[...e],n=[];for(;t.length>0;){let e=t.pop();if(!e)break;switch(e.kind){case`Not`:t.push(e.body);break;case`Next`:n.push(e),t.push(e.body);break;case`Always`:case`Eventually`:n.push(e,Ty(`Next`,e)),t.push(e.body);break;case`And`:case`Or`:t.push(...e.operands),n.push(e);break;case`Action`:throw new w(`TLC encountered actions while constructing the tableau`);default:n.push(e)}}return n},Ky=(e,t,n)=>{if(e.kind===t&&`body`in e)return{first:e.body,second:Ty(`Next`,e)};if(e.kind===n&&`operands`in e)return{first:e.operands[0],second:e.operands[1]}},qy=(e,t,n)=>e.flatMap(e=>{let r=Ky(e,t,n);return r?[{whole:e,first:r.first,second:r.second}]:[]}),Jy=e=>[...new Set(e.map(My))].sort().join(`|`),Yy=(e,t)=>{let n=new Set(t.map(Jy));return[...e.filter(e=>!n.has(Jy(e))),...t]},Xy=e=>{let t=Gy(e),n=qy(t,`Always`,`And`),r=qy(t,`Eventually`,`Or`),i=e=>{for(let t of e){let n=Ky(t,`Eventually`,`Or`);if(n&&!(Py(e,n.first)||Py(e,n.second)))return Yy(a([...e,n.first]),a([...e,n.second]))}let t=r.find(t=>(Py(e,t.first)||Py(e,t.second))&&!Py(e,t.whole));return t?a([...e,t.whole]):[e]},a=e=>{if(!Wy(e))return[];let t=[...e];for(let e=0;e<t.length;e++){let n=Ky(t[e],`Always`,`And`);n&&(Py(t,n.first)||t.push(n.first),Py(t,n.second)||t.push(n.second))}let r=!0;for(;r;){r=!1;for(let e of n)Py(t,e.first)&&Py(t,e.second)&&!Py(t,e.whole)&&(t.push(e.whole),r=!0)}return t.length>e.length&&!Wy(t)?[]:i(t)};return a(e)},Zy=e=>({particle:e,successors:[],statePredicates:e.filter(e=>Oy(e)<=1)}),Qy=e=>{let t=Xy([e]).map(Zy),n=t.length,r=/* @__PURE__ */ new Map;t.forEach((e,t)=>{let n=Jy(e.particle);r.has(n)||r.set(n,t)});for(let e=0;e<t.length;e++){let n=t[e].particle.flatMap(e=>e.kind===`Next`?[e.body]:[]);for(let i of Xy(n)){let n=Jy(i),a=r.get(n);a===void 0&&(r.set(n,t.length),t.push(Zy(i))),t[e].successors.push(a??t.length-1)}}return{nodes:t,initialCount:n}},$y=(e,t)=>!Py(e,t)||Py(e,t.body),eb=(e,t)=>{if(e.kind===`Eventually`&&e.body.kind===`Always`&&Oy(e.body.body)<3){t.eventuallyAlways.push(e.body.body);return}let n=zy(e);if(n){let e=Oy(n);if(e<=1){t.infinitelyOftenStates.push(n);return}if(e===2){t.infinitelyOftenActions.push(n);return}}if(ky(e))throw new w(`Temporal formulas containing actions must be of forms <>[]A or []<>A.`);t.formulas.push(e)},tb=(e,t)=>{let n=e.findIndex(e=>Ny(e,t));return n===-1?(e.push(t),e.length-1):n},nb=e=>{let t=By(Ry(Iy(e,!1)));if(t.kind===`Boolean`&&!t.value)return[];let n=[];for(let e of t.kind===`Or`?t.operands:[t]){let t=Vy(e),r={eventuallyAlways:[],infinitelyOftenStates:[],infinitelyOftenActions:[],formulas:[]};for(let e of t.kind===`And`?t.operands:[t])eb(e,r);let i=r.formulas,a=i.length===0?void 0:i.length===1?i[0]:Dy(`And`,i),o=n.find(e=>e.formula===void 0||a===void 0?e.formula===a:Ny(e.formula,a));o?o.classifications.push(r):n.push({formula:a,classifications:[r]})}return n.map(e=>{let t=e.formula&&Hy(e.formula),n=[];t&&Uy(t,n);let r=[],i=[],a=e.classifications.map(e=>({infinitelyOftenActions:e.infinitelyOftenActions.map(e=>tb(i,e)),infinitelyOftenStates:e.infinitelyOftenStates.map(e=>tb(r,e)),eventuallyAlways:e.eventuallyAlways.map(e=>tb(i,e))}));return{tableau:t&&Qy(t),promises:n,stateChecks:r,actionChecks:i,models:a}})},rb=()=>x(new w(`Temporal formula is a tautology (its negation is unsatisfiable).`),S.livenessEvaluationFailure),ib=/* @__PURE__ */ new Set([`~>`,`-+->`]),ab=/* @__PURE__ */ new WeakSet,ob=/* @__PURE__ */ new Map([[`/\\`,`And`],[`\\/`,`Or`]]),sb=(e,t)=>({environment:e,scope:t,state:void 0,next:void 0}),cb=(e,t)=>new w(`TLC cannot handle the temporal formula ${U(e)}${t===void 0?``:`:\n${t}`}`),lb=(e,t,n,r=/* @__PURE__ */ new Set,i=/* @__PURE__ */ new Set)=>{let a=(e,t,r)=>{if(i.has(e))return 0;i.add(e);let a=lb(t,r,n,/* @__PURE__ */ new Set,i);return i.delete(e),a},o=e=>{let n=o_(t,e);if(!n)return;if(n.kind===`Value`)return 0;if(n.kind===`Thunk`)return n.isReleased?0:a(n,n.expression,n.scope);let r=n.operator;return r.kind===`Closure`?a(r,r.body,r.scope):0},s=e=>{if(n.variableIndex.has(e))return 1;if(n.constants.has(e))return 0;let t=__(e,n);if(t)return mf(t,n);let r=n.builtins.get(n.substitutions.get(e)??e);if(r)return r.isActionLevel?2:r.isStateLevel&&!r.isLevelConstant?1:0},c=(e,t)=>r.has(e)?0:M(t)?o(e)??s(e)??0:s(e)??o(e)??0,l=e=>{let a=0;return pu(e,(e,o)=>(a=Math.max(a,lb(e,t,n,o.length===0?r:/* @__PURE__ */ new Set([...r,...o]),i)),e)),a};switch(e.kind){case`Prime`:case`Unchanged`:case`BoxAction`:case`AngleAction`:return 2;case`Enabled`:return 1;case`Always`:case`Eventually`:case`WeakFairness`:case`StrongFairness`:return 3;case`UnboundedQuantifier`:return e.isTemporal?3:l(e);case`Identifier`:return c(e.name,e);case`OperatorReference`:return c(e.operator,e);case`Apply`:{if(ib.has(e.operator))return 3;if(e.operator===`\\cdot`)return 2;let r=c(e.operator,e),i=Math.max(r,l(e)),o=M(e)?void 0:X_(e.operator,n);return i===r||o?.kind!==`Closure`||o.params.length!==e.args.length?i:a(o,o.body,lv(o,e.args,sb(n,t)))}default:return l(e)}},ub=(e,t)=>{try{return D_(e,t)}catch(e){if(!(e instanceof w))throw e;if(!Ft(e))return;throw x(new w(`${a}${e.message}`),S.error)}},db=(e,t,n,r,i={name:void 0,path:[],expanding:/* @__PURE__ */ new Set,isSubstituted:!1})=>{let a=(e,t,a=i.name,o=i.expanding,s)=>db(e,t,n,r,{name:a,path:s?.kind===`Operator`&&s.params.length===0?[...i.path,s.name]:i.path,expanding:o,isSubstituted:i.isSubstituted||s!==void 0&&n.substitutedDefinitions.has(s)});if(e.kind===`And`)return e.operands.flatMap(e=>a(e,t,U(e)));if(e.kind===`Label`)return a(e.body,t);if(e.kind===`Let`)return a(e.body,fb(e,t,n));if(e.kind===`Identifier`){let r=M(e)?o_(t,e.name):void 0;if(r?.kind===`Thunk`&&!r.isReleased)return a(r.expression,r.scope,ab.has(r)?e.name:i.name);let o=n.constants.has(e.name)?void 0:__(e.name,n);if(!r&&o?.kind===`Operator`&&o.params.length===0&&(mf(o,n)>0||G_(o,n)===void 0)){if(i.expanding.has(o))throw m();return a(o.body,void 0,!i.isSubstituted&&n.instanceNames.get(e.name)||o.name,/* @__PURE__ */ new Set([...i.expanding,o]),o)}}let o=sb(n,t);if(e.kind===`Apply`&&n.runtime.version!==`1.7.4`&&(r||lb(e,t,n)===3)){let t=Z_(e,o),r=M(e)?void 0:__(e.operator,n),s=t?.kind===`Closure`&&t.params.every(e=>n.instanceParams.has(e));if(t?.kind===`Closure`&&t.params.length===e.args.length&&!r?.isRecursive&&(!i.isSubstituted||s))return a(t.body,lv(t,e.args,o),i.isSubstituted&&r?r.name:e.operator,i.expanding,r)}let s=r&&e.kind===`Forall`&&e.bounds.every(e=>lb(e.set,t,n)===0),c=s?ub(e.bounds,o):void 0;if(s&&c){let n=[];if(O_(e.bounds,c,t,t=>(n.push(...a(e.body,t,U(e.body))),!1)),n.length===0)throw rb();return n}return[{expression:e,scope:t,name:i.name,path:i.path}]},fb=(e,t,n)=>{let r=pv(e.definitions,sb(n,t),hv(e.definitions,n));for(let e=r;e&&e!==t;e=e.parent)e.binding.kind===`Thunk`&&ab.add(e.binding);return r},pb=(e,t,n)=>{let r=n.runtime.version===`1.7.4`,a=(e,t,i)=>{let a=i===0&&!r?lb(e,t,n):i;if(a===0){let r=W(e,sb(n,t));if(typeof r!=`boolean`)throw new w(`TLC expected a boolean value, but did not find one. ${Yg(e)}`);return Sy(r)}return a===1?{kind:`State`,expression:e,scope:t}:e.kind===`AngleAction`?{kind:`Action`,expression:e.action,subscript:e.subscript,scope:t}:{kind:`Action`,expression:e,subscript:void 0,scope:t}},o=0,s=(e,t,r,i)=>{if(o>=100)throw m();o++;let s=p(e,t);o--;let c=Oy(s),l=c===0&&lb(r,i,n)>2;return c>2||l?s:a(r,i,c)},c=(e,t)=>{let i=e.kind===`Identifier`?e.name:e.operator,a=sb(n,t),o=M(e)||__(i,n)===void 0?o_(t,i):void 0;if(o?.kind===`Thunk`&&!o.isReleased&&ab.has(o))return l(e,()=>s(o.expression,o.scope,e,t));let c=o?.kind===`Operator`?o.operator:o?void 0:M(e)?Q_(i,a):X_(i,n),u=e.kind===`Apply`?e.args:[],f=c?.kind===`Builtin`&&u.length===2?ob.get(c.name):void 0;if(f){let n=u.map(e=>p(e,t));return d(e,t,Dy(f,n))}if(c?.kind!==`Closure`)throw cb(e);let m=!M(e)&&__(i,n)?.isRecursive===!0;return l(e,()=>(r&&u.filter(e=>e.kind!==`Lambda`&&e.kind!==`OperatorReference`).forEach(e=>W(e,a)),s(c.body,lv(c,u,a),e,t)),m)},l=(e,t,n=!1)=>{try{return t()}catch(t){let a=t instanceof i||n&&!r;throw!(t instanceof w)||a?t:cb(e)}},u=(e,t)=>{let r=lb(e,t,n),o=[],s=e.kind===`Forall`;try{k_(e.bounds,sb(n,t),t=>(o.push(p(e.body,t)),!1))}catch(n){if(!(n instanceof w)||n instanceof i)throw n;if(r<=2)return a(e,t,r);throw cb(e,s&&!Ft(n)?n.message:void 0)}return o.length===0?Sy(s):d(e,t,Dy(s?`And`:`Or`,o))},d=(e,t,n)=>{let r=Oy(n);return r>2?n:a(e,t,r)},f=(e,t)=>{let n=e.operands,r=e.location.range,i=e.prefixEnds;return e.isBulleted||!r||!i?d(e,t,Dy(e.kind,n.map(e=>p(e,t)))):n.slice(1).reduce((a,o,s)=>{let c=s===n.length-2?e:{...e,operands:n.slice(0,s+2),prefixEnds:i.slice(0,s+1),location:{...e.location,range:{...r,end:i[s]}}};return d(c,t,Dy(e.kind,[a,p(o,t)]))},p(n[0],t))},p=(e,t)=>{let i=lb(e,t,n);switch(e.kind){case`Label`:return p(e.body,t);case`Let`:return p(e.body,fb(e,t,n));case`Apply`:{let n=e.args;if(e.operator===`~`&&!M(e))return d(e,t,Ty(`Not`,p(n[0],t)));if(e.operator===`=>`)return d(e,t,Ey(`Or`,Ty(`Not`,p(n[0],t)),p(n[1],t)));break}case`And`:case`Or`:return f(e,t);case`Forall`:case`Exists`:return u(e,t);case`If`:{if(!r&&lb(e.condition,t,n)===0){let r=W(e.condition,sb(n,t));if(typeof r==`boolean`)return p(r?e.consequent:e.alternative,t)}let i=p(e.condition,t);return d(e,t,Ey(`Or`,Ey(`And`,i,p(e.consequent,t)),Ey(`And`,Ty(`Not`,i),p(e.alternative,t))))}}if(i<=2)return a(e,t,i);switch(e.kind){case`Identifier`:return c(e,t);case`Apply`:return e.operator===`~>`?Ty(`Always`,Ey(`Or`,Ty(`Not`,p(e.args[0],t)),Ty(`Eventually`,p(e.args[1],t)))):c(e,t);case`Always`:case`Eventually`:return Ty(e.kind,p(e.expression,t));case`WeakFairness`:case`StrongFairness`:{let n={kind:`AngleAction`,action:e.action,subscript:e.subscript,location:e.action.location},r={kind:`Enabled`,step:e.enabled??n,scope:t},i=Ty(`Not`,r),a={kind:`Action`,expression:e.action,subscript:e.subscript,scope:t,enabled:r};return e.kind===`WeakFairness`?Ty(`Always`,Ty(`Eventually`,Ey(`Or`,i,a))):Ey(`Or`,Ty(`Eventually`,Ty(`Always`,i)),Ty(`Always`,Ty(`Eventually`,a)))}default:throw cb(e)}};return p(e,t)},mb=e=>({holdsState:(t,n)=>{let r={environment:e,scope:t.scope,state:n,next:void 0},i=t.kind===`State`?W(t.expression,r):Ig(t.step,r);if(typeof i!=`boolean`)throw new w(`A state predicate was evaluated to a non-boolean value.`);return i},holdsAction:(t,n,r)=>{let i=t.scope,a=t.subscript;if(a&&Kr(W(a,{environment:e,scope:i,state:n,next:void 0}),W(a,{environment:e,scope:i,state:r,next:void 0})))return!1;let o=W(t.expression,{environment:e,scope:i,state:n,next:r});if(typeof o!=`boolean`)throw new w(`Encountered an action predicate that's not a boolean.`);return o}}),hb=(e,t,n,r,i)=>{let a=e=>hb(e,t,n,r,i);switch(e.kind){case`Boolean`:return e.value;case`State`:case`Enabled`:{let n=i.get(e);if(n!==void 0)return n;let a=r.holdsState(e,t);return i.set(e,a),a}case`Action`:return e.enabled&&i.get(e.enabled)===!1?!1:n!==void 0&&r.holdsAction(e,t,n);case`Not`:return!a(e.body);case`And`:return e.operands.every(a);case`Or`:return e.operands.some(a);case`Next`:return hb(e.body,n??t,void 0,r,/* @__PURE__ */ new Map);case`Always`:case`Eventually`:throw new w(`TLC cannot evaluate a temporal formula in a single step`)}},gb=(e,t,n,r,i)=>{let a=e=>e+1<t.length?e+1:n,o=e=>t.map((e,t)=>t).filter(t=>t>=Math.min(e,n)),s=(e,a=r)=>gb(e,t,n,a,i);switch(e.kind){case`Not`:return!s(e.body);case`And`:return e.operands.every(e=>s(e));case`Or`:return e.operands.some(e=>s(e));case`Next`:return s(e.body,a(r));case`Always`:return o(r).every(t=>s(e.body,t));case`Eventually`:return o(r).some(t=>s(e.body,t));default:return hb(e,t[r],t[a(r)],mb(i),/* @__PURE__ */ new Map)}},_b=`UnnamedAction`,vb={module:`--TLA+ BUILTINS--`,start:{line:0,column:0},end:{line:0,column:0}},yb=e=>{let t=e.range??vb;return pi([[`beginLine`,t.start.line],[`beginColumn`,t.start.column],[`endLine`,t.end.line],[`endColumn`,t.end.column],[`module`,t.module]])},bb=(e,t)=>{let n=[[`name`,e.name],[`location`,yb(e.location)]];return e.parameters.length>0&&n.push([`context`,pi(e.parameters)],[`parameters`,fi(e.parameters.map(e=>e[0]))]),t!==void 0&&n.push([`coverage`,t]),pi(n)},xb=(e,t,n)=>({name:e,location:t.location,parameters:[],expression:t,scope:n}),Sb=(e,t)=>({environment:e,scope:t,state:void 0,next:void 0}),Cb=e=>e.kind===`Identifier`?e.name:e.kind===`Apply`?e.operator:void 0,wb=e=>e.kind===`Apply`?e.args:[],Tb=(e,t,n)=>{let r=Cb(e);if(r===void 0)return;if(M(e)){let e=o_(t,r);return e?.kind===`Operator`&&e.operator.kind===`Closure`?e.operator:void 0}if(n.constants.has(r)||n.variableIndex.has(r))return;let i=X_(r,n);return i?.kind===`Closure`?i:void 0},Eb=(e,t)=>{try{return W(e,Sb(t,void 0)),!0}catch(e){if(e instanceof v)return!1;throw e}},Db=(e,t)=>e?.kind===`Operator`&&e.params.length===0&&uf(e,t)&&Eb(e.body,t),Ob=(e,t)=>e?.kind===`Operator`&&e.body.kind!==`Number`&&e.body.kind!==`String`&&Db(e,t),kb=(e,t)=>{let n=__(e.name,t);return n?.body===e.body&&Ob(n,t)},Ab=(e,t)=>{if(e.kind!==`Identifier`||!M(e))return;let n=o_(t,e.name);return n?.kind===`Thunk`?n:void 0},jb=(e,t,n)=>{if(e.kind===`Let`)return{expression:e.body,scope:fb(e,t,n)};let r=Ab(e,t);return r&&{expression:r.expression,scope:r.scope}},Mb=(e,t,n,r)=>t.kind===`Apply`?lv(e,t.args,Sb(r,n)):e.scope,Nb=(e,t)=>(e?.params??[]).flatMap(e=>{let n=o_(t,e.name);return n?.kind===`Value`?[[e.name,n.value]]:[]}),Pb=(e,t)=>{try{return e()}catch(e){if(e instanceof v)return t();throw e}},Fb=(e,t,n,r,i)=>{let a=wb(t),o=()=>[{name:e.name,location:t.location,parameters:[],expression:t,scope:n}];return r&&a.length===0?[{...e,parameters:[],expression:r.body,scope:r.scope}]:r?a.some(e=>lb(e,n,i)!==0)?o():Pb(()=>[{...e,parameters:a.map((e,t)=>[r.params[t].name.replace(/#\d+$/,``),W(e,Sb(i,n))]),expression:t,scope:n}],o):[{...e,parameters:[],expression:t,scope:n}]},Ib=(e,t,n,r,i)=>{let a=()=>({name:n?.name??_b,location:e.location,parameters:Nb(n,t),expression:e,scope:t});if(Th.has(e.kind))throw x(new w(`${l}The next state relation is not a boolean expression.\n${Yg(e)}`),S.error);switch(e.kind){case`Let`:return Ib(e.body,fb(e,t,r),n,r,i);case`Label`:return Ib(e.body,t,n,r,i);case`Or`:return e.operands.flatMap(e=>Ib(e,t,n,r,i));case`Exists`:return Pb(()=>{let o=[];return k_(e.bounds,Sb(r,t),t=>(o.push(...Ib(e.body,t,n,r,i)),!1)),o.length===0?[a()]:o},()=>[a()])}let o=M(e)?void 0:i.get(Cb(e)??``),s=Tb(e,t,r);if(o)return Fb(o,e,t,s,r);if(!s)return[a()];let c=wb(e),u=M(e)?s.name:r.instanceNames.get(Cb(e)??``)??s.name,d=()=>[{name:u,location:e.location,parameters:[],expression:e,scope:t}];return kb(s,r)||c.some(e=>lb(e,t,r)!==0)?d():Pb(()=>{let e=c.reduce((e,n,i)=>({name:s.params[i].name,binding:{kind:`Value`,value:W(n,Sb(r,t))},parent:e}),s.scope);return Ib(s.body,e,{...s,name:u},r,i)},d)},Lb=(e,t,n,r,i,a=[])=>{let o=(e,t,o=a)=>Lb(e,t,n,r,i,o),s=(e,t,n)=>xb(e,ou(t,a),n),c=jb(e,t,n);if(c){o(c.expression,c.scope);return}let l=Tb(e,t,n);if(l&&kb(l,n))return;let u=l?[...a,...au.get(l.body)??[]]:a;if(l&&l.params.length===0){if(lb(l.body,l.scope,n)===1){r.inits.push(s(l.name,l.body,l.scope));return}o(l.body,l.scope,u);return}if(l&&e.kind===`Apply`&&l.params.length===e.args.length){o(l.body,lv(l,e.args,Sb(n,t)),u);return}if(e.kind===`And`){e.operands.forEach(e=>o(e,t));return}if(e.kind===`Always`){if(e.expression.kind===`BoxAction`){i.push({expression:e.expression.action,scope:t,frames:a});return}r.temporals.push(s(_b,e,t));return}let d=lb(e,t,n);d<=1?r.inits.push(s(_b,e,t)):d===3&&r.temporals.push(s(_b,e,t))},Rb=(e,t,n,r,i)=>{let a=(t,n)=>Rb(e,t,n,r,i),o=jb(t,n,r);if(o){a(o.expression,o.scope);return}let s=Tb(t,n,r);if(s&&kb(s,r))return;if(s&&s.params.length===wb(t).length){a(s.body,Mb(s,t,n,r));return}if(t.kind===`Forall`&&Pb(()=>(k_(t.bounds,Sb(r,n),e=>(a(t.body,e),!1)),!0),()=>!1))return;if(t.kind===`And`){t.operands.forEach(e=>a(e,n));return}if(t.kind===`Always`){let a=t.expression;a.kind===`BoxAction`?i.impliedActions.push(xb(e,a)):lb(a,n,r)<2?i.invariants.push(xb(e,a)):i.impliedTemporals.push(xb(e,t));return}let c=lb(t,n,r);c<=1?i.impliedInits.push(xb(e,t)):c===3&&i.impliedTemporals.push(xb(e,t))},zb=(e,t)=>{let n=__(e,t);return n?.kind===`Operator`&&!Ob(n,t)?n:void 0},Bb=(e,t,n)=>{let r={inits:[],actions:[],temporals:[]},i=[],a=e.specification===void 0?void 0:zb(e.specification,t);a&&(Lb(a.body,void 0,t,r,i),i.forEach(e=>r.actions.push(...e.frames.length>0?[{name:_b,location:e.frames[0].location,parameters:[],expression:ou(e.expression,e.frames),scope:e.scope}]:Ib(e.expression,e.scope,void 0,t,n))));let o=e.init===void 0?void 0:X_(e.init,t);o?.kind===`Closure`&&r.inits.push(xb(e.init??``,o.body));let s=e.next===void 0?void 0:X_(e.next,t);return s?.kind===`Closure`&&r.actions.push(...Ib(s.body,s.scope,s,t,n)),r},Vb=(e,t,n)=>{let r=[],i=(e,t)=>{if(e.kind===`Number`||e.kind===`Decimal`||e.kind===`String`)return!1;if(e.kind===`Tuple`)return e.elements.every(e=>i(e,t));if(e.kind===`Label`)return i(e.body,t);let a=jb(e,t,n);if(a)return i(a.expression,a.scope);let o=e.kind===`Identifier`&&M(e)?o_(t,e.name):void 0;if(o?.kind===`Value`&&o.argument)return i(o.argument,t);if(e.kind===`Identifier`&&!M(e)&&n.variableIndex.has(e.name))return r.push(e.name),!0;let s=Tb(e,t,n);if(!s||s.params.length!==wb(e).length)return!0;let c=__(s.name,n);return c?.body===s.body&&Db(c,n)?!0:i(s.body,Mb(s,e,t,n))};return i(e,t)?r:void 0},Hb=e=>e.parameters.length===0?``:`(${e.parameters.map(e=>L(e[1])).join(`,`)})`,Ub=(e,t,n=!1)=>`${e.name===_b?n?`Initial predicate`:`Action`:e.name}${t===`1.7.4`?``:Hb(e)} ${g(e.location.range??vb)}`,Wb=e=>`${e.name}${Hb(e)}`,Gb=(e,t,n,r)=>{let i={invariants:[],impliedInits:[],impliedActions:[],impliedTemporals:[]};t.invariants.forEach(e=>{let t=zb(e,n);t&&i.invariants.push(xb(e,t.body))}),t.properties.forEach(e=>{let t=zb(e,n);t&&Rb(e,t.body,void 0,n,i)});let a=n.coverage,o=(e,t)=>Yr(e.map(e=>{let n=a&&t&&ls(a,t,e.expression);return bb(e,n&&pi(n))})),s=e=>Yr(e.flatMap(e=>{let t=zb(e,n);return t?[pi([[`name`,t.name],[`location`,yb(t.location)]])]:[]}));return pi([[`inits`,o(e.inits,`init`)],[`actions`,o(e.actions,`next`)],[`temporals`,o(e.temporals)],[`invariants`,o(i.invariants,`invariant`)],[`impliedinits`,o(i.impliedInits,`implied`)],[`impliedactions`,o(i.impliedActions,`implied`)],[`impliedtemporals`,o(i.impliedTemporals)],[`variables`,Yr(n.variables.map((e,t)=>pi([[`name`,e],[`location`,yb(r[t])],...a?[[`coverage`,pi([[`distinct`,Zo(a,t)]])]]:[]])))],[`actionconstraints`,s(t.actionConstraints)],[`constraints`,s(t.constraints)]])},Kb=e=>{switch(e.kind){case`Always`:return!0;case`Eventually`:case`Not`:case`Next`:return Kb(e.body);case`And`:case`Or`:return e.operands.some(Kb);default:return!1}},qb=e=>e.eventuallyAlways.length===0&&e.infinitelyOftenStates.length===0&&e.infinitelyOftenActions.length===0,Jb=e=>e.promises.some(e=>Kb(e.body))||e.models.some(e=>!qb(e)),Yb=(e,t)=>e.every((e,n)=>yr(e,t[n])),Xb=e=>e.filter((t,n)=>n===0||e[n-1]!==t),Zb=e=>({data:e(1024),length:0,create:e}),Qb=(e,t,n,r=0,i=n.length-r)=>{let a=t+i;if(a>e.data.length){let t=e.create(Math.max(2*e.data.length,a));t.set(e.data),e.data=t}for(let a=0;a<i;a++)e.data[t+a]=n[r+a];e.length=Math.max(e.length,a)},$b=(e,t,n)=>{let r=e.slots.length/3-1,i=Math.imul(Math.imul(t,2654435761)^n,2246822507)>>>e.shift;for(let a=i;;a=a+1&r){let r=a*3,i=e.slots[r];if(i===0||i===t+1&&e.slots[r+1]===n)return r}},ex=e=>new Int32Array(e).fill(-1),tx=(e,t)=>(e.edgeStarts[t]??-1)!==-1,nx=(e,t)=>{let n=e.edgeStarts[t];return e.edgeTargets.data.subarray(n,n+e.edgeCounts[t])},rx=(e,t,n)=>e.stateResults.data[e.nodeStates[t]*e.solution.stateChecks.length+n]===1,ix=(e,t,n)=>(e.nodeStates.push(t),e.nodeTableaux.push(n),e.edgeStarts.push(-1),e.edgeCounts.push(0),e.nextSiblings.push(-1),e.nodeStates.length-1),ax=(e,t)=>{let n=[];for(let r=e.firstNodes.data[t]??-1;r!==-1;r=e.nextSiblings[r])n.push(r);return n},ox=2**53-1,sx=(e,t,n)=>{let r=t.map(e=>pb(e.expression,e.scope,n)),i=e.map(e=>Ty(`Not`,pb(e.expression,e.scope,n))),a=i.length===1?i[0]:Dy(`Or`,i);return{formula:r.length===0?a:Dy(`And`,[...r,a]),negations:i}},cx=e=>{switch(e.kind){case`State`:return[e];case`Enabled`:return[{expression:e.step,scope:e.scope}];case`Action`:return[e.expression,e.subscript].flatMap(t=>t?[{expression:t,scope:e.scope}]:[])}},lx=(e,t)=>{switch(e.kind){case`Boolean`:return;case`State`:case`Enabled`:case`Action`:t.add(e);return;case`And`:case`Or`:e.operands.forEach(e=>lx(e,t));return;default:lx(e.body,t)}},ux=e=>{let t=/* @__PURE__ */ new Set;for(let n of e)[...n.stateChecks,...n.actionChecks,...n.tableau?.nodes.flatMap(e=>e.statePredicates)??[]].forEach(e=>lx(e,t));return[...t]},dx=e=>ux(e).flatMap(e=>cx(e).map(e=>e.expression)),fx=(e,t,n)=>{if(e.length===0)return;let r=sx(e,t,n),i=/* @__PURE__ */ new Set;lx(r.formula,i);let a=[...i].flatMap(cx),o=a.every(e=>e.scope===void 0)?!ff(a.map(e=>e.expression),n,`repeated`):!_v(n);return{solutions:nb(r.formula),createChecker:(t,i)=>{let a={environment:n,atoms:mb(n)},s=mx(i,{atoms:{holdsState:(e,t)=>a.atoms.holdsState(e,t),holdsAction:(e,t,n)=>a.atoms.holdsAction(e,t,n)},isShared:o,isSame:Yb,evaluateFrom:(e,t)=>{n.runtime.setLivenessSource(e);try{return t()}finally{n.runtime.setLivenessSource(void 0)}}},t,n.runtime.version!==`1.7.4`),c=(e,t)=>{if(e===void 0)return t();a.atoms=mb(e);try{return t()}finally{a.atoms=mb(n)}};return{branches:s.branches,solutions:i,addInitialState:(e,t,n)=>c(n,()=>s.addInitialState(e,t)),addState:(e,t,n,r)=>c(r,()=>s.addState(e,t,n,r!==void 0)),storeState:s.storeState,getStateCounts:s.getStateCounts,findViolation:s.findViolation,getViolatedProperties:(t,i)=>[...new Set(e.filter((e,a)=>!gb(r.negations[a].body,t,i,0,n)).map(e=>e.name))]}}}},px=(e,t,n,r)=>{let i=fx(e,t,n);return i?.createChecker(r,i.solutions)},mx=(e,t,n,r)=>{let i=/* @__PURE__ */ new Map,a=1,o=t.isShared,s=t.atoms,c=t.evaluateFrom,l=/* @__PURE__ */ new Map,u=[],d=e=>{let t=l.get(e)??l.size;return l.set(e,t),u[t]=e,t},f=e=>{if(e.kind===`State`||e.kind===`Enabled`)return[d(e)*2+1];if(e.kind===`Not`){let t=e.body;return t.kind===`State`||t.kind===`Enabled`?[d(t)*2]:void 0}if(e.kind!==`And`)return;let t=e.operands.map(f);return t.every(e=>e!==void 0)?t.flat():void 0},p=e=>new Int8Array(e*l.size).fill(-1),m=e=>new Int8Array(e*i.size).fill(-1),h=(e,t,n,r,i)=>o?e(t,n,r,i):e(t,p(1),0,i),g=e=>{switch(e.kind){case`Boolean`:{let t=e.value;return()=>t}case`State`:case`Enabled`:{let t=d(e);return(n,r,i)=>(r[i+t]===-1&&(r[i+t]=+!!s.holdsState(e,n)),r[i+t]===1)}case`Action`:{let t=e.enabled&&d(e.enabled);return(n,r,i,a)=>(t===void 0||r[i+t]!==0)&&a!==void 0&&s.holdsAction(e,n,a)}case`Not`:{let t=g(e.body);return(e,n,r,i)=>!t(e,n,r,i)}case`And`:{let t=e.operands.map(g);return(e,n,r,i)=>t.every(t=>t(e,n,r,i))}case`Or`:{let t=e.operands.map(g);return(e,n,r,i)=>t.some(t=>t(e,n,r,i))}case`Next`:{let t=g(e.body);return(e,n,r,i)=>t(i??e,p(1),0,void 0)}case`Always`:case`Eventually`:return()=>{throw new w(`TLC cannot evaluate a temporal formula in a single step`)}}},_=e.map(e=>({solution:e,checks:{states:e.stateChecks.map(g),actions:e.actionChecks.map(g),nodes:e.tableau?.nodes.map(e=>{let t=o?f({kind:`And`,operands:e.statePredicates}):void 0;return t?Int32Array.from(t):e.statePredicates.map(g)})??[]},actionIds:Int32Array.from(e.actionChecks,e=>{let t=My(e),n=i.get(t)??i.size;return i.set(t,n),n}),nodeStates:[],nodeTableaux:[],edgeStarts:[],edgeCounts:[],edgeTargets:Zb(e=>new Int32Array(e)),edgeActions:Zb(e=>new Uint8Array(e)),stateResults:Zb(e=>new Uint8Array(e)),initial:[],firstNodes:Zb(ex),lastNodes:Zb(ex),nextSiblings:[],nodeIds:{slots:/* @__PURE__ */ new Int32Array(3072),size:0,shift:22},isDone:[],stateCount:0,errorNode:void 0})),v=(e,t,n,r,i)=>c(t,()=>{let t=e.checks.states,a=new Uint8Array(t.length);return t.forEach((e,t)=>{a[t]=+!!h(e,n,r,i)}),a}),y=(e,t,n,r,i,a,s,l,u,d)=>c(t,()=>{let t=e.checks.actions;for(let c=0;c<t.length;c++){if(!o){u[d+c]=+!!h(t[c],n,r,i,a);continue}let f=l+e.actionIds[c];s[f]===-1&&(s[f]=+!!t[c](n,r,i,a)),u[d+c]=s[f]}}),ee=(e,t,n,r,i)=>{let a=e.checks.nodes[t];if(!(a instanceof Int32Array))return a.every(e=>h(e,n,r,i));for(let e=0;e<a.length;e++){let t=a[e],o=i+(t>>1);if(r[o]===-1&&(r[o]=+!!s.holdsState(u[t>>1],n)),r[o]!==(t&1))return!1}return!0},b=(e,t,n,r,i,a)=>c(n,()=>ee(e,t,r,i,a)),x=(e,t)=>{if(!r)return!1;let n=e.nodes[t];return n.particle.length===0&&n.successors.length===1&&n.successors[0]===t},te=(e,t,n)=>{if(!e.solution.tableau)return t;let r=e.nodeIds.slots,i=$b(e.nodeIds,t,n);return r[i]===0?void 0:r[i+2]},S=(e,t,n,r)=>{let i=e.nodeIds;if(++i.size*2>i.slots.length/3){let e=i.slots;i.slots=new Int32Array(e.length*2),i.shift--;for(let t=0;t<e.length;t+=3)e[t]!==0&&i.slots.set(e.subarray(t,t+3),$b(i,e[t]-1,e[t+1]))}if(i.slots.set([t+1,n,r],$b(i,t,n)),t<0)return r;let a=e.lastNodes.data[t]??-1;return a===-1?Qb(e.firstNodes,t,[r]):e.nextSiblings[a]=r,Qb(e.lastNodes,t,[r]),r},ne=(e,t)=>t<0?e.checks.nodes.some((n,r)=>te(e,t,r)!==void 0):e.isDone[t]===!0||(e.firstNodes.data[t]??-1)!==-1,C=(e,t,n)=>(ne(e,t)||e.stateCount++,S(e,t,n,ix(e,t,n))),re=(e,t,n,r,i,a)=>{let o=e.edgeTargets.length,s=e.solution.actionChecks.length;Qb(e.edgeTargets,o,n),i.forEach((t,n)=>Qb(e.edgeActions,(o+n)*s,r,t*s,s)),Qb(e.stateResults,e.nodeStates[t]*a.length,a),e.edgeStarts[t]=o,e.edgeCounts[t]=n.length},T={slots:/* @__PURE__ */ new Int32Array},ie=(e,r,i)=>{let o=[...i,{index:e,state:r}],s=16*a;T.slots=T.slots.length===s?T.slots.fill(0):new Int32Array(s);let c=e=>{let r=T.slots,i=o[e];for(let a=(n.getFingerprint(i)&2147483647)%r.length;;a=(a+1)%r.length){let n=r[a];if(n===0)return r[a]=e+1,!0;let s=o[n-1];if(s.index===i.index&&t.isSame(s.state,i.state))return!1}},l=0;for(let e=0;e<o.length;e++){if(l>=T.slots.length>>1){let e=T.slots;T.slots=new Int32Array(2*e.length+1);for(let t of e)t!==0&&c(t-1)}c(e)&&l++}T.slots.length>s&&a++;let u=[];for(let e of T.slots)e!==0&&u.push(o[e-1]);return u},ae=(e,t,r,a,o,s,c)=>{let l=v(e,a,r,s,c),u=t.nodes[e.nodeTableaux[o]],d=e.checks.actions.length,f=[],h=[],g=new Uint8Array(d);u.successors.length>0&&y(e,a,r,s,c,r,m(1),0,g,0);for(let n of u.successors){if(!b(e,n,a,r,s,c))continue;if(x(t,n)&&e.errorNode===void 0&&e.solution.models.some(qb)){e.errorNode=o;return}let i=te(e,a,n);if(i!==void 0&&h.includes(i))continue;let l=i??C(e,a,n);h.push(l),f.push(0),i===void 0&&ae(e,t,r,a,l,s,c)}let _=[g],ee=1;if(n.forEachActionSuccessors(a,r,n=>{let o=m(n.length),l=new Uint8Array(n.length*d);_.push(l);for(let m=0;m<n.length;m++){let g=n[m],_=p(1);y(e,a,r,s,c,g.state,o,m*i.size,l,m*d);let v=e.isDone[g.index]===!0;for(let n of u.successors){if(!b(e,n,a,g.state,_,0))continue;let r=te(e,g.index,n);if(r!==void 0&&h.includes(r))continue;let i=r??C(e,g.index,n);h.push(i),f.push(ee+m),r===void 0&&v&&ae(e,t,g.state,g.index,i,_,0)}}ee+=n.length}),h.length>0){let t=new Uint8Array(ee*d);for(let e=0,n=0;e<_.length;e++)t.set(_[e],n),n+=_[e].length;re(e,o,h,t,f,l)}},oe=(e,t,n,r,i,a,o)=>{let s=l.size,u=new Uint8Array(t.nodes.length*n.length);c(o,()=>{for(let i=0;i<t.nodes.length;i++)for(let t=0;t<n.length;t++)ee(e,i,n[t].state,r,t*s)&&(u[i*n.length+t]=1)}),ne(e,o)||e.stateCount++,e.isDone[o]=!0;for(let c of ax(e,o)){let o=[],l=[];n.forEach((i,a)=>{let d=e.isDone[i.index]===!0;for(let f of t.nodes[e.nodeTableaux[c]].successors){if(u[f*n.length+a]===0)continue;let c=te(e,i.index,f);if(c!==void 0&&o.includes(c))continue;let p=c??C(e,i.index,f);o.push(p),l.push(a),c===void 0&&d&&ae(e,t,i.state,i.index,p,r,a*s)}}),re(e,c,o,i,l,a)}return e.errorNode===void 0?void 0:le(e,e.errorNode)},se=(e,t,n,r,i)=>{for(;e.nodeStates.length<=i;)ix(e,e.nodeStates.length,-1);let a=[],o=[];t.forEach((t,n)=>{tx(e,t.index)&&a.includes(t.index)||(a.push(t.index),o.push(n))}),tx(e,i)||e.stateCount++,re(e,i,a,n,o,r)},ce=(e,t)=>{if(e.initial.includes(t))return[t];let n=/* @__PURE__ */ new Map,r=[];for(let t of e.initial)tx(e,t)&&(r.push(t),n.set(t,-1));for(let i=0;i<r.length;i++){let a=r[i];for(let i of nx(e,a))if(!(i===a&&e.solution.tableau)){if(i===t){let e=[t];for(let t=a;t!==-1;t=n.get(t)??-1)e.push(t);return e}tx(e,i)&&!n.has(i)&&(n.set(i,a),r.push(i))}}throw new w(`Couldn't re-create liveness trace (path) starting at: ${t}`)},le=(e,t)=>Xb(ce(e,t).reverse().map(t=>e.nodeStates[t])),E=(e,t)=>{let n=e.solution,r=n.actionChecks.length,i=(t,n,i)=>e.edgeActions.data[(e.edgeStarts[t]+n)*r+i]===1,a=(e,n)=>t.eventuallyAlways.every(t=>i(e,n,t)),o=new Float64Array(e.nodeStates.length).fill(-1),s=e.initial.filter(t=>tx(e,t)),c=[],l=t=>{let n=nx(e,t).indexOf(t);return n!==-1&&a(t,n)},u=(t,r)=>n.tableau!==void 0&&$y(n.tableau.nodes[e.nodeTableaux[t]].particle,r),d=r=>{let s=c.pop()??r;if(s===r&&!l(s)){o[s]=ox;return}let d=/* @__PURE__ */ new Set,p=/* @__PURE__ */ new Map;for(let t=s;;t=c.pop()??r){d.add(t);let n=p.get(e.nodeStates[t]);if(n?n.push(t):p.set(e.nodeStates[t],[t]),o[t]=ox,t===r)break}let m=t.infinitelyOftenStates.every(t=>[...d].some(n=>rx(e,n,t))),h=t.infinitelyOftenActions.every(t=>[...d].some(n=>nx(e,n).some((e,r)=>d.has(e)&&a(n,r)&&i(n,r,t)))),g=n.promises.every(e=>[...d].some(t=>u(t,e)));if(m&&h&&g)return f(r,d,p)},f=(r,o,s)=>{let c=le(e,r),l=[],d=/* @__PURE__ */ new Set([r]),f=t.infinitelyOftenStates.map(()=>!1),m=t.infinitelyOftenActions.map(()=>!1),h=n.promises.map(()=>!1),g=f.length+m.length+h.length,_=r,v=e=>{l.push(_),_=e};for(;g>0;){let r=g;for(;t.infinitelyOftenStates.forEach((t,n)=>{!f[n]&&rx(e,_,t)&&(f[n]=!0,g--)}),n.promises.forEach((e,t)=>{!h[t]&&u(_,e)&&(h[t]=!0,g--)}),!(g<=0);){let n=-1,c=-1,u=g;if(nx(e,_).some((r,l)=>{if(s.has(e.nodeStates[r])){if(!o.has(r)||!a(_,l))return!1;n=r,t.infinitelyOftenActions.forEach((e,t)=>{!m[t]&&i(_,l,e)&&(m[t]=!0,g--)})}return g<u?(v(r),d.clear(),!0):(o.has(r)&&!d.has(r)&&(c=r),!1)}))break;if(g<r){v(n),d.clear();break}for(;c===-1;){let t=l.pop();if(t===void 0)throw new w(`TLC failed to build the counterexample of a liveness property`);_=t,c=nx(e,t).find(e=>o.has(e)&&!d.has(e))??-1}v(c),d.add(c)}}let y=p(r,_,s);for(let t=l.length-1;t>=0;t--){let n=e.nodeStates[l[t]];y[y.length-1]!==n&&y.push(n)}let ee=c[c.length-1];return y[y.length-1]===ee&&y.pop(),{prefix:c.slice(0,-1),cycle:[ee,...y.reverse()],isCycleConstrained:Jb(n)}},p=(t,n,r)=>{if(n===t)return[];let i=e.nodeStates[n],o=/* @__PURE__ */ new Map,s=/* @__PURE__ */ new Set([i]),c=[];for(let n=i,l=-1,u=0;;u++){for(let u of r.get(n)??[])for(let[d,f]of nx(e,u).entries()){if(f===u||!a(u,d))continue;if(f===t){let e=[];for(let t=n,r=l;t!==i;)e.push(t),t=r,r=o.get(t)??-1;return e.push(i),e}let p=e.nodeStates[f];r.has(p)&&!s.has(p)&&(s.add(p),c.push([p,n]))}o.set(n,l);let d=c[u];if(d===void 0)throw new w(`TLC failed to build the counterexample of a liveness property`);n=d[0],l=d[1]}};for(let t=0;t<s.length;t++){let n=[s[t],-1,0],r=0;for(;n.length>=3;){let t=n.pop()??0,i=n.pop(),l=n.pop()??0;if(i===-42){if(o[l]===t){let e=d(l);if(e)return e}n.push(Math.min(n.pop()??t,t));continue}if(o[l]!==-1){n.push(Math.min(t,o[l]));continue}o[l]=r,n.push(t,l,-42),c.push(l);let u=r++;nx(e,l).forEach((t,r)=>{tx(e,t)&&(a(l,r)?o[t]===-1?n.push(t,-1):u=Math.min(u,o[t]):o[t]===-1&&s.push(t))}),n.push(u)}}};return{branches:_.length,addInitialState:(e,t)=>{let n=p(1);for(let r of _){let i=r.solution.tableau;if(!i)r.initial.push(e);else for(let a=0;a<i.initialCount;a++)b(r,a,void 0,t,n,0)&&r.initial.push(te(r,e,a)??C(r,e,a))}},addState:(e,t,n,r)=>{let a=ie(e,t,n),o=p(a.length),s=a.findIndex(t=>t.index===e)*l.size,c=m(a.length);for(let n of _){let l=n.checks.actions.length,u=new Uint8Array(a.length*l);a.forEach((r,a)=>y(n,e,t,o,s,r.state,c,a*i.size,u,a*l));let d=v(n,e,t,o,s),f=n.solution.tableau;if(r&&(f?ax(n,e).some(e=>n.edgeCounts[e]>0):a.every(e=>tx(n,e.index))))throw new w(`The behavior graph holds every edge of the state already.`);if(!f){se(n,a,u,d,e);continue}let p=oe(n,f,a,o,u,d,e);if(p)return p}},storeState:(e,t)=>{for(let n of _){let r=n.solution.tableau;if(!r)continue;let i=[];for(let t=0;t<r.nodes.length;t++){let r=te(n,e,t);r!==void 0&&i.push(r)}for(let e of i.sort((e,t)=>e-t))n.nodeStates[e]=t,S(n,t,n.nodeTableaux[e],e)}},getStateCounts:()=>_.map(e=>e.stateCount),findViolation:()=>{for(let e of _)for(let t of e.solution.models){let n=E(e,t);if(n)return n}}}},hx=e=>{switch(e.kind){case`Number`:if(!_n(e.value))throw x(new t(`TLC can't handle a number this big.\n${e.value}`),S.error);return e.value;case`String`:case`Boolean`:return e.value;case`ModelValue`:return nr(e.name);case`Set`:return F({kind:`MixedSet`,elements:e.elements.map(hx)})}},gx=e=>{try{return hx(e)}catch(e){throw!(e instanceof w)||e instanceof t||e instanceof f?e:x(new w(`${l}${e.message}`),S.error)}},_x=(e,t,n)=>{let r=`{ ${n.map(e=>`<${[...e[0],e[1]].map(e=>L(e)).join(`, `)}>`).join(`, `)}}`;return{kind:`Builtin`,name:e,arity:t,evaluate:e=>{let t=n.find(t=>{if(t[0].length!==e.length)throw new w(`Attempted to apply the operator ${r}\nwith wrong number of arguments.`);return t[0].every((t,n)=>{let r=e[n];return(typeof r!=`object`||r.kind!==`Operator`)&&_r(t,r)})});if(t)return t[1];throw new w(`Attempted to apply operator:\n${r}\nto arguments (${e.map(e=>typeof e==`object`&&e.kind===`Operator`?e.name:L(e)).join(`, `)}), which is undefined.`)},evaluateUnary:void 0,evaluateBinary:void 0}},vx=e=>new C(`In the configuration file, the identifier ${e} appears\non the right-hand side of a <- after already appearing on the\nleft-hand side of one.`),yx=(e,t)=>{let n=e=>t.root.visible.get(e)?.key??e,r=t.root.constants.map(e=>e.name),i=t.root.variables,a=e=>{let n=t.moduleSymbols.get(e.module??``)?.get(e.name);return n?.kind===`Definition`?n:void 0},o=e=>{if(e.module===void 0)return[e.name,n(e.name)];let t=a(e);return t?[t.key]:[]},s=e=>e.module===t.root.module.name?[]:o(e),c=e=>{let n=t.definitions.get(e);return n?.kind===`Operator`?n.params.length:t.root.constants.find(t=>t.name===e)?.arity??t.builtins.get(e)?.arity??0},l=/* @__PURE__ */ new Map,u=/* @__PURE__ */ new Set,d=(e,n)=>{t.builtins.set(e,n),t.definitions.delete(e),l.delete(e),u.add(e)};e.constants.filter(e=>e.args===void 0).forEach(e=>{let t=gx(e.value);Wr(t),s(e).forEach(e=>{let n=c(e);n===0?l.set(e,t):d(e,{kind:`Builtin`,name:e,arity:n,evaluate:()=>t,evaluateUnary:void 0,evaluateBinary:void 0,isLazy:!0})})});let f=/* @__PURE__ */ new Map;e.constants.forEach(e=>{if(e.args===void 0)return;let t=`${e.module??``}!${e.name}`,n=f.get(t)??{name:e.name,module:e.module,rows:[]};if(n.rows.length>0&&n.rows[0][0].length!==e.args.length)throw new C(`The arity of the operator ${e.name} is inconsistent in the configuration file.`);n.rows.push([e.args.map(hx),hx(e.value)]),f.set(t,n)}),f.forEach(e=>s(e).forEach(t=>d(t,_x(e.name,c(t),e.rows))));let p=new Map(e.substitutions.flatMap(e=>o(e).map(t=>[t,n(e.target)])));[...p.keys()].forEach(e=>l.delete(e));let m=(e,a,o)=>{let s=n(a),c=t.definitions.get(s);if(!(c!==void 0||t.builtins.has(s)||l.has(s)||r.includes(a)||i.includes(a)))throw new C(`The configuration file substitutes for ${e} with the undefined identifier ${a}.`);if(c?.kind===`Operator`&&c.params.length!==o)throw new C(`The configuration file substitutes for ${e} with ${a} of different number of arguments.`)};e.substitutions.filter(e=>e.module===void 0).forEach(n=>{let i=n.name,a=n.target;if(!r.includes(i)&&!t.root.visible.has(i))throw new C(`In the configuration file, the identifier ${i} does not appear in the specification.`);if(e.substitutions.some(e=>e.name===a))throw vx(a);m(i,a,t.root.constants.find(e=>e.name===i)?.arity??t.root.visible.get(i)?.arity)});let h=e.substitutions.filter(e=>e.module!==void 0);[...t.moduleSymbols.keys()].forEach(e=>{let t=h.filter(t=>t.module===e);t.forEach(e=>{let n=a(e);if(n){if(t.some(t=>t.name===e.target))throw vx(e.target);m(e.name,e.target,n.arity)}});let n=t.find(e=>!a(e));if(n)throw new C(`In the configuration file, the identifier ${n.name} does not appear in the specification.`)});let g=h.find(e=>!t.moduleSymbols.has(e.module??``));if(g)throw new C(`In the configuration file, the module name ${g.module} is not a module in the specification.`);let _=new Set([...e.constants,...e.substitutions].filter(e=>e.module!==void 0).flatMap(s)),v=(e,n)=>{if(_.has(e))return{key:e,prefix:n};let r=t.copySources.get(e);return r&&v(r.source,n+r.prefix)};t.copySources.forEach((e,n)=>{let r=v(e.source,e.prefix),i=t.definitions.get(n);if(!r||!i)return;let a=i.kind===`Operator`?i.params:[],o=Nu(n,r.key,a,a.slice(r.prefix),i.location);t.definitions.set(n,o),t.root.visible.forEach((e,r)=>{e.key===n&&r!==n&&t.definitions.set(r,o)})}),t.operatorConstants.forEach((e,t)=>l.set(t,e));let y=r.filter(e=>!l.has(e)&&!p.has(e)&&!u.has(e));if(y.length>0){let e=t.order.getDeclarationOrder(`constant`).find(e=>y.includes(e))??y[0];throw new C(`The constant parameter ${e} is not assigned a value by the configuration file.`)}return{constants:l,substitutions:p}},bx=`tlc2/value/impl/`,xx={utf8:1,integer:3,float:4,long:5,double:6,class:7,string:8,methodHandle:15,methodType:16,module:19,package:20},Sx={iconstM1:2,iconst0:3,iconst5:8,bipush:16,sipush:17,ldc:18,ldcW:19,dup:89,areturn:176,getstatic:178,invokespecial:183,invokestatic:184,new:187},Cx=e=>{let t=new DataView(e.buffer,e.byteOffset,e.byteLength),n=0,r=e=>{let t=n;return n+=e,t};return{readUint8:()=>t.getUint8(r(1)),readUint16:()=>t.getUint16(r(2)),readUint32:()=>t.getUint32(r(4)),readInt32:()=>t.getInt32(r(4)),readBytes:t=>e.subarray(r(t),n)}},wx=/* @__PURE__ */ new Map([[`B`,`byte`],[`C`,`char`],[`D`,`double`],[`F`,`float`],[`I`,`int`],[`J`,`long`],[`S`,`short`],[`Z`,`boolean`],[`V`,`void`]]),Tx=[[1,`public`],[4,`protected`],[2,`private`],[1024,`abstract`],[8,`static`],[16,`final`],[32,`synchronized`],[256,`native`],[2048,`strictfp`]],Ex=e=>[...e.matchAll(/(\[*)(?:L([^;]*);|([BCDFIJSZV]))/g)].map(e=>`${e[2]?.replaceAll(`/`,`.`)??wx.get(e[3])}${`[]`.repeat(e[1].length)}`),Dx=(e,t)=>e[e[t].first].text,Ox=(e,t)=>Dx(e,t).replaceAll(`/`,`.`),kx=e=>{let t=Cx(e);if(t.readUint32()!==3405691582)throw new s(`A module override is not a class file`);t.readUint16(),t.readUint16();let n=[],r=t.readUint16(),i=new TextDecoder;for(let e=1;e<r;e++){let r=t.readUint8(),a={tag:r,text:``,value:0,first:0,second:0};n[e]=a,r===xx.utf8?a.text=i.decode(t.readBytes(t.readUint16())):r===xx.integer?a.value=t.readInt32():r===xx.float?t.readUint32():r===xx.long||r===xx.double?(t.readBytes(8),e++):r===xx.class||r===xx.string||r===xx.methodType||r===xx.module||r===xx.package?a.first=t.readUint16():r===xx.methodHandle?(t.readUint8(),a.first=t.readUint16()):(a.first=t.readUint16(),a.second=t.readUint16())}t.readUint16();let a=Ox(n,t.readUint16());t.readUint16(),t.readBytes(t.readUint16()*2);for(let e=t.readUint16();e>0;e--){t.readBytes(6);for(let e=t.readUint16();e>0;e--)t.readUint16(),t.readBytes(t.readUint32())}let o=[];for(let e=t.readUint16();e>0;e--){let e=t.readUint16(),r=n[t.readUint16()].text,i=n[t.readUint16()].text,s=i.indexOf(`)`),c=Ex(i.slice(1,s)),l=Array.from({length:t.readUint16()},()=>({name:n[t.readUint16()].text,reader:Cx(t.readBytes(t.readUint32()))}));if(!(e&1&&e&8))continue;let u=l.find(e=>e.name===`Code`)?.reader;u?.readBytes(4);let d=l.find(e=>e.name===`Exceptions`)?.reader,f=d?Array.from({length:d.readUint16()},()=>Ox(n,d.readUint16())):[],p=Tx.filter(t=>(e&t[0])!==0).map(e=>e[1]),m=Ex(i.slice(s+1))[0],h=f.length===0?``:` throws ${f.join(`,`)}`;o.push({name:r,arity:c.length,code:u?.readBytes(u.readUint32()),signature:`${p.join(` `)} ${m} ${a}.${r}(${c.join(`,`)})${h}`})}return{pool:n,methods:o}},Ax=(e,t)=>{let n=e[t],r=e[n.second];return{className:Dx(e,n.first),name:e[r.first].text}},jx=(e,t,n,r)=>{let i=()=>new p(`The Java override ${n}.${e.name} computes its value, which tla-ts cannot run`),a=e.code;if(!a)throw i();let o=[],s=()=>{let e=o.pop();if(e===void 0)throw i();return e},c=e=>{let n=t[e];if(n.tag===xx.integer)return n.value;if(n.tag===xx.string)return t[n.first].text;throw i()};for(let e=0;e<a.length;){let n=a[e],l=()=>a[e+1]<<8|a[e+2];if(n>=Sx.iconstM1&&n<=Sx.iconst5)o.push(n-Sx.iconst0),e+=1;else if(n===Sx.bipush)o.push(a[e+1]<<24>>24),e+=2;else if(n===Sx.sipush)o.push(l()<<16>>16),e+=3;else if(n===Sx.ldc)o.push(c(a[e+1])),e+=2;else if(n===Sx.ldcW)o.push(c(l())),e+=3;else if(n===Sx.dup){let t=s();o.push(t,t),e+=1}else if(n===Sx.getstatic){let n=Ax(t,l());if(n.className!==`${bx}BoolValue`||n.name!==`ValTrue`&&n.name!==`ValFalse`)throw i();o.push({kind:`Identifier`,name:n.name===`ValTrue`?`TRUE`:`FALSE`,location:r}),e+=3}else if(n===Sx.invokestatic){let n=Ax(t,l()),a=s();if(n.className!==`${bx}IntValue`||n.name!==`gen`||typeof a!=`number`)throw i();o.push({kind:`Number`,value:a,location:r}),e+=3}else if(n===Sx.new)o.push({className:Dx(t,l()),value:void 0}),e+=3;else if(n===Sx.invokespecial){let n=Ax(t,l()),a=s(),o=s();if(!(n.className===`${bx}StringValue`&&n.name===`<init>`&&typeof a==`string`&&typeof o==`object`&&`className`in o))throw i();o.value={kind:`String`,value:a,location:r},e+=3}else if(n===Sx.areturn){let e=s();if(typeof e!=`object`)throw i();if(`className`in e){if(!e.value)throw i();return e.value}return e}else throw i()}throw i()},Mx=(e,t,n)=>{if(!t)return{module:e,overrides:[]};let r=kx(t),i=new Map(e.definitions.filter(e=>n||!e.isLocal).map(e=>[e.name,e.kind===`Operator`?e.params.length:0])),a=e=>i.get(e.name)===e.arity,o=e.definitions.map(t=>{if(t.kind!==`Operator`)return t;let n=r.methods.find(e=>e.name===t.name&&a(e));return n?{...t,body:jx(n,r.pool,e.name,t.location)}:t});return{module:{...e,definitions:o},overrides:r.methods.map(t=>({module:e.name,operator:t.name,signature:t.signature,isMatched:a(t)}))}},Nx=A(`EOF`),Px=A(`IDENTIFIER`),Fx=A(`DEFBREAK`),Ix=(e,t)=>Array.from({length:A(t)-A(e)+1},(t,n)=>A(e)+n),Lx=new Set(Ix(`op_57`,`op_119`)),Rx=new Set(Ix(`op_1`,`op_119`)),zx=new Set(Ix(`op_57`,`op_70`)),Bx=/* @__PURE__ */ new Set([...Ix(`ACTION`,`EXCEPT`),A(`EXTENDS`),...Ix(`IF`,`SF`),A(`STATE`),...Ix(`THEN`,`WITH`),A(`US`),...Ix(`op_112`,`op_116`)]),Vx=(e,t,n,r,...i)=>i.map(i=>[i,{name:i,low:t,high:n,isLeftAssociative:r,fix:e}]),Hx=new Map([...Vx(`postfix`,160,160,!0,`[`),...Vx(`postfix`,150,150,!1,`'`,`^+`,`^*`,`^#`),...Vx(`prefix`,120,120,!1,`-.`),...Vx(`prefix`,100,130,!1,`SUBSET`,`UNION`,`DOMAIN`),...Vx(`prefix`,40,150,!1,`[]`,`<>`,`ENABLED`,`UNCHANGED`),...Vx(`prefix`,40,40,!0,`\\lnot`),...Vx(`nfix`,100,130,!0,`\\times`),...Vx(`infix`,140,140,!1,`^`,`^^`),...Vx(`infix`,130,130,!1,`/`,`//`,`\\oslash`,`\\div`),...Vx(`infix`,130,130,!0,`*`,`&&`,`&`,`**`,`\\odot`,`\\otimes`,`\\star`,`\\o`,`\\bigcirc`,`\\bullet`),...Vx(`infix`,110,110,!0,`-`,`--`,`\\ominus`),...Vx(`infix`,100,110,!0,`|`,`||`,`%%`),...Vx(`infix`,100,110,!1,`%`),...Vx(`infix`,100,100,!0,`+`,`++`,`\\oplus`),...Vx(`infix`,90,140,!1,`\\wr`),...Vx(`infix`,90,130,!0,`$$`,`$`,`??`,`##`,`\\uplus`,`\\sqcap`,`\\sqcup`),...Vx(`infix`,90,130,!1,`!!`),...Vx(`infix`,90,90,!1,`...`,`..`),...Vx(`infix`,80,80,!0,`\\intersect`,`\\union`),...Vx(`infix`,80,80,!1,`\\`),...Vx(`infix`,70,70,!1,`<:`,`:>`),...Vx(`infix`,60,60,!0,`@@`),...Vx(`infix`,50,140,!0,`\\cdot`),...Vx(`infix`,50,50,!1,`=`,`/=`,`<`,`>`,`\\in`,`\\notin`,`\\leq`,`\\geq`,`\\subseteq`,`\\subset`,`\\supseteq`,`\\supset`,`\\sqsubseteq`,`\\sqsubset`,`\\sqsupseteq`,`\\sqsupset`,`\\prec`,`\\preceq`,`\\succ`,`\\succeq`,`\\sim`,`\\simeq`,`\\approx`,`\\cong`,`\\asymp`,`\\doteq`,`\\propto`,`\\ll`,`\\gg`,`|-`,`|=`,`-|`,`=|`,`:=`,`::=`),...Vx(`infix`,30,30,!0,`\\land`,`\\lor`),...Vx(`infix`,20,20,!1,`~>`,`\\equiv`,`-+->`),...Vx(`infix`,10,10,!1,`=>`)]),Ux=new Map([...Hx,...oc.flatMap(e=>e.slice(1).map(t=>[t,Hx.get(e[0])]))]),Wx=Ux.get(`[`),Gx={name:`$$_void`,low:0,high:0,isLeftAssociative:!1,fix:`infix`},Kx=e=>({type:`tokens`,kinds:new Set(e)}),qx=e=>typeof e==`string`?e.startsWith(`<`)?Kx([A(e.slice(1,-1))]):{type:`call`,name:e}:e,G=(...e)=>({type:`sequence`,units:e.map(qx)}),K=(...e)=>({type:`choice`,alternatives:e.map(e=>typeof e!=`string`&&e.type===`sequence`?e:G(e))}),Jx=e=>(...t)=>({type:e,body:G(...t)}),q=Jx(`zeroOrMore`),Yx=Jx(`oneOrMore`),J=Jx(`optional`),Y=e=>({type:`action`,run:t=>e(t)??void 0}),X=e=>Y(t=>{t.expecting=e}),Z=e=>({type:`lookahead`,amount:e.amount??(e.expansion?2147483647:0),expansion:e.expansion&&G(...e.expansion),semantic:e.semantic}),Xx=(e,t)=>(t.next===void 0&&(t.next=e.readToken()),t.next),Zx=(e,t)=>{let n=e.isLookingAhead?e.scanPosition:e.token;for(let r=0;r<t;r++)n=Xx(e,n);return n},Qx=(...e)=>{let t=e.map(A);return e=>t.includes(Zx(e,1).kind)},$x=(e,t=Zx(e,1).beginColumn)=>{let n=e.junctions.at(-1);return n===void 0||n.column<t},eS=e=>{let t=Zx(e,1),n=e.junctions.at(-1);return n?.column===t.beginColumn&&n.kind===t.kind},tS=e=>Qx(`CASESEP`)(e)&&$x(e),nS=e=>{let t=Zx(e,1);Bx.has(t.kind)&&(t.kind=Px)},rS=(e,t,n=t)=>`line ${t.beginLine}, col ${t.beginColumn} to line ${n.beginLine}, col ${n.beginColumn+n.image.length-1} of module ${e.moduleName}`,iS=(e,t)=>({kind:e,heirs:t,first:t[0].first,last:t[t.length-1].last}),aS=(e,t)=>{let n=e.frames[e.frames.length-1].heirs;return n[n.length-t]},oS=e=>e.operatorStacks[e.operatorStacks.length-1],sS=(e,t)=>e.low>t.high,cS=(e,t)=>e.high<t.low,lS=e=>e.fix===`prefix`?e:Ux.get(`${e.name}.`),uS=(e,t)=>{let n=e[t-2].node,r=e[t-1];e.splice(t-2,2,{node:r.operator===Wx?iS(`FcnAppl`,[n,...r.node.heirs]):iS(`PostfixExpr`,[n,r.node]),operator:void 0})},dS=(e,t)=>{let n=e.length-1;if(t.fix!==`infix`&&t.fix!==`nfix`){e.splice(n-2,2,{node:iS(`PrefixExpr`,[e[n-2].node,e[n-1].node]),operator:void 0});return}let r=e[n-3].node,i=t.fix===`nfix`;e.splice(n-3,3,{node:iS(i?`Times`:`InfixExpr`,[...i&&r.kind===`Times`?r.heirs:[r],e[n-2].node,e[n-1].node]),operator:void 0})},fS=e=>{let t=oS(e),n=t.length-1,r=t[n],i=t[n-1],a=t[n-2];if(r.operator===void 0||r.operator.fix===`prefix`)return;if(i.operator?.fix===`postfix`)return uS(t,n),fS(e);if(i.operator!==void 0){let t=lS(r.operator);return t!==void 0&&sS(i.operator,t)?`\n Precedence conflict between ops ${i.operator.name} in block ${rS(e,i.node.first,i.node.last)} and ${t.name}.`:void 0}if(a===void 0)return;if(a.operator===void 0)return`Expression at location ${rS(e,a.node.first,a.node.last)} and expression at location ${rS(e,i.node.first,i.node.last)} follow each other without any intervening operator.`;if(r.operator.fix===`postfix`)return cS(a.operator,r.operator)?void 0:sS(a.operator,r.operator)?(dS(t,a.operator),fS(e)):`Precedence conflict between ops ${a.operator.name} in block ${rS(e,r.node.first,r.node.last)} and ${r.operator.name}.`;let o=lS(a.operator),s=o!==void 0&&(n===2||t[n-3].operator!==void 0)?o:a.operator;if(cS(s,r.operator))return;if(!sS(s,r.operator)&&!(s===r.operator&&s.isLeftAssociative))return`\n Precedence conflict between ops ${s.name} in block ${rS(e,a.node.first,a.node.last)} and ${r.operator.name}.`;if(s.fix!==`postfix`)return dS(t,s),fS(e);let c=rS(e,a.node.first,a.node.last);return a.node.first.beginLine<i.node.first.beginLine&&r.operator.name===`=`?`\n *** Hint *** You may have mistyped ==\n Illegal combination of operators ${s.name} in block ${c} and =.`:r.operator===Gx?`\n Error following expression at ${c}, missing operator or separator.`:`\n Illegal combination of operators ${s.name} in block ${c} and ${r.operator.name}.`},pS=e=>Y(t=>{let n=oS(t),r=aS(t,1);if(!e(r))n.push({node:r,operator:void 0});else return n.push({node:r,operator:t.lastOperator}),n.length===1?void 0:fS(t)}),mS=pS(()=>!1),hS=pS(()=>!0),gS=Y(e=>{e.lastOperator=Ux.get(e.token.image)}),_S=e=>{let t=e[e.length-1],n=t.kind===`BangExt`?t.heirs[t.heirs.length-1]:t;return n.kind===`OpArgs`?n:void 0},vS=e=>{if(e.kind===`GeneralId`)return!0;let t=e.kind===`OpApplication`&&e.heirs.length===2?_S(e.heirs):void 0;return t!==void 0&&t.heirs.every((e,t)=>t%2==0||e.kind===`GeneralId`)},yS=(e,t)=>{for(let n of t.heirs){if(n.kind===`Junctions`)continue;if(!$x(e,n.first.beginColumn))return n;let t=yS(e,n);if(t!==void 0)return t}},bS=e=>{let t=[`EOF`,`THEOREM`,`PROPOSITION`,`ASSUMPTION`,`END_MODULE`].map(A),n=(e,...t)=>t.some(t=>e.kind===A(t)),r=e=>e!==void 0&&Lx.has(e.kind),i=e.token,a=Xx(e,i);i.next=void 0;let o=Xx(e,a);for(a.next=i;!t.includes(o.kind)&&!n(a,`THEOREM`,`PROPOSITION`);){if(n(a,`DEF`)){let e=i;if(n(e,`RBR`,`RSB`)){let t=1;for(;e.next!==void 0&&(e=e.next,!(n(e,`LBR`,`LSB`)&&t===1));)n(e,`LBR`,`LSB`)&&t>1&&t--,n(e,`RBR`,`RSB`)&&t++;e.next===void 0?e=void 0:e.next.kind===Px&&(e=e.next)}else if(e.kind===Px){let t=e.next;!r(t)||zx.has(t.kind)||Rx.has(t.kind)&&t.next?.kind!==Px||(e=t.next?.kind===A(`SUBSTITUTE`)?i:Rx.has(t.kind)?t.next:t)}else r(e)&&(e=e.next);e!==void 0&&e.next?.kind!==Fx&&(e.next={kind:Fx,image:`Beginning of definition`,beginLine:e.beginLine,beginColumn:e.beginColumn,next:e.next});break}i=a,a=o,o=Xx(e,a),a.next=i}for(;i!==void 0;)a.next=o,o=a,a=i,i=a.next;a.next=o},xS=e=>{let t=Zx(e,1);if(t.kind===A(`LAB`)){let n=1;for(;n!==0;)if(t=Xx(e,t),t.kind===A(`LAB`)&&n++,t.kind===A(`RAB`)&&n--,t.kind===Nx)return!1;return Xx(e,t).kind===A(`IN`)}if(t.kind!==Px)return!1;for(t=Xx(e,t);t.kind===A(`COMMA`);){if(t=Xx(e,t),t.kind!==Px)return!1;t=Xx(e,t)}return t.kind===A(`IN`)},SS=e=>e.image[1]===`*`?-1:e.image[1]===`+`?-2:Number.parseInt(e.image.slice(1)),CS=e=>e.proofLevels.at(-1)??-1,wS=e=>{let t=Zx(e,1);return t.image.length<2?!1:t.image[1]===`*`?e.proofLevels.length===0:t.image[1]===`+`?!0:Qx(`ProofStepLexeme`,`BareLevelLexeme`,`UnnumberedStepLexeme`,`ProofStepDotLexeme`)(e)?e.proofLevels.length===0||CS(e)>=0&&SS(t)>CS(e):Qx(`BY`,`PROOF`,`OBVIOUS`,`OMITTED`)(e)},TS=(e,t)=>{let n=SS(t),r=e.proofLevels.length-1,i=e.proofLevels[r-1]??-1,a=e.proofLevels[r]<0;return a&&(e.proofLevels[r]=n<0?i+1:n),n===-1?!0:n===-2?a:a?n>i:e.proofLevels[r]===n},ES=e=>Y(t=>TS(t,t.token)?void 0:`${rS(t,t.token)}: ${e}`),DS=Kx([`op_26`,`op_29`,`op_58`,`CASESEP`,`op_61`,`op_112`,`op_113`,`op_114`,`op_115`,`op_116`].map(A)),OS=Kx([...DS.kinds,A(`op_76`)]),kS=Kx(Rx),AS=Kx(zx),jS=Kx([`ProofStepLexeme`,`ProofImplicitStepLexeme`,`ProofStepDotLexeme`,`BareLevelLexeme`,`UnnumberedStepLexeme`].map(A)),MS=()=>q(Z({expansion:[K(DS,`<op_77>`)],semantic:$x}),K(`PrefixOp`,`InfixOp`),hS),NS=()=>K(G(Z({expansion:[`OpenStart`],semantic:$x}),`OpenExpression`,mS),G(Z({semantic:$x}),`ExtendableExpr`)),PS=()=>K(G(`<MODULE>`,X(`identifier`),`Identifier`),`Expression`),FS=()=>K(G(Z({semantic:e=>Qx(`ASSUME`,`BOXASSUME`)(e)||Zx(e,2).kind===A(`COLONCOLON`)&&[A(`ASSUME`),A(`BOXASSUME`)].includes(Zx(e,3).kind)}),`AssumeProve`),`NewSymb`,`Expression`),IS=()=>[`JuncItem`,q(Z({semantic:eS}),`JuncItem`)],LS=e=>Y(t=>{t.expecting=e,nS(t)}),RS=e=>Y(t=>{t.isTerminalProof=e}),zS=(e,...t)=>G(...t.slice(0,-1),X(`==`),`<DEF>`,Y(t=>{bS(t),t.expecting=e}),t[t.length-1]),Q=(e,t,n)=>({message:e,body:G(...t),exit:n}),BS={CompilationUnit:Q(void 0,[Y(bS),J(`Prelude`),`Module`]),Prelude:Q(void 0,[`<BEGIN_PRAGMA>`,q(K(`<NUMBER>`,`<IDENTIFIER>`))]),Module:Q(`Module definition`,[X(`---- MODULE`),`BeginModule`,X(`EXTENDS clause or module body`),`Extends`,X(`Module body`),`Body`,X(`==== or more Module body`),`EndModule`]),BeginModule:Q(`Begin module`,[X(`---- MODULE (beginning of module)`),K(`<_BM0>`,`<_BM1>`,`<_BM2>`),LS(`Identifier`),`Identifier`,Y(e=>{e.moduleName??=e.token.image,e.expecting=`----`}),`<SEPARATOR>`]),EndModule:Q(void 0,[`<END_MODULE>`]),Extends:Q(`Extends`,[J(`<EXTENDS>`,LS(`Identifier`),`Identifier`,X(`comma or module body`),q(`<COMMA>`,LS(`Identifier`),`Identifier`))]),Body:Q(`Module body`,[X(`LOCAL, INSTANCE, PROOF, ASSUMPTION, THEOREM, RECURSIVE, declaration, or definition`),q(K(`<SEPARATOR>`,`VariableDeclaration`,`ParamDeclaration`,G(Z({amount:2}),`OperatorOrFunctionDefinition`),`Recursive`,G(Z({amount:2}),`Instance`),G(Z({amount:2}),`Assumption`),G(Z({amount:2}),`Theorem`),G(Z({amount:1}),`Module`,Y(bS)),G(Z({semantic:e=>Qx(`USE`)(e)&&Zx(e,2).kind!==A(`ONLY`)||Qx(`HIDE`)(e)}),`UseOrHideOrBy`)))]),VariableDeclaration:Q(`variable declaration`,[`<VARIABLE>`,X(`Identifier`),`Identifier`,X(`comma or module body`),q(`<COMMA>`,X(`Identifier`),`Identifier`)]),ParamDeclaration:Q(`Parameter declaration`,[X(`CONSTANT`),`ParamSubDecl`,X(`Identifier, operator or _`),`ConstantDeclarationItems`,X(`,`),q(`<COMMA>`,X(`Identifier, operator or _`),`ConstantDeclarationItems`)]),ParamSubDecl:Q(`Parameter declaration item`,[`<CONSTANT>`]),Recursive:Q(`Recursive`,[X(`RECURSIVE`),`<RECURSIVE>`,X(`Identifier, operator or _`),`ConstantDeclarationItems`,X(`,`),q(`<COMMA>`,X(`Identifier, operator or _`),`ConstantDeclarationItems`,X("`,' or `)'"))]),ConstantDeclarationItems:Q(`Constant declaration items`,[X(`Identifier, _ or prefix op`),K(G(`Identifier`,X(`(, comma, or Module Body`),J(Z({amount:2}),`<LBR>`,X(`_`),`<US>`,X(`comma or )`),q(`<COMMA>`,X(`_`),`<US>`,X(`comma or )`)),`<RBR>`)),G(`NonExpPrefixOp`,X(`_`),`<US>`),G(`<US>`,X(`prefix or postfix operator`),K(G(`InfixOp`,X(`_`),`<US>`),`PostfixOp`)))]),OperatorOrFunctionDefinition:Q(`Definition`,[X(`LOCAL, Identifier or Operator Symbol`),J(`<LOCAL>`),`<DEFBREAK>`,X(`LOCAL, Identifier or Operator Symbol`),K(zS(`Expression`,Z({expansion:[`<IDENTIFIER>`,`<LSB>`]}),`Identifier`,X(`[`),`<LSB>`,X(`Identifier`),`QuantBound`,X(`COMMA or ]`),q(`<COMMA>`,X(`Identifier`),`QuantBound`),`<RSB>`,`Expression`),zS(`Expression`,Z({expansion:[`<IDENTIFIER>`,AS]}),`PostfixLHS`,`Expression`),zS(`Expression`,Z({expansion:[`<IDENTIFIER>`,kS]}),`InfixLHS`,`Expression`),zS(`Expression or Instance`,Z({expansion:[`<IDENTIFIER>`,K(`<LBR>`,`<DEF>`)]}),`IdentLHS`,K(`Expression`,`Instantiation`)),zS(`Expression`,`PrefixLHS`,`Expression`))]),IdentifierTuple:Q(`Identifier tuple`,[`<LAB>`,X(`Identifier or >>`),J(`Identifier`,X(`COMMA or >>`),q(`<COMMA>`,X(`COMMA or >>`),`Identifier`,X(`COMMA or >>`))),`<RAB>`]),IdentLHS:Q(`Identifier LHS`,[`Identifier`,X(`( or ==`),J(`<LBR>`,X(`Identifier Declaration, prefix op, _ or )`),K(`IdentDecl`,`SomeFixDecl`),X(`COMMA or )`),q(`<COMMA>`,X(`Identifier Declaration, prefix op or _`),K(`IdentDecl`,`SomeFixDecl`),X(`COMMA or )`)),`<RBR>`)]),PrefixLHS:Q(`Prefix LHS`,[OS,X(`Identifier`),`Identifier`]),InfixLHS:Q(`Infix LHS`,[`Identifier`,kS,`Identifier`]),PostfixLHS:Q(`Postfix LHS`,[`Identifier`,AS]),IdentDecl:Q(`Identifier Declation`,[`Identifier`,X(`( or ...`),J(`<LBR>`,X(`_`),`<US>`,X(`COMMA or )`),q(`<COMMA>`,X(`_`),`<US>`,X(`COMMA or )`)),`<RBR>`)]),SomeFixDecl:Q(`Op. Symbol Declaration`,[K(G(`NonExpPrefixOp`,X(`_`),`<US>`),G(`<US>`,X(`infix or postfix operator`),K(G(`InfixOp`,X(`_`),`<US>`),`PostfixOp`)))]),Instance:Q(`Instance`,[X(`LOCAL or instance`),J(`<LOCAL>`),`Instantiation`,X(`COMMA or Module Body`)]),Instantiation:Q(`NonLocalInstance`,[`<INSTANCE>`,LS(`Module identifier`),`Identifier`,X(`WITH or another definition.`),J(`<WITH>`,X(``),`Substitution`,X(``),q(Z({amount:3}),`<COMMA>`,X(``),`Substitution`,X(``)))]),Substitution:Q(`Substitution`,[K(`Identifier`,`NonExpPrefixOp`,`InfixOp`,`PostfixOp`),X(`<-`),`<SUBSTITUTE>`,X(`Expression or Op. Symbol`),`OpOrExpr`]),PrefixOp:Q(void 0,[DS,gS]),NonExpPrefixOp:Q(void 0,[OS,gS]),InfixOp:Q(`Infix Op`,[kS,gS]),PostfixOp:Q(void 0,[AS,gS]),Identifier:Q(void 0,[`<IDENTIFIER>`]),Assumption:Q(`Assumption`,[X(`ASSUM...`),K(`<ASSUMPTION>`,`<ASSUME>`),J(Z({amount:2}),J(`<DEFBREAK>`),`Identifier`,X(`==`),`<DEF>`),Y(e=>{bS(e),e.expecting=`Expression`}),`Expression`]),AssumeProve:Q(`Assume-Prove`,[K(G(`Identifier`,`<COLONCOLON>`,`AssumeProve`),G(K(`<ASSUME>`,`<BOXASSUME>`),X(`Expression, Declaration, or AssumeProve`),FS(),X("PROVE or `,'"),q(`<COMMA>`,X(`Expression, Declaration, or AssumeProve`),FS(),X("PROVE or `,'")),K(`<PROVE>`,`<BOXPROVE>`),X(`Expression`),`Expression`))]),NewSymb:Q(`NEW symbol declaration`,[X(`NEW, CONSTANT, VARIABLE, STATE, ACTION, or TEMPORAL`),K(G(Z({amount:2}),K(G(Z({amount:2}),`<NEW>`,`<CONSTANT>`),`<NEW>`,`<CONSTANT>`),X(`Constant declaration`),K(G(Z({amount:2}),`IdentDecl`,J(`<IN>`,Y(e=>{let t=aS(e,2);return t.heirs.length>1?`declared symbol with arguments before \\in at ${rS(e,t.first,t.last)}`:void 0}),X(`Expression`),`Expression`)),`SomeFixDecl`)),G(Z({amount:2}),J(`<NEW>`),`<VARIABLE>`,X(`Identifier`),`Identifier`),G(Z({amount:2}),J(`<NEW>`),K(`<STATE>`,`<ACTION>`,`<TEMPORAL>`),X(`Declaration`),K(`IdentDecl`,`SomeFixDecl`)))]),MaybeBound:Q(`Domain binding`,[J(`<IN>`,X(`Expression`),`Expression`)]),Theorem:Q(`Theorem`,[X(`THEOREM, PROPOSITION`),K(`<THEOREM>`,`<PROPOSITION>`),X(`Identifier, Assume-Prove or Expression`),J(Z({amount:2}),`Identifier`,X(`==`),`<DEF>`),Y(bS),K(G(Z({amount:3}),Z({semantic:Qx(`ASSUME`,`BOXASSUME`)}),`AssumeProve`),`Expression`),J(Z({semantic:wS}),`Proof`)]),Proof:Q(`Proof`,[Y(e=>{e.proofLevels.push(-1)}),K(G(Z({semantic:e=>Qx(`BY`)(e)||Zx(e,2).kind===A(`BY`)}),`UseOrHideOrBy`),G(Z({amount:2}),J(`<PROOF>`),K(`<OBVIOUS>`,`<OMITTED>`)),G(J(Z({amount:2}),`<PROOF>`),q(Z({semantic:e=>Zx(e,2).kind!==A(`QED`)}),`Step`,X(`a proof step`)),`QEDStep`)),Y(e=>{e.proofLevels.pop()})]),UseOrHideOrBy:Q(`UseOrHideOrBy`,[K(G(J(`<PROOF>`),`<BY>`,RS(!0),J(`<ONLY>`)),G(`<USE>`,RS(!1),J(`<ONLY>`)),G(`<HIDE>`,RS(!1))),X("an expression, `MODULE' or `DEF'"),J(PS(),q(`<COMMA>`,X(`MODULE or expression`),PS(),Y(e=>{e.expecting=e.isTerminalProof?`comma, DEF, or [.]`:`comma, DEF, or proof step`}))),J(`<DF>`,X(`MODULE or expression`),PS(),q(`<COMMA>`,X(`MODULE or expression`),PS(),Y(e=>{e.expecting=e.isTerminalProof?`comma or [.]`:`comma or proof step`}))),Y(e=>{e.isTerminalProof&&(e.expecting=`[.]`)})]),QEDStep:Q(`QED step`,[X(`Step number`),jS,ES(`QED step's number has bad level.`),X(`QED`),`<QED>`,J(Z({semantic:wS}),`Proof`)]),Step:Q(`Step`,[X(`Step number`),jS,ES(`step's number has bad level.`),X(`proof step`),K(G(Z({semantic:Qx(`USE`,`HIDE`)}),`UseOrHideOrBy`),G(Z({semantic:Qx(`INSTANCE`)}),`Instantiation`),G(Z({semantic:Qx(`DEFBREAK`,`DEFINE`)}),`DefStep`),`HaveStep`,`TakeStep`,`WitnessStep`,`PickStep`,`CaseStep`,`AssertStep`),J(Z({semantic:wS}),Y(e=>{let t=aS(e,1);return[`PickStep`,`CaseStep`,`AssertStep`].includes(t.kind)?void 0:`${rS(e,t.first,t.last)}: proof of step that does not take a proof.`}),`Proof`)]),DefStep:Q(`DefStep`,[J(`<DEFINE>`),Yx(Z({amount:2}),`OperatorOrFunctionDefinition`)]),HaveStep:Q(`HaveStep`,[`<HAVE>`,X(`expression`),`Expression`]),TakeStep:Q(`TakeStep`,[`<TAKE>`,X(`identifier`),K(G(Z({expansion:[K(G(`<IDENTIFIER>`,q(`<COMMA>`,`<IDENTIFIER>`),`<IN>`),`<LAB>`)]}),`QuantBound`,X(`comma or step`),q(`<COMMA>`,X(`identifier or tuple of identifiers`),`QuantBound`,X(`comma or proof step`))),G(`Identifier`,X(`comma or proof step`),q(`<COMMA>`,X(`identifier`),`Identifier`,X(`comma or proof step`))))]),WitnessStep:Q(`WitnessStep`,[`<WITNESS>`,X(`expression`),`Expression`,q(`<COMMA>`,X(`expression`),`Expression`,X(`comma or colon`))]),PickStep:Q(`PickStep`,[`<PICK>`,X(`identifier`),K(G(Z({expansion:[`<IDENTIFIER>`,q(`<COMMA>`,`<IDENTIFIER>`),`<COLON>`]}),`Identifier`,X(`comma, or colon`),q(`<COMMA>`,X(`identifier`),`Identifier`,X(`comma or colon`))),G(`QuantBound`,X(`comma or colon`),q(`<COMMA>`,X(`identifier or tuple of identifiers`),`QuantBound`,X(`comma or colon`)))),`<COLON>`,X(`expression`),`Expression`]),CaseStep:Q(`CaseStep`,[`<CASE>`,X(`expression`),`Expression`]),AssertStep:Q(`AssertStep`,[J(`<SUFFICES>`,X(`expression or ASSUME/PROVE`)),K(`Expression`,G(Z({semantic:Qx(`ASSUME`,`BOXASSUME`)}),`AssumeProve`))]),ParenthesesExpression:Q(void 0,[K(`ParenExpr`,`BraceCases`,`SBracketCases`,`TupleOrAction`,`FairnessExpr`)]),OpenExpression:Q(void 0,[K(`SomeQuant`,`SomeTQuant`,`IfThenElse`,`Case`,`LetIn`,`UnboundOrBoundChoose`)]),String:Q(`String`,[`<STRING_LITERAL>`]),Number:Q(void 0,[`<NUMBER_LITERAL>`,J(Z({amount:2}),`<DOT>`,`<NUMBER_LITERAL>`)]),OpArgs:Q(`Optional Arguments`,[`<LBR>`,`OpOrExpr`,q(`<COMMA>`,`OpOrExpr`),`<RBR>`]),OpOrExpr:Q(void 0,[K(G(Z({amount:2,expansion:[K(OS,kS,AS),Kx([`COMMA`,`RBR`,`DEFBREAK`,`LOCAL`,`INSTANCE`,`THEOREM`,`ASSUME`,`END_MODULE`,`SEPARATOR`,`_BM0`,`ASSUMPTION`,`CONSTANT`,`VARIABLE`,`RECURSIVE`].map(A))],semantic:$x}),K(`NonExpPrefixOp`,G(`InfixOp`,Y(e=>e.token.image===`\\X`||e.token.image===`\\times`?`${rS(e,e.token)}: \\X may not be used as an infix operator.`:void 0)),`PostfixOp`)),G(Z({expansion:[`<LAMBDA>`],semantic:$x}),`Lambda`),`Expression`)],e=>{e.node=e.heirs[0]}),ParenExpr:Q(void 0,[`<LBR>`,`Expression`,`<RBR>`]),SomeQuant:Q(`Quantified form`,[K(`<EXISTS>`,`<FORALL>`),K(G(Z({expansion:[`<IDENTIFIER>`,q(`<COMMA>`,`<IDENTIFIER>`),`<COLON>`]}),`Identifier`,q(`<COMMA>`,`Identifier`)),G(`QuantBound`,q(`<COMMA>`,`QuantBound`))),`<COLON>`,`Expression`]),SomeTQuant:Q(`Bound Quantified Expression`,[K(`<T_EXISTS>`,`<T_FORALL>`),`Identifier`,q(`<COMMA>`,`Identifier`),`<COLON>`,`Expression`]),QuantBound:Q(`Quant Bound`,[K(`IdentifierTuple`,G(`Identifier`,q(`<COMMA>`,`Identifier`,X(`, or \\in`)))),`<IN>`,`Expression`]),BraceCases:Q(`Some { } form`,[`<LBC>`,J(K(G(Z({semantic:xS}),K(`IdentifierTuple`,`Identifier`),X(`\\in`),`<IN>`,`Expression`,X(`':', ',' or '}'`),J(K(G(`<COLON>`,`Expression`),Yx(`<COMMA>`,`Expression`)))),G(Z({expansion:[K(`IdentifierTuple`,`<IDENTIFIER>`),`<COMMA>`]}),`Expression`,q(`<COMMA>`,`Expression`)),G(Z({expansion:[K(`IdentifierTuple`,`<IDENTIFIER>`),`<COLON>`]}),`Expression`,`<COLON>`,`QuantBound`,q(`<COMMA>`,`QuantBound`)),G(`Expression`,J(K(G(`<COLON>`,Y(e=>{let t=aS(e,2);return t.kind===`InfixExpr`&&t.heirs[1].first.image===`\\in`?`Form {a \\in b : c \\in d }, at line ${e.token.beginLine}, is not allowed`:void 0}),`QuantBound`,q(`<COMMA>`,`QuantBound`)),Yx(`<COMMA>`,`Expression`)))))),`<RBC>`]),SBracketCases:Q(`Some [] Form`,[`<LSB>`,K(G(Z({semantic:xS}),`QuantBound`,q(`<COMMA>`,`QuantBound`),`<MAPTO>`,`Expression`,`<RSB>`),G(Z({expansion:[`<IDENTIFIER>`,`<MAPTO>`]}),`FieldVal`,q(`<COMMA>`,`FieldVal`),`<RSB>`),G(Z({semantic:e=>Zx(e,2).kind===A(`MAPTO`)&&Bx.has(Zx(e,1).kind)}),Y(e=>{Zx(e,1).kind=Px}),`FieldVal`,q(`<COMMA>`,`FieldVal`),`<RSB>`),G(Z({expansion:[`<IDENTIFIER>`,`<COLON>`]}),`FieldSet`,q(`<COMMA>`,`FieldSet`),`<RSB>`),G(`Expression`,K(G(q(`<COMMA>`,`Expression`),`<RSB>`,Y(e=>{let t=e.frames[e.frames.length-1];t.node=iS(`FcnAppl`,t.heirs),e.lastOperator=Wx})),G(`<ARROW>`,`Expression`,`<RSB>`),G(`<EXCEPT>`,`ExceptSpec`,q(`<COMMA>`,`ExceptSpec`),`<RSB>`),G(`<ARSB>`,`ReducedExpression`))))]),FieldVal:Q(`Field Value`,[`Identifier`,`<MAPTO>`,`Expression`]),FieldSet:Q(`Field Set`,[`Identifier`,`<COLON>`,`Expression`]),ExceptSpec:Q(`Except Spec`,[`<BANG>`,Yx(`ExceptComponent`,X(`= or ,`)),`<EQUALS>`,`Expression`]),ExceptComponent:Q(`Except Component`,[K(G(`<DOT>`,Y(nS),`Identifier`,Y(e=>{e.token.image===`@`&&e.pushedErrors.push(`@ used in !.@`)})),G(`<LSB>`,`Expression`,q(`<COMMA>`,`Expression`),`<RSB>`))]),TupleOrAction:Q(`Some << -- >> or >>_ Form`,[`<LAB>`,J(`Expression`,q(`<COMMA>`,`Expression`)),K(`<RAB>`,G(`<ARAB>`,`ReducedExpression`))]),NoOpExtension:Q(void 0,[`Identifier`,J(Z({amount:2}),`OpArgs`),K(G(`<BANG>`,`NoOpExtension`),Y(e=>{e.isFairnessHooked=e.token.kind===A(`RBR`)}))]),ReducedExpression:Q(`restricted form of expression`,[K(`NoOpExtension`,`ParenExpr`,`BraceCases`,`SBracketCases`,`TupleOrAction`)]),FairnessExpr:Q(`Fairness Expression`,[Y(e=>{e.isFairnessHooked=!1,e.isFairnessParenthesized.push(!1)}),K(`<WF>`,`<SF>`),`ReducedExpression`,J(Z({amount:2}),`<LBR>`,`Expression`,`<RBR>`,Y(e=>{e.isFairnessParenthesized[e.isFairnessParenthesized.length-1]=!0}))],(e,t)=>t.isFairnessParenthesized.pop()||t.isFairnessHooked?void 0:`Ill-structured fairness expression at line ${e.heirs[0].first.beginLine}, column ${e.heirs[0].first.beginColumn}`),IfThenElse:Q(`IF THEN ELSE`,[`<IF>`,`Expression`,`<THEN>`,`Expression`,`<ELSE>`,`Expression`]),Case:Q(`CASE Expression`,[`<CASE>`,`CaseArm`,q(Z({semantic:e=>tS(e)&&Zx(e,2).kind!==A(`OTHER`)}),`<CASESEP>`,`CaseArm`),J(Z({semantic:tS}),`<CASESEP>`,`OtherArm`)]),CaseArm:Q(`Case Arm`,[`Expression`,`<ARROW>`,`Expression`]),OtherArm:Q(`Case Other Arm`,[`<OTHER>`,`<ARROW>`,`Expression`]),LetIn:Q(`Case Other Arm`,[`<LET>`,`LetDefinitions`,`<LETIN>`,`Expression`]),LetDefinitions:Q(`Let Definitions`,[Yx(K(`OperatorOrFunctionDefinition`,`Recursive`))]),Junctions:Q(`AND-OR Junction`,[Y(e=>{let t=Zx(e,1);e.junctions.push({kind:t.kind,column:t.beginColumn})}),K(G(Z({expansion:[`<OR>`]}),...IS()),G(Z({expansion:[`<AND>`]}),...IS())),Y(e=>{e.junctions.pop()})]),JuncItem:Q(`Junction Item`,[K(`<OR>`,`<AND>`),`Expression`],(e,t)=>{let n=yS(t,e.heirs[1]);return n&&`Item at ${rS(t,n.first,n.last)} is not properly indented inside conjunction or disjunction list item at ${rS(t,e.heirs[0].first,e.heirs[1].last)}`}),UnboundOrBoundChoose:Q(`(Un)Bounded Choose`,[`<CHOOSE>`,K(`Identifier`,`IdentifierTuple`),`MaybeBound`,`<COLON>`,`Expression`]),Lambda:Q(`Lambda`,[`<LAMBDA>`,X(`Identifier`),`Identifier`,X("`,' or `:'"),q(`<COMMA>`,X(`Identifier`),`Identifier`,X("`,' or `:'")),`<COLON>`,X(`Expression`),`Expression`]),Expression:Q(`Expression`,[Y(e=>{e.operatorStacks.push([])}),MS(),NS()],(e,t)=>{let n=oS(t);n.push({node:e.heirs[0],operator:Gx});let r=fS(t);return e.node=n[0].node,t.operatorStacks.pop(),r}),ExtendableExpr:Q(`ExtendableExpr`,[K(G(Z({expansion:[K(`<AND>`,`<OR>`)],semantic:e=>{let t=e.operatorStacks.at(-1)?.at(-1);return t===void 0||t.operator!==void 0&&t.operator.fix!==`postfix`}}),`Junctions`),`ParenthesesExpression`,`PrimitiveExp`),mS,q(K(G(Z({expansion:[`PostfixOp`],semantic:$x}),`PostfixOp`,hS),G(Z({expansion:[`<DOT>`],semantic:$x}),`<DOT>`,Y(nS),Z({semantic:$x}),`Identifier`,Y(e=>{let t=oS(e);t[t.length-1].operator!==void 0&&uS(t,t.length),t[t.length-1]={node:iS(`RecordComponent`,[t[t.length-1].node,aS(e,2),aS(e,1)]),operator:void 0}})),G(Z({expansion:[`<LSB>`],semantic:$x}),X(`function argument`),`SBracketCases`,pS(e=>e.kind===`FcnAppl`)))),J(K(G(Z({expansion:[`InfixOp`],semantic:$x}),`InfixOp`,hS,MS(),NS()),G(Z({expansion:[`<COLONCOLON>`],semantic:$x}),`<COLONCOLON>`,Y(e=>{let t=oS(e);if(!vS(t[t.length-1].node))return`\`::' at ${rS(e,e.token)} does not follow a label.`;t.pop()}),`Expression`,Y(e=>{let t=oS(e),n=aS(e,1),r=t.at(-1)?.operator;if((n.kind===`InfixExpr`||n.kind===`PostfixExpr`)&&r!==void 0&&e.lastOperator!==void 0&&!cS(r,e.lastOperator)){let t=aS(e,3);return`Removing label at ${rS(e,t.first,t.last)} would change expression parsing.`}t.push({node:iS(`Label`,[aS(e,3),aS(e,2),n]),operator:void 0})}))))]),PrimitiveExp:Q(`Primitive expression`,[K(G(Z({expansion:[`String`],semantic:$x}),`String`),G(Z({expansion:[`<NUMBER_LITERAL>`],semantic:$x}),`Number`),G(K(`Identifier`,G(K(`<ProofStepLexeme>`,`<ProofImplicitStepLexeme>`),Y(e=>CS(e)<0&&e.proofLevels.length<=1?`${rS(e,e.token)}: Step number used outside proof.`:e.token.image[1]===`+`?`${rS(e,e.token)}: <+> step number used in an expression.`:void 0)),`InfixOp`,`PostfixOp`,G(Z({expansion:[`<op_76>`]}),`NonExpPrefixOp`)),J(Z({amount:2}),`OpArgs`),q(`BangExt`)))],e=>{let t=e.heirs[0];e.node=t.kind===`String`||t.kind===`Number`?t:_S(e.heirs)===void 0?e.heirs.length===1?iS(`GeneralId`,e.heirs):void 0:iS(`OpApplication`,e.heirs)}),BangExt:Q(`Bang Extension`,[`<BANG>`,K(G(K(G(Z({expansion:[`Identifier`],semantic:e=>Zx(e,1).image!==`@`}),`Identifier`),`NonExpPrefixOp`,`InfixOp`,`PostfixOp`),J(Z({amount:2}),`OpArgs`)),`OpArgs`,`StructOp`)]),StructOp:Q(`StructOp`,[X("`<<' , `>>' , `:' , `@' , or number"),K(`<LAB>`,`<RAB>`,`<COLON>`,`Number`,G(Z({semantic:e=>Zx(e,1).image===`@`}),`<IDENTIFIER>`))],(e,t)=>{let n=e.heirs[0];return n.kind===`Number`&&n.heirs.length>1?`Illegal structural term at ${rS(t,n.first,n.last)}`:void 0}),OpenStart:Q(void 0,[K(`<CASE>`,`<CHOOSE>`,`<EXISTS>`,`<FORALL>`,`<IF>`,`<LET>`,`<T_EXISTS>`,`<T_FORALL>`)])},VS=/* @__PURE__ */ new Map,HS=e=>{let t=VS.get(e);if(t)return t;let n={first:/* @__PURE__ */ new Set,isNullable:!0,hasSemanticStart:!1},r=e=>{let t=HS(e);for(let e of t.first)n.first.add(e);return n.hasSemanticStart||=t.hasSemanticStart,t.isNullable};if(e.type===`tokens`)n.first=e.kinds,n.isNullable=!1;else if(e.type===`call`)Object.assign(n,HS(BS[e.name].body));else if(e.type===`lookahead`)n.hasSemanticStart=e.semantic!==void 0;else if(e.type===`sequence`){let t=e.units[0];n.hasSemanticStart=t?.type===`lookahead`&&t.semantic!==void 0,n.isNullable=e.units.every((e,t)=>t===0&&e.type===`lookahead`||r(e))}else e.type===`choice`?n.isNullable=e.alternatives.map(r).some(Boolean):e.type!==`action`&&(n.isNullable=r(e.body)||e.type!==`oneOrMore`);return VS.set(e,n),n},US=(e,t)=>{e.isLookingAhead=!0;let n=t(e);return e.isLookingAhead=!1,n},WS=(e,t)=>{if(e.scanPosition===e.lastPosition&&(e.remaining--,e.lastPosition=Xx(e,e.scanPosition)),e.scanPosition=Xx(e,e.scanPosition),e.isRescanning){let t=0,n=e.token;for(;n!==void 0&&n!==e.scanPosition;)t++,n=n.next;n!==void 0&&t<100&&(e.farthestRescan=Math.max(e.farthestRescan,t))}return t.has(e.scanPosition.kind)?e.remaining===0&&e.scanPosition===e.lastPosition?`done`:`matched`:`failed`},GS=(e,t)=>{if(t.type===`tokens`)return WS(e,t.kinds);if(t.type===`call`)return GS(e,BS[t.name].body);if(t.type===`action`)return`matched`;if(t.type===`lookahead`)return t.semantic===void 0||US(e,t.semantic)?`matched`:`failed`;if(t.type===`sequence`){for(let[n,r]of t.units.entries()){if(n===0&&r.type===`lookahead`)continue;let t=GS(e,r);if(t!==`matched`)return t}return`matched`}let n=e.scanPosition;if(t.type===`choice`){for(let r of t.alternatives){let t=r.units[0],i=t?.type!==`lookahead`||t.semantic===void 0||US(e,t.semantic)?GS(e,r):`failed`;if(i!==`failed`)return i;e.scanPosition=n}return`failed`}let r=GS(e,t.body);if(r===`failed`)return e.scanPosition=n,t.type===`oneOrMore`?`failed`:`matched`;if(r===`done`||t.type===`optional`)return r;for(;;){let n=e.scanPosition,r=GS(e,t.body);if(r===`done`)return r;if(r===`failed`)return e.scanPosition=n,`matched`}},KS=(e,t,n)=>{e.remaining=t,e.scanPosition=e.token,e.lastPosition=e.token;let r=GS(e,n)!==`failed`,i={generation:e.generation+t-e.remaining,first:e.token,amount:t},a=e.calls.get(n)??[],o=a.findIndex(t=>t.generation<=e.generation);return o===-1?a.push(i):a[o]=i,e.calls.set(n,a),r},qS=(e,t)=>t.findIndex(t=>{let n=t.units[0],r=n?.type===`lookahead`?n:void 0,i=r?.amount??1,a=r?.expansion??t,o=r?.semantic;return i===0||HS(a).isNullable?o===void 0||o(e):i===1&&o===void 0&&!HS(a).hasSemanticStart?HS(a).first.has(Zx(e,1).kind)?!0:(e.failedSwitchGeneration=e.generation,!1):KS(e,i,a)&&(o===void 0||o(e))}),JS=e=>{e.isRescanning=!0;for(let[t,n]of e.calls)for(let r of n.filter(t=>t.generation>e.generation))if(e.remaining=r.amount,e.scanPosition=r.first,e.lastPosition=r.first,GS(e,t)===`done`)break;e.isRescanning=!1;let t=Math.max(+(e.failedSwitchGeneration===e.generation),e.farthestRescan),n=[],r=Xx(e,e.token),i=r;for(let r=0;r<t;r++){if(i.kind===Nx){n.push(`<EOF>`);break}n.push(i.image),r<t-1&&(i=Xx(e,i))}return`Encountered "${n.join(` `)}" at line ${r.beginLine}, column ${r.beginColumn} and token "${$e(e.token.image)}" `},YS=(e,t)=>{let n=e.expecting===``?``:`Was expecting "${e.expecting}"\n`,r=e.messages.slice(-5).reverse().map(e=>`${e.name} starting at line ${e.token.beginLine}, column ${e.token.beginColumn}.\n`).join(``);return e.report=`${n}${t??JS(e)}\n\nResidual stack trace follows:\n${r}`,!1},XS=(e,t)=>{let n=Xx(e,e.token);return t.has(n.kind)?(e.token=n,e.generation++,e.frames[e.frames.length-1].heirs.push({kind:`token`,heirs:[],first:n,last:n}),!0):(e.failedSwitchGeneration=e.generation,YS(e))},ZS=(e,t)=>{let n=BS[t];n.message!==void 0&&(e.messages.push({name:n.message,token:Zx(e,1)}),e.expecting=``);let r={heirs:[],node:void 0};if(e.frames.push(r),!QS(e,n.body))return!1;e.frames.pop(),n.message!==void 0&&(e.messages.pop(),e.expecting=``);let i=n.exit?.(r,e);if(typeof i==`string`)return YS(e,i);let a=r.node??(r.heirs.length===0?void 0:iS(t,r.heirs));return a!==void 0&&e.frames.at(-1)?.heirs.push(a),!0},QS=(e,t)=>{if(t.type===`tokens`)return XS(e,t.kinds);if(t.type===`call`)return ZS(e,t.name);if(t.type===`action`){let n=t.run(e);return n===void 0||YS(e,n)}if(t.type===`lookahead`)return t.semantic===void 0||t.semantic(e)||YS(e);if(t.type===`sequence`)return t.units.every((t,n)=>n===0&&t.type===`lookahead`||QS(e,t));if(t.type===`choice`){let n=qS(e,t.alternatives);return n===-1?YS(e):QS(e,t.alternatives[n])}if(t.type===`oneOrMore`&&!QS(e,t.body))return!1;if(t.type===`optional`)return qS(e,[t.body])===-1||QS(e,t.body);for(;qS(e,[t.body])===0;)if(!QS(e,t.body))return!1;return!0},$S=e=>{let t=Ze(e),n={kind:Nx,image:``,beginLine:0,beginColumn:0,next:void 0},r={readToken:()=>{let e=t();return typeof e==`string`?(r.lexicalError??=e,{...n,next:void 0}):e},lexicalError:void 0,token:n,generation:0,failedSwitchGeneration:-1,scanPosition:n,lastPosition:n,remaining:0,isLookingAhead:!1,isRescanning:!1,farthestRescan:0,calls:/* @__PURE__ */ new Map,expecting:`nothing`,messages:[],pushedErrors:[],moduleName:void 0,junctions:[],frames:[],operatorStacks:[],lastOperator:void 0,proofLevels:[],isTerminalProof:!1,isFairnessHooked:!1,isFairnessParenthesized:[],report:void 0},i=QS(r,{type:`call`,name:`CompilationUnit`});if(r.lexicalError!==void 0)return r.lexicalError;let a=[...r.pushedErrors,...i||r.report===void 0?[]:[`***Parse Error***\n${r.report}`]];return a.length===0?void 0:a.join(`
1784
+ `)},eC={low:15,high:15},tC={low:16,high:16},$=(e,t,n)=>({low:e,high:t,isAssociative:n}),nC=new Map([[`=>`,$(1,1,!1)],[`<=>`,$(2,2,!1)],[`~>`,$(2,2,!1)],[`-+->`,$(2,2,!1)],[`/\\`,$(3,3,!0)],[`\\/`,$(3,3,!0)],...(/* @__PURE__ */ `=.#.<.>.<=.>=.\\in.\\notin.\\subseteq.\\subset.\\supseteq.\\supset.\\sqsubseteq.\\sqsupseteq.\\sqsubset.\\sqsupset.\\prec.\\preceq.\\succ.\\succeq.\\sim.\\simeq.\\approx.\\cong.\\asymp.\\doteq.\\propto.\\ll.\\gg.|-.-|.|=.=|.:=.::=`.split(`.`)).map(e=>[e,$(5,5,!1)]),[`\\cdot`,$(5,14,!0)],[`@@`,$(6,6,!0)],[`:>`,$(7,7,!1)],[`<:`,$(7,7,!1)],[`\\cup`,$(8,8,!0)],[`\\cap`,$(8,8,!0)],[`\\`,$(8,8,!1)],[`..`,$(9,9,!1)],[`...`,$(9,9,!1)],[`##`,$(9,13,!0)],[`$`,$(9,13,!0)],[`$$`,$(9,13,!0)],[`??`,$(9,13,!0)],[`!!`,$(9,13,!1)],[`\\sqcap`,$(9,13,!0)],[`\\sqcup`,$(9,13,!0)],[`\\uplus`,$(9,13,!0)],[`\\wr`,$(9,14,!1)],[`+`,$(10,10,!0)],[`++`,$(10,10,!0)],[`(+)`,$(10,10,!0)],[`\\oplus`,$(10,10,!0)],[`%`,$(10,11,!1)],[`%%`,$(10,11,!0)],[`|`,$(10,11,!0)],[`||`,$(10,11,!0)],[`\\X`,$(10,13,!1)],[`-`,$(11,11,!0)],[`--`,$(11,11,!0)],[`(-)`,$(11,11,!0)],[`\\ominus`,$(11,11,!0)],[`*`,$(13,13,!0)],[`**`,$(13,13,!0)],[`/`,$(13,13,!1)],[`//`,$(13,13,!1)],[`\\div`,$(13,13,!1)],[`\\o`,$(13,13,!0)],[`(.)`,$(13,13,!0)],[`\\odot`,$(13,13,!0)],[`(/)`,$(13,13,!1)],[`\\oslash`,$(13,13,!1)],[`(\\X)`,$(13,13,!0)],[`\\otimes`,$(13,13,!0)],[`&`,$(13,13,!0)],[`&&`,$(13,13,!0)],[`\\star`,$(13,13,!0)],[`\\bullet`,$(13,13,!0)],[`\\bigcirc`,$(13,13,!0)],[`^`,$(14,14,!1)],[`^^`,$(14,14,!1)]]),rC=(e,t)=>t.isAssociative||e===`%`||e===`\\X`,iC=/* @__PURE__ */ new Map([[`~`,{low:4,high:4}],[`[]`,{low:4,high:15}],[`<>`,{low:4,high:15}],[`ENABLED`,{low:4,high:15}],[`UNCHANGED`,{low:4,high:15}],[`SUBSET`,{low:8,high:8}],[`UNION`,{low:8,high:8}],[`DOMAIN`,{low:9,high:9}],[`-`,{low:12,high:12}],[`-.`,{low:12,high:12}]]),aC={low:17,high:17},oC=/* @__PURE__ */ new Set([`(`,`[`,`{`,`<<`,`@`,`\\A`,`\\E`,`\\AA`,`\\EE`,`IF`,`CASE`,`LET`,`CHOOSE`,`LAMBDA`,`WF_`,`SF_`]),sC=/* @__PURE__ */ new Set([`(`,`{`,`<<`]),cC=/* @__PURE__ */ new Set([`^+`,`^*`,`^#`]),lC=/* @__PURE__ */ new Set([...cC,`'`]),uC=/* @__PURE__ */ new Set([`-`,`~`,`-.`]),dC=/* @__PURE__ */ new Set([`-.`,`~`,`[]`,`<>`,`ENABLED`,`UNCHANGED`,`SUBSET`,`UNION`,`DOMAIN`]),fC=/* @__PURE__ */ new Set([`-`,`~`,`/\\`,`\\/`,`SUBSET`,`UNION`,`DOMAIN`,`ENABLED`,`UNCHANGED`,`[]`,`<>`]),pC=/* @__PURE__ */ new Set([`+`,`-`,`/`,`\\X`]),mC=/* @__PURE__ */ new Set([`SUBSET`,`UNION`,`DOMAIN`,`ENABLED`,`UNCHANGED`,`[]`,`<>`,...lC]),hC=/* @__PURE__ */ new Set([`<<`,`>>`,`:`,`@`,`(`]),gC=/* @__PURE__ */ new Set([`ASSUME`,`ASSUMPTION`,`AXIOM`,`CONSTANT`,`CONSTANTS`,`COROLLARY`,`INSTANCE`,`LEMMA`,`LOCAL`,`PROPOSITION`,`RECURSIVE`,`THEOREM`,`VARIABLE`,`VARIABLES`]),_C=/* @__PURE__ */ new Set([`THEOREM`,`LEMMA`,`COROLLARY`,`PROPOSITION`]),vC=/* @__PURE__ */ new Set([`BY`,`PROOF`,`OBVIOUS`,`OMITTED`]),yC=/* @__PURE__ */ new Set([`Qed`,`Pick`,`Case`,`Assert`]),bC=/* @__PURE__ */ new Set(/* @__PURE__ */ `, . _ ( ) [ ] { } << >> ]_ >>_ == ! @ : :: ; -> <- |-> \\A \\AA \\E \\EE \\forall \\exists WF_ SF_ (*{ }*)`.split(` `)),xC=/* @__PURE__ */ new Set([``,`*`,`-`]),SC={Obvious:`n OBVIOUS`,Omitted:`n OMITTED`,By:` BY`},CC=(e,t)=>e.line-t.line||e.column-t.column,wC=(e,t)=>({start:CC(e.start,t.start)<=0?e.start:t.start,stop:CC(e.stop,t.stop)>=0?e.stop:t.stop}),TC=e=>({start:{line:e.start.line,column:e.start.column},stop:{line:e.end.line,column:e.end.column+1}}),EC={printed:``,set:``},DC={printed:`
1785
+ `,set:``},OC={printed:`
1786
1786
  `,set:`
1787
- `},wC=(e,t,n,r=`Proof.Parser`)=>new s(e,void 0,{reason:`${e}${n.set}`,line:t.start.line,column:t.start.column,isEnd:!1,proof:{stop:t.stop,exception:r,printed:`${e}${n.printed}`}}),TC=/* @__PURE__ */ new Set([`CASE`,`CHOOSE`,`DOMAIN`,`ENABLED`,`IF`,`LAMBDA`,`LET`,`MODULE`,`SF_`,`SUBSET`,`UNCHANGED`,`UNION`,`WF_`]),EC=/* @__PURE__ */ new Map([[`CONSTANT`,`Constant`],[`CONSTANTS`,`Constant`],[`VARIABLE`,`Variable`],[`VARIABLES`,`Variable`],[`STATE`,`State`],[`ACTION`,`Action`],[`ACTIONS`,`Action`],[`TEMPORAL`,`Temporal`],[`TEMPORALS`,`Temporal`]]),DC=/* @__PURE__ */ new Set([`NEW`,...EC.keys()]),OC=/* @__PURE__ */ new Set([`(`,`[`,`{`,`<<`]),kC=/* @__PURE__ */ new Set([`)`,`]`,`}`,`>>`,`]_`,`>>_`]),AC=/* @__PURE__ */ new Set([`TRUE`,`FALSE`,`BOOLEAN`,`STRING`]),jC=e=>e.kind===`Prime`||e.kind===`Product`||(e.kind===`And`||e.kind===`Or`)&&!e.isBulleted||e.kind===`Apply`&&(e.args.length===2?ZS.has(e.operator):rC.has(e.operator)),MC=e=>(e.text===`/\\`||e.text===`\\/`)&&e.spelling!==`\\land`&&e.spelling!==`\\lor`,NC=e=>ZS.has(e)||rC.has(e)||e===`-.`,PC=(e,t,n)=>{switch(e){case`ENABLED`:return{kind:`Enabled`,expression:t,location:n};case`UNCHANGED`:return{kind:`Unchanged`,expression:t,location:n};case`[]`:return{kind:`Always`,expression:t,location:n};case`<>`:return{kind:`Eventually`,expression:t,location:n};case`'`:return{kind:`Prime`,expression:t,location:n};default:return{kind:`Apply`,operator:e,args:[t],location:n}}},FC=(e,t)=>{let n=RegExp(`^-{4,}\\s*MODULE\\s+${t}\\s*-{3,}$`),r=e.replace(/\r?\n$/,``).split(/\r?\n/),i=r.findIndex(e=>n.test(e));if(i===-1)return;let a=r.findIndex((e,t)=>t>i&&e.startsWith(`====`));return`${r.slice(i,a===-1?void 0:a+1).join(`
1788
- `)}\n`},IC=(e,t,n=Ee(e,t===`tlapm`))=>{let r=t===`tlapm`,i=r?n:n.map(xe),a=0,o=[],c,l,u=[],d=[],f,p=0,m=[],h=/* @__PURE__ */ new WeakMap,g=e=>u[u.length-1].has(e),_=e=>({line:e.line,column:r&&e.kind===`String`?e.endColumn:e.column,range:void 0}),v=[],y=[],ee=[],b=(e,t=a-1)=>{let n=e===t?ee[e]:void 0;if(n)return n;let r=i[t];v[e]??=_(i[e]),y[t]??={line:r.line,column:r.endColumn};let o={module:d[0].name,start:v[e],end:y[t]};return e===t&&(ee[e]=o),o},x=(e,t)=>(e.location.range=b(t),e),te=(e=0)=>i[Math.min(a+e,i.length-1)],S=(e=0)=>{let t=te(e),n=o[o.length-1];return n===void 0||n===-1||t.kind===`End`?t:t.column<=n?{...t,kind:`End`,text:``}:t},ne=e=>e.kind===`End`?`end of input`:JSON.stringify(e.text),C=e=>r&&(e.kind===`Keyword`||AC.has(e.text)),re=e=>{let t=i.findLast(t=>t.kind!==`End`&&(t.line<e.line||t.line===e.line&&t.column<e.column));return t?{line:t.line,column:t.endColumn+1}:e},w=e=>e.kind===`End`?`EOF`:/^-{4,}$/.test(e.text)?`----`:/^={4,}$/.test(e.text)?`====`:hC.has(e.text)||e.kind===`Number`||e.kind===`Decimal`?e.text:e.kind===`String`?JSON.stringify(e.text):e.kind===`Step`?e.text:C(e)?`keyword ${e.text}`:e.kind===`Identifier`?`identifier ${e.text}`:`operator ${e.text}`,T=(e,t=te(),n)=>{let r=i[i.length-1],a=t.line===r.line&&t.column===r.column,o=new s(`${e} at line ${t.line}, column ${t.column}`,void 0,ie(e,t,a,n));return f!==void 0&&h.set(o,f),o},ie=(e,t,n,a)=>{if(!r)return{reason:e,line:t.line,column:t.column,isEnd:n};let o=i[m[0]-1],s=a?`Unexpected ${w(a)}`:e;if(o)return{reason:s,line:o.line,column:o.endColumn+1,isEnd:n};let c=a?re(a):t;return{reason:s,line:c.line,column:c.column,isEnd:n}},ae=(e,t=te())=>T(e,t,t),oe=e=>{let t={cursor:a,frame:f,restorePoints:m.length,offsideColumns:o.length,recursiveScopes:u.length},n=++p;f=n;try{let n=e();return f=t.frame,n}catch(e){if(!(e instanceof s)||h.get(e)!==n)throw e;a=t.cursor,f=t.frame,m.length=t.restorePoints,o.length=t.offsideColumns,u.length=t.recursiveScopes;return}},se=e=>{let t=f;f=void 0;let n=e();return f=t,n},ce=e=>{m.push(a);let t=e();return m.pop(),t},le=e=>(e.kind===`Identifier`||e.kind===`Keyword`||e.kind===`Operator`&&e.text===`_`)&&!C(e),E=(e,t=0)=>{let n=S(t);return n.text===e&&n.kind!==`String`&&n.kind!==`End`},D=()=>{let e=S();if(e.kind===`End`)throw ae(`Unexpected end of expression`);return a++,e},O=e=>E(e)?(a++,!0):!1,k=e=>{if(!E(e))throw ae(`Expected ${JSON.stringify(e)} but found ${ne(S())}`);return D()},de=()=>{let e=S();if(e.kind!==`Identifier`)throw ae(`Expected an identifier but found ${ne(e)}`);if(C(e))throw ae(`Unexpected keyword ${e.text}`);return a++,e.text},fe=()=>{let e=a;return{name:de(),range:b(e)}},pe=e=>({names:e.map(e=>e.name),ranges:e.map(e=>e.range)}),me=()=>{let e=S();return e.kind!==`String`&&(oC.has(e.text)||ZS.has(e.text)||iC.has(e.text))?(a++,e.text):de()},he=!1,ge=()=>S().kind===`Identifier`||!le(S())?de():(he=!0,D().text),_e=e=>{if(!r)return e();o.push(-1);let t=e();return o.pop(),t},ve=(e,t=`,`)=>{let n=[e()];for(;O(t);)n.push(e());return n},ye=(e=0)=>{if(E(`<<`,e)){let t=e+1;for(;S(t).kind===`Identifier`||E(`,`,t);)t++;return E(`>>`,t)&&E(`\\in`,t+1)}let t=e;for(;S(t).kind===`Identifier`;){if(E(`\\in`,t+1))return!0;if(!E(`,`,t+1))return!1;t+=2}return!1},be=()=>{if(E(`::`))return!0;if(!E(`(`))return!1;let e=1;for(;S(e).kind===`Identifier`&&E(`,`,e+1);)e+=2;return S(e).kind===`Identifier`&&E(`)`,e+1)&&E(`::`,e+2)},Se=()=>{if(!O(`<<`)){let e=fe();return{kind:`Name`,name:e.name,ranges:[e.range]}}let e=pe(E(`>>`)?[]:ve(fe));return k(`>>`),{kind:`Tuple`,names:e.names,ranges:e.ranges}},Ce=()=>{let e=()=>{let e=ve(Se);k(`\\in`);let t=se(j);return e.map(e=>({pattern:e,set:t}))},t=[e()];for(;E(`,`)&&(!r||ye(1));)D(),t.push(e());return t.flat()},we=()=>{let e=S();if(r&&AC.has(e.text)){let t=a;D();let n={kind:`Identifier`,name:e.text,location:_(e)};return{subscript:x(n,t),lastArgs:[]}}let t=r&&(e.kind===`Number`||e.kind===`String`||E(`@`));if(e.kind===`Identifier`){let t=a,n=[],i=[],o=e=>(i.push(b(a,a)),n.push(de()),e&&E(`(`)?A():[]),s=[o(!r)];for(;E(`!`)&&S(1).kind===`Identifier`;)D(),s.push(o(!0));let c=s.slice(0,-1),l=_(e);l.range={...b(t),end:i[i.length-1].end};let u=n.join(`!`);return{subscript:c.every(e=>e.length===0)?{kind:`Identifier`,name:u,location:l}:{kind:`Apply`,operator:u,args:c.flat(),argumentCounts:[...c.map(e=>e.length),0],argumentsRange:l.range,selectorRanges:i,location:l},lastArgs:s[s.length-1]}}if(E(`<<`)||E(`(`)||E(`{`)||E(`[`)||t){let e=a,t=Be();return{subscript:t.location.range?t:x(t,e),lastArgs:[]}}throw ae(`Expected a subscript but found ${ne(e)}`)},Te=e=>{let t=S(1),n=S(2);return t.kind===`Identifier`&&n.text===`==`?!0:t.line===e.line?!1:t.text===`-.`||t.kind===`Identifier`&&(n.text===`(`||n.text===`[`||n.kind===`Operator`&&E(`==`,iC.has(n.text)?3:4))},De=e=>{let t=S(1);return t.kind===`End`||t.kind===`ModuleEnd`||t.kind===`Separator`||E(`,`,1)||E(`)`,1)||t.kind===`Keyword`&&dC.has(t.text)||Te(e)},Oe=()=>{let e=S(),t=e.kind===`Operator`&&(ZS.has(e.text)||aC.has(e.text))&&De(e);if(r&&e.kind!==`String`&&(aC.has(e.text)||lC.has(e.text)&&e.text!==`'`&&!rC.has(e.text)||cC.has(e.text)&&S(-1).text===`(`&&S(-1).line===e.line&&S(-1).endColumn+1===e.column&&S(1).text===`)`&&S(1).line===e.line&&S(1).column===e.endColumn+1)&&De(e))throw T(`incomplete expression`,e);if(t&&!r&&e.text===`\\X`&&e.spelling!==`×`)throw T(`\\X may not be used as an infix operator`,e);if(t)return a++,x({kind:`OperatorReference`,operator:e.text,spelling:e.spelling,location:_(e)},a-1);if(e.kind!==`String`&&lC.has(e.text)&&De(e)){a++;let t=_(e);if(rC.has(e.text))return x({kind:`OperatorReference`,operator:e.text,spelling:e.spelling,location:t},a-1);let n={kind:`Identifier`,name:`argument`,location:t};return x({kind:`Lambda`,params:[n.name],body:PC(e.text,n,t),operator:e.text,location:_(e)},a-1)}if(E(`LAMBDA`)){let t=a;D();let n=pe(ve(fe));k(`:`);let r=j();return x({kind:`Lambda`,params:n.names,paramRanges:n.ranges,body:r,location:_(e)},t)}if(!r)return j();let n=oe(j);if(n)return n;throw ae(`Unexpected ${ne(S())}`)},ke,A=()=>_e(()=>{let e=a;k(`(`);let t=ve(Oe);return k(`)`),ke=b(e),t}),Ae=()=>{let e=D();o.push(e.column);let t=[j()],n=()=>{for(;MC(te())&&te().text===e.text&&te().column===e.column;)a++,t.push(j())};return r?se(n):n(),o.pop(),{kind:e.text===`/\\`?`And`:`Or`,operands:t,isBulleted:!0,location:_(e)}},je=e=>_e(()=>{let t=_(e),n=S().kind===`Identifier`,i=E(`|->`,1)&&(n||le(S()));if(i||n&&E(`:`,1)){let e=i?`Record`:`RecordSet`,r=e=>{let t=a,n=_(S()),r=e();return n.range=b(t),k(i?`|->`:`:`),{name:r,value:j(),location:n}},o=[r(()=>n?de():D().text),...O(`,`)?ve(()=>r(de)):[]];return k(`]`),{kind:e,fields:o,location:t}}if(ye()){let e=a,n=Ce();if(!r||E(`|->`)){k(`|->`);let e=j();return k(`]`),{kind:`FunctionConstruction`,bounds:n,body:e,location:t}}a=e}let o=j();if(O(`->`)){let e=j();return k(`]`),{kind:`FunctionSet`,domain:o,range:e,location:t}}if(O(`EXCEPT`)){let e=ve(()=>{k(`!`);let e=[];for(;E(`.`)||E(`[`);)if(O(`.`)){if(!le(S()))throw ae(`Expected a field name but found ${ne(S())}`);if(!r&&E(`@`))throw ae(`@ used in !.@`);e.push({kind:`Field`,name:D().text})}else k(`[`),e.push({kind:`Index`,args:ve(()=>j())}),k(`]`);return k(`=`),{path:e,value:j()}});return k(`]`),{kind:`Except`,function:o,updates:e,location:t}}if(!r&&!E(`]_`)){let e=[o];for(;O(`,`);)e.push(j());return k(`]`),{kind:`Bracket`,args:e,location:t}}return k(`]_`),{kind:`BoxAction`,action:o,subscript:we().subscript,location:t}}),Me=()=>{let e=a,t=x(He(),e),n=_(D());return x({kind:`Apply`,operator:`\\in`,args:[t,se(j)],location:n},e)},Ne=e=>_e(()=>{let t=_(e);if(O(`}`))return{kind:`SetEnumeration`,elements:[],location:t};if(ye()&&(S(1).text===`\\in`||E(`<<`))){let e=a,n=Se();k(`\\in`);let r=se(j);if(O(`:`)){let e=se(j);return k(`}`),{kind:`SetFilter`,bound:{pattern:n,set:r},predicate:e,location:t}}a=e}let n=S().kind===`Identifier`&&E(`\\in`,1)?Me():j();if(O(`:`)){let e=Ce();return k(`}`),{kind:`SetMap`,expression:n,bounds:e,location:t}}let r=[n];for(;O(`,`);)r.push(j());return k(`}`),{kind:`SetEnumeration`,elements:r,location:t}}),Pe=e=>{let t=_(e),n=_e(()=>E(`>>`)||E(`>>_`)?[]:ve(()=>j()));if(O(`>>_`)){if(n.length!==1)throw T(`Expected a single action inside <<A>>_v`,e);return{kind:`AngleAction`,action:n[0],subscript:se(we).subscript,location:t}}return k(`>>`),{kind:`Tuple`,elements:n,location:t}},Fe=e=>{let t=_(e),n=e.text===`\\A`?`Forall`:`Exists`,r=e.text===`\\AA`||e.text===`\\EE`;if(!r&&ye()){let e=Ce();return k(`:`),{kind:n,bounds:e,body:j(),location:t}}let i=pe(ve(fe));return k(`:`),{kind:`UnboundedQuantifier`,quantifier:e.text===`\\A`||e.text===`\\AA`?`Forall`:`Exists`,names:i.names,nameRanges:i.ranges,body:j(),isTemporal:r,location:t}},Ie=e=>{let t=[];do{let n=a;if(O(`OTHER`))return k(`->`),{kind:`Case`,arms:t,other:j(),otherRange:b(n),location:_(e)};let r=j();k(`->`),t.push({condition:r,body:j()})}while(O(`[]`));return{kind:`Case`,arms:t,other:void 0,location:_(e)}},Le=()=>{let e=S(1);return E(`!`)&&(e.kind===`Identifier`||e.kind===`Number`||uC.has(e.text)||e.kind===`Operator`&&(ZS.has(e.text)||iC.has(e.text))||(e.kind===`Operator`||e.kind===`Keyword`)&&oC.has(e.text))},Re=()=>{let e=D();if(e.kind===`Number`)return{kind:`Operand`,operand:ue(e.text)};switch(e.text){case`<<`:case`>>`:return{kind:`Operand`,operand:e.text};case`:`:return{kind:`Colon`};case`@`:return{kind:`At`};case`(`:return a--,{kind:`Bound`,args:A()}}return{kind:`Name`,name:e.text,args:E(`(`)?A():[]}},ze=(e,t,n,r,i)=>{let o=[{kind:`Name`,name:e,args:t}],s=[b(r,r)],c=[n];for(;Le();){D();let e=a;ke=void 0;let t=Re();s.push(t.kind===`Bound`?b(e):b(e,e)),o.push(t),c.push(ke)}let l=o.flatMap(e=>e.kind===`Name`?[e.name]:[]),u=l.join(`!`),d=o.flatMap(e=>`args`in e?e.args:[]),f=o.map(e=>`args`in e?e.args.length:0);return l.length<o.length?{kind:`Subexpression`,selectors:o,selectorRanges:s,argumentRanges:c,location:i}:d.length===0?{kind:`Identifier`,name:u,selectorRanges:s,location:i}:{kind:`Apply`,operator:u,args:d,...f.slice(0,-1).some(e=>e>0)&&{argumentCounts:f},argumentsRange:c.at(-1)??b(r),selectorRanges:s,argumentRanges:c,location:i}},Be=e=>{let n=a,i=D(),o=_(i);if(r&&i.kind===`Keyword`&&i.text===`LAMBDA`){let e=ve(de);return k(`:`),{kind:`Lambda`,params:e,body:j(),location:o}}if(i.kind===`Number`)return{kind:`Number`,value:ue(i.text),text:i.text,location:o};if(i.kind===`Decimal`)return{kind:`Decimal`,text:i.text,location:o};if(i.kind===`String`)return{kind:`String`,value:i.text,location:o};let s=i.kind===`Step`&&St(i);if(!r&&s&&yt()<0&&vt.length<=1)throw T(`Step number used outside proof`,i);if(s&&i.text[1]===`+`)throw T(`<+> step number used in an expression`,i);if(i.kind===`Identifier`||s){let t=s?Ct(i)??i.text:i.text;if(be()){let a=pe(O(`(`)?ve(fe):[]);a.names.length>0&&k(`)`),k(`::`);let s=b(n),l=j();if(!r&&e!==void 0&&c!==void 0&&jC(l)&&e.high>=c.low)throw T(`Removing the label would change expression parsing`,i);return{kind:`Label`,name:t,params:a.names,paramRanges:a.ranges,head:s,body:l,location:o}}let a=E(`(`);if(t===`@`&&!a&&!Le())return{kind:`ExceptAt`,location:o};let l=a?A():[];return Le()?ze(t,l,a?ke:void 0,n,o):a?{kind:`Apply`,operator:t,args:l,argumentsRange:ke,location:o}:{kind:`Identifier`,name:t,location:o}}let l=i.kind===`Operator`&&(NC(i.text)||i.text===`'`&&!r);if(l&&E(`(`)){let e=A();return!r&&Le()?ze(i.text,e,ke,n,o):t===`tlc`&&i.text===`\\X`&&e.length===2?{kind:`Product`,factors:e,location:o}:i.text===`'`&&e.length===1?{kind:`Prime`,expression:e[0],location:o}:{kind:`Apply`,operator:i.text,spelling:i.spelling,args:e,argumentsRange:ke,location:o}}if(l&&!r)return Le()?ze(i.text,[],void 0,n,o):{kind:`Identifier`,name:i.text,spelling:i.spelling,location:o};switch(i.text){case`(`:{let e=_e(()=>j());return k(`)`),e}case`[`:return je(i);case`{`:return Ne(i);case`<<`:return Pe(i);case`@`:return{kind:`ExceptAt`,location:o};case`\\A`:case`\\E`:case`\\AA`:case`\\EE`:return Fe(i);case`IF`:{let e=j();k(`THEN`);let t=j();return k(`ELSE`),{kind:`If`,condition:e,consequent:t,alternative:j(),location:o}}case`CASE`:return Ie(i);case`LET`:{let e=[],t=[],n=[];for(u.push(/* @__PURE__ */ new Set);!O(`IN`);){if(r&&E(`RECURSIVE`))throw ae(`Unexpected keyword RECURSIVE`);if(O(`RECURSIVE`)){n.push(...M());continue}let i=lt(!r&&O(`LOCAL`));i.kind===`Instance`?t.push(i):e.push(i)}return u.pop(),{kind:`Let`,definitions:e,...t.length>0&&{instances:t},...n.length>0&&{recursive:n},body:j(),location:o}}case`CHOOSE`:{let e=Se(),t=O(`\\in`)?j():void 0;return k(`:`),{kind:`Choose`,pattern:e,set:t,body:j(),location:o}}case`WF_`:case`SF_`:{let e=we(),t=!E(`(`)&&e.lastArgs.length===1?e.lastArgs[0]:_e(()=>{k(`(`);let e=j();return k(`)`),e});return{kind:i.text===`WF_`?`WeakFairness`:`StrongFairness`,subscript:e.subscript,action:t,location:o}}}throw ae(`Unexpected ${ne(i)}`,i)},Ve=(e,t,n)=>{c=l={low:t,high:n};let r=j(n+1),i=S(),a=iC.has(i.text)?YS.high:ZS.get(i.text)?.high;if(i.kind===`Operator`&&a!==void 0&&a>=t)throw T(`Precedence conflict between ${e.text} and ${i.text}`,i);return r},He=()=>{let e=l;l=void 0;let t=S(),n=_(t);if(t.kind===`Operator`&&MC(t))return Ae();if(t.kind===`Operator`||t.kind===`Keyword`)switch(t.text){case`~`:return D(),{kind:`Apply`,operator:`~`,args:[Ve(t,4,4)],location:n};case`-`:return D(),{kind:`Apply`,operator:`-.`,args:[Ve(t,12,12)],location:n};case`[]`:case`<>`:case`ENABLED`:case`UNCHANGED`:return D(),PC(t.text,Ve(t,4,15),n);case`SUBSET`:case`UNION`:case`DOMAIN`:return D(),{kind:`Apply`,operator:t.text,args:[Ve(t,10,13)],location:n}}return Be(e)},Ue=(e,t,n,r,i)=>{let a=_(e);if(e.text===`/\\`||e.text===`\\/`){let o=e.text===`/\\`?`And`:`Or`;return t.kind===o&&r?{...t,operands:[...t.operands,n],prefixEnds:[...t.prefixEnds??[],i]}:{kind:o,operands:[t,n],prefixEnds:[i],location:a}}return e.text===`\\X`?t.kind===`Product`&&r?{...t,factors:[...t.factors,n]}:{kind:`Product`,factors:[t,n],location:a}:{kind:`Apply`,operator:e.text,spelling:e.spelling,args:[t,n],location:a}},We=(e,t)=>e.text===`'`?{kind:`Prime`,expression:t,location:_(e)}:{kind:`Apply`,operator:e.text,spelling:e.spelling,args:[t],location:_(e)},Ge=()=>{D();let e=_e(()=>ve(()=>j()));return _e(()=>k(`]`)),e},Ke=e=>{let t=a,n=He(),r=n.location.range?n:x(n,t),i;for(;;){let n=S();if(n.kind!==`Operator`)break;let a=_(n);if(iC.has(n.text)&&e<=15){D(),c=YS,r=x(We(n,r),t);continue}if(n.text===`[`){let e=Ge();c=XS,r=x({kind:`FunctionApplication`,function:r,args:e,location:a},t);continue}if(n.text===`.`&&le(S(1))){D();let e=D().text;r=x({kind:`FieldAccess`,record:r,field:e,location:a},t);continue}let o=ZS.get(n.text);if(!o||o.low<e)break;if(i){let e=!(i.low>o.high||i.high<o.low),t=i.text===n.text&&o.isAssociative;if(e&&!t&&(i.text!==`\\X`||n.text!==`\\X`))throw T(`Precedence conflict between ${i.text} and ${n.text}`,n)}if(D(),o.low>12&&E(`-`))throw T(`Precedence conflict between ${n.text} and -`,S());c=l=o;let s=j(o.high+1),u=i?.text===n.text;r=x(Ue(n,r,s,u,b(t).end),t),i={...o,text:n.text}}return r},qe=e=>e.kind===`Number`||e.kind===`Decimal`||e.kind===`String`||e.kind===`Identifier`||e.kind===`Step`&&St(e)&&/^<\d/.test(e.text)||(e.kind===`Operator`||e.kind===`Keyword`)&&tC.has(e.text),Je=(e,t)=>({start:t,end:a-1,expression:e.location.range?e:x(e,t)}),Ye=(e,t,n,r)=>({...n,start:e,end:a-1,fixity:t,isLeft:!1,apply:r}),Xe=e=>e.kind===`Operator`&&iC.has(e.text)&&E(`(`,1)?oe(()=>_e(()=>{D(),D();let t=j(),n=a-1;return k(`)`),{end:n,expression:We(e,t)}})):void 0,Ze=()=>{let e=0;for(let t=a+1;t<i.length;t++){let n=i[t];if(n.kind===`Operator`){if(e===1&&n.text===`,`)return!0;if(i[t-1].text!==`!`&&(OC.has(n.text)&&e++,kC.has(n.text)&&--e===0))return!1}}return!1},Qe=e=>E(`(`,1)&&Ze()?oe(()=>_e(()=>{D(),D();let t=j();k(`,`);let n=j();return k(`)`),{kind:`Apply`,operator:e.text,args:[t,n],location:_(e)}})):void 0,$e=e=>{let t=a,n=S(),r=_(n),i=n.kind===`Operator`||n.kind===`Keyword`,o=i?ZS.get(n.text):void 0;if(!e){if(E(`[`)){let e=Ge();return Ye(t,`Postfix`,eC,t=>({kind:`FunctionApplication`,function:t[0].expression,args:e,location:r}))}if(E(`.`)&&le(S(1))){D();let e=D().text;return Ye(t,`Postfix`,eC,t=>({kind:`FieldAccess`,record:t[0].expression,field:e,location:r}))}if(o){if(Qe(n)){a=t;return}return D(),{...Ye(t,`Infix`,o,e=>Ue(n,e[0].expression,e[1].expression,e[0].joinedBy===n.text,b(e[0].start,e[1].end).end)),isLeft:QS(n.text,o),joins:n.text}}if(n.kind!==`Operator`||!iC.has(n.text))return;if(Xe(n)){a=t;return}return D(),Ye(t,`Postfix`,YS,e=>We(n,e[0].expression))}if(n.kind===`Operator`&&MC(n))return Je(Ae(),t);let s=o?Qe(n):void 0;if(s)return Je(s,t);let c=Xe(n);if(c)return c.expression.location.range=b(t,c.end),{start:t,end:c.end,expression:c.expression};let l=i?$S.get(n.text):void 0;if(l)return D(),Ye(t,`Prefix`,l,e=>PC(n.text===`-`?`-.`:n.text,e[0].expression,r));if(!qe(n))return;let u=n.kind===`Operator`&&nC.has(n.text);return Je(u?Be():se(Be),t)},et=e=>e!==void 0&&`fixity`in e,tt=e=>e!==void 0&&!(`fixity`in e),nt=(e,t)=>{let n=Math.min(e.start,t[0].start),r=Math.max(e.end,t[t.length-1].end),i=e.apply(t);return i.location.range=b(n,r),{start:n,end:r,expression:i,joinedBy:e.joins}},rt=e=>{let t=e.pop(),n=e.pop();if(!tt(t)||!et(n))throw T(`incomplete expression`);let r=n.fixity===`Infix`?e.pop():void 0;e.push(nt(n,tt(r)?[r,t]:[t]))},it=e=>{let t=e[e.length-2];return et(t)?t:void 0},at=(e,t)=>t!==void 0&&e.high<t.low,ot=()=>ce(()=>{let e=oe(()=>$e(!0));if(e===void 0){let e=te();throw e.kind===`End`?ae(`Unexpected end of expression`,e):T(`required expressions(s) missing before '${w(e)}'`,e)}return se(()=>{let t=[e];for(;;){let e=oe(()=>$e(et(t[t.length-1])));if(e===void 0)break;if(tt(e)||e.fixity===`Prefix`){t.push(e);continue}for(;at(e,it(t));)rt(t);let n=t[t.length-1];if(e.fixity===`Postfix`&&tt(n)){t.splice(-1,1,nt(e,[n]));continue}let r=it(t);r?.fixity===`Infix`&&r.isLeft&&e.isLeft&&!at(r,e)&&rt(t),t.push(e)}for(;t.length>1;)rt(t);let n=t[0];if(!tt(n))throw T(`incomplete expression`);return n.expression})}),j=(e=0)=>r?ot():Ke(e),st=()=>{if(!O(`(`))return[];let e=ht();return k(`)`),e},ct=()=>{let e=_(S()),t=j(),n=i[a-1],r={line:n.line,column:n.endColumn};return{body:t,bodyRange:{module:d[0].name,start:e,end:r}}},lt=e=>{let t=a;return x(dt(e),t)},ut=e=>({name:e.name,arity:0,location:{line:e.range.start.line,column:e.range.start.column,range:e.range}}),dt=e=>{let t=S(),n=a,r=_(t),i=(t,i)=>({kind:`Operator`,name:t,params:i,head:b(n,a-2),...ct(),isLocal:e,isRecursive:g(t),location:r});if(t.kind===`Identifier`&&S(1).kind===`Operator`&&ZS.has(S(1).text)&&S(2).kind===`Identifier`&&E(`==`,3)){let e=fe(),t=D().text,n=fe();return k(`==`),i(t,[ut(e),ut(n)])}let o=t.kind!==`String`&&oC.has(t.text),s=t.kind===`Identifier`&&iC.has(S(1).text)&&E(`==`,2);if(o||s){let e=o?t.text:S(1).text;o&&D();let n=fe();return s&&D(),k(`==`),i(e,[ut(n)])}let c=de();if(O(`[`)){let t=_e(()=>Ce());return k(`]`),k(`==`),{kind:`Function`,name:c,bounds:t,body:j(),isLocal:e,isRecursive:g(c),location:r}}let l=a,u=st();return k(`==`),E(`INSTANCE`)?{...ft(c,u,e,r),definitionRange:b(l)}:i(c,u)},ft=(e,t,n,r)=>{let i=a;return k(`INSTANCE`),{kind:`Instance`,name:e,params:t,module:ge(),substitutions:O(`WITH`)?ve(()=>{let e=a,t=me(),n=b(e);return k(`<-`),{name:t,nameRange:n,expression:Oe()}}):[],isLocal:n,location:r,instanceRange:b(i)}},pt=()=>{let e=a;return x(mt(),e)},mt=()=>{let e=_(S());if(E(`_`)&&S(1).kind===`Operator`&&(ZS.has(S(1).text)||iC.has(S(1).text)))return D(),{name:D().text,arity:O(`_`)?2:1,location:e};if(S().kind!==`String`&&(oC.has(S().text)||r&&S().kind===`Operator`)&&E(`_`,1)){let t=D().text;return D(),{name:t===`-`?`-.`:t,arity:1,location:e}}let t=de();if(!O(`(`))return{name:t,arity:0,location:e};let n=ve(()=>k(`_`));return k(`)`),{name:t,arity:n.length,location:e}},ht=()=>ve(pt),M=()=>{let e=ht();return e.forEach(e=>u[u.length-1].add(e.name)),e},gt=e=>{let t=0,n=e;do{let e=S(n);if(e.kind===`End`)return n;e.kind===`Operator`&&OC.has(e.text)&&t++,e.kind===`Operator`&&kC.has(e.text)&&t--,n++}while(t>0);return n},_t=()=>{let e=S(),t=S(1);return e.kind===`Identifier`?E(`(`,1)||E(`[`,1)?E(`==`,gt(1)):t.kind===`Operator`&&iC.has(t.text)?E(`==`,2):t.kind===`Operator`&&ZS.has(t.text)?S(2).kind===`Identifier`&&E(`==`,3):E(`==`,1):e.kind!==`String`&&oC.has(e.text)&&t.kind===`Identifier`&&E(`==`,2)},vt=[],yt=()=>vt[vt.length-1]??-1,bt=e=>e.text[1]===`*`?-1:e.text[1]===`+`?-2:Number(e.text.slice(1,e.text.indexOf(`>`))),xt=e=>{let t=e.text.slice(e.text.indexOf(`>`)+1),n=t.length;for(;t[n-1]===`.`;)n--;return t.slice(0,n)},St=e=>!e.text.endsWith(`.`)&&!gC.has(xt(e)),Ct=e=>{let t=xt(e);if(gC.has(t))return;let n=bt(e);if(n>=0)return`<${n}>${t}`;let r=yt(),i=vt[vt.length-2];return`<${r<0&&i!==void 0?i:r}>${t}`},N=e=>{if(e.kind===`Keyword`)return pC.has(e.text);if(e.kind!==`Step`)return!1;if(e.text[1]===`*`)return vt.length===0;if(e.text[1]===`+`||vt.length===0)return!0;let t=yt();return t>=0&&bt(e)>t},wt=e=>{let t=bt(e),n=vt.length-1,r=vt[n-1]??-1,i=vt[n]<0;return i&&(vt[n]=t<0?r+1:t),t===-1?!0:t===-2?i:i?t>r:vt[n]===t},Tt=()=>{let e=S();return e.kind===`Step`?St(e):e.kind===`Keyword`?TC.has(e.text):e.kind===`End`||e.kind===`ModuleEnd`||e.kind===`Separator`?!1:!_t()},Et=()=>{let e=a,t=S();return t.kind===`Operator`&&!sC.has(t.text)&&NC(t.text)?(a++,x({kind:`OperatorReference`,operator:t.text,spelling:t.spelling,location:_(t)},e)):O(`MODULE`)?x({kind:`ModuleFact`,name:de(),location:_(t)},e):j()},Dt=()=>{let e=a,t=S(),n=ve(()=>{let e=S();if((e.kind!==`Identifier`||C(e))&&e.kind!==`Operator`)throw ae(`Expected a definition name but found ${ne(e)}`,e);return a++,e.text},`!`),r=_(t);return x(n.length===1&&t.kind===`Operator`?{kind:`OperatorReference`,operator:t.text,location:r}:{kind:`Identifier`,name:n.join(`!`),location:r},e)},Ot=()=>ve(r?Dt:Et),kt=()=>{let e=oe(j);if(!e)return[];let t=[e];return ce(()=>{for(;E(`,`);){let e=oe(()=>(D(),j()));if(!e)return;t.push(e)}}),t},At=()=>{let e=r?kt():Tt()?ve(Et):[],t=O(`DEF`)||O(`DEFS`);if(r&&e.length===0&&!t)throw ae(`Expected a fact`);return{facts:e,defs:t?Ot():[]}},jt=()=>{let e=a,t=D(),n=t.text===`USE`&&O(`ONLY`),r=b(e);return x({kind:t.text===`USE`?`Use`:`Hide`,isOnly:n,...At(),keyword:r,location:_(t)},e)},Mt=()=>{let e=a,t=_(S()),n=O(`NEW`),i=r?a:e,o=r?_(S()):t,s=S().kind===`Keyword`?EC.get(S().text):void 0;if(!n&&s===void 0)throw ae(`Expected a declaration but found ${ne(S())}`);if(s!==void 0&&D(),s===`Variable`){let e=fe();return x({kind:`NewSymbol`,name:e.name,arity:0,level:s,set:void 0,nameRange:e.range,location:o},i)}let c=pt(),l=(s??`Constant`)===`Constant`&&E(`\\in`);if(l&&c.arity>0)throw T(`declared symbol with arguments before \\in`);return l&&D(),x({kind:`NewSymbol`,name:c.name,arity:c.arity,level:s??`Constant`,set:l?j():void 0,nameRange:c.location.range,location:o},i)},Nt=()=>{if(S().kind===`Identifier`&&E(`::`,1)&&E(`ASSUME`,2)&&(D(),D()),E(`ASSUME`))return Ft();if(S().kind===`Keyword`&&DC.has(S().text))return r?se(Mt):Mt();if(!r)return j();let e=oe(j);if(e===void 0)throw ae(`Expected a hypothesis`);return e},Pt=()=>{let e=[Nt()];return ce(()=>{for(;;){let t=oe(()=>(k(`,`),Nt()));if(t===void 0)break;e.push(t)}}),e},Ft=()=>{let e=a,t=_(k(`ASSUME`)),n=()=>{let n=r?Pt():ve(Nt);return k(`PROVE`),x({kind:`AssumeProve`,assumptions:n,conclusion:j(),location:t},e)};return r?se(n):n()},It=e=>{let t=0;for(;S(t).kind===`Identifier`&&E(`,`,t+1);)t+=2;return S(t).kind===`Identifier`&&E(e,t+1)},Lt=()=>{let e=S();if(E(`USE`)||E(`HIDE`))return jt();if(!r&&E(`INSTANCE`)){let t=a;return x(ft(void 0,[],!1,_(e)),t)}if(E(`DEFINE`)||_t()){let t=a;O(`DEFINE`);let n=[lt(!1)];for(;_t();)n.push(lt(!1));let r={kind:`Define`,definitions:n,location:_(e)};return x(r,t)}if(O(`HAVE`))return{kind:`Have`,expression:j()};if(O(`TAKE`)){let e=ye(),t=pe(e?[]:ve(fe)),n=e?Ce():[];return{kind:`Take`,names:t.names,nameRanges:t.ranges,bounds:n}}if(O(`WITNESS`))return{kind:`Witness`,expressions:ve(()=>j())};if(O(`PICK`)){let e=It(`:`),t=pe(e?ve(fe):[]),n=e?[]:Ce();return k(`:`),{kind:`Pick`,names:t.names,nameRanges:t.ranges,bounds:n,body:j()}}return O(`CASE`)?{kind:`Case`,expression:j()}:{kind:`Assert`,isSuffices:O(`SUFFICES`),statement:E(`ASSUME`)?Ft():j()}},Rt=e=>{let n=S();if(n.kind!==`Step`)throw ae(`Expected a step number but found ${ne(n)}`,n);if(!wt(n))throw T(`${e?`QED step`:`step`}'s number has bad level`,n);if(t!==`sany`&&bt(n)<0&&Ct(n)!==void 0)throw T(`<*> and <+> cannot be used for a named step`,n);return a++,{name:Ct(n),token:n.text,location:_(n)}},zt=()=>{let e=a,t=Rt(E(`QED`,1)),n=a,r=O(`QED`)?{kind:`Qed`}:Lt(),i=b(e),o=b(n),s=N(S());if(s&&!mC.has(r.kind))throw T(`Proof of a step that does not take a proof`);let c=s?Ht():void 0;return x({...t,body:r,head:i,statement:o,proof:c},e)},Bt=e=>{if(O(`BY`)){let t=b(a-1);return{kind:`By`,isOnly:O(`ONLY`),...At(),keyword:t,location:e}}let t=S();if(t.kind!==`Keyword`||t.text!==`OBVIOUS`&&t.text!==`OMITTED`)return;D();let n=b(a-1);return{kind:t.text===`OBVIOUS`?`Obvious`:`Omitted`,keyword:n,location:e}},Vt=()=>{let e=_(S());O(`PROOF`);let t=Bt(e);if(t)return t;let n=[zt()];for(;n[n.length-1].body.kind!==`Qed`;)n.push(zt());return{kind:`Steps`,level:yt(),steps:n,location:e}},Ht=()=>{let e=a;vt.push(-1);let t=Vt();return vt.pop(),x(t,e)},Ut=()=>S().kind===`Step`||S().kind===`Keyword`&&pC.has(S().text),Wt=(e,t)=>{if(t.kind!==`Use`&&t.kind!==`Hide`)return bC(e);let n=t.defs[t.defs.length-1]?.location.range;return yC(bC({...e,end:e.start}),bC(n??t.keyword))},Gt=()=>{let e=a,t=_(S()),n=O(`PROOF`),r=Bt(t);if(r){let t=x(r,e);return{kind:`Leaf`,proof:t,span:bC(t.keyword),first:e,end:a-1}}let i=S();if(i.kind!==`Step`)throw ae(`Expected a step number but found ${ne(i)}`);let o=a;D();let s=a,c=O(`QED`)?{kind:`Qed`}:Lt(),l=b(o);return{kind:`Step`,token:i,isProof:n,body:c,head:l,statement:b(s),span:Wt(l,c),first:e,start:o,end:a-1}},Kt=(e,t,n,r)=>{let a=e[t];if(!a)return{proof:void 0,span:r,next:t,end:void 0};if(a.kind===`Leaf`)return{proof:a.proof,span:a.span,next:t+1,end:a.end};let o=qt(e,t,n,r,!0);if(!o)return{proof:void 0,span:r,next:t,end:void 0};let s={..._(i[a.first]),range:b(a.first,o.end)};return{proof:{kind:`Steps`,level:o.level,steps:o.steps,location:s},span:o.span,next:o.next,end:o.end}},qt=(e,t,n,r,i)=>{let a=e[t];if(!a)throw wC(`Unexpected end of (sub)proof at level ${n} before QED step`,r,CC);if(a.kind===`Leaf`)throw wC(`Expecting a proof step but found a${_C[a.proof.kind]} leaf proof`,a.span,CC);if(!i&&a.isProof)throw wC(`PROOF keyword found in step that does not begin subproof`,a.span,SC);let o=a.token.text[1];if(o===`+`&&!i)throw wC(`<+> used but no subproof expected`,a.span,SC);let s=o===`*`?n-(i&&!a.isProof?1:0):o===`+`?n:bt(a.token);if(s<n||!i&&s>n)return;let c=mC.has(a.body.kind)?Kt(e,t+1,s+1,a.span):{proof:void 0,span:a.span,next:t+1,end:void 0},l=c.end??a.end,u={name:Ct(a.token),token:a.token.text,body:a.body,head:a.head,statement:a.statement,proof:c.proof,location:{..._(a.token),range:b(a.start,l)}},d=yC(a.span,c.span);if(a.body.kind===`Qed`)return{level:s,steps:[u],span:d,next:c.next,end:l};let f=qt(e,c.next,s,{start:d.stop,stop:d.stop},!1);return f&&{...f,level:s,steps:[u,...f.steps],span:yC(d,f.span)}},Jt=()=>{if(!Ut())return;let e=[];for(;Ut();)e.push(Gt());let t=e[0];t.kind===`Step`&&(e[0]={...t,isProof:!0});let n=Kt(e,0,0,t.span),r=e[n.next];if(r)throw wC(`extra step(s) after finished proof`,r.span,xC,`Proof.Parser.toplevel`);return n.proof},Yt=(e,t,n,r)=>{e.definitions.some(e=>e.name===t)||e.definitions.push({kind:`Operator`,name:t,params:[],body:n,isLocal:!1,isRecursive:!1,location:r})},Xt=()=>{if(S().kind!==`Identifier`||!E(`==`,1))return;let e=de();return D(),e},Zt=()=>{if(!r)return j();let e=te(),t=oe(j);if(t)return t;throw ae(`Expected "====" but found ${ne(e)}`,e)},Qt=e=>{let t=a,n=D(),i=Xt(),o=E(`ASSUME`)?Ft():Zt(),s=r?Jt():N(S())?Ht():void 0,c=x({name:i,statement:o,proof:s,location:_(n)},t);e.theorems.push(c),e.units.push({kind:`Theorem`,theorem:c}),i!==void 0&&o.kind!==`AssumeProve`&&Yt(e,i,o,c.location)},$t=()=>{let e=a,t=D(),n=Xt();return x({name:n,expression:j(),isAxiom:t.text===`AXIOM`,location:_(t)},e)},en=()=>{let e=_(k(`----`));k(`MODULE`);let t=ge();k(`----`);let n={name:t,modules:[],extends:[],extendsRanges:[],constants:[],variables:[],definitions:[],instances:[],assumptions:[],location:e,theorems:[],uses:[],units:[]};for(d.push(n),u.push(/* @__PURE__ */ new Set),O(`EXTENDS`)&&ve(()=>{let e=a;n.extends.push(ge()),n.extendsRanges.push(b(e))});;){let t=a,r=S();if(r.kind===`ModuleEnd`)return e.range={module:d[0].name,start:{line:e.line,column:e.column},end:{line:r.line,column:r.endColumn}},d.pop(),u.pop(),n;if(r.kind===`Separator`){if(E(`MODULE`,1)){let e=en();n.modules.push(e),n.units.push({kind:`Module`,module:e}),k(`====`);continue}D()}else{switch(r.text){case`CONSTANT`:case`CONSTANTS`:{let e=_(D()),r=ht();n.constants.push(...r),e.range=b(t),n.units.push({kind:`Constants`,declarations:r,location:e});continue}case`VARIABLE`:case`VARIABLES`:{let e=_(D()),r=ve(()=>{let e=a,t=_(S());return x({name:de(),arity:0,location:t},e)});n.variables.push(...r),e.range=b(t),n.units.push({kind:`Variables`,declarations:r,location:e});continue}case`ASSUME`:case`ASSUMPTION`:case`AXIOM`:{let e=$t();n.assumptions.push(e),n.units.push({kind:`Assumption`,assumption:e}),e.name!==void 0&&Yt(n,e.name,e.expression,e.location);continue}case`USE`:case`HIDE`:{if(E(`USE`)&&E(`ONLY`,1))throw ae(`Expected a module unit but found ${ne(r)}`);let e=jt();n.uses.push(e),n.units.push({kind:`Use`,use:e});continue}case`RECURSIVE`:{let e=_(D()),r=M();e.range=b(t),n.units.push({kind:`Recursive`,declarations:r,location:e});continue}case`INSTANCE`:tn(n,x(ft(void 0,[],!1,_(r)),t));continue;case`LOCAL`:if(D(),E(`INSTANCE`)){tn(n,x(ft(void 0,[],!0,_(r)),t));continue}tn(n,x(dt(!0),t));continue}r.kind===`Keyword`&&fC.has(r.text)?Qt(n):tn(n,lt(!1))}}},tn=(e,t)=>{t.kind===`Instance`?(e.instances.push(t),e.units.push({kind:`Instance`,instance:t})):(e.definitions.push(t),e.units.push({kind:`Definition`,definition:t}))},nn=en(),rn=he?JS(e):void 0;if(rn!==void 0)throw new s(rn);return nn},LC=e=>IC(e,`tlc`),RC=(e,t)=>IC(e,`tlc`,t),zC=e=>IC(e,`tlapm`),BC=e=>IC(e,`sany`),VC=/* @__PURE__ */ new WeakMap,HC=(e,t)=>e.forEach(e=>{let n=t.find(t=>t.isRecursive&&t.name===e.name);n&&VC.set(n,e.arity)}),UC=e=>{switch(e.kind){case`Name`:return e.name;case`Operand`:return typeof e.operand==`number`?`argument selector ${e.operand}`:e.operand;case`Bound`:return`!(...)`;case`At`:return`@`;case`Colon`:return`:`}},WC=(e,t,n)=>({operator:e,range:t,args:n,params:n.map(()=>0)}),GC=(e,t)=>new s(`${e} at line ${t.line}, column ${t.column}`),KC=(e,t,n)=>{if(e.kind===`Label`)return e.name===t?{label:e,lets:n}:void 0;if(e.kind===`Let`)return KC(e.body,t,[...n,e.definitions]);if(e.kind!==`Lambda`)for(let r of mt(e)){let e=KC(r,t,n);if(e)return e}},qC=(e,t,n)=>t.reduceRight((e,t)=>({kind:`Let`,definitions:t,body:e,location:n}),e),JC=(e,t)=>{let n=e.location,r=qC(t,e.lets,n);if(e.params.length===0&&r!==t)return r;if(e.params.length===0){let e={...t};return Sc.set(e,Sc.get(t)??t),e}if(e.args.length===0){if(e.params.some(e=>e.arity>0))throw GC(`Selected an operator with operator parameters as an argument`,n);return{kind:`Lambda`,params:e.params.map(e=>e.name),body:r,location:n}}if(e.args.length!==e.params.length)throw GC(`The subexpression requires ${e.params.length} arguments but received ${e.args.length}`,n);return{kind:`Let`,definitions:[{kind:`Operator`,name:hc,params:e.params,body:r,isLocal:!0,isRecursive:!1,location:n}],body:{kind:`Apply`,operator:hc,args:e.args,location:n,resolution:mc},location:n}},YC=(e,t)=>{let n=t.location,r=e.kind===`Operator`?e.params.map((e,n)=>({name:`${e.name}$${t.params.length+n}`,arity:e.arity})):[],i=r.map(e=>({kind:`Identifier`,name:e.name,location:n,resolution:mc})),a=i.length===0?{kind:`Identifier`,name:e.name,location:n,resolution:mc}:{kind:`Apply`,operator:e.name,args:i,location:n,resolution:mc};return JC({...t,params:[...t.params,...r]},a)},XC=(e,t,n,r,i)=>{let a=r.location,o={params:[],args:[],lets:[],location:a},s=0,c,l=!1,u=[],d=[],f,p=(e,t)=>{!f&&e&&(f={location:g(e),message:t})},m=(e,t,n=!1)=>{let i=r.selectorRanges?.[s];e&&i&&u.push({node:e,error:{location:g(i),message:t},isEmpty:n})},h=(e,t)=>{if(!e)throw GC(t,a);_c.set(r,{applications:d,nulls:u,error:{location:g(e),message:t}}),l=!0},_=n=>{let r=[],i=[];for(;s<e.length;){let o=e[s];if(o.kind!==`Name`&&!n)return;if(o.kind!==`Name`)throw GC(`Expected an operator name`,a);r.push(o.name),i.push(...o.args);let c=r.join(`!`),l=n?n.find(e=>uu(e)===c):t(c);if(l)return{definition:l,name:c,args:i,earlier:i.length-o.args.length};s++}throw GC(`Unknown operator ${r.join(`!`)}`,a)},v=t=>{let n=_(t);if(!n){l=!0;return}let u=n.definition,f=VC.get(u)??Mc(u),m=s===e.length-1;if(n.args.length!==f){let e=r.argumentRanges?.[s]??a.range,t=`The operator ${cc(n.name)} requires ${f-n.earlier} arguments.`;if(!i||n.args.length!==0)return h(e,t);p(e,t)}if(n.args.forEach((e,t)=>bc.set(e,{operator:n.name,index:t,range:r.selectorRanges?.[s]})),m)return{definition:u,args:n.args};let g=u.location.range,v=VC.has(u)&&g?.module===a.range?.module&&Ac(a,u.location);if(d.push({operator:n.name,range:r.selectorRanges?.[s],args:n.args,params:v?Array(f).fill(0):Nc(u)}),u.isRecursive&&g&&g.module===a.range?.module&&Ac(a,g.end))return h(r.selectorRanges?.[s],`Subexpression of \`${n.name}' used inside the operator's definition.`);if(u.kind!==`Operator`)throw GC(`Cannot select a subexpression of ${u.name}`,a);o.params.push(...u.params),o.args.push(...n.args),c=u.body,s++},y=()=>{for(;s<e.length&&!l;){let t=e[s];if(t.kind!==`Name`)return;let n=r.selectorRanges?.[s],a=c&&KC(c,t.name,[]);if(!a)return h(n,`Cannot find label \`${t.name}'.`);let l=a.label.params;if(t.args.length!==l.length){let e=`Label \`${t.name}' used with wrong number of arguments.`;if(!i)return h(n,e);p(n,e)}o.lets.push(...a.lets),o.params.push(...l.map(e=>({name:e,arity:0}))),o.args.push(...t.args),d.push(WC(t.name,n,t.args)),c=a.label.body,s++}},ee=i=>{if(!c)throw GC(`Subexpression selection failed`,a);if(i.kind===`Colon`)return;let l=r.selectorRanges?.[s],u=c.location.range;if((c.kind===`Subexpression`||c.kind===`Identifier`&&c.name.includes(`!`)||c.kind===`Apply`&&c.operator.includes(`!`))&&(u?.module!==a.range?.module||Ac(c.location,a))){let e=_c.has(c)?c:$C(c,t,n),r=`Choosing operand \`${UC(i)}' of subexpression with no operands.`;if(_c.has(e)){h(l,r);return}gc.has(e)&&e.kind!==`Lambda`&&(m(e,r,!0),c=e.kind===`Let`&&e.body.kind===`Apply`&&e.body.operator===`$subexpression`?e.body:{kind:`Tuple`,elements:[e],location:e.location})}if(c.kind===`Label`){c=c.body,ee(i);return}let f=`Nonexistent operand specified by \`${UC(i)}'.`;if(c.kind===`Let`){if(i.kind!==`Operand`||il(i.operand,1)!==0){h(l,`A LET/IN expression has only one operand.`);return}o.lets.push(c.definitions),c=c.body;return}let p=cl(c);if(p&&(i.kind===`Bound`||i.kind===`At`)){if(i.kind===`Bound`&&i.args.length!==p.names.length){h(l,`Selector with ${i.args.length} argument(s) used for quantifier with ${p.names.length} bound identifier(s).`);return}o.params.push(...p.names.map(e=>({name:e,arity:0}))),i.kind===`Bound`&&(o.args.push(...i.args),d.push(WC(``,l,i.args))),c=p.body;return}if(c.kind===`Case`){let t=[...c.arms,...c.other?[{condition:void 0,body:c.other}]:[]];if(s===e.length-1){h(l,`Subexpression of CASE must have form !i!j.`);return}let n=i.kind===`Operand`?t[il(i.operand,t.length)]:void 0;if(!n){h(l,f);return}s++;let a=e[s],o=a.kind===`Operand`?il(a.operand,2):-1,u=r.selectorRanges?.[s];if(o===-1){h(u,`Second selector for CASE subexpression must specify one of two operands.`);return}let d=o===0?n.condition:n.body;if(!d){h(u,`Selecting OTHER in a CASE statement.`);return}c=d;return}if(c.kind===`Except`&&i.kind===`Operand`&&il(i.operand,c.updates.length+1)>0){h(l,`Selecting subexpression of an EXCEPT not yet implemented.`);return}let g=p?p.sets:ll(c);if(!g&&c.kind!==`Identifier`){h(l,`Selecting subexpression of expression that has none.`);return}if(i.kind!==`Operand`){h(l,f);return}let _=g?.[il(i.operand,g.length)];_?c=_:h(l,f)},b=v(void 0);if(l)return r;if(b)return YC(b.definition,{...o,args:b.args});for(y();s<e.length&&!l;){let t=e[s];if(t.kind===`Name`){for(;c?.kind===`Label`;)c=c.body;if(c?.kind!==`Let`)return h(r.selectorRanges?.[s-1],`A name selector here must be from a LET clause.`),r;o.lets.push(c.definitions);let e=v(c.definitions);if(l)return r;if(e)return YC(e.definition,{...o,args:[...o.args,...e.args]});y()}else t.kind!==`Colon`&&(m(c,`Subexpression selection failed, probably due to an error in the selected expression.`),m(c,`Choosing operand \`${UC(t)}' of subexpression with no operands.`,!0)),ee(t),m(c,`An unexpected null node specified by '${UC(e[s])}'.\nThis is probably due to a previous error.`),s++}if(l)return r;if(!c)throw GC(`Subexpression selection failed`,a);let x=o.params.length,te=o.args.length;if(x!==te){let e=`Expected ${x} arguments but found ${te}.`;if(!i||te>0)return h(a.range,e),r;p(a.range,e)}let S=JC(o,c);return xc.set(S,u),f&&vc.set(S,f),S},ZC=(e,t,n,r)=>{if(!e.includes(`!`)||r(e))return;let i=e.split(`!`);if(i.some((e,t)=>r(i.slice(0,t+1).join(`!`))))return al(e,t,n)},QC=e=>e.kind===`Subexpression`||e.kind===`Identifier`&&e.name.includes(`!`)||e.kind===`Apply`&&e.operator.includes(`!`)||mt(e).some(QC),$C=(e,t,n,r=!1)=>{if(!QC(e))return e;if(e.kind===`Let`){e.recursive&&HC(e.recursive,e.definitions);let r=n=>e.definitions.find(e=>e.name===n)??t(n),i=t=>!e.definitions.some(e=>e.name===t)&&n(t),a=pu(e,e=>$C(e,r,i));return a.kind===`Let`&&a.instances?{...a,instances:a.instances.map(e=>ew(e,r,i))}:a}let i=e.kind===`Apply`?t(e.operator):void 0,a=e.kind===`Apply`?{...e,args:e.args.map((e,r)=>$C(e,t,n,i?.kind!==`Operator`||i.params[r]?.arity!==0))}:pu(e,e=>$C(e,t,n)),o=mt(e),s=mt(a).every((e,t)=>e===o[t])?e:a,c=s.kind===`Subexpression`?s.selectors:s.kind===`Identifier`?ZC(s.name,[],void 0,t):s.kind===`Apply`?ZC(s.operator,s.args,s.argumentCounts,t):void 0,l=c?.[0];if(!c)return s;let u=c.findIndex(e=>e.kind!==`Name`),d=c.slice(0,u===-1?c.length:u),f=d.some((e,n)=>n>0&&t(d.slice(0,n+1).map(UC).join(`!`)));if(l?.kind===`Name`&&n(l.name)&&!f||l?.kind===`Name`&&c[1].kind!==`Name`&&!t(l.name))return s;let p=XC(c,t,n,s,r);return p!==s&&gc.add(p),p},ew=(e,t,n)=>({...e,substitutions:e.substitutions.map(e=>({...e,expression:$C(e.expression,t,n,!0)}))}),tw=e=>{let t=new Map(e.map(e=>[e.name,e]));return e=>t.get(e)},nw=(e,t)=>ew(e,tw(t.definitions),()=>!1),rw=(e,t)=>{let n=new Set(e.theorems.flatMap(e=>e.name!==void 0&&e.statement.kind===`AssumeProve`?[e.name]:[])),r=e.theorems.flatMap(e=>{let t=e.statement;if(e.name===void 0||t.kind!==`AssumeProve`)return[];let n=t.assumptions.filter(e=>e.kind!==`NewSymbol`&&e.kind!==`AssumeProve`);return n.length===t.assumptions.length?[{kind:`Operator`,name:e.name,params:[],body:{kind:`Tuple`,elements:[...n,t.conclusion],location:t.location},isLocal:!0,isRecursive:!1,location:e.location}]:[]}),i=/* @__PURE__ */ new Set([...e.definitions,...r]);HC(e.units.flatMap(e=>e.kind===`Recursive`?e.declarations:[]),e.definitions);let a=new Map(e.units.flatMap(e=>e.kind===`Recursive`?e.declarations.map(e=>[e.name,e.location]):[])),o=(e,t)=>{let n=a.get(e.name);return Ac(e.location,t)||e.isRecursive&&n!==void 0&&Ac(n,t)},s=(e,t)=>n=>{let r=e(n);return r&&(!i.has(r)||o(r,t))?r:void 0},c=tw([...t,...e.definitions]),l=e=>n.has(e),u=tw([...t,...e.definitions,...r]),d=(e,t)=>$C(e,s(u,t),e=>l(e)&&r.every(t=>t.name!==e)),f=e=>{let t=t=>l(t)||!e(t),n=n=>$C(n,e,t),r=e=>{let t=e.map(e=>e.kind===`ModuleFact`?e:n(e));return yc.set(t,e),t},i=e=>e.map(e=>({...e,set:n(e.set)})),a=e=>e.kind===`AssumeProve`?{...e,assumptions:e.assumptions.map(e=>e.kind===`NewSymbol`?{...e,set:e.set&&n(e.set)}:a(e)),conclusion:n(e.conclusion)}:n(e),o=o=>{switch(o.kind){case`Use`:case`Hide`:return{...o,facts:r(o.facts)};case`Instance`:return ew(o,e,t);case`Define`:return{...o,definitions:o.definitions.map(r=>r.kind===`Instance`?ew(r,e,t):fu(r,n))};case`Have`:case`Case`:return{...o,expression:n(o.expression)};case`Witness`:return{...o,expressions:o.expressions.map(n)};case`Take`:return{...o,bounds:i(o.bounds)};case`Pick`:return{...o,bounds:i(o.bounds),body:n(o.body)};case`Assert`:return{...o,statement:a(o.statement)};default:return o}},s=t=>{if(t?.kind===`By`)return{...t,facts:r(t.facts)};if(t?.kind!==`Steps`)return t;let n={lookup:e,resolveStep:o,resolveProof:s};return{...t,steps:t.steps.map(e=>{let t={...e,body:n.resolveStep(e.body),proof:n.resolveProof(e.proof)};if(e.body.kind===`Define`){let t=e.body.definitions.flatMap(e=>e.kind===`Instance`?[]:[e]),r=n.lookup;n=f(e=>t.find(t=>t.name===e)??r(e))}return t})}};return{lookup:e,resolveFacts:r,resolveStatement:a,resolveStep:o,resolveProof:s}},p={...e,theorems:e.theorems.map(e=>{let t=f(s(c,e.location));return{...e,statement:e.name!==void 0&&e.statement.kind!==`AssumeProve`?e.statement:t.resolveStatement(e.statement),proof:e.proof&&f(s(c,e.proof.location)).resolveProof(e.proof)}}),uses:e.uses.map(e=>({...e,facts:f(s(c,e.location)).resolveFacts(e.facts)}))};return e.definitions.some(e=>QC(e.body))||e.assumptions.some(e=>QC(e.expression))?{...p,definitions:e.definitions.map(e=>fu(e,t=>d(t,e.location))),assumptions:e.assumptions.map(e=>({...e,expression:d(e.expression,e.location)}))}:p},iw=(e,t)=>e.maxLevels[t]??3,aw=e=>{let t=/* @__PURE__ */ new Map,n=n=>{let r=t.get(n);if(r)return r;let i=e(n),a=Wd({constants:new Set(i.constants.map(e=>e.name)),variables:new Set(i.variables),getDefinition:i.getDefinition});return t.set(n,a),a},r=/* @__PURE__ */ new Map,i=t=>{let i=r.get(t);if(i)return i;let a=e(t),o=n(t),s=a.definitions.map(e=>o.analyzeDefinition(e,/* @__PURE__ */ new Map)),c={isConstant:a.variables.length===0&&s.every(e=>e.level===0),constraints:/* @__PURE__ */ new Map,argConstraints:/* @__PURE__ */ new Map,argParams:/* @__PURE__ */ new Set};c.isConstant||a.constants.forEach(e=>Qu(c.constraints,e.name,0));let l=(e,t)=>{e.constraints.forEach((e,t)=>Qu(c.constraints,t,e)),e.argConstraints.forEach((e,t)=>$u(c.argConstraints,t,e)),e.argParams.forEach(e=>{let n=Yu(e);t(n.operator,n.param)&&c.argParams.add(e)})};s.forEach(e=>l(e,(t,n)=>e.formals.every(e=>e.name!==t&&e.name!==n)));let u=e=>{l(e,()=>!0),a.constants.forEach(t=>{e.params.has(t.name)&&Qu(c.constraints,t.name,2)})};return a.assumptions.forEach(e=>u(o.analyze(e,/* @__PURE__ */ new Map))),a.theorems.forEach(e=>e.statement.kind===`AssumeProve`?u(Gd(e.statement,/* @__PURE__ */ new Map,o)):l(o.analyze(e.statement,/* @__PURE__ */ new Map),()=>!0)),r.set(t,c),c};return t=>{let r=/* @__PURE__ */ new Map,a=g(t.location.range??{module:t.instancer,start:t.location,end:t.location}),o=e=>r.set(`${a}\n${e}`,{location:a,message:e}),s=e(t.module),l=i(t.module),u=n(t.instancer),d=/* @__PURE__ */ new Map;t.lets.forEach(e=>d.set(e.name,{kind:`Let`,definition:e,scope:d}));let f=[...s.constants.map(e=>({...e,maximumLevel:0})),...s.variables.map(e=>({name:e,arity:0,maximumLevel:1}))].flatMap(e=>{let n=t.substitutions.get(e.name);if(!n)return[];if(e.arity===0){let t=u.analyze(n,d);return[{...e,level:t.level,operator:void 0,isLeibniz:!0}]}let r=u.toOperand(n,d),i=r.kind===`Operator`?r.data:void 0;return[{...e,level:r.data.level,operator:i,isLeibniz:i===void 0||i.nonLeibniz.size===0}]}),p=(e,n)=>`Level error in instantiating module '${t.module}':\nThe level of the expression or operator substituted for '${e}' \nmust be at most ${n}.`;if(f.forEach(e=>{!l.isConstant&&e.level>e.maximumLevel&&o(p(e.name,e.maximumLevel)),e.isLeibniz||o(`Error in instantiating module '${t.module}':\n A non-Leibniz operator substituted for '${e.name}'.`)}),f.forEach(e=>{let n=l.constraints.get(e.name);n!==void 0&&e.level>n&&o(p(e.name,n));let r=e.operator;if(r)for(let n=0;n<e.arity;n++){let i=l.argConstraints.get(qu(e.name,n));i!==void 0&&iw(r,n)<i&&o(`Level error in instantiating module '${t.module}':\nThe level of the argument ${n+1} of the operator ${r.name} \nmust be at least ${i}.`)}}),l.argParams.forEach(e=>{let n=Yu(e),r=f.find(e=>e.name===n.operator)?.operator,i=f.find(e=>e.name===n.param);if(!r||!i)return;let a=iw(r,n.index);i.level>a&&o(`Level error when instantiating module '${t.module}':\nThe level of the argument ${n.index} of the operator ${n.operator}' \nmust be at most ${a}.`)}),r.size>0)throw c([...r.values()])}},ow=[`LAMBDA`,`$$InAssume`,`nullODN`,`nullOpArg`,`nullLabelNode`],sw=/* @__PURE__ */ new Set([`THEOREM`,`LEMMA`,`COROLLARY`,`PROPOSITION`]),cw=new Map(oc.flatMap(e=>e.map(t=>[t,e[0]]))),lw=e=>cw.get(e)??e,uw=()=>{let e=Array.from({length:11},()=>[]),t=8,n=/* @__PURE__ */ new Set,r=[],i=t=>{for(let n=e.length-1;n>=0;n--){let r=e[n];for(let e=r.length-1;e>=0;e--)t(r[e])}},a=()=>{let n=e.length*2+1,r=Array.from({length:n},()=>[]);i(e=>r[e.hash%n].push(e)),e=r,t=Math.floor(n*.75)};return{put:i=>{n.has(i.key)||(r.length>=t&&a(),e[i.hash%e.length].push(i),n.add(i.key),r.push(i))},inserted:r,ownStart:0,enumerate:()=>{let e=[];return i(t=>e.push(t)),e}}},dw=(e,t,n)=>({key:t===`module`?`module ${e}`:e,name:e,hash:gt(e)&2147483647,kind:t,isLocal:n}),fw=(e,t)=>{let n=e[t],r=e[t+1];if(n.text===`_`&&r.kind===`Operator`)return e[t+2]?.text===`_`?{name:lw(r.text),end:t+3}:{name:r.text,end:t+2};if(n.kind===`Operator`)return{name:n.text===`-`?`-.`:lw(n.text),end:t+2};if(r?.text!==`(`)return{name:n.text,end:t+1};let i=t+2;for(;i<e.length&&e[i].text!==`)`;)i++;return{name:n.text,end:i+1}},pw=(e,t)=>{let n=[];for(let r=t;;){let t=fw(e,r);if(n.push(t.name),e[t.end]?.text!==`,`)return n;r=t.end+1}},mw=e=>({line:e.line,column:e.column}),hw=(e,t,n)=>{let r=/* @__PURE__ */ new Set,i=(a,o)=>{let s={key:o,unit:t,extends:[],instances:[],inner:[],allExtends:r};for(let t=a+1;t<e.length;t++){let a=e[t];if(a.kind===`ModuleEnd`)return{references:s,end:t};if(a.kind===`Separator`&&e[t+1]?.text===`MODULE`){let r=e[t+2].text,a=i(t,`${o}/${r}`);n.set(r,a.references),s.inner.push(a.references),t=a.end}else if(e[t-1]?.text!==`.`){if(a.text===`EXTENDS`){let n=pw(e,t+1);s.extends.push(...n),n.forEach(e=>r.add(e))}else a.text===`INSTANCE`&&e[t+1]?.kind===`Identifier`&&s.instances.push(e[t+1].text)}}return{references:s,end:e.length}};return i(0,t??``).references},gw=(e,t)=>t!==void 0&&t.line===e.line&&t.column===e.column+e.text.length,_w={"\\":`\\\\`,'"':`\\"`,"\n":`\\n`," ":`\\t`,"\r":`\\r`,"\f":`\\f`},vw=e=>{let t=[];for(let n=0;n<e.length;n++){let r=e[n];r.text===`<`&&gw(r,e[n+1])&&/^(\d+|\*|\+)$/.test(e[n+1].text)&&e[n+2]?.text===`>`&&gw(e[n+1],e[n+2])?n+=gw(e[n+2],e[n+3])?3:2:(r.text!==`MODULE`||e[n-1]?.kind!==`Separator`)&&t.push(r.kind===`String`?`"${r.text.replace(/[\\"\n\t\r\f]/g,e=>_w[e])}"`:r.text)}return t},yw=e=>e[2]?.text,bw=e=>{let t=/* @__PURE__ */ new Map,n=[];return e.forEach((r,i)=>{r.kind===`Separator`&&e[i+1]?.text===`MODULE`&&n.push({name:e[i+2].text,start:i});let a=r.kind===`ModuleEnd`?n.pop():void 0;a&&!t.has(a.name)&&t.set(a.name,{start:a.start,end:i+1})}),t},xw=(e,t)=>e.find(e=>e.name===t)??e.map(e=>xw(e.modules,t)).find(Boolean),Sw=e=>{let t=e===void 0?[]:Ee(e),n;return{tokens:t,ranges:bw(t),getModule:()=>n??=e===void 0?LC(``):RC(e,t)}},Cw=(e,t)=>{let n=/* @__PURE__ */ new Map,r=/* @__PURE__ */ new Map,i=/* @__PURE__ */ new Map,a=e=>{let t=e===void 0?void 0:i.get(e);if(t)return t;let n=Sw(e);return e!==void 0&&i.set(e,n),n},o=i=>{let o=n.get(i??``);if(o)return o;let s=i===void 0?e:t?.(i)??fc.get(i)??fm.get(i)??FC(e,i),c=a(s),l=c.tokens,u=c.ranges.get(yw(l)??``)??{start:0,end:0},d={tokens:l,...u,getModule:c.getModule};return n.set(i??``,d),c.ranges.forEach((e,t)=>{e.start===u.start||r.has(t)||r.set(t,{tokens:l,...e,getModule:()=>xw(d.getModule().modules,t)??d.getModule()})}),d};return o(void 0),{getParsed:e=>(e===void 0?void 0:r.get(e))??o(e),parseText:e=>a(e).getModule()}},ww=e=>{let t=e=>{let t=e.tokens,n=e.getModule(),i=[],a=[],o=(e,n)=>{let r=pw(t,e+1);i.push({location:mw(t[e]),apply:e=>r.forEach(t=>e.put(dw(t,n,!1)))})},s=new Set(n.definitions.filter(e=>e.isRecursive).map(e=>e.name)),c=new Set(n.units.flatMap(e=>e.kind===`Constants`||e.kind===`Variables`?[`${e.location.line}:${e.location.column}`]:[])),l=0;t.slice(e.start,e.end).forEach((n,r)=>{let u=e.start+r;if(n.kind===`Separator`&&t[u+1]?.text===`MODULE`){if(l++,l===2){let e=t[u+2].text;i.push({location:mw(n),apply:t=>t.put(dw(e,`module`,!1))})}return}if(n.kind===`ModuleEnd`&&l--,l!==1||n.kind!==`Keyword`)return;let d=c.has(`${n.line}:${n.column}`);d&&(n.text===`CONSTANT`||n.text===`CONSTANTS`)&&o(u,`constant`),d&&(n.text===`VARIABLE`||n.text===`VARIABLES`)&&o(u,`variable`),n.text===`RECURSIVE`&&pw(t,u+1).every(e=>s.has(e))&&o(u,`definition`),sw.has(n.text)&&t[u+1]?.kind===`Identifier`&&t[u+2]?.text===`==`&&(a.push(mw(n)),i.push({location:mw(n),apply:e=>e.put(dw(t[u+1].text,`theorem`,!1))}))}),n.assumptions.forEach(e=>{a.push(e.location);let t=e.name;t!==void 0&&i.push({location:e.location,apply:e=>e.put(dw(t,`theorem`,!1))})});let u=e=>a.some(t=>t.line===e.line&&t.column===e.column);return n.definitions.forEach(e=>{if(u(e.location))return;let t=lw(e.name);i.push({location:e.location,apply:n=>n.put(dw(t,`definition`,e.isLocal))})}),n.instances.forEach(e=>{i.push({location:e.location,apply:t=>{let n=r(e.module).enumerate(),i=e.name===void 0?``:`${e.name}!`,a=n.filter(e=>e.kind===`definition`),o=n.filter(e=>e.kind===`theorem`);[...a,...o].forEach(n=>{n.isLocal||t.put(dw(`${i}${n.name}`,n.kind,e.isLocal))}),e.name!==void 0&&t.put(dw(e.name,`definition`,e.isLocal))}})}),i.sort((e,t)=>Ac(e.location,t.location)?-1:+!!Ac(t.location,e.location))},n=/* @__PURE__ */ new Map,r=i=>{let a=n.get(i??``);if(a)return a;let o=uw();n.set(i??``,o),ac.toReversed().forEach(e=>o.put(dw(e,`builtin`,!1)));let s=e(i);return s.getModule().extends.forEach(e=>r(e).inserted.forEach(e=>{e.isLocal||o.put(e)})),o.ownStart=o.inserted.length,t(s).forEach(e=>e.apply(o)),o};return{getContext:r,getOwnEntries:e=>{let t=r(e);return t.inserted.slice(t.ownStart)}}},Tw=(e,t,n)=>{let r=/* @__PURE__ */ new Set,i=e=>{r.add(e)},a=e=>{e.kind===`ModelValue`&&i(e.name),e.kind===`String`&&i(e.value),e.kind===`Set`&&e.elements.forEach(a)};t.constants.forEach(e=>{e.args?.forEach(a),a(e.value)}),lc.forEach(i);let o=t=>{let n=e(t);return n.tokens.slice(n.start,n.end)},s=/* @__PURE__ */ new Map,c=/* @__PURE__ */ new Map,l=e=>{let t=c.get(e);if(t)return t;let n=hw(o(e),e,s);return c.set(e,n),n},u=e=>s.get(e)??l(e),d=/* @__PURE__ */ new Set,f=(e,t)=>s.has(t)||d.has(`${e.key}>${t}`),p=(e,t,n)=>{let r=[...e.extends.map(u),...e.instances.filter(t=>f(e,t)).map(u),...e.inner];for(let e of r){let r=n(e,t);if(r)return r}},m=e=>{let t=(n,r)=>{if(r.has(n.key))return;r.add(n.key);let i=e(n).find(e=>!f(n,e));return i===void 0?p(n,r,t):[n,i]};return t},h=m(e=>e.extends),g=m(e=>e.instances),_=/* @__PURE__ */ new Set([void 0]),v=/* @__PURE__ */ new Map;vw(o(void 0)).forEach((e,t)=>{t===3&&dc.forEach(i),i(e)});let y=l(void 0);for(;;){let t=h(y,/* @__PURE__ */ new Set)??g(y,/* @__PURE__ */ new Set);if(!t)break;let[n,r]=t;if(d.add(`${n.key}>${r}`),v.set(n.unit,[...v.get(n.unit)??[],r]),!_.has(r)){if(_.add(r),e(r).tokens.length===0){let t=n.unit??yw(e(void 0).tokens);throw te(r,t)}vw(o(r)).forEach(i)}}ow.forEach(i);let ee=/* @__PURE__ */ new Set,b=e=>{if(ee.has(e))return;ee.add(e);let t=v.get(e)??[],n=l(e).allExtends;[...t.filter(e=>n.has(e)),...t.filter(e=>!n.has(e))].forEach(b),o(e).forEach(e=>{e.kind===`String`&&i(e.text)})};return b(void 0),n.forEach(e=>{let t=o(e);vw(t).forEach(i),t.forEach(e=>{e.kind===`String`&&i(e.text)})}),uc.forEach(i),[...r]},Ew=(e,t)=>{let n=Cw(e,t),r=n.getParsed,i,a=()=>i??=ww(r);return{getStringOrder:(e,t)=>Tw(r,e,t),getDeclarationOrder:e=>a().getContext(void 0).enumerate().filter(t=>t.kind===e).map(e=>e.name).reverse(),parseModule:n.parseText,createDefinitionOrder:()=>{let e=a();return e.getContext(void 0),t=>e.getOwnEntries(t).filter(e=>e.kind===`definition`).map(e=>e.name)}}},Dw=/* @__PURE__ */ new Set([`IOUtils`,`Json`,`TLCExt`]),Ow=e=>[...e.constants,...e.variables.map((t,n)=>({name:t,arity:0,location:e.variableLocations[n]}))],kw=(e,t,n)=>{try{return n.parseModule(e)}catch(n){if(!(n instanceof s))throw n;let r=JS(e);throw r===void 0?n:c([{location:`In module ${t}`,message:`Could not parse module ${t} from file ${t}.tla`}],!0,r)}},Aw=e=>new s(`Multiply-defined module '${e.name}' at line ${e.location.line}, column ${e.location.column}`),jw=(e,t)=>e.location.range&&t.location.range&&{location:g(e.location.range),message:`Multiply-defined module '${e.name}': this definition or declaration conflicts \nwith the one at ${g(t.location.range)}.`},Mw=e=>[`Builtin`,`Definition`,`Instance`,`Parameter`].includes(e)?`definition`:`declaration`,Nw=e=>e===`Theorem`?`ThmOrAssumpDefNode`:Mw(e),Pw=(e,t)=>({kind:`Operator`,name:t,params:[],body:{kind:`Let`,definitions:[e],body:ju(e.name,e.location),location:e.location},isLocal:!0,isRecursive:!1,location:e.location}),Fw=(e,t)=>{let n=ht(e);return n!==void 0&&t.has(n)||mt(e).some(e=>Fw(e,t))},Iw=(e,t)=>{let n=new Map(e.map((e,t)=>[e,t]));return new Set(t).forEach(e=>n.set(Eu(e),n.get(e)??n.size)),n},Lw=e=>e.flatMap(e=>e.substitutions.map(e=>e.expression)),Rw=e=>e.forEach(e=>{if(e.kind===`Decimal`)throw e_(e);if(e.kind===`Number`&&!_n(e.value))throw t_(e);Rw(e.kind===`Let`?[...mt(e),...Lw(e.instances??[])]:mt(e))}),zw=(e,t)=>{let n=t.order??Ew(t.source,t.loadModule),r=n.parseModule(t.source),i=/* @__PURE__ */ new Map,a=/* @__PURE__ */ new Map,o=/* @__PURE__ */ new Map,l=/* @__PURE__ */ new Set,u=/* @__PURE__ */ new Set,f=new Map(Cm.map(e=>[e.name,e])),p=/* @__PURE__ */ new Map,m=zp(e.checkDeadlock,t.seed);m.isWarningEnabled=t.isWarningEnabled??!0,m.isTool=t.isTool??!1,m.version=t.version??`master`,m.readLine=t.readLine;let h=/* @__PURE__ */ new Map,_=/* @__PURE__ */ new Map,v=[],y=/* @__PURE__ */ new Map,ee=[],b=[],x=(e,t)=>ee.forEach(n=>{n.add(e),[...t].forEach(e=>n.add(e))}),S=0,ne=e=>`${e}#${S++}`,re=[],T=[],ie=aw(e=>{let t=_.get(e)??O(e,e);return{constants:t.constants,variables:t.variables,definitions:[...new Set([...t.visible.values()].flatMap(e=>i.get(e.key)??[]))],assumptions:t.module.assumptions.map(e=>e.expression),theorems:t.module.theorems,getDefinition:e=>i.get(t.visible.get(e)?.key??e)}}),ae=/* @__PURE__ */ new Map,oe=/* @__PURE__ */ new Map,se=/* @__PURE__ */ new Map,ce=e=>{let n=p.get(e);if(n)return n;let r=Gm(e,t.print,m,t.files,f);if(!r)return;Um.get(e)?.forEach(ce);let i=/* @__PURE__ */ new Map;return Wm.get(e)?.forEach(e=>ce(e)?.forEach((e,t)=>i.set(t,e))),r.forEach(t=>{f.set(t.name,t),i.set(t.name,{key:t.name,arity:t.arity,params:Wu.get(t.name)?.formals.map(e=>e.arity),kind:`Definition`,range:Ku(e,t.name)??i.get(t.name)?.range})}),p.set(e,i),i},le=e=>{let n=Um.get(e)??[];if(e===`TLCExt`||[e,...n].some(e=>t.loadModule?.(e)!==void 0))return;let r=ce(e);return r&&x(e,n),r&&n.includes(`Integers`)&&ce(`Integers`),r},E=e=>(Rw([...e.definitions.flatMap(pt),...e.assumptions.map(e=>e.expression),...e.theorems.flatMap(e=>e.statement.kind===`AssumeProve`?[]:[e.statement]),...Lw(e.instances)]),e.modules.forEach(E),e);E(r);let D=(e,r)=>{let i=t.loadModule?.(e)??mm(m.version).get(e)??FC(t.source,e);if(i===void 0)throw te(e,r);let a=kw(i,e,n);if(a.name!==e)throw c([{location:`Unknown location`,message:`File name '${e}' does not match the name '${a.name}' of the top level module it contains.`}],!0);return E(a)},ue=e=>{let t=b.indexOf(e.name);if(t!==-1){let n=[...b.slice(t),e.name].map(e=>`${e}.tla`);throw new s(`Circular dependency among .tla files; dependency cycle is: ${n.join(` --> `)}`)}let n=/* @__PURE__ */ new Set,r=[],i=[],a=[];b.push(e.name),ee.push(n);let o=ve(e,{id:e.name,symbols:/* @__PURE__ */ new Map,modules:/* @__PURE__ */ new Map,nested:r,errors:i,warnings:T,levelChecks:a});if(ee.pop(),b.pop(),i.length>0)throw c(i,!1,void 0,T);let l=r.find(e=>n.has(e.name)),u=l&&h.get(l.name),d=u&&jw(l,u.module);if(d)throw c([d],!1,void 0,T);if(l)throw Aw(l);return a.forEach(e=>e()),{linked:o,closure:n}},O=(e,n)=>{let r=h.get(e);if(r)return x(e,y.get(e)??[]),r;let a=ue(D(e,n)),o=/* @__PURE__ */ new Map;return Hm(e,t.print,m,t.files,f,(e,t,n)=>{let r=o.get(e),i=t.flatMap(e=>typeof e==`object`&&e.kind===`Operator`&&e.expression?[e.expression]:[]);if(r?.kind!==`Operator`||!n||i.length!==t.length)throw new w(`No definition of ${e} to fall back to`);return W(r.body,{environment:n.environment,scope:sv(q_(r),i,n),state:n.state,next:n.next,isKeepLazy:n.isKeepLazy})})?.forEach(t=>{let n=a.linked.visible.get(t.name);if(n?.kind!==`Definition`||n.arity!==t.arity&&Dw.has(e))return;let r=i.get(n.key);r&&o.set(t.name,r),f.set(n.key,t),i.delete(n.key)}),h.set(e,a.linked),y.set(e,a.closure),x(e,a.closure),a.linked},k=(e,t,n,r,s)=>{let c=s?void 0:le(e.module);if(c)return de(e,c);let d=s??O(e.module,t.name);d.facts.forEach(t=>n.facts.add(e.name===void 0?t:`${e.name}!${t}`));let f=Ow(d),p=`#${S++}`,m=new Map(e.params.map(e=>[e.name,`${e.name}${p}`])),h=tu(nw(e,t),f,t,n);re.push({module:e.module,instancer:t.name,lets:[],substitutions:h,location:e.location});let g=e.params.map(e=>({...e,name:`${e.name}${p}`}));g.forEach(e=>u.add(e));let _=e.definitionRange?{...e.definitionRange,start:{line:e.location.line,column:e.location.column}}:e.instanceRange,v=zu({params:g,substitutions:new Map([...h].map(e=>[e[0],su(e[1],m)])),variables:new Set(d.variables),getDefinition:e=>i.get(e),getOuterDefinition:e=>t.definitions.find(t=>t.name===e),isParameterized:e=>a.get(e)===!0,addDefinition:(n,s,c)=>{let u=ne(`${s}@${t.name}`),d=c(u);return i.set(u,d),f.length>0&&l.add(d),e.name!==void 0&&oe.set(u,`${e.name}!${oe.get(n)??s}`),a.set(u,!r),o.set(u,{source:n,prefix:e.params.length}),u},createName:ne,...f.length>0&&{frame:{kind:`Identifier`,name:e.name??e.module,location:{..._.start,range:_}}}});return fe(e,d.exported,f,(t,n)=>{let r=e.name===void 0?v.getKey(t):v.getQualifiedKey(t);return f.length>0&&ae.set(r,{name:n,location:e.location}),e.name!==void 0&&se.set(r,n),r})},de=(e,t)=>e.name===void 0?t:new Map([...t].map(t=>[`${e.name}!${t[0]}`,{key:t[1].key,arity:t[1].arity,params:t[1].params,kind:t[1].kind}])),fe=(e,t,n,r)=>{let i=new Set(n.map(e=>e.name));return new Map([...t].filter(e=>!i.has(e[0])).map(t=>{if(e.name===void 0)return[t[0],{key:r(t[1].key,t[0]),arity:t[1].arity,params:t[1].params,kind:t[1].kind,range:a.get(t[1].key)===!0?e.location.range:t[1].range}];let n=`${e.name}!${t[0]}`;return[n,{key:r(t[1].key,n),arity:t[1].arity+e.params.length,params:t[1].params&&[...e.params.map(e=>e.arity),...t[1].params],kind:t[1].kind}]}))},pe=(e,t)=>Array.from({length:e},(e,n)=>({name:`argument${n}`,arity:t?.[n]??0})),me=(e,t,n)=>{if(t.arity===0)return{params:[],body:e};if(e.kind===`Lambda`)return{params:e.params.map(e=>({name:e,arity:0})),body:e.body};let r=pe(t.arity,void 0);return{params:r,body:{kind:`Apply`,operator:e.kind===`Identifier`?e.name:e.kind===`OperatorReference`?e.operator:t.name,args:Mu(r,n),location:n}}},he=(e,t,n,r)=>{let o=e.location,s=r?void 0:le(e.module);if(s)return e.name===void 0?[]:[...s].map(t=>{let n=pe(t[1].arity,t[1].params);return Nu(`${e.name}!${t[0]}`,t[1].key,[...e.params,...n],n,o)});let c=r??O(e.module,n),l=`#${S++}`,u=new Map(e.substitutions.map(e=>[e.name,e.expression])),d=Ow(c),f=e=>u.get(e.name)??{kind:`Identifier`,name:e.name,location:o};re.push({module:e.module,instancer:n,lets:t,substitutions:new Map(d.map(e=>[e.name,f(e)])),location:o});let p=new Set(e.params.map(e=>e.name)),m=e=>Fw(f(e),p),h=d.map(t=>{let n=me(f(t),t,o);return{kind:`Operator`,name:`${t.name}${l}`,params:[...m(t)?e.params:[],...n.params],body:n.body,isLocal:!0,isRecursive:!1,location:o}}),g=[],_=zu({params:e.params,substitutions:new Map(d.map(t=>[t.name,m(t)?{kind:`Apply`,operator:`${t.name}${l}`,args:Mu(e.params,o),location:o,resolution:mc}:ju(`${t.name}${l}`,o)])),variables:new Set(c.variables),getDefinition:e=>i.get(e),getOuterDefinition:()=>void 0,isParameterized:e=>a.get(e)===!0,addDefinition:(t,n,r)=>{let i=`${n}@${e.module}${l}.${g.length}`,a=r(i);return g.push(a.kind===`Operator`?{...a,name:i}:Pw(a,i)),i},createName:ne}),v=new Set(d.map(e=>e.name)),y=[...c.exported].filter(e=>!v.has(e[0])).map(t=>{let n=_.getKey(t[1].key),r=pe(t[1].arity,t[1].params),i=[...e.params,...r];return Nu(e.name===void 0?t[0]:`${e.name}!${t[0]}`,n,i,n===t[1].key?r:i,o)});return[...h,...g,...y]},ge=e=>[...e].flatMap(e=>{let t=i.get(e[1].key);return t?[{...t,name:e[0]}]:[]}),_e=/* @__PURE__ */ new Map,ve=(e,n)=>{let o=Dx(e,t.loadClass?.(e.name),e===r);_e.set(e.name,o.overrides);let s=o.module,c=re.length,l=new Map([...Cm.map(e=>[e.name,{key:e.name,arity:e.arity,kind:`Builtin`}]),...n.symbols]),u=/* @__PURE__ */ new Map,d={location:Xl,errors:[],warnings:[]},f=[d],p=e=>e.forEach((e,t)=>{let n=m.get(t);if(!n){l.set(t,e),m.set(t,e);return}if(!n.range||!e.range||g(n.range)===g(e.range))return;let r=g(e.range),i=g(n.range);Nw(n.kind)===Nw(e.kind)?d.warnings.push({location:r,message:`Warning: the ${Mw(n.kind)} of '${t}' conflicts with \nits ${Mw(n.kind)} at ${i}.`}):d.errors.push({location:r,message:`The ${Mw(e.kind)} of '${t}' conflicts with \nits ${Mw(n.kind)} at ${i}.`})}),m=/* @__PURE__ */ new Map,h=/* @__PURE__ */ new Set,y=/* @__PURE__ */ new Map,ee=[],b=[...s.constants],x=s.variables.filter((e,t)=>s.variables.findIndex(t=>t.name===e.name)===t),te=x.map(e=>e.name),S=x.map(e=>e.location);s.extends.forEach(e=>{let t=n.modules.get(e),r=t?void 0:le(e);if(r){p(r);return}let i=t??O(e,s.name);b.push(...i.constants.filter(e=>b.every(t=>t.name!==e.name)&&!te.includes(e.name))),i.variables.forEach((e,t)=>{te.includes(e)||b.some(t=>t.name===e)||(te.push(e),S.push(i.variableLocations[t]))}),p(i.exported),i.facts.forEach(e=>h.add(e)),i.modules.forEach((e,t)=>y.set(t,e)),ee.push(i)});let ne=new Map(l),C=[...s.constants.map(e=>({...e,kind:`Constant`})),...s.variables.map(e=>({...e,kind:`Variable`}))],w=e=>({key:e.name,arity:e.arity,kind:e.kind,range:e.location.range});C.forEach(e=>m.set(e.name,w(e)));let ae=e=>({key:ce(e),arity:Mc(e),params:Nc(e),kind:Zl(s,e)?`Theorem`:`Definition`,range:e.location.range}),oe=b.length===0&&te.length===0,ce=e=>s===r?e.name:`${e.name}@${n.id}`,E=/* @__PURE__ */ new Map,D=()=>new Map([...n.modules,...y]),ue=e=>{let t=s.modules.find(t=>t.name===e.module);return t?Ac(t.location,e.location)?y.get(t.name):void 0:D().get(e.module)},pe=e=>({imported:l,getInstance:e=>{let t=ue(e),n=t?void 0:le(e.module);if(n)return{declarations:[],symbols:de(e,n),instancer:s.name};let r=t??O(e.module,s.name),i=Ow(r);return{declarations:i,symbols:fe(e,r.exported,i,e=>e),instancer:s.name}},bound:ne,definitions:new Map(e.definitions.toReversed().map(e=>[e.name,e])),getKey:ce,instanced:E,facts:h,reports:f,warnings:n.warnings}),me=e=>[...C.filter(t=>Ac(t.location,e)).map(e=>[e.name,w(e)]),...s.definitions.filter(t=>Ac(t.location,e)).map(e=>[e.name,ae(e)])].reduce((e,t)=>e.has(t[0])?e:e.set(t[0],t[1]),new Map(l)),ye=e=>{let t=D(),r=t.get(e.name),i=r&&jw(e,r.module);if(r&&!i)throw Aw(e);n.nested.push(e);let a={location:e.location,errors:[],warnings:[]};f.push(a);let o=ve(e,{id:`${n.id}/${e.name}`,symbols:me(e.location),modules:t,nested:n.nested,errors:a.errors,warnings:a.warnings,levelChecks:n.levelChecks});i&&a.errors.push(i),r||y.set(e.name,o)};[...s.instances.map(e=>({location:e.location,link:()=>{let t=k(e,s,pe(s),oe,D().get(e.module));E.set(e,t),t.forEach((t,n)=>{l.has(n)||(u.set(n,e.location),l.set(n,t),e.isLocal||m.set(n,t))})}})),...s.modules.map(e=>({location:e.location,link:()=>ye(e)}))].sort((e,t)=>Ac(e.location,t.location)?-1:1).forEach(e=>e.link());let be=rw(Uu(s,(e,t)=>he(e,t,s.name,ue(e))),ge(l));n.errors.push(...ru(be,pe(be))),be.definitions.forEach(e=>{let t=ce(e);i.set(t,e),a.set(t,!oe);let n=ae(e),r=u.get(e.name);(n.kind!==`Theorem`||l.get(e.name)?.kind!==`Theorem`||r!==void 0&&!Ac(r,e.location))&&(l.set(e.name,n),e.isLocal||m.set(e.name,n))});let xe={module:be,constants:b,variables:te,variableLocations:S,visible:l,exported:m,modules:y,extended:ee,facts:/* @__PURE__ */ new Set([...h,...[...be.theorems,...be.assumptions].flatMap(e=>e.name??[])])};_.has(s.name)||_.set(s.name,xe);let Se=re.splice(c).map(e=>({location:e.location,check:()=>ie(e)}));return n.levelChecks.push(()=>Kd(be,{constants:new Set(b.map(e=>e.name)),variables:new Set(te),getDefinition:e=>i.get(l.get(e)?.key??e),getQualifiedName:e=>se.get(l.get(e)?.key??e)},Se,T)),v.push(xe),xe},ye=ue(r).linked,be=t.traceFile,xe=be===void 0?[]:[{kind:`postcondition`,module:`_TLCTrace`,operator:`_TLCTraceSilent`,constants:{_TLCTraceFile:be}}],Se=[...t.moduleOperators??[],...xe].map(e=>{let t=O(e.module,r.name).visible.get(e.operator);return{...e,key:t?.kind===`Definition`?t.key:void 0}});v.push(...v.splice(v.indexOf(ye),1)),T.length>0&&!t.isSanyReported&&t.print(d(T));let Ce=t.runtimeInvariants??[];Ce.forEach(e=>{if(e.module===void 0)return;h.set(r.name,ye);let t=O(e.module,r.name);v.splice(v.indexOf(t),1);let n=i.get(t.visible.get(e.name)?.key??e.name);n&&i.set(e.name,n)}),ye.visible.forEach((e,t)=>{let n=i.get(e.key);n&&e.key!==t&&i.set(t,n)}),Se.forEach(e=>{let t=e.key===void 0?void 0:i.get(e.key);e.kind!==`postcondition`&&t&&i.set(e.operator,t)});let we=[],Te=(e,t)=>{t.has(e)||(t.add(e),e.extended.forEach(e=>Te(e,t)),we.push(...e.module.assumptions))};Te(ye,/* @__PURE__ */ new Set);let Ee=ye.constants.map(e=>e.name),De=ye.variables,Oe=mx(e,{root:ye,moduleSymbols:new Map([...p,...[...h].map(e=>[e[0],e[1].visible]),[r.name,ye.visible]]),definitions:i,builtins:f,copySources:o,operatorConstants:new Map(Se.flatMap(e=>O(e.module,r.name).constants.flatMap(t=>{let n=e.constants?.[t.name];return n===void 0?[]:[[t.name,n]]}))),order:n}),ke=Oe.constants,A=Oe.substitutions;be!==void 0&&f.forEach((e,t)=>{let n=Om(e);n&&f.set(t,n)});let Ae=Iw(De,v.flatMap(e=>e.module.variables.map(e=>e.name))),je=of({definitions:i,substitutions:A,constants:ke,variableIndex:Ae,builtins:f,variables:De}),Me={runtime:m,definitions:i,builtins:f,constants:ke,substitutions:A,instanceNames:oe,variables:De,variableIndex:Ae,facts:je,startupValues:Array.from({length:je.ids.size},()=>void 0),tlcEvalValues:/* @__PURE__ */ new WeakMap,substitutedDefinitions:l,instanceParams:u,evaluators:/* @__PURE__ */ new WeakMap,entryEvaluators:/* @__PURE__ */ new WeakMap,definitionEvaluators:/* @__PURE__ */ new WeakMap},Ne=Wd({constants:new Set(ke.keys()),variables:/* @__PURE__ */ new Set([...De,...[`TLCGet`,`Trace`,`CounterExample`].filter(e=>f.has(e))]),getDefinition:e=>h_(e,Me)}),Pe=e=>{try{W(e,{environment:Me,scope:void 0,state:void 0,next:void 0});return}catch(e){if(e instanceof w)return e;throw e}};A.forEach((e,t)=>{let n=i.get(e),r=Ee.includes(t)&&n?.kind===`Operator`&&n.params.length===0&&Ne.analyzeDefinition(n,/* @__PURE__ */ new Map).level>0?Pe(n.body):void 0;if(r){let n=Ft(r)?``:` - specifically: ${r.message}`;throw new C(`The configuration file substitutes constant ${t} with non-constant ${e}${n}`)}}),m.version!==`1.7.4`&&(m.isStarted=!0);let Fe=new Set(v.flatMap(e=>e.module.instances.map(e=>e.module))),Ie=n.createDefinitionOrder();return{environment:Me,assumptions:we,variableLocations:ye.variableLocations,instanceActions:ae,startupDefinitions:v.filter(e=>!Fe.has(e.module.name)||Ow(e).length===0).flatMap(e=>Ie(e===ye?void 0:e.module.name).flatMap(t=>{let n=i.get(e.visible.get(t)?.key??t);return n?[n]:[]})),javaOverrides:v.flatMap(e=>_e.get(e.module.name)??[]),moduleOperators:Se,runtimeInvariants:Ce,rootName:r.name}},Bw=e=>[...e].map(e=>`${e[0]}>${e[1].name}`).sort().join(`,`),Vw=(e,t)=>{let n=/* @__PURE__ */ new Map;return(/* @__PURE__ */ new Set([...e.keys(),...t.keys()])).forEach(r=>{let i=e.get(r),a=i?t.get(i.name)??i:t.get(r);a&&a.name!==r&&n.set(r,a)}),n},Hw=e=>x(new w(`${l}${e}`),S.error),Uw=e=>{let t=I(e),n=/* @__PURE__ */ new Map;return t.domain.forEach((e,r)=>{let i=t.range[r];if(!mn(e)||!mn(i))throw Hw(`Symmetry function must have model values as domain and range.`);e.name!==i.name&&n.set(e.name,i)}),n},Ww=(e,t)=>{let n=e.kind===`Name`?e.name:`<<${e.names.join(`,`)}>>`;return t?`${n}\\in${Gw(t)}`:n},Gw=e=>{if(e.kind===`Identifier`)return e.name;if(e.kind===`Number`)return e.text??String(e.value);if(e.kind===`SetEnumeration`)return`{${e.elements.map(Gw).join(`,`)}}`;if(e.kind===`Choose`)return`CHOOSE${Ww(e.pattern,e.set)}:${Gw(e.body)}`;if(e.kind===`Tuple`)return`<<${e.elements.map(Gw).join(`,`)}>>`;if(e.kind===`Record`)return`[${e.fields.map(e=>`${e.name}|->${Gw(e.value)}`).join(`,`)}]`;if(e.kind===`FunctionConstruction`)return`[${e.bounds.map(e=>Ww(e.pattern,e.set)).join(`,`)}|->${Gw(e.body)}]`;if(e.kind!==`Apply`)return``;let t=e.args.map(Gw);return/^[A-Za-z_]/.test(e.operator)?`${e.operator}(${t.join(`,`)})`:t.join(e.operator)},Kw=e=>e.kind===`Apply`&&e.operator===`Permutations`&&e.args.length===1,qw=(e,t,n)=>{let r=t.definitions.get(e);if(r===void 0&&!t.constants.has(e))throw new C(`The symmetry function ${e} specified in the configuration file\nis not defined in the specification.`);if(r?.kind!==`Operator`||r.params.length>0)throw Hw(`The symmetry function ${e} must specify a set of permutations.`);let i=e=>W(e,{environment:t,scope:void 0,state:void 0,next:void 0}),a=i(r.body);if(!dn(a)||!P(a))throw Hw(`The symmetry operator must specify a set of functions.`);let o=F(a).elements;if(!o.every(pn))throw Hw(`The symmetry values must be function records.`);let s=r.body,c=s.kind===`Apply`?s.args:s.kind===`SetEnumeration`?s.elements:[],l=new Map(n.filter(e=>e.module===void 0).map(e=>[e.target,e.name])),u=e=>{if(e.length===0)return;let n=e.map(e=>{let t=Gw(Kw(e)?e.args[0]:e);return l.get(t)??t}),r=e.length>1;t.runtime.warn(wt.symmetrySetTooSmall,`The set${r?`s`:``} ${n.join(`, and `)} ${r?`have`:`has`} been defined to be a symmetry set but contain${r?``:`s`} less than two elements.`)};if(c.length>=o.length){u(c);return}let d=/* @__PURE__ */ new Map;o.map(Uw).forEach(e=>{e.size>0&&d.set(Bw(e),e)});let f=[...d.values()],p=0;for(;p<d.size;){let e=[...d.values()],t=e.length;f.forEach(n=>e.slice(p,t).forEach(e=>{let t=Vw(n,e),r=Bw(t);t.size>0&&!d.has(r)&&d.set(r,t)})),p=t}let m=new Set([...d.values()].flatMap(e=>[...e.values()].map(e=>e.name))),h=new Set(n.map(e=>e.name));if(u(c.filter(e=>{if(!Kw(e))return!1;let t=e.args[0];if(t.kind!==`Identifier`||h.has(t.name))return!1;let n=i(t);return typeof n==`object`&&n.kind===`Set`&&!n.elements.some(e=>mn(e)&&m.has(e.name))})),d.size!==0)return[...d.values()]},Jw=(e,t)=>{for(let n=0;n<e.length;n++){let r=e[n],i=Xw(r,t);if(i===r)continue;let a=e.slice(0,n);a.push(i);for(let r=n+1;r<e.length;r++)a.push(Xw(e[r],t));return a}},Yw=(e,t)=>{let n=[],r=[];for(let i of e){let e=Xw(i,t);e===i?n.push(i):r.push(e)}if(r.length===0)return;r.sort($n);let i=[],a=0,o=0;for(;a<n.length&&o<r.length;)i.push($n(n[a],r[o])<0?n[a++]:r[o++]);for(;a<n.length;)i.push(n[a++]);for(;o<r.length;)i.push(r[o++]);return i},Xw=(e,t)=>{if(typeof e!=`object`)return e;let n=e.kind;if(n===`ModelValue`)return t.get(e.name)??e;if(n===`Set`){let n=Yw(e.elements,t);return n?ir(n):e}if(n===`Function`||n===`LazyFunction`&&P(e.domain)){let n=I(e),r=Jw(n.domain,t),i=Jw(n.range,t)??n.range;if(r){let e=ti(r.map((e,t)=>[e,i[t]]));return e.domain.every((e,t)=>e===n.domain[t])?or(n.domain,e.range):e}return i===n.range?n:or(n.domain,i)}if(n===`Interval`||!dn(e)||!P(e))return e;let r=F(e),i=Jw(r.elements,t);return i?Yr(i):r},Zw=(e,t,n)=>{let r=e;for(let i of t){let t=e.slice(),a=0;for(let o of n)if(t[o]=Xw(e[o],i),a===0&&(a=$n(t[o],r[o])),a>0)break;a<0&&(r=t)}return r},Qw={line:0,column:0},$w=e=>({kind:`Identifier`,name:e,location:Qw}),eT=e=>({name:e,expression:$w(e),scope:void 0}),tT=/* @__PURE__ */ new Set([`name`,`property`]),nT=(e,t,n)=>{let r=h_(t,n);if(!r)throw new C(`The ${e} ${t} specified in the configuration file\nis not defined in the specification.`);if(r.kind===`Operator`&&r.params.length>0)throw new C(tT.has(e)?`TLC requires ${t} not to take any argument.`:`TLC requires ${e} not to take any argument, but one was given: ${t}`);return r},rT=e=>e.body.kind===`Number`||e.body.kind===`String`,iT=(e,t,n)=>n.constants.has(e)?n.constants.get(e):rT(t)?void 0:U_(t,n),aT=(e,t,n)=>{if(n.constants.has(t))throw new C(`The ${e} ${t} cannot be a constant.`);let r=nT(e,t,n);if(iT(t,r,n)!==void 0)throw new C(`The ${e} ${t} cannot be a constant.`);return r},oT=(e,t,n)=>{let r=n.constants.has(t)?void 0:nT(e,t,n),i=r?iT(t,r,n):n.constants.get(t);if(i!==void 0&&i!==!0)throw new C(`The ${e} of ${t} is equal to ${L(i)}`);return i===void 0?r:void 0},sT=(e,t)=>{e>1&&!(e&e-1)&&t?.({kind:`initial-states-progress`,count:e})},cT=(e,t,n)=>{let r=e.environment;r.runtime.warn=(e,t)=>n?.({kind:`warning`,code:e,text:t}),n?.({kind:`parsed`}),e.javaOverrides.forEach(e=>n?.({kind:`java-override`,...e})),W_(e.startupDefinitions,r),t.invariants.forEach(e=>{oT(`invariant`,e,r)||n?.({kind:`constant-level-invariant`,name:e})})},lT=(e,t)=>{let n=Wd({constants:new Set(t.constants.keys()),variables:new Set(t.variables),getDefinition:e=>t.definitions.get(e)});return e.flatMap(e=>{let r=oT(`invariant`,e,t);if(!r)return[];let i=n.analyzeDefinition(r,/* @__PURE__ */ new Map);if(i.level>=2){let t=i.params.size===0?``:`
1787
+ `},kC=(e,t,n,r=`Proof.Parser`)=>new s(e,void 0,{reason:`${e}${n.set}`,line:t.start.line,column:t.start.column,isEnd:!1,proof:{stop:t.stop,exception:r,printed:`${e}${n.printed}`}}),AC=/* @__PURE__ */ new Set([`CASE`,`CHOOSE`,`DOMAIN`,`ENABLED`,`IF`,`LAMBDA`,`LET`,`MODULE`,`SF_`,`SUBSET`,`UNCHANGED`,`UNION`,`WF_`]),jC=/* @__PURE__ */ new Map([[`CONSTANT`,`Constant`],[`CONSTANTS`,`Constant`],[`VARIABLE`,`Variable`],[`VARIABLES`,`Variable`],[`STATE`,`State`],[`ACTION`,`Action`],[`ACTIONS`,`Action`],[`TEMPORAL`,`Temporal`],[`TEMPORALS`,`Temporal`]]),MC=/* @__PURE__ */ new Set([`NEW`,...jC.keys()]),NC=/* @__PURE__ */ new Set([`(`,`[`,`{`,`<<`]),PC=/* @__PURE__ */ new Set([`)`,`]`,`}`,`>>`,`]_`,`>>_`]),FC=/* @__PURE__ */ new Set([`TRUE`,`FALSE`,`BOOLEAN`,`STRING`]),IC=e=>e.kind===`Prime`||e.kind===`Product`||(e.kind===`And`||e.kind===`Or`)&&!e.isBulleted||e.kind===`Apply`&&(e.args.length===2?nC.has(e.operator):cC.has(e.operator)),LC=e=>(e.text===`/\\`||e.text===`\\/`)&&e.spelling!==`\\land`&&e.spelling!==`\\lor`,RC=e=>nC.has(e)||cC.has(e)||e===`-.`,zC=(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}}},BC=(e,t)=>{let n=RegExp(`^-{4,}\\s*MODULE\\s+${t}\\s*-{3,}$`),r=e.replace(/\r?\n$/,``).split(/\r?\n/),i=r.findIndex(e=>n.test(e));if(i===-1)return;let a=r.findIndex((e,t)=>t>i&&e.startsWith(`====`));return`${r.slice(i,a===-1?void 0:a+1).join(`
1788
+ `)}\n`},VC=(e,t,n=Ee(e,t===`tlapm`))=>{let r=t===`tlapm`,i=r?n:n.map(xe),a=0,o=[],c,l,u=[],d=[],f,p=0,m=[],h=/* @__PURE__ */ new WeakMap,g=e=>u[u.length-1].has(e),_=e=>({line:e.line,column:r&&e.kind===`String`?e.endColumn:e.column,range:void 0}),v=[],y=[],ee=[],b=(e,t=a-1)=>{let n=e===t?ee[e]:void 0;if(n)return n;let r=i[t];v[e]??=_(i[e]),y[t]??={line:r.line,column:r.endColumn};let o={module:d[0].name,start:v[e],end:y[t]};return e===t&&(ee[e]=o),o},x=(e,t)=>(e.location.range=b(t),e),te=(e=0)=>i[Math.min(a+e,i.length-1)],S=(e=0)=>{let t=te(e),n=o[o.length-1];return n===void 0||n===-1||t.kind===`End`?t:t.column<=n?{...t,kind:`End`,text:``}:t},ne=e=>e.kind===`End`?`end of input`:JSON.stringify(e.text),C=e=>r&&(e.kind===`Keyword`||FC.has(e.text)),re=e=>{let t=i.findLast(t=>t.kind!==`End`&&(t.line<e.line||t.line===e.line&&t.column<e.column));return t?{line:t.line,column:t.endColumn+1}:e},w=e=>e.kind===`End`?`EOF`:/^-{4,}$/.test(e.text)?`----`:/^={4,}$/.test(e.text)?`====`:bC.has(e.text)||e.kind===`Number`||e.kind===`Decimal`?e.text:e.kind===`String`?JSON.stringify(e.text):e.kind===`Step`?e.text:C(e)?`keyword ${e.text}`:e.kind===`Identifier`?`identifier ${e.text}`:`operator ${e.text}`,T=(e,t=te(),n)=>{let r=i[i.length-1],a=t.line===r.line&&t.column===r.column,o=new s(`${e} at line ${t.line}, column ${t.column}`,void 0,ie(e,t,a,n));return f!==void 0&&h.set(o,f),o},ie=(e,t,n,a)=>{if(!r)return{reason:e,line:t.line,column:t.column,isEnd:n};let o=i[m[0]-1],s=a?`Unexpected ${w(a)}`:e;if(o)return{reason:s,line:o.line,column:o.endColumn+1,isEnd:n};let c=a?re(a):t;return{reason:s,line:c.line,column:c.column,isEnd:n}},ae=(e,t=te())=>T(e,t,t),oe=e=>{let t={cursor:a,frame:f,restorePoints:m.length,offsideColumns:o.length,recursiveScopes:u.length},n=++p;f=n;try{let n=e();return f=t.frame,n}catch(e){if(!(e instanceof s)||h.get(e)!==n)throw e;a=t.cursor,f=t.frame,m.length=t.restorePoints,o.length=t.offsideColumns,u.length=t.recursiveScopes;return}},se=e=>{let t=f;f=void 0;let n=e();return f=t,n},ce=e=>{m.push(a);let t=e();return m.pop(),t},le=e=>(e.kind===`Identifier`||e.kind===`Keyword`||e.kind===`Operator`&&e.text===`_`)&&!C(e),E=(e,t=0)=>{let n=S(t);return n.text===e&&n.kind!==`String`&&n.kind!==`End`},D=()=>{let e=S();if(e.kind===`End`)throw ae(`Unexpected end of expression`);return a++,e},O=e=>E(e)?(a++,!0):!1,k=e=>{if(!E(e))throw ae(`Expected ${JSON.stringify(e)} but found ${ne(S())}`);return D()},de=()=>{let e=S();if(e.kind!==`Identifier`)throw ae(`Expected an identifier but found ${ne(e)}`);if(C(e))throw ae(`Unexpected keyword ${e.text}`);return a++,e.text},fe=()=>{let e=a;return{name:de(),range:b(e)}},pe=e=>({names:e.map(e=>e.name),ranges:e.map(e=>e.range)}),me=()=>{let e=S();return e.kind!==`String`&&(dC.has(e.text)||nC.has(e.text)||lC.has(e.text))?(a++,e.text):de()},he=!1,ge=()=>S().kind===`Identifier`||!le(S())?de():(he=!0,D().text),_e=e=>{if(!r)return e();o.push(-1);let t=e();return o.pop(),t},ve=(e,t=`,`)=>{let n=[e()];for(;O(t);)n.push(e());return n},ye=(e=0)=>{if(E(`<<`,e)){let t=e+1;for(;S(t).kind===`Identifier`||E(`,`,t);)t++;return E(`>>`,t)&&E(`\\in`,t+1)}let t=e;for(;S(t).kind===`Identifier`;){if(E(`\\in`,t+1))return!0;if(!E(`,`,t+1))return!1;t+=2}return!1},be=()=>{if(E(`::`))return!0;if(!E(`(`))return!1;let e=1;for(;S(e).kind===`Identifier`&&E(`,`,e+1);)e+=2;return S(e).kind===`Identifier`&&E(`)`,e+1)&&E(`::`,e+2)},Se=()=>{if(!O(`<<`)){let e=fe();return{kind:`Name`,name:e.name,ranges:[e.range]}}let e=pe(E(`>>`)?[]:ve(fe));return k(`>>`),{kind:`Tuple`,names:e.names,ranges:e.ranges}},Ce=()=>{let e=()=>{let e=ve(Se);k(`\\in`);let t=se(j);return e.map(e=>({pattern:e,set:t}))},t=[e()];for(;E(`,`)&&(!r||ye(1));)D(),t.push(e());return t.flat()},we=()=>{let e=S();if(r&&FC.has(e.text)){let t=a;D();let n={kind:`Identifier`,name:e.text,location:_(e)};return{subscript:x(n,t),lastArgs:[]}}let t=r&&(e.kind===`Number`||e.kind===`String`||E(`@`));if(e.kind===`Identifier`){let t=a,n=[],i=[],o=e=>(i.push(b(a,a)),n.push(de()),e&&E(`(`)?A():[]),s=[o(!r)];for(;E(`!`)&&S(1).kind===`Identifier`;)D(),s.push(o(!0));let c=s.slice(0,-1),l=_(e);l.range={...b(t),end:i[i.length-1].end};let u=n.join(`!`);return{subscript:c.every(e=>e.length===0)?{kind:`Identifier`,name:u,location:l}:{kind:`Apply`,operator:u,args:c.flat(),argumentCounts:[...c.map(e=>e.length),0],argumentsRange:l.range,selectorRanges:i,location:l},lastArgs:s[s.length-1]}}if(E(`<<`)||E(`(`)||E(`{`)||E(`[`)||t){let e=a,t=Be();return{subscript:t.location.range?t:x(t,e),lastArgs:[]}}throw ae(`Expected a subscript but found ${ne(e)}`)},Te=e=>{let t=S(1),n=S(2);return t.kind===`Identifier`&&n.text===`==`?!0:t.line===e.line?!1:t.text===`-.`||t.kind===`Identifier`&&(n.text===`(`||n.text===`[`||n.kind===`Operator`&&E(`==`,lC.has(n.text)?3:4))},De=e=>{let t=S(1);return t.kind===`End`||t.kind===`ModuleEnd`||t.kind===`Separator`||E(`,`,1)||E(`)`,1)||t.kind===`Keyword`&&gC.has(t.text)||Te(e)},Oe=()=>{let e=S(),t=e.kind===`Operator`&&(nC.has(e.text)||uC.has(e.text))&&De(e);if(r&&e.kind!==`String`&&(uC.has(e.text)||mC.has(e.text)&&e.text!==`'`&&!cC.has(e.text)||pC.has(e.text)&&S(-1).text===`(`&&S(-1).line===e.line&&S(-1).endColumn+1===e.column&&S(1).text===`)`&&S(1).line===e.line&&S(1).column===e.endColumn+1)&&De(e))throw T(`incomplete expression`,e);if(t&&!r&&e.text===`\\X`&&e.spelling!==`×`)throw T(`\\X may not be used as an infix operator`,e);if(t)return a++,x({kind:`OperatorReference`,operator:e.text,spelling:e.spelling,location:_(e)},a-1);if(e.kind!==`String`&&mC.has(e.text)&&De(e)){a++;let t=_(e);if(cC.has(e.text))return x({kind:`OperatorReference`,operator:e.text,spelling:e.spelling,location:t},a-1);let n={kind:`Identifier`,name:`argument`,location:t};return x({kind:`Lambda`,params:[n.name],body:zC(e.text,n,t),operator:e.text,location:_(e)},a-1)}if(E(`LAMBDA`)){let t=a;D();let n=pe(ve(fe));k(`:`);let r=j();return x({kind:`Lambda`,params:n.names,paramRanges:n.ranges,body:r,location:_(e)},t)}if(!r)return j();let n=oe(j);if(n)return n;throw ae(`Unexpected ${ne(S())}`)},ke,A=()=>_e(()=>{let e=a;k(`(`);let t=ve(Oe);return k(`)`),ke=b(e),t}),Ae=()=>{let e=D();o.push(e.column);let t=[j()],n=()=>{for(;LC(te())&&te().text===e.text&&te().column===e.column;)a++,t.push(j())};return r?se(n):n(),o.pop(),{kind:e.text===`/\\`?`And`:`Or`,operands:t,isBulleted:!0,location:_(e)}},je=e=>_e(()=>{let t=_(e),n=S().kind===`Identifier`,i=E(`|->`,1)&&(n||le(S()));if(i||n&&E(`:`,1)){let e=i?`Record`:`RecordSet`,r=e=>{let t=a,n=_(S()),r=e();return n.range=b(t),k(i?`|->`:`:`),{name:r,value:j(),location:n}},o=[r(()=>n?de():D().text),...O(`,`)?ve(()=>r(de)):[]];return k(`]`),{kind:e,fields:o,location:t}}if(ye()){let e=a,n=Ce();if(!r||E(`|->`)){k(`|->`);let e=j();return k(`]`),{kind:`FunctionConstruction`,bounds:n,body:e,location:t}}a=e}let o=j();if(O(`->`)){let e=j();return k(`]`),{kind:`FunctionSet`,domain:o,range:e,location:t}}if(O(`EXCEPT`)){let e=ve(()=>{k(`!`);let e=[];for(;E(`.`)||E(`[`);)if(O(`.`)){if(!le(S()))throw ae(`Expected a field name but found ${ne(S())}`);if(!r&&E(`@`))throw ae(`@ used in !.@`);e.push({kind:`Field`,name:D().text})}else k(`[`),e.push({kind:`Index`,args:ve(()=>j())}),k(`]`);return k(`=`),{path:e,value:j()}});return k(`]`),{kind:`Except`,function:o,updates:e,location:t}}if(!r&&!E(`]_`)){let e=[o];for(;O(`,`);)e.push(j());return k(`]`),{kind:`Bracket`,args:e,location:t}}return k(`]_`),{kind:`BoxAction`,action:o,subscript:we().subscript,location:t}}),Me=()=>{let e=a,t=x(He(),e),n=_(D());return x({kind:`Apply`,operator:`\\in`,args:[t,se(j)],location:n},e)},Ne=e=>_e(()=>{let t=_(e);if(O(`}`))return{kind:`SetEnumeration`,elements:[],location:t};if(ye()&&(S(1).text===`\\in`||E(`<<`))){let e=a,n=Se();k(`\\in`);let r=se(j);if(O(`:`)){let e=se(j);return k(`}`),{kind:`SetFilter`,bound:{pattern:n,set:r},predicate:e,location:t}}a=e}let n=S().kind===`Identifier`&&E(`\\in`,1)?Me():j();if(O(`:`)){let e=Ce();return k(`}`),{kind:`SetMap`,expression:n,bounds:e,location:t}}let r=[n];for(;O(`,`);)r.push(j());return k(`}`),{kind:`SetEnumeration`,elements:r,location:t}}),Pe=e=>{let t=_(e),n=_e(()=>E(`>>`)||E(`>>_`)?[]:ve(()=>j()));if(O(`>>_`)){if(n.length!==1)throw T(`Expected a single action inside <<A>>_v`,e);return{kind:`AngleAction`,action:n[0],subscript:se(we).subscript,location:t}}return k(`>>`),{kind:`Tuple`,elements:n,location:t}},Fe=e=>{let t=_(e),n=e.text===`\\A`?`Forall`:`Exists`,r=e.text===`\\AA`||e.text===`\\EE`;if(!r&&ye()){let e=Ce();return k(`:`),{kind:n,bounds:e,body:j(),location:t}}let i=pe(ve(fe));return k(`:`),{kind:`UnboundedQuantifier`,quantifier:e.text===`\\A`||e.text===`\\AA`?`Forall`:`Exists`,names:i.names,nameRanges:i.ranges,body:j(),isTemporal:r,location:t}},Ie=e=>{let t=[];do{let n=a;if(O(`OTHER`))return k(`->`),{kind:`Case`,arms:t,other:j(),otherRange:b(n),location:_(e)};let r=j();k(`->`),t.push({condition:r,body:j()})}while(O(`[]`));return{kind:`Case`,arms:t,other:void 0,location:_(e)}},Le=()=>{let e=S(1);return E(`!`)&&(e.kind===`Identifier`||e.kind===`Number`||hC.has(e.text)||e.kind===`Operator`&&(nC.has(e.text)||lC.has(e.text))||(e.kind===`Operator`||e.kind===`Keyword`)&&dC.has(e.text))},Re=()=>{let e=D();if(e.kind===`Number`)return{kind:`Operand`,operand:ue(e.text)};switch(e.text){case`<<`:case`>>`:return{kind:`Operand`,operand:e.text};case`:`:return{kind:`Colon`};case`@`:return{kind:`At`};case`(`:return a--,{kind:`Bound`,args:A()}}return{kind:`Name`,name:e.text,args:E(`(`)?A():[]}},ze=(e,t,n,r,i)=>{let o=[{kind:`Name`,name:e,args:t}],s=[b(r,r)],c=[n];for(;Le();){D();let e=a;ke=void 0;let t=Re();s.push(t.kind===`Bound`?b(e):b(e,e)),o.push(t),c.push(ke)}let l=o.flatMap(e=>e.kind===`Name`?[e.name]:[]),u=l.join(`!`),d=o.flatMap(e=>`args`in e?e.args:[]),f=o.map(e=>`args`in e?e.args.length:0);return l.length<o.length?{kind:`Subexpression`,selectors:o,selectorRanges:s,argumentRanges:c,location:i}:d.length===0?{kind:`Identifier`,name:u,selectorRanges:s,location:i}:{kind:`Apply`,operator:u,args:d,...f.slice(0,-1).some(e=>e>0)&&{argumentCounts:f},argumentsRange:c.at(-1)??b(r),selectorRanges:s,argumentRanges:c,location:i}},Be=e=>{let n=a,i=D(),o=_(i);if(r&&i.kind===`Keyword`&&i.text===`LAMBDA`){let e=ve(de);return k(`:`),{kind:`Lambda`,params:e,body:j(),location:o}}if(i.kind===`Number`)return{kind:`Number`,value:ue(i.text),text:i.text,location:o};if(i.kind===`Decimal`)return{kind:`Decimal`,text:i.text,location:o};if(i.kind===`String`)return{kind:`String`,value:i.text,location:o};let s=i.kind===`Step`&&St(i);if(!r&&s&&yt()<0&&vt.length<=1)throw T(`Step number used outside proof`,i);if(s&&i.text[1]===`+`)throw T(`<+> step number used in an expression`,i);if(i.kind===`Identifier`||s){let t=s?Ct(i)??i.text:i.text;if(be()){let a=pe(O(`(`)?ve(fe):[]);a.names.length>0&&k(`)`),k(`::`);let s=b(n),l=j();if(!r&&e!==void 0&&c!==void 0&&IC(l)&&e.high>=c.low)throw T(`Removing the label would change expression parsing`,i);return{kind:`Label`,name:t,params:a.names,paramRanges:a.ranges,head:s,body:l,location:o}}let a=E(`(`);if(t===`@`&&!a&&!Le())return{kind:`ExceptAt`,location:o};let l=a?A():[];return Le()?ze(t,l,a?ke:void 0,n,o):a?{kind:`Apply`,operator:t,args:l,argumentsRange:ke,location:o}:{kind:`Identifier`,name:t,location:o}}let l=i.kind===`Operator`&&(RC(i.text)||i.text===`'`&&!r);if(l&&E(`(`)){let e=A();return!r&&Le()?ze(i.text,e,ke,n,o):t===`tlc`&&i.text===`\\X`&&e.length===2?{kind:`Product`,factors:e,location:o}:i.text===`'`&&e.length===1?{kind:`Prime`,expression:e[0],location:o}:{kind:`Apply`,operator:i.text,spelling:i.spelling,args:e,argumentsRange:ke,location:o}}if(l&&!r)return Le()?ze(i.text,[],void 0,n,o):{kind:`Identifier`,name:i.text,spelling:i.spelling,location:o};switch(i.text){case`(`:{let e=_e(()=>j());return k(`)`),e}case`[`:return je(i);case`{`:return Ne(i);case`<<`:return Pe(i);case`@`:return{kind:`ExceptAt`,location:o};case`\\A`:case`\\E`:case`\\AA`:case`\\EE`:return Fe(i);case`IF`:{let e=j();k(`THEN`);let t=j();return k(`ELSE`),{kind:`If`,condition:e,consequent:t,alternative:j(),location:o}}case`CASE`:return Ie(i);case`LET`:{let e=[],t=[],n=[];for(u.push(/* @__PURE__ */ new Set);!O(`IN`);){if(r&&E(`RECURSIVE`))throw ae(`Unexpected keyword RECURSIVE`);if(O(`RECURSIVE`)){n.push(...M());continue}let i=lt(!r&&O(`LOCAL`));i.kind===`Instance`?t.push(i):e.push(i)}return u.pop(),{kind:`Let`,definitions:e,...t.length>0&&{instances:t},...n.length>0&&{recursive:n},body:j(),location:o}}case`CHOOSE`:{let e=Se(),t=O(`\\in`)?j():void 0;return k(`:`),{kind:`Choose`,pattern:e,set:t,body:j(),location:o}}case`WF_`:case`SF_`:{let e=we(),t=!E(`(`)&&e.lastArgs.length===1?e.lastArgs[0]:_e(()=>{k(`(`);let e=j();return k(`)`),e});return{kind:i.text===`WF_`?`WeakFairness`:`StrongFairness`,subscript:e.subscript,action:t,location:o}}}throw ae(`Unexpected ${ne(i)}`,i)},Ve=(e,t,n)=>{c=l={low:t,high:n};let r=j(n+1),i=S(),a=lC.has(i.text)?eC.high:nC.get(i.text)?.high;if(i.kind===`Operator`&&a!==void 0&&a>=t)throw T(`Precedence conflict between ${e.text} and ${i.text}`,i);return r},He=()=>{let e=l;l=void 0;let t=S(),n=_(t);if(t.kind===`Operator`&&LC(t))return Ae();if(t.kind===`Operator`||t.kind===`Keyword`)switch(t.text){case`~`:return D(),{kind:`Apply`,operator:`~`,args:[Ve(t,4,4)],location:n};case`-`:return D(),{kind:`Apply`,operator:`-.`,args:[Ve(t,12,12)],location:n};case`[]`:case`<>`:case`ENABLED`:case`UNCHANGED`:return D(),zC(t.text,Ve(t,4,15),n);case`SUBSET`:case`UNION`:case`DOMAIN`:return D(),{kind:`Apply`,operator:t.text,args:[Ve(t,10,13)],location:n}}return Be(e)},Ue=(e,t,n,r,i)=>{let a=_(e);if(e.text===`/\\`||e.text===`\\/`){let o=e.text===`/\\`?`And`:`Or`;return t.kind===o&&r?{...t,operands:[...t.operands,n],prefixEnds:[...t.prefixEnds??[],i]}:{kind:o,operands:[t,n],prefixEnds:[i],location:a}}return e.text===`\\X`?t.kind===`Product`&&r?{...t,factors:[...t.factors,n]}:{kind:`Product`,factors:[t,n],location:a}:{kind:`Apply`,operator:e.text,spelling:e.spelling,args:[t,n],location:a}},We=(e,t)=>e.text===`'`?{kind:`Prime`,expression:t,location:_(e)}:{kind:`Apply`,operator:e.text,spelling:e.spelling,args:[t],location:_(e)},Ge=()=>{D();let e=_e(()=>ve(()=>j()));return _e(()=>k(`]`)),e},Ke=e=>{let t=a,n=He(),r=n.location.range?n:x(n,t),i;for(;;){let n=S();if(n.kind!==`Operator`)break;let a=_(n);if(lC.has(n.text)&&e<=15){D(),c=eC,r=x(We(n,r),t);continue}if(n.text===`[`){let e=Ge();c=tC,r=x({kind:`FunctionApplication`,function:r,args:e,location:a},t);continue}if(n.text===`.`&&le(S(1))){D();let e=D().text;r=x({kind:`FieldAccess`,record:r,field:e,location:a},t);continue}let o=nC.get(n.text);if(!o||o.low<e)break;if(i){let e=!(i.low>o.high||i.high<o.low),t=i.text===n.text&&o.isAssociative;if(e&&!t&&(i.text!==`\\X`||n.text!==`\\X`))throw T(`Precedence conflict between ${i.text} and ${n.text}`,n)}if(D(),o.low>12&&E(`-`))throw T(`Precedence conflict between ${n.text} and -`,S());c=l=o;let s=j(o.high+1),u=i?.text===n.text;r=x(Ue(n,r,s,u,b(t).end),t),i={...o,text:n.text}}return r},qe=e=>e.kind===`Number`||e.kind===`Decimal`||e.kind===`String`||e.kind===`Identifier`||e.kind===`Step`&&St(e)&&/^<\d/.test(e.text)||(e.kind===`Operator`||e.kind===`Keyword`)&&oC.has(e.text),Je=(e,t)=>({start:t,end:a-1,expression:e.location.range?e:x(e,t)}),Ye=(e,t,n,r)=>({...n,start:e,end:a-1,fixity:t,isLeft:!1,apply:r}),Xe=e=>e.kind===`Operator`&&lC.has(e.text)&&E(`(`,1)?oe(()=>_e(()=>{D(),D();let t=j(),n=a-1;return k(`)`),{end:n,expression:We(e,t)}})):void 0,Ze=()=>{let e=0;for(let t=a+1;t<i.length;t++){let n=i[t];if(n.kind===`Operator`){if(e===1&&n.text===`,`)return!0;if(i[t-1].text!==`!`&&(NC.has(n.text)&&e++,PC.has(n.text)&&--e===0))return!1}}return!1},Qe=e=>E(`(`,1)&&Ze()?oe(()=>_e(()=>{D(),D();let t=j();k(`,`);let n=j();return k(`)`),{kind:`Apply`,operator:e.text,args:[t,n],location:_(e)}})):void 0,$e=e=>{let t=a,n=S(),r=_(n),i=n.kind===`Operator`||n.kind===`Keyword`,o=i?nC.get(n.text):void 0;if(!e){if(E(`[`)){let e=Ge();return Ye(t,`Postfix`,aC,t=>({kind:`FunctionApplication`,function:t[0].expression,args:e,location:r}))}if(E(`.`)&&le(S(1))){D();let e=D().text;return Ye(t,`Postfix`,aC,t=>({kind:`FieldAccess`,record:t[0].expression,field:e,location:r}))}if(o){if(Qe(n)){a=t;return}return D(),{...Ye(t,`Infix`,o,e=>Ue(n,e[0].expression,e[1].expression,e[0].joinedBy===n.text,b(e[0].start,e[1].end).end)),isLeft:rC(n.text,o),joins:n.text}}if(n.kind!==`Operator`||!lC.has(n.text))return;if(Xe(n)){a=t;return}return D(),Ye(t,`Postfix`,eC,e=>We(n,e[0].expression))}if(n.kind===`Operator`&&LC(n))return Je(Ae(),t);let s=o?Qe(n):void 0;if(s)return Je(s,t);let c=Xe(n);if(c)return c.expression.location.range=b(t,c.end),{start:t,end:c.end,expression:c.expression};let l=i?iC.get(n.text):void 0;if(l)return D(),Ye(t,`Prefix`,l,e=>zC(n.text===`-`?`-.`:n.text,e[0].expression,r));if(!qe(n))return;let u=n.kind===`Operator`&&sC.has(n.text);return Je(u?Be():se(Be),t)},et=e=>e!==void 0&&`fixity`in e,tt=e=>e!==void 0&&!(`fixity`in e),nt=(e,t)=>{let n=Math.min(e.start,t[0].start),r=Math.max(e.end,t[t.length-1].end),i=e.apply(t);return i.location.range=b(n,r),{start:n,end:r,expression:i,joinedBy:e.joins}},rt=e=>{let t=e.pop(),n=e.pop();if(!tt(t)||!et(n))throw T(`incomplete expression`);let r=n.fixity===`Infix`?e.pop():void 0;e.push(nt(n,tt(r)?[r,t]:[t]))},it=e=>{let t=e[e.length-2];return et(t)?t:void 0},at=(e,t)=>t!==void 0&&e.high<t.low,ot=()=>ce(()=>{let e=oe(()=>$e(!0));if(e===void 0){let e=te();throw e.kind===`End`?ae(`Unexpected end of expression`,e):T(`required expressions(s) missing before '${w(e)}'`,e)}return se(()=>{let t=[e];for(;;){let e=oe(()=>$e(et(t[t.length-1])));if(e===void 0)break;if(tt(e)||e.fixity===`Prefix`){t.push(e);continue}for(;at(e,it(t));)rt(t);let n=t[t.length-1];if(e.fixity===`Postfix`&&tt(n)){t.splice(-1,1,nt(e,[n]));continue}let r=it(t);r?.fixity===`Infix`&&r.isLeft&&e.isLeft&&!at(r,e)&&rt(t),t.push(e)}for(;t.length>1;)rt(t);let n=t[0];if(!tt(n))throw T(`incomplete expression`);return n.expression})}),j=(e=0)=>r?ot():Ke(e),st=()=>{if(!O(`(`))return[];let e=ht();return k(`)`),e},ct=()=>{let e=_(S()),t=j(),n=i[a-1],r={line:n.line,column:n.endColumn};return{body:t,bodyRange:{module:d[0].name,start:e,end:r}}},lt=e=>{let t=a;return x(dt(e),t)},ut=e=>({name:e.name,arity:0,location:{line:e.range.start.line,column:e.range.start.column,range:e.range}}),dt=e=>{let t=S(),n=a,r=_(t),i=(t,i)=>({kind:`Operator`,name:t,params:i,head:b(n,a-2),...ct(),isLocal:e,isRecursive:g(t),location:r});if(t.kind===`Identifier`&&S(1).kind===`Operator`&&nC.has(S(1).text)&&S(2).kind===`Identifier`&&E(`==`,3)){let e=fe(),t=D().text,n=fe();return k(`==`),i(t,[ut(e),ut(n)])}let o=t.kind!==`String`&&dC.has(t.text),s=t.kind===`Identifier`&&lC.has(S(1).text)&&E(`==`,2);if(o||s){let e=o?t.text:S(1).text;o&&D();let n=fe();return s&&D(),k(`==`),i(e,[ut(n)])}let c=de();if(O(`[`)){let t=_e(()=>Ce());return k(`]`),k(`==`),{kind:`Function`,name:c,bounds:t,body:j(),isLocal:e,isRecursive:g(c),location:r}}let l=a,u=st();return k(`==`),E(`INSTANCE`)?{...ft(c,u,e,r),definitionRange:b(l)}:i(c,u)},ft=(e,t,n,r)=>{let i=a;return k(`INSTANCE`),{kind:`Instance`,name:e,params:t,module:ge(),substitutions:O(`WITH`)?ve(()=>{let e=a,t=me(),n=b(e);return k(`<-`),{name:t,nameRange:n,expression:Oe()}}):[],isLocal:n,location:r,instanceRange:b(i)}},pt=()=>{let e=a;return x(mt(),e)},mt=()=>{let e=_(S());if(E(`_`)&&S(1).kind===`Operator`&&(nC.has(S(1).text)||lC.has(S(1).text)))return D(),{name:D().text,arity:O(`_`)?2:1,location:e};if(S().kind!==`String`&&(dC.has(S().text)||r&&S().kind===`Operator`)&&E(`_`,1)){let t=D().text;return D(),{name:t===`-`?`-.`:t,arity:1,location:e}}let t=de();if(!O(`(`))return{name:t,arity:0,location:e};let n=ve(()=>k(`_`));return k(`)`),{name:t,arity:n.length,location:e}},ht=()=>ve(pt),M=()=>{let e=ht();return e.forEach(e=>u[u.length-1].add(e.name)),e},gt=e=>{let t=0,n=e;do{let e=S(n);if(e.kind===`End`)return n;e.kind===`Operator`&&NC.has(e.text)&&t++,e.kind===`Operator`&&PC.has(e.text)&&t--,n++}while(t>0);return n},_t=()=>{let e=S(),t=S(1);return e.kind===`Identifier`?E(`(`,1)||E(`[`,1)?E(`==`,gt(1)):t.kind===`Operator`&&lC.has(t.text)?E(`==`,2):t.kind===`Operator`&&nC.has(t.text)?S(2).kind===`Identifier`&&E(`==`,3):E(`==`,1):e.kind!==`String`&&dC.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(`.`)&&!xC.has(xt(e)),Ct=e=>{let t=xt(e);if(xC.has(t))return;let n=bt(e);if(n>=0)return`<${n}>${t}`;let r=yt(),i=vt[vt.length-2];return`<${r<0&&i!==void 0?i:r}>${t}`},N=e=>{if(e.kind===`Keyword`)return vC.has(e.text);if(e.kind!==`Step`)return!1;if(e.text[1]===`*`)return vt.length===0;if(e.text[1]===`+`||vt.length===0)return!0;let t=yt();return t>=0&&bt(e)>t},wt=e=>{let t=bt(e),n=vt.length-1,r=vt[n-1]??-1,i=vt[n]<0;return i&&(vt[n]=t<0?r+1:t),t===-1?!0:t===-2?i:i?t>r:vt[n]===t},Tt=()=>{let e=S();return e.kind===`Step`?St(e):e.kind===`Keyword`?AC.has(e.text):e.kind===`End`||e.kind===`ModuleEnd`||e.kind===`Separator`?!1:!_t()},Et=()=>{let e=a,t=S();return t.kind===`Operator`&&!fC.has(t.text)&&RC(t.text)?(a++,x({kind:`OperatorReference`,operator:t.text,spelling:t.spelling,location:_(t)},e)):O(`MODULE`)?x({kind:`ModuleFact`,name:de(),location:_(t)},e):j()},Dt=()=>{let e=a,t=S(),n=ve(()=>{let e=S();if((e.kind!==`Identifier`||C(e))&&e.kind!==`Operator`)throw ae(`Expected a definition name but found ${ne(e)}`,e);return a++,e.text},`!`),r=_(t);return x(n.length===1&&t.kind===`Operator`?{kind:`OperatorReference`,operator:t.text,location:r}:{kind:`Identifier`,name:n.join(`!`),location:r},e)},Ot=()=>ve(r?Dt:Et),kt=()=>{let e=oe(j);if(!e)return[];let t=[e];return ce(()=>{for(;E(`,`);){let e=oe(()=>(D(),j()));if(!e)return;t.push(e)}}),t},At=()=>{let e=r?kt():Tt()?ve(Et):[],t=O(`DEF`)||O(`DEFS`);if(r&&e.length===0&&!t)throw ae(`Expected a fact`);return{facts:e,defs:t?Ot():[]}},jt=()=>{let e=a,t=D(),n=t.text===`USE`&&O(`ONLY`),r=b(e);return x({kind:t.text===`USE`?`Use`:`Hide`,isOnly:n,...At(),keyword:r,location:_(t)},e)},Mt=()=>{let e=a,t=_(S()),n=O(`NEW`),i=r?a:e,o=r?_(S()):t,s=S().kind===`Keyword`?jC.get(S().text):void 0;if(!n&&s===void 0)throw ae(`Expected a declaration but found ${ne(S())}`);if(s!==void 0&&D(),s===`Variable`){let e=fe();return x({kind:`NewSymbol`,name:e.name,arity:0,level:s,set:void 0,nameRange:e.range,location:o},i)}let c=pt(),l=(s??`Constant`)===`Constant`&&E(`\\in`);if(l&&c.arity>0)throw T(`declared symbol with arguments before \\in`);return l&&D(),x({kind:`NewSymbol`,name:c.name,arity:c.arity,level:s??`Constant`,set:l?j():void 0,nameRange:c.location.range,location:o},i)},Nt=()=>{if(S().kind===`Identifier`&&E(`::`,1)&&E(`ASSUME`,2)&&(D(),D()),E(`ASSUME`))return Ft();if(S().kind===`Keyword`&&MC.has(S().text))return r?se(Mt):Mt();if(!r)return j();let e=oe(j);if(e===void 0)throw ae(`Expected a hypothesis`);return e},Pt=()=>{let e=[Nt()];return ce(()=>{for(;;){let t=oe(()=>(k(`,`),Nt()));if(t===void 0)break;e.push(t)}}),e},Ft=()=>{let e=a,t=_(k(`ASSUME`)),n=()=>{let n=r?Pt():ve(Nt);return k(`PROVE`),x({kind:`AssumeProve`,assumptions:n,conclusion:j(),location:t},e)};return r?se(n):n()},It=e=>{let t=0;for(;S(t).kind===`Identifier`&&E(`,`,t+1);)t+=2;return S(t).kind===`Identifier`&&E(e,t+1)},Lt=()=>{let e=S();if(E(`USE`)||E(`HIDE`))return jt();if(!r&&E(`INSTANCE`)){let t=a;return x(ft(void 0,[],!1,_(e)),t)}if(E(`DEFINE`)||_t()){let t=a;O(`DEFINE`);let n=[lt(!1)];for(;_t();)n.push(lt(!1));let r={kind:`Define`,definitions:n,location:_(e)};return x(r,t)}if(O(`HAVE`))return{kind:`Have`,expression:j()};if(O(`TAKE`)){let e=ye(),t=pe(e?[]:ve(fe)),n=e?Ce():[];return{kind:`Take`,names:t.names,nameRanges:t.ranges,bounds:n}}if(O(`WITNESS`))return{kind:`Witness`,expressions:ve(()=>j())};if(O(`PICK`)){let e=It(`:`),t=pe(e?ve(fe):[]),n=e?[]:Ce();return k(`:`),{kind:`Pick`,names:t.names,nameRanges:t.ranges,bounds:n,body:j()}}return O(`CASE`)?{kind:`Case`,expression:j()}:{kind:`Assert`,isSuffices:O(`SUFFICES`),statement:E(`ASSUME`)?Ft():j()}},Rt=e=>{let n=S();if(n.kind!==`Step`)throw ae(`Expected a step number but found ${ne(n)}`,n);if(!wt(n))throw T(`${e?`QED step`:`step`}'s number has bad level`,n);if(t!==`sany`&&bt(n)<0&&Ct(n)!==void 0)throw T(`<*> and <+> cannot be used for a named step`,n);return a++,{name:Ct(n),token:n.text,location:_(n)}},zt=()=>{let e=a,t=Rt(E(`QED`,1)),n=a,r=O(`QED`)?{kind:`Qed`}:Lt(),i=b(e),o=b(n),s=N(S());if(s&&!yC.has(r.kind))throw T(`Proof of a step that does not take a proof`);let c=s?Ht():void 0;return x({...t,body:r,head:i,statement:o,proof:c},e)},Bt=e=>{if(O(`BY`)){let t=b(a-1);return{kind:`By`,isOnly:O(`ONLY`),...At(),keyword:t,location:e}}let t=S();if(t.kind!==`Keyword`||t.text!==`OBVIOUS`&&t.text!==`OMITTED`)return;D();let n=b(a-1);return{kind:t.text===`OBVIOUS`?`Obvious`:`Omitted`,keyword:n,location:e}},Vt=()=>{let e=_(S());O(`PROOF`);let t=Bt(e);if(t)return t;let n=[zt()];for(;n[n.length-1].body.kind!==`Qed`;)n.push(zt());return{kind:`Steps`,level:yt(),steps:n,location:e}},Ht=()=>{let e=a;vt.push(-1);let t=Vt();return vt.pop(),x(t,e)},Ut=()=>S().kind===`Step`||S().kind===`Keyword`&&vC.has(S().text),Wt=(e,t)=>{if(t.kind!==`Use`&&t.kind!==`Hide`)return TC(e);let n=t.defs[t.defs.length-1]?.location.range;return wC(TC({...e,end:e.start}),TC(n??t.keyword))},Gt=()=>{let e=a,t=_(S()),n=O(`PROOF`),r=Bt(t);if(r){let t=x(r,e);return{kind:`Leaf`,proof:t,span:TC(t.keyword),first:e,end:a-1}}let i=S();if(i.kind!==`Step`)throw ae(`Expected a step number but found ${ne(i)}`);let o=a;D();let s=a,c=O(`QED`)?{kind:`Qed`}:Lt(),l=b(o);return{kind:`Step`,token:i,isProof:n,body:c,head:l,statement:b(s),span:Wt(l,c),first:e,start:o,end:a-1}},Kt=(e,t,n,r)=>{let a=e[t];if(!a)return{proof:void 0,span:r,next:t,end:void 0};if(a.kind===`Leaf`)return{proof:a.proof,span:a.span,next:t+1,end:a.end};let o=qt(e,t,n,r,!0);if(!o)return{proof:void 0,span:r,next:t,end:void 0};let s={..._(i[a.first]),range:b(a.first,o.end)};return{proof:{kind:`Steps`,level:o.level,steps:o.steps,location:s},span:o.span,next:o.next,end:o.end}},qt=(e,t,n,r,i)=>{let a=e[t];if(!a)throw kC(`Unexpected end of (sub)proof at level ${n} before QED step`,r,OC);if(a.kind===`Leaf`)throw kC(`Expecting a proof step but found a${SC[a.proof.kind]} leaf proof`,a.span,OC);if(!i&&a.isProof)throw kC(`PROOF keyword found in step that does not begin subproof`,a.span,DC);let o=a.token.text[1];if(o===`+`&&!i)throw kC(`<+> used but no subproof expected`,a.span,DC);let s=o===`*`?n-(i&&!a.isProof?1:0):o===`+`?n:bt(a.token);if(s<n||!i&&s>n)return;let c=yC.has(a.body.kind)?Kt(e,t+1,s+1,a.span):{proof:void 0,span:a.span,next:t+1,end:void 0},l=c.end??a.end,u={name:Ct(a.token),token:a.token.text,body:a.body,head:a.head,statement:a.statement,proof:c.proof,location:{..._(a.token),range:b(a.start,l)}},d=wC(a.span,c.span);if(a.body.kind===`Qed`)return{level:s,steps:[u],span:d,next:c.next,end:l};let f=qt(e,c.next,s,{start:d.stop,stop:d.stop},!1);return f&&{...f,level:s,steps:[u,...f.steps],span:wC(d,f.span)}},Jt=()=>{if(!Ut())return;let e=[];for(;Ut();)e.push(Gt());let t=e[0];t.kind===`Step`&&(e[0]={...t,isProof:!0});let n=Kt(e,0,0,t.span),r=e[n.next];if(r)throw kC(`extra step(s) after finished proof`,r.span,EC,`Proof.Parser.toplevel`);return n.proof},Yt=(e,t,n,r)=>{e.definitions.some(e=>e.name===t)||e.definitions.push({kind:`Operator`,name:t,params:[],body:n,isLocal:!1,isRecursive:!1,location:r})},Xt=()=>{if(S().kind!==`Identifier`||!E(`==`,1))return;let e=de();return D(),e},Zt=()=>{if(!r)return j();let e=te(),t=oe(j);if(t)return t;throw ae(`Expected "====" but found ${ne(e)}`,e)},Qt=e=>{let t=a,n=D(),i=Xt(),o=E(`ASSUME`)?Ft():Zt(),s=r?Jt():N(S())?Ht():void 0,c=x({name:i,statement:o,proof:s,location:_(n)},t);e.theorems.push(c),e.units.push({kind:`Theorem`,theorem:c}),i!==void 0&&o.kind!==`AssumeProve`&&Yt(e,i,o,c.location)},$t=()=>{let e=a,t=D(),n=Xt();return x({name:n,expression:j(),isAxiom:t.text===`AXIOM`,location:_(t)},e)},en=()=>{let e=_(k(`----`));k(`MODULE`);let t=ge();k(`----`);let n={name:t,modules:[],extends:[],extendsRanges:[],constants:[],variables:[],definitions:[],instances:[],assumptions:[],location:e,theorems:[],uses:[],units:[]};for(d.push(n),u.push(/* @__PURE__ */ new Set),O(`EXTENDS`)&&ve(()=>{let e=a;n.extends.push(ge()),n.extendsRanges.push(b(e))});;){let t=a,r=S();if(r.kind===`ModuleEnd`)return e.range={module:d[0].name,start:{line:e.line,column:e.column},end:{line:r.line,column:r.endColumn}},d.pop(),u.pop(),n;if(r.kind===`Separator`){if(E(`MODULE`,1)){let e=en();n.modules.push(e),n.units.push({kind:`Module`,module:e}),k(`====`);continue}D()}else{switch(r.text){case`CONSTANT`:case`CONSTANTS`:{let e=_(D()),r=ht();n.constants.push(...r),e.range=b(t),n.units.push({kind:`Constants`,declarations:r,location:e});continue}case`VARIABLE`:case`VARIABLES`:{let e=_(D()),r=ve(()=>{let e=a,t=_(S());return x({name:de(),arity:0,location:t},e)});n.variables.push(...r),e.range=b(t),n.units.push({kind:`Variables`,declarations:r,location:e});continue}case`ASSUME`:case`ASSUMPTION`:case`AXIOM`:{let e=$t();n.assumptions.push(e),n.units.push({kind:`Assumption`,assumption:e}),e.name!==void 0&&Yt(n,e.name,e.expression,e.location);continue}case`USE`:case`HIDE`:{if(E(`USE`)&&E(`ONLY`,1))throw ae(`Expected a module unit but found ${ne(r)}`);let e=jt();n.uses.push(e),n.units.push({kind:`Use`,use:e});continue}case`RECURSIVE`:{let e=_(D()),r=M();e.range=b(t),n.units.push({kind:`Recursive`,declarations:r,location:e});continue}case`INSTANCE`:tn(n,x(ft(void 0,[],!1,_(r)),t));continue;case`LOCAL`:if(D(),E(`INSTANCE`)){tn(n,x(ft(void 0,[],!0,_(r)),t));continue}tn(n,x(dt(!0),t));continue}r.kind===`Keyword`&&_C.has(r.text)?Qt(n):tn(n,lt(!1))}}},tn=(e,t)=>{t.kind===`Instance`?(e.instances.push(t),e.units.push({kind:`Instance`,instance:t})):(e.definitions.push(t),e.units.push({kind:`Definition`,definition:t}))},nn=en(),rn=he?$S(e):void 0;if(rn!==void 0)throw new s(rn);return nn},HC=e=>VC(e,`tlc`),UC=(e,t)=>VC(e,`tlc`,t),WC=e=>VC(e,`tlapm`),GC=e=>VC(e,`sany`),KC=/* @__PURE__ */ new WeakMap,qC=(e,t)=>e.forEach(e=>{let n=t.find(t=>t.isRecursive&&t.name===e.name);n&&KC.set(n,e.arity)}),JC=e=>{switch(e.kind){case`Name`:return e.name;case`Operand`:return typeof e.operand==`number`?`argument selector ${e.operand}`:e.operand;case`Bound`:return`!(...)`;case`At`:return`@`;case`Colon`:return`:`}},YC=(e,t,n)=>({operator:e,range:t,args:n,params:n.map(()=>0)}),XC=(e,t)=>new s(`${e} at line ${t.line}, column ${t.column}`),ZC=(e,t,n)=>{if(e.kind===`Label`)return e.name===t?{label:e,lets:n}:void 0;if(e.kind===`Let`)return ZC(e.body,t,[...n,e.definitions]);if(e.kind!==`Lambda`)for(let r of mt(e)){let e=ZC(r,t,n);if(e)return e}},QC=(e,t,n)=>t.reduceRight((e,t)=>({kind:`Let`,definitions:t,body:e,location:n}),e),$C=(e,t)=>{let n=e.location,r=QC(t,e.lets,n);if(e.params.length===0&&r!==t)return r;if(e.params.length===0){let e={...t};return Sc.set(e,Sc.get(t)??t),e}if(e.args.length===0){if(e.params.some(e=>e.arity>0))throw XC(`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 XC(`The subexpression requires ${e.params.length} arguments but received ${e.args.length}`,n);return{kind:`Let`,definitions:[{kind:`Operator`,name:hc,params:e.params,body:r,isLocal:!0,isRecursive:!1,location:n}],body:{kind:`Apply`,operator:hc,args:e.args,location:n,resolution:mc},location:n}},ew=(e,t)=>{let n=t.location,r=e.kind===`Operator`?e.params.map((e,n)=>({name:`${e.name}$${t.params.length+n}`,arity:e.arity})):[],i=r.map(e=>({kind:`Identifier`,name:e.name,location:n,resolution:mc})),a=i.length===0?{kind:`Identifier`,name:e.name,location:n,resolution:mc}:{kind:`Apply`,operator:e.name,args:i,location:n,resolution:mc};return $C({...t,params:[...t.params,...r]},a)},tw=(e,t,n,r,i)=>{let a=r.location,o={params:[],args:[],lets:[],location:a},s=0,c,l=!1,u=[],d=[],f,p=(e,t)=>{!f&&e&&(f={location:g(e),message:t})},m=(e,t,n=!1)=>{let i=r.selectorRanges?.[s];e&&i&&u.push({node:e,error:{location:g(i),message:t},isEmpty:n})},h=(e,t)=>{if(!e)throw XC(t,a);_c.set(r,{applications:d,nulls:u,error:{location:g(e),message:t}}),l=!0},_=n=>{let r=[],i=[];for(;s<e.length;){let o=e[s];if(o.kind!==`Name`&&!n)return;if(o.kind!==`Name`)throw XC(`Expected an operator name`,a);r.push(o.name),i.push(...o.args);let c=r.join(`!`),l=n?n.find(e=>uu(e)===c):t(c);if(l)return{definition:l,name:c,args:i,earlier:i.length-o.args.length};s++}throw XC(`Unknown operator ${r.join(`!`)}`,a)},v=t=>{let n=_(t);if(!n){l=!0;return}let u=n.definition,f=KC.get(u)??Mc(u),m=s===e.length-1;if(n.args.length!==f){let e=r.argumentRanges?.[s]??a.range,t=`The operator ${cc(n.name)} requires ${f-n.earlier} arguments.`;if(!i||n.args.length!==0)return h(e,t);p(e,t)}if(n.args.forEach((e,t)=>bc.set(e,{operator:n.name,index:t,range:r.selectorRanges?.[s]})),m)return{definition:u,args:n.args};let g=u.location.range,v=KC.has(u)&&g?.module===a.range?.module&&Ac(a,u.location);if(d.push({operator:n.name,range:r.selectorRanges?.[s],args:n.args,params:v?Array(f).fill(0):Nc(u)}),u.isRecursive&&g&&g.module===a.range?.module&&Ac(a,g.end))return h(r.selectorRanges?.[s],`Subexpression of \`${n.name}' used inside the operator's definition.`);if(u.kind!==`Operator`)throw XC(`Cannot select a subexpression of ${u.name}`,a);o.params.push(...u.params),o.args.push(...n.args),c=u.body,s++},y=()=>{for(;s<e.length&&!l;){let t=e[s];if(t.kind!==`Name`)return;let n=r.selectorRanges?.[s],a=c&&ZC(c,t.name,[]);if(!a)return h(n,`Cannot find label \`${t.name}'.`);let l=a.label.params;if(t.args.length!==l.length){let e=`Label \`${t.name}' used with wrong number of arguments.`;if(!i)return h(n,e);p(n,e)}o.lets.push(...a.lets),o.params.push(...l.map(e=>({name:e,arity:0}))),o.args.push(...t.args),d.push(YC(t.name,n,t.args)),c=a.label.body,s++}},ee=i=>{if(!c)throw XC(`Subexpression selection failed`,a);if(i.kind===`Colon`)return;let l=r.selectorRanges?.[s],u=c.location.range;if((c.kind===`Subexpression`||c.kind===`Identifier`&&c.name.includes(`!`)||c.kind===`Apply`&&c.operator.includes(`!`))&&(u?.module!==a.range?.module||Ac(c.location,a))){let e=_c.has(c)?c:iw(c,t,n),r=`Choosing operand \`${JC(i)}' of subexpression with no operands.`;if(_c.has(e)){h(l,r);return}gc.has(e)&&e.kind!==`Lambda`&&(m(e,r,!0),c=e.kind===`Let`&&e.body.kind===`Apply`&&e.body.operator===`$subexpression`?e.body:{kind:`Tuple`,elements:[e],location:e.location})}if(c.kind===`Label`){c=c.body,ee(i);return}let f=`Nonexistent operand specified by \`${JC(i)}'.`;if(c.kind===`Let`){if(i.kind!==`Operand`||il(i.operand,1)!==0){h(l,`A LET/IN expression has only one operand.`);return}o.lets.push(c.definitions),c=c.body;return}let p=cl(c);if(p&&(i.kind===`Bound`||i.kind===`At`)){if(i.kind===`Bound`&&i.args.length!==p.names.length){h(l,`Selector with ${i.args.length} argument(s) used for quantifier with ${p.names.length} bound identifier(s).`);return}o.params.push(...p.names.map(e=>({name:e,arity:0}))),i.kind===`Bound`&&(o.args.push(...i.args),d.push(YC(``,l,i.args))),c=p.body;return}if(c.kind===`Case`){let t=[...c.arms,...c.other?[{condition:void 0,body:c.other}]:[]];if(s===e.length-1){h(l,`Subexpression of CASE must have form !i!j.`);return}let n=i.kind===`Operand`?t[il(i.operand,t.length)]:void 0;if(!n){h(l,f);return}s++;let a=e[s],o=a.kind===`Operand`?il(a.operand,2):-1,u=r.selectorRanges?.[s];if(o===-1){h(u,`Second selector for CASE subexpression must specify one of two operands.`);return}let d=o===0?n.condition:n.body;if(!d){h(u,`Selecting OTHER in a CASE statement.`);return}c=d;return}if(c.kind===`Except`&&i.kind===`Operand`&&il(i.operand,c.updates.length+1)>0){h(l,`Selecting subexpression of an EXCEPT not yet implemented.`);return}let g=p?p.sets:ll(c);if(!g&&c.kind!==`Identifier`){h(l,`Selecting subexpression of expression that has none.`);return}if(i.kind!==`Operand`){h(l,f);return}let _=g?.[il(i.operand,g.length)];_?c=_:h(l,f)},b=v(void 0);if(l)return r;if(b)return ew(b.definition,{...o,args:b.args});for(y();s<e.length&&!l;){let t=e[s];if(t.kind===`Name`){for(;c?.kind===`Label`;)c=c.body;if(c?.kind!==`Let`)return h(r.selectorRanges?.[s-1],`A name selector here must be from a LET clause.`),r;o.lets.push(c.definitions);let e=v(c.definitions);if(l)return r;if(e)return ew(e.definition,{...o,args:[...o.args,...e.args]});y()}else t.kind!==`Colon`&&(m(c,`Subexpression selection failed, probably due to an error in the selected expression.`),m(c,`Choosing operand \`${JC(t)}' of subexpression with no operands.`,!0)),ee(t),m(c,`An unexpected null node specified by '${JC(e[s])}'.\nThis is probably due to a previous error.`),s++}if(l)return r;if(!c)throw XC(`Subexpression selection failed`,a);let x=o.params.length,te=o.args.length;if(x!==te){let e=`Expected ${x} arguments but found ${te}.`;if(!i||te>0)return h(a.range,e),r;p(a.range,e)}let S=$C(o,c);return xc.set(S,u),f&&vc.set(S,f),S},nw=(e,t,n,r)=>{if(!e.includes(`!`)||r(e))return;let i=e.split(`!`);if(i.some((e,t)=>r(i.slice(0,t+1).join(`!`))))return al(e,t,n)},rw=e=>e.kind===`Subexpression`||e.kind===`Identifier`&&e.name.includes(`!`)||e.kind===`Apply`&&e.operator.includes(`!`)||mt(e).some(rw),iw=(e,t,n,r=!1)=>{if(!rw(e))return e;if(e.kind===`Let`){e.recursive&&qC(e.recursive,e.definitions);let r=n=>e.definitions.find(e=>e.name===n)??t(n),i=t=>!e.definitions.some(e=>e.name===t)&&n(t),a=pu(e,e=>iw(e,r,i));return a.kind===`Let`&&a.instances?{...a,instances:a.instances.map(e=>aw(e,r,i))}:a}let i=e.kind===`Apply`?t(e.operator):void 0,a=e.kind===`Apply`?{...e,args:e.args.map((e,r)=>iw(e,t,n,i?.kind!==`Operator`||i.params[r]?.arity!==0))}:pu(e,e=>iw(e,t,n)),o=mt(e),s=mt(a).every((e,t)=>e===o[t])?e:a,c=s.kind===`Subexpression`?s.selectors:s.kind===`Identifier`?nw(s.name,[],void 0,t):s.kind===`Apply`?nw(s.operator,s.args,s.argumentCounts,t):void 0,l=c?.[0];if(!c)return s;let u=c.findIndex(e=>e.kind!==`Name`),d=c.slice(0,u===-1?c.length:u),f=d.some((e,n)=>n>0&&t(d.slice(0,n+1).map(JC).join(`!`)));if(l?.kind===`Name`&&n(l.name)&&!f||l?.kind===`Name`&&c[1].kind!==`Name`&&!t(l.name))return s;let p=tw(c,t,n,s,r);return p!==s&&gc.add(p),p},aw=(e,t,n)=>({...e,substitutions:e.substitutions.map(e=>({...e,expression:iw(e.expression,t,n,!0)}))}),ow=e=>{let t=new Map(e.map(e=>[e.name,e]));return e=>t.get(e)},sw=(e,t)=>aw(e,ow(t.definitions),()=>!1),cw=(e,t)=>{let n=new Set(e.theorems.flatMap(e=>e.name!==void 0&&e.statement.kind===`AssumeProve`?[e.name]:[])),r=e.theorems.flatMap(e=>{let t=e.statement;if(e.name===void 0||t.kind!==`AssumeProve`)return[];let n=t.assumptions.filter(e=>e.kind!==`NewSymbol`&&e.kind!==`AssumeProve`);return n.length===t.assumptions.length?[{kind:`Operator`,name:e.name,params:[],body:{kind:`Tuple`,elements:[...n,t.conclusion],location:t.location},isLocal:!0,isRecursive:!1,location:e.location}]:[]}),i=/* @__PURE__ */ new Set([...e.definitions,...r]);qC(e.units.flatMap(e=>e.kind===`Recursive`?e.declarations:[]),e.definitions);let a=new Map(e.units.flatMap(e=>e.kind===`Recursive`?e.declarations.map(e=>[e.name,e.location]):[])),o=(e,t)=>{let n=a.get(e.name);return Ac(e.location,t)||e.isRecursive&&n!==void 0&&Ac(n,t)},s=(e,t)=>n=>{let r=e(n);return r&&(!i.has(r)||o(r,t))?r:void 0},c=ow([...t,...e.definitions]),l=e=>n.has(e),u=ow([...t,...e.definitions,...r]),d=(e,t)=>iw(e,s(u,t),e=>l(e)&&r.every(t=>t.name!==e)),f=e=>{let t=t=>l(t)||!e(t),n=n=>iw(n,e,t),r=e=>{let t=e.map(e=>e.kind===`ModuleFact`?e:n(e));return yc.set(t,e),t},i=e=>e.map(e=>({...e,set:n(e.set)})),a=e=>e.kind===`AssumeProve`?{...e,assumptions:e.assumptions.map(e=>e.kind===`NewSymbol`?{...e,set:e.set&&n(e.set)}:a(e)),conclusion:n(e.conclusion)}:n(e),o=o=>{switch(o.kind){case`Use`:case`Hide`:return{...o,facts:r(o.facts)};case`Instance`:return aw(o,e,t);case`Define`:return{...o,definitions:o.definitions.map(r=>r.kind===`Instance`?aw(r,e,t):fu(r,n))};case`Have`:case`Case`:return{...o,expression:n(o.expression)};case`Witness`:return{...o,expressions:o.expressions.map(n)};case`Take`:return{...o,bounds:i(o.bounds)};case`Pick`:return{...o,bounds:i(o.bounds),body:n(o.body)};case`Assert`:return{...o,statement:a(o.statement)};default:return o}},s=t=>{if(t?.kind===`By`)return{...t,facts:r(t.facts)};if(t?.kind!==`Steps`)return t;let n={lookup:e,resolveStep:o,resolveProof:s};return{...t,steps:t.steps.map(e=>{let t={...e,body:n.resolveStep(e.body),proof:n.resolveProof(e.proof)};if(e.body.kind===`Define`){let t=e.body.definitions.flatMap(e=>e.kind===`Instance`?[]:[e]),r=n.lookup;n=f(e=>t.find(t=>t.name===e)??r(e))}return t})}};return{lookup:e,resolveFacts:r,resolveStatement:a,resolveStep:o,resolveProof:s}},p={...e,theorems:e.theorems.map(e=>{let t=f(s(c,e.location));return{...e,statement:e.name!==void 0&&e.statement.kind!==`AssumeProve`?e.statement:t.resolveStatement(e.statement),proof:e.proof&&f(s(c,e.proof.location)).resolveProof(e.proof)}}),uses:e.uses.map(e=>({...e,facts:f(s(c,e.location)).resolveFacts(e.facts)}))};return e.definitions.some(e=>rw(e.body))||e.assumptions.some(e=>rw(e.expression))?{...p,definitions:e.definitions.map(e=>fu(e,t=>d(t,e.location))),assumptions:e.assumptions.map(e=>({...e,expression:d(e.expression,e.location)}))}:p},lw=(e,t)=>e.maxLevels[t]??3,uw=e=>{let t=/* @__PURE__ */ new Map,n=n=>{let r=t.get(n);if(r)return r;let i=e(n),a=Wd({constants:new Set(i.constants.map(e=>e.name)),variables:new Set(i.variables),getDefinition:i.getDefinition});return t.set(n,a),a},r=/* @__PURE__ */ new Map,i=t=>{let i=r.get(t);if(i)return i;let a=e(t),o=n(t),s=a.definitions.map(e=>o.analyzeDefinition(e,/* @__PURE__ */ new Map)),c={isConstant:a.variables.length===0&&s.every(e=>e.level===0),constraints:/* @__PURE__ */ new Map,argConstraints:/* @__PURE__ */ new Map,argParams:/* @__PURE__ */ new Set};c.isConstant||a.constants.forEach(e=>Qu(c.constraints,e.name,0));let l=(e,t)=>{e.constraints.forEach((e,t)=>Qu(c.constraints,t,e)),e.argConstraints.forEach((e,t)=>$u(c.argConstraints,t,e)),e.argParams.forEach(e=>{let n=Yu(e);t(n.operator,n.param)&&c.argParams.add(e)})};s.forEach(e=>l(e,(t,n)=>e.formals.every(e=>e.name!==t&&e.name!==n)));let u=e=>{l(e,()=>!0),a.constants.forEach(t=>{e.params.has(t.name)&&Qu(c.constraints,t.name,2)})};return a.assumptions.forEach(e=>u(o.analyze(e,/* @__PURE__ */ new Map))),a.theorems.forEach(e=>e.statement.kind===`AssumeProve`?u(Gd(e.statement,/* @__PURE__ */ new Map,o)):l(o.analyze(e.statement,/* @__PURE__ */ new Map),()=>!0)),r.set(t,c),c};return t=>{let r=/* @__PURE__ */ new Map,a=g(t.location.range??{module:t.instancer,start:t.location,end:t.location}),o=e=>r.set(`${a}\n${e}`,{location:a,message:e}),s=e(t.module),l=i(t.module),u=n(t.instancer),d=/* @__PURE__ */ new Map;t.lets.forEach(e=>d.set(e.name,{kind:`Let`,definition:e,scope:d}));let f=[...s.constants.map(e=>({...e,maximumLevel:0})),...s.variables.map(e=>({name:e,arity:0,maximumLevel:1}))].flatMap(e=>{let n=t.substitutions.get(e.name);if(!n)return[];if(e.arity===0){let t=u.analyze(n,d);return[{...e,level:t.level,operator:void 0,isLeibniz:!0}]}let r=u.toOperand(n,d),i=r.kind===`Operator`?r.data:void 0;return[{...e,level:r.data.level,operator:i,isLeibniz:i===void 0||i.nonLeibniz.size===0}]}),p=(e,n)=>`Level error in instantiating module '${t.module}':\nThe level of the expression or operator substituted for '${e}' \nmust be at most ${n}.`;if(f.forEach(e=>{!l.isConstant&&e.level>e.maximumLevel&&o(p(e.name,e.maximumLevel)),e.isLeibniz||o(`Error in instantiating module '${t.module}':\n A non-Leibniz operator substituted for '${e.name}'.`)}),f.forEach(e=>{let n=l.constraints.get(e.name);n!==void 0&&e.level>n&&o(p(e.name,n));let r=e.operator;if(r)for(let n=0;n<e.arity;n++){let i=l.argConstraints.get(qu(e.name,n));i!==void 0&&lw(r,n)<i&&o(`Level error in instantiating module '${t.module}':\nThe level of the argument ${n+1} of the operator ${r.name} \nmust be at least ${i}.`)}}),l.argParams.forEach(e=>{let n=Yu(e),r=f.find(e=>e.name===n.operator)?.operator,i=f.find(e=>e.name===n.param);if(!r||!i)return;let a=lw(r,n.index);i.level>a&&o(`Level error when instantiating module '${t.module}':\nThe level of the argument ${n.index} of the operator ${n.operator}' \nmust be at most ${a}.`)}),r.size>0)throw c([...r.values()])}},dw=[`LAMBDA`,`$$InAssume`,`nullODN`,`nullOpArg`,`nullLabelNode`],fw=/* @__PURE__ */ new Set([`THEOREM`,`LEMMA`,`COROLLARY`,`PROPOSITION`]),pw=new Map(oc.flatMap(e=>e.map(t=>[t,e[0]]))),mw=e=>pw.get(e)??e,hw=()=>{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}}},gw=(e,t,n)=>({key:t===`module`?`module ${e}`:e,name:e,hash:gt(e)&2147483647,kind:t,isLocal:n}),_w=(e,t)=>{let n=e[t],r=e[t+1];if(n.text===`_`&&r.kind===`Operator`)return e[t+2]?.text===`_`?{name:mw(r.text),end:t+3}:{name:r.text,end:t+2};if(n.kind===`Operator`)return{name:n.text===`-`?`-.`:mw(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}},vw=(e,t)=>{let n=[];for(let r=t;;){let t=_w(e,r);if(n.push(t.name),e[t.end]?.text!==`,`)return n;r=t.end+1}},yw=e=>({line:e.line,column:e.column}),bw=(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=vw(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},xw=(e,t)=>t!==void 0&&t.line===e.line&&t.column===e.column+e.text.length,Sw={"\\":`\\\\`,'"':`\\"`,"\n":`\\n`," ":`\\t`,"\r":`\\r`,"\f":`\\f`},Cw=e=>{let t=[];for(let n=0;n<e.length;n++){let r=e[n];r.text===`<`&&xw(r,e[n+1])&&/^(\d+|\*|\+)$/.test(e[n+1].text)&&e[n+2]?.text===`>`&&xw(e[n+1],e[n+2])?n+=xw(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=>Sw[e])}"`:r.text)}return t},ww=e=>e[2]?.text,Tw=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},Ew=(e,t)=>e.find(e=>e.name===t)??e.map(e=>Ew(e.modules,t)).find(Boolean),Dw=e=>{let t=e===void 0?[]:Ee(e),n;return{tokens:t,ranges:Tw(t),getModule:()=>n??=e===void 0?HC(``):UC(e,t)}},Ow=(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=Dw(e);return e!==void 0&&i.set(e,n),n},o=i=>{let o=n.get(i??``);if(o)return o;let s=i===void 0?e:t?.(i)??fc.get(i)??fm.get(i)??BC(e,i),c=a(s),l=c.tokens,u=c.ranges.get(ww(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:()=>Ew(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()}},kw=e=>{let t=e=>{let t=e.tokens,n=e.getModule(),i=[],a=[],o=(e,n)=>{let r=vw(t,e+1);i.push({location:yw(t[e]),apply:e=>r.forEach(t=>e.put(gw(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:yw(n),apply:t=>t.put(gw(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`&&vw(t,u+1).every(e=>s.has(e))&&o(u,`definition`),fw.has(n.text)&&t[u+1]?.kind===`Identifier`&&t[u+2]?.text===`==`&&(a.push(yw(n)),i.push({location:yw(n),apply:e=>e.put(gw(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(gw(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=mw(e.name);i.push({location:e.location,apply:n=>n.put(gw(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(gw(`${i}${n.name}`,n.kind,e.isLocal))}),e.name!==void 0&&t.put(gw(e.name,`definition`,e.isLocal))}})}),i.sort((e,t)=>Ac(e.location,t.location)?-1:+!!Ac(t.location,e.location))},n=/* @__PURE__ */ new Map,r=i=>{let a=n.get(i??``);if(a)return a;let o=hw();n.set(i??``,o),ac.toReversed().forEach(e=>o.put(gw(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)}}},Aw=(e,t,n)=>{let r=/* @__PURE__ */ new Set,i=e=>{r.add(e)},a=e=>{e.kind===`ModelValue`&&i(e.name),e.kind===`String`&&i(e.value),e.kind===`Set`&&e.elements.forEach(a)};t.constants.forEach(e=>{e.args?.forEach(a),a(e.value)}),lc.forEach(i);let o=t=>{let n=e(t);return n.tokens.slice(n.start,n.end)},s=/* @__PURE__ */ new Map,c=/* @__PURE__ */ new Map,l=e=>{let t=c.get(e);if(t)return t;let n=bw(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;Cw(o(void 0)).forEach((e,t)=>{t===3&&dc.forEach(i),i(e)});let y=l(void 0);for(;;){let t=h(y,/* @__PURE__ */ new Set)??g(y,/* @__PURE__ */ new Set);if(!t)break;let[n,r]=t;if(d.add(`${n.key}>${r}`),v.set(n.unit,[...v.get(n.unit)??[],r]),!_.has(r)){if(_.add(r),e(r).tokens.length===0){let t=n.unit??ww(e(void 0).tokens);throw te(r,t)}Cw(o(r)).forEach(i)}}dw.forEach(i);let ee=/* @__PURE__ */ new Set,b=e=>{if(ee.has(e))return;ee.add(e);let t=v.get(e)??[],n=l(e).allExtends;[...t.filter(e=>n.has(e)),...t.filter(e=>!n.has(e))].forEach(b),o(e).forEach(e=>{e.kind===`String`&&i(e.text)})};return b(void 0),n.forEach(e=>{let t=o(e);Cw(t).forEach(i),t.forEach(e=>{e.kind===`String`&&i(e.text)})}),uc.forEach(i),[...r]},jw=(e,t)=>{let n=Ow(e,t),r=n.getParsed,i,a=()=>i??=kw(r);return{getStringOrder:(e,t)=>Aw(r,e,t),getDeclarationOrder:e=>a().getContext(void 0).enumerate().filter(t=>t.kind===e).map(e=>e.name).reverse(),parseModule:n.parseText,createDefinitionOrder:()=>{let e=a();return e.getContext(void 0),t=>e.getOwnEntries(t).filter(e=>e.kind===`definition`).map(e=>e.name)}}},Mw=/* @__PURE__ */ new Set([`IOUtils`,`Json`,`TLCExt`]),Nw=e=>[...e.constants,...e.variables.map((t,n)=>({name:t,arity:0,location:e.variableLocations[n]}))],Pw=(e,t,n)=>{try{return n.parseModule(e)}catch(n){if(!(n instanceof s))throw n;let r=$S(e);throw r===void 0?n:c([{location:`In module ${t}`,message:`Could not parse module ${t} from file ${t}.tla`}],!0,r)}},Fw=e=>new s(`Multiply-defined module '${e.name}' at line ${e.location.line}, column ${e.location.column}`),Iw=(e,t)=>e.location.range&&t.location.range&&{location:g(e.location.range),message:`Multiply-defined module '${e.name}': this definition or declaration conflicts \nwith the one at ${g(t.location.range)}.`},Lw=e=>[`Builtin`,`Definition`,`Instance`,`Parameter`].includes(e)?`definition`:`declaration`,Rw=e=>e===`Theorem`?`ThmOrAssumpDefNode`:Lw(e),zw=(e,t)=>({kind:`Operator`,name:t,params:[],body:{kind:`Let`,definitions:[e],body:ju(e.name,e.location),location:e.location},isLocal:!0,isRecursive:!1,location:e.location}),Bw=(e,t)=>{let n=ht(e);return n!==void 0&&t.has(n)||mt(e).some(e=>Bw(e,t))},Vw=(e,t)=>{let n=new Map(e.map((e,t)=>[e,t]));return new Set(t).forEach(e=>n.set(Eu(e),n.get(e)??n.size)),n},Hw=e=>e.flatMap(e=>e.substitutions.map(e=>e.expression)),Uw=e=>e.forEach(e=>{if(e.kind===`Decimal`)throw n_(e);if(e.kind===`Number`&&!_n(e.value))throw r_(e);Uw(e.kind===`Let`?[...mt(e),...Hw(e.instances??[])]:mt(e))}),Ww=(e,t)=>{let n=t.order??jw(t.source,t.loadModule),r=n.parseModule(t.source),i=/* @__PURE__ */ new Map,a=/* @__PURE__ */ new Map,o=/* @__PURE__ */ new Map,l=/* @__PURE__ */ new Set,u=/* @__PURE__ */ new Set,f=new Map(Tm.map(e=>[e.name,e])),p=/* @__PURE__ */ new Map,m=zp(e.checkDeadlock,t.seed);m.isWarningEnabled=t.isWarningEnabled??!0,m.isTool=t.isTool??!1,m.version=t.version??`master`,m.readLine=t.readLine;let h=/* @__PURE__ */ new Map,_=/* @__PURE__ */ new Map,v=[],y=/* @__PURE__ */ new Map,ee=[],b=[],x=(e,t)=>ee.forEach(n=>{n.add(e),[...t].forEach(e=>n.add(e))}),S=0,ne=e=>`${e}#${S++}`,re=[],T=[],ie=uw(e=>{let t=_.get(e)??O(e,e);return{constants:t.constants,variables:t.variables,definitions:[...new Set([...t.visible.values()].flatMap(e=>i.get(e.key)??[]))],assumptions:t.module.assumptions.map(e=>e.expression),theorems:t.module.theorems,getDefinition:e=>i.get(t.visible.get(e)?.key??e)}}),ae=/* @__PURE__ */ new Map,oe=/* @__PURE__ */ new Map,se=/* @__PURE__ */ new Map,ce=e=>{let n=p.get(e);if(n)return n;let r=qm(e,t.print,m,t.files,f);if(!r)return;Gm.get(e)?.forEach(ce);let i=/* @__PURE__ */ new Map;return Km.get(e)?.forEach(e=>ce(e)?.forEach((e,t)=>i.set(t,e))),r.forEach(t=>{f.set(t.name,t),i.set(t.name,{key:t.name,arity:t.arity,params:Wu.get(t.name)?.formals.map(e=>e.arity),kind:`Definition`,range:Ku(e,t.name)??i.get(t.name)?.range})}),p.set(e,i),i},le=e=>{let n=Gm.get(e)??[];if(e===`TLCExt`||[e,...n].some(e=>t.loadModule?.(e)!==void 0))return;let r=ce(e);return r&&x(e,n),r&&n.includes(`Integers`)&&ce(`Integers`),r},E=e=>(Uw([...e.definitions.flatMap(pt),...e.assumptions.map(e=>e.expression),...e.theorems.flatMap(e=>e.statement.kind===`AssumeProve`?[]:[e.statement]),...Hw(e.instances)]),e.modules.forEach(E),e);E(r);let D=(e,r)=>{let i=t.loadModule?.(e)??mm(m.version).get(e)??BC(t.source,e);if(i===void 0)throw te(e,r);let a=Pw(i,e,n);if(a.name!==e)throw c([{location:`Unknown location`,message:`File name '${e}' does not match the name '${a.name}' of the top level module it contains.`}],!0);return E(a)},ue=e=>{let t=b.indexOf(e.name);if(t!==-1){let n=[...b.slice(t),e.name].map(e=>`${e}.tla`);throw new s(`Circular dependency among .tla files; dependency cycle is: ${n.join(` --> `)}`)}let n=/* @__PURE__ */ new Set,r=[],i=[],a=[];b.push(e.name),ee.push(n);let o=ve(e,{id:e.name,symbols:/* @__PURE__ */ new Map,modules:/* @__PURE__ */ new Map,nested:r,errors:i,warnings:T,levelChecks:a});if(ee.pop(),b.pop(),i.length>0)throw c(i,!1,void 0,T);let l=r.find(e=>n.has(e.name)),u=l&&h.get(l.name),d=u&&Iw(l,u.module);if(d)throw c([d],!1,void 0,T);if(l)throw Fw(l);return a.forEach(e=>e()),{linked:o,closure:n}},O=(e,n)=>{let r=h.get(e);if(r)return x(e,y.get(e)??[]),r;let a=ue(D(e,n)),o=/* @__PURE__ */ new Map;return Wm(e,t.print,m,t.files,f,(e,t,n)=>{let r=o.get(e),i=t.flatMap(e=>typeof e==`object`&&e.kind===`Operator`&&e.expression?[e.expression]:[]);if(r?.kind!==`Operator`||!n||i.length!==t.length)throw new w(`No definition of ${e} to fall back to`);return W(r.body,{environment:n.environment,scope:lv(Y_(r),i,n),state:n.state,next:n.next,isKeepLazy:n.isKeepLazy})})?.forEach(t=>{let n=a.linked.visible.get(t.name);if(n?.kind!==`Definition`||n.arity!==t.arity&&Mw.has(e))return;let r=i.get(n.key);r&&o.set(t.name,r),f.set(n.key,t),i.delete(n.key)}),h.set(e,a.linked),y.set(e,a.closure),x(e,a.closure),a.linked},k=(e,t,n,r,s)=>{let c=s?void 0:le(e.module);if(c)return de(e,c);let d=s??O(e.module,t.name);d.facts.forEach(t=>n.facts.add(e.name===void 0?t:`${e.name}!${t}`));let f=Nw(d),p=`#${S++}`,m=new Map(e.params.map(e=>[e.name,`${e.name}${p}`])),h=tu(sw(e,t),f,t,n);re.push({module:e.module,instancer:t.name,lets:[],substitutions:h,location:e.location});let g=e.params.map(e=>({...e,name:`${e.name}${p}`}));g.forEach(e=>u.add(e));let _=e.definitionRange?{...e.definitionRange,start:{line:e.location.line,column:e.location.column}}:e.instanceRange,v=zu({params:g,substitutions:new Map([...h].map(e=>[e[0],su(e[1],m)])),variables:new Set(d.variables),getDefinition:e=>i.get(e),getOuterDefinition:e=>t.definitions.find(t=>t.name===e),isParameterized:e=>a.get(e)===!0,addDefinition:(n,s,c)=>{let u=ne(`${s}@${t.name}`),d=c(u);return i.set(u,d),f.length>0&&l.add(d),e.name!==void 0&&oe.set(u,`${e.name}!${oe.get(n)??s}`),a.set(u,!r),o.set(u,{source:n,prefix:e.params.length}),u},createName:ne,...f.length>0&&{frame:{kind:`Identifier`,name:e.name??e.module,location:{..._.start,range:_}}}});return fe(e,d.exported,f,(t,n)=>{let r=e.name===void 0?v.getKey(t):v.getQualifiedKey(t);return f.length>0&&ae.set(r,{name:n,location:e.location}),e.name!==void 0&&se.set(r,n),r})},de=(e,t)=>e.name===void 0?t:new Map([...t].map(t=>[`${e.name}!${t[0]}`,{key:t[1].key,arity:t[1].arity,params:t[1].params,kind:t[1].kind}])),fe=(e,t,n,r)=>{let i=new Set(n.map(e=>e.name));return new Map([...t].filter(e=>!i.has(e[0])).map(t=>{if(e.name===void 0)return[t[0],{key:r(t[1].key,t[0]),arity:t[1].arity,params:t[1].params,kind:t[1].kind,range:a.get(t[1].key)===!0?e.location.range:t[1].range}];let n=`${e.name}!${t[0]}`;return[n,{key:r(t[1].key,n),arity:t[1].arity+e.params.length,params:t[1].params&&[...e.params.map(e=>e.arity),...t[1].params],kind:t[1].kind}]}))},pe=(e,t)=>Array.from({length:e},(e,n)=>({name:`argument${n}`,arity:t?.[n]??0})),me=(e,t,n)=>{if(t.arity===0)return{params:[],body:e};if(e.kind===`Lambda`)return{params:e.params.map(e=>({name:e,arity:0})),body:e.body};let r=pe(t.arity,void 0);return{params:r,body:{kind:`Apply`,operator:e.kind===`Identifier`?e.name:e.kind===`OperatorReference`?e.operator:t.name,args:Mu(r,n),location:n}}},he=(e,t,n,r)=>{let o=e.location,s=r?void 0:le(e.module);if(s)return e.name===void 0?[]:[...s].map(t=>{let n=pe(t[1].arity,t[1].params);return Nu(`${e.name}!${t[0]}`,t[1].key,[...e.params,...n],n,o)});let c=r??O(e.module,n),l=`#${S++}`,u=new Map(e.substitutions.map(e=>[e.name,e.expression])),d=Nw(c),f=e=>u.get(e.name)??{kind:`Identifier`,name:e.name,location:o};re.push({module:e.module,instancer:n,lets:t,substitutions:new Map(d.map(e=>[e.name,f(e)])),location:o});let p=new Set(e.params.map(e=>e.name)),m=e=>Bw(f(e),p),h=d.map(t=>{let n=me(f(t),t,o);return{kind:`Operator`,name:`${t.name}${l}`,params:[...m(t)?e.params:[],...n.params],body:n.body,isLocal:!0,isRecursive:!1,location:o}}),g=[],_=zu({params:e.params,substitutions:new Map(d.map(t=>[t.name,m(t)?{kind:`Apply`,operator:`${t.name}${l}`,args:Mu(e.params,o),location:o,resolution:mc}:ju(`${t.name}${l}`,o)])),variables:new Set(c.variables),getDefinition:e=>i.get(e),getOuterDefinition:()=>void 0,isParameterized:e=>a.get(e)===!0,addDefinition:(t,n,r)=>{let i=`${n}@${e.module}${l}.${g.length}`,a=r(i);return g.push(a.kind===`Operator`?{...a,name:i}:zw(a,i)),i},createName:ne}),v=new Set(d.map(e=>e.name)),y=[...c.exported].filter(e=>!v.has(e[0])).map(t=>{let n=_.getKey(t[1].key),r=pe(t[1].arity,t[1].params),i=[...e.params,...r];return Nu(e.name===void 0?t[0]:`${e.name}!${t[0]}`,n,i,n===t[1].key?r:i,o)});return[...h,...g,...y]},ge=e=>[...e].flatMap(e=>{let t=i.get(e[1].key);return t?[{...t,name:e[0]}]:[]}),_e=/* @__PURE__ */ new Map,ve=(e,n)=>{let o=Mx(e,t.loadClass?.(e.name),e===r);_e.set(e.name,o.overrides);let s=o.module,c=re.length,l=new Map([...Tm.map(e=>[e.name,{key:e.name,arity:e.arity,kind:`Builtin`}]),...n.symbols]),u=/* @__PURE__ */ new Map,d={location:Xl,errors:[],warnings:[]},f=[d],p=e=>e.forEach((e,t)=>{let n=m.get(t);if(!n){l.set(t,e),m.set(t,e);return}if(!n.range||!e.range||g(n.range)===g(e.range))return;let r=g(e.range),i=g(n.range);Rw(n.kind)===Rw(e.kind)?d.warnings.push({location:r,message:`Warning: the ${Lw(n.kind)} of '${t}' conflicts with \nits ${Lw(n.kind)} at ${i}.`}):d.errors.push({location:r,message:`The ${Lw(e.kind)} of '${t}' conflicts with \nits ${Lw(n.kind)} at ${i}.`})}),m=/* @__PURE__ */ new Map,h=/* @__PURE__ */ new Set,y=/* @__PURE__ */ new Map,ee=[],b=[...s.constants],x=s.variables.filter((e,t)=>s.variables.findIndex(t=>t.name===e.name)===t),te=x.map(e=>e.name),S=x.map(e=>e.location);s.extends.forEach(e=>{let t=n.modules.get(e),r=t?void 0:le(e);if(r){p(r);return}let i=t??O(e,s.name);b.push(...i.constants.filter(e=>b.every(t=>t.name!==e.name)&&!te.includes(e.name))),i.variables.forEach((e,t)=>{te.includes(e)||b.some(t=>t.name===e)||(te.push(e),S.push(i.variableLocations[t]))}),p(i.exported),i.facts.forEach(e=>h.add(e)),i.modules.forEach((e,t)=>y.set(t,e)),ee.push(i)});let ne=new Map(l),C=[...s.constants.map(e=>({...e,kind:`Constant`})),...s.variables.map(e=>({...e,kind:`Variable`}))],w=e=>({key:e.name,arity:e.arity,kind:e.kind,range:e.location.range});C.forEach(e=>m.set(e.name,w(e)));let ae=e=>({key:ce(e),arity:Mc(e),params:Nc(e),kind:Zl(s,e)?`Theorem`:`Definition`,range:e.location.range}),oe=b.length===0&&te.length===0,ce=e=>s===r?e.name:`${e.name}@${n.id}`,E=/* @__PURE__ */ new Map,D=()=>new Map([...n.modules,...y]),ue=e=>{let t=s.modules.find(t=>t.name===e.module);return t?Ac(t.location,e.location)?y.get(t.name):void 0:D().get(e.module)},pe=e=>({imported:l,getInstance:e=>{let t=ue(e),n=t?void 0:le(e.module);if(n)return{declarations:[],symbols:de(e,n),instancer:s.name};let r=t??O(e.module,s.name),i=Nw(r);return{declarations:i,symbols:fe(e,r.exported,i,e=>e),instancer:s.name}},bound:ne,definitions:new Map(e.definitions.toReversed().map(e=>[e.name,e])),getKey:ce,instanced:E,facts:h,reports:f,warnings:n.warnings}),me=e=>[...C.filter(t=>Ac(t.location,e)).map(e=>[e.name,w(e)]),...s.definitions.filter(t=>Ac(t.location,e)).map(e=>[e.name,ae(e)])].reduce((e,t)=>e.has(t[0])?e:e.set(t[0],t[1]),new Map(l)),ye=e=>{let t=D(),r=t.get(e.name),i=r&&Iw(e,r.module);if(r&&!i)throw Fw(e);n.nested.push(e);let a={location:e.location,errors:[],warnings:[]};f.push(a);let o=ve(e,{id:`${n.id}/${e.name}`,symbols:me(e.location),modules:t,nested:n.nested,errors:a.errors,warnings:a.warnings,levelChecks:n.levelChecks});i&&a.errors.push(i),r||y.set(e.name,o)};[...s.instances.map(e=>({location:e.location,link:()=>{let t=k(e,s,pe(s),oe,D().get(e.module));E.set(e,t),t.forEach((t,n)=>{l.has(n)||(u.set(n,e.location),l.set(n,t),e.isLocal||m.set(n,t))})}})),...s.modules.map(e=>({location:e.location,link:()=>ye(e)}))].sort((e,t)=>Ac(e.location,t.location)?-1:1).forEach(e=>e.link());let be=cw(Uu(s,(e,t)=>he(e,t,s.name,ue(e))),ge(l));n.errors.push(...ru(be,pe(be))),be.definitions.forEach(e=>{let t=ce(e);i.set(t,e),a.set(t,!oe);let n=ae(e),r=u.get(e.name);(n.kind!==`Theorem`||l.get(e.name)?.kind!==`Theorem`||r!==void 0&&!Ac(r,e.location))&&(l.set(e.name,n),e.isLocal||m.set(e.name,n))});let xe={module:be,constants:b,variables:te,variableLocations:S,visible:l,exported:m,modules:y,extended:ee,facts:/* @__PURE__ */ new Set([...h,...[...be.theorems,...be.assumptions].flatMap(e=>e.name??[])])};_.has(s.name)||_.set(s.name,xe);let Se=re.splice(c).map(e=>({location:e.location,check:()=>ie(e)}));return n.levelChecks.push(()=>Kd(be,{constants:new Set(b.map(e=>e.name)),variables:new Set(te),getDefinition:e=>i.get(l.get(e)?.key??e),getQualifiedName:e=>se.get(l.get(e)?.key??e)},Se,T)),v.push(xe),xe},ye=ue(r).linked,be=t.traceFile,xe=be===void 0?[]:[{kind:`postcondition`,module:`_TLCTrace`,operator:`_TLCTraceSilent`,constants:{_TLCTraceFile:be}}],Se=[...t.moduleOperators??[],...xe].map(e=>{let t=O(e.module,r.name).visible.get(e.operator);return{...e,key:t?.kind===`Definition`?t.key:void 0}});v.push(...v.splice(v.indexOf(ye),1)),T.length>0&&!t.isSanyReported&&t.print(d(T));let Ce=t.runtimeInvariants??[];Ce.forEach(e=>{if(e.module===void 0)return;h.set(r.name,ye);let t=O(e.module,r.name);v.splice(v.indexOf(t),1);let n=i.get(t.visible.get(e.name)?.key??e.name);n&&i.set(e.name,n)}),ye.visible.forEach((e,t)=>{let n=i.get(e.key);n&&e.key!==t&&i.set(t,n)}),Se.forEach(e=>{let t=e.key===void 0?void 0:i.get(e.key);e.kind!==`postcondition`&&t&&i.set(e.operator,t)});let we=[],Te=(e,t)=>{t.has(e)||(t.add(e),e.extended.forEach(e=>Te(e,t)),we.push(...e.module.assumptions))};Te(ye,/* @__PURE__ */ new Set);let Ee=ye.constants.map(e=>e.name),De=ye.variables,Oe=yx(e,{root:ye,moduleSymbols:new Map([...p,...[...h].map(e=>[e[0],e[1].visible]),[r.name,ye.visible]]),definitions:i,builtins:f,copySources:o,operatorConstants:new Map(Se.flatMap(e=>O(e.module,r.name).constants.flatMap(t=>{let n=e.constants?.[t.name];return n===void 0?[]:[[t.name,n]]}))),order:n}),ke=Oe.constants,A=Oe.substitutions;be!==void 0&&f.forEach((e,t)=>{let n=Am(e);n&&f.set(t,n)});let Ae=Vw(De,v.flatMap(e=>e.module.variables.map(e=>e.name))),je=of({definitions:i,substitutions:A,constants:ke,variableIndex:Ae,builtins:f,variables:De}),Me={runtime:m,definitions:i,builtins:f,constants:ke,substitutions:A,instanceNames:oe,variables:De,variableIndex:Ae,facts:je,startupValues:Array.from({length:je.ids.size},()=>void 0),tlcEvalValues:/* @__PURE__ */ new WeakMap,substitutedDefinitions:l,instanceParams:u,evaluators:/* @__PURE__ */ new WeakMap,entryEvaluators:/* @__PURE__ */ new WeakMap,definitionEvaluators:/* @__PURE__ */ new WeakMap},Ne=Wd({constants:new Set(ke.keys()),variables:/* @__PURE__ */ new Set([...De,...[`TLCGet`,`Trace`,`CounterExample`].filter(e=>f.has(e))]),getDefinition:e=>__(e,Me)}),Pe=e=>{try{W(e,{environment:Me,scope:void 0,state:void 0,next:void 0});return}catch(e){if(e instanceof w)return e;throw e}};A.forEach((e,t)=>{let n=i.get(e),r=Ee.includes(t)&&n?.kind===`Operator`&&n.params.length===0&&Ne.analyzeDefinition(n,/* @__PURE__ */ new Map).level>0?Pe(n.body):void 0;if(r){let n=Ft(r)?``:` - specifically: ${r.message}`;throw new C(`The configuration file substitutes constant ${t} with non-constant ${e}${n}`)}}),m.version!==`1.7.4`&&(m.isStarted=!0);let Fe=new Set(v.flatMap(e=>e.module.instances.map(e=>e.module))),Ie=n.createDefinitionOrder();return{environment:Me,assumptions:we,variableLocations:ye.variableLocations,instanceActions:ae,startupDefinitions:v.filter(e=>!Fe.has(e.module.name)||Nw(e).length===0).flatMap(e=>Ie(e===ye?void 0:e.module.name).flatMap(t=>{let n=i.get(e.visible.get(t)?.key??t);return n?[n]:[]})),javaOverrides:v.flatMap(e=>_e.get(e.module.name)??[]),moduleOperators:Se,runtimeInvariants:Ce,rootName:r.name}},Gw=e=>[...e].map(e=>`${e[0]}>${e[1].name}`).sort().join(`,`),Kw=(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},qw=e=>x(new w(`${l}${e}`),S.error),Jw=e=>{let t=I(e),n=/* @__PURE__ */ new Map;return t.domain.forEach((e,r)=>{let i=t.range[r];if(!mn(e)||!mn(i))throw qw(`Symmetry function must have model values as domain and range.`);e.name!==i.name&&n.set(e.name,i)}),n},Yw=(e,t)=>{let n=e.kind===`Name`?e.name:`<<${e.names.join(`,`)}>>`;return t?`${n}\\in${Xw(t)}`:n},Xw=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(Xw).join(`,`)}}`;if(e.kind===`Choose`)return`CHOOSE${Yw(e.pattern,e.set)}:${Xw(e.body)}`;if(e.kind===`Tuple`)return`<<${e.elements.map(Xw).join(`,`)}>>`;if(e.kind===`Record`)return`[${e.fields.map(e=>`${e.name}|->${Xw(e.value)}`).join(`,`)}]`;if(e.kind===`FunctionConstruction`)return`[${e.bounds.map(e=>Yw(e.pattern,e.set)).join(`,`)}|->${Xw(e.body)}]`;if(e.kind!==`Apply`)return``;let t=e.args.map(Xw);return/^[A-Za-z_]/.test(e.operator)?`${e.operator}(${t.join(`,`)})`:t.join(e.operator)},Zw=e=>e.kind===`Apply`&&e.operator===`Permutations`&&e.args.length===1,Qw=(e,t,n)=>{let r=t.definitions.get(e);if(r===void 0&&!t.constants.has(e))throw new C(`The symmetry function ${e} specified in the configuration file\nis not defined in the specification.`);if(r?.kind!==`Operator`||r.params.length>0)throw qw(`The symmetry function ${e} must specify a set of permutations.`);let i=e=>W(e,{environment:t,scope:void 0,state:void 0,next:void 0}),a=i(r.body);if(!dn(a)||!P(a))throw qw(`The symmetry operator must specify a set of functions.`);let o=F(a).elements;if(!o.every(pn))throw qw(`The symmetry values must be function records.`);let s=r.body,c=s.kind===`Apply`?s.args:s.kind===`SetEnumeration`?s.elements:[],l=new Map(n.filter(e=>e.module===void 0).map(e=>[e.target,e.name])),u=e=>{if(e.length===0)return;let n=e.map(e=>{let t=Xw(Zw(e)?e.args[0]:e);return l.get(t)??t}),r=e.length>1;t.runtime.warn(wt.symmetrySetTooSmall,`The set${r?`s`:``} ${n.join(`, and `)} ${r?`have`:`has`} been defined to be a symmetry set but contain${r?``:`s`} less than two elements.`)};if(c.length>=o.length){u(c);return}let d=/* @__PURE__ */ new Map;o.map(Jw).forEach(e=>{e.size>0&&d.set(Gw(e),e)});let f=[...d.values()],p=0;for(;p<d.size;){let e=[...d.values()],t=e.length;f.forEach(n=>e.slice(p,t).forEach(e=>{let t=Kw(n,e),r=Gw(t);t.size>0&&!d.has(r)&&d.set(r,t)})),p=t}let m=new Set([...d.values()].flatMap(e=>[...e.values()].map(e=>e.name))),h=new Set(n.map(e=>e.name));if(u(c.filter(e=>{if(!Zw(e))return!1;let t=e.args[0];if(t.kind!==`Identifier`||h.has(t.name))return!1;let n=i(t);return typeof n==`object`&&n.kind===`Set`&&!n.elements.some(e=>mn(e)&&m.has(e.name))})),d.size!==0)return[...d.values()]},$w=(e,t)=>{for(let n=0;n<e.length;n++){let r=e[n],i=tT(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(tT(e[r],t));return a}},eT=(e,t)=>{let n=[],r=[];for(let i of e){let e=tT(i,t);e===i?n.push(i):r.push(e)}if(r.length===0)return;r.sort($n);let i=[],a=0,o=0;for(;a<n.length&&o<r.length;)i.push($n(n[a],r[o])<0?n[a++]:r[o++]);for(;a<n.length;)i.push(n[a++]);for(;o<r.length;)i.push(r[o++]);return i},tT=(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=eT(e.elements,t);return n?ir(n):e}if(n===`Function`||n===`LazyFunction`&&P(e.domain)){let n=I(e),r=$w(n.domain,t),i=$w(n.range,t)??n.range;if(r){let e=ti(r.map((e,t)=>[e,i[t]]));return e.domain.every((e,t)=>e===n.domain[t])?or(n.domain,e.range):e}return i===n.range?n:or(n.domain,i)}if(n===`Interval`||!dn(e)||!P(e))return e;let r=F(e),i=$w(r.elements,t);return i?Yr(i):r},nT=(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]=tT(e[o],i),a===0&&(a=$n(t[o],r[o])),a>0)break;a<0&&(r=t)}return r},rT={line:0,column:0},iT=e=>({kind:`Identifier`,name:e,location:rT}),aT=e=>({name:e,expression:iT(e),scope:void 0}),oT=/* @__PURE__ */ new Set([`name`,`property`]),sT=(e,t,n)=>{let r=__(t,n);if(!r)throw new C(`The ${e} ${t} specified in the configuration file\nis not defined in the specification.`);if(r.kind===`Operator`&&r.params.length>0)throw new C(oT.has(e)?`TLC requires ${t} not to take any argument.`:`TLC requires ${e} not to take any argument, but one was given: ${t}`);return r},cT=e=>e.body.kind===`Number`||e.body.kind===`String`,lT=(e,t,n)=>n.constants.has(e)?n.constants.get(e):cT(t)?void 0:G_(t,n),uT=(e,t,n)=>{if(n.constants.has(t))throw new C(`The ${e} ${t} cannot be a constant.`);let r=sT(e,t,n);if(lT(t,r,n)!==void 0)throw new C(`The ${e} ${t} cannot be a constant.`);return r},dT=(e,t,n)=>{let r=n.constants.has(t)?void 0:sT(e,t,n),i=r?lT(t,r,n):n.constants.get(t);if(i!==void 0&&i!==!0)throw new C(`The ${e} of ${t} is equal to ${L(i)}`);return i===void 0?r:void 0},fT=(e,t)=>{e>1&&!(e&e-1)&&t?.({kind:`initial-states-progress`,count:e})},pT=(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})),K_(e.startupDefinitions,r),t.invariants.forEach(e=>{dT(`invariant`,e,r)||n?.({kind:`constant-level-invariant`,name:e})})},mT=(e,t)=>{let n=Wd({constants:new Set(t.constants.keys()),variables:new Set(t.variables),getDefinition:e=>t.definitions.get(e)});return e.flatMap(e=>{let r=dT(`invariant`,e,t);if(!r)return[];let i=n.analyzeDefinition(r,/* @__PURE__ */ new Map);if(i.level>=2){let t=i.params.size===0?``:`
1789
1789
  Note that a bug can cause TLC to incorrectly report this error.
1790
1790
  If you believe your TLA+ or PlusCal specification to be correct,
1791
- please check if this bug described in LevelNode.java starting at line 590ff affects you.`;throw x(new C(`The invariant ${e} is not a state predicate (one with no primes or temporal operators).${t}`),S.safetyEvaluationFailure)}return[eT(e)]})},uT=(e,t)=>{if(e.kind===`And`)return e.operands.flatMap(e=>uT(e,t));if(e.kind===`Identifier`&&!t.constants.has(e.name)){let n=h_(e.name,t);if(n?.kind===`Operator`&&n.params.length===0&&U_(n,t)===void 0)return uT(n.body,t)}return[e]},dT=(e,t,n)=>{let r=e.expression;if(r.kind!==`Identifier`||ab(r,e.scope,t)>0)return!1;let i=W(r,kT(t,void 0,void 0,e.scope));if(i===!1)throw new C(`The spec is trivially false because ${r.name} is false.`);if(i!==!0)throw new C(`The operator ${r.name}, which equals ${L(i)},\ncannot be used as a ${n}`);return!0},fT=(e,t,n,r,i)=>{if(e.specification===void 0){let n=(e,n)=>{if(e!==void 0)return aT(n,e,t),$w(e)};return{init:n(e.init,`initial predicate`),next:n(e.next,`next state action`),scope:void 0,temporals:[],isPropertyFairness:!1}}if(e.init!==void 0||e.next!==void 0)throw new C(`The configuration file cannot specify both INIT/NEXT and SPECIFICATION fields.`);let a=[],o=[],s=[],c=t.constants.has(e.specification)?t.constants.get(e.specification):iT(e.specification,nT(`name`,e.specification,t),t);if(c!==void 0)throw new C(`The value of ${e.specification} is equal to ${L(c)}`);let l=nT(`name`,e.specification,t),u=e.properties.length===1?e.properties[0]:void 0,d=!1;sb(l.body,void 0,t,!1).forEach(e=>{let c=e.expression,l=e.path.some(e=>{let n=h_(e,t);return n?.kind===`Operator`&&ab(n.body,void 0,t)===1});if(!l&&dT(e,t,`spec`))return;let f=c.kind===`Identifier`&&!M(c)?t.variableIndex.get(c.name):void 0;if(!l&&c.kind===`Identifier`&&f!==void 0){let e=n[f].range;throw new C(`The operator ${c.name}, which equals ${e?g(e):c.name},\ncannot be used as a spec`)}if(c.kind===`UnboundedQuantifier`&&c.isTemporal)throw x(new C(`TLC does not support temporal existential, nor universal, quantification over state variables.`),S.error);if(c.kind===`Always`&&c.expression.kind===`BoxAction`){let n=Lb(c.expression.subscript,e.scope,t);if(n===void 0&&i?.({kind:`warning`,code:wt.subscriptUndetermined,text:`TLC could not determine if the subscript of the next-state relation contains
1791
+ please check if this bug described in LevelNode.java starting at line 590ff affects you.`;throw x(new C(`The invariant ${e} is not a state predicate (one with no primes or temporal operators).${t}`),S.safetyEvaluationFailure)}return[aT(e)]})},hT=(e,t)=>{if(e.kind===`And`)return e.operands.flatMap(e=>hT(e,t));if(e.kind===`Identifier`&&!t.constants.has(e.name)){let n=__(e.name,t);if(n?.kind===`Operator`&&n.params.length===0&&G_(n,t)===void 0)return hT(n.body,t)}return[e]},gT=(e,t,n)=>{let r=e.expression;if(r.kind!==`Identifier`||lb(r,e.scope,t)>0)return!1;let i=W(r,PT(t,void 0,void 0,e.scope));if(i===!1)throw new C(`The spec is trivially false because ${r.name} is false.`);if(i!==!0)throw new C(`The operator ${r.name}, which equals ${L(i)},\ncannot be used as a ${n}`);return!0},_T=(e,t,n,r,i)=>{if(e.specification===void 0){let n=(e,n)=>{if(e!==void 0)return uT(n,e,t),iT(e)};return{init:n(e.init,`initial predicate`),next:n(e.next,`next state action`),scope:void 0,temporals:[],isPropertyFairness:!1}}if(e.init!==void 0||e.next!==void 0)throw new C(`The configuration file cannot specify both INIT/NEXT and SPECIFICATION fields.`);let a=[],o=[],s=[],c=t.constants.has(e.specification)?t.constants.get(e.specification):lT(e.specification,sT(`name`,e.specification,t),t);if(c!==void 0)throw new C(`The value of ${e.specification} is equal to ${L(c)}`);let l=sT(`name`,e.specification,t),u=e.properties.length===1?e.properties[0]:void 0,d=!1;db(l.body,void 0,t,!1).forEach(e=>{let c=e.expression,l=e.path.some(e=>{let n=__(e,t);return n?.kind===`Operator`&&lb(n.body,void 0,t)===1});if(!l&&gT(e,t,`spec`))return;let f=c.kind===`Identifier`&&!M(c)?t.variableIndex.get(c.name):void 0;if(!l&&c.kind===`Identifier`&&f!==void 0){let e=n[f].range;throw new C(`The operator ${c.name}, which equals ${e?g(e):c.name},\ncannot be used as a spec`)}if(c.kind===`UnboundedQuantifier`&&c.isTemporal)throw x(new C(`TLC does not support temporal existential, nor universal, quantification over state variables.`),S.error);if(c.kind===`Always`&&c.expression.kind===`BoxAction`){let n=Vb(c.expression.subscript,e.scope,t);if(n===void 0&&i?.({kind:`warning`,code:wt.subscriptUndetermined,text:`TLC could not determine if the subscript of the next-state relation contains
1792
1792
  all state variables. Proceed with fingers crossed.`}),r().filter(e=>n!==void 0&&!n.includes(e)).forEach(e=>i?.({kind:`warning`,code:wt.subscriptMissingVariable,text:`The subscript of the next-state relation specified by the specification\ndoes not seem to contain the state variable ${e}`})),o.length>0)throw new C(`The specification contains more than one conjunct of the form [][Next]_v,
1793
- but TLC can handle only specifications with one next-state relation.`);o.push({expression:c.expression.action,scope:e.scope});return}if(c.kind===`Always`&&c.expression.kind!==`Let`&&c.expression.kind!==`Label`&&ab(c.expression,e.scope,t)<2)throw x(new w(`TLC cannot handle the temporal formula ${U(c.expression)}`),S.error);let p=ab(c,e.scope,t);if(p===3)u!==void 0&&e.path.includes(u)||(d=!0),s.push(e);else{if(p===2)throw new C(`TLC cannot handle this conjunct of the spec:\n${U(c)}`);a.push(e)}});let f=[...a,...o],p=e=>`$specification${e}`,m=f.reduce((e,t,n)=>t.scope===void 0?e:{name:p(n),binding:{kind:`Thunk`,expression:t.expression,scope:t.scope,state:void 0,next:void 0,cache:void 0,isStreamed:!1},parent:e},void 0),h=(e,t)=>e.scope===void 0?e.expression:{kind:`Identifier`,name:p(t),location:e.expression.location,resolution:{kind:`Local`}};return{init:a.length===0?void 0:{kind:`And`,operands:a.map(h),location:Qw},next:o.length===0?void 0:h(o[0],a.length),scope:m,temporals:s,isPropertyFairness:s.length>0&&!d}},pT=(e,t,n)=>{let r={initialPredicates:[],invariants:[],actionProperties:[],liveness:[]};return e.properties.forEach(e=>{let i=oT(`property`,e,t);if(!i)return;ab(i.body,void 0,t)===1&&n?.({kind:`state-level-property`,name:e});let a=t.runtime.version!==`1.7.4`;sb(i.body,void 0,t,a).forEach(n=>{let i=n.expression;if(dT(n,t,`property`))return;let a=n.name??e;if(i.kind===`Always`&&i.expression.kind===`BoxAction`){r.actionProperties.push({name:a,box:i.expression,action:i.expression.action,subscript:i.expression.subscript,scope:n.scope});return}if(i.kind===`Always`&&ab(i.expression,n.scope,t)<=1){let e=i.expression,o=e.kind===`Identifier`&&!M(e)?h_(e.name,t):void 0;r.invariants.push({name:o?.name??(e.kind===`Identifier`?e.name:a),expression:e,scope:n.scope});return}let o=ab(i,n.scope,t);if(o<2)r.initialPredicates.push({name:a,expression:i,scope:n.scope});else{if(o===2){let e=U(i),t=`Specifying Systems at https://lamport.azurewebsites.net/tla/book.html`,n=i.kind===`BoxAction`?`To check that action ${a} holds in *every* step of the behavior, define a temporal property by applying the "always" temporal operator ([]) to the formula at ${e} (compare page 90 of ${t}).`:i.kind===`AngleAction`?`To check that infinitely many ${a} steps occur, define a temporal property by applying the "always eventually" temporal operator combination ([]<>) to the formula at ${e} (compare page 91 of ${t}).`:`To check that action ${a} holds in *every* step of the behavior, define a temporal property: Let A be the formula at ${e}; rewrite A as [][A]_v, where v is a state function (typically the tuple of variables) (compare page 90 of ${t}).`;throw new C(`The formula ${a} at ${e} is an action-level formula (i.e., it contains no temporal operators). Only temporal-level (or state-level) formulas are allowed under PROPERTY or PROPERTIES. ${n}`)}r.liveness.push({name:e,expression:i,scope:n.scope})}})}),r},mT=e=>{let t=[],n=/* @__PURE__ */ new Set,r=e=>{if(e===void 0||n.has(e))return!0;n.add(e);let i=e.binding;return i.kind===`Thunk`?(t.push(i.expression),r(i.scope)&&r(e.parent)):i.kind===`Operator`?i.operator.kind===`Closure`&&(t.push(i.operator.body),r(i.operator.scope)&&r(e.parent)):r(e.parent)};return r(e)?t:void 0},hT=(e,t,n)=>t.flatMap(t=>oT(e,t,n)?[eT(t)]:[]),gT=(e,t)=>{let n=h_(e,t);return n?.kind===`Operator`?n.bodyRange:void 0},_T=(e,t)=>e.map((n,r)=>{if(e.indexOf(n)!==r)throw new C(`_POSSIBLE lists ${n} more than once`);aT(`possible`,n,t);let i=eT(n);if(ab(i.expression,void 0,t)===3)throw new C(`The possible of ${n} is equal to a temporal formula; only state- and action-level predicates are supported`);return i}),vT=(e,t,n)=>{if(e.kind!==`Apply`||e.operator!==`\\in`||t?.length!==1)return;let r=e.args[0];if(!(r.kind!==`Identifier`||M(r)))return n.variableIndex.get(r.name)===t[0]?{variable:t[0],set:e.args[1]}:void 0},yT=(e,t)=>{if(e.kind!==`Identifier`||t.constants.has(e.name))return e;let n=h_(e.name,t);return n?.kind===`Operator`&&n.params.length===0?n.body:e},bT=(e,t)=>e.flatMap(e=>{let n=yT(e.expression,t);return(e.scope===void 0&&gf(n,t)===void 0?[n]:uT(e.expression,t)).map(r=>{let i=e.scope===void 0?gf(r,t):void 0;return{name:e.name,expression:r,scope:e.scope,variables:i,membership:vT(r,i,t),predicate:n}})}),xT=(e,t,n)=>{let r=e.variables;if(!n||!r)return!1;for(let e=0;e<r.length;e++)if(t[r[e]]!==n[r[e]])return!1;return!0},ST=/[\u0100-\uffff]/,CT=/* @__PURE__ */ new Set([`JsonDeserialize`,`ndJsonDeserialize`]),wT=e=>e.kind===`String`?ST.test(e.value):e.kind===`Set`&&e.elements.some(wT),TT=e=>e.kind===`String`&&ST.test(e.value)||e.kind===`Apply`&&CT.has(e.operator)||mt(e).some(TT),ET=(e,t)=>e.constants.some(e=>wT(e.value)||(e.args??[]).some(wT))||[...t.definitions.values()].some(e=>TT(e.body)||e.kind===`Function`&&e.bounds.some(e=>TT(e.set))),DT=e=>{if(!pn(e))return;let t=xn(I(e));if(t.every(e=>typeof e[0]==`string`))return Object.fromEntries(t.map(e=>[String(e[0]),e[1]]))},OT=(e,t,n,r)=>{let i=n===1?`the next-state action`:`action ${t} of the next-state relation`,a=r===`1.7.4`?`assigned`:`defined`;return`Successor state is not completely specified by ${i}. The following variable${e.length>1?`s are`:` is`} not ${a}: ${e.join(`, `)}.\n`},kT=(e,t,n,r)=>({environment:e,scope:r,state:t,next:n}),AT=(e,t,n)=>u_(W(e,t),n),jT=(e,t,n=NT)=>{let r=W(e,t);if(typeof r!=`boolean`)throw new w(n(e,t.environment));return r},MT=(e,t,n)=>{let r=t.kind===`Identifier`?h_(t.name,n):void 0,i=r?.kind===`Operator`?r.body:t,a=r?.kind===`Operator`?r.bodyRange:void 0;return`TLC expected a ${e} value, but did not find one. ${a&&i.kind!==`Number`?g(a):qg(i)}`},NT=(e,t)=>MT(`boolean`,e,t),PT=(e,t)=>jT(e.expression,t,(n,r)=>(e.predicate!==e.expression&&jT(e.predicate,t),NT(n,r))),FT=()=>{},IT=(e,t,n)=>e.forEach(e=>{let r=t.possibleCounts.get(e.name)??0,i=AT(e.expression,n,`_POSSIBLE ${e.name}`);t.possibleCounts.set(e.name,i?r+1:r)}),LT=(e,t)=>{try{return e(kT(t,void 0,void 0))?void 0:{message:void 0}}catch(e){if(e instanceof w)return{message:e.message};throw e}},RT=(e,t)=>{for(let n of e.filter(e=>!e.isAxiom)){let e=LT(e=>m_(W(n.expression,e),n.expression),t);if(e)return{name:qg(n.expression),trace:[],message:e.message}}},zT=(e,t,n,r=!1)=>{let i=Ew(t.source,t.loadModule);return Nn(i.getStringOrder(e,(t.runtimeInvariants??[]).flatMap(e=>e.module??[]))),Rn(t),po(t.fingerprintPolynomial??0),r&&Pn(),{order:i,specification:zw(e,{source:t.source,loadModule:t.loadModule,order:i,loadClass:t.loadClass,print:n,files:{readFile:t.readFile,writeFile:t.writeFile,makeDirectory:t.makeDirectory},seed:t.seed,isTool:t.isTool,traceFile:t.traceSpec?.traceFile,isSanyReported:t.isSanyReported,isWarningEnabled:t.isWarningEnabled,version:t.version,moduleOperators:t.moduleOperators,readLine:t.readLine,runtimeInvariants:t.runtimeInvariants})}},BT=e=>{let t=typeof e.config==`string`?ft(e.config,e.version):e.config,n=zT(t,e,e.onPrint??console.log),r=n.specification;cT(r,t,e.onProgress);let i=r.environment,a,o=()=>a??=Ib(t,i,r.instanceActions);return i.runtime.getSpecification=()=>Vb(o(),t,i,r.variableLocations),{config:t,specification:r,environment:i,search:UT(t,i,r.variableLocations,()=>n.order.getDeclarationOrder(`variable`),e.onProgress,r.moduleOperators,r.runtimeInvariants),getDescription:o}},VT=(e,t,n)=>{let r=RT(e,t);if(!r)return;if(r.message===void 0){let e=`Assumption ${r.name} is false.`;return n(wt.assumptionFalse,e,e),S.assumptionViolation}let i=`Evaluating assumption ${r.name} failed.\n${r.message}`;return n(wt.assumptionEvaluationError,i,Lt(wt.assumptionEvaluationError,i,!0)),S.assumptionViolation},HT=e=>x(new w(`${l}Could not find operator: ${e.operator} in module: ${e.module}`),S.error),UT=(e,t,n,r,i,a=[],o=[])=>{let s=e=>a.filter(t=>t.kind===e).map(e=>{if(e.key===void 0)throw HT(e);return{name:e.operator,key:e.key}}),c=lT(e.invariants,t),u=fT(e,t,n,r,i),d=pT(e,t,i),f=e.properties[0],p=f&&h_(f,t)?.location.range,m=e.specification,h=m&&h_(m,t)?.location.range;u.isPropertyFairness&&p&&h&&i?.({kind:`warning`,code:wt.fairnessTautology,text:`Implied-temporal checking is a tautology.\nThe temporal formula ${f} at ${g(p)} equals\nthe fairness constraints of the behavior specification ${m} at ${g(h)}.\nTherefore, checking whether ${m} => ${f} using TLC will never result in a violation of ${f}.`});let _=bT([...c,...d.invariants],t),v=_.length>0||d.actionProperties.length>0||d.liveness.length>0;if(u.init===void 0&&(v||d.initialPredicates.length>0||t.variables.length>0))throw new C(t.runtime.version===`1.7.4`?kt:`The configuration file did not specify the initial state predicate.`);if(u.next===void 0&&v)throw new C(`The configuration file did not specify the next state predicate.`);let y=bT(o.map(e=>{let n=h_(e.name,t);return{name:e.name,expression:n?.kind===`Operator`?n.body:$w(e.name),scope:void 0}}),t),ee=[..._,...y],b=[...new Map(ee.map(e=>[e.predicate,e])).values()],te=hT(`constraint`,[...e.constraints,...s(`constraint`).map(e=>e.name)],t),ne=bT(te,t),re=hT(`action constraint`,e.actionConstraints,t),T=t.coverage,ie=(e,n,r=!0)=>n.flatMap(n=>{if(!T)return[];let i=r?yT(n.expression,t):n.expression,a=Fo(r?n.name:void 0,i,t),o=No(T,e,a,i,n.scope);return[{expression:i,scope:n.scope,node:o}]}),ae=[...ie(`invariant`,c),...ie(`invariant`,d.invariants,!1)],oe=new Map([...c,...d.invariants].map((e,n)=>[yT(e.expression,t),ae[n]])),se=ie(`constraint`,re),ce=ie(`constraint`,te),le=ie(`implied`,d.initialPredicates,!1),E=ie(`implied`,d.actionProperties.map(e=>({...e,expression:e.box})),!1),D=(e,n,r,i)=>{try{return qo(e,n.node,()=>W(n.expression,kT(t,r,i,n.scope)))}catch{return}},ue=(e,t,n)=>{if(T){for(let r of e){let e=D(T,r,t,n);if(typeof e!=`boolean`)return;if(!e)return T.primary[r.node]++,!1;T.secondary[r.node]++}return!0}};e.rlReward!==void 0&&nT(`rlreward`,e.rlReward,t),e.periodic!==void 0&&nT(`periodic`,e.periodic,t);let O=_T(e.possible,t);if(t.variables.length===0)return;let k=e.symmetry===void 0?void 0:qw(e.symmetry,t,e.substitutions),de=e.view===void 0?void 0:aT(`view function`,e.view,t),fe=e.view??s(`view`)[0]?.name,pe=fe===void 0?void 0:eT(fe),me=d.actionProperties.map(e=>{let t={kind:`Unchanged`,expression:e.subscript,location:Qw};return{...e,unchanged:t}}),he=e=>ab(e.expression,void 0,t)>=2,ge=O.filter(e=>!he(e)),_e=O.filter(he),ve=t.runtime,ye,be=()=>{if(ye)return ye;let e=r(),n=n=>{let r=e.indexOf(t.variables[n]);return r===-1?t.variables.length:r};return ye=t.variables.map((e,t)=>t).sort((e,t)=>n(e)-n(t)),ye},xe=(e,n)=>W(e,kT(t,n,void 0)),Se=e=>(pe!==void 0&&e.forEach(Wr),k===void 0?e:Zw(e,k,be())),Ce=e=>{let t=Se(e);return To(pe===void 0?be().map(e=>t[e]):[xe(pe.expression,t)])},we=e=>d.initialPredicates.find((n,r)=>{let i=T&&D(T,le[r],e,void 0);return typeof i==`boolean`?!i:!jT(n.expression,kT(t,e,void 0,n.scope))}),Te=/* @__PURE__ */ new WeakSet,Ee=(e,n,r)=>{let i=r&&!Te.has(r)?r:void 0;if(xT(e,n,i))return!1;try{let r=kT(t,n,void 0,e.scope),a=e.membership;return i&&a?!ta(n[a.variable],i[a.variable],W(a.set,r)):!PT(e,r)}catch(t){throw r?Ut(x(t,S.safetyEvaluationFailure),wt.invariantEvaluationFailed,`Evaluating invariant ${e.name} failed.`):t}},De=(e,t,n)=>{let r=oe.get(e.predicate),i=T&&r?D(T,r,t,void 0):void 0;return typeof i==`boolean`?!i:ee.some(r=>r.predicate===e.predicate&&Ee(r,t,n))},Oe=ET(e,t);ve.getFingerprint=Ce;let ke=()=>{let e=O.find(e=>!ve.possibleCounts.get(e.name));if(!e)return;let n=gT(e.name,t),r=n?` at ${g(n)}`:``;return{name:e.name,code:wt.possibleUnwitnessed,message:`The _POSSIBLE predicate ${e.name}${r} was never witnessed.\nOthers may be unwitnessed too; only witnessed predicates appear with a\nnon-zero count in the record printed above.\nSee https://explain.tlapl.us/possible-conditions for additional details.`,counts:N(L(Bp(ve),!0))}},A=de?.body.kind===`Tuple`?de.body.elements:[],Ae=A.flatMap(e=>e.kind===`Identifier`&&t.variables.includes(e.name)?[e.name]:[]),je=de?.body.kind===`Tuple`&&Ae.length===A.length&&new Set(Ae).size===Ae.length,Me=(e,n)=>je?be().filter(e=>Ae.includes(t.variables[e])).map(e=>`/\\ ${t.variables[e]} = ${N(L(n[e]))}\n`).join(``):N(L(xe(e,n))),Ne=(e,n,r)=>jT(e.expression,kT(t,n,r),e=>`${l}${NT(e,t)}`),Pe=e=>{let n=Object.fromEntries(be().map(n=>[t.variables[n],e[n]]));return pe===void 0?n:Bn(n,()=>Me(pe.expression,e))};return ve.toRecord=Pe,{properties:d,spec:u,toRecord:Pe,evaluateAlias:(e,n,r,i)=>{let a=()=>Pe(n.map(e=>e??nr(`null`)));try{aT(`alias`,e,t);let i=W($w(e),kT(t,n,r)),o=DT(i);return o===void 0?a():Hn(o,e)}catch(e){if(!(e instanceof C||e instanceof w))throw e;return{...a(),_ALIASEvalError:Rt(e.message,i)}}},isSymmetric:k!==void 0,isConstrained:ne.length>0||re.length>0,getTypedChecks:n=>{if(T!==void 0||O.length>0||e.periodic!==void 0||[...ee,...ne].some(e=>e.scope!==void 0)||re.length>0||d.actionProperties.some(e=>e.scope!==void 0)||d.liveness.length>0&&(n===void 0||pe!==void 0)||u.init===void 0||u.next===void 0)return;let r=b.map(e=>e.predicate),i=[...new Set(ne.map(e=>e.predicate))],a=d.initialPredicates.map(e=>e.expression),o=[...t.facts.ids.keys()],s=mT(u.scope),c=e=>U_(e,t)===void 0&&pf(e,t,`replayed`);return(s===void 0?o.some(c):o.some(e=>!(e.kind===`Operator`&&e.params.length>0)&&lf(e,t)&&c(e))||ff([u.init,u.next,...r,...i,...a,...d.actionProperties.flatMap(e=>[e.action,e.subscript]),...pe?[pe.expression]:[],...s,...sx(n??[])],t,`replayed`))?void 0:{init:u.init,next:u.next,scope:u.scope,invariants:r,constraints:i,holdsInitialPredicates:e=>we(e)===void 0,actionProperties:d.actionProperties,symmetry:k,view:pe?.expression,variableOrder:be(),liveness:n}},getTlcOrder:be,getStoredFingerprints:(e,t)=>pe!==void 0||Oe?BigInt64Array.from(e,Ce):Do(t,be()),getFingerprintState:e=>{if(Oe)return[String(Ce(e))];let t=Se(e);return pe===void 0?t:[xe(pe.expression,t)]},findViolatedInvariant:(e,t)=>{let n=T===void 0?ee.find(n=>Ee(n,e,t)):b.find(n=>De(n,e,t));return n&&Te.add(e),n},forEachViolatedInvariant:(e,t)=>{for(let n of b)De(n,e,void 0)&&(Te.add(e),t(n))},checkReplayedInitialState:(e,t,n,r)=>{let i=(n,r)=>jT(n,kT(t,e,void 0,r));ne.every(e=>i(e.predicate,e.scope))&&n();for(let e of b)i(e.predicate,e.scope)||r({status:`invariant-violation`,name:e.name});let a=d.initialPredicates.find(e=>!i(e.expression,e.scope));a&&r({status:`liveness-violation`,name:a.name})},checkReplayedSuccessor:(e,t,n,r)=>(!(!(ne.every(e=>jT(e.predicate,kT(n,t,void 0,e.scope)))&&re.every(r=>jT(r.expression,kT(n,e,t,r.scope))))||r())||b.every(e=>jT(e.predicate,kT(n,t,void 0,e.scope))))&&me.every(r=>jT(r.box,kT(n,e,t,r.scope))),satisfiesConstraints:(e,n)=>ue(ce,e)??ne.every(r=>xT(r,e,n)||PT(r,kT(t,e,void 0))),findFailedInitialPredicate:we,findViolatedActionProperty:(e,n)=>me.find((r,i)=>{let a=T&&D(T,E[i],e,n);if(typeof a==`boolean`)return!a;try{return!jT(r.action,kT(t,e,n,r.scope),()=>`Attempted to evaluate an expression of form [A]_e, but A was not a boolean.\n${U(r.box)}`)&&!AT(r.unchanged,kT(t,e,n,r.scope),`a subscript`)}catch(e){throw Ut(WT(e),wt.actionPropertyEvaluationFailed,`Evaluating action property ${r.name} failed.`)}}),satisfiesActionConstraints:(e,t)=>ue(se,e,t)??re.every(n=>Ne(n,e,t)),getExcludingConstraints:(e,n)=>[...ne.filter(e=>!PT(e,kT(t,n,void 0))),...re.filter(t=>!Ne(t,e,n))].map(e=>{let n=gT(e.name,t);return n?g(n):e.name}),trackStatePossible:ge.length===0?FT:e=>IT(ge,ve,kT(t,e,void 0)),trackActionPossible:_e.length===0?FT:(e,n)=>IT(_e,ve,kT(t,e,n)),findUnwitnessedPossible:ke,getReward:(n,r,i)=>{if(e.rlReward===void 0)return i;let a=$w(e.rlReward),o=W(a,kT(t,n,r));if(typeof o!=`number`)throw new w(MT(`integer`,a,t));return o},findPostconditionViolation:(n=!1)=>{let r=s(`postcondition`),i=e.postconditions.map(e=>{let n=h_(e,t);return n?n.kind===`Operator`&&n.params.length>0?`TLC requires post condition not to take any argument, but one was given: ${e}`:!rT(n)&&U_(n,t)!==void 0?`The post condition ${e} cannot be a constant.`:void 0:`The post condition ${e} specified in the configuration file\nis not defined in the specification.`}).find(e=>e!==void 0);if(i!==void 0){if(n)return;throw x(new w(i),S.configParseError)}let a=(e,n)=>{let r=LT(e=>jT($w(n),e),t);if(!r)return;let i=h_(n,t)?.body,a=gT(n,t),o=a?` at ${i?.kind===`Number`?qg(i):g(a)}`:``;return r.message===void 0?{name:e,code:wt.postconditionFalse,message:`Postcondition ${e}${o} is false.`}:{name:e,code:wt.postconditionFailed,message:`Evaluating postcondition ${e}${o} failed.\n${r.message}`}};for(let e of r){let t=a(e.name,e.key);if(t)return t}let o=ke();if(o)return o;for(let t of e.postconditions){let e=a(t,t);if(e)return e}}}},WT=e=>e instanceof t?x(e,e.exitCode):e,GT=(e,t)=>e*((t-e)/2**64),KT=e=>e.includes(`.`)?e:`${e}.0`,qT=e=>{let t=Math.abs(e);if(t>=.001&&t<1e7)return KT(String(e));let[n,r]=e.toExponential().split(`e`);return`${KT(n)}E${r.replace(`+`,``)}`},JT=e=>e!==void 0&&e>=`0`&&e<=`9`,YT=e=>{if(e===0)return`0.0`;let t=qT(e),n=0,r=0,i=``;for(;t[n]===`0`;)n++;for(;JT(t[n]);)i+=t[n++],r++;if(n===t.length)return i;if(t[n]!==`.`)return t;if(n++,r>=2)for(;JT(t[n]);)n++;else{if(i+=`.`,r===0)for(;t[n]===`0`;)i+=t[n++];for(;JT(t[n])&&r<2;)i+=t[n++],r++;for(JT(t[n])&&Number(t[n])>=5&&(i=XT(i));JT(t[n]);)n++}return n>=t.length?i:t[n]===`E`?`${i}${t.slice(n)}`:t},XT=e=>{let t=e.length-1;if(t<0)return`1`;let n=e[t],r=e.slice(0,t);return n===`.`?`${XT(r)}.`:n===`9`?`${XT(r)}0`:`${r}${Number(n)+1}`},ZT=e=>{let t=0;for(;10n**BigInt(t+1)<e*10n;)t++;let n=10n**BigInt(t+1),r=n/e,i=n%e*2n>=e;return Number(`${r+(i?1n:0n)}e-${t+1}`)},QT=(e,t,n)=>{if(GT(e,t)<1e-10)return;let r=1/0,i=9223372036854775807n,a;if(n(e=>{if(e.length===0)return;let t=e.sort();if(a!==void 0&&a<0n==t[0]<0n){let e=t[0]-a;e<i&&(i=e)}a=t[t.length-1];let n=new Int32Array(t.buffer,t.byteOffset,t.length*2);for(let e=1;e<t.length;e++){let a=n[2*e+1],o=n[2*e-1];if(a<0!=o<0)continue;let s=a-o;if(s<=1048576){let t=s*4294967296+(n[2*e]>>>0)-(n[2*e-2]>>>0);r=Math.min(r,t)}else{let n=t[e]-t[e-1];n<i&&(i=n)}}}),r===1/0)return i;let o=BigInt(r);return o<i?o:i},$T=e=>{let t=e.reduce((e,t)=>e+t,0);if(t===0)return;let n=e.flatMap((e,t)=>e>0?[t]:[]),r=e.reduce((e,t,n)=>e+t*n,0),i=Math.floor(t*.95),a=0,o=n.find(t=>(a+=e[t],a>i));return`The average outdegree of the complete state graph is ${Math.round(r/t)} (minimum is ${n[0]}, the maximum ${n[n.length-1]} and the 95th percentile is ${o}).`},eE=[void 0,`lambda`,`tuple`,`record`],tE=()=>{let e=/* @__PURE__ */ new Int32Array(1024),t=0,n=0,r=[],i=/* @__PURE__ */ new Map,a=n=>{if(t===e.length){let t=new Int32Array(e.length*2);t.set(e),e=t}e[t++]=n},o=e=>{let t=i.get(e);if(t!==void 0)return a(t);i.set(e,r.length),a(r.length),r.push(e)},s=e=>{if(typeof e==`boolean`)return a(+!!e),!0;if(typeof e==`number`)return(e|0)===e&&(a(2),a(e),!0);if(typeof e==`string`)return a(3),o(e),!0;if(e.kind===`ModelValue`)return a(4),o(e.name),!0;if(e.kind===`Set`)return a(5),a(e.elements.length),e.elements.every(s);if(e.kind===`Function`){let t=ma(e.domain);return t?(a(7),a(eE.indexOf(lr(e))),a(t.low),a(e.range.length),e.range.every(s)):(a(6),a(eE.indexOf(lr(e))),a(e.domain.length),e.domain.every(s)&&e.range.every(s))}return!1};return{encode:e=>{let r=t;return e.every(s)?(n++,!0):(t=r,!1)},finish:()=>({words:e.slice(0,t),strings:r,count:n})}},nE=e=>t=>{let n=t.words,r=0,i=e=>Array.from({length:e},()=>a()),a=()=>{let e=n[r++];if(e===0)return!1;if(e===1)return!0;if(e===2)return n[r++];if(e===3)return t.strings[n[r++]];if(e===4)return nr(t.strings[n[r++]]);if(e===5)return ir(i(n[r++]));let a=eE[n[r++]];if(e===7){let e=n[r++],t=n[r++],o=ui({kind:`Interval`,low:e,high:e+t-1});return cr(or(o,i(t)),a)}let o=n[r++],s=i(o);return cr(or(s,i(o)),a)};return Array.from({length:t.count},()=>Array.from({length:e},()=>a()))};export{Lg as $,yr as $t,Ib as A,To as At,py as B,mi as Bt,zC as C,Ke as Cn,Ao as Ct,ox as D,xo as Dt,cx as E,yo as Et,fy as F,ti as Ft,Sv as G,Ta as Gt,my as H,fi as Ht,iy as I,nr as It,av as J,rr as Jt,U as K,Ea as Kt,cy as L,pi as Lt,gb as M,$n as Mt,$y as N,Ki as Nt,zb as O,bo as Ot,ry as P,Sr as Pt,Fg as Q,P as Qt,ay as R,Yr as Rt,BC as S,tt as Sn,Xo as St,lx as T,Ee as Tn,cs as Tt,uy as U,Ya as Ut,oy as V,ir as Vt,ny as W,L as Wt,U_ as X,Ai as Xt,h_ as Y,an as Yt,mv as Z,Fn as Zt,cT as _,zt as _n,ff as _t,QT as a,Tt as an,Nh as at,FC as b,mt as bn,No as bt,zT as c,Rt as cn,pm as ct,RT as d,Pt as dn,Hp as dt,gr as en,Ig as et,kT as f,$t as fn,Kp as ft,sT as g,Xt as gn,lf as gt,VT as h,Wt as hn,yp as ht,ZT as i,wt as in,Ih as it,Vb as j,tn as jt,Bb as k,go as kt,HT as l,Vt as ln,fm as lt,BT as m,Ft as mn,hp as mt,tE as n,F as nn,cg as nt,GT as o,Ot as on,Ph as ot,OT as p,Yt as pn,Wp as pt,W as q,on as qt,YT as r,_r as rn,Rg as rt,$T as s,Lt as sn,Fh as st,nE as t,Wr as tn,zg as tt,UT as u,Bt as un,mm as ut,WT as v,vt as vn,Ac as vt,JS as w,xe as wn,Fo as wt,LC as x,ft as xn,Uo as xt,Xw as y,gt as yn,cc as yt,hy as z,or as zt};
1793
+ but TLC can handle only specifications with one next-state relation.`);o.push({expression:c.expression.action,scope:e.scope});return}if(c.kind===`Always`&&c.expression.kind!==`Let`&&c.expression.kind!==`Label`&&lb(c.expression,e.scope,t)<2)throw x(new w(`TLC cannot handle the temporal formula ${U(c.expression)}`),S.error);let p=lb(c,e.scope,t);if(p===3)u!==void 0&&e.path.includes(u)||(d=!0),s.push(e);else{if(p===2)throw new C(`TLC cannot handle this conjunct of the spec:\n${U(c)}`);a.push(e)}});let f=[...a,...o],p=e=>`$specification${e}`,m=f.reduce((e,t,n)=>t.scope===void 0?e:{name:p(n),binding:{kind:`Thunk`,expression:t.expression,scope:t.scope,state:void 0,next:void 0,cache:void 0,isStreamed:!1},parent:e},void 0),h=(e,t)=>e.scope===void 0?e.expression:{kind:`Identifier`,name:p(t),location:e.expression.location,resolution:{kind:`Local`}};return{init:a.length===0?void 0:{kind:`And`,operands:a.map(h),location:rT},next:o.length===0?void 0:h(o[0],a.length),scope:m,temporals:s,isPropertyFairness:s.length>0&&!d}},vT=(e,t,n)=>{let r={initialPredicates:[],invariants:[],actionProperties:[],liveness:[]};return e.properties.forEach(e=>{let i=dT(`property`,e,t);if(!i)return;lb(i.body,void 0,t)===1&&n?.({kind:`state-level-property`,name:e});let a=t.runtime.version!==`1.7.4`;db(i.body,void 0,t,a).forEach(n=>{let i=n.expression;if(gT(n,t,`property`))return;let a=n.name??e;if(i.kind===`Always`&&i.expression.kind===`BoxAction`){r.actionProperties.push({name:a,box:i.expression,action:i.expression.action,subscript:i.expression.subscript,scope:n.scope});return}if(i.kind===`Always`&&lb(i.expression,n.scope,t)<=1){let e=i.expression,o=e.kind===`Identifier`&&!M(e)?__(e.name,t):void 0;r.invariants.push({name:o?.name??(e.kind===`Identifier`?e.name:a),expression:e,scope:n.scope});return}let o=lb(i,n.scope,t);if(o<2)r.initialPredicates.push({name:a,expression:i,scope:n.scope});else{if(o===2){let e=U(i),t=`Specifying Systems at https://lamport.azurewebsites.net/tla/book.html`,n=i.kind===`BoxAction`?`To check that action ${a} holds in *every* step of the behavior, define a temporal property by applying the "always" temporal operator ([]) to the formula at ${e} (compare page 90 of ${t}).`:i.kind===`AngleAction`?`To check that infinitely many ${a} steps occur, define a temporal property by applying the "always eventually" temporal operator combination ([]<>) to the formula at ${e} (compare page 91 of ${t}).`:`To check that action ${a} holds in *every* step of the behavior, define a temporal property: Let A be the formula at ${e}; rewrite A as [][A]_v, where v is a state function (typically the tuple of variables) (compare page 90 of ${t}).`;throw new C(`The formula ${a} at ${e} is an action-level formula (i.e., it contains no temporal operators). Only temporal-level (or state-level) formulas are allowed under PROPERTY or PROPERTIES. ${n}`)}r.liveness.push({name:e,expression:i,scope:n.scope})}})}),r},yT=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},bT=(e,t,n)=>t.flatMap(t=>dT(e,t,n)?[aT(t)]:[]),xT=(e,t)=>{let n=__(e,t);return n?.kind===`Operator`?n.bodyRange:void 0},ST=(e,t)=>e.map((n,r)=>{if(e.indexOf(n)!==r)throw new C(`_POSSIBLE lists ${n} more than once`);uT(`possible`,n,t);let i=aT(n);if(lb(i.expression,void 0,t)===3)throw new C(`The possible of ${n} is equal to a temporal formula; only state- and action-level predicates are supported`);return i}),CT=(e,t,n)=>{if(e.kind!==`Apply`||e.operator!==`\\in`||t?.length!==1)return;let r=e.args[0];if(!(r.kind!==`Identifier`||M(r)))return n.variableIndex.get(r.name)===t[0]?{variable:t[0],set:e.args[1]}:void 0},wT=(e,t)=>{if(e.kind!==`Identifier`||t.constants.has(e.name))return e;let n=__(e.name,t);return n?.kind===`Operator`&&n.params.length===0?n.body:e},TT=(e,t)=>e.flatMap(e=>{let n=wT(e.expression,t);return(e.scope===void 0&&gf(n,t)===void 0?[n]:hT(e.expression,t)).map(r=>{let i=e.scope===void 0?gf(r,t):void 0;return{name:e.name,expression:r,scope:e.scope,variables:i,membership:CT(r,i,t),predicate:n}})}),ET=(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},DT=/[\u0100-\uffff]/,OT=/* @__PURE__ */ new Set([`JsonDeserialize`,`ndJsonDeserialize`]),kT=e=>e.kind===`String`?DT.test(e.value):e.kind===`Set`&&e.elements.some(kT),AT=e=>e.kind===`String`&&DT.test(e.value)||e.kind===`Apply`&&OT.has(e.operator)||mt(e).some(AT),jT=(e,t)=>e.constants.some(e=>kT(e.value)||(e.args??[]).some(kT))||[...t.definitions.values()].some(e=>AT(e.body)||e.kind===`Function`&&e.bounds.some(e=>AT(e.set))),MT=e=>{if(!pn(e))return;let t=xn(I(e));if(t.every(e=>typeof e[0]==`string`))return Object.fromEntries(t.map(e=>[String(e[0]),e[1]]))},NT=(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`},PT=(e,t,n,r)=>({environment:e,scope:r,state:t,next:n}),FT=(e,t,n)=>f_(W(e,t),n),IT=(e,t,n=RT)=>{let r=W(e,t);if(typeof r!=`boolean`)throw new w(n(e,t.environment));return r},LT=(e,t,n)=>{let r=t.kind===`Identifier`?__(t.name,n):void 0,i=r?.kind===`Operator`?r.body:t,a=r?.kind===`Operator`?r.bodyRange:void 0;return`TLC expected a ${e} value, but did not find one. ${a&&i.kind!==`Number`?g(a):Yg(i)}`},RT=(e,t)=>LT(`boolean`,e,t),zT=(e,t)=>IT(e.expression,t,(n,r)=>(e.predicate!==e.expression&&IT(e.predicate,t),RT(n,r))),BT=()=>{},VT=(e,t,n)=>e.forEach(e=>{let r=t.possibleCounts.get(e.name)??0,i=FT(e.expression,n,`_POSSIBLE ${e.name}`);t.possibleCounts.set(e.name,i?r+1:r)}),HT=(e,t)=>{try{return e(PT(t,void 0,void 0))?void 0:{message:void 0}}catch(e){if(e instanceof w)return{message:e.message};throw e}},UT=(e,t)=>{for(let n of e.filter(e=>!e.isAxiom)){let e=HT(e=>g_(W(n.expression,e),n.expression),t);if(e)return{name:Yg(n.expression),trace:[],message:e.message}}},WT=(e,t,n,r=!1)=>{let i=jw(t.source,t.loadModule);return Nn(i.getStringOrder(e,(t.runtimeInvariants??[]).flatMap(e=>e.module??[]))),Rn(t),po(t.fingerprintPolynomial??0),r&&Pn(),{order:i,specification:Ww(e,{source:t.source,loadModule:t.loadModule,order:i,loadClass:t.loadClass,print:n,files:{readFile:t.readFile,writeFile:t.writeFile,makeDirectory:t.makeDirectory},seed:t.seed,isTool:t.isTool,traceFile:t.traceSpec?.traceFile,isSanyReported:t.isSanyReported,isWarningEnabled:t.isWarningEnabled,version:t.version,moduleOperators:t.moduleOperators,readLine:t.readLine,runtimeInvariants:t.runtimeInvariants})}},GT=e=>{let t=typeof e.config==`string`?ft(e.config,e.version):e.config,n=WT(t,e,e.onPrint??console.log),r=n.specification;pT(r,t,e.onProgress);let i=r.environment,a,o=()=>a??=Bb(t,i,r.instanceActions);return i.runtime.getSpecification=()=>Gb(o(),t,i,r.variableLocations),{config:t,specification:r,environment:i,search:JT(t,i,r.variableLocations,()=>n.order.getDeclarationOrder(`variable`),e.onProgress,r.moduleOperators,r.runtimeInvariants),getDescription:o}},KT=(e,t,n)=>{let r=UT(e,t);if(!r)return;if(r.message===void 0){let e=`Assumption ${r.name} is false.`;return n(wt.assumptionFalse,e,e),S.assumptionViolation}let i=`Evaluating assumption ${r.name} failed.\n${r.message}`;return n(wt.assumptionEvaluationError,i,Lt(wt.assumptionEvaluationError,i,!0)),S.assumptionViolation},qT=e=>x(new w(`${l}Could not find operator: ${e.operator} in module: ${e.module}`),S.error),JT=(e,t,n,r,i,a=[],o=[])=>{let s=e=>a.filter(t=>t.kind===e).map(e=>{if(e.key===void 0)throw qT(e);return{name:e.operator,key:e.key}}),c=mT(e.invariants,t),u=_T(e,t,n,r,i),d=vT(e,t,i),f=e.properties[0],p=f&&__(f,t)?.location.range,m=e.specification,h=m&&__(m,t)?.location.range;u.isPropertyFairness&&p&&h&&i?.({kind:`warning`,code:wt.fairnessTautology,text:`Implied-temporal checking is a tautology.\nThe temporal formula ${f} at ${g(p)} equals\nthe fairness constraints of the behavior specification ${m} at ${g(h)}.\nTherefore, checking whether ${m} => ${f} using TLC will never result in a violation of ${f}.`});let _=TT([...c,...d.invariants],t),v=_.length>0||d.actionProperties.length>0||d.liveness.length>0;if(u.init===void 0&&(v||d.initialPredicates.length>0||t.variables.length>0))throw new C(t.runtime.version===`1.7.4`?kt:`The configuration file did not specify the initial state predicate.`);if(u.next===void 0&&v)throw new C(`The configuration file did not specify the next state predicate.`);let y=TT(o.map(e=>{let n=__(e.name,t);return{name:e.name,expression:n?.kind===`Operator`?n.body:iT(e.name),scope:void 0}}),t),ee=[..._,...y],b=[...new Map(ee.map(e=>[e.predicate,e])).values()],te=bT(`constraint`,[...e.constraints,...s(`constraint`).map(e=>e.name)],t),ne=TT(te,t),re=bT(`action constraint`,e.actionConstraints,t),T=t.coverage,ie=(e,n,r=!0)=>n.flatMap(n=>{if(!T)return[];let i=r?wT(n.expression,t):n.expression,a=Fo(r?n.name:void 0,i,t),o=No(T,e,a,i,n.scope);return[{expression:i,scope:n.scope,node:o}]}),ae=[...ie(`invariant`,c),...ie(`invariant`,d.invariants,!1)],oe=new Map([...c,...d.invariants].map((e,n)=>[wT(e.expression,t),ae[n]])),se=ie(`constraint`,re),ce=ie(`constraint`,te),le=new Map(ce.map(e=>[e.expression,e])),E=[...new Map(ne.map(e=>[e.predicate,e])).values()],D=ie(`implied`,d.initialPredicates,!1),ue=ie(`implied`,d.actionProperties.map(e=>({...e,expression:e.box})),!1),O=(e,n,r,i)=>{try{return qo(e,n.node,()=>W(n.expression,PT(t,r,i,n.scope)))}catch{return}},k=(e,t,n)=>T&&e?qo(T,e.node,()=>IT(e.expression,n)):IT(t,n),de=(e,t,n)=>{if(T){for(let r of e){let e=O(T,r,t,n);if(typeof e!=`boolean`)return;if(!e)return T.primary[r.node]++,!1;T.secondary[r.node]++}return!0}};e.rlReward!==void 0&&sT(`rlreward`,e.rlReward,t),e.periodic!==void 0&&sT(`periodic`,e.periodic,t);let fe=ST(e.possible,t);if(t.variables.length===0)return;let pe=e.symmetry===void 0?void 0:Qw(e.symmetry,t,e.substitutions),me=e.view===void 0?void 0:uT(`view function`,e.view,t),he=e.view??s(`view`)[0]?.name,ge=he===void 0?void 0:aT(he),_e=d.actionProperties.map(e=>{let t={kind:`Unchanged`,expression:e.subscript,location:rT};return{...e,unchanged:t}}),ve=e=>lb(e.expression,void 0,t)>=2,ye=fe.filter(e=>!ve(e)),be=fe.filter(ve),xe=t.runtime,Se,Ce=()=>{if(Se)return Se;let e=r(),n=n=>{let r=e.indexOf(t.variables[n]);return r===-1?t.variables.length:r};return Se=t.variables.map((e,t)=>t).sort((e,t)=>n(e)-n(t)),Se},we=(e,n)=>W(e,PT(t,n,void 0)),Te=e=>(ge!==void 0&&e.forEach(Wr),pe===void 0?e:nT(e,pe,Ce())),Ee=e=>{let t=Te(e);return To(ge===void 0?Ce().map(e=>t[e]):[we(ge.expression,t)])},De=e=>d.initialPredicates.find((n,r)=>{let i=T&&O(T,D[r],e,void 0);return typeof i==`boolean`?!i:!IT(n.expression,PT(t,e,void 0,n.scope))}),Oe=/* @__PURE__ */ new WeakSet,ke=(e,n,r)=>{let i=r&&!Oe.has(r)?r:void 0;if(ET(e,n,i))return!1;try{let r=PT(t,n,void 0,e.scope),a=e.membership;return i&&a?!ta(n[a.variable],i[a.variable],W(a.set,r)):!zT(e,r)}catch(t){throw r?Ut(x(t,S.safetyEvaluationFailure),wt.invariantEvaluationFailed,`Evaluating invariant ${e.name} failed.`):t}},A=(e,t,n)=>{let r=oe.get(e.predicate),i=T&&r?O(T,r,t,void 0):void 0;return typeof i==`boolean`?!i:ee.some(r=>r.predicate===e.predicate&&ke(r,t,n))},Ae=jT(e,t);xe.getFingerprint=Ee;let je=()=>{let e=fe.find(e=>!xe.possibleCounts.get(e.name));if(!e)return;let n=xT(e.name,t),r=n?` at ${g(n)}`:``;return{name:e.name,code:wt.possibleUnwitnessed,message:`The _POSSIBLE predicate ${e.name}${r} was never witnessed.\nOthers may be unwitnessed too; only witnessed predicates appear with a\nnon-zero count in the record printed above.\nSee https://explain.tlapl.us/possible-conditions for additional details.`,counts:N(L(Bp(xe),!0))}},Me=me?.body.kind===`Tuple`?me.body.elements:[],Ne=Me.flatMap(e=>e.kind===`Identifier`&&t.variables.includes(e.name)?[e.name]:[]),Pe=me?.body.kind===`Tuple`&&Ne.length===Me.length&&new Set(Ne).size===Ne.length,Fe=(e,n)=>Pe?Ce().filter(e=>Ne.includes(t.variables[e])).map(e=>`/\\ ${t.variables[e]} = ${N(L(n[e]))}\n`).join(``):N(L(we(e,n))),Ie=(e,n,r)=>IT(e.expression,PT(t,n,r),e=>`${l}${RT(e,t)}`),Le=e=>{let n=Object.fromEntries(Ce().map(n=>[t.variables[n],e[n]]));return ge===void 0?n:Bn(n,()=>Fe(ge.expression,e))};return xe.toRecord=Le,{properties:d,spec:u,toRecord:Le,evaluateAlias:(e,n,r,i)=>{let a=()=>Le(n.map(e=>e??nr(`null`)));try{uT(`alias`,e,t);let i=W(iT(e),PT(t,n,r)),o=MT(i);return o===void 0?a():Hn(o,e)}catch(e){if(!(e instanceof C||e instanceof w))throw e;return{...a(),_ALIASEvalError:Rt(e.message,i)}}},isSymmetric:pe!==void 0,isConstrained:ne.length>0||re.length>0,getTypedChecks:n=>{if(T!==void 0||fe.length>0||e.periodic!==void 0||[...ee,...ne].some(e=>e.scope!==void 0)||re.length>0||d.actionProperties.some(e=>e.scope!==void 0)||d.liveness.length>0&&(n===void 0||ge!==void 0)||u.init===void 0||u.next===void 0)return;let r=b.map(e=>e.predicate),i=[...new Set(ne.map(e=>e.predicate))],a=d.initialPredicates.map(e=>e.expression),o=[...t.facts.ids.keys()],s=yT(u.scope),c=e=>G_(e,t)===void 0&&pf(e,t,`replayed`);return(s===void 0?o.some(c):o.some(e=>!(e.kind===`Operator`&&e.params.length>0)&&lf(e,t)&&c(e))||ff([u.init,u.next,...r,...i,...a,...d.actionProperties.flatMap(e=>[e.action,e.subscript]),...ge?[ge.expression]:[],...s,...dx(n??[])],t,`replayed`))?void 0:{init:u.init,next:u.next,scope:u.scope,invariants:r,constraints:i,holdsInitialPredicates:e=>De(e)===void 0,actionProperties:d.actionProperties,symmetry:pe,view:ge?.expression,variableOrder:Ce(),liveness:n}},getTlcOrder:Ce,getStoredFingerprints:(e,t)=>ge!==void 0||Ae?BigInt64Array.from(e,Ee):Do(t,Ce()),getFingerprintState:e=>{if(Ae)return[String(Ee(e))];let t=Te(e);return ge===void 0?t:[we(ge.expression,t)]},findViolatedInvariant:(e,t)=>{let n=T===void 0?ee.find(n=>ke(n,e,t)):b.find(n=>A(n,e,t));return n&&Oe.add(e),n},forEachViolatedInvariant:(e,t)=>{for(let n of b)A(n,e,void 0)&&(Oe.add(e),t(n))},checkReplayedInitialState:(e,t,n,r)=>{let i=(n,r,i)=>k(n,r,PT(t,e,void 0,i));E.every(e=>i(le.get(e.predicate),e.predicate,e.scope))&&n();for(let e of b)i(oe.get(e.predicate),e.predicate,e.scope)||r({status:`invariant-violation`,name:e.name});let a=d.initialPredicates.find((e,t)=>!i(D[t],e.expression,e.scope));a&&r({status:`liveness-violation`,name:a.name})},checkReplayedSuccessor:(e,t,n,r)=>(!(!(E.every(e=>k(le.get(e.predicate),e.predicate,PT(n,t,void 0,e.scope)))&&re.every((r,i)=>k(se[i],r.expression,PT(n,e,t,r.scope))))||r())||b.every(e=>k(oe.get(e.predicate),e.predicate,PT(n,t,void 0,e.scope))))&&_e.every((r,i)=>k(ue[i],r.box,PT(n,e,t,r.scope))),satisfiesConstraints:(e,n)=>de(ce,e)??ne.every(r=>ET(r,e,n)||zT(r,PT(t,e,void 0))),findFailedInitialPredicate:De,findViolatedActionProperty:(e,n)=>_e.find((r,i)=>{let a=T&&O(T,ue[i],e,n);if(typeof a==`boolean`)return!a;try{return!IT(r.action,PT(t,e,n,r.scope),()=>`Attempted to evaluate an expression of form [A]_e, but A was not a boolean.\n${U(r.box)}`)&&!FT(r.unchanged,PT(t,e,n,r.scope),`a subscript`)}catch(e){throw Ut(YT(e),wt.actionPropertyEvaluationFailed,`Evaluating action property ${r.name} failed.`)}}),satisfiesActionConstraints:(e,t)=>de(se,e,t)??re.every(n=>Ie(n,e,t)),getExcludingConstraints:(e,n)=>[...ne.filter(e=>!zT(e,PT(t,n,void 0))),...re.filter(t=>!Ie(t,e,n))].map(e=>{let n=xT(e.name,t);return n?g(n):e.name}),trackStatePossible:ye.length===0?BT:e=>VT(ye,xe,PT(t,e,void 0)),trackActionPossible:be.length===0?BT:(e,n)=>VT(be,xe,PT(t,e,n)),findUnwitnessedPossible:je,getReward:(n,r,i)=>{if(e.rlReward===void 0)return i;let a=iT(e.rlReward),o=W(a,PT(t,n,r));if(typeof o!=`number`)throw new w(LT(`integer`,a,t));return o},findPostconditionViolation:(n=!1)=>{let r=s(`postcondition`),i=e.postconditions.map(e=>{let n=__(e,t);return n?n.kind===`Operator`&&n.params.length>0?`TLC requires post condition not to take any argument, but one was given: ${e}`:!cT(n)&&G_(n,t)!==void 0?`The post condition ${e} cannot be a constant.`:void 0:`The post condition ${e} specified in the configuration file\nis not defined in the specification.`}).find(e=>e!==void 0);if(i!==void 0){if(n)return;throw x(new w(i),S.configParseError)}let a=(e,n)=>{let r=HT(e=>IT(iT(n),e),t);if(!r)return;let i=__(n,t)?.body,a=xT(n,t),o=a?` at ${i?.kind===`Number`?Yg(i):g(a)}`:``;return r.message===void 0?{name:e,code:wt.postconditionFalse,message:`Postcondition ${e}${o} is false.`}:{name:e,code:wt.postconditionFailed,message:`Evaluating postcondition ${e}${o} failed.\n${r.message}`}};for(let e of r){let t=a(e.name,e.key);if(t)return t}let o=je();if(o)return o;for(let t of e.postconditions){let e=a(t,t);if(e)return e}}}},YT=e=>e instanceof t?x(e,e.exitCode):e,XT=(e,t)=>e*((t-e)/2**64),ZT=e=>e.includes(`.`)?e:`${e}.0`,QT=e=>{let t=Math.abs(e);if(t>=.001&&t<1e7)return ZT(String(e));let[n,r]=e.toExponential().split(`e`);return`${ZT(n)}E${r.replace(`+`,``)}`},$T=e=>e!==void 0&&e>=`0`&&e<=`9`,eE=e=>{if(e===0)return`0.0`;let t=QT(e),n=0,r=0,i=``;for(;t[n]===`0`;)n++;for(;$T(t[n]);)i+=t[n++],r++;if(n===t.length)return i;if(t[n]!==`.`)return t;if(n++,r>=2)for(;$T(t[n]);)n++;else{if(i+=`.`,r===0)for(;t[n]===`0`;)i+=t[n++];for(;$T(t[n])&&r<2;)i+=t[n++],r++;for($T(t[n])&&Number(t[n])>=5&&(i=tE(i));$T(t[n]);)n++}return n>=t.length?i:t[n]===`E`?`${i}${t.slice(n)}`:t},tE=e=>{let t=e.length-1;if(t<0)return`1`;let n=e[t],r=e.slice(0,t);return n===`.`?`${tE(r)}.`:n===`9`?`${tE(r)}0`:`${r}${Number(n)+1}`},nE=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}`)},rE=(e,t,n)=>{if(XT(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},iE=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}).`},aE=[void 0,`lambda`,`tuple`,`record`],oE=()=>{let e=/* @__PURE__ */ new Int32Array(1024),t=0,n=0,r=[],i=/* @__PURE__ */ new Map,a=n=>{if(t===e.length){let t=new Int32Array(e.length*2);t.set(e),e=t}e[t++]=n},o=e=>{let t=i.get(e);if(t!==void 0)return a(t);i.set(e,r.length),a(r.length),r.push(e)},s=e=>{if(typeof e==`boolean`)return a(+!!e),!0;if(typeof e==`number`)return(e|0)===e&&(a(2),a(e),!0);if(typeof e==`string`)return a(3),o(e),!0;if(e.kind===`ModelValue`)return a(4),o(e.name),!0;if(e.kind===`Set`)return a(5),a(e.elements.length),e.elements.every(s);if(e.kind===`Function`){let t=ma(e.domain);return t?(a(7),a(aE.indexOf(lr(e))),a(t.low),a(e.range.length),e.range.every(s)):(a(6),a(aE.indexOf(lr(e))),a(e.domain.length),e.domain.every(s)&&e.range.every(s))}return!1};return{encode:e=>{let r=t;return e.every(s)?(n++,!0):(t=r,!1)},finish:()=>({words:e.slice(0,t),strings:r,count:n})}},sE=e=>t=>{let n=t.words,r=0,i=e=>Array.from({length:e},()=>a()),a=()=>{let e=n[r++];if(e===0)return!1;if(e===1)return!0;if(e===2)return n[r++];if(e===3)return t.strings[n[r++]];if(e===4)return nr(t.strings[n[r++]]);if(e===5)return ir(i(n[r++]));let a=aE[n[r++]];if(e===7){let e=n[r++],t=n[r++],o=ui({kind:`Interval`,low:e,high:e+t-1});return cr(or(o,i(t)),a)}let o=n[r++],s=i(o);return cr(or(s,i(o)),a)};return Array.from({length:t.count},()=>Array.from({length:e},()=>a()))};export{Xv as $,Fn as $t,Wb as A,bo as At,yy as B,Yr as Bt,WC as C,ft as Cn,Uo as Ct,fx as D,Ee as Dn,cs as Dt,px as E,xe as En,Fo as Et,sy as F,Ki as Ft,oy as G,Ya as Gt,uy as H,mi as Ht,gy as I,Sr as It,W as J,Ea as Jt,wv as K,L as Kt,cy as L,ti as Lt,Gb as M,To as Mt,bb as N,tn as Nt,ux as O,yo as Ot,rb as P,$n as Pt,gv as Q,Ai as Qt,fy as R,nr as Rt,GC as S,mt as Sn,No as St,mx as T,Ke as Tn,Ao as Tt,vy as U,ir as Ut,_y as V,or as Vt,my as W,fi as Wt,__ as X,rr as Xt,sv as Y,on as Yt,G_ as Z,an as Zt,pT as _,Wt as _n,yp as _t,rE as a,_r as an,Bg as at,BC as b,vt as bn,Ac as bt,WT as c,Ot as cn,Ih as ct,UT as d,Vt as dn,fm as dt,P as en,Lg as et,PT as f,Bt as fn,mm as ft,fT as g,Ft as gn,hp as gt,KT as h,Yt as hn,Wp as ht,nE as i,F as in,ug as it,Bb as j,go as jt,Ub as k,xo as kt,qT as l,Lt as ln,Lh as lt,GT as m,$t as mn,Kp as mt,oE as n,gr as nn,Rg as nt,XT as o,wt as on,Rh as ot,NT as p,Pt as pn,Hp as pt,U as q,Ta as qt,eE as r,Wr as rn,Vg as rt,iE as s,Tt as sn,Fh as st,sE as t,yr as tn,zg as tt,JT as u,Rt as un,pm as ut,YT as v,Xt as vn,lf as vt,$S as w,tt as wn,Xo as wt,HC as x,gt as xn,cc as xt,tT as y,zt as yn,ff as yt,ly as z,pi as zt};