tla-ts 0.0.3-dev.852fbc8 → 0.0.3-dev.872f125
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/cli.cjs +1 -1
- package/dist/cli.js +1 -1
- package/dist/index.cjs +1 -1
- package/dist/index.d.cts +165 -46
- package/dist/index.d.ts +165 -46
- package/dist/index.js +1 -1
- package/dist/parallel-worker.cjs +1 -1
- package/dist/parallel-worker.js +2 -2
- package/dist/parallel.cjs +1 -1
- package/dist/parallel.js +2 -2
- package/dist/run-cli.cjs +1351 -22
- package/dist/run-cli.js +1351 -22
- package/dist/transfer.cjs +83 -34
- package/dist/transfer.js +83 -34
- package/package.json +5 -1
- package/src/ast.ts +55 -7
- package/src/bags.ts +4 -7
- package/src/builtins.ts +29 -11
- package/src/bundled-modules.ts +3 -3
- package/src/canonical.ts +4 -3
- package/src/check.ts +1317 -425
- package/src/cli.ts +8 -1
- package/src/codegen.ts +68 -21
- package/src/config.ts +225 -206
- package/src/environment.ts +423 -127
- package/src/errors.ts +155 -18
- package/src/evaluate.ts +716 -262
- package/src/exit-codes.ts +6 -24
- package/src/index.ts +1 -0
- package/src/instances.ts +3 -1
- package/src/java-overrides.ts +104 -25
- package/src/levels.ts +149 -31
- package/src/lexer.ts +112 -29
- package/src/live-check.ts +204 -148
- package/src/liveness.ts +191 -122
- package/src/obligation-expression.ts +2 -2
- package/src/obligation-source.ts +2 -0
- package/src/parallel-worker.ts +6 -1
- package/src/parallel.ts +57 -6
- package/src/parser.ts +428 -141
- package/src/pcal-ast.ts +770 -0
- package/src/pcal-parse.ts +1523 -0
- package/src/pcal-tokenize.ts +516 -0
- package/src/pcal-translate.ts +1230 -0
- package/src/pcal-validate.ts +454 -0
- package/src/randomization.ts +24 -7
- package/src/resolve.ts +1420 -459
- package/src/run-cli.ts +1161 -196
- package/src/runtime.ts +16 -0
- package/src/sany-builtins.ts +147 -0
- package/src/sany-generator.ts +3128 -0
- package/src/sany-levels.ts +1208 -0
- package/src/sany-lexer.ts +545 -0
- package/src/sany-linter.ts +122 -0
- package/src/sany-modules.ts +1398 -0
- package/src/sany-nodes.ts +463 -0
- package/src/sany-parse-error.ts +2161 -0
- package/src/sany-report.ts +354 -0
- package/src/sany-selectors.ts +738 -0
- package/src/sany-source.ts +248 -0
- package/src/sany-xml.ts +1017 -0
- package/src/spec-description.ts +25 -5
- package/src/standard-modules.ts +202 -151
- package/src/standard-ranges.ts +116 -0
- package/src/state-graph.ts +29 -6
- package/src/subexpressions.ts +221 -161
- package/src/substitution-levels.ts +38 -17
- package/src/successors.ts +141 -173
- package/src/symmetry.ts +168 -50
- package/src/tableau.ts +3 -1
- package/src/tlc-ext.ts +13 -17
- package/src/tlc-messages.ts +329 -0
- package/src/tlc-module.ts +49 -21
- package/src/tlc-modules.ts +0 -4
- package/src/tlc-order.ts +55 -9
- package/src/tlc-random.ts +28 -3
- package/src/tlc-replay.ts +655 -0
- package/src/tlc-version.ts +18 -0
- package/src/transfer.ts +15 -3
- package/src/values.ts +705 -296
package/dist/transfer.js
CHANGED
|
@@ -6,29 +6,78 @@
|
|
|
6
6
|
* This source code is licensed under the MIT license found in the
|
|
7
7
|
* LICENSE file in the root directory of this source tree.
|
|
8
8
|
*/
|
|
9
|
-
const e={success:0,assumptionViolation:10,deadlock:11,safetyViolation:12,livenessViolation:13,assertViolation:14,specEvaluationFailure:75,safetyEvaluationFailure:76,livenessEvaluationFailure:77,specParseError:150,configParseError:151,error:255},t=/* @__PURE__ */ new WeakMap,n=(e,n)=>(e instanceof Error&&!t.has(e)&&t.set(e,n),e),r=e=>t.get(e),i
|
|
10
|
-
|
|
11
|
-
|
|
12
|
-
|
|
13
|
-
: `,u=`This was a Java StackOverflowError. It was probably the result
|
|
9
|
+
const e={success:0,assumptionViolation:10,deadlock:11,safetyViolation:12,livenessViolation:13,assertViolation:14,specEvaluationFailure:75,safetyEvaluationFailure:76,livenessEvaluationFailure:77,specParseError:150,configParseError:151,error:255},t=/* @__PURE__ */ new WeakMap,n=(e,n)=>(e instanceof Error&&!t.has(e)&&t.set(e,n),e),r=e=>t.get(e),i=t=>{try{return t()}catch(t){throw n(t,e.error)}},a=e=>{let t=i(e);return t&&{branches:t.branches,addInitialState:(e,n,r)=>i(()=>t.addInitialState(e,n,r)),addState:(e,n,r,a)=>i(()=>t.addState(e,n,r,a)),findViolation:()=>i(()=>t.findViolation()),getViolatedProperties:(e,n)=>i(()=>t.getViolatedProperties(e,n))}},o=e=>`TLC threw an unexpected exception.\nThis was probably caused by an error in the spec or model.\nSee the User Output or TLC Console for clues to what happened.\nThe exception was a ${e}\n: `,s=o(`java.lang.RuntimeException`),c=e=>e instanceof RangeError&&e.message===`Maximum call stack size exceeded`;var l=class extends Error{constructor(e,t){super(e,{cause:t}),this.name=`TlaError`}},u=class extends l{failure;sany;constructor(e,t,n,r){super(e,t),this.name=`TlaSyntaxError`,this.failure=n,this.sany=r}},d=class extends u{location;parseError;constructor(e,t,n){super(e),this.location=t,this.parseError=n}},f=class extends d{constructor(e,t,n=!0){super(`Cannot find source file for module ${e} imported in module ${t}.`,n?t:void 0)}};const p=(e,t=!1,n,r=[])=>new u(e.map(e=>`${e.location}\n\n${e.message}`).join(`
|
|
10
|
+
|
|
11
|
+
`),void 0,void 0,{errors:e,warnings:r,isFatal:t,parseError:n}),m=(e,t)=>p([{location:`In module ${t}`,message:`Cannot find source file for module ${e} imported in module ${t}.`}],!0),h=e=>`*** Warnings: ${e.length}\n\n${e.map(e=>`${e.location}\n\n${e.message}\n\n\n`).join(`
|
|
12
|
+
`)}`,g=e=>`line ${e.start.line}, col ${e.start.column} to line ${e.end.line}, col ${e.end.column} of module ${e.module}`,_=(e,t)=>p([{location:g(t),message:e}]);var v=class extends l{constructor(e,t){super(e,t),this.name=`TlaConfigError`}},y=class extends l{constructor(e,t){super(e,t),this.name=`TlaEvaluationError`}};const b=`This was a Java StackOverflowError. It was probably the result
|
|
14
13
|
of an incorrect recursive function definition that caused TLC to enter
|
|
15
14
|
an infinite loop when trying to compute the function or its application
|
|
16
|
-
to an element in its putative domain
|
|
17
|
-
|
|
18
|
-
|
|
19
|
-
`),a={index:t.index,line:i.length,lineStart:t.index-i[i.length-1].length,moduleDepth:0},o={lineStart:-1,position:0,width:0},s=()=>{for((o.lineStart!==a.lineStart||o.position>a.index)&&(o.lineStart=a.lineStart,o.position=a.lineStart,o.width=0);o.position<a.index;o.position++)o.width=ue(o.width,e[o.position]);return ue(o.width,e[a.index])},c=(e,t,r)=>{let i=s();n.push({kind:e,text:t,line:a.line,column:i,endColumn:i+r-1}),a.index+=r},l=t=>{for(let n=0;n<t;n++)e[a.index]===`
|
|
20
|
-
`&&(a.line++,a.lineStart=a.index+1),a.index++},u=t=>new p(`${t} at line ${a.line}, column ${s()}`,void 0,{reason:t,line:a.line,column:s(),isEnd:a.index>=e.length});for(;a.index<e.length;){let t=e[a.index];if(t===`
|
|
15
|
+
to an element in its putative domain.`;var x=class extends y{constructor(){super(b)}},ee=class extends y{state;action;variables;constructor(e,t,n,r){super(e),this.state=t,this.action=n,this.variables=r}},te=class extends y{variable;constructor(e,t){super(e),this.variable=t}},S=class extends y{exitCode;constructor(t,n=e.error){super(t),this.name=`TlaEvaluationError`,this.exitCode=n}},ne=class extends y{state;constructor(e){super(`current state is not a legal state`),this.name=`TlaEvaluationError`,this.state=e}},re=class extends l{failure;exception;constructor(e,t={}){super(e),this.name=`TlaProofError`,this.failure=t.exception===void 0?t.failure??e:void 0,this.exception=t.exception??`Failure(${JSON.stringify(this.failure)})`}},ie=class extends re{constructor(e=`Assert_failure`){super(`Oops, this seems to be a bug in TLAPM.`,{exception:e}),this.name=`TlaProofError`}},C=class extends l{constructor(e,t){super(e,t),this.name=`TlaUnsupportedError`}},ae=class extends C{unwound;constructor(e,t){super(e),this.name=`TlaJavaException`,this.unwound=t}};const oe=t=>r(t)??(t instanceof u?e.specParseError:t instanceof v?e.configParseError:t instanceof y?e.specEvaluationFailure:e.error);var se=class extends l{node;constructor(e,t){super(e),this.name=`PcalError`,this.node=t}},w=class extends l{constructor(e){super(e),this.name=`PcalRuntimeError`}},T=class extends l{constructor(e){super(`You have discovered a bug in pcal.trans.\nSend the following information and the\ninput file to the current maintainer(s).\n\n -- ${e}.`),this.name=`PcalBugError`}};const E=/* @__PURE__ */ new Set(/* @__PURE__ */ `ACTION.ACTIONS.ASSUME.ASSUMPTION.AXIOM.BY.CASE.CHOOSE.CONSTANT.CONSTANTS.COROLLARY.DEF.DEFINE.DEFS.DOMAIN.ELSE.ENABLED.EXCEPT.EXTENDS.HAVE.HIDE.IF.IN.INSTANCE.LAMBDA.LEMMA.LET.LOCAL.MODULE.NEW.OBVIOUS.OMITTED.ONLY.OTHER.PICK.PROOF.PROPOSITION.PROVE.QED.RECURSIVE.STATE.SUBSET.SUFFICES.TAKE.TEMPORAL.TEMPORALS.THEN.THEOREM.UNCHANGED.UNION.USE.VARIABLE.VARIABLES.WITH.WITNESS`.split(`.`)),D=/* @__PURE__ */ new Map([[`in`,`\\in`],[`notin`,`\\notin`],[`subseteq`,`\\subseteq`],[`subset`,`\\subset`],[`supseteq`,`\\supseteq`],[`supset`,`\\supset`],[`cup`,`\\cup`],[`union`,`\\cup`],[`cap`,`\\cap`],[`intersect`,`\\cap`],[`X`,`\\X`],[`times`,`\\X`],[`o`,`\\o`],[`circ`,`\\o`],[`div`,`\\div`],[`land`,`/\\`],[`lor`,`\\/`],[`lnot`,`~`],[`neg`,`~`],[`equiv`,`<=>`],[`leq`,`<=`],[`geq`,`>=`],[`A`,`\\A`],[`forall`,`\\A`],[`E`,`\\E`],[`exists`,`\\E`],[`AA`,`\\AA`],[`EE`,`\\EE`],[`cdot`,`\\cdot`],[`sqsubseteq`,`\\sqsubseteq`],[`sqsupseteq`,`\\sqsupseteq`],[`sqsubset`,`\\sqsubset`],[`sqsupset`,`\\sqsupset`],[`sqcap`,`\\sqcap`],[`sqcup`,`\\sqcup`],[`oplus`,`\\oplus`],[`ominus`,`\\ominus`],[`otimes`,`\\otimes`],[`oslash`,`\\oslash`],[`odot`,`\\odot`],[`uplus`,`\\uplus`],[`prec`,`\\prec`],[`preceq`,`\\preceq`],[`succ`,`\\succ`],[`succeq`,`\\succeq`],[`sim`,`\\sim`],[`simeq`,`\\simeq`],[`approx`,`\\approx`],[`cong`,`\\cong`],[`asymp`,`\\asymp`],[`doteq`,`\\doteq`],[`propto`,`\\propto`],[`wr`,`\\wr`],[`star`,`\\star`],[`bullet`,`\\bullet`],[`bigcirc`,`\\bigcirc`],[`ll`,`\\ll`],[`gg`,`\\gg`]]),ce=/* @__PURE__ */ new Map([[`/=`,`#`],[`=<`,`<=`],[`(+)`,`\\oplus`],[`(-)`,`\\ominus`],[`(.)`,`\\odot`],[`(/)`,`\\oslash`],[`(\\X)`,`\\otimes`]]),le=/* @__PURE__ */ `-+-> (\\X) <=> |-> ... ::= >>_ (+) (-) (.) (/) == => =< =| << <= <> <- >> >= /\\ \\/ /= [] ]_ |- |= || -> -| ~> .. :: := :> <: @@ ++ -- -. ** // ^^ ^+ ^* ^# %% ## && $$ ?? !! = < > / [ ] ( ) { } | - ~ . : @ , ' ! # % + * ^ & $ ?`.split(` `),ue=/* @__PURE__ */ new Map([[`∃`,`\\E`],[`∀`,`\\A`],[`∷`,`::`],[`≜`,`==`],[`⟨`,`<<`],[`⟩_`,`>>_`],[`⟩`,`>>`],[`→`,`->`],[`←`,`<-`],[`↦`,`|->`],[`⁺`,`^+`],[`¬`,`~`],[`□`,`[]`],[`◇`,`<>`],[`∧`,`/\\`],[`∨`,`\\/`],[`∈`,`\\in`],[`≈`,`\\approx`],[`≔`,`:=`],[`≍`,`\\asymp`],[`◯`,`\\bigcirc`],[`⩴`,`::=`],[`●`,`\\bullet`],[`∩`,`\\cap`],[`⋅`,`\\cdot`],[`∘`,`\\o`],[`≅`,`\\cong`],[`∪`,`\\cup`],[`÷`,`\\div`],[`≐`,`\\doteq`],[`‥`,`..`],[`…`,`...`],[`≡`,`<=>`],[`‼`,`!!`],[`≥`,`>=`],[`≫`,`\\gg`],[`⇔`,`<=>`],[`⇒`,`=>`],[`⫤`,`=|`],[`↝`,`~>`],[`≤`,`<=`],[`≪`,`\\ll`],[`⊣`,`-|`],[`≠`,`#`],[`∉`,`\\notin`],[`⊙`,`\\odot`],[`⊖`,`\\ominus`],[`⊕`,`\\oplus`],[`⊘`,`\\oslash`],[`⊗`,`\\otimes`],[`⇸`,`-+->`],[`≺`,`\\prec`],[`⪯`,`\\preceq`],[`∝`,`\\propto`],[`⁇`,`??`],[`⊨`,`|=`],[`⊢`,`|-`],[`∼`,`\\sim`],[`≃`,`\\simeq`],[`⊓`,`\\sqcap`],[`⊔`,`\\sqcup`],[`⊏`,`\\sqsubset`],[`⊑`,`\\sqsubseteq`],[`⊐`,`\\sqsupset`],[`⊒`,`\\sqsupseteq`],[`⋆`,`\\star`],[`⊂`,`\\subset`],[`⊆`,`\\subseteq`],[`≻`,`\\succ`],[`⪰`,`\\succeq`],[`⊃`,`\\supset`],[`⊇`,`\\supseteq`],[`×`,`\\X`],[`⊎`,`\\uplus`],[`‖`,`||`],[`≀`,`\\wr`]]),de=/^\\([bB][01]+|[oO][0-7]+|[hH][0-9a-fA-F]+)/,fe=/* @__PURE__ */ new Map([[`b`,2],[`o`,8],[`h`,16]]),pe=e=>e.startsWith(`\\`)?parseInt(e.slice(2),fe.get(e[1].toLowerCase())):Number(e),me=/-{4,}[ \t]*MODULE\b/,he=e=>/[A-Za-z0-9_]/.test(e),O=(e,t)=>{let n=e[t];if(n===`\\`&&/[A-Za-z]/.test(e[t+1]??``)){let n=/^[A-Za-z]+/.exec(e.slice(t+1))?.[0]??``,r={value:n.length};for(;r.value>0&&!D.has(n.slice(0,r.value));)r.value--;let i=D.get(n.slice(0,r.value));return{text:i??`\\`,length:i===void 0?1:r.value+1}}let r=[e.slice(t,t+2),n].find(e=>ue.has(e));if(r!==void 0)return{text:ue.get(r)??``,length:r.length};let i=le.find(n=>e.startsWith(n,t));return i?{text:ce.get(i)??i,length:i.length}:n===`\\`?{text:`\\`,length:1}:void 0},ge=e=>e!==void 0&&e>=`0`&&e<=`9`,_e=(e,t,n)=>{let r={value:t};for(;r.value<e.length&&n(e[r.value]);)r.value++;return r.value},ve=(e,t)=>{if(e[t]!==`<`)return 0;let n=e[t+1]===`+`||e[t+1]===`*`?t+2:_e(e,t+1,ge);if(n===t+1||e[n]!==`>`)return 0;let r=_e(e,n+1,he),i=r===n+1&&(e[r]===`*`||e[r]===`-`);return _e(e,i?r+1:r,e=>e===`.`)-t},ye=e=>e.kind===`Operator`&&e.text===`@`?{...e,kind:`Identifier`}:e,be=(e,t)=>t===` `?e+8-e%8:e+1,xe=e=>{let t=me.exec(e);if(!t)throw new u(`Expected a module header such as ---- MODULE Name ----`);let n=[],r=/* @__PURE__ */ new Map,i=e.slice(0,t.index).split(`
|
|
16
|
+
`),a={index:t.index,line:i.length,lineStart:t.index-i[i.length-1].length,moduleDepth:0},o={lineStart:-1,position:0,width:0},s=()=>{for((o.lineStart!==a.lineStart||o.position>a.index)&&(o.lineStart=a.lineStart,o.position=a.lineStart,o.width=0);o.position<a.index;o.position++)o.width=be(o.width,e[o.position]);return be(o.width,e[a.index])},c=(e,t,r,i)=>{let o=s();n.push({kind:e,text:t,spelling:i,line:a.line,column:o,endColumn:o+r-1}),a.index+=r},l=t=>{for(let n=0;n<t;n++)e[a.index]===`
|
|
17
|
+
`&&(a.line++,a.lineStart=a.index+1),a.index++},d=t=>new u(`${t} at line ${a.line}, column ${s()}`,void 0,{reason:t,line:a.line,column:s(),isEnd:a.index>=e.length});for(;a.index<e.length;){let t=e[a.index];if(t===`
|
|
21
18
|
`||t===` `||t===` `||t===`\r`){l(1);continue}if(e.startsWith(`\\*`,a.index)){let t=e.indexOf(`
|
|
22
|
-
`,a.index);l((t===-1?e.length:t)-a.index);continue}if(e.startsWith(`(*`,a.index)){let t={value:0};do{if(a.index>=e.length)throw
|
|
23
|
-
|
|
24
|
-
`,t:` `,r:`\r`,f:`\f`}[t]??t),l(2)}else i.push(e[a.index]),l(1)}l(1),n.push({kind:`String`,text:i.join(``),line:t,column:r,endColumn:s()-1});continue}let i=
|
|
25
|
-
|
|
26
|
-
|
|
27
|
-
`);
|
|
28
|
-
|
|
29
|
-
`)
|
|
30
|
-
`,e.slice(0,t))}n.push({kind:`String`,text:t[1],line:r.line}),r.index+=t[0].length;continue}let l=pe.find(t=>e.startsWith(t));if(l){n.push({kind:`Symbol`,text:l,line:r.line}),r.index+=l.length;continue}let u=ce(t,r.index);if(!u)throw ve(r.line,r.index-r.lineStart+1,e[0]);n.push({kind:`Word`,text:u.text,line:r.line}),r.index+=u.length}return n.push({kind:`End`,text:``,line:r.line-1}),n},be=e=>{let t=ye(e),n={index:0},r={init:void 0,next:void 0,specification:void 0,invariants:[],properties:[],constraints:[],actionConstraints:[],constants:[],substitutions:[],checkDeadlock:!0,symmetry:void 0,view:void 0,alias:void 0,postconditions:[],possible:[],periodic:void 0,rlReward:void 0},i={isSet:!1},a=()=>t[Math.min(n.index++,t.length-1)],o=e=>e.kind===`Word`&&fe.has(e.text),s=e=>{if(e.kind===`Number`)return{kind:`Number`,value:Number(e.text)};if(e.kind===`String`)return{kind:`String`,value:e.text};if(e.text===`TRUE`||e.text===`FALSE`)return{kind:`Boolean`,value:e.text===`TRUE`};if(e.text===`{`){let e=[],t=a();if(t.text!==`}`)for(;e.push(s(t)),t=a(),t.text===`,`;)t=a();if(t.text!==`}`)throw M(t.line,`It was expecting }, but did not find it.`);return{kind:`Set`,elements:e}}if(e.kind!==`End`)return{kind:`ModelValue`,name:e.text};throw M(e.line,`It was expecting a value, but did not find it.`)},c=e=>{let t=a();if(t.kind===`End`)throw M(t.line,`Expected an identifier after ${e}[.`);let n=a();if(n.text!==`]`)throw M(n.line,`It was expecting ], but did not find it.`);return t.text},l=e=>{for(;;){let t=a();if(t.kind===`End`||o(t))return t;let n={text:t.text},i=a();for(;i.text===`!`;)n.text=`${n.text}!${a().text}`,i=a();if(i.text===`<-`){if(i=a(),i.text===`[`){let e=c(`<-`),t=a();if(t.kind===`End`)throw M(t.line,`Expected an identifier after <-[mod].`);r.substitutions.push({name:n.text,target:t.text,module:e});continue}if(i.kind===`End`)throw M(i.line,`Expected an identifier after <-.`);r.substitutions.push({name:n.text,target:i.text});continue}let l=[];if(i.text===`(`){for(;l.push(s(a())),i=a(),i.text===`,`;);if(i.text!==`)`)throw M(e,``);i=a()}if(i.text!==`=`)throw M(i.line,`It was expecting = or <-, but did not find it.`);i=a();let u=i.text===`[`?c(`=`):void 0,d=s(u===void 0?i:a());r.constants.push({name:n.text,value:d,...l.length>0&&{args:l},...u&&{module:u}})}},u=a();for(;u.kind!==`End`;){let e=u.text,t=u.line;if(he(e)){let n=a();if(n.kind===`End`)throw M(t,`The keyword ${e} was not followed by an identifier.`);let i=me[e];if(r[i]!==void 0)throw M(t,`The keyword ${e} appeared twice.`);r[i]=n.text,u=a()}else if(ge(e)){let t=r[j[e]];for(u=a();u.kind!==`End`&&!o(u);)t.push(u.text),u=a()}else if(e===`CONSTANT`||e===`CONSTANTS`)u=l(t);else if(e===`CHECK_DEADLOCK`){let e=a();if(e.kind===`End`)throw M(t,`The keyword CHECK_DEADLOCK was not followed by an identifier.`);if(e.text!==`TRUE`&&e.text!==`FALSE`)throw M(e.line,`It was expecting TRUE or FALSE, but did not find it.`);if(i.isSet)throw M(t,`The keyword CHECK_DEADLOCK appeared twice.`);i.isSet=!0,r.checkDeadlock=e.text===`TRUE`,u=a()}else throw M(t,`It was expecting a keyword, but did not find it.`)}if(r.specification!==void 0&&(r.init!==void 0||r.next!==void 0))throw new _(`The configuration file cannot specify both INIT/NEXT and SPECIFICATION fields.`);return r},xe={Set:{open:`{ `,close:` }`,pad:` `,separator:`,`,divider:``,dividerPad:``},Sequence:{open:`<< `,close:` >>`,pad:` `,separator:`,`,divider:``,dividerPad:``},Subset:{open:`SUBSET `,close:` `,pad:` `,separator:`,`,divider:``,dividerPad:``},Function:{open:`( `,close:` )`,pad:` `,separator:` @@`,divider:` :>`,dividerPad:` `},Record:{open:`[ `,close:` ]`,pad:` `,separator:`,`,divider:` |->`,dividerPad:` `}},Se=e=>{if(e===void 0)return!1;let t=e.charCodeAt(0);return t>=9&&t<=13||t>=28&&t<=32||t===5760||t>=8192&&t<=8202&&t!==8199||t===8232||t===8233||t===8287||t===12288},Ce=e=>e!==void 0&&/^\p{Nd}$/u.test(e),we=e=>e!==void 0&&/^[\p{L}\p{Nd}]$/u.test(e),Te=e=>{let t=t=>{let n=A(e,t,Se);return e[n]===void 0?void 0:n},n=(n,r,i,a,o,s)=>{let c={kind:n,first:r,last:r,children:[]},l={index:t(i)};for(;l.index!==void 0&&e[l.index]!==a;){let n=o(l.index);if(!n)return;c.children.push(n);let r=t(n.last+1);if(r===void 0)return;let i=e.startsWith(s,r)?r+s.length:r;l.index=t(i)}if(l.index!==void 0)return c.last=l.index,c},r=(n,r)=>{let i=o(n);if(!i)return;let a=t(i.last+1);if(a===void 0||!e.startsWith(r,a))return;let s=t(a+r.length),c=s===void 0?void 0:o(s);if(c)return{kind:`Pair`,first:n,last:c.last,children:[i,c]}},i=t=>{let n=A(e,t,Ce);if(e.startsWith(`..`,n)&&Ce(e[n+2]))return{kind:`Constant`,first:t,last:A(e,n+2,Ce)-1,children:[]}},a=t=>{let n=e[t];if(n===`"`){let n=e.indexOf(`"`,t+1);return n===-1?void 0:{kind:`Constant`,first:t,last:n,children:[]}}let r=Ce(n)?i(t):void 0;if(r)return r;if(n===`-`)return t+1>=e.length?void 0:{kind:`Constant`,first:t,last:A(e,t+1,Ce)-1,children:[]};if(we(n))return{kind:`Constant`,first:t,last:A(e,t,we)-1,children:[]}},o=i=>{let s=t(i);if(s!==void 0)switch(e[s]){case`{`:return n(`Set`,s,s+1,`}`,o,`,`);case`<`:{let t=n(`Sequence`,s,s+2,`>`,o,`,`);return!t||t.last+1>=e.length?void 0:{...t,last:t.last+1}}case`[`:return n(`Record`,s,s+1,`]`,e=>r(e,`|->`),`,`);case`(`:return n(`Function`,s,s+1,`)`,e=>r(e,`:>`),`@@`);default:{if(!e.startsWith(`SUBSET`,s))return a(s);let n=t(s+6),r=n===void 0?void 0:o(n);return r?{kind:`Subset`,first:s,last:r.last,children:[r]}:void 0}}};return o(0)},Ee=e=>{let t=e.length===0?void 0:Te(e);if(!t||t.last<e.length-1)return e;let n=t=>e.slice(t.first,t.last+1),r=e=>e.last-e.first+1,i=(e,t,i,s)=>{if(r(e)<=t-i||e.kind===`Constant`)return n(e);if(e.kind===`Pair`)return;let c=xe[e.kind],l=t-Math.max(c.open.length,c.pad.length),u=i+c.close.length,d=s+c.pad,f=e.kind===`Function`||e.kind===`Record`?o(e.children,l,u,d,c):a(e.children,l,u,d,c.separator);return f===void 0?void 0:c.open+f+c.close},a=(e,t,n,r,a)=>{let o=e.map((o,s)=>{let c=s===e.length-1,l=i(o,t,c?n:a.length,r);return l===void 0||c?l:`${l}${a}\n${r}`});return o.includes(void 0)?void 0:o.join(``)},o=(e,t,a,o,s)=>{let c=e.map((c,l)=>{let u=l===e.length-1,d=c.children[0],f=c.children[1],p=u?``:`${s.separator}\n${o}`,m=r(d)+s.divider.length+1+r(f);if(u?m<=t-a:m+s.separator.length<=t)return`${n(d)}${s.divider} ${n(f)}${p}`;let h=r(d)+s.divider.length<=t?n(d):i(d,t,a+s.divider.length,o),g=i(f,t-s.dividerPad.length,u?a:s.separator.length,o+s.dividerPad);return h===void 0||g===void 0?void 0:`${h}${s.divider}\n${o}${s.dividerPad}${g}${p}`});return c.includes(void 0)?void 0:c.join(``)};return i(t,80,0,``)??e},N={current:void 0},De=/* @__PURE__ */ new WeakMap,Oe=e=>e instanceof v?De.get(e):void 0,ke=(e,t)=>{let n=N.current;if(!n||typeof e!=`object`)return t();try{return t()}catch(t){let r=n.get(e);throw r&&t instanceof v&&De.set(t,[r,...De.get(t)??[]]),t}},P=e=>typeof e==`object`&&e.kind!==`ModelValue`&&e.kind!==`Function`&&e.kind!==`LazyFunction`,Ae=e=>typeof e==`object`&&(e.kind===`Set`||e.kind===`MixedSet`||e.kind===`Interval`),F=e=>typeof e==`object`&&(e.kind===`Function`||e.kind===`LazyFunction`),I=e=>typeof e==`object`&&e.kind===`ModelValue`,je=e=>typeof e==`boolean`?`boolean`:typeof e==`number`?`integer`:typeof e==`string`?`string`:e.kind===`ModelValue`?`model value`:P(e)?`set`:`function`,Me=e=>{if(!Number.isInteger(e)||e>2147483647||e<-2147483648)throw new y(`Integer overflow: ${e} is outside TLC's 32-bit range`);return e},Ne={isUsed:!1},Pe=(e,t)=>(Ne.isUsed=!0,e.writtenKeys=t,e),Fe=e=>(e.writtenKeys??e.domain).map(t=>[t,e.range[hn(e.domain,t)]]),Ie=(e,t,n)=>Pe(tt(e,t),n),Le=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(Le);e.writtenKeys=void 0,e.range.forEach(Le)}},Re=e=>e.every(e=>typeof e==`string`),ze=(e,t)=>e.length>0&&t.length>0&&Re(e)!==Re(t),L=(e,t)=>{Ne.isUsed&&(e.writtenKeys=void 0,t.writtenKeys=void 0);let n=e.domain,r=t.domain;if(n.length!==r.length)return ze(n,r)?xt(e,t):n.length-r.length;if(n!==r)for(let e=0;e<n.length;e++){let t=B(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=B(i[e],a[e]);if(t!==0)return t}return 0},Be=(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=B(n[e],r[e]);if(t!==0)return t}return 0},Ve=e=>I(e)?e.type:void 0,He=(e,t,n)=>{let r=Ve(e),i=Ve(t);if(r===void 0&&i===void 0)return;let a=n?`check equality of`:`compare`;if(I(e)&&I(t)){if(r===void 0||i===void 0||r===i)return;throw new v(`Attempted to ${a} the differently-typed model values ${G(e)} and ${G(t)}`)}throw r===void 0?new v(`Attempted to ${a} the typed model value ${G(t)} and the non-model value\n${G(e)}`):new v(`Attempted to ${a}${n?``:` the`} typed model value ${G(e)} and non-model value\n${G(t)}`)},Ue={ranks:Object.create(null),size:0},We=e=>{Ue.ranks=Object.create(null),Ue.size=0,Qe.clear();for(let t of e)R(t)},R=e=>(Ue.ranks[e]===void 0&&(Ue.ranks[e]=Ue.size++),e),Ge=()=>Ue.size,Ke=e=>Ue.ranks[R(e)],qe=(e,t)=>{if(e===t)return 0;let n=Ue.ranks,r=n[e],i=n[t];return r!==void 0&&i!==void 0?r-i:r===void 0?i===void 0&&e<t?-1:1:-1},z=e=>typeof e==`object`&&(e.kind===`InfiniteSet`||e.kind===`SequenceSet`),Je=(e,t)=>(z(e)||z(t))&&(typeof e!=`object`||e.kind!==`SequenceSet`||typeof t!=`object`||t.kind!==`SequenceSet`),Ye=(e,t,n)=>{if(!z(e))throw new v(`Attempted to ${n} the set ${G(V(e)?H(e):e,!0)} with the value:\n${G(t,!0)}`);if(!z(t))throw new v(`Attempted to compare overridden value ${G(e,!0)} with non-overridden value:\n${G(t,!0)}`);let r=e.kind===`InfiniteSet`?e.name:void 0,i=t.kind===`InfiniteSet`?t.name:void 0;if(r!==void 0&&r===i)return 0;if(r===`Nat`&&i===`Int`||r===`Int`&&i===`Nat`)return r===`Nat`?-1:1;throw new v(`Attempted to compare ${G(e,!0)} with the value\n${G(t,!0)}`)},Xe={kind:`InfiniteSet`,name:`Any`},Ze=e=>{throw new v(`Attempted to compare ANY with the value\n${G(e)}`)},B=(e,t)=>{if(e===t)return Ne.isUsed&&Le(e),e===Xe?Ze(e):0;if(typeof e==`object`&&typeof t==`object`){let n=e.kind,r=t.kind;if(n===`Function`&&r===`Function`)return L(e,t);if(n===`Set`&&r===`Set`)return Be(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&&He(e,t,!1),e.rank-t.rank;if(n===`ModelValue`||r===`ModelValue`)return He(e,t,!1),n===`ModelValue`?-1:1;if(e===Xe||t===Xe)return Ze(e===Xe?t:e);if(P(e)&&P(t)&&Je(e,t))return Ye(e,t,`compare`);let i=P(e);if(i!==P(t))throw new v(`Attempted to compare ${je(e)} ${G(e)} with ${je(t)} ${G(t)}`);return i?Be(H(e),cn(t)):L(W(e),W(t))}if(typeof e==`number`&&typeof t==`number`)return e-t;if(typeof e==`string`&&typeof t==`string`)return qe(e,t);if(typeof e==`boolean`&&typeof t==`boolean`)return e<t?-1:1;if(He(e,t,!1),I(e))return-1;if(I(t))return 1;throw new v(`Attempted to compare ${je(e)} ${G(e)} with ${je(t)} ${G(t)}`)},Qe=/* @__PURE__ */ new Map,$e=e=>{let t=Qe.get(e);if(t)return t;let n={kind:`ModelValue`,name:e,type:e.length>2&&e[1]===`_`?e[0]:void 0,rank:Ke(e)};return Qe.set(e,n),n},et=e=>({kind:`Set`,elements:e,hash:0,fingerprint:0}),tt=(e,t)=>({kind:`Function`,domain:e,range:t,hash:0,fingerprint:0,writtenKeys:void 0}),nt=(e,t)=>{if(e===t)return Ne.isUsed&&Le(e),e!==Xe||Ze(e);if(typeof e!=`object`||typeof t!=`object`)return typeof e!=typeof t&&((typeof e==`object`||typeof t==`object`)&&He(e,t,!0),B(e,t)===0);if((e.kind===`Set`||e.kind===`Function`)&&(t.kind===`Set`||t.kind===`Function`)&&e.hash!==0&&t.hash!==0&&e.hash!==t.hash)return!1;if(e.kind===`Function`&&t.kind===`Function`)return L(e,t)===0;if(e.kind===`Set`&&t.kind===`Set`)return Be(e,t)===0;if(I(e)||I(t))return He(e,t,!0),I(e)&&I(t)&&e.name===t.name;if(e.kind===`Subset`&&t.kind===`Subset`)return nt(e.base,t.base);if(e.kind===`FunctionSet`&&t.kind===`FunctionSet`){let n=U(e.domain),r=U(t.domain);if(n||r)return n===r;let i=U(e.range),a=U(t.range);return i||a?i===a:nt(e.domain,t.domain)&&nt(e.range,t.range)}if(e.kind===`RecordSet`&&t.kind===`RecordSet`){if(U(e))return U(t);if(U(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]&&nt(e[1],r[t][1]))}if(e.kind===`ProductSet`&&t.kind===`ProductSet`)return U(e)?U(t):!U(t)&&e.factors.length===t.factors.length&&e.factors.every((e,n)=>nt(e,t.factors[n]));let n=P(e)&&P(t)&&!(V(e)&&V(t));if(n&&Je(e,t))return Ye(e,t,`check equality of`)===0;if(n){if(!z(e)){let n=H(e);if(!z(t))return Be(n,H(t))===0}return Qn(e)===Qn(t)}return B(e,t)===0},rt=(e,t)=>e===t||e.length===t.length&&e.every((e,n)=>it(e,t[n])),it=(e,t)=>e===t?!0:typeof e!=`object`||typeof t!=`object`?!1:e.kind===`Set`&&t.kind===`Set`?(e.hash===0||t.hash===0||e.hash===t.hash)&&rt(e.elements,t.elements):e.kind===`Function`&&t.kind===`Function`?(e.hash===0||t.hash===0||e.hash===t.hash)&&rt(e.domain,t.domain)&&rt(e.range,t.range):Qn(e)===Qn(t),at=e=>{let t=e.length===0?1:e[0];return typeof t==`number`&&e.every((e,n)=>e===t+n)?t:void 0},ot=e=>{if(!F(e))return;let t=W(e);return{domain:t.domain,range:t.range,low:at(t.domain)}},st=e=>{if(!F(e))return;let t=W(e);return t.domain.every(e=>typeof e==`string`)?t:void 0},ct=(e,t)=>{if(Ve(e)!==void 0)throw new v(`Attempted to compare the typed model value ${G(e)} and the non-model value\n${G(t)}`);return 1},lt=(e,t)=>{if(Ve(e)!==void 0)throw new v(`Attempted to check equality of the typed model value ${G(e)} and the non-model value\n${G(t)}`);return!1},ut=(e,t)=>{let n=Ve(e);if(n===void 0)return I(t)?e.rank-t.rank:-1;if(!I(t))throw new v(`Attempted to compare the typed model value ${G(e)} and non-model value\n${G(t)}`);let r=Ve(t);if(r!==void 0&&r!==n)throw new v(`Attempted to compare the differently-typed model values ${G(e)} and ${G(t)}`);return e.rank-t.rank},dt=(e,t)=>{let n=Ve(e);if(n===void 0)return I(t)&&e.name===t.name;if(!I(t))throw new v(`Attempted to check equality of typed model value ${G(e)} and non-model value\n${G(t)}`);let r=Ve(t);if(r!==void 0&&r!==n)throw new v(`Attempted to check equality of the differently-typed model values ${G(e)} and ${G(t)}`);return e.name===t.name},ft={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`}},pt=(e,t,n)=>{let r=ft[typeof e==`number`?`number`:typeof e==`string`?`string`:`boolean`];return`Attempted to ${n?r.equality:`compare`} ${r.name} ${G(e)} with ${r.other}:\n${G(t)}`},mt=(e,t,n)=>{let r=ot(n);if(!r){if(I(n))return ct(n,t);throw new v(`Attempted to compare the function ${G(t)} with the value:\n${G(n)}`)}if(e.range.length!==r.range.length)return e.range.length-r.range.length;let i=()=>ht(e.range,r.range);if(e.low!==void 0&&e.range.length===0)return 0;if(e.low!==void 0&&r.low!==void 0)return e.low===r.low?i():e.low-r.low;let a=e.low??r.low;if(a===void 0)return ht(e.domain,r.domain)||i();let o=e.low===void 0?e.domain:r.domain;for(let t=0;t<o.length;t++){let n=o[t];if(typeof n!=`number`)throw new v(`Attempted to compare integer with non-integer${e.low===void 0?``:`:`}\n${G(n)}.`);let r=e.low===void 0?n-(a+t):a+t-n;if(r!==0)return r}return i()},ht=(e,t)=>{for(let n=0;n<e.length;n++){let r=xt(e[n],t[n]);if(r!==0)return r}return 0},gt=(e,t)=>{let n=W(e);if(e.kind===`Function`&&gn(n)!==void 0){let r=F(t)?gn(t):void 0;return r?n.range.length-r.length||ht(n.range,r):mt({...n,low:1},e,t)}if(e.kind===`Function`&&n.domain.every(e=>typeof e==`string`)){let r=st(t);if(!r){if(I(t))return ct(t,e);throw new v(`Attempted to compare record:\n${G(e)}\nwith non-record\n${G(t)}`)}return n.domain.length-r.domain.length||ht(n.domain,r.domain)||ht(n.range,r.range)}return mt({...n,low:at(n.domain)},e,t)},_t=e=>typeof e==`object`&&(e.kind===`Set`||e.kind===`MixedSet`),vt=(e,t)=>z(e)||z(t)||typeof t==`object`&&e.kind===t.kind&&(e.kind===`Interval`||e.kind===`Subset`||e.kind===`FunctionSet`||e.kind===`RecordSet`||e.kind===`ProductSet`),yt=(e,t)=>{let n=_t(t)?t:H(t);return{elements:H(e).elements,otherElements:H(n).elements}},bt=(e,t)=>{if(vt(e,t))return B(e,t);if(!_t(e))return bt(H(e),t);if(!P(t)){if(I(t))return ct(t,e);throw new v(`Attempted to compare the set ${G(e)} with the value:\n${G(t)}`)}let n=yt(e,t);return n.elements.length-n.otherElements.length||ht(n.elements,n.otherElements)},xt=(e,t)=>ke(e,()=>{if(typeof e!=`object`){if(typeof t==typeof e)return B(e,t);if(I(t))return ct(t,e);throw new v(pt(e,t,!1))}return e.kind===`ModelValue`?ut(e,t):F(e)?gt(e,t):bt(e,t)}),St=(e,t)=>e.every((e,n)=>Et(e,t[n])),Ct=(e,t,n)=>{let r=ot(n);if(!r){if(I(n))return lt(n,t);throw new v(`Attempted to check equality of the function ${G(t)} with the value:\n${G(n)}`)}if(e.range.length!==r.range.length)return!1;if(e.low!==void 0&&r.low!==void 0)return(e.range.length===0||e.low===r.low)&&St(e.range,r.range);let i=e.low??r.low;return i===void 0?St(e.domain,r.domain)&&St(e.range,r.range):(e.low===void 0?e.domain:r.domain).every((e,t)=>{if(typeof e!=`number`)throw new v(`Attempted to compare an integer with non-integer:\n${G(e)}.`);return e===i+t})&&St(e.range,r.range)},wt=(e,t)=>{let n=W(e);if(e.kind===`Function`&&gn(n)!==void 0){let r=F(t)?gn(t):void 0;return r?n.range.length===r.length&&St(n.range,r):Ct({...n,low:1},e,t)}if(e.kind===`Function`&&n.domain.every(e=>typeof e==`string`)){let r=st(t);if(!r){if(I(t))return lt(t,e);throw new v(`Attempted to check equality of record:\n${G(e)}\nwith non-record\n${G(t)}`)}return n.domain.length===r.domain.length&&St(n.domain,r.domain)&&St(n.range,r.range)}return Ct({...n,low:at(n.domain)},e,t)},Tt=(e,t)=>{if(vt(e,t))return nt(e,t);if(!_t(e))return Tt(H(e),t);if(!P(t)){if(I(t))return lt(t,e);throw new v(`Attempted to check equality of the set ${G(e)} with the value:\n${G(t)}`)}let n=yt(e,t);return n.elements.length===n.otherElements.length&&St(n.elements,n.otherElements)},Et=(e,t)=>ke(e,()=>{if(typeof e!=`object`){if(typeof t==typeof e)return e===t;if(I(t))return lt(t,e);throw new v(pt(e,t,!0))}return e.kind===`ModelValue`?dt(e,t):F(e)?wt(e,t):Tt(e,t)}),Dt=e=>{let t=[];for(let n of e){let e={low:0,high:t.length,comparison:1};for(;e.low<e.high;){let r=e.low+(e.high-e.low>>1);if(e.comparison=xt(n,t[r]),e.comparison===0)break;e.comparison<0?e.high=r:e.low=r+1}e.comparison!==0&&t.splice(e.low,0,n)}return t},Ot=(e,t)=>t.some(t=>Et(t,e)),kt=(e,t)=>{try{return nt(e,t)}catch(n){if(!(n instanceof v))throw n;return Et(e,t)}},At=e=>{for(let t=1;t<e.length;t++)if(B(e[t],e[t-1])<=0)return!1;return!0},jt=e=>{if(e.length<2||At(e))return et(e);let t=[...e].sort(B),n=[t[0]];for(let e=1;e<t.length;e++)B(n[n.length-1],t[e])!==0&&n.push(t[e]);return et(n)},Mt=e=>{try{return jt(e)}catch(t){if(!(t instanceof v))throw t;return{kind:`MixedSet`,elements:e}}},Nt=et([]),Pt=(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&&B(r[a],t)<0;)a++;a<r.length&&B(r[a],t)===0||i.push(t)}return i.length===n.length?e:et(i)},Ft=(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&&B(r[a],t)<0;)a++;a<r.length&&B(r[a],t)===0&&i.push(t)}return i.length===n.length?e:et(i)},It=(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=B(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=et(i);if(e.hash!==0){let t=e.hash;for(let e=0;e<a.length;e++)t=t+Bn(a[e])|0;c.hash=t}if(e.fingerprint!==0){let t=e.fingerprint;for(let e=0;e<a.length;e++)t=t+qn(a[e])|0;c.fingerprint=t}return c},Lt=e=>{let t=e.length<2?e:[...e].sort((e,t)=>B(e[0],t[0])),n=[],r=[];for(let e of t)n.length>0&&B(n[n.length-1],e[0])===0||(n.push(e[0]),r.push(e[1]));return tt(n,r)},Rt=e=>{let t=Lt(e);return t.domain.length!==e.length||e.some(e=>typeof e[0]!=`string`)||e.every((e,n)=>e[0]===t.domain[n])?t:Pe(t,e.map(e=>e[0]))},zt=[],Bt=[],Vt=/* @__PURE__ */ new WeakMap,Ht=e=>{let t=zt[e];if(t)return t;let n=Array.from({length:e},(e,t)=>t+1);return zt[e]=n,n},Ut=e=>{if(fn(e),e.low===1&&e.high>=1)return Ht(e.high);let t=[];for(let n=e.low;n<=e.high;n++)t.push(n);return t},Wt=e=>e.length>0&&(e===zt[e.length]||Vt.has(e)),Gt=e=>{let t=H(e).elements;return Wt(t)&&(typeof e!=`object`||e.kind!==`Interval`)?[...t]:t},Kt=e=>{let t=Bt[e];if(t)return t;let n={kind:`Interval`,low:1,high:e};return Bt[e]=n,n},qt=e=>tt(Ht(e.length),e),Jt=e=>Lt(e),Yt=e=>P(e)&&!z(e),Xt=(e,t=!1)=>`UNION(${G(e.base,t)})`,Zt=(e,t=e=>H(e).elements)=>{if(!Yt(e.base))throw new v(`Attempted to enumerate the nonenumerable set:\n${Xt(e)}`);return t(e.base)},Qt=(e,t,n)=>{if(Yt(e))return e;throw new v(t===0?`Attempted to enumerate UNION(s), but some element of s is nonenumerable.`:`Attempted to enumerate the nonenumerable set:\n${G(e)}\nwhen enumerating:\n${Xt(n)}`)},V=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 V(e.base);case`FunctionSet`:return V(e.domain)&&V(e.range)||$t(e.domain)===!0||$t(e)===!0;case`RecordSet`:return e.sets.every(V)||$t(e)===!0;case`ProductSet`:return e.factors.every(V)||$t(e)===!0;case`Union`:return V(e.base)&&ln(e.base).every(V);case`SetOperation`:return e.operator===`\\cup`?V(e.left)&&V(e.right):e.operator===`\\cap`?V(e.left)||V(e.right):V(e.left);default:return!1}},$t=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=$t(e.domain);return t===void 0?void 0:!t&&$t(e.range)}case`RecordSet`:case`ProductSet`:for(let t of e.kind===`RecordSet`?e.sets:e.factors){let e=$t(t);if(e!==!1)return e}return!1;case`SetOperation`:case`FilteredSet`:case`Union`:return V(e)?H(e).elements.length===0:void 0;default:return}},en=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},tn=(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},nn=e=>{let t=[];for(let n=0;n<=e.length;n++){let r=Array.from({length:n},(e,t)=>t);do t.push(et(r.map(t=>e[t])));while(tn(r,e.length))}return t},rn=e=>{if(typeof e!=`object`)throw new v(`Expected a set but found ${G(e)}`);switch(e.kind){case`Set`:return e.elements;case`MixedSet`:return Dt(e.elements);case`Interval`:{let t=Ut(e);return t!==zt[t.length]&&Vt.set(t,e),t}case`Subset`:{z(e.base)&&fn(e.base);let t=H(e.base).elements;if(t.length>30)throw new v(dn(e));return nn(t)}case`FunctionSet`:{if(U(e))return[];if(z(e.domain))throw new v(`Attempted to enumerate a set of the form [D -> R],but the domain D:\n${G(e.domain)}\ncannot be enumerated.`);let t=Gt(e.domain);if(t.length>0&&z(e.range))throw new v(`Attempted to enumerate a set of the form [D -> R],but the range R:\n${G(e.range)}\ncannot be enumerated.`);let n=t.length===0?[]:H(e.range).elements;return en(t.map(()=>n)).map(e=>tt(t,e))}case`RecordSet`:{if(U(e))return[];let t=e.sets.map((t,n)=>{if(z(t))throw new v(`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${G(t)}`);return H(t).elements});return en(t).map(t=>Jt(e.names.map((e,n)=>[e,t[n]])))}case`ProductSet`:{if(U(e))return[];let t=e.factors.map((e,t)=>{if(z(e))throw new v(`Attempted to enumerate a set of the form s1 \\X s2 ... \\X sn,\nbut can't enumerate s${t}:\n${G(e)}`);return H(e).elements});return en(t).map(qt)}case`FilteredSet`:if(z(e.base))throw new v(`Attempted to enumerate { x \\in S : p(x) } when S:\n${G(e.base)}\nis not enumerable`);return H(e.base).elements.filter(e.test);case`Union`:{let t=Zt(e).flatMap((t,n)=>H(Qt(t,n,e)).elements);return H(Mt(t)).elements}case`SetOperation`:{if(e.operator===`\\cup`&&(z(e.left)||z(e.right)))throw new v(`Attempted to enumerate S \\cup T when S:\n${G(e.left)}\nand T:\n${G(e.right)}\nare not both enumerable`);if(e.operator===`\\cap`&&z(e.left)&&z(e.right))throw new v(`Attempted to enumerate S \\cap T when neither S:\n${G(e.left)}\nnor T:\n${G(e.right)}\nis enumerable`);if(e.operator===`\\`&&z(e.left))throw new v(`Attempted to enumerate S \\ T when S:\n${G(e.left)}\nis not enumerable.`);if(e.operator===`\\cup`)return It(H(e.left),H(e.right)).elements;let t=e.operator===`\\`||V(e.left),n=t?e.left:e.right,r=t?e.right:e.left;return H(n).elements.filter(t=>bn(t,r)===(e.operator===`\\cap`))}case`InfiniteSet`:case`SequenceSet`:throw new v(`Attempted to enumerate the non-enumerable set ${G(e)}`);default:throw new v(`Expected a set but found ${G(e)}`)}},an=/* @__PURE__ */ new WeakMap,on=/* @__PURE__ */ new WeakMap,H=e=>{if(typeof e==`object`&&e.kind===`Set`)return e;if(typeof e==`object`&&e.kind===`Interval`)return et(rn(e));let t=typeof e==`object`?an.get(e):void 0;if(t)return t;let n=(typeof e==`object`?on.get(e):void 0)??(N.current?ke(e,()=>sn(e)):sn(e));return typeof e==`object`&&an.set(e,n),n},sn=e=>{let t=rn(e);return typeof e==`object`&&(e.kind===`MixedSet`||e.kind===`Union`||e.kind===`SetOperation`||e.kind===`FilteredSet`||e.kind===`ProductSet`||e.kind===`FunctionSet`||e.kind===`Subset`)?et(t):jt(t)},cn=e=>{if(typeof e!=`object`||e.kind!==`Union`&&e.kind!==`SetOperation`&&e.kind!==`FilteredSet`||an.has(e))return H(e);let t=on.get(e);if(t)return t;let n=sn(e);return on.set(e,n),n},ln=e=>{if(typeof e!=`object`||an.has(e))return H(e).elements;if(e.kind===`Union`)return Zt(e,ln).flatMap((t,n)=>ln(Qt(t,n,e)));if(e.kind===`FilteredSet`&&!z(e.base))return ln(e.base).filter(e.test);if(e.kind!==`SetOperation`)return H(e).elements;if(e.operator===`\\cup`)return z(e.left)||z(e.right)?H(e).elements:[...ln(e.left),...ln(e.right)];let t=e.operator===`\\`||V(e.left),n=t?e.left:e.right,r=t?e.right:e.left;return z(n)?H(e).elements:ln(n).filter(t=>bn(t,r)===(e.operator===`\\cap`))},U=e=>{if(typeof e!=`object`||!P(e))throw new v(`Shouldn't call isEmpty() on value ${G(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 v(`Shouldn't call isEmpty() on value ANY`);return!1;case`Subset`:case`SequenceSet`:return!1;case`ProductSet`:return e.factors.some(U);case`RecordSet`:return e.sets.some(U);case`FunctionSet`:return!U(e.domain)&&U(e.range);case`Union`:return Zt(e).every((t,n)=>U(Qt(t,n,e)));default:return H(e).elements.length===0}},un=(e,t)=>e.reduce((e,n)=>{let r=e*fn(n);if(r>2147483647)throw new v(t());return r},1),dn=e=>`Overflow when computing the number of elements in:\n${G(e)}`,fn=e=>{if(typeof e!=`object`)return H(e).elements.length;switch(e.kind){case`Interval`:{let t=Math.max(0,e.high-e.low+1);if(t>2147483647)throw new v(`Size of interval value exceeds the maximum representable size (32bits): ${e.low}..${e.high}.`);return t}case`InfiniteSet`:case`SequenceSet`:throw new v(`Attempted to compute the number of elements in the overridden value ${G(e)}.`);case`Subset`:{let t=fn(e.base);if(t>=31)throw new v(dn(e));return 2**t}case`FunctionSet`:{if(U(e.domain))return 1;if(U(e.range))return 0;let t=fn(e.range);if(t===1)return 1;let n=fn(e.domain),r={value:1};for(let i=0;i<n;i++)if(r.value*=t,r.value>2147483647)throw new v(dn(e));return r.value}case`RecordSet`:return U(e)?0:un(e.sets,()=>dn(e));case`ProductSet`:return U(e)?0:un(e.factors,()=>`Overflow when computing the number of elements in ${G(e)}`);default:return H(e).elements.length}},pn=e=>`Attempted to check if the set ${G(e)}is finite.`,mn=e=>{if(typeof e!=`object`||e.kind===`ModelValue`)throw new v(`Attempted to check if the ${je(e)} ${G(e)} is a finite set.`);switch(e.kind){case`Set`:case`MixedSet`:case`Interval`:case`Function`:return!0;case`LazyFunction`:throw new v(`Attempted to check if the function:\n${G(e)}\nis a finite set.`);case`InfiniteSet`:return!1;case`SequenceSet`:return mn(e.base)&&U(e.base);case`Subset`:return mn(e.base);case`FunctionSet`:{let t=mn(e.domain);if(t&&U(e.domain))return!0;let n=mn(e.range);return n&&U(e.range)?!0:n&&(t||fn(e.range)===1)}case`RecordSet`:case`ProductSet`:{let t=e.kind===`RecordSet`?e.sets:e.factors,n={isAllFinite:!0};for(let e of t)if(!mn(e))n.isAllFinite=!1;else if(U(e))return!0;return n.isAllFinite}case`Union`:if(!Yt(e.base))throw new v(`Attempted to check if the nonenumerable set:\n${Xt(e)}\nis a finite set.`);return H(e.base).elements.every(mn);case`SetOperation`:if(e.operator===`\\cup`)return mn(e.left)&&mn(e.right);if(e.operator===`\\cap`){if(!mn(e.left)&&!mn(e.right))throw new v(pn(e));return!0}if(mn(e.left))return!0;if(!mn(e.right))throw new v(pn(e));return!1;case`FilteredSet`:if(!mn(e.base))throw new v(`Attempted to check if expression of form {x \\in S : p(x)} is a finite set, but cannot check if S:\n${G(e.base)}\nis finite.`);return!0}},hn=(e,t)=>{let n={low:0,high:e.length-1};for(;n.low<=n.high;){let r=n.low+n.high>>1,i=B(e[r],t);if(i===0)return r;i<0?n.low=r+1:n.high=r-1}return-1},gn=e=>{if(typeof e!=`object`||!F(e))return;let t=W(e);return t.domain.every((e,t)=>e===t+1)?t.range:void 0},_n=(e,t)=>`Attempted to check if the value ${G(e)} is an element of ${G(t)}`,vn=(e,t)=>{let n=`Attempted to check if the value:\n${G(e)}\nis an element of the`;if(!F(t))return`${n} ${je(t)} ${G(t)}`;let r=t.kind===`Function`||V(t.domain)?W(t).domain:[];return r.length>0&&r.every(e=>typeof e==`string`)?`Attempted to check if element:\n${G(e)}\nis in the record:\n${G(t)}`:r.every((e,t)=>e===t+1)?`Attempted to check set membership in a tuple value.`:`${n} function ${G(t)}`},yn=(e,t)=>N.current?ke(t,()=>bn(e,t)):bn(e,t),bn=(e,t)=>{if(!P(t))throw new v(vn(e,t));switch(t.kind){case`Set`:try{return hn(t.elements,e)!==-1}catch(n){if(!(n instanceof v))throw n;return ke(t,()=>Ot(e,t.elements))}case`MixedSet`:return ke(t,()=>Ot(e,t.elements));case`Interval`:if(typeof e==`number`)return e>=t.low&&e<=t.high;if(t.low<=t.high&&!I(e))throw new v(`Attempted to check if the value:\n${G(e)}\nis in the integer interval ${G(t)}`);return!1;case`InfiniteSet`:if(t.name===`Any`)return!0;if(I(e))return!1;if(!(t.name===`STRING`?typeof e==`string`:typeof e==`number`))throw new v(`Attempted to check if the value:\n${G(e)}\nis an element of ${t.name}.`);return t.name!==`Nat`||typeof e==`number`&&e>=0;case`Subset`:if(!Yt(e))throw new v(`Attempted to check if the non-enumerable value\n${Ee(G(e))}\nis element of\n${Ee(G(t))}`);return H(e).elements.every(e=>yn(e,t.base));case`FunctionSet`:{if(!F(e)){if(I(e))return!1;throw new v(`Attempted to check if \n${G(e)}\nwhich is not a TLC function value, is in the set of functions:\n${Ee(G(t))}`)}let n=W(e),r=at(n.domain);return(r===void 0?kt(t.domain,et(n.domain)):kt({kind:`Interval`,low:r,high:r+n.domain.length-1},t.domain))&&n.range.every(e=>yn(e,t.range))}case`RecordSet`:{let n=F(e)?W(e):void 0;if(!n||!Re(n.domain)){if(I(e))return!1;throw new v(`Attempted to check if non-record\n${G(e)}\nis in the set of records:\n${G(t)}`)}return n.domain.length===t.names.length&&t.names.every((e,r)=>{let i=hn(n.domain,e);return i!==-1&&yn(n.range[i],t.sets[r])})}case`ProductSet`:{let n=F(e)?gn(e):void 0;if(n===void 0){if(F(e)&&W(e).domain.every(e=>typeof e==`number`)||I(e))return!1;throw new v(`Attempted to check if non-tuple\n${G(e)}\nis in the set of tuples:\n${G(t)}`)}return n.length===t.factors.length&&n.every((e,n)=>yn(e,t.factors[n]))}case`FilteredSet`:return yn(e,t.base)&&t.test(e);case`Union`:if(!Yt(t.base))throw new v(`Attempted to check if:\n ${G(e)}\nis an element of the non-enumerable set:\n ${Xt(t)}`);return H(t.base).elements.some(t=>yn(e,t));case`SetOperation`:return t.operator===`\\cup`?yn(e,t.left)||yn(e,t.right):yn(e,t.left)&&yn(e,t.right)===(t.operator===`\\cap`);case`SequenceSet`:{let n=gn(e);if(n===void 0){if(I(e))return!1;throw new v(_n(e,t))}return n.every(e=>bn(e,t.base))}default:throw new v(vn(e,t))}},xn=(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?bn(e,n):e.range.every((e,r)=>xn(e,t.range[r],n.range)),W=e=>{if(typeof e==`object`&&e.kind===`Function`)return e;if(typeof e==`object`&&e.kind===`LazyFunction`){V(e.domain)||fn(e.domain);let t=Gt(e.domain);return tt(t,t.map(t=>e.apply(t)))}throw new v(`Expected a function but found ${G(e)}`)},Sn=/* @__PURE__ */ new WeakSet,Cn=e=>(Sn.add(e),e),wn=e=>{let t=e.domain;return t.length===0?Sn.has(e)?`FcnRcdValue`:`TupleValue`:t===zt[t.length]?`TupleValue`:Vt.has(t)?`IntervalFcnRcdValue`:t.every(e=>typeof e==`string`)?`RecordValue`:`FcnRcdValue`},Tn=(e,t)=>`Attempted to apply function:\n${Ee(G(e))}\nto argument ${Ee(G(t))}, which is not in the domain of the function.`,En=e=>`Attempted to apply function with integer domain to the non-integer argument ${Ee(G(e))}`,Dn=(e,t)=>{if(Sn.has(e)||e.kind===`LazyFunction`)return`In applying the function\n${Ee(G(e))},\nthe first argument is:\n${Ee(G(t))}\nwhich is not in its domain.\n`;let n=wn(e);return n===`TupleValue`?typeof t==`number`?`Attempted to access index ${t} of tuple\n${Ee(G(e))}\nwhich is out of bounds.`:`Attempted to access tuple at a non integral index: ${Ee(G(t))}`:n===`RecordValue`?typeof t==`string`?`Attempted to access nonexistent field '${t}' of record\n${Ee(G(e))}`:`Attempted to access record by a non-string argument: ${Ee(G(t))}`:n===`IntervalFcnRcdValue`&&typeof t!=`number`?En(t):Tn(e,t)},On=(e,t)=>wn(e)===`FcnRcdValue`?Tn(e,t):En(t),kn=e=>wn(e)===`RecordValue`,An=(e,t)=>{let n=e[0];return typeof n==`number`?typeof t!=`number`&&(e===zt[e.length]||Vt.has(e)):typeof n==`string`&&typeof t!=`string`},jn=(e,t)=>{let n=e[0];if(typeof t==`number`&&typeof n==`number`){let r=t-n;if(e[r]===t)return r}if(e.length<=8){for(let n=0;n<e.length;n++)if(e[n]===t)return n}return hn(e,t)},Mn=(e,t,n,r)=>{if(typeof e==`object`&&e.kind===`LazyFunction`){if(!bn(t,e.domain))throw new v(Sn.has(e)?Dn(e,t):`Attempted to apply a function to ${G(t)}, which is not in its domain`);return e.apply(t)}if(typeof e!=`object`||e.kind!==`Function`)throw new v(r?.(e)??`Attempted to apply ${G(e)}, which is not a function`);let i=An(e.domain,t)?-1:jn(e.domain,t);if(i===-1)throw new v(n?.(e)??Dn(e,t));return e.range[i]},Nn=e=>Wt(e)?Vt.get(e)??Kt(e.length):void 0,Pn=e=>{if(typeof e==`object`&&e.kind===`LazyFunction`)return e.domain;let t=W(e).domain;return Nn(t)??et(t)},Fn=(e,t,n,r=!1)=>{if(typeof e==`object`&&e.kind===`LazyFunction`&&(r||!V(e.domain))){if(!bn(t,e.domain))return e;let r=n(e.apply(t));return{kind:`LazyFunction`,domain:e.domain,apply:n=>kt(t,n)?r:e.apply(n),source:e.source}}let i=W(e),a=jn(i.domain,t);if(a===-1)return i;let o=[...i.range],s=i.range[a],c=n(s);o[a]=c;let l=tt(i.domain,o);if(l.writtenKeys=i.writtenKeys,i.hash!==0){let e=i.domain[a];l.hash=s===c?i.hash:i.hash-Vn(e,s)+Vn(e,c)|0}if(i.fingerprint!==0){let e=i.domain[a];l.fingerprint=s===c?i.fingerprint:i.fingerprint-Jn(e,s)+Jn(e,c)|0}return l},In=/* @__PURE__ */ new WeakMap,Ln=e=>{let t=Math.imul(e^e>>>16,2246822507),n=Math.imul(t^t>>>13,3266489909);return n^n>>>16},Rn=(e,t)=>Math.imul(e^t,16777619),zn=e=>{let t=2166136261;for(let n=0;n<e.length;n++)t=Math.imul(t^e.charCodeAt(n),16777619);return Ln(t)},Bn=e=>Ln(Un(e)+2654435769|0),Vn=(e,t)=>Ln(Math.imul(Un(e),668265261)+Un(t)|0),Hn=e=>{if(e.kind===`ModelValue`)return Ln(Rn(zn(e.name),109));if(P(e)){if(!V(e))return zn(Qn(e));let t=H(e).elements,n=1940243425;for(let e=0;e<t.length;e++)n=n+Bn(t[e])|0;return n}let t=W(e),n=1725019383;for(let e=0;e<t.domain.length;e++)n=n+Vn(t.domain[e],t.range[e])|0;return n},Un=e=>{if(typeof e==`number`)return Ln(e^1540483477);if(typeof e==`boolean`)return e?729683222:682545830;if(typeof e==`string`)return zn(e);if(e.kind===`Set`||e.kind===`Function`)return e.hash===0&&(e.hash=Hn(e)),e.hash;let t=In.get(e);if(t!==void 0)return t;let n=Hn(e);return In.set(e,n),n},Wn=/* @__PURE__ */ new WeakMap,Gn=e=>{let t=Math.imul(e^e>>>15,739982445),n=Math.imul(t^t>>>12,695872825);return n^n>>>15},Kn=e=>{let t=2538058380;for(let n=0;n<e.length;n++)t=Math.imul(t^e.charCodeAt(n),1540483477);return Gn(t)},qn=e=>Gn(Xn(e)+2135587861|0),Jn=(e,t)=>Gn(Math.imul(Xn(e),374761393)+Xn(t)|0),Yn=e=>{if(e.kind===`ModelValue`)return Gn(Kn(e.name)^60);if(P(e)){if(!V(e))return Kn(Qn(e));let t=H(e).elements,n=461845907;for(let e=0;e<t.length;e++)n=n+qn(t[e])|0;return n}let t=W(e),n=1291169091;for(let e=0;e<t.domain.length;e++)n=n+Jn(t.domain[e],t.range[e])|0;return n},Xn=e=>{if(typeof e==`number`)return Gn(e^1759714724);if(typeof e==`boolean`)return e?1000000007:521288629;if(typeof e==`string`)return Kn(e);if(e.kind===`Set`||e.kind===`Function`)return e.fingerprint===0&&(e.fingerprint=Yn(e)),e.fingerprint;let t=Wn.get(e);if(t!==void 0)return t;let n=Yn(e);return Wn.set(e,n),n},Zn=/* @__PURE__ */ new WeakMap,Qn=e=>{if(typeof e==`boolean`)return e?`T`:`F`;if(typeof e==`number`)return String(e);if(typeof e==`string`)return JSON.stringify(e);let t=Zn.get(e);if(t!==void 0)return t;let n=$n(e);return Zn.set(e,n),n},$n=e=>{if(e.kind===`ModelValue`)return`@${e.name}`;if(e.kind===`InfiniteSet`)return`<${e.name}>`;if(e.kind===`SequenceSet`)return`<Seq ${Qn(e.base)}>`;if(e.kind===`FilteredSet`&&!V(e))throw new v(`Attempted to compare the non-enumerable set ${G(e)} with another value`);if(P(e))return V(e)?`{${H(e).elements.map(Qn).join(`,`)}}`:`<${e.kind} ${G(e)}>`;let t=W(e);return`(${t.domain.map((e,n)=>`${Qn(e)}:${Qn(t.range[n])}`).join(`,`)})`},er=e=>`"${e.replace(/\\/g,`\\\\`).replace(/"/g,`\\"`).replace(/\n/g,`\\n`).replace(/\t/g,`\\t`)}"`,tr=e=>e.reduce((e,t)=>e===0?0:e*fn(t),1),nr=e=>{if(e.kind===`Subset`)return fn(e.base)<=6?H(e):void 0;if(e.kind===`SetOperation`||e.kind===`FilteredSet`||e.kind===`Union`)return H(e);if(e.kind===`FunctionSet`&&V(e.domain)&&fn(e.domain)===0)return et([tt([],[])]);let t=e.kind===`FunctionSet`?fn(e.range)**fn(e.domain):tr(e.kind===`RecordSet`?e.sets:e.factors);return t===0?Nt:t<=1999?H(e):void 0},rr=(e,t)=>{if(t)return nr(e);if(V(e))try{return nr(e)}catch(e){if(e instanceof v)return;throw e}},ir=(e,t)=>{let n=e=>G(e,t);switch(e.kind){case`Subset`:return typeof e.base==`object`&&e.base.kind===`Interval`?`SUBSET (${n(e.base)})`:`SUBSET ${n(e.base)}`;case`FunctionSet`:return`[${n(e.domain)} -> ${n(e.range)}]`;case`RecordSet`:return`[${e.names.map((t,r)=>`${t}: ${n(e.sets[r])}`).join(`, `)}]`;case`ProductSet`:return`(${e.factors.map(n).join(` \\X `)})`;case`SetOperation`:return`${n(e.left)} ${e.operator} ${n(e.right)}`;case`FilteredSet`:return`{x \\in ${n(e.base)} : ...}`;case`Union`:return Xt(e,t)}},ar=e=>/^[\p{L}\p{Nd}_]*$/u.test(e)&&/\p{L}/u.test(e)&&(e.length<4||!/^[WS]F_/.test(e)),G=(e,t=!1,n=!1)=>{let r=e=>G(e,t,n);if(typeof e==`boolean`)return e?`TRUE`:`FALSE`;if(typeof e==`number`)return String(e);if(typeof e==`string`)return er(e);switch(e.kind){case`ModelValue`:return e.name;case`Set`:return`{${e.elements.map(r).join(`, `)}}`;case`MixedSet`:return r(H(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=rr(e,t);return n?r(n):ir(e,t)}case`SequenceSet`:return`Seq(${r(e.base)})`;case`Function`:case`LazyFunction`:{if(e.kind===`LazyFunction`&&!V(e.domain)){let t=e.source;return t?`[${t.parameters.map(e=>`${e.name} \\in ${G(e.domain)}`).join(`, `)} |-> <expression ${t.body}>]`:`<function>`}let i=W(e),a=r=>G(r,t,n&&e.kind===`Function`);return i.domain.every((e,t)=>e===t+1)?`<<${i.range.map(a).join(`, `)}>>`:i.domain.every(e=>typeof e==`string`&&ar(e))?`[${(n||i.hash!==0||i.fingerprint!==0?i.domain.map((e,t)=>[e,i.range[t]]):Fe(i)).map(e=>`${String(e[0])} |-> ${a(e[1])}`).join(`, `)}]`:`(${i.domain.map((e,t)=>`${r(e)} :> ${a(i.range[t])}`).join(` @@ `)})`}}},or=e=>{let t=Object.entries(e);return t.map(([e,n])=>`${t.length===1?``:`/\\ `}${e} = ${Ee(G(n))}\n`).join(``)},sr=(e,t)=>{for(let n=0;n<e.length;n++)e[n]=t(e[n])},cr=()=>{let e=/* @__PURE__ */ new Map,t=n=>{if(typeof n!=`object`||n.kind!==`Set`&&n.kind!==`Function`)return n;let r=Un(n),i=e.get(r);if(i!==void 0&&!Array.isArray(i)&&(i===n||it(i,n)))return i;if(Array.isArray(i)){for(let e=0;e<i.length;e++)if(i[e]===n||it(i[e],n))return i[e]}return n.kind===`Set`?sr(n.elements,t):(sr(n.domain,t),sr(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}},lr=e=>{switch(e.kind){case`Number`:case`Decimal`:case`String`:case`Identifier`:case`OperatorReference`:case`ExceptAt`:return[];case`Apply`:return e.args;case`Lambda`:return[e.body];case`And`:case`Or`:return e.operands;case`Prime`:case`Unchanged`:case`Enabled`:case`Always`:case`Eventually`:return[e.expression];case`If`:return[e.condition,e.consequent,e.alternative];case`Case`:return[...e.arms.flatMap(e=>[e.condition,e.body]),...e.other?[e.other]:[]];case`Let`:return[...e.definitions.flatMap(e=>e.kind===`Function`?[...e.bounds.map(e=>e.set),e.body]:[e.body]),e.body];case`Forall`:case`Exists`:return[...e.bounds.map(e=>e.set),e.body];case`UnboundedQuantifier`:return[e.body];case`Choose`:return[...e.set?[e.set]:[],e.body];case`SetEnumeration`:case`Tuple`:return e.elements;case`SetFilter`:return[e.bound.set,e.predicate];case`SetMap`:return[e.expression,...e.bounds.map(e=>e.set)];case`FunctionConstruction`:return[...e.bounds.map(e=>e.set),e.body];case`FunctionSet`:return[e.domain,e.range];case`Record`:case`RecordSet`:return e.fields.map(e=>e.value);case`Except`:return[e.function,...e.updates.flatMap(e=>[...e.path.flatMap(e=>e.kind===`Index`?e.args:[]),e.value])];case`FunctionApplication`:return[e.function,...e.args];case`FieldAccess`:return[e.record];case`Product`:return e.factors;case`BoxAction`:case`AngleAction`:return[e.action,e.subscript];case`WeakFairness`:case`StrongFairness`:return[e.subscript,e.action];case`Label`:return[e.body];case`Subexpression`:return e.selectors.flatMap(e=>`args`in e?e.args:[])}},K=e=>(e.kind===`Identifier`||e.kind===`Apply`)&&e.resolution?.kind===`Local`,ur=/* @__PURE__ */ new Set(/* @__PURE__ */ `=,#,~,<=>,/\\,\\/,=>,\\in,\\notin,\\subseteq,\\cup,\\cap,\\,SUBSET,UNION,DOMAIN,+,-,*,^,\\div,%,..,Seq,IsFiniteSet,RandomElement`.split(`,`)),dr=(e,t)=>ur.has(e)?new v(t):new y(t),fr=e=>typeof e==`object`&&e.kind===`Operator`,q=(e,t,n)=>{let r=e[t];if(r===void 0||fr(r))throw dr(n,`${n} expects a value as argument ${t+1}`);return r},pr=(e,t,n)=>{let r=q(e,t,n);if(typeof r!=`number`)throw dr(n,`${n} expects an integer but received ${G(r)}`);return r},mr=(e,t,n)=>{let r=q(e,t,n);if(typeof r!=`boolean`)throw dr(n,`${n} expects a boolean but received ${G(r)}`);return r},hr=(e,t,n)=>{let r=q(e,t,n);if(!P(r))throw dr(n,`${n} expects a set but received ${G(r)}`);return r},gr=(e,t,n)=>{let r=hr(e,t,n);if(!V(r))throw dr(n,`${n} cannot enumerate the non-enumerable set ${G(r)}`);return r},_r=(e,t,n)=>H(gr(e,t,n)),vr=(e,t,n)=>_r(e,t,n).elements,yr=(e,t,n)=>{let r=q(e,t,n),i=gn(r);if(!i)throw dr(n,`${n} expects a sequence but received ${G(r)}`);return i},br=(e,t,n)=>{let r=q(e,t,n);if(!F(r))throw dr(n,`${n} expects a function but received ${G(r)}`);return W(r)},xr=(e,t,n)=>{let r=e[t];if(r===void 0||!fr(r))throw dr(n,`${n} expects an operator as argument ${t+1}`);return r},Sr=(e,t)=>({kind:`Builtin`,name:e,arity:0,evaluate:()=>t,evaluateUnary:void 0,evaluateBinary:void 0}),J=(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}),Cr=(e,t,n)=>({kind:`Builtin`,name:e,arity:t,evaluate:n,evaluateUnary:void 0,evaluateBinary:void 0}),wr=(e,t,n)=>({kind:`Builtin`,name:e,arity:t,evaluate:n,evaluateUnary:void 0,evaluateBinary:void 0,isStateLevel:!0}),Tr=(e,t)=>({kind:`Builtin`,name:e,arity:2,evaluate:n=>t(q(n,0,e),q(n,1,e)),evaluateUnary:void 0,evaluateBinary:t}),Er=e=>e>2147483647||e<-2147483648,Dr=e=>new y(`Overflow when computing ${e}`),Or={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`},kr={"\\cup":`SetCupValue`,"\\cap":`SetCapValue`,"\\":`SetDiffValue`},Ar={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`},jr=e=>{if(typeof e==`number`)return`IntValue`;if(typeof e==`string`)return`StringValue`;if(typeof e==`boolean`)return`BoolValue`;if(e.kind===`SetOperation`)return kr[e.operator];if(e.kind!==`Function`)return Or[e.kind];let t=e.domain;return t.every((e,t)=>e===t+1)?`TupleValue`:t.every(e=>typeof e==`string`)?`RecordValue`:`FcnRcdValue`},Mr=e=>Ar[jr(e)],Nr=(e,t)=>new v(`Attempted to apply the operator overridden by the Java method\n${e},\nbut it produced the following error:\n${t}`),Pr=(e,t)=>{let n=n=>(...r)=>{try{return n(...r)}catch(n){throw n instanceof v&&(e.isLazy===!0||!(n instanceof y))?Nr(t,n.message):n}};return{...e,evaluate:n(e.evaluate),evaluateUnary:e.evaluateUnary&&n(e.evaluateUnary),evaluateBinary:e.evaluateBinary&&n(e.evaluateBinary)}},Fr=(e,t)=>{if(typeof e!=`number`)throw Nr(t,`Cannot cast tlc2.value.impl.${jr(e)} to tlc2.value.impl.IntValue`);return e},Ir=(e,t,n)=>`public static tlc2.value.impl.${t} tlc2.module.Integers.${e}(${Array.from({length:n},()=>`tlc2.value.impl.IntValue`).join(`,`)})`,Lr=(e,t,n)=>{let r=Ir(t,`IntValue`,2);return Tr(e,(t,i)=>{let a=Fr(t,r),o=Fr(i,r),s=n(a,o);if(Er(s))throw Dr(`${a}${e}${o}`);return s})},Rr=(e,t,n)=>{if(typeof e!=`number`)throw new y(`The ${t} argument of ${n} should be an integer, but instead it is:\n${G(e)}`);return e},zr=(e,t)=>Tr(e,(n,r)=>t(Rr(n,`first`,e),Rr(r,`second`,e))),Br=(e,t,n)=>({...wr(e,t,n),isLazy:!0}),Vr=(e,t,n)=>{let r=xr(e,t,n);return()=>r.call([])},Hr=/* @__PURE__ */ new Set([`Apply`,`And`,`Or`,`If`,`FunctionApplication`,`FieldAccess`,`Record`,`Tuple`,`SetEnumeration`,`Prime`,`Unchanged`,`Forall`,`Exists`]),Ur=()=>({bool:Fo,condition:(e,t)=>{if(typeof e!=`boolean`)throw So(t,e);return e},conjunct:(e,t,n)=>{if(typeof e!=`boolean`)throw Co(t,n,e);return e},apply:Mn,tuple:qt,set:Mt,record:tt,writtenRecord:Ie,equal:nt,enumerate:Bo,unassigned:(e,t)=>{throw vc(e,t)},primeOutsideAction:e=>{throw yc(e)},prime:e=>({environment:e.environment,scope:e.scope,state:e.next,next:void 0}),extend:(e,t,n)=>({environment:e.environment,scope:t.reduce((e,t,r)=>Mo(e,t,n[r]),e.scope),state:e.state,next:e.next})}),Wr={value:void 0},Gr=(e,t)=>(e.references.push(t),`reference${e.references.length-1}`),Kr=e=>`local${e.counter++}`,qr=(e,t=/* @__PURE__ */ new Set)=>(e.kind===`Identifier`&&t.add(e.name),e.kind===`Apply`&&t.add(e.operator),lr(e).forEach(e=>qr(e,t)),t),Jr=(e,t,n)=>{let r=Gr(e,X(t,e.environment)),i=qr(t),a=[...n.locals].filter(([e])=>i.has(e));if(a.length===0)return`${r}(${n.context})`;let o=Gr(e,a.map(([e])=>e));return`${r}(extend(${n.context}, ${o}, [${a.map(([,e])=>e).join(`, `)}]))`},Yr=(e,t,n)=>{let r=t.kind===`Forall`,i=JSON.stringify(r?`the body of \\A`:`the body of \\E`),a=`quantifier${e.counter++}`,o=[...n.locals.values()],s={context:`context`,state:`state`,next:`next`,isPrimed:!1,locals:new Map(n.locals)},c=t.bounds.map(()=>Kr(e)),l=t.bounds.map((t,n)=>`const ${c[n]} = enumerate(${Zr(e,t.set,s)}, ${Gr(e,t.set)});`),u=t.bounds.map(t=>{let n=Kr(e);return t.pattern.kind===`Name`&&s.locals.set(t.pattern.name,n),n}),d=`if (bool(${Zr(e,t.body,s)}, ${i}) !== ${r}) return ${!r};`,f=u.reduce((t,n,r)=>{let i=Kr(e);return`for (let ${i} = 0; ${i} < ${c[r]}.length; ${i}++) { const ${n} = ${c[r]}[${i}]; ${t} }`},d),p=o.map(e=>`, ${e}`).join(``);return e.helpers.push(`function ${a}(context, state, next${p}) { let primed; ${l.join(` `)} ${f} return ${r}; }`),`${a}(${n.context}, ${n.state}, ${n.isPrimed?`undefined`:n.next}${p})`},Xr=(e,t,n)=>{let r=t.args;if(t.operator===`=>`)return`(bool(${Zr(e,r[0],n)}, "the left side of =>") ? bool(${Zr(e,r[1],n)}, "the right side of =>") : true)`;if(K(t))return Jr(e,t,n);let i=es(t.operator,e.environment);if(i?.kind!==`Builtin`)return Jr(e,t,n);if(i.name===`DOMAIN`)return`${Gr(e,Do(t))}(${Zr(e,r[0],n)})`;if(i.name===`TLCEval`)return Jr(e,t,n);if(i.name===`\\subseteq`&&r.length===2)return`${Gr(e,Oo(t,i))}(${Zr(e,r[0],n)}, ${Zr(e,r[1],n)})`;let a=e.environment;if(i.evaluateUnary&&r.length===1&&Xs(r[0],a))return`${Gr(e,i.evaluateUnary)}(${Zr(e,r[0],n)})`;let o=r.length===2&&Xs(r[0],a)&&Xs(r[1],a);return i.evaluateBinary&&o?`${Gr(e,i.evaluateBinary)}(${Zr(e,r[0],n)}, ${Zr(e,r[1],n)})`:Jr(e,t,n)},Zr=(e,t,n)=>{let r=(t,r=n)=>Zr(e,t,r);if(Fs(t)&&As(t,e.environment))return Jr(e,t,n);switch(t.kind){case`Number`:return vs(t.value)?String(t.value):Jr(e,t,n);case`String`:return JSON.stringify(t.value);case`Identifier`:{let r=n.locals.get(t.name);if(r)return r;if(K(t))return Jr(e,t,n);let i=us(t.name,e.environment);if(i?.kind===`Variable`){let r=JSON.stringify(t.name),a=Gr(e,t);return`(${n.state}?.[${i.index}] ?? unassigned(${r}, ${a}))`}return i?.kind===`Value`?Gr(e,i.value):Jr(e,t,n)}case`Apply`:return Xr(e,t,n);case`And`:{let n=Gr(e,t);return`(${t.operands.map((e,t)=>`conjunct(${r(e)}, ${n}, ${t})`).join(` && `)})`}case`Or`:return`(${t.operands.map(e=>`bool(${r(e)}, "a disjunct")`).join(` || `)})`;case`If`:return`(condition(${r(t.condition)}, ${Gr(e,t)}) ? ${r(t.consequent)} : ${r(t.alternative)})`;case`FunctionApplication`:{fc(t.function);let n=r(t.function),i=Gr(e,To(t));return t.args.length===1?`apply(${n}, ${r(t.args[0])}, undefined, ${i})`:`apply(${n}, tuple([${t.args.map(e=>r(e)).join(`, `)}]), undefined, ${i})`}case`FieldAccess`:return`apply(${r(t.record)}, ${JSON.stringify(t.field)}, ${Gr(e,wo(t))}, ${Gr(e,Eo(t))})`;case`Record`:{let i=gc(t.fields);if(_c(i))return Jr(e,t,n);let a=Gr(e,i.map(e=>e.name)),o=`[${i.map(e=>r(e.value)).join(`, `)}]`,s=t.fields.map(e=>e.name);return s.every((e,t)=>e===i[t].name)?`record(${a}, ${o})`:`writtenRecord(${a}, ${o}, ${Gr(e,s)})`}case`Tuple`:return`tuple([${t.elements.map(e=>r(e)).join(`, `)}])`;case`SetEnumeration`:return`set([${t.elements.map(e=>r(e)).join(`, `)}])`;case`Prime`:{let i=Gr(e,t);if(n.isPrimed)return`primeOutsideAction(${i})`;let a={context:`(primed ??= prime(${n.context}))`,state:n.next,next:`undefined`,isPrimed:!0,locals:n.locals};return`(${n.next} === undefined ? primeOutsideAction(${i}) : ${r(t.expression,a)})`}case`Unchanged`:return`equal(${r({kind:`Prime`,expression:t.expression,location:t.location})}, ${r(t.expression)})`;case`Forall`:case`Exists`:return t.bounds.every(e=>e.pattern.kind===`Name`)?Yr(e,t,n):Jr(e,t,n);default:return Jr(e,t,n)}},Qr=(e,t)=>{if(!Hr.has(e.kind))return;let n={environment:t,references:[],helpers:[],counter:0},r=Zr(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(`
|
|
31
|
-
`)}\nreturn (context) => { const state = context.state; const next = context.next; let primed; return ${r}; };`;Wr.value??=Ur();let o=Wr.value,s=Object.keys(o);return Function(...s,...i,a)(...Object.values(o),...n.references)},$r={kind:`Local`},ei=/* @__PURE__ */ new WeakMap,ti=e=>{let t=e.lastIndexOf(`@`);return t>0&&t<e.length-1},ni=new Map([`~>`,`-+->`,`\\cdot`].map(e=>[e,{key:e,arity:2}])),ri=(e,t)=>e.line<t.line||e.line===t.line&&e.column<t.column,ii=e=>e.kind===`Operator`?e.params.length:0,ai=e=>e.name.includes(`!`),oi=(e,t)=>{for(let n=e;n;n=n.parent)if(n.name===t)return n},si=(e,t,n=0)=>t.reduce((e,t)=>({name:t,arity:n,parent:e}),e),ci=(e,t)=>t.reduce((e,t)=>({name:t.name,arity:t.arity,parent:e}),e),li=e=>e.kind===`Name`?[e.name]:e.names,ui=e=>e.flatMap(e=>li(e.pattern)),di=(e,t)=>{let n=t.definitions.get(e);return n!==void 0&&(n===t.self?n.kind===`Function`||n.isRecursive:n.isRecursive||ri(n.location,t.location))?n:void 0},fi=(e,t)=>{let n=di(e,t);return n?{key:t.getKey(n),arity:ii(n)}:t.imported.get(e)},pi=(e,t)=>({module:e.range?.module??``,start:e,end:{line:e.line,column:e.column+t.length-1}}),mi=e=>{if(e.kind===`Apply`){if(e.args.length===2)return`infix`;if(e.args.length===1)return ri(e.location,e.args[0].location)?`prefix`:`postfix`}},hi=e=>e[0].toLowerCase()===e[0].toUpperCase()&&e[0]!==`_`&&(e[0]<`0`||e[0]>`9`),gi=e=>e.startsWith(`<`)&&(e[1]>=`0`&&e[1]<=`9`||e[1]===`*`),_i=(e,t,n,r)=>{let i=e.location,a=ei.get(e);if(a!==void 0)return a;if(ti(t))return e.kind===`Apply`?e.args.length:0;if(gi(t))return 0;let o=oi(n,t);if(o&&e.kind!==`OperatorReference`&&(e.resolution=$r),o)return o.arity;let s=fi(t,r);if(s)return e.kind===`Identifier`?e.name=s.key:e.operator=s.key,ei.set(e,s.arity),s.arity;let c=t.includes(`!`)?t.slice(0,t.indexOf(`!`)):``;if(c!==``&&(oi(n,c)!==void 0||fi(c,r)!==void 0||r.facts.has(c)))return e.kind===`Apply`?e.args.length:0;let l=pi(i,t===`-.`?`-`:t);if(!hi(t))throw g(`Unknown operator: \`${t}'.`,l);let u={location:h(l),message:`Could not find declaration or definition of symbol '${t}'.`},d=mi(e);throw m(d&&i.range?[u,{location:h(i.range),message:`Couldn't resolve ${d} operator symbol \`${t}'.`}]:[u])},vi=(e,t,n)=>(e.forEach(e=>Y(e.set,t,n)),e.reduce((e,t)=>si(e,li(t.pattern)),t)),yi=(e,t)=>e.kind===`Identifier`&&e.name===t&&K(e)||lr(e).some(e=>yi(e,t)),bi=(e,t)=>{e.kind===`FunctionConstruction`&&yi(e.body,t)&&(e.isRecursive=!0),lr(e).forEach(e=>bi(e,t))},xi=(e,t,n)=>{let r=si(t,e.kind===`Function`?[e.name]:[]);e.kind===`Function`?(Y(e.body,vi(e.bounds,r,n),n),bi(e.body,e.name)):Y(e.body,ci(r,e.params),n)},Si=(e,t,n)=>{let r=e.filter(e=>e.isRecursive).reduce((e,t)=>({name:t.name,arity:ii(t),parent:e}),t);return e.reduce((e,t)=>(ai(t)||xi(t,e,n),{name:t.name,arity:ii(t),parent:e}),r)},Ci=(e,t,n,r,i)=>{let a=e.kind===`Operator`?e.params[t]:void 0,o=n.location;if(a?.arity===0&&r>0)throw new p(`Operator used in argument number ${t+1} has incorrect number of arguments at line ${o.line}, column ${o.column}`);let s=i?.kind===`Operator`&&i.params.some(e=>e.arity>0);if(a!==void 0&&a.arity>0&&(r!==a.arity||s))throw new p(`Argument number ${t+1} to operator '${e.name}' should be a ${a.arity}-parameter operator at line ${o.line}, column ${o.column}`)},wi=e=>e.kind===`Identifier`?e.name:e.kind===`OperatorReference`?e.operator:void 0,Ti=(e,t,n)=>{let r=e.operator,i=oi(t,r)?void 0:di(r,n),a=_i(e,r,t,n);if(a!==e.args.length)throw g(`The operator ${r} requires ${a} arguments.`,e.argumentsRange??pi(e.location,r));e.args.forEach((e,r)=>{let a=wi(e),o=a===void 0||oi(t,a)?void 0:di(a,n),s=Ei(e,t,n);i&&Ci(i,r,e,s,o)})},Ei=(e,t,n)=>e.kind===`Identifier`?_i(e,e.name,t,n):e.kind===`OperatorReference`?_i(e,e.operator,t,n):(Y(e,t,n),e.kind===`Lambda`?e.params.length:0),Y=(e,t,n)=>{let r=e=>e.forEach(e=>Y(e,t,n));switch(e.kind){case`Number`:case`Decimal`:case`String`:case`ExceptAt`:return;case`Identifier`:{let r=e.name,i=_i(e,r,t,n);if(i>0)throw g(`The operator ${r} requires ${i} arguments.`,pi(e.location,r));return}case`OperatorReference`:_i(e,e.operator,t,n);return;case`Apply`:Ti(e,t,n);return;case`Lambda`:Y(e.body,si(t,e.params),n);return;case`And`:case`Or`:r(e.operands);return;case`Prime`:case`Unchanged`:case`Enabled`:case`Always`:case`Eventually`:Y(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&&Y(e.other,t,n);return;case`Let`:Y(e.body,Si(e.definitions,t,n),n);return;case`Forall`:case`Exists`:case`FunctionConstruction`:Y(e.body,vi(e.bounds,t,n),n);return;case`UnboundedQuantifier`:Y(e.body,si(t,e.names),n);return;case`Choose`:e.set&&Y(e.set,t,n),Y(e.body,si(t,li(e.pattern)),n);return;case`SetEnumeration`:case`Tuple`:r(e.elements);return;case`SetFilter`:Y(e.predicate,vi([e.bound],t,n),n);return;case`SetMap`:Y(e.expression,vi(e.bounds,t,n),n);return;case`FunctionSet`:r([e.domain,e.range]);return;case`Record`:case`RecordSet`:{let t=e.fields.filter((t,n)=>e.fields.slice(0,n).some(e=>e.name===t.name));if(t.length>0)throw m(t.map(e=>({location:h(e.location.range??pi(e.location,e.name)),message:`Non-unique fields in constructor.`})));r(e.fields.map(e=>e.value));return}case`Except`:r([e.function,...e.updates.flatMap(e=>[...e.path.flatMap(e=>e.kind===`Index`?e.args:[]),e.value])]);return;case`FunctionApplication`:r([e.function,...e.args]);return;case`FieldAccess`:Y(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`:Y(e.body,t,n);return;case`Subexpression`:e.selectors.flatMap(e=>`args`in e?e.args:[]).forEach(e=>Ei(e,t,n))}},Di=(e,t,n)=>(e.set&&Y(e.set,t,n),{name:e.name,arity:e.arity,parent:t}),Oi=(e,t,n)=>{let r=e.assumptions.reduce((e,t)=>t.kind===`NewSymbol`?Di(t,e,n):(t.kind===`AssumeProve`?Oi(t,e,n):Y(t,e,n),e),t);return Y(e.conclusion,r,n),r},ki=(e,t,n)=>e.kind===`AssumeProve`?Oi(e,t,n):(Y(e,t,n),t),Ai=(e,t,n)=>{e?.kind===`Steps`&&e.steps.reduce((e,t)=>ji(t,e,n),t)},ji=(e,t,n)=>{let r=e.body;switch(r.kind){case`Assert`:{let i=ki(r.statement,t,n);return Ai(e.proof,i,n),r.isSuffices?i:t}case`Define`:return Si(r.definitions.flatMap(e=>e.kind===`Instance`?[]:[e]),t,n);case`Have`:case`Case`:return Y(r.expression,t,n),Ai(e.proof,t,n),t;case`Witness`:return r.expressions.forEach(e=>Y(e,t,n)),t;case`Take`:return si(vi(r.bounds,t,n),r.names);case`Pick`:{let i=si(vi(r.bounds,t,n),r.names);return Y(r.body,i,n),Ai(e.proof,t,n),i}default:return Ai(e.proof,t,n),t}},Mi=(e,t)=>{let n=e.name!==void 0&&e.statement.kind!==`AssumeProve`?void 0:ki(e.statement,void 0,t);Ai(e.proof,n,t)},Ni=(e,t)=>new p(`Multiply-defined symbol '${e}' at line ${t.line}, column ${t.column}`),Pi=(e,t,n,r)=>t.reduce((e,t)=>{if(oi(e,t)||n(t))throw Ni(t,r);return{name:t,arity:0,parent:e}},e),Fi=(e,t,n,r)=>(e.forEach(e=>Li(e.set,t,n)),e.reduce((e,t)=>Pi(e,li(t.pattern),n,r),t)),Ii=(e,t,n)=>{if(e.kind===`Function`){let r=si(t,[e.name]),i=Fi(e.bounds,r,n,e.location);Li(e.body,i,n);return}let r=Pi(t,e.params.map(e=>e.name),n,e.location);Li(e.body,r,n)},Li=(e,t,n)=>{let r=e.location;switch(e.kind){case`Lambda`:Li(e.body,Pi(t,e.params,n,r),n);return;case`Let`:{let i=e.definitions.filter(e=>e.isRecursive).map(e=>e.name),a=e.definitions.reduce((e,t)=>{if(oi(e,t.name)||n(t.name))throw Ni(t.name,t.location);return Ii(t,si(e,i),n),si(e,[t.name])},t);Li(e.body,Pi(a,(e.instances??[]).flatMap(e=>e.name===void 0?[]:[e.name]),n,r),n);return}case`Forall`:case`Exists`:case`FunctionConstruction`:Li(e.body,Fi(e.bounds,t,n,r),n);return;case`SetFilter`:Li(e.predicate,Fi([e.bound],t,n,r),n);return;case`SetMap`:Li(e.expression,Fi(e.bounds,t,n,r),n);return;case`UnboundedQuantifier`:Li(e.body,Pi(t,e.names,n,r),n);return;case`Choose`:e.set&&Li(e.set,t,n),Li(e.body,Pi(t,li(e.pattern),n,r),n);return;default:lr(e).forEach(e=>Li(e,t,n))}},Ri=e=>[...e.definitions.map(e=>({name:e.name,kind:`Definition`,location:e.location,isRecursive:e.isRecursive})),...e.instances.flatMap(e=>e.name===void 0?[]:[{name:e.name,kind:`Definition`,location:e.location,isRecursive:!1}]),...e.constants.map(e=>({name:e.name,kind:`Constant`,location:e.location,isRecursive:!1})),...e.variables.map(e=>({name:e.name,kind:`Variable`,location:e.location,isRecursive:!1}))],zi=(e,t)=>{let n=/* @__PURE__ */ new Map;Ri(e).sort((e,t)=>ri(e.location,t.location)?-1:1).forEach(e=>n.set(e.name,[...n.get(e.name)??[],e]));let r=(e,n)=>{if(!t.imported.has(e)&&!ni.has(e))return!1;let r=t.importedAt.get(e);return r===void 0||ri(r,n)};n.forEach(e=>e.forEach((n,i)=>{let a=e.slice(0,i).some(e=>e.kind===`Definition`||n.kind===`Definition`||e.kind!==n.kind),o=t.imported.get(n.name)?.declaration===n.kind;if(a||!o&&r(n.name,n.location))throw Ni(n.name,n.location)}));let i=e=>t=>(n.get(t)??[]).some(t=>t.isRecursive||ri(t.location,e))||r(t,e);e.definitions.forEach(e=>Ii(e,void 0,i(e.location))),e.assumptions.forEach(e=>Li(e.expression,void 0,i(e.location))),e.instances.forEach(e=>{let t=i(e.location),n=Pi(void 0,e.params.map(e=>e.name),t,e.location);e.substitutions.forEach(e=>Li(e.expression,n,t))})},Bi=(e,t)=>{let n=new Map([...ni,...t]);return e.constants.forEach(e=>n.set(e.name,{key:e.name,arity:e.arity})),e.variables.forEach(e=>n.set(e.name,{key:e.name,arity:0})),n},Vi=(e,t,n,r)=>{let i=ci(void 0,e.params),a={imported:Bi(n,r.imported),definitions:r.definitions,getKey:r.getKey,location:e.location,self:void 0,facts:/* @__PURE__ */ new Set},o=new Map(e.substitutions.map(e=>[e.name,e.expression])),s=`in the instance of ${e.module} at line ${e.location.line}, column ${e.location.column}`;return o.forEach((e,n)=>{if(t.every(e=>e.name!==n))throw new p(`Identifier '${n}' is not a legal target of a substitution ${s}`)}),new Map(t.map(t=>{let n=t.name;if(!o.has(n)&&!oi(i,n)&&!fi(n,a))throw new p(`Substitution missing for symbol ${n} ${s}`);let r=o.get(n)??{kind:`Identifier`,name:n,location:e.location};if(t.arity===0||r.kind!==`Identifier`)return Y(r,i,a),[n,r];if(_i(r,r.name,i,a)!==t.arity)throw new p(`An operator must be substituted for symbol '${n}', and it must have arity ${t.arity} ${s}`);return[n,r]}))},Hi=e=>{let t=[];if(e.toSorted((e,t)=>ri(e.location,t.location)?-1:1).forEach(e=>{try{e.check()}catch(e){if(!(e instanceof p)||!e.sany)throw e;e.sany.errors.filter(e=>t.every(t=>t.location!==e.location||t.message!==e.message)).forEach(e=>t.push(e))}}),t.length>0)throw m(t)},Ui=(e,t)=>{let n=Bi(e,t.imported),r=new Set([...e.theorems,...e.assumptions].flatMap(e=>e.name??[])),i=(e,i)=>({imported:n,definitions:t.definitions,getKey:t.getKey,location:e,self:i,facts:r});Hi([...e.definitions.map(e=>({location:e.location,check:()=>xi(e,void 0,i(e.location,e))})),...e.assumptions.map(e=>({location:e.location,check:()=>Y(e.expression,void 0,i(e.location,void 0))})),...e.theorems.map(e=>({location:e.location,check:()=>Mi(e,i(e.location,void 0))}))])},Wi=/* @__PURE__ */ new WeakSet,Gi=/* @__PURE__ */ new WeakSet,Ki=(e,t,n=/* @__PURE__ */ new Set)=>{let r=Qi(e,(e,r)=>Ki(e,t,r.length===0?n:/* @__PURE__ */ new Set([...n,...r])));return r.kind===`Identifier`&&K(r)&&!n.has(r.name)?{...r,name:t.get(r.name)??r.name}:r.kind===`Apply`&&K(r)&&!n.has(r.operator)?{...r,operator:t.get(r.operator)??r.operator}:r},qi=(e,t)=>e.map(e=>({pattern:e.pattern,set:t(e.set)})),Ji=/* @__PURE__ */ new WeakMap,Yi=e=>Ji.get(e)??e.name,Xi=(e,t)=>(Yi(t)!==e.name&&Ji.set(e,Yi(t)),e),Zi=(e,t)=>Xi(e.kind===`Function`?{...e,bounds:qi(e.bounds,e=>t(e,[])),body:t(e.body,ui(e.bounds))}:{...e,body:t(e.body,e.params.map(e=>e.name))},e),Qi=(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=>Zi(e,(e,r)=>t(e,[...n,...r]))),body:t(e.body,n)}}case`Forall`:case`Exists`:case`FunctionConstruction`:return{...e,bounds:qi(e.bounds,n),body:t(e.body,ui(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,li(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,li(e.bound.pattern))};case`SetMap`:return{...e,bounds:qi(e.bounds,n),expression:t(e.expression,ui(e.bounds))};case`FunctionSet`:return{...e,domain:n(e.domain),range:n(e.range)};case`Record`:case`RecordSet`:return{...e,fields:e.fields.map(e=>({...e,value:n(e.value)}))};case`Except`:return{...e,function:n(e.function),updates:e.updates.map(e=>({path:e.path.map(e=>e.kind===`Index`?{kind:`Index`,args:e.args.map(n)}:e),value:n(e.value)}))};case`FunctionApplication`:return{...e,function:n(e.function),args:e.args.map(n)};case`FieldAccess`:return{...e,record:n(e.record)};case`Product`:return{...e,factors:e.factors.map(n)};case`BoxAction`:case`AngleAction`:return{...e,action:n(e.action),subscript:n(e.subscript)};case`WeakFairness`:case`StrongFairness`:return{...e,subscript:n(e.subscript),action:n(e.action)};case`Label`:return{...e,body:n(e.body)};case`Subexpression`:return{...e,selectors:e.selectors.map(e=>`args`in e?{...e,args:e.args.map(n)}:e)}}},$i=`LAMBDA`,ea=(e,t=/* @__PURE__ */ new Set)=>{let n=e.kind===`Identifier`?e.name:e.kind===`Apply`||e.kind===`OperatorReference`?e.operator:void 0,r=n===void 0||t.has(n)?[]:[n];return Qi(e,(e,n)=>(r.push(...ea(e,n.length===0?t:/* @__PURE__ */ new Set([...t,...n]))),e)),r},ta=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}},na=(e,t,n)=>new Map([...e,...t.map(e=>[e,n(e)])]),ra=(e,t)=>e.kind===`Name`?{kind:`Name`,name:t(e.name)}:{kind:`Tuple`,names:e.names.map(t)},ia=(e,t)=>e.map(e=>({pattern:ra(e.pattern,t),set:e.set})),aa=(e,t)=>e.kind===`Function`?{...e,bounds:ia(e.bounds,t)}:{...e,params:e.params.map(e=>({name:t(e.name),arity:e.arity}))},oa=(e,t,n)=>{let r=e=>t.get(e)??e;switch(e.kind){case`Identifier`:return{...e,name:r(e.name)};case`Apply`:case`OperatorReference`:return{...e,operator:r(e.operator)};case`Label`:return{...e,params:e.params.map(r)};case`Lambda`:return{...e,params:e.params.map(n)};case`Let`:return{...e,definitions:e.definitions.map(e=>Xi({...aa(e,n),name:n(e.name)},e))};case`Forall`:case`Exists`:case`FunctionConstruction`:case`SetMap`:return{...e,bounds:ia(e.bounds,n)};case`UnboundedQuantifier`:return{...e,names:e.names.map(n)};case`Choose`:return{...e,pattern:ra(e.pattern,n)};case`SetFilter`:return{...e,bound:{pattern:ra(e.bound.pattern,n),set:e.bound.set}};default:return e}},sa=e=>`${e}@ENABLED`,ca=(e,t)=>e.modes.get(t)??e,la=(e,t,n)=>e.kind===`Identifier`&&!n.has(e.name)&&!K(e)&&t.instantiation.variables.has(e.name),ua=(e,t,n)=>{if(e.kind===`Tuple`){let r=e.elements.map(e=>ua(e,t,n));return r.every(e=>e!==void 0)?r.flat():void 0}if(e.kind!==`Identifier`)return;if(la(e,t,n))return[e.name];let r=K(e)?void 0:t.instantiation.getDefinition(e.name);return r?.kind===`Operator`&&r.params.length===0?ua(r.body,t,/* @__PURE__ */ new Map):void 0},da=(e,t,n)=>{if(t.mode===`Normal`)return;if(t.mode===`Primed`)return la(e,t,n)&&e.kind===`Identifier`?{kind:`Identifier`,name:sa(e.name),location:e.location}:void 0;if(e.kind===`Prime`)return{...e,expression:ga(e.expression,ca(t,`Primed`),n)};if(e.kind===`AngleAction`){let r=e.location;return{kind:`And`,operands:[ga(e.action,t,n),{kind:`Apply`,operator:`#`,args:[{kind:`Prime`,expression:ga(e.subscript,ca(t,`Primed`),n),location:r},ga(e.subscript,t,n)],location:r}],location:r}}if(e.kind!==`Unchanged`)return;let r=ua(e.expression,t,n);if(r!==void 0)return{kind:`And`,operands:r.map(r=>({kind:`Apply`,operator:`=`,args:[{kind:`Prime`,expression:{kind:`Identifier`,name:sa(r),location:e.location},location:e.location},ga({kind:`Identifier`,name:r,location:e.location},t,n)],location:e.location})),location:e.location}},fa=(e,t)=>({kind:`Identifier`,name:e,location:t,resolution:{kind:`Local`}}),pa=(e,t)=>e.map(e=>fa(e.name,t)),ma=(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:[...pa(t,r),...i.map(e=>fa(e,r))],location:r},location:r}},ha=(e,t)=>e.instantiation.isParameterized(t)?va(e,t):void 0,ga=(e,t,n)=>{let r=e=>ga(e,t,n),i=t.instantiation,a=i.params,o=t=>!n.has(t)&&!K(e);if(e.kind===`Enabled`&&t.mode===`Normal`)return{...e,expression:ga(e.expression,ca(t,`Enabled`),n)};if((e.kind===`WeakFairness`||e.kind===`StrongFairness`)&&t.mode===`Normal`)return{...e,subscript:r(e.subscript),action:r(e.action),enabled:ga(e.enabled??{kind:`AngleAction`,action:e.action,subscript:e.subscript,location:e.location},ca(t,`Enabled`),n)};let s=da(e,t,n);if(s)return s;if(e.kind===`Identifier`&&o(e.name)){let n=i.substitutions.get(e.name);if(n)return Wi.add(n),n;let r=ha(t,e.name);if(r===void 0)return e;if(a.length===0)return{...e,name:r};let o=i.getDefinition(e.name);return o&&ii(o)>0?ma(r,a,ii(o),e.location):{kind:`Apply`,operator:r,args:pa(a,e.location),location:e.location}}if(e.kind===`Apply`&&o(e.operator)){let n=e.args.map(r),o=i.substitutions.get(e.operator),s=i.substitutions.size>0||a.length>0||Gi.has(e),c=e=>(s&&Gi.add(e),e);if(o?.kind===`Identifier`||o?.kind===`OperatorReference`){let t=o.kind===`Identifier`?o.name:o.operator;return c({...e,operator:t,args:n,resolution:o.kind===`Identifier`?o.resolution:void 0})}if(o?.kind===`Apply`)return c({...e,operator:o.operator,args:[...o.args,...n],resolution:o.resolution});if(o?.kind===`Lambda`)return{kind:`Let`,definitions:[{kind:`Operator`,name:$i,params:o.params.map(e=>({name:e,arity:0})),body:o.body,isLocal:!0,isRecursive:!1,location:o.location}],body:{...e,operator:$i,args:n,resolution:{kind:`Local`}},location:e.location};if(o)throw new p(`The operator ${e.operator} can only be substituted by an operator at line ${e.location.line}, column ${e.location.column}`);let l=ha(t,e.operator);return l===void 0?c({...e,args:n}):{...e,operator:l,args:[...pa(a,e.location),...n]}}if(e.kind===`OperatorReference`&&o(e.operator)){let n=ha(t,e.operator);if(n===void 0)return e;let r=i.getDefinition(e.operator);return a.length>0&&r?ma(n,a,ii(r),e.location):{...e,operator:n}}let c=ta(t),l=Qi(e,(e,i)=>i.length===0?r(e):ga(e,t,na(n,i,c)));return oa(l,n,c)},_a=(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:fa(e.name,n),location:n},isLocal:e.isLocal,isRecursive:!1,location:e.location},va=(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=ta(e),o=aa(Zi(i,(t,n)=>ga(t,e,na(/* @__PURE__ */ new Map,n,a))),a);return _a(o,r.params,i.location)}):t},ya=e=>{let t=/* @__PURE__ */ new Map,n=new Set([...e.substitutions.values()].flatMap(e=>ea(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=>ha(i,e)??e,getQualifiedKey:t=>{let n=ha(i,t);if(n!==void 0)return n;let r=e.getDefinition(t);return r?e.addDefinition(t,r.name,()=>_a(r,e.params,r.location)):t}}},ba=e=>e.kind===`Let`&&e.instances!==void 0||lr(e).some(ba),xa=(e,t,n)=>{let r=e.kind===`Let`?[...n,...e.definitions]:n,i=Qi(e,e=>xa(e,t,r));return i.kind!==`Let`||!i.instances?i:{kind:`Let`,definitions:i.instances.reduce((e,n)=>{let i=e.findIndex(e=>ri(n.location,e.location)),a=i===-1?e.length:i;return[...e.slice(0,a),...t(n,r),...e.slice(a)]},i.definitions),body:i.body,location:i.location}},Sa=e=>e.name===void 0&&e.statement.kind!==`AssumeProve`?e.statement:void 0,Ca=(e,t)=>e.definitions.some(e=>ba(e.body))||e.assumptions.some(e=>ba(e.expression))||e.theorems.some(e=>{let t=Sa(e);return t!==void 0&&ba(t)})?{...e,definitions:e.definitions.map(e=>Zi(e,e=>xa(e,t,[]))),assumptions:e.assumptions.map(e=>({...e,expression:xa(e.expression,t,[])})),theorems:e.theorems.map(e=>{let n=Sa(e);return n===void 0?e:{...e,statement:xa(n,t,[])}})}:e,wa=/* @__PURE__ */ new WeakMap,Ta=/* @__PURE__ */ new WeakMap,Ea=(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},Da=(e,t,n)=>{let r=e.slice();return r[t]=n,r},Oa=(e,t,n)=>{if(typeof t==`boolean`)return t;throw new v(`In computing ${n?`initial`:`next`} states, TLC expected a boolean expression,\nbut instead found ${G(t)}.\n${xo(e)}`)},ka=(t,r,i=Z(t,r))=>{if(r.next!==void 0&&t.kind===`Number`)throw n(new v(`The next state relation is not a boolean expression.\n${t.text??t.value}`),e.error);return Oa(t,i,r.next===void 0)},Aa=e=>e===`=`||e===`\\in`||e===`\\subseteq`,ja=/* @__PURE__ */ new WeakMap,Ma=(e,t)=>{if(!e.trace)return t?wa:Ta;let n=ja.get(e)??[/* @__PURE__ */ new WeakMap,/* @__PURE__ */ new WeakMap];return ja.set(e,n),n[+!t]},Na=(e,t,n)=>{let r=Ma(t,n),i=r.get(e);if(i)return i;let a=lo(e,t,n),o=t.trace,s=o?(t,n,r,i,s,c)=>{let l=o.length;o.push(e),a(t,n,r,i,s,c),o.length=l}:a;return r.set(e,s),s},Pa=(e,t)=>{if(t.constants.has(e))return;let n=Io(e,t);return n?.kind===`Operator`&&n.params.length===0?n:void 0},Fa=(e,t,n,r=/* @__PURE__ */ new Set)=>{if(e.kind===`Prime`&&n)return Fa(e.expression,t,!1,r);if(e.kind!==`Identifier`||K(e))return;let i=t.variableIndex.get(e.name);if(i!==void 0)return n?void 0:i;let a=Pa(e.name,t);if(a&&!r.has(a))return r.add(a),Fa(a.body,t,n,r)},Ia=(e,t,n)=>Fa(e,t,!n),La=(e,t,n,r,i)=>{if(e.kind===`Prime`&&i)return La(e.expression,t,n,r,!1);if(e.kind===`Let`){let a=gs(e.definitions,Ea(r,t,n));return La(e.body,a,n,r,i)}if(e.kind!==`Identifier`)return;let a=jo(t,e.name);if(a?.kind===`Thunk`)return La(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=Pa(e.name,r.environment);if(s)return La(s.body,void 0,n,r,i)},Ra=(e,t)=>e.kind===`Let`||e.kind===`Identifier`&&(t||K(e))||!t&&e.kind===`Prime`,za=(e,t,n=/* @__PURE__ */ new Set)=>{if(e.kind===`Tuple`){let r=e.elements.map(e=>za(e,t,n));return r.every(e=>e!==void 0)?r.flat():void 0}if(e.kind!==`Identifier`||n.has(e.name))return;let r=t.variableIndex.get(e.name);if(r!==void 0)return[r];let i=Pa(e.name,t);if(i)return n.add(e.name),za(i.body,t,n)},Ba=(e,t)=>{if(e.kind===`Tuple`)return[e,...e.elements.flatMap(e=>Ba(e,t))];let n=e.kind===`Identifier`&&!t.variableIndex.has(e.name)?Pa(e.name,t):void 0;return n?[e,...Ba(n.body,t)]:[e]},Va=/* @__PURE__ */ new Set([`Label`,`And`,`Or`,`Exists`,`Forall`,`If`,`Case`,`Let`,`Unchanged`,`BoxAction`,`AngleAction`,`FunctionApplication`]),Ha=(e,t,n)=>Va.has(e.kind)?!1:e.kind===`Identifier`?t.variableIndex.has(e.name)||t.constants.has(e.name):e.kind===`Apply`?e.operator===`=>`||Aa(e.operator)&&(Ra(e.args[0],n)||Ia(e.args[0],t,n)!==void 0)||K(e)?!1:t.definitions.get(t.substitutions.get(e.operator)??e.operator)===void 0&&t.builtins.has(e.operator):!0,Ua=/* @__PURE__ */ new Set,Wa=(e,t)=>{if(K(e))return e.kind===`Identifier`?t.has(e.name)?[]:[e.name]:void 0;let n=[],r={isReadOnly:!0};return Qi(e,(e,i)=>{let a=r.isReadOnly?Wa(e,i.length===0?t:/* @__PURE__ */ new Set([...t,...i])):[];return a?n.push(...a):r.isReadOnly=!1,e}),r.isReadOnly?n:void 0},Ga=(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||K(e)?void 0:Io(r,t);return i&&!n.has(i)&&(n.add(i),Ga(i.body,t,n))?!0:lr(e).some(e=>Ga(e,t,n))},Ka=(e,t,n)=>{if(e.kind===`Apply`&&e.operator===`=`){let r=Ia(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=za(e.expression,t);if(n)return{kind:`Unchanged`,expression:e,indices:n}}return Ha(e,t,n)?{kind:`Guard`,expression:e}:{kind:`Branch`,expression:e,runner:Na(e,t,n)}},qa=(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(wc(e,t)===void 0||Ga(e,t,/* @__PURE__ */ new Set))return!0;let n=Wa(e,Ua);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)}},Ja=(e,t,n)=>{let r=e.map(e=>Ka(e,t,n)),i=r.map(()=>void 0),a=t.trace,o=(e,n,s,c,l,u)=>{let d=c,f;for(let c=e;c<r.length;c++){if(c>0&&n.isInit&&mo(d)){f??=Ea(n,s,d);for(let e=c;e<r.length;e++)if(!Ya(r[e].expression,f))return;u(d,l);return}let e=r[c];if(a&&(a.push(e.expression),e.expression.kind===`Unchanged`&&a.push(...Ba(e.expression.expression,t))),e.kind===`Guard`){f??=Ea(n,s,d);let r=i[c]??=Gs(e.expression,t);if(!ka(e.expression,f,r(f)))return;continue}if(e.kind===`Assign`){f??=Ea(n,s,d);let r=(i[c]??=Gs(e.value,t))(f),a=d[e.index];if(a===void 0)d=Da(d,e.index,r),f=void 0;else if(!nt(a,r))return;continue}if(e.kind===`Unchanged`){let t=n.current;if(!t)return;for(let n of e.indices){let e=d[n];if(e===void 0)d=Da(d,n,t[n]),f=void 0;else if(!nt(e,t[n]))return}continue}let p=c+1;e.runner(n,s,d,l,!0,(e,t)=>o(p,n,s,e,t,u));return}u(d,l)};return(e,t,n,r,i,a)=>o(0,e,t,n,r,a)},Ya=(e,t)=>Oa(e,Z(e,t),!0),Xa=e=>(t,n,r,i,a,o)=>{ka(e,Ea(t,n,r))&&o(r,i)},Za=(e,t)=>{let n=e.args[1];return(r,i,a,o,s,c)=>{let l=t(r,i,a),u=Ea(r,i,a);if(a[l]!==void 0){ka(e,u)&&c(a,o);return}let d=Z(n,u),f=e.operator===`\\subseteq`?{kind:`Subset`,base:d}:d;if(!V(f))throw new v(`In computing ${r.isInit?`initial`:`next`} states, the right side of \\IN is not enumerable.\n${xo(e)}`);let p=ln(f);for(let e=0;e<p.length&&!r.isStopped;e++)c(Da(a,l,p[e]),o)}},Qa=/* @__PURE__ */ new WeakMap,$a=e=>{let t=Qa.get(e);if(t)return t;let n=e.kind===`Tuple`?{kind:`And`,operands:e.elements.map($a),location:e.location}:{kind:`Unchanged`,expression:e,location:e.location};return Qa.set(e,n),n},eo=(e,t)=>{let n=e.args[0],r=Xa(e),i=(e,r,i)=>La(n,r,i,e,!t)??-1,a=Za(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=Z(e.args[1],Ea(t,n,o));l(Da(o,u,d),s)}},to=(e,t,n,r)=>{if(e.kind===`FunctionConstruction`)return{bounds:e.bounds,body:e.body,scope:t};if(e.kind!==`Identifier`)return;let i=jo(t,e.name);if(i?.kind===`Thunk`)return to(i.expression,i.scope,n,r);let a=i?void 0:Io(e.name,r.environment);if(a?.kind!==`Function`)return;let o=Z(e,Ea(r,void 0,n));return{bounds:a.bounds,body:a.body,scope:Mo(void 0,a.name,o)}},no=(e,t,n)=>{let r=Xa(e);return(i,a,o,s,c,l)=>{let u=to(e.function,a,o,i);if(!u){r(i,a,o,s,c,l);return}let d=Ea(i,a,o),f=e.args.map(e=>Z(e,d)),p=f.length===1?f[0]:qt(f),m=Ho(u.bounds,Ea(i,u.scope,o));if(!bn(p,m))throw new v(`Attempted to apply a function to ${G(p)}, which is not in its domain at ${bo(e)}`);Na(u.body,t,n)(i,Uo(u.bounds,u.scope,p),o,s,c,l)}},ro=(e,t)=>{if(za(e,t))return Ja([$a(e)],t,!1);if(e.kind===`Tuple`)return Na($a(e),t,!1);let n=$a(e);return(r,i,a,o,s,c)=>{let l=e.kind===`Identifier`?jo(i,e.name):void 0;l?.kind===`Thunk`?Na($a(l.expression),t,!1)(r,l.scope,a,o,s,c):ka(n,Ea(r,i,a))&&c(a,o)}},io=(e,t,n)=>{let r=e.operator,i=Xa(e),a=K(e)?void 0:es(r,t);if(a?.kind===`Builtin`)return i;if(a?.kind===`Closure`){let i=tc(a,e.args,t),o={body:void 0};return(e,s,c,l,u,d)=>{o.body??=Na(a.body,t,n),o.body(e,i(Ea(e,s,c)),c,u?l:r,u,d)}}return(a,o,s,c,l,u)=>{let d=Ea(a,o,s),f=ns(e,d);f?.kind===`Closure`?Na(f.body,t,n)(a,ms(f,e.args,d),s,l?c:r,l,u):i(a,o,s,c,l,u)}},ao=(e,t,n)=>{let r=Xa(e),i=K(e)?void 0:Pa(e.name,t),a={body:void 0};return(o,s,c,l,u,d)=>{let f=jo(s,e.name);f?.kind===`Thunk`?Na(f.expression,t,n)(o,f.scope,c,l,u,d):f||!i?r(o,s,c,l,u,d):(a.body??=Na(i.body,t,n),a.body(o,void 0,c,u?l:i.name,u,d))}},oo=(e,t,n)=>{if(n.has(e))return;if(n.add(e),e.kind===`And`){let n=e.operands[0];if(n.kind!==`Apply`||n.operator!==`=`||K(n))return;let r=n.args[0],i=n.args[1];if(r.kind!==`FunctionApplication`||i.kind!==`String`)return;let a=r.args.length===1?r.args[0]:void 0;if(a?.kind!==`Identifier`||!K(a))return;let o=Fa(r.function,t,!1);return o===void 0?void 0:{variable:o,argument:a.name,labels:/* @__PURE__ */ new Set([i.value])}}if(e.kind===`Or`){let r=e.operands.map(e=>oo(e,t,n)),i=r[0],a=r.every(e=>e!==void 0&&e.variable===i?.variable&&e.argument===i.argument);if(!i||!a)return;let o=new Set(r.flatMap(e=>[...e?.labels??[]]));return{variable:i.variable,argument:i.argument,labels:o}}if(e.kind!==`Apply`||K(e))return;let r=es(e.operator,t);if(r?.kind!==`Closure`||r.scope!==void 0)return;let i=oo(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`&&K(o))return{variable:i.variable,argument:o.name,labels:i.labels}},so=(e,t,n)=>{let r=jo(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},co=(e,t,n)=>{let r=e.map(e=>Na(e,t,n)),i=n?[]:e.map(e=>oo(e,t,/* @__PURE__ */ new Set)),a=i.find(e=>e!==void 0),o=i.map(e=>e?.variable===a?.variable&&e?.argument===a?.argument?e?.labels:void 0);return(e,t,n,i,s,c)=>{let l=a&&so(e,t,a);for(let a=0;a<r.length&&!e.isStopped;a++)(l===void 0||o[a]?.has(l)!==!1)&&r[a](e,t,n,i,s,c)}},lo=(e,t,n)=>{let r=e=>Na(e,t,n);switch(e.kind){case`And`:return Ja(e.operands,t,n);case`Or`:return co(e.operands,t,n);case`Exists`:{let i=r(e.body),a=e.bounds[0];if(e.bounds.length===1&&a.pattern.kind===`Name`){let e=a.pattern.name;return(t,n,r,o,s,c)=>{let l=Bo(Z(a.set,Ea(t,n,r)),a.set);for(let a=0;a<l.length&&!t.isStopped;a++)i(t,Mo(n,e,l[a]),r,o,s,c)}}let o=n||t.trace?void 0:qa(e,t);if(o){let r=Ja(o.rest,t,n);return(t,n,i,a,s,c)=>{let l=Ea(t,n,i),u=e.bounds.map(e=>Bo(Z(e.set,l),e.set));if(u.some(e=>e.length===0))return;let d=(e,n)=>{if(e<0)r(t,n,i,a,s,c);else for(let r of u[e]){if(t.isStopped)return;let a=Mo(n,o.names[e],r);if(e===u.length-1){let e=Ea(t,a,i);if(!o.guards.every(t=>ka(t,e)))continue}d(e-1,a)}};d(u.length-1,n)}}return(t,n,r,a,o,s)=>{Vo(e.bounds,Ea(t,n,r),e=>(i(t,e,r,a,o,s),t.isStopped))}}case`Forall`:{let i=r(e.body),a=!n&&wc(e,t)!==void 0&&!Ga(e.body,t,/* @__PURE__ */ new Set)?Wa(e,Ua):void 0;return(t,n,r,o,s,c)=>{let l=[];Vo(e.bounds,Ea(t,n,r),e=>(l.push(e),!1));let u=[...l.slice(0,1),...l.slice(1).reverse()];if(a?.every(e=>jo(n,e)?.kind===`Value`)){u.every(n=>ka(e.body,Ea(t,n,r)))&&c(r,o);return}let d=(n,r,a)=>{n===u.length?c(r,a):n>0&&t.isInit&&mo(r)?u.slice(n).every(n=>Ya(e.body,Ea(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=Z(e.condition,Ea(r,i,a));(Fo(l,`an IF condition`)?t:n)(r,i,a,o,s,c)}}case`Case`:{let t=e.arms.map(e=>({condition:e.condition,body:r(e.body)})),n=e.other?r(e.other):void 0;return(r,i,a,o,s,c)=>{let l=Ea(r,i,a),u=t.find(e=>Fo(Z(e.condition,l),`a CASE guard`))?.body??n;if(!u)throw new v(`In computing ${r.isInit?`initial`:`next`} states, TLC encountered a CASE with no conditions true.\n${xo(e)}`);u(r,i,a,o,s,c)}}case`Let`:{let n=r(e.body),i=Es(e.definitions,t);return(t,r,a,o,s,c)=>n(t,gs(e.definitions,Ea(t,r,a),i),a,o,s,c)}case`Unchanged`:return n?()=>{throw new v(`UNCHANGED appears in an initial predicate at ${bo(e)}`)}:ro(e.expression,t);case`AngleAction`:{let t=r(e.action),n=$a(e.subscript);return(e,r,i,a,o,s)=>t(e,r,i,a,o,(t,i)=>{try{ka(n,Ea(e,r,t))||s(t,i)}catch(t){throw!e.isEnabled||!(t instanceof b)?t:new v(`The action formula A appearing in a WF_v(A) or SF_v(A) operator does not specify the primed value of the variable ${t.variable} occurring in the state formula v.\n`)}})}case`BoxAction`:return r({kind:`Or`,operands:[e.action,$a(e.subscript)],location:e.location});case`Label`:return r(e.body);case`Identifier`:return ao(e,t,n);case`FunctionApplication`:return no(e,t,n);case`Apply`:{let i=e.args;if(Aa(e.operator)){let r=Ia(i[0],t,n);if(r!==void 0)return e.operator===`=`?Ja([e],t,n):Za(e,()=>r);if(Ra(i[0],n))return eo(e,n)}if(e.operator===`=>`){let e=r(i[1]);return(t,n,r,a,o,s)=>{let c=Z(i[0],Ea(t,n,r));(typeof c==`boolean`?c:Fo(c,`the left side of => at ${bo(i[0])}`))?e(t,n,r,a,o,s):s(r,a)}}return io(e,t,n)}default:return Xa(e)}},uo=/* @__PURE__ */ new WeakMap,fo=e=>{let t=uo.get(e);if(t)return t;let n=e.variables.map(()=>void 0);return uo.set(e,n),n},po=(e,t)=>t.variables.filter((t,n)=>e[n]===void 0),mo=e=>{for(let t=0;t<e.length;t++)if(e[t]===void 0)return!1;return!0},ho=(e,t)=>{let n=t.state;if(!n||!mo(n))throw new v(`ENABLED needs a complete state at ${bo(e)}`);let r=t.environment,i={environment:r,isInit:!1,isEnabled:!0,current:n,isStopped:!1};return Na(e,r,!1)(i,t.scope,fo(r),void 0,!1,()=>{i.isStopped=!0}),i.isStopped},go=(t,r,i,a)=>{let o={environment:r,isInit:!0,isEnabled:!1,current:void 0,isStopped:!1};Na(t,r,!0)(o,a,fo(r),void 0,!1,t=>{if(!o.isStopped){if(!mo(t))throw n(new ee(t),e.error);o.isStopped=i(t)}})},_o=(e,t,n)=>{let r=[];return go(e,t,e=>(r.push(e),!1),n),r},vo=(e,t,n,r,i)=>{let a={environment:n,isInit:!1,isEnabled:!1,current:t,isStopped:!1},o={successors:0};return Na(e,n,!1)(a,i,fo(n),void 0,!1,(e,t)=>{if(!a.isStopped){if(!mo(e))throw new x(e,t,po(e,n).sort());o.successors++,a.isStopped=r({state:e,action:t})}}),o.successors},yo=(e,t,n,r)=>{let i=[];return vo(e,t,n,e=>(i.push(e),!1),r),i},bo=e=>`line ${e.location.line}, column ${e.location.column}`,xo=e=>{let t=e.location.range;return t?h(t):bo(e)},So=(e,t)=>new v(`A non-boolean expression (${Mr(t)}) was used as the condition of an IF.\n${xo(e)}`),Co=(e,t,n)=>{let r=e.location.range;if(r?.start.line===e.location.line&&r.start.column===e.location.column||!r){let r=e.operands[t],i=r.kind===`Number`?String(r.value):xo(r);return new v(`A non-boolean expression (${Mr(n)}) was used as a formula in a conjunction.\n${i}`)}let i=e.operands[Math.max(t,1)].location.range?.end??r.end;return new v(`Attempted to evaluate an expression of form P /\\ Q when ${t===0?`P`:`Q`} was\n${Mr(n)}.\n${xo({...e,location:{...e.location,range:{...r,end:i}}})}`)},wo=e=>t=>kn(t)?`Attempted to select nonexistent field "${e.field}" from the record\n${G(t)}\n${xo(e)}`:On(t,e.field),To=e=>t=>`A non-function (${Mr(t)}) was applied as a function.\n${xo(e)}`,Eo=e=>t=>`Attempted to select field "${e.field}" from a non-record value ${G(t)}\n${xo(e)}`,Do=e=>t=>{if(!F(t))throw new v(`Attempted to apply the operator DOMAIN to a non-function\n(${Mr(t)})\n${xo(e)}`);return Pn(t)},Oo=(e,t)=>(n,r)=>{if(!P(n)||z(n))throw new v(`Attempted to evaluate an expression of form S \\subseteq T, but S was not enumerable.\n${xo(e)}`);return t.evaluate([n,r])},ko=t=>n(new v(`TLC can't handle real numbers: ${t.text} at ${bo(t)}`),e.configParseError),Ao=t=>n(new v(`TLC can't handle a number this big: ${t.text??t.value} at ${bo(t)}`),e.error),jo=(e,t)=>{for(let n=e;n;n=n.parent)if(n.name===t)return n.binding},Mo=(e,t,n)=>({name:t,binding:{kind:`Value`,value:n},parent:e}),No=(e,t,n)=>{if(t.kind===`Name`)return Mo(e,t.name,n);let r=gn(n);if(!r||r.length!==t.names.length)throw new v(`Cannot bind <<${t.names.join(`, `)}>> to ${G(n)}, which is not a tuple of that length`);return t.names.reduce((e,t,n)=>Mo(e,t,r[n]),e)},Po=(e,t)=>({environment:e.environment,scope:t,state:e.state,next:e.next}),Fo=(e,t)=>{if(typeof e!=`boolean`)throw new v(`Expected ${t} to be a boolean but found ${G(e)}`);return e},Io=(e,t)=>t.definitions.get(t.substitutions.get(e)??e),Lo=(e,t)=>{if(e.kind===`Prime`||e.kind===`Unchanged`||e.kind===`Enabled`)return!0;let n=e.kind===`Identifier`?e.name:e.kind===`Apply`?e.operator:void 0;if(n!==void 0){if(t.variableIndex.has(n)||t.builtins.get(n)?.isStateLevel)return!0;let e=Io(n,t);if(e&&!t.constants.has(n)&&!Ro(e,t))return!0}return lr(e).some(e=>Lo(e,t))},Ro=(e,t)=>{let n=t.constantLevels.get(e);if(n!==void 0)return n;t.constantLevels.set(e,!0);let r=!Lo(e.body,t)&&(e.kind===`Operator`||!e.bounds.some(e=>Lo(e.set,t)));return t.constantLevels.set(e,r),r},zo=(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.`},Bo=(e,t)=>{if(!P(e)||z(e)){let n=G(e),r=zo(e,n);throw new v(r===void 0?`TLC encountered a non-enumerable quantifier bound\n${n}.\n${xo(t)}`:`TLC encountered the non-enumerable quantifier bound\n${n}\n${xo(t)}\n${r}`)}return typeof e==`object`&&e.kind===`Interval`?Ut(e):H(e).elements},Vo=(e,t,n)=>{let r=e.map(e=>Bo(Z(e.set,t),e.set)),i=(t,a)=>t<0?n(a):r[t].some(n=>i(t-1,No(a,e[t].pattern,n)));return i(e.length-1,t.scope)},Ho=(e,t)=>{let n=e.map(e=>Z(e.set,t));return n.length===1?n[0]:{kind:`ProductSet`,factors:n}},Uo=(e,t,n)=>{if(e.length===1)return No(t,e[0].pattern,n);let r=gn(n)??[];return e.reduce((e,t,n)=>No(e,t.pattern,r[n]),t)},Wo=/* @__PURE__ */ new WeakMap,Go=(e,t)=>{let n=Wo.get(t);if(n)return n;let r=t.location.range;if(!r)return;let i={parameters:e.flatMap((t,n)=>n>0&&e[n-1].set===t.set?[]:[{index:n,name:t.pattern.kind===`Name`?t.pattern.name:`<<${t.pattern.names.join(`, `)}>>`}]),body:h(r)};return Wo.set(t,i),i},Ko=(e,t,n)=>{let r=Go(e,t);if(!r)return;let i=e.length>1&&typeof n==`object`&&n.kind===`ProductSet`?n.factors:[n];return{parameters:r.parameters.map(e=>({name:e.name,domain:i[e.index]})),body:r.body}},qo=(e,t,n)=>{let r=/* @__PURE__ */ new Map,i={kind:`LazyFunction`,domain:e,source:n,apply:e=>{let n=Un(e),a=r.get(n);if(a!==void 0){for(let t=0;t<a.length;t+=2)if(it(a[t],e))return a[t+1]}let o=t(e,i),s=r.get(n);return s===void 0?r.set(n,[e,o]):s.push(e,o),o}};return i},Jo=(e,t)=>{let n=Ho(e.bounds,t),r=qo(n,(n,r)=>Z(e.body,Po(t,Uo(e.bounds,Mo(void 0,e.name,r),n))),Ko(e.bounds,e.body,n));return e.bounds.length===1?Cn(r):r},Yo=(e,t)=>e.kind===`Function`?Jo(e,t):Z(e.body,t),Xo=(e,t)=>{let n=Ro(e,t.environment),r=n?t.environment.definitionValues.get(e):void 0;if(r!==void 0)return r;if(e.kind===`Operator`&&e.params.length>0)throw new v(`Operator ${e.name} requires ${e.params.length} arguments`);let i=Po(t,void 0);if(!n)return Yo(e,i);let a=t.environment.runtime.evaluateAtStartup(()=>Yo(e,i));return t.environment.definitionValues.set(e,a),a},Zo=(e,t)=>{let n=e.state===t.state&&e.next===t.next;if(n&&e.cache!==void 0)return e.cache;let r=Z(e.expression,Po(t,e.scope));return n&&(e.cache=r),r},Qo=/* @__PURE__ */ new WeakMap,$o=e=>{let t=Qo.get(e);if(t)return t;let n={kind:`Closure`,name:e.name,params:e.params,body:e.body,scope:void 0};return Qo.set(e,n),n},es=(e,t)=>{let n=t.substitutions.get(e);if(n!==void 0)return es(n,t);let r=t.definitions.get(e);return r?.kind===`Operator`?$o(r):t.builtins.get(e)},ts=/* @__PURE__ */ new WeakMap,ns=(e,t)=>{if(K(e))return rs(e.operator,t);let n=ts.get(e),r=n===void 0?es(e.operator,t.environment)??null:n;return n===void 0&&ts.set(e,r),r??rs(e.operator,t)},rs=(e,t)=>{let n=jo(t.scope,e);if(n?.kind===`Operator`)return n.operator;if(!n)return es(e,t.environment)},is=e=>e.kind===`Closure`?e.params.length:e.arity,as=(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:rs(n,t);if(!r)throw new v(`Expected an operator argument at ${bo(e)}`);return r},os=(e,t,n)=>{if(e.kind===`Builtin`)return e.evaluate(t,n);if(e.kind===`Operator`)return e.call(t);let r=e.params.reduce((e,n,r)=>Mo(e,n.name,t[r]),e.scope);return Z(e.body,Po(n,r))},ss=(e,t)=>e.kind===`Operator`?e:{kind:`Operator`,name:e.name,arity:is(e),call:n=>os(e,n,t),literalBody:e.kind===`Closure`&&(e.body.kind===`Number`||e.body.kind===`String`)?e.body.value:void 0},cs=(e,t)=>{if(e.kind===`Lambda`||e.kind===`OperatorReference`)return!0;if(e.kind!==`Identifier`)return!1;let n=rs(e.name,t);return n!==void 0&&is(n)>0},ls=(e,t)=>({kind:`Thunk`,expression:e,scope:t.scope,state:t.state,next:t.next,cache:void 0}),us=(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 us(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([])}},ds=(e,t)=>{if(e.kind===`String`||e.kind===`Number`&&vs(e.value)){let t={kind:`Value`,value:e.value};return()=>t}if(e.kind===`Identifier`){let n=K(e)?void 0:us(e.name,t);if(n?.kind===`Value`){let e={kind:`Value`,value:n.value};return()=>e}if(n===void 0)return t=>{let n=jo(t.scope,e.name);return n?.kind===`Value`||n?.kind===`Thunk`?n:ls(e,t)}}return t=>ls(e,t)},fs=/* @__PURE__ */ new WeakMap,ps=(e,t)=>{let n=fs.get(e);if(n)return n;let r=ds(e,t);return fs.set(e,r),r},ms=(e,t,n)=>{if(t.length!==e.params.length)throw new v(`Operator ${e.name} expects ${e.params.length} arguments but received ${t.length}`);let r=e.scope;for(let i=0;i<t.length;i++){let a=e.params[i],o=a.arity>0?{kind:`Operator`,operator:as(t[i],n)}:ps(t[i],n.environment)(n);r={name:a.name,binding:o,parent:r}}return r},hs=(e,t,n)=>e.kind===`Closure`?Z(e.body,Po(n,ms(e,t,n))):e.kind===`Operator`?e.call(t.map(e=>Z(e,n))):e.isLazy?e.evaluate(Zs(t,n),n):e.evaluate(t.map(e=>cs(e,n)?ss(as(e,n),n):Z(e,n)),n),gs=(e,t,n)=>e.reduce((e,r)=>{let i={name:r.name,binding:{kind:`Value`,value:!1},parent:e};return r.kind===`Function`?(i.binding={kind:`Thunk`,expression:{kind:`FunctionConstruction`,bounds:r.bounds,body:r.body,location:r.location,isRecursive:!0},scope:i,state:t.state,next:t.next,cache:void 0},i):r.params.length>0||n?.has(r)?(i.binding={kind:`Operator`,operator:{kind:`Closure`,name:r.name,params:r.params,body:r.body,scope:i}},i):(i.binding={kind:`Thunk`,expression:r.body,scope:i,state:t.state,next:t.next,cache:void 0},i)},t.scope),_s=(e,t,n)=>{let r=jo(n.scope,e);if(r?.kind===`Value`)return r.value;if(r?.kind===`Thunk`)return Zo(r,n);if(r?.kind===`Operator`){if(is(r.operator)===0)return os(r.operator,[],n);throw new v(`Operator ${e} is used without arguments`)}let i=us(e,n.environment);if(i?.kind===`Variable`){let r=n.state?.[i.index];if(r===void 0)throw vc(e,t);return r}if(i?.kind===`Value`)return i.value;if(i?.kind===`Definition`)return Xo(i.definition,n);let a=n.environment.builtins.get(e);if(a?.arity===0)return a.evaluate([],n);throw new v(`Unknown identifier ${e} at ${bo(t)}`)},vs=e=>Number.isInteger(e)&&e<=2147483647&&e>=-2147483648,ys=/* @__PURE__ */ new Set([`Print`,`PrintT`,`Assert`,`JavaTime`,`RandomElement`,`TLCGet`,`TLCSet`]),bs=(e,t)=>ys.has(e)||t.builtins.get(e)?.isStateLevel===!0,xs={builtins:ys,definitions:/* @__PURE__ */ new WeakMap},Ss={builtins:new Set([...ys].filter(e=>e!==`Assert`)),definitions:/* @__PURE__ */ new WeakMap},Cs=(e,t)=>e.kind===`Operator`&&e.params.length===0&&Ro(e,t),ws=(e,t,n)=>{let r=e.kind===`Identifier`?e.name:e.kind===`Apply`||e.kind===`OperatorReference`?e.operator:void 0;if(r!==void 0&&!K(e)){let e=Io(r,t),i=n.builtins.has(r)||t.builtins.get(r)?.isStateLevel===!0;if(!e&&i||e&&!Cs(e,t)&&Ts(e,t,n))return!0}return lr(e).some(e=>ws(e,t,n))},Ts=(e,t,n=xs)=>{let r=n.definitions.get(e);if(r!==void 0)return r;n.definitions.set(e,!1);let i=ws(e.body,t,n)||e.kind===`Function`&&e.bounds.some(e=>ws(e.set,t,n));return n.definitions.set(e,i),i},Es=(e,t)=>new Set(e.filter(e=>Ts(e,t))),Ds=e=>[...e.definitions.values()].some(t=>Ts(t,e)),Os=e=>[...e.definitions.values()].some(t=>Ts(t,e,Ss)),ks=/* @__PURE__ */ new WeakMap,As=(e,t)=>{let n=ks.get(e);if(n!==void 0)return n;let r=Ps(e,t,Ms);return ks.set(e,r),r},js=/* @__PURE__ */ new Set([`Number`,`String`,`Identifier`,`Apply`,`And`,`Or`,`If`,`Case`,`SetEnumeration`,`Tuple`,`FunctionSet`,`Record`,`RecordSet`,`FunctionApplication`,`FieldAccess`,`Product`,`SetFilter`,`SetMap`,`Forall`,`Exists`,`Choose`,`FunctionConstruction`,`Let`]),Ms=/* @__PURE__ */ new Set,Ns=(e,t,n)=>n.size===0?As(e,t):Ps(e,t,n),Ps=(e,t,n)=>{if(!js.has(e.kind))return!1;if(e.kind===`Identifier`&&K(e))return n.has(e.name);if(K(e))return!1;if(e.kind===`Identifier`){let n=us(e.name,t);return n?.kind===`Value`||n?.kind===`Definition`&&Cs(n.definition,t)}if(e.kind===`Apply`){if(bs(e.operator,t)||e.operator===`~>`)return!1;let r=es(e.operator,t);if(r?.kind!==`Builtin`&&r?.kind!==`Closure`)return!1;if(r.kind===`Closure`){let n=Io(e.operator,t);if(!n||!Ro(n,t)||Ts(n,t))return!1}return!(r.kind===`Closure`?r.params:[]).some(e=>e.arity>0)&&e.args.every(e=>e.kind!==`Lambda`&&e.kind!==`OperatorReference`&&Ns(e,t,n))}let r={value:!0};return Qi(e,(e,i)=>(r.value&&=Ns(e,t,i.length===0?n:/* @__PURE__ */ new Set([...n,...i])),e)),r.value},Fs=e=>e.kind!==`Number`&&e.kind!==`String`&&e.kind!==`Identifier`,Is=e=>{let t={value:void 0};return n=>{if(t.value!==void 0)return t.value;let r=e(n);return t.value=r,r}},Ls=(e,t)=>{if(e.kind===`Identifier`&&K(e))return!t.has(e.name);if(K(e))return!0;let n={value:!1};return Qi(e,(e,r)=>(n.value||=Ls(e,r.length===0?t:/* @__PURE__ */ new Set([...t,...r])),e)),n.value},Rs=(e,t)=>Wi.has(e)&&Fs(e)&&wc(e,t)!==void 0&&!Ls(e,Ms),zs=/* @__PURE__ */ new WeakMap,Bs=/* @__PURE__ */ new Set([`SetEnumeration`,`SetMap`,`SetFilter`,`Tuple`,`Record`,`RecordSet`,`FunctionSet`,`Product`]),Vs=/* @__PURE__ */ new Set([`SUBSET`,`UNION`,`DOMAIN`,`\\cup`,`\\cap`,`\\`]),Hs=(e,t)=>Bs.has(e.kind)||e.kind===`Apply`&&Vs.has(e.operator)&&!K(e)&&es(e.operator,t)?.kind===`Builtin`,Us=(e,t,n,r)=>{try{return e(t)}catch(e){throw n.length===r+1&&n.push(...Oe(e)??[]),e}},X=(e,t)=>{let n=t.evaluators.get(e);if(n)return n;let r=xc(e,t),i=Fs(e)&&As(e,t)?Is(r):Rs(e,t)?Js(r):r,a=t.trace,o=a!==void 0&&Hs(e,t),s=a?n=>{let r=a.length;a.push(e);let s=Us(i,n,a,r);a.length=r,o&&typeof s==`object`&&s.kind!==`FilteredSet`&&N.current?.set(s,e);let c=typeof s==`object`&&s.kind===`FilteredSet`?zs.get(s):void 0;return c?c(t):s}:i;return t.evaluators.set(e,s),s},Ws=/* @__PURE__ */ new WeakMap,Gs=(e,t)=>{if(t.trace)return X(e,t);let n=Ws.get(e);if(n)return n;let r=(Fs(e)&&As(e,t)?void 0:Qr(e,t))??X(e,t);return Ws.set(e,r),r},Z=(e,t)=>Gs(e,t.environment)(t),Ks=(e,t)=>{let n=e.name,r=K(e)?void 0:us(n,t);if(r?.kind===`Variable`){let t=r.index;return r=>{let i=r.state?.[t];if(i===void 0)throw vc(n,e);return i}}if(r?.kind===`Value`){let e=r.value;return()=>e}if(r?.kind===`Definition`&&r.definition.kind===`Operator`){let e=r.definition;if(e.params.length===0&&Ro(e,t))return t=>Xo(e,t);if(e.params.length===0){let n={body:void 0},r=r=>(n.body??=Gs(e.body,t),n.body(Po(r,void 0)));return qs(e,t)?Js(r):r}return t=>Xo(e,t)}if(r?.kind===`Definition`){let e=r.definition,n=t=>Xo(e,t);return Ro(e,t)||!qs(e,t)?n:Js(n)}return t=>_s(n,e,t)},qs=(e,t)=>wc(e.body,t)!==void 0&&(e.kind===`Operator`||e.bounds.every(e=>wc(e.set,t)!==void 0)),Js=e=>{let t={recent:void 0,recentValue:void 0,previous:void 0,previousValue:void 0};return n=>{let r=n.state;if(r!==void 0&&t.recent===r&&t.recentValue!==void 0)return t.recentValue;if(r!==void 0&&t.previous===r&&t.previousValue!==void 0)return t.previousValue;let i=e(n);return t.previous=t.recent,t.previousValue=t.recentValue,t.recent=r,t.recentValue=i,i}},Ys=(e,t)=>{let n=es(e,t);return n!==void 0&&is(n)>0},Xs=(e,t)=>e.kind!==`Lambda`&&e.kind!==`OperatorReference`&&!(e.kind===`Identifier`&&!K(e)&&Ys(e.name,t)),Zs=(e,t)=>e.map(e=>({kind:`Operator`,name:`argument`,arity:0,call:()=>Z(e,t),expression:e})),Qs=/* @__PURE__ */ new Set([`=`,`#`,`\\in`,`\\notin`,`\\cup`,`\\cap`,`\\`]),$s=(e,t,n)=>e===`\\in`||e===`\\notin`||(e===`\\cup`||e===`\\cap`)&&!Ae(t)?n:t,ec=(e,t,n)=>{if(n.trace&&Qs.has(e.name)&&t.length===2){let r=X(t[0],n),i=X(t[1],n);return t=>{let n=r(t),a=i(t);return ke($s(e.name,n,a),()=>e.evaluate([n,a],t))}}if(e.isLazy)return n=>e.evaluate(Zs(t,n),n);let r=e.evaluateUnary;if(r&&t.length===1&&Xs(t[0],n)){let e=X(t[0],n);return t=>r(e(t))}let i=e.evaluateBinary,a=t.length===2&&Xs(t[0],n)&&Xs(t[1],n);if(i&&a){let e=X(t[0],n),r=X(t[1],n);return t=>i(e(t),r(t))}return n=>e.evaluate(t.map(e=>cs(e,n)?ss(as(e,n),n):Z(e,n)),n)},tc=(e,t,n)=>{if(t.length!==e.params.length)return()=>{throw new v(`Operator ${e.name} expects ${e.params.length} arguments but received ${t.length}`)};let r=e.params,i=t.map((e,t)=>r[t].arity>0?void 0:ps(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:as(t[e],n)};a={name:r[e].name,binding:s,parent:a}}return a}},nc=/* @__PURE__ */ new WeakMap,rc=e=>{let t=nc.get(e);if(t)return t;let n={calls:/* @__PURE__ */ new Map,size:0};return nc.set(e,n),n},ic=(e,t)=>{let n=[];for(let r=e;n.length<t;r=r?.parent){if(r?.binding.kind!==`Value`)return;n.push(r.binding.value)}return n},ac=(e,t)=>e.every((e,n)=>it(e,t[n])),oc=(e,t)=>{let n=Io(e.operator,t);return n?.kind===`Operator`&&n.params.length>0&&n.params.every(e=>e.arity===0)&&Ro(n,t)&&!Ts(n,t)},sc=(e,t,n,r)=>{let i=tc(e,t,n),a={body:void 0},o=(t,r)=>(a.body??=Gs(e.body,n),a.body({environment:n,scope:t,state:r.state,next:r.next}));if(!r)return e=>o(i(e),e);let s=rc(e);return e=>{let n=i(e),r=ic(n,t.length);if(!r)return o(n,e);let a=r.length;for(let e of r)a=Rn(a,Un(e));let c=s.calls.get(a),l=c?.find(e=>ac(e.args,r));if(l)return l.value;let u=o(n,e);return s.size<65536&&(s.size++,c?c.push({args:r,value:u}):s.calls.set(a,[{args:r,value:u}])),u}},cc=(e,t)=>{let n=e.args;if(e.operator===`=>`){let e=X(n[0],t),r=X(n[1],t);return t=>!Fo(e(t),`the left side of =>`)||Fo(r(t),`the right side of =>`)}if(e.operator===`~>`)return()=>{throw new v(`TLC cannot evaluate a temporal formula such as ~> in a state`)};let r=K(e)?void 0:es(e.operator,t);if(r?.kind===`Closure`)return sc(r,n,t,oc(e,t));if(r?.kind===`Builtin`&&r.name===`DOMAIN`){let r=X(n[0],t),i=Do(e);return t.trace?e=>{let t=i(r(e));return typeof t==`object`&&t.kind===`Interval`?{...t}:t}:e=>i(r(e))}if(r?.kind===`Builtin`&&r.name===`TLCEval`&&n.length===1){let i=X(n[0],t);return Gi.has(e)||Lo(n[0],t)?i:e=>e.scope===void 0?r.evaluate([i(e)]):i(e)}if(r?.kind===`Builtin`&&r.name===`\\subseteq`&&n.length===2){let i=X(n[0],t),a=X(n[1],t),o=Oo(e,r);return t.trace?e=>{let t=i(e),n=a(e);return ke(t,()=>o(t,n))}:e=>o(i(e),a(e))}return r?.kind===`Builtin`?ec(r,n,t):r=>{let i=rs(e.operator,r);if(i)return hs(i,n,r);throw t.definitions.get(e.operator)?.kind===`Function`?new v(`${e.operator} is a function; apply it with brackets`):e.operator===`\\cdot`?new v(`The current version of TLC does not support action composition. An incomplete implementation can be enabled via the tlc2.tool.impl.Tool.cdot=true java property.`):new v(`Unknown operator ${e.operator} at ${bo(e)}`)}},lc=(e,t)=>{let n=e.kind===`Forall`,r=n?`the body of \\A`:`the body of \\E`,i=X(e.body,t),a=e.bounds[0];if(e.bounds.length===1&&a.pattern.kind===`Name`){let e=a.pattern.name,o=X(a.set,t);return t=>{let s=Bo(o(t),a.set);for(let a=0;a<s.length;a++){let o=Fo(i(Po(t,Mo(t.scope,e,s[a]))),r);if(o!==n)return o}return n}}let o=e.bounds;if(o.every(e=>e.pattern.kind===`Name`)){let e=o.map(e=>e.pattern.kind===`Name`?e.pattern.name:``),a=o.map(e=>X(e.set,t));return t=>{let s=a.map((e,n)=>Bo(e(t),o[n].set)),c=(a,o)=>{if(a<0)return Fo(i(Po(t,o)),r)!==n;let l=s[a];for(let t=0;t<l.length;t++)if(c(a-1,Mo(o,e[a],l[t])))return!0;return!1};return c(o.length-1,t.scope)?!n:n}}return e=>Vo(o,e,t=>Fo(i(Po(e,t)),r)!==n)?!n:n},uc=(e,t)=>{if(e.kind===`Tuple`)return qt(e.names.map(e=>{let n=jo(t,e);return n?.kind===`Value`&&n.value}));let n=jo(t,e.name);return n?.kind===`Value`?n.value:void 0},dc=/* @__PURE__ */ new WeakSet,fc=e=>{(e.kind===`FunctionConstruction`||e.kind===`Except`)&&dc.add(e)},pc=(e,t)=>{let n=dc.has(e),r=X(e.body,t),i=e.bounds,a=i[0],o=i.length===1&&a.pattern.kind===`Name`,s=X(a.set,t);return t=>{let c=o?s(t):Ho(i,t),l=typeof c==`object`&&c.kind===`ProductSet`&&i.length>1?c.factors:[c];if(e.isRecursive||n||!l.every(Ae)){let n=qo(c,e=>r(Po(t,Uo(i,t.scope,e))),Ko(i,e.body,c));return i.length===1?Cn(n):n}if(o&&a.pattern.kind===`Name`){let e=a.pattern.name,n=Gt(c);return Cn(tt(n,n.map(n=>r(Po(t,Mo(t.scope,e,n))))))}let u=[];return Vo(i,t,e=>{let n=i.length===1?uc(a.pattern,e)??!1:qt(i.map(t=>uc(t.pattern,e)??!1));return u.push([n,r(Po(t,e))]),!1}),Lt(u)}},mc=(e,t)=>{let n=dc.has(e);n&&fc(e.function);let r=X(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=>X(e,t))}),value:X(e.value,t)})),a=(e,t)=>e.kind===`Field`?e.name:e.args.length===1?e.args[0](t):qt(e.args.map(e=>e(t))),o=(e,t,r,i,s)=>r===t.length?s(Po(i,Mo(i.scope,`@`,e))):Fn(e,a(t[r],i),e=>o(e,t,r+1,i,s),n&&r===0);return e=>{let t=r(e);for(let n of i)t=o(t,n.path,0,e,n.value);return t}},hc=(e,t)=>{if(e.kind===`SetFilter`){let n=X(e.predicate,t),r=X(e.bound.set,t),i=e.bound.pattern;return t=>{let a=r(t),o=e=>n=>Fo(e(Po(t,No(t.scope,i,n))),`a set filter predicate`),s=o(n);if(!Ae(a)){if(P(a)){let t={kind:`FilteredSet`,base:a,test:s};return zs.set(t,n=>({...t,test:o(X(e.predicate,n))})),t}throw new v(`TLC encountered a non-enumerable quantifier bound ${G(a)} at ${bo(e.bound.set)}`)}return et(H(a).elements.filter(s))}}if(e.kind===`SetMap`){let n=X(e.expression,t);return t=>{let r=[];return Vo(e.bounds,t,e=>(r.push(n(Po(t,e))),!1)),Mt(r)}}let n=e.set;if(!n)return()=>{throw new v(`TLC cannot evaluate an unbounded CHOOSE at ${bo(e)}`)};let r=X(e.body,t),i={pattern:e.pattern,set:n};return t=>{let n={value:void 0};if(Vo([i],t,i=>Fo(r(Po(t,i)),`the body of CHOOSE`)?(n.value=uc(e.pattern,i),!0):!1),n.value===void 0)throw new v(`Attempted to compute the value of an expression of form\nCHOOSE x \\in S: P, but no element of S satisfied P.\n${xo(e)}`);return n.value}},gc=e=>[...e].sort((e,t)=>B(e.name,t.name)),_c=e=>e.some((t,n)=>n>0&&e[n-1].name===t.name),vc=(t,n)=>a(new b(`In evaluation, the identifier ${t} is either undefined or not an operator.\n${xo(n)}`,t),e.configParseError),yc=e=>new v(`A primed expression appears outside an action at ${bo(e)}`),bc=(e,t)=>{let n=gc(e),r=_c(n),i=n.map(e=>X(e.value,t));if(r)return e=>Lt(n.map((t,n)=>[t.name,i[n](e)]));let a=n.map(e=>e.name),o=e.map(e=>e.name);return o.some((e,t)=>e!==a[t])?e=>Ie(a,i.map(t=>t(e)),o):e=>tt(a,i.map(t=>t(e)))},xc=(e,t)=>{let n=e=>X(e,t);switch(e.kind){case`Number`:{let t=e.value;return vs(t)?()=>t:()=>{throw Ao(e)}}case`Decimal`:return()=>{throw ko(e)};case`String`:{let t=e.value;return()=>t}case`Identifier`:return Ks(e,t);case`Apply`:return cc(e,t);case`OperatorReference`:case`Lambda`:return()=>{throw new v(`An operator cannot be used as a value at ${bo(e)}`)};case`And`:{let t=e.operands.map(n);return n=>{for(let r=0;r<t.length;r++){let i=t[r](n);if(typeof i!=`boolean`)throw Co(e,r,i);if(!i)return!1}return!0}}case`Or`:{let t=e.operands.map(n);return e=>{for(let n=0;n<t.length;n++)if(Fo(t[n](e),`a disjunct`))return!0;return!1}}case`Prime`:{let t=n(e.expression);return n=>{if(!n.next)throw yc(e);return t({environment:n.environment,scope:n.scope,state:n.next,next:void 0})}}case`Unchanged`:{let t=n({kind:`Prime`,expression:e.expression,location:e.location}),r=n(e.expression);return e=>nt(t(e),r(e))}case`If`:{let t=n(e.condition),r=n(e.consequent),i=n(e.alternative);return n=>{let a=t(n);if(typeof a!=`boolean`)throw So(e,a);return a?r(n):i(n)}}case`Case`:{let t=e.arms.map(e=>({condition:n(e.condition),body:n(e.body)})),r=e.other?n(e.other):void 0;return n=>{for(let e of t)if(Fo(e.condition(n),`a CASE guard`))return e.body(n);if(r)return r(n);throw new v(`Attempted to evaluate a CASE with no conditions true.\n${xo(e)}`)}}case`Let`:{let t=n(e.body);return n=>t(Po(n,gs(e.definitions,n)))}case`Forall`:case`Exists`:return lc(e,t);case`UnboundedQuantifier`:return()=>{throw new v(`TLC cannot evaluate an unbounded quantifier at ${bo(e)}`)};case`Choose`:case`SetFilter`:case`SetMap`:return hc(e,t);case`SetEnumeration`:{let t=e.elements.map(n);return e=>Mt(t.map(t=>t(e)))}case`Tuple`:{let t=e.elements.map(n);return e=>qt(t.map(t=>t(e)))}case`FunctionConstruction`:return pc(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 bc(e.fields,t);case`RecordSet`:{let t=gc(e.fields),r=t.map(e=>e.name),i=t.map(e=>n(e.value));return e=>({kind:`RecordSet`,names:r,sets:i.map(t=>t(e))})}case`Except`:return mc(e,t);case`ExceptAt`:return t=>{let n=jo(t.scope,`@`);if(n?.kind!==`Value`)throw new v(`@ appears outside an EXCEPT at ${bo(e)}`);return n.value};case`FunctionApplication`:{fc(e.function);let r=n(e.function),i=e.args.map(n),a=To(e);if(i.length===1&&t.trace){let e=i[0];return t=>{let n=r(t),i=e(t),o=()=>Mn(n,i,void 0,a);return F(n)?ke(n,o):o()}}if(i.length===1){let e=i[0];return t=>Mn(r(t),e(t),void 0,a)}return e=>Mn(r(e),qt(i.map(t=>t(e))),void 0,a)}case`FieldAccess`:{let t=n(e.record),r=e.field,i=wo(e),a=Eo(e);return e=>Mn(t(e),r,i,a)}case`Product`:{let t=e.factors.map(n);return e=>({kind:`ProductSet`,factors:t.map(t=>t(e))})}case`BoxAction`:case`AngleAction`:{let t=n(e.action),r=n({kind:`Unchanged`,expression:e.subscript,location:e.location}),i=e.kind===`BoxAction`;return e=>i?Fo(t(e),`an action`)||r(e):Fo(t(e),`an action`)&&!r(e)}case`Enabled`:{let t=e.expression;return e=>ho(t,e)}case`Label`:return n(e.body);case`Subexpression`:return()=>{throw new v(`The subexpression reference at ${bo(e)} does not name a subexpression`)};case`Always`:case`Eventually`:case`WeakFairness`:case`StrongFairness`:return()=>{throw new v(`TLC cannot evaluate a temporal formula in a state at ${bo(e)}`)}}},Sc=/* @__PURE__ */ new Set([`Prime`,`Unchanged`,`Enabled`,`Always`,`Eventually`,`BoxAction`,`AngleAction`,`WeakFairness`,`StrongFairness`]),Cc=e=>{if(e.kind===`Identifier`)return e.name;if(e.kind===`Apply`||e.kind===`OperatorReference`)return e.operator},wc=(e,t)=>{let n=/* @__PURE__ */ new Set,r=/* @__PURE__ */ new Set,i=e=>{if(Sc.has(e.kind))return!1;let a=Cc(e),o=(e.kind===`Identifier`||e.kind===`Apply`)&&e.resolution?.kind===`Local`;if(a!==void 0&&!o&&!t.constants.has(a)){let e=t.substitutions.get(a)??a,o=t.definitions.get(e);if(!o&&bs(e,t))return!1;let s=t.variableIndex.get(a);if(s!==void 0&&n.add(s),o&&!r.has(o)&&(r.add(o),!i(o.body)||o.kind!==`Operator`&&!o.bounds.every(e=>i(e.set))))return!1}return lr(e).every(i)};return i(e)?[...n]:void 0},Tc=/* @__PURE__ */ new Map([[`Reals`,`-------------------------------- MODULE Reals -------------------------------
|
|
19
|
+
`,a.index);l((t===-1?e.length:t)-a.index);continue}if(e.startsWith(`(*`,a.index)){let t={value:0};do{if(a.index>=e.length)throw d(`Unterminated comment`);e.startsWith(`(*`,a.index)?(t.value++,l(2)):e.startsWith(`*)`,a.index)?(t.value--,l(2)):l(1)}while(t.value>0);continue}if(e.startsWith(`----`,a.index)){let t=_e(e,a.index,e=>e===`-`)-a.index;e.slice(a.index+t).trimStart().startsWith(`MODULE`)&&a.moduleDepth++,c(`Separator`,`----`,t);continue}if(e.startsWith(`====`,a.index)){if(c(`ModuleEnd`,`====`,_e(e,a.index,e=>e===`=`)-a.index),a.moduleDepth--,a.moduleDepth<=0)break;continue}if(t===`"`){let t=a.line,r=s(),i=[];for(l(1);e[a.index]!==`"`;){if(a.index>=e.length||`
|
|
20
|
+
\r`.includes(e[a.index]))throw d(`Unterminated string`);if(e[a.index]===`\\`){let t=e[a.index+1];if(t===void 0||!`ntrf\\"`.includes(t))throw d(`Invalid escape in string`);i.push({n:`
|
|
21
|
+
`,t:` `,r:`\r`,f:`\f`}[t]??t),l(2)}else i.push(e[a.index]),l(1)}l(1),n.push({kind:`String`,text:i.join(``),line:t,column:r,endColumn:s()-1});continue}let i=de.exec(e.slice(a.index,a.index+64));if(i){c(`Number`,i[0],i[0].length);continue}if(he(t)){let t=e.slice(a.index,_e(e,a.index,he));if(/^\d+$/.test(t)){let n=/^\d+(\.\d+)?/.exec(e.slice(a.index))?.[0]??t;c(n.includes(`.`)?`Decimal`:`Number`,n,n.length);continue}let n=/^(_|\d+)/.exec(t)?.[0];if(n!==void 0&&!/[A-Za-z]/.test(t)){c(n===`_`?`Operator`:`Number`,n,n.length);continue}if(t.startsWith(`WF_`)||t.startsWith(`SF_`)){c(`Keyword`,t.slice(0,3),3);continue}let i=r.get(t)??t;r.set(i,i),c(E.has(t)?`Keyword`:`Identifier`,i,t.length);continue}if(`ℕℤℝ`.includes(t)){c(`Identifier`,r.get(t)??t,1),r.set(t,t);continue}let o=ve(e,a.index);if(o>0){c(`Step`,e.slice(a.index,a.index+o),o);continue}let u=O(e,a.index);if(u){let t=e.slice(a.index,a.index+u.length);c(`Operator`,u.text,u.length,t===u.text?void 0:t)}else throw d(`Unexpected character ${JSON.stringify(t)}`)}let f=s();return n.push({kind:`End`,text:``,line:a.line,column:f,endColumn:f}),n},Se=[[`EOF`],[`BEGIN_PRAGMA`,`--->`],[`_BM1`],[`NUMBER`],[`_BM2`],[`_BM0`],[`SEPARATOR`],[`END_MODULE`],[`ACTION`,`ACTION`,`ACTIONS`],[`ASSUME`,`ASSUME`],[`BOXASSUME`,`[]ASSUME`],[`ASSUMPTION`,`ASSUMPTION`,`AXIOM`],[`CASE`,`CASE`],[`CHOOSE`,`CHOOSE`],[`CONSTANT`,`CONSTANT`,`CONSTANTS`],[`ELSE`,`ELSE`],[`EXCEPT`,`EXCEPT`],[`EXISTS`,`\\E`,`\\exists`,`∃`],[`EXTENDS`,`EXTENDS`],[`FORALL`,`\\A`,`\\forall`,`∀`],[`IF`,`IF`],[`INSTANCE`,`INSTANCE`],[`LET`,`LET`],[`LETIN`,`IN`],[`LOCAL`,`LOCAL`],[`MODULE`,`MODULE`],[`NEW`,`NEW`],[`OTHER`,`OTHER`],[`PROPOSITION`,`PROPOSITION`,`LEMMA`,`COROLLARY`],[`SF`,`SF_`],[`T_EXISTS`,`\\EE`],[`T_FORALL`,`\\AA`],[`THEN`,`THEN`],[`BY`,`BY`],[`ONLY`,`ONLY`],[`DEFINE`,`DEFINE`],[`DF`,`DEF`,`DEFS`],[`THEOREM`,`THEOREM`],[`USE`,`USE`],[`HIDE`,`HIDE`],[`HAVE`,`HAVE`],[`OBVIOUS`,`OBVIOUS`],[`OMITTED`,`OMITTED`],[`LAMBDA`,`LAMBDA`],[`TAKE`,`TAKE`],[`PROOF`,`PROOF`],[`PROVE`,`PROVE`],[`BOXPROVE`,`[]PROVE`],[`QED`,`QED`],[`RECURSIVE`,`RECURSIVE`],[`STATE`,`STATE`],[`TEMPORAL`,`TEMPORAL`,`TEMPORALS`],[`PICK`,`PICK`],[`WITNESS`,`WITNESS`],[`SUFFICES`,`SUFFICES`],[`VARIABLE`,`VARIABLE`,`VARIABLES`],[`WF`,`WF_`],[`WITH`,`WITH`],[`COMMA`,`,`],[`COLON`,`:`],[`COLONCOLON`,`::`,`∷`],[`DOT`,`.`],[`US`,`_`],[`DEF`,`==`,`≜`],[`LBR`,`(`],[`RBR`,`)`],[`DEFBREAK`,`-|-`],[`LSB`,`[`],[`ARSB`,`]_`],[`RSB`,`]`],[`LBC`,`{`],[`RBC`,`}`],[`LAB`,`<<`,`⟨`],[`ARAB`,`>>_`,`⟩_`],[`RAB`,`>>`,`⟩`],[`BANG`,`!`],[`ARROW`,`->`,`→`],[`SUBSTITUTE`,`<-`,`←`],[`MAPTO`,`|->`,`↦`],[`NUMBER_LITERAL`],[`STRING_LITERAL`],[`BAND`],[`BOR`],[`op_57`,`'`],[`op_68`,`^+`,`⁺`],[`op_69`,`^*`],[`op_70`,`^#`],[`op_76`,`-.`],[`op_26`,`\\lnot`,`¬`],[`op_29`,`\\neg`],[`op_58`,`~`],[`CASESEP`,`[]`,`□`],[`op_61`,`<>`,`◇`],[`op_112`,`ENABLED`],[`op_113`,`UNCHANGED`],[`op_114`,`SUBSET`],[`op_115`,`UNION`],[`op_116`,`DOMAIN`],[`op_1`,`//`],[`AND`,`/\\`,`∧`],[`op_3`,`/=`],[`op_4`,`/`],[`OR`,`\\/`,`∨`],...[`\\approx`,`\\asymp`,`\\bigcirc`,`\\bullet`,`\\cap`,`\\cdot`,`\\circ`,`\\cong`,`\\cup`,`\\div`,`\\doteq`,`\\equiv`,`\\geq`,`\\gg`].map(e=>[`infix`,e]),[`IN`,`\\in`,`∈`],...(/* @__PURE__ */ `\\intersect.\\union.\\land.\\leq.\\ll.\\lor.\\o.\\odot.\\ominus.\\oplus.\\oslash.\\otimes.\\prec.\\preceq.\\propto.\\sim.\\simeq.\\sqcap.\\sqcup.\\sqsubset.\\sqsupset.\\sqsubseteq.\\sqsupseteq.\\star.\\subset.\\subseteq.\\succ.\\succeq.\\supset.\\supseteq.\\uplus.\\wr.\\.~>.=>.=<.=|`.split(`.`)).map(e=>[`infix`,e]),[`EQUALS`,`=`],...[`##`,`#`,`^^`,`^`,`--`,`-|`,`-+->`].map(e=>[`infix`,e]),[`op_77`,`-`],...[`**`,`*`,`++`,`+`,`<=>`,`<:`,`<=`,`<`,`>=`,`>`,`...`,`..`,`||`,`|`,`|-`,`|=`,`&&`,`&`,`$$`,`$`,`??`,`%%`,`%`,`@@`,`!!`,`:>`,`:=`,`::=`,`(+)`,`(-)`,`(.)`,`(/)`,`(\\X)`,`\\notin`,...`≈≔≍◯⩴●∩⋅∘≅∪÷≐‥…≡‼≥≫⇔⇒⫤↝≤≪⊣≠∉⊙⊖⊕⊘⊗⇸≺⪯∝⁇⊨⊢∼≃⊓⊔⊏⊑⊐⊒⋆⊂⊆≻⪰⊃⊇×⊎‖≀`,`\\times`].map(e=>[`infix`,e]),[`op_119`,`\\X`],[`IDENTIFIER`],[`ProofStepLexeme`],[`ProofImplicitStepLexeme`],[`ProofStepDotLexeme`],[`BareLevelLexeme`],[`UnnumberedStepLexeme`]],Ce=Se.map(e=>e[0]),we=new Map(Ce.map((e,t)=>[e,t]).reverse()),k=e=>{let t=we.get(e);if(t===void 0)throw new l(`Unknown SANY token kind ${e}`);return t},Te=new Map(Se.flatMap((e,t)=>e.slice(1).map(e=>[e,t]))),A=Math.max(...[...Te.keys()].map(e=>e.length)),Ee=Array.from({length:A},(e,t)=>A-t),De=/----+ *MODULE/y,Oe=[/_\w*[A-Za-z]\w*/y,/[0-9]\w*[A-Za-z]\w*/y,/[WS](?:[a-zA-EG-Z_0-9]\w*)?/y,/[WS]F(?:[A-Za-z0-9]\w*)?/y,/[a-zA-RT-VX-Z]\w*/y,/@|ℕ|ℤ|ℝ/y],ke=e=>[/[0-9][A-Za-z0-9]*/,/[WS][a-zA-EG-Z0-9][A-Za-z0-9]*/,/[a-zA-RT-VX-Z][A-Za-z0-9]*/].map(t=>RegExp(`${t.source}${e}`,`y`)),Ae=ke(String.raw`\.\/\\`),je=ke(String.raw`\.\\\/`),Me=String.raw`<(?:[0-9]+|\+|\*)>`,Ne=[[`_BM0`,[De]],[`SEPARATOR`,[/----+/y]],[`END_MODULE`,[/====+/y]],[`NUMBER_LITERAL`,[/[0-9]+|\\[oO][0-7]+|\\[bB][01]+|\\[hH][0-9a-fA-F]+/y]],[`STRING_LITERAL`,[/"(?:[^"\n\r\\]|\\[ntrf\\"])*"/y]],[`BAND`,Ae],[`BOR`,je],[`IDENTIFIER`,Oe],[`ProofStepLexeme`,[/<[0-9]+>\w+/y]],[`ProofImplicitStepLexeme`,[/<[+*]>[A-Za-z0-9]+/y]],[`ProofStepDotLexeme`,[new RegExp(String.raw`${Me}\w+\.+`,`y`)]],[`BareLevelLexeme`,[new RegExp(Me,`y`)]],[`UnnumberedStepLexeme`,[new RegExp(String.raw`${Me}(?:\*\.*|-\.*|\.+)`,`y`)]]],Pe=[[`BEGIN_PRAGMA`,[/--->/y]],[`_BM1`,[De]]],Fe=[[`NUMBER`,[/[0-9]+/y]],[`_BM2`,[De]],[`BAND`,Ae],[`BOR`,je],[`IDENTIFIER`,Oe]],Ie=(e,t,n)=>(e.lastIndex=n,e.exec(t)?.[0].length??0),Le=(e,t,n)=>e.map(([e,r])=>({kind:k(e),length:Math.max(...r.map(e=>Ie(e,t,n)))})).reduce((e,t)=>t.length>e.length||t.length===e.length&&t.kind<e.kind?t:e,{kind:-1,length:0}),j=(e,t)=>{let n=Ee.find(n=>Te.has(e.slice(t,t+n))),r=Le(Ne,e,t);if(n===void 0)return r;let i={kind:Te.get(e.slice(t,t+n))??-1,length:n};return i.length>r.length||i.length===r.length&&i.kind<r.kind?i:r},Re=e=>e+8-e%8,ze=e=>{let t=[],n=[],r={line:1,column:0,isAfterCr:!1,isAfterLf:!1};for(let i of e)for(let e=0;e<i.length;e++)r.column++,r.isAfterLf?(r.isAfterLf=!1,r.line++,r.column=1):r.isAfterCr&&(r.isAfterCr=!1,i===`
|
|
22
|
+
`?r.isAfterLf=!0:(r.line++,r.column=1)),i===`\r`?r.isAfterCr=!0:i===`
|
|
23
|
+
`?r.isAfterLf=!0:i===` `&&(r.column=Re(r.column-1)),t.push(r.line),n.push(r.column);return{lines:t,columns:n}},Be=/"(?:[^"\n\r\\]|\\[ntrf\\"])*\\?/y,Ve=new Set([...Te.keys()].flatMap(e=>Array.from({length:e.length-1},(t,n)=>e.slice(0,n+1)))),He=(e,t)=>{let n=0;for(;Ve.has(e.slice(t,t+n+1));)n++;return e.slice(t,t+Math.max(n,Ie(Be,e,t)))},Ue=e=>{let t=ze(e),n={offset:0,mode:`DEFAULT`},r=(n,r,i)=>({kind:n,image:e.slice(r,r+i),beginLine:t.lines[r]??0,beginColumn:t.columns[r]??0,next:void 0}),i=()=>r(k(`EOF`),e.length-1,0),a=(n,r,i)=>{let a=r-1,o=t.lines[a],s=t.columns[a];return r<e.length?Ke(o,s,e[a],i):t.lines[n]===o?e[a]===`
|
|
24
|
+
`||e[a]===`\r`?Ke(o+1,0,void 0,i):Ke(o,s+1,void 0,i):`Lexical {error: EOF reached, possibly open comment starting around line ${t.lines[n]}`},o=()=>{let t=n.offset;if(e.startsWith(`\\*`,t)){let r=e.slice(t).search(/[\n\r]/);if(r===-1)return a(t,e.length,``);n.offset+=r+1;return}let r=0,i=t,o=t;for(;o<e.length;)if(e.startsWith(`(*`,o))r++,o+=2,r>1&&(i=o);else if(e.startsWith(`*)`,o)){if(r--,o+=2,i=o,r===0){n.offset=o;return}}else o++;return n.offset=o,i===e.length?void 0:a(i,o,``)},s=t=>{for(;n.offset<e.length;){let i=Le(t,e,n.offset);if(i.length>0){let e=r(i.kind,n.offset,i.length);return n.offset+=i.length,Ce[i.kind].startsWith(`_BM`)&&(n.mode=`SPEC`),Ce[i.kind]===`BEGIN_PRAGMA`&&(n.mode=`PRAGMA`),e}n.offset++}return i()};return()=>{if(n.mode===`DEFAULT`)return s(Pe);if(n.mode===`PRAGMA`)return s(Fe);for(;n.offset<e.length;){let t=n.offset;if(`
|
|
25
|
+
\r`.includes(e[t]))n.offset++;else if(e.startsWith(`(*`,t)||e.startsWith(`\\*`,t)){let e=o();if(e!==void 0)return e}else{let i=j(e,t);if(i.length===0){let n=He(e,t),r=Math.min(t+n.length+1,e.length),i=e.slice(t,r),o=r<e.length?n:i.length>1?i:``;return a(t,r,o)}let o=r(i.kind,t,i.length);return n.offset+=i.length,o}}return i()}},We=/* @__PURE__ */ new Map([[`\b`,`\\b`],[` `,`\\t`],[`
|
|
26
|
+
`,`\\n`],[`\f`,`\\f`],[`\r`,`\\r`],[`"`,`\\"`],[`'`,`\\'`],[`\\`,`\\\\`]]),Ge=e=>e.replace(/[\0-\x1f"'\\\x7f-\uffff]/g,e=>We.get(e)??(e===`\0`?``:`\\u${e.charCodeAt(0).toString(16).padStart(4,`0`)}`)),Ke=(e,t,n,r)=>`Lexical error at line ${e}, column ${t}. Encountered: ${n===void 0?`<EOF> `:`"${Ge(n)}" (${n.charCodeAt(0)}), `}after : "${Ge(r)}"`,qe=e=>{let t=Ue(e);for(let e=t();typeof e!=`string`&&e.kind!==k(`EOF`);e=t()){let t=e.image.split(``).findIndex(e=>{let t=e.charCodeAt(0);return t>255&&(t&255)<128});if(t===-1)continue;let n=e.image.slice(1,t+1).split(``).reduce((e,t)=>t===` `?Re(e):e+1,e.beginColumn);return Ke(e.beginLine,n,e.image[t],e.image.slice(0,t))}},Je=[`CONSTANT`,`CONSTANTS`,`INIT`,`NEXT`,`SPECIFICATION`,`INVARIANT`,`INVARIANTS`,`PROPERTY`,`PROPERTIES`,`CONSTRAINT`,`CONSTRAINTS`,`ACTION_CONSTRAINT`,`ACTION_CONSTRAINTS`,`SYMMETRY`,`VIEW`,`CHECK_DEADLOCK`],Ye=/* @__PURE__ */ new Set([...Je,`ALIAS`,`POSTCONDITION`,`POSTCONDITIONS`,`_POSSIBLE`,`_PERIODIC`,`_RL_REWARD`]),Xe=[`TYPE`,`TYPE_CONSTRAINT`],Ze=/* @__PURE__ */ new Set([...Je,...Xe]),Qe=[`<-`,`<<`,`>>`,`=`,`{`,`}`,`,`,`[`,`]`,`(`,`)`,`!`],$e=e=>{let t=[],n={index:0,line:1,lineStart:0},r=(r,i)=>{t.push({kind:`Error`,text:Ke(n.line,r-n.lineStart+1,e[r],i),line:n.line})},i=e=>{t.push({kind:`Error`,text:Ke(n.line+1,0,void 0,e),line:n.line})},a=e=>{let t=e.split(`
|
|
27
|
+
`);t.length>1&&(n.line+=t.length-1,n.lineStart=n.index+e.length-t[t.length-1].length),n.index+=e.length};for(;n.index<e.length;){let o=e.slice(n.index),s=/^\s+/.exec(o)?.[0];if(s){a(s);continue}if(o.startsWith(`\\*`)){let e=o.indexOf(`
|
|
28
|
+
`);a(e===-1?o:o.slice(0,e));continue}if(o.startsWith(`(*`)){let e=o.indexOf(`*)`);if(e===-1)return a(o),i(``),t;a(o.slice(0,e+2));continue}let c=n.line,l=/^\d+(?![A-Za-z_])/.exec(o)?.[0];if(l){t.push({kind:`Number`,text:l,line:c}),a(l);continue}let u=/^[A-Za-z0-9_]+/.exec(o)?.[0];if(u){t.push({kind:`Word`,text:u,line:c}),a(u);continue}if(o.startsWith(`"`)){let s=/^"((?:[^"\\\n]|\\[^\n])*)("?)/.exec(o),l=s?.[0]??`"`;if(s?.[2]!==`"`)return a(l),n.index===e.length?i(`${l}\n`):r(n.index,l),t;t.push({kind:`String`,text:s[1],line:c}),a(l);continue}let d=Qe.find(e=>o.startsWith(e));if(d){t.push({kind:`Symbol`,text:d,line:c}),a(d);continue}let f=O(e,n.index);if(!f)return r(n.index,``),t;t.push({kind:`Word`,text:f.text,line:c}),a(e.slice(n.index,n.index+f.length))}return t.push({kind:`End`,text:``,line:n.line}),t},et=(e,t)=>new v(`TLC found an error in the configuration file at line ${e}\n${t}`),tt=(e,t)=>et(e,`The keyword ${t} appeared twice.`),nt=/* @__PURE__ */ new Map([[`INIT`,`init`],[`NEXT`,`next`],[`SPECIFICATION`,`specification`],[`VIEW`,`view`],[`SYMMETRY`,`symmetry`],[`ALIAS`,`alias`],[`_PERIODIC`,`periodic`],[`_RL_REWARD`,`rlReward`]]),rt=/* @__PURE__ */ new Map([[`INVARIANT`,`invariants`],[`INVARIANTS`,`invariants`],[`PROPERTY`,`properties`],[`PROPERTIES`,`properties`],[`CONSTRAINT`,`constraints`],[`CONSTRAINTS`,`constraints`],[`ACTION_CONSTRAINT`,`actionConstraints`],[`ACTION_CONSTRAINTS`,`actionConstraints`],[`POSTCONDITION`,`postconditions`],[`POSTCONDITIONS`,`postconditions`],[`_POSSIBLE`,`possible`]]),it=(e,t=`master`)=>{let n=t===`1.7.4`?Ze:Ye,r=$e(e),i={index:0},a={init:void 0,next:void 0,specification:void 0,invariants:[],properties:[],constraints:[],actionConstraints:[],constants:[],substitutions:[],checkDeadlock:!0,symmetry:void 0,view:void 0,alias:void 0,postconditions:[],possible:[],periodic:void 0,rlReward:void 0},o={isSet:!1},s=/* @__PURE__ */ new Set,c=()=>{let e=r[Math.min(i.index++,r.length-1)];if(e.kind===`Error`)throw new v(`TLC found an error in the configuration file:\n${e.text}`);return e},l=e=>{if(e.kind===`Number`)return{kind:`Number`,value:Number(e.text)};if(e.kind===`String`)return{kind:`String`,value:e.text};if(e.text===`TRUE`||e.text===`FALSE`)return{kind:`Boolean`,value:e.text===`TRUE`};if(e.text===`{`){let e=[],t={token:c()};if(t.token.text!==`}`)for(;e.push(l(t.token)),t.token=c(),t.token.text===`,`;)t.token=c();if(t.token.text!==`}`)throw et(t.token.line,`It was expecting }, but did not find it.`);return{kind:`Set`,elements:e}}if(e.kind!==`End`)return{kind:`ModelValue`,name:e.text};throw et(e.line,`It was expecting a value, but did not find it.`)},u=e=>{let t=c();if(t.kind===`End`)throw et(t.line,`Expected an identifier after ${e}[.`);let n=c();if(n.text!==`]`)throw et(n.line,`It was expecting ], but did not find it.`);return t.text},d=e=>{for(;;){let t=c();if(t.kind===`End`||n.has(t.text))return t;let r={token:c(),name:t.text};for(;r.token.text===`!`;)r.name=`${r.name}!${c().text}`,r.token=c();let i=r.name;if(r.token.text===`<-`){if(r.token=c(),r.token.text===`[`){let e=u(`<-`),t=c();if(t.kind===`End`)throw et(t.line,`Expected an identifier after <-[mod].`);a.substitutions.push({name:i,target:t.text,module:e});continue}if(r.token.kind===`End`)throw et(r.token.line,`Expected an identifier after <-.`);a.substitutions.push({name:i,target:r.token.text});continue}let o=[],s=r.token.text===`(`;if(s){for(;o.push(l(c())),r.token=c(),r.token.text===`,`;);if(r.token.text!==`)`)throw et(e,``);r.token=c()}if(r.token.text!==`=`)throw et(r.token.line,`It was expecting = or <-, but did not find it.`);r.token=c();let d=r.token.text===`[`?u(`=`):void 0,f=l(d===void 0?r.token:c());a.constants.push({name:i,value:f,...s&&{args:o},...d!==void 0&&{module:d}})}},f=e=>{for(;;){let t=c();if(t.kind===`End`||n.has(t.text))return t;e.push(t.text)}},p={token:c()};for(;p.token.kind!==`End`;){let e=p.token.text,t=p.token.line,r=n.has(e)?nt.get(e):void 0,i=n.has(e)?rt.get(e):void 0,l=()=>{let n=c();if(n.kind===`End`)throw et(t,`The keyword ${e} was not followed by an identifier.`);return n};if(r!==void 0){let n=l();if(a[r]!==void 0)throw tt(t,e);a[r]=n.text,p.token=c()}else if(i!==void 0)p.token=f(a[i]);else if(e===`CONSTANT`||e===`CONSTANTS`)p.token=d(t);else if(e===`CHECK_DEADLOCK`){let n=l();if(n.text!==`TRUE`&&n.text!==`FALSE`)throw et(n.line,`It was expecting TRUE or FALSE, but did not find it.`);if(o.isSet)throw tt(t,e);o.isSet=!0,a.checkDeadlock=n.text===`TRUE`,p.token=c()}else{if(!n.has(e)||!Xe.includes(e))throw et(t,`It was expecting a keyword, but did not find it.`);if(l(),s.has(e))throw tt(t,e);s.add(e),p.token=c()}}return a},M={Set:{open:`{ `,close:` }`,pad:` `,separator:`,`,divider:``,dividerPad:``},Sequence:{open:`<< `,close:` >>`,pad:` `,separator:`,`,divider:``,dividerPad:``},Subset:{open:`SUBSET `,close:` `,pad:` `,separator:`,`,divider:``,dividerPad:``},Function:{open:`( `,close:` )`,pad:` `,separator:` @@`,divider:` :>`,dividerPad:` `},Record:{open:`[ `,close:` ]`,pad:` `,separator:`,`,divider:` |->`,dividerPad:` `}},at=e=>{if(e===void 0)return!1;let t=e.charCodeAt(0);return t>=9&&t<=13||t>=28&&t<=32||t===5760||t>=8192&&t<=8202&&t!==8199||t===8232||t===8233||t===8287||t===12288},ot=e=>e!==void 0&&/^\p{Nd}$/u.test(e),st=e=>e!==void 0&&/^[\p{L}\p{Nd}]$/u.test(e),ct=e=>{let t=t=>{let n=_e(e,t,at);return e[n]===void 0?void 0:n},n=(n,r,i,a,o,s)=>{let c={kind:n,first:r,last:r,children:[]},l={index:t(i)};for(;l.index!==void 0&&e[l.index]!==a;){let n=o(l.index);if(!n)return;c.children.push(n);let r=t(n.last+1);if(r===void 0)return;let i=e.startsWith(s,r)?r+s.length:r;l.index=t(i)}if(l.index!==void 0)return c.last=l.index,c},r=(n,r)=>{let i=o(n);if(!i)return;let a=t(i.last+1);if(a===void 0||!e.startsWith(r,a))return;let s=t(a+r.length),c=s===void 0?void 0:o(s);if(c)return{kind:`Pair`,first:n,last:c.last,children:[i,c]}},i=t=>{let n=_e(e,t,ot);if(e.startsWith(`..`,n)&&ot(e[n+2]))return{kind:`Constant`,first:t,last:_e(e,n+2,ot)-1,children:[]}},a=t=>{let n=e[t];if(n===`"`){let n=e.indexOf(`"`,t+1);return n===-1?void 0:{kind:`Constant`,first:t,last:n,children:[]}}let r=ot(n)?i(t):void 0;if(r)return r;if(n===`-`)return t+1>=e.length?void 0:{kind:`Constant`,first:t,last:_e(e,t+1,ot)-1,children:[]};if(st(n))return{kind:`Constant`,first:t,last:_e(e,t,st)-1,children:[]}},o=i=>{let s=t(i);if(s!==void 0)switch(e[s]){case`{`:return n(`Set`,s,s+1,`}`,o,`,`);case`<`:{let t=n(`Sequence`,s,s+2,`>`,o,`,`);return!t||t.last+1>=e.length?void 0:{...t,last:t.last+1}}case`[`:return n(`Record`,s,s+1,`]`,e=>r(e,`|->`),`,`);case`(`:return n(`Function`,s,s+1,`)`,e=>r(e,`:>`),`@@`);default:{if(!e.startsWith(`SUBSET`,s))return a(s);let n=t(s+6),r=n===void 0?void 0:o(n);return r?{kind:`Subset`,first:s,last:r.last,children:[r]}:void 0}}};return o(0)},N=e=>{let t=e.length===0?void 0:ct(e);if(!t||t.last<e.length-1)return e;let n=t=>e.slice(t.first,t.last+1),r=e=>e.last-e.first+1,i=(e,t,i,s)=>{if(r(e)<=t-i||e.kind===`Constant`)return n(e);if(e.kind===`Pair`)return;let c=M[e.kind],l=t-Math.max(c.open.length,c.pad.length),u=i+c.close.length,d=s+c.pad,f=e.kind===`Function`||e.kind===`Record`?o(e.children,l,u,d,c):a(e.children,l,u,d,c.separator);return f===void 0?void 0:c.open+f+c.close},a=(e,t,n,r,a)=>{let o=e.map((o,s)=>{let c=s===e.length-1,l=i(o,t,c?n:a.length,r);return l===void 0||c?l:`${l}${a}\n${r}`});return o.includes(void 0)?void 0:o.join(``)},o=(e,t,a,o,s)=>{let c=e.map((c,l)=>{let u=l===e.length-1,d=c.children[0],f=c.children[1],p=u?``:`${s.separator}\n${o}`,m=r(d)+s.divider.length+1+r(f);if(u?m<=t-a:m+s.separator.length<=t)return`${n(d)}${s.divider} ${n(f)}${p}`;let h=r(d)+s.divider.length<=t?n(d):i(d,t,a+s.divider.length,o),g=i(f,t-s.dividerPad.length,u?a:s.separator.length,o+s.dividerPad);return h===void 0||g===void 0?void 0:`${h}${s.divider}\n${o}${s.dividerPad}${g}${p}`});return c.includes(void 0)?void 0:c.join(``)};return i(t,80,0,``)??e},P=e=>typeof e==`object`&&e.kind!==`ModelValue`&&e.kind!==`Function`&&e.kind!==`LazyFunction`,lt=e=>typeof e==`object`&&(e.kind===`Set`||e.kind===`MixedSet`||e.kind===`Interval`),F=e=>typeof e==`object`&&(e.kind===`Function`||e.kind===`LazyFunction`),I=e=>typeof e==`object`&&e.kind===`ModelValue`,ut=e=>typeof e==`boolean`?`boolean`:typeof e==`number`?`integer`:typeof e==`string`?`string`:e.kind===`ModelValue`?`model value`:P(e)?`set`:`function`,dt=e=>{if(!Number.isInteger(e)||e>2147483647||e<-2147483648)throw new S(`Integer overflow: ${e} is outside TLC's 32-bit range`);return e},ft={isUsed:!1},pt=(e,t)=>(ft.isUsed=!0,e.writtenKeys=t,e),mt=e=>(e.writtenKeys??e.domain).map(t=>[t,e.range[yr(e.domain,t)]]),ht=(e,t,n)=>pt(Zt(e,t),n),gt=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(gt);e.writtenKeys=void 0,e.range.forEach(gt)}},_t=e=>e.every(e=>typeof e==`string`),vt=(e,t)=>e.length>0&&t.length>0&&_t(e)!==_t(t),yt=(e,t)=>{ft.isUsed&&(e.writtenKeys=void 0,t.writtenKeys=void 0);let n=e.domain,r=t.domain;if(n.length!==r.length)return vt(n,r)?yn(e,t):n.length-r.length;if(n!==r)for(let e=0;e<n.length;e++){let t=It(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=It(i[e],a[e]);if(t!==0)return t}return 0},bt=(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=It(n[e],r[e]);if(t!==0)return t}return 0},xt=e=>I(e)?e.type:void 0,St=(e,t,n)=>{let r=xt(e),i=xt(t);if(r===void 0&&i===void 0)return;let a=n?`check equality of`:`compare`;if(I(e)&&I(t)){if(r===void 0||i===void 0||r===i)return;throw new y(`Attempted to ${a} the differently-typed model values ${z(e)} and ${z(t)}`)}throw r===void 0?new y(`Attempted to ${a} the typed model value ${z(t)} and the non-model value\n${z(e)}`):new y(`Attempted to ${a}${n?``:` the`} typed model value ${z(e)} and non-model value\n${z(t)}`)},Ct={ranks:Object.create(null),size:0},wt=e=>{Ct.ranks=Object.create(null),Ct.size=0,Lt.clear();for(let t of e)Dt(t)},Tt={is174:!1},Et=e=>{Tt.is174=e===`1.7.4`},Dt=e=>(Ct.ranks[e]===void 0&&(Ct.ranks[e]=Ct.size++),e),Ot=()=>Ct.size,kt=e=>Ct.ranks[Dt(e)],At=(e,t)=>{if(e===t)return 0;let n=Ct.ranks,r=n[e],i=n[t];return r!==void 0&&i!==void 0?r-i:r===void 0?i===void 0&&e<t?-1:1:-1},jt=e=>typeof e==`object`&&(e.kind===`InfiniteSet`||e.kind===`SequenceSet`),Mt=(e,t)=>(jt(e)||jt(t))&&(typeof e!=`object`||e.kind!==`SequenceSet`||typeof t!=`object`||t.kind!==`SequenceSet`),Nt=(e,t,n)=>{if(!jt(e))throw new y(`Attempted to ${n} the set ${z(L(e)?R(e):e,!0)} with the value:\n${z(t,!0)}`);if(!jt(t))throw new y(`Attempted to compare overridden value ${z(e,!0)} with non-overridden value:\n${z(t,!0)}`);let r=e.kind===`InfiniteSet`?e.name:void 0,i=t.kind===`InfiniteSet`?t.name:void 0;if(r!==void 0&&r===i)return 0;if(r===`Nat`&&i===`Int`||r===`Int`&&i===`Nat`)return r===`Nat`?-1:1;throw new y(`Attempted to compare ${z(e,!0)} with the value\n${z(t,!0)}`)},Pt={kind:`InfiniteSet`,name:`Any`},Ft=e=>{throw new y(`Attempted to compare ANY with the value\n${z(e)}`)},It=(e,t)=>{if(e===t)return ft.isUsed&>(e),e===Pt?Ft(e):0;if(typeof e==`object`&&typeof t==`object`){let n=e.kind,r=t.kind;if(n===`Function`&&r===`Function`)return yt(e,t);if(n===`Set`&&r===`Set`)return bt(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&&St(e,t,!1),e.rank-t.rank;if(n===`ModelValue`||r===`ModelValue`)return St(e,t,!1),n===`ModelValue`?-1:1;if(e===Pt||t===Pt)return Ft(e===Pt?t:e);if(P(e)&&P(t)&&Mt(e,t))return Nt(e,t,`compare`);let i=P(e);if(i!==P(t))throw new y(`Attempted to compare ${ut(e)} ${z(e)} with ${ut(t)} ${z(t)}`);return i?bt(R(e),R(t)):yt(Dr(e),Dr(t))}if(typeof e==`number`&&typeof t==`number`)return e-t;if(typeof e==`string`&&typeof t==`string`)return At(e,t);if(typeof e==`boolean`&&typeof t==`boolean`)return e<t?-1:1;if(St(e,t,!1),I(e))return-1;if(I(t))return 1;throw new y(`Attempted to compare ${ut(e)} ${z(e)} with ${ut(t)} ${z(t)}`)},Lt=/* @__PURE__ */ new Map,Rt=e=>{let t=Lt.get(e);if(t)return t;let n={kind:`ModelValue`,name:e,type:e.length>2&&e[1]===`_`?e[0]:void 0,rank:kt(e)};return Lt.set(e,n),n},zt=e=>({kind:`Set`,elements:e,hash:0,fingerprint:0}),Bt=(e,t)=>({kind:`Function`,domain:e,range:t,hash:0,fingerprint:0,writtenKeys:void 0,functionClass:void 0}),Vt={isPresent:!1},Ht=(e,t)=>(t===`lambda`&&(Vt.isPresent=!0),t!==void 0&&(e.functionClass=t),e),Ut=e=>typeof e==`object`&&(e.kind===`Function`||e.kind===`LazyFunction`)?e.functionClass:void 0,Wt=e=>Ht(e,`lambda`),Gt=/* @__PURE__ */ new WeakSet,Kt=/* @__PURE__ */ new WeakSet,qt={isPresent:!1},Jt=e=>(qt.isPresent=!0,e),Yt=e=>{qt.isPresent&&typeof e==`object`&&Kt.add(e)},Xt=e=>{!Vt.isPresent&&!qt.isPresent||typeof e!=`object`||Gt.has(e)||(Gt.add(e),e.kind===`Function`?(e.functionClass===`lambda`&&(e.functionClass=void 0),e.domain.forEach(Xt),e.range.forEach(Xt)):e.kind===`Set`||e.kind===`MixedSet`?e.elements.forEach(Xt):P(e)&&L(e)&&(Yt(e),R(e).elements.forEach(Xt)))},Zt=(e,t)=>Ht(Bt(e,t),`record`),Qt=(e,t)=>{if(Yt(e),e===t)return ft.isUsed&>(e),e!==Pt||Ft(e);if(typeof e!=`object`||typeof t!=`object`)return typeof e!=typeof t&&((typeof e==`object`||typeof t==`object`)&&St(e,t,!0),It(e,t)===0);if((e.kind===`Set`||e.kind===`Function`)&&(t.kind===`Set`||t.kind===`Function`)&&e.hash!==0&&t.hash!==0&&e.hash!==t.hash)return!1;if(e.kind===`Function`&&t.kind===`Function`)return yt(e,t)===0;if(e.kind===`Set`&&t.kind===`Set`)return bt(e,t)===0;if(I(e)||I(t))return St(e,t,!0),I(e)&&I(t)&&e.name===t.name;if(e.kind===`Subset`&&t.kind===`Subset`)return Qt(e.base,t.base);if(e.kind===`FunctionSet`&&t.kind===`FunctionSet`){let n=pr(e.domain),r=pr(t.domain);if(n||r)return n===r;let i=pr(e.range),a=pr(t.range);return i||a?i===a:Qt(e.domain,t.domain)&&Qt(e.range,t.range)}if(e.kind===`RecordSet`&&t.kind===`RecordSet`){if(pr(e))return pr(t);if(pr(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]&&Qt(e[1],r[t][1]))}if(e.kind===`ProductSet`&&t.kind===`ProductSet`)return pr(e)?pr(t):!pr(t)&&e.factors.length===t.factors.length&&e.factors.every((e,n)=>Qt(e,t.factors[n]));let n=P(e)&&P(t)&&!(L(e)&&L(t));if(n&&Mt(e,t))return Nt(e,t,`check equality of`)===0;if(n){if(!jt(e)){let n=R(e);if(!jt(t))return bt(n,R(t))===0}return ri(e)===ri(t)}return It(e,t)===0},$t=e=>{let t=(e,t)=>e===t||e.length===t.length&&e.every((e,r)=>n(e,t[r])),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):ri(n)===ri(r);return n},en=$t(!1),tn=$t(!0),nn=e=>{let t=e.length===0?1:e[0];return typeof t==`number`&&e.every((e,n)=>e===t+n)?t:void 0},rn=e=>{if(!F(e))return;let t=Dr(e);return{domain:t.domain,range:t.range,low:nn(t.domain)}},an=e=>{if(!F(e))return;let t=Dr(e);return t.domain.every(e=>typeof e==`string`)?t:void 0},on=(e,t)=>{if(xt(e)!==void 0)throw new y(`Attempted to compare the typed model value ${z(e)} and the non-model value\n${z(t)}`);return 1},sn=(e,t)=>{if(xt(e)!==void 0)throw new y(`Attempted to check equality of the typed model value ${z(e)} and the non-model value\n${z(t)}`);return!1},cn=(e,t)=>{let n=xt(e);if(n===void 0)return I(t)?e.rank-t.rank:-1;if(!I(t))throw new y(`Attempted to compare the typed model value ${z(e)} and non-model value\n${z(t)}`);let r=xt(t);if(r!==void 0&&r!==n)throw new y(`Attempted to compare the differently-typed model values ${z(e)} and ${z(t)}`);return e.rank-t.rank},ln=(e,t)=>{let n=xt(e);if(n===void 0)return I(t)&&e.name===t.name;if(!I(t))throw new y(`Attempted to check equality of typed model value ${z(e)} and non-model value\n${z(t)}`);let r=xt(t);if(r!==void 0&&r!==n)throw new y(`Attempted to check equality of the differently-typed model values ${z(e)} and ${z(t)}`);return e.name===t.name},un={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`}},dn=(e,t,n)=>{let r=un[typeof e==`number`?`number`:typeof e==`string`?`string`:`boolean`];return`Attempted to ${n?r.equality:`compare`} ${r.name} ${z(e)} with ${r.other}:\n${z(t)}`},fn=(e,t,n)=>{let r=rn(n);if(!r){if(I(n))return on(n,t);throw new y(`Attempted to compare the function ${z(t)} with the value:\n${z(n)}`)}if(e.range.length!==r.range.length)return e.range.length-r.range.length;let i=()=>pn(e.range,r.range);if(e.low!==void 0&&e.range.length===0)return 0;if(e.low!==void 0&&r.low!==void 0)return e.low===r.low?i():e.low-r.low;let a=e.low??r.low;if(a===void 0)return pn(e.domain,r.domain)||i();let o=e.low===void 0?e.domain:r.domain;for(let t=0;t<o.length;t++){let n=o[t];if(typeof n!=`number`)throw new y(`Attempted to compare integer with non-integer${e.low===void 0?``:`:`}\n${z(n)}.`);let r=e.low===void 0?n-(a+t):a+t-n;if(r!==0)return r}return i()},pn=(e,t)=>{for(let n=0;n<e.length;n++){let r=yn(e[n],t[n]);if(r!==0)return r}return 0},mn=(e,t)=>{let n=Dr(e);if(e.kind===`Function`&&br(n)!==void 0){let r=F(t)?br(t):void 0;return r?n.range.length-r.length||pn(n.range,r):fn({...n,low:1},e,t)}if(Ut(e)===`record`){let r=an(t);if(!r){if(I(t))return on(t,e);throw new y(`Attempted to compare record:\n${z(e)}\nwith non-record\n${z(t)}`)}return n.domain.length-r.domain.length||pn(n.domain,r.domain)||pn(n.range,r.range)}return fn({...n,low:nn(n.domain)},e,t)},hn=e=>typeof e==`object`&&(e.kind===`Set`||e.kind===`MixedSet`),gn=(e,t)=>jt(e)||jt(t)||typeof t==`object`&&e.kind===t.kind&&(e.kind===`Interval`||e.kind===`Subset`||e.kind===`FunctionSet`||e.kind===`RecordSet`||e.kind===`ProductSet`),_n=(e,t)=>{let n=hn(t)?t:R(t);return{elements:R(e).elements,otherElements:R(n).elements}},vn=(e,t)=>{if(gn(e,t))return It(e,t);if(!hn(e))return vn(R(e),t);if(!P(t)){if(I(t))return on(t,e);throw new y(`Attempted to compare the set ${z(e)} with the value:\n${z(t)}`)}let n=_n(e,t);return n.elements.length-n.otherElements.length||pn(n.elements,n.otherElements)},yn=(e,t)=>{if(typeof e!=`object`){if(typeof t==typeof e)return It(e,t);if(I(t))return on(t,e);throw new y(dn(e,t,!1))}return e.kind===`ModelValue`?cn(e,t):F(e)?mn(e,t):vn(e,t)},bn=(e,t)=>e.every((e,n)=>wn(e,t[n])),xn=(e,t,n)=>{let r=rn(n);if(!r){if(I(n))return sn(n,t);throw new y(`Attempted to check equality of the function ${z(t)} with the value:\n${z(n)}`)}if(e.range.length!==r.range.length)return!1;if(e.low!==void 0&&r.low!==void 0)return(e.range.length===0||e.low===r.low)&&bn(e.range,r.range);let i=e.low??r.low;return i===void 0?bn(e.domain,r.domain)&&bn(e.range,r.range):(e.low===void 0?e.domain:r.domain).every((e,t)=>{if(typeof e!=`number`)throw new y(`Attempted to compare an integer with non-integer:\n${z(e)}.`);return e===i+t})&&bn(e.range,r.range)},Sn=(e,t)=>{let n=Dr(e);if(e.kind===`Function`&&br(n)!==void 0){let r=F(t)?br(t):void 0;return r?n.range.length===r.length&&bn(n.range,r):xn({...n,low:1},e,t)}if(Ut(e)===`record`){let r=an(t);if(!r){if(I(t))return sn(t,e);throw new y(`Attempted to check equality of record:\n${z(e)}\nwith non-record\n${z(t)}`)}return n.domain.length===r.domain.length&&bn(n.domain,r.domain)&&bn(n.range,r.range)}return xn({...n,low:nn(n.domain)},e,t)},Cn=(e,t)=>{if(gn(e,t))return Qt(e,t);if(!hn(e))return Cn(R(e),t);if(!P(t)){if(I(t))return sn(t,e);throw new y(`Attempted to check equality of the set ${z(e)} with the value:\n${z(t)}`)}let n=_n(e,t);return n.elements.length===n.otherElements.length&&bn(n.elements,n.otherElements)},wn=(e,t)=>{if(typeof e!=`object`){if(typeof t==typeof e)return e===t;if(I(t))return sn(t,e);throw new y(dn(e,t,!0))}return e.kind===`ModelValue`?ln(e,t):F(e)?Sn(e,t):Cn(e,t)},Tn=e=>{let t=[];for(let n of e){let e=Dn(n,t);e.isFound||t.splice(e.index,0,n)}return t},En=(e,t)=>{let n=Sr.sets;if(n===void 0)return t();n.push(e);let r=t();return n.pop(),r},Dn=(e,t)=>{let n={low:0,high:t.length};for(;n.low<n.high;){let r=n.low+(n.high-n.low>>1),i=En(e,()=>yn(e,t[r]));if(i===0)return{index:r,isFound:!0};i<0?n.high=r:n.low=r+1}return{index:n.low,isFound:!1}},On=(e,t)=>t.some(t=>En(t,()=>wn(t,e))),kn=/* @__PURE__ */ new WeakSet,An=e=>{typeof e==`object`&&(e.kind===`Set`&&(kn.add(e),e.elements.forEach(An)),e.kind===`Function`&&(e.domain.forEach(An),e.range.forEach(An)))},jn=(e,t)=>Cr(()=>Qt(e,t),()=>wn(e,t)),Mn=e=>{for(let t=1;t<e.length;t++)if(It(e[t-1],e[t])>=0)return!1;return!0},Nn=e=>{for(let t=1;t<e.length;t++)Yt(e[t]);if(e.length<2||Mn(e))return zt(e);let t=[...e].sort(It),n=[t[0]];for(let e=1;e<t.length;e++)It(n[n.length-1],t[e])!==0&&n.push(t[e]);return zt(n)},Pn=e=>Cr(()=>Nn(e),()=>({kind:`MixedSet`,elements:e})),Fn=zt([]),In=(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&&It(r[a],t)<0;)a++;a<r.length&&It(r[a],t)===0||i.push(t)}return i.length===n.length?e:zt(i)},Ln=(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&&It(r[a],t)<0;)a++;a<r.length&&It(r[a],t)===0&&i.push(t)}return i.length===n.length?e:zt(i)},Rn=(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=It(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=zt(i);if(e.hash!==0&&e.hash!==Ur){let t=e.hash,n=0;for(;n<a.length;n++){let e=Jr(a[n]);if(e===Ur)break;t=t+Vr(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+Qr(a[e])|0;c.fingerprint=t}return c},zn=e=>{let t=e.length<2?e:[...e].sort((e,t)=>It(e[0],t[0])),n=[],r=[];for(let e of t)n.length>0&&It(n[n.length-1],e[0])===0||(n.push(e[0]),r.push(e[1]));return Bt(n,r)},Bn=e=>{let t=zn(e);return t.domain.length!==e.length||e.some(e=>typeof e[0]!=`string`)||e.every((e,n)=>e[0]===t.domain[n])?t:pt(t,e.map(e=>e[0]))},Vn=[],Hn=[],Un=/* @__PURE__ */ new WeakMap,Wn=e=>{let t=Vn[e];if(t)return t;let n=Array.from({length:e},(e,t)=>t+1);return Vn[e]=n,n},Gn=e=>{if(gr(e),e.low===1&&e.high>=1)return Wn(e.high);let t=[];for(let n=e.low;n<=e.high;n++)t.push(n);return t},Kn=e=>e.length>0&&(e===Vn[e.length]||Un.has(e)),qn=e=>{let t=R(e).elements;return Kn(t)&&(typeof e!=`object`||e.kind!==`Interval`)?[...t]:t},Jn=e=>{let t=Hn[e];if(t)return t;let n={kind:`Interval`,low:1,high:e};return Hn[e]=n,n},Yn=e=>Ht(Bt(Wn(e.length),e),`tuple`),Xn=e=>Ht(zn(e),`record`),Zn=e=>P(e)&&!jt(e),Qn=(e,t=!1)=>`UNION(${z(e.base,t)})`,$n=(e,t=e=>R(e).elements)=>{if(!Zn(e.base))throw new y(`Attempted to enumerate the nonenumerable set:\n${Qn(e)}`);return t(e.base)},er=(e,t,n)=>{if(Zn(e))return e;throw new y(t===0?`Attempted to enumerate UNION(s), but some element of s is nonenumerable.`:`Attempted to enumerate the nonenumerable set:\n${z(e)}\nwhen enumerating:\n${Qn(n)}`)},L=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 L(e.base);case`FunctionSet`:return L(e.domain)&&L(e.range)||tr(e.domain)===!0||tr(e)===!0;case`RecordSet`:return e.sets.every(L)||tr(e)===!0;case`ProductSet`:return e.factors.every(L)||tr(e)===!0;case`Union`:return L(e.base)&&lr(e.base).every(L);case`SetOperation`:return e.operator===`\\cup`?L(e.left)&&L(e.right):e.operator===`\\cap`?L(e.left)||L(e.right):L(e.left);default:return!1}},tr=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=tr(e.domain);return t===void 0?void 0:!t&&tr(e.range)}case`RecordSet`:case`ProductSet`:for(let t of e.kind===`RecordSet`?e.sets:e.factors){let e=tr(t);if(e!==!1)return e}return!1;case`SetOperation`:case`FilteredSet`:case`Union`:return L(e)?R(e).elements.length===0:void 0;default:return}},nr=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},rr=(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},ir=e=>{if(typeof e!=`object`||e.kind!==`Subset`||jt(e.base))return;let t=R(e.base).elements;if(t.length<=30)return;let n={index:-1,indices:[0]},r=e=>{for(e<=n.index&&(n.index=-1);n.index<e;)n.index===-1?n.indices=[]:rr(n.indices,t.length)||(n.indices=Array.from({length:n.indices.length+1},(e,t)=>t)),n.index++;return zt(n.indices.map(e=>t[e]))},i=2**t.length,a=e=>typeof e==`string`&&/^\d+$/.test(e)&&Number(e)<i;return new Proxy([],{get:(e,t,n)=>t===`length`?i:a(t)?r(Number(t)):Reflect.get(e,t,n),has:(e,t)=>a(t)||Reflect.has(e,t)})},ar=e=>{let t=[];for(let n=0;n<=e.length;n++){let r=Array.from({length:n},(e,t)=>t);do t.push(zt(r.map(t=>e[t])));while(rr(r,e.length))}return t},or=(e,t,n)=>{let r=[];for(let i=0;i<e.length;i++){let a=e[i];if(jt(a))throw new y(n(a,i));let o=t(a);if(o.length===0)return[[]];r.push(o)}return r},sr=(e,t=e=>R(e).elements)=>{if(typeof e!=`object`)throw new y(`Expected a set but found ${z(e)}`);switch(e.kind){case`Set`:return e.elements;case`MixedSet`:return Tn(e.elements);case`Interval`:{let t=Gn(e);return t!==Vn[t.length]&&Un.set(t,e),t}case`Subset`:{if(gr(e.base)===0)return ar([]);if(!P(e.base))throw new y(`Attempted to compute the value of an expression of form\nSUBSET S, but S is a non-enumerable value:\n${N(z(e.base))}`);let t=R(e.base).elements;if(t.length>30)throw new y(hr(e));return ar(t)}case`FunctionSet`:{if(!Tt.is174&&pr(e))return[];if(jt(e.domain))throw new y(`Attempted to enumerate a set of the form [D -> R],but the domain D:\n${z(e.domain)}\ncannot be enumerated.`);let n=qn(e.domain);if((n.length>0||Tt.is174)&&jt(e.range))throw new y(`Attempted to enumerate a set of the form [D -> R],but the range R:\n${z(e.range)}\ncannot be enumerated.`);let r=n.length===0?[]:t(e.range);return nr(n.map(()=>r)).map(e=>Bt(n,e))}case`RecordSet`:{if(!Tt.is174&&pr(e))return[];let n=or(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${z(t)}`);return nr(n).map(t=>Xn(e.names.map((e,n)=>[e,t[n]])))}case`ProductSet`:{if(!Tt.is174&&pr(e))return[];let n=or(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${z(e)}`);return nr(n).map(Yn)}case`FilteredSet`:if(!P(e.base)||jt(e.base))throw new y(`Attempted to enumerate { x \\in S : p(x) } when S:\n${z(e.base)}\nis not enumerable`);return R(e.base).elements.filter(e.test);case`Union`:{let t=$n(e).flatMap((t,n)=>R(er(t,n,e)).elements);return R(Pn(t)).elements}case`SetOperation`:{if(e.operator===`\\cup`&&(!Zn(e.left)||!Zn(e.right)))throw new y(`Attempted to enumerate S \\cup T when S:\n${z(e.left)}\nand T:\n${z(e.right)}\nare not both enumerable`);if(e.operator===`\\cap`&&!Zn(e.left)&&!Zn(e.right))throw new y(`Attempted to enumerate S \\cap T when neither S:\n${z(e.left)}\nnor T:\n${z(e.right)}\nis enumerable`);if(e.operator===`\\`&&!Zn(e.left))throw new y(`Attempted to enumerate S \\ T when S:\n${z(e.left)}\nis not enumerable.`);if(e.operator===`\\cup`)return Rn(R(e.left),R(e.right)).elements;let t=e.operator===`\\`||Zn(e.left),n=t?e.left:e.right,r=t?e.right:e.left;return R(n).elements.filter(t=>wr(t,r)===(e.operator===`\\cap`))}case`InfiniteSet`:case`SequenceSet`:throw new y(`Attempted to enumerate the non-enumerable set ${z(e)}`);default:throw new y(`Expected a set but found ${z(e)}`)}},cr=/* @__PURE__ */ new WeakMap,R=e=>{if(typeof e==`object`&&e.kind===`Set`)return e;if(typeof e==`object`&&e.kind===`Interval`)return zt(sr(e));let t=typeof e==`object`?cr.get(e):void 0;if(t)return t;let n=Sr.sets;n?.push(e);let r=sr(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`)?zt(r):Nn(r);return typeof e==`object`&&cr.set(e,i),i},lr=e=>{if(typeof e!=`object`||Kt.has(e))return R(e).elements;let t=Sr.sets;t?.push(e);let n=fr(e);return t?.pop(),n},ur=e=>e.kind===`ProductSet`?e.factors:e.kind===`RecordSet`?e.sets:e.kind===`FunctionSet`?[e.range]:void 0,dr=e=>typeof e!=`object`||Kt.has(e)?!1:e.kind===`Union`?!0:e.kind===`FilteredSet`?dr(e.base):e.kind===`SetOperation`?e.operator===`\\cup`||dr(e.left)||dr(e.right):ur(e)?.some(dr)??!1,fr=e=>{if(e.kind===`Union`)return $n(e,lr).flatMap((t,n)=>lr(er(t,n,e)));if(e.kind===`FilteredSet`&&!jt(e.base))return lr(e.base).filter(e.test);if(ur(e)?.some(dr))return sr(e,lr);if(e.kind!==`SetOperation`)return R(e).elements;if(e.operator===`\\cup`)return!Zn(e.left)||!Zn(e.right)?R(e).elements:[...lr(e.left),...lr(e.right)];let t=e.operator===`\\`||Zn(e.left),n=t?e.left:e.right,r=t?e.right:e.left;return Zn(n)?lr(n).filter(t=>wr(t,r)===(e.operator===`\\cap`)):R(e).elements},pr=e=>{if(typeof e!=`object`||!P(e))throw new y(`Shouldn't call isEmpty() on value ${z(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 y(`Shouldn't call isEmpty() on value ANY`);return!1;case`Subset`:case`SequenceSet`:return!1;case`ProductSet`:return e.factors.some(pr);case`RecordSet`:return e.sets.some(pr);case`FunctionSet`:return!pr(e.domain)&&pr(e.range);case`Union`:return $n(e).every((t,n)=>pr(er(t,n,e)));default:return R(e).elements.length===0}},mr=(e,t,n)=>e.reduce((e,r)=>{let i=e*gr(r,t);if(i>2147483647)throw new y(n());return i},1),hr=e=>`Overflow when computing the number of elements in:\n${z(e)}`,gr=(e,t)=>{if(typeof e!=`object`)throw new y(`Attempted to compute the number of elements in the ${typeof e==`number`?`integer`:typeof e==`string`?`string`:`boolean`} ${z(e)}.`);switch(e.kind){case`ModelValue`:throw new y(`Attempted to compute the number of elements in the model value ${z(e)}.`);case`Function`:return e.domain.length;case`LazyFunction`:return gr(e.domain,t);case`Interval`:{let t=Math.max(0,e.high-e.low+1);if(t>2147483647)throw new y(`Size of interval value exceeds the maximum representable size (32bits): ${e.low}..${e.high}.`);return t}case`InfiniteSet`:case`SequenceSet`:throw new y(`Attempted to compute the number of elements in the overridden value ${z(e)}.`);case`Subset`:{let n=gr(e.base,t);if(n>=31)throw new y(hr(e));return 2**n}case`FunctionSet`:{if(t!==`1.7.4`){if(pr(e.domain))return 1;if(pr(e.range))return 0;if(gr(e.range,t)===1)return 1}let n=gr(e.domain,t),r=gr(e.range,t);if(r<=1)return n===0?1:r;let i={value:1};for(let t=0;t<n;t++)if(i.value*=r,i.value>2147483647)throw new y(hr(e));return i.value}case`RecordSet`:return t!==`1.7.4`&&pr(e)?0:mr(e.sets,t,()=>hr(e));case`ProductSet`:return t!==`1.7.4`&&pr(e)?0:mr(e.factors,t,()=>`Overflow when computing the number of elements in ${z(e)}`);default:return Yt(e),R(e).elements.length}},_r=e=>`Attempted to check if the set ${z(e)}is finite.`,vr=e=>{if(typeof e!=`object`||e.kind===`ModelValue`)throw new y(`Attempted to check if the ${ut(e)} ${z(e)} is a finite set.`);switch(e.kind){case`Set`:case`MixedSet`:case`Interval`:case`Function`:return!0;case`LazyFunction`:throw new y(`Attempted to check if the function:\n${z(e)}\nis a finite set.`);case`InfiniteSet`:return!1;case`SequenceSet`:return vr(e.base)&&pr(e.base);case`Subset`:return vr(e.base);case`FunctionSet`:{let t=vr(e.domain);if(t&&pr(e.domain))return!0;let n=vr(e.range);return n&&pr(e.range)?!0:n&&(t||gr(e.range)===1)}case`RecordSet`:case`ProductSet`:{let t=e.kind===`RecordSet`?e.sets:e.factors,n={isAllFinite:!0};for(let e of t)if(!vr(e))n.isAllFinite=!1;else if(pr(e))return!0;return n.isAllFinite}case`Union`:if(!Zn(e.base))throw new y(`Attempted to check if the nonenumerable set:\n${Qn(e)}\nis a finite set.`);return R(e.base).elements.every(vr);case`SetOperation`:if(e.operator===`\\cup`)return vr(e.left)&&vr(e.right);if(e.operator===`\\cap`){if(!vr(e.left)&&!vr(e.right))throw new y(_r(e));return!0}if(vr(e.left))return!0;if(!vr(e.right))throw new y(_r(e));return!1;case`FilteredSet`:if(!vr(e.base))throw new y(`Attempted to check if expression of form {x \\in S : p(x)} is a finite set, but cannot check if S:\n${z(e.base)}\nis finite.`);return!0}},yr=(e,t,n=It)=>{let r={low:0,high:e.length-1};for(;r.low<=r.high;){let i=r.low+r.high>>1,a=n(e[i],t);if(a===0)return i;a<0?r.low=i+1:r.high=i-1}return-1},br=e=>{if(typeof e!=`object`||!F(e))return;let t=Dr(e);return t.domain.every((e,t)=>e===t+1)?t.range:void 0},xr=(e,t)=>{let n=`Attempted to check if the value:\n${z(e)}\nis an element of the`;if(!F(t))return`${n} ${ut(t)} ${z(t)}`;let r=Ut(t);return r===`record`?`Attempted to check if element:\n${z(e)}\nis in the record:\n${z(t)}`:r===`tuple`?`Attempted to check set membership in a tuple value.`:`${n} function ${z(t)}`},Sr={sets:void 0},Cr=(e,t)=>{let n=Sr.sets,r=Sr.callStack,i=n?.length??0,a=r&&{...r,length:r.expressions.length};try{return e()}catch(e){if(!(e instanceof y))throw e;return n&&(n.length=i),r&&a&&(r.expressions.length=a.length,r.isFrozen=a.isFrozen,r.fingerprint=a.fingerprint),t(e)}},wr=(e,t)=>{let n=Sr.sets;if(n===void 0)return Tr(e,t);n.push(t);let r=Tr(e,t);return n.pop(),r},Tr=(e,t)=>{if(!P(t))throw new y(xr(e,t));switch(t.kind){case`Set`:return Yt(e),Cr(()=>yr(t.elements,e)!==-1,()=>kn.has(t)?Dn(e,t.elements).isFound:On(e,t.elements));case`MixedSet`:return On(e,t.elements);case`Interval`:if(typeof e==`number`)return e>=t.low&&e<=t.high;if(t.low<=t.high&&!I(e))throw new y(`Attempted to check if the value:\n${z(e)}\nis in the integer interval ${z(t)}`);return!1;case`InfiniteSet`:if(t.name===`Any`)return!0;if(I(e))return!1;if(!(t.name===`STRING`?typeof e==`string`:typeof e==`number`))throw new y(`Attempted to check if the value:\n${z(e)}\nis an element of ${t.name}.`);return t.name!==`Nat`||typeof e==`number`&&e>=0;case`Subset`:if(!P(e)||jt(e))throw new y(`Attempted to check if the non-enumerable value\n${N(z(e))}\nis element of\n${N(z(t))}`);return R(e).elements.every(e=>wr(e,t.base));case`FunctionSet`:{if(!F(e)){if(I(e))return!1;throw new y(`Attempted to check if \n${z(e)}\nwhich is not a TLC function value, is in the set of functions:\n${N(z(t))}`)}let n=Dr(e),r=nn(n.domain);return(r===void 0?jn(t.domain,zt(n.domain)):jn({kind:`Interval`,low:r,high:r+n.domain.length-1},t.domain))&&n.range.every(e=>wr(e,t.range))}case`RecordSet`:{let n=F(e)?Dr(e):void 0;if(!n||!_t(n.domain)){if(I(e))return!1;throw new y(`Attempted to check if non-record\n${z(e)}\nis in the set of records:\n${z(t)}`)}return n.domain.length===t.names.length&&t.names.every((e,r)=>{let i=yr(n.domain,e);return i!==-1&&wr(n.range[i],t.sets[r])})}case`ProductSet`:{let n=F(e)?br(e):void 0;if(n===void 0){if(F(e)&&Dr(e).domain.every(e=>typeof e==`number`)||I(e))return!1;throw new y(`Attempted to check if non-tuple\n${z(e)}\nis in the set of tuples:\n${z(t)}`)}return n.length===t.factors.length&&n.every((e,n)=>wr(e,t.factors[n]))}case`FilteredSet`:return wr(e,t.base)&&t.test(e);case`Union`:if(!Zn(t.base))throw new y(`Attempted to check if:\n ${z(e)}\nis an element of the non-enumerable set:\n ${Qn(t)}`);return R(t.base).elements.some(t=>wr(e,t));case`SetOperation`:return t.operator===`\\cup`?wr(e,t.left)||wr(e,t.right):wr(e,t.left)&&wr(e,t.right)===(t.operator===`\\cap`);case`SequenceSet`:{let n=br(e);if(n===void 0){if(I(e))return!1;throw new y(`Attempted to check if the value:\n${N(z(e))}\nis an element of ${N(z(t))}.`)}return n.every(e=>wr(e,t.base))}default:throw new y(xr(e,t))}},Er=(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?wr(e,n):e.range.every((e,r)=>Er(e,t.range[r],n.range)),Dr=e=>{if(typeof e==`object`&&e.kind===`Function`)return e;if(typeof e==`object`&&e.kind===`LazyFunction`){L(e.domain)||gr(e.domain);let t=qn(e.domain);return Ht(Bt(t,t.map(t=>e.apply(t))),Ut(e))}throw new y(`Expected a function but found ${z(e)}`)},Or=(e,t,n)=>{let r=N(z(e)),i=N(z(t)),a=n===`1.7.4`;switch(Ut(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.`}},kr=(e,t)=>{if(!Tt.is174)return Or(e,t);let n=N(z(t));return Ut(e)===`tuple`?`Attempted to apply tuple to a non-integer argument ${n}.`:`Attempted to apply record to a non-string argument ${n}.`},Ar=(e,t)=>{let n=e[0];if(typeof t==`number`&&typeof n==`number`){let r=t-n;if(e[r]===t)return r}if(e.length<=8){for(let n=0;n<e.length;n++)if(e[n]===t)return n}return yr(e,t)},jr=e=>new y(`Attempted to apply function with integer domain to the non-integer argument ${N(z(e))}`),Mr=(e,t,n)=>{let r=e.domain;if(typeof t!=typeof r[0]){let i=Ut(e),a=i===`tuple`?`number`:i===`record`?`string`:void 0;if(a!==void 0&&typeof t!==a)throw new y(n(e,t));if(a===void 0&&!Tt.is174&&Kn(r))throw jr(t)}return Cr(()=>Ar(r,t),e=>{throw Tt.is174||r.length<32?r.forEach(e=>wn(e,t)):yr(r,t,yn),e})},Nr=(e,t,n)=>{if(typeof e==`object`&&e.kind===`LazyFunction`){if(!wr(t,e.domain))throw new y(Ut(e)===`lambda`?Or(e,t):`Attempted to apply a function to ${z(t)}, which is not in its domain`);return e.apply(t)}if(typeof e!=`object`||e.kind!==`Function`)throw new y(`Attempted to apply ${z(e)}, which is not a function`);let r=n??Or,i=Mr(e,t,r);if(i===-1)throw new y(r(e,t));return e.range[i]},Pr=e=>Kn(e)?Un.get(e)??Jn(e.length):void 0,Fr=e=>{if(typeof e==`object`&&e.kind===`LazyFunction`)return e.domain;let t=Dr(e).domain;return Pr(t)??zt(t)},Ir=(e,t,n,r=!1)=>{if(typeof e==`object`&&e.kind===`LazyFunction`&&(r||!L(e.domain))){if(!wr(t,e.domain))return e;let r=n(e.apply(t));return Ht({kind:`LazyFunction`,domain:e.domain,apply:n=>jn(t,n)?r:e.apply(n),source:e.source},Ut(e))}if(!F(e))throw new y(`Attempted to apply EXCEPT construct to the value ${N(z(e))}.`);let i=Dr(e),a=Mr(i,t,kr);if(a===-1)return i;let o=[...i.range],s=i.range[a],c=n(s);o[a]=c;let l=Ht(Bt(i.domain,o),Ut(i));if(l.writtenKeys=i.writtenKeys,i.hash!==0&&i.hash!==Ur){let e=Jr(c);if(e!==Ur){let t=Jr(i.domain[a]);l.hash=s===c?i.hash:i.hash-Hr(t,Jr(s))+Hr(t,e)|0}}if(i.fingerprint!==0){let e=i.domain[a];l.fingerprint=s===c?i.fingerprint:i.fingerprint-$r(e,s)+$r(e,c)|0}return l},Lr=/* @__PURE__ */ new WeakMap,Rr=e=>{let t=Math.imul(e^e>>>16,2246822507),n=Math.imul(t^t>>>13,3266489909);return n^n>>>16},zr=(e,t)=>Math.imul(e^t,16777619),Br=e=>{let t=2166136261;for(let n=0;n<e.length;n++)t=Math.imul(t^e.charCodeAt(n),16777619);return Rr(t)},Vr=e=>Rr(e+2654435769|0),Hr=(e,t)=>Rr(Math.imul(e,668265261)+t|0),Ur=795548749,Wr=e=>{if(e.kind===`ModelValue`)return Rr(zr(Br(e.name),109));if(P(e)){if(!L(e))return Ur;let t=R(e).elements,n=1940243425;for(let e=0;e<t.length;e++){let r=Jr(t[e]);if(r===Ur)return Ur;n=n+Vr(r)|0}return n}if(e.kind===`LazyFunction`&&!L(e.domain))return Ur;let t=Dr(e),n=1725019383;for(let e=0;e<t.domain.length;e++){let r=Jr(t.domain[e]),i=Jr(t.range[e]);if(r===Ur||i===Ur)return Ur;n=n+Hr(r,i)|0}return n},Gr=e=>{if(typeof e!=`object`||e.kind===`ModelValue`)return;if(e.kind===`InfiniteSet`||e.kind===`SequenceSet`)throw new y(`TLC has found a state in which the value of a variable contains ${z(e)}`);if(P(e)){R(e).elements.forEach(Gr);return}let t=Dr(e);t.domain.forEach(Gr),t.range.forEach(Gr)},Kr=e=>{if(typeof e==`object`&&e.kind!==`ModelValue`)try{Jr(e)===Ur&&Gr(e);return}catch(e){if(!(e instanceof y))throw e;return e}},qr=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[]}},Jr=e=>{if(typeof e==`number`)return Rr(e^1540483477);if(typeof e==`boolean`)return e?729683222:682545830;if(typeof e==`string`)return Br(e);if(e.kind===`Set`||e.kind===`Function`)return e.hash===0&&(e.hash=Wr(e)),e.hash;let t=Lr.get(e);if(t!==void 0)return t;let n=Wr(e);return Lr.set(e,n),n},Yr=/* @__PURE__ */ new WeakMap,Xr=e=>{let t=Math.imul(e^e>>>15,739982445),n=Math.imul(t^t>>>12,695872825);return n^n>>>15},Zr=e=>{let t=2538058380;for(let n=0;n<e.length;n++)t=Math.imul(t^e.charCodeAt(n),1540483477);return Xr(t)},Qr=e=>Xr(ti(e)+2135587861|0),$r=(e,t)=>Xr(Math.imul(ti(e),374761393)+ti(t)|0),ei=e=>{if(e.kind===`ModelValue`)return Xr(Zr(e.name)^60);if(P(e)){if(!L(e))return Zr(ri(e));let t=R(e).elements,n=461845907;for(let e=0;e<t.length;e++)n=n+Qr(t[e])|0;return n}let t=Dr(e),n=1291169091;for(let e=0;e<t.domain.length;e++)n=n+$r(t.domain[e],t.range[e])|0;return n},ti=e=>{if(typeof e==`number`)return Xr(e^1759714724);if(typeof e==`boolean`)return e?1000000007:521288629;if(typeof e==`string`)return Zr(e);if(e.kind===`Set`||e.kind===`Function`)return e.fingerprint===0&&(e.fingerprint=ei(e)),e.fingerprint;let t=Yr.get(e);if(t!==void 0)return t;let n=ei(e);return Yr.set(e,n),n},ni=/* @__PURE__ */ new WeakMap,ri=e=>{if(typeof e==`boolean`)return e?`T`:`F`;if(typeof e==`number`)return String(e);if(typeof e==`string`)return JSON.stringify(e);let t=ni.get(e);if(t!==void 0)return t;let n=ii(e);return ni.set(e,n),n},ii=e=>{if(e.kind===`ModelValue`)return`@${e.name}`;if(e.kind===`InfiniteSet`)return`<${e.name}>`;if(e.kind===`SequenceSet`)return`<Seq ${ri(e.base)}>`;if(e.kind===`FilteredSet`&&!L(e))throw new y(`Attempted to compare the non-enumerable set ${z(e)} with another value`);if(P(e))return L(e)?`{${R(e).elements.map(ri).join(`,`)}}`:`<${e.kind} ${z(e)}>`;let t=Dr(e);return`(${t.domain.map((e,n)=>`${ri(e)}:${ri(t.range[n])}`).join(`,`)})`},ai=e=>`"${e.replace(/\\/g,`\\\\`).replace(/"/g,`\\"`).replace(/\n/g,`\\n`).replace(/\t/g,`\\t`)}"`,oi=e=>e.reduce((e,t)=>e===0?0:e*gr(t),1),si=e=>{if(e.kind===`Subset`)return gr(e.base)<=6?R(e):void 0;if(e.kind===`SetOperation`||e.kind===`FilteredSet`||e.kind===`Union`)return R(e);if(e.kind===`FunctionSet`&&L(e.domain)&&gr(e.domain)===0)return zt([Bt([],[])]);let t=e.kind===`FunctionSet`?gr(e.range)**gr(e.domain):oi(e.kind===`RecordSet`?e.sets:e.factors);return t===0?Fn:t<=1999?R(e):void 0},ci=(e,t)=>{if(t)return si(e);if(L(e))try{return si(e)}catch(e){if(e instanceof y)return;throw e}},li=(e,t)=>{let n=e=>z(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 Qn(e,t)}},ui=e=>/^[\p{L}\p{Nd}_]*$/u.test(e)&&/\p{L}/u.test(e)&&(e.length<4||!/^[WS]F_/.test(e)),di=e=>{if(L(e.domain))try{return Dr(e)}catch(e){if(e instanceof y)return;throw e}},z=(e,t=!1,n=!1)=>{let r=e=>z(e,t,n);if(typeof e==`boolean`)return e?`TRUE`:`FALSE`;if(typeof e==`number`)return String(e);if(typeof e==`string`)return ai(e);switch(e.kind){case`ModelValue`:return e.name;case`Set`:return`{${e.elements.map(r).join(`, `)}}`;case`MixedSet`:return r(R(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=ci(e,t);return n?r(n):li(e,t)}case`SequenceSet`:return`Seq(${r(e.base)})`;case`Function`:case`LazyFunction`:{let i=e.kind===`LazyFunction`?di(e):e;if(i===void 0){let t=e.kind===`LazyFunction`?e.source:void 0;return t?`[${t.parameters.map(e=>`${e.name} \\in ${z(e.domain)}`).join(`, `)} |-> <expression ${t.body}>]`:`<function>`}if(i.domain.length===0&&Tt.is174&&Ut(e)!==`tuple`)return`<< >>`;let a=r=>z(r,t,n&&Ut(e)!==`lambda`);return i.domain.every((e,t)=>e===t+1)?`<<${i.range.map(a).join(`, `)}>>`:Ut(e)===`record`||i.domain.every(e=>typeof e==`string`&&ui(e))?`[${(n||i.hash!==0||i.fingerprint!==0?i.domain.map((e,t)=>[e,i.range[t]]):mt(i)).map(e=>`${String(e[0])} |-> ${a(e[1])}`).join(`, `)}]`:`(${i.domain.map((e,t)=>`${r(e)} :> ${a(i.range[t])}`).join(` @@ `)})`}}},fi=e=>{let t=Object.entries(e);return t.map(([e,n])=>`${t.length===1?``:`/\\ `}${e} = ${N(z(n))}\n`).join(``)},pi=(e,t)=>{for(let n=0;n<e.length;n++)e[n]=t(e[n])},mi=()=>{let e=/* @__PURE__ */ new Map,t=n=>{if(typeof n!=`object`||n.kind!==`Set`&&n.kind!==`Function`)return n;let r=Jr(n),i=e.get(r);if(i!==void 0&&!Array.isArray(i)&&(i===n||tn(i,n)))return i;if(Array.isArray(i)){for(let e=0;e<i.length;e++)if(i[e]===n||tn(i[e],n))return i[e]}return n.kind===`Set`?pi(n.elements,t):(pi(n.domain,t),pi(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}},hi=e=>{switch(e.kind){case`Number`:case`Decimal`:case`String`:case`Identifier`:case`OperatorReference`:case`ExceptAt`:return[];case`Apply`:return e.args;case`Lambda`:return[e.body];case`And`:case`Or`:return e.operands;case`Prime`:case`Unchanged`:case`Enabled`:case`Always`:case`Eventually`:return[e.expression];case`If`:return[e.condition,e.consequent,e.alternative];case`Case`:return[...e.arms.flatMap(e=>[e.condition,e.body]),...e.other?[e.other]:[]];case`Let`:return[...e.definitions.flatMap(e=>e.kind===`Function`?[...e.bounds.map(e=>e.set),e.body]:[e.body]),e.body];case`Forall`:case`Exists`:return[...e.bounds.map(e=>e.set),e.body];case`UnboundedQuantifier`:return[e.body];case`Choose`:return[...e.set?[e.set]:[],e.body];case`SetEnumeration`:case`Tuple`:return e.elements;case`SetFilter`:return[e.bound.set,e.predicate];case`SetMap`:return[e.expression,...e.bounds.map(e=>e.set)];case`FunctionConstruction`:return[...e.bounds.map(e=>e.set),e.body];case`FunctionSet`:return[e.domain,e.range];case`Record`:case`RecordSet`:return e.fields.map(e=>e.value);case`Except`:return[e.function,...e.updates.flatMap(e=>[...e.path.flatMap(e=>e.kind===`Index`?e.args:[]),e.value])];case`FunctionApplication`:return[e.function,...e.args];case`Bracket`:return e.args;case`FieldAccess`:return[e.record];case`Product`:return e.factors;case`BoxAction`:case`AngleAction`:return[e.action,e.subscript];case`WeakFairness`:case`StrongFairness`:return[e.subscript,e.action];case`Label`:return[e.body];case`Subexpression`:return e.selectors.flatMap(e=>`args`in e?e.args:[])}},B=e=>(e.kind===`Identifier`||e.kind===`Apply`)&&e.resolution?.kind===`Local`,gi=/* @__PURE__ */ new Set(/* @__PURE__ */ `=,#,~,<=>,/\\,\\/,=>,\\in,\\notin,\\subseteq,\\cup,\\cap,\\,SUBSET,UNION,DOMAIN,+,-,*,^,\\div,%,..,Seq,IsFiniteSet,RandomElement`.split(`,`)),_i=(e,t)=>gi.has(e)?new y(t):new S(t),vi=e=>typeof e==`object`&&e.kind===`Operator`,V=(e,t,n)=>{let r=e[t];if(r===void 0||vi(r))throw _i(n,`${n} expects a value as argument ${t+1}`);return r},yi=(e,t,n)=>{let r=V(e,t,n);if(typeof r!=`number`)throw _i(n,`${n} expects an integer but received ${z(r)}`);return r},bi=(e,t,n)=>{let r=V(e,t,n);if(typeof r!=`boolean`)throw _i(n,`${n} expects a boolean but received ${z(r)}`);return r},xi=(e,t,n)=>{let r=V(e,t,n);if(!P(r))throw _i(n,`${n} expects a set but received ${z(r)}`);return r},Si=(e,t,n)=>{let r=xi(e,t,n);if(!L(r))throw _i(n,`${n} cannot enumerate the non-enumerable set ${z(r)}`);return r},Ci=(e,t,n)=>R(Si(e,t,n)),wi=(e,t,n)=>Ci(e,t,n).elements,Ti=(e,t,n)=>{let r=V(e,t,n),i=br(r);if(!i)throw _i(n,`${n} expects a sequence but received ${z(r)}`);return i},Ei=(e,t,n)=>{let r=V(e,t,n);if(!F(r))throw _i(n,`${n} expects a function but received ${z(r)}`);return Dr(r)},Di=(e,t,n)=>{let r=e[t];if(r===void 0||!vi(r))throw _i(n,`${n} expects an operator as argument ${t+1}`);return r},Oi=(e,t)=>({kind:`Builtin`,name:e,arity:0,evaluate:()=>t,evaluateUnary:void 0,evaluateBinary:void 0}),H=(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}),ki=(e,t,n)=>({kind:`Builtin`,name:e,arity:t,evaluate:n,evaluateUnary:void 0,evaluateBinary:void 0}),Ai=(e,t,n)=>({kind:`Builtin`,name:e,arity:t,evaluate:n,evaluateUnary:void 0,evaluateBinary:void 0,isStateLevel:!0}),ji=(e,t)=>({kind:`Builtin`,name:e,arity:2,evaluate:n=>t(V(n,0,e),V(n,1,e)),evaluateUnary:void 0,evaluateBinary:t}),Mi=e=>e>2147483647||e<-2147483648,Ni=e=>new S(`Overflow when computing ${e}`),Pi={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`},Fi={"\\cup":`SetCupValue`,"\\cap":`SetCapValue`,"\\":`SetDiffValue`},Ii={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`},Li={lambda:`FcnLambdaValue`,tuple:`TupleValue`,record:`RecordValue`},Ri=e=>{if(typeof e==`number`)return`IntValue`;if(typeof e==`string`)return`StringValue`;if(typeof e==`boolean`)return`BoolValue`;if(e.kind===`SetOperation`)return Fi[e.operator];if(e.kind!==`Function`)return Pi[e.kind];let t=Ut(e);return t===void 0?`FcnRcdValue`:Li[t]},zi=e=>Ii[Ri(e)],Bi=(e,t)=>new y(`Attempted to apply the operator overridden by the Java method\n${e},\nbut it produced the following error:\n${t}`),Vi=(e,t)=>{let n=n=>(...r)=>{let i=Sr.sets?.length??0;try{return n(...r)}catch(n){throw n instanceof y&&(e.isLazy===!0||!(n instanceof S))?(Sr.sets&&(Sr.sets.length=i),Bi(t,n.message)):n}};return{...e,evaluate:n(e.evaluate),evaluateUnary:e.evaluateUnary&&n(e.evaluateUnary),evaluateBinary:e.evaluateBinary&&n(e.evaluateBinary)}},Hi=(e,t)=>{if(typeof e!=`number`)throw Bi(t,`Cannot cast tlc2.value.impl.${Ri(e)} to tlc2.value.impl.IntValue`);return e},Ui=(e,t,n,r)=>`public static tlc2.value.impl.${n} tlc2.module.${e}.${t}(${Array.from({length:r},()=>`tlc2.value.impl.IntValue`).join(`,`)})`,Wi=(e,t,n,r)=>{let i=Ui(e,n,`IntValue`,2);return ji(t,(e,n)=>{let a=Hi(e,i),o=Hi(n,i),s=r(a,o);if(Mi(s))throw Ni(`${a}${t}${o}`);return s})},Gi=(e,t,n)=>{if(typeof e!=`number`)throw new S(`The ${t} argument of ${n} should be an integer, but instead it is:\n${z(e)}`);return e},Ki=(e,t,n=e)=>ji(e,(e,r)=>t(Gi(e,`first`,n),Gi(r,`second`,n))),qi=(e,t,n)=>({...Ai(e,t,n),isLazy:!0}),Ji=(e,t,n)=>{let r=Di(e,t,n);return()=>r.call([])},Yi=/* @__PURE__ */ new Set([`Apply`,`And`,`Or`,`If`,`FunctionApplication`,`FieldAccess`,`Record`,`Tuple`,`SetEnumeration`,`Prime`,`Unchanged`,`Forall`,`Exists`]),Xi=()=>({bool:pl,condition:(e,t)=>{if(typeof e!=`boolean`)throw $c(t,e);return e},junct:(e,t,n)=>{if(typeof e!=`boolean`)throw el(t,n,e);return e},apply:Nr,expectFunction:ul,tuple:Yn,set:Pn,record:Zt,writtenRecord:ht,equal:Qt,enumerate:wl,unassigned:(e,t)=>{throw md(e,t)},primeOutsideAction:e=>{throw gd(e)},prime:e=>({environment:e.environment,scope:e.scope,state:e.next,next:void 0,isKeepLazy:e.isKeepLazy}),keepLazyContext:dl,extend:(e,t,n)=>({environment:e.environment,scope:t.reduce((e,t,r)=>cl(e,t,n[r]),e.scope),state:e.state,next:e.next,isKeepLazy:e.isKeepLazy})}),Zi={value:void 0},Qi=(e,t)=>(e.references.push(t),`reference${e.references.length-1}`),$i=e=>`local${e.counter++}`,ea=(e,t=/* @__PURE__ */ new Set)=>(e.kind===`Identifier`&&t.add(e.name),e.kind===`Apply`&&t.add(e.operator),hi(e).forEach(e=>ea(e,t)),t),ta=(e,t,n)=>{let r=Qi(e,Vu(t,e.environment)),i=ea(t),a=[...n.locals].filter(([e])=>i.has(e));if(a.length===0)return`${r}(${n.context})`;let o=Qi(e,a.map(([e])=>e));return`${r}(extend(${n.context}, ${o}, [${a.map(([,e])=>e).join(`, `)}]))`},na=(e,t,n)=>{let r=t.kind===`Forall`,i=JSON.stringify(r?`the body of \\A`:`the body of \\E`),a=`quantifier${e.counter++}`,o=[...n.locals.values()],s={context:`context`,state:`state`,next:`next`,isPrimed:!1,locals:new Map(n.locals)},c=t.bounds.map(()=>$i(e)),l=t.bounds.map((t,n)=>`const ${c[n]} = enumerate(${aa(e,t.set,s)}, ${Qi(e,t.set)}, ${JSON.stringify(e.environment.runtime.version)});`),u=t.bounds.map(t=>{let n=$i(e);return t.pattern.kind===`Name`&&s.locals.set(t.pattern.name,n),n}),d=`if (bool(${aa(e,t.body,s)}, ${i}) !== ${r}) return ${!r};`,f=u.reduce((t,n,r)=>{let i=$i(e),a=$i(e),o=$i(e),s=c[r];return`for (let ${i} = 0, ${a} = ${s}.low, ${o} = ${a} === undefined ? ${s}.length : ${s}.high - ${a} + 1; ${i} < ${o}; ${i}++) { const ${n} = ${a} === undefined ? ${s}[${i}] : ${a} + ${i}; ${t} }`},d),p=o.map(e=>`, ${e}`).join(``);return e.helpers.push(`function ${a}(context, state, next${p}) { let primed; ${l.join(` `)} ${f} return ${r}; }`),`${a}(${n.context}, ${n.state}, ${n.isPrimed?`undefined`:n.next}${p})`},ra=(e,t,n)=>{let r=t.args;if(t.operator===`=>`)return`(bool(${aa(e,r[0],n)}, "the left side of =>") ? bool(${aa(e,r[1],n)}, "the right side of =>") : true)`;if(B(t))return ta(e,t,n);let i=Xl(t.operator,e.environment);if(i?.kind!==`Builtin`)return ta(e,t,n);if(i.name===`DOMAIN`)return`${Qi(e,rl(t))}(${aa(e,r[0],n)})`;if(i.name===`TLCEval`)return ta(e,t,n);if(i.name===`\\subseteq`&&r.length===2)return`${Qi(e,il(t,i))}(${aa(e,r[0],n)}, ${aa(e,r[1],n)})`;let a=e.environment;if(i.evaluateUnary&&r.length===1&&Ju(r[0],a))return`${Qi(e,i.evaluateUnary)}(${aa(e,r[0],n)})`;let o=r.length===2&&Ju(r[0],a)&&Ju(r[1],a);return i.evaluateBinary&&o?`${Qi(e,i.evaluateBinary)}(${aa(e,r[0],n)}, ${aa(e,r[1],n)})`:ta(e,t,n)},ia=(e,t,n)=>{switch(e.kind){case`Identifier`:{if(t.locals.has(e.name))return!0;if(B(e))return!1;let r=ou(e.name,n);return r?.kind===`Variable`||r?.kind===`Value`}case`Prime`:return ia(e.expression,t,n);case`FieldAccess`:return ia(e.record,t,n);case`FunctionApplication`:return[e.function,...e.args].every(e=>ia(e,t,n));default:return!1}},aa=(e,t,n)=>{let r=(t,r=n)=>aa(e,t,r);if(Mu(t)&&Du(t,e.environment))return ta(e,t,n);switch(t.kind){case`Number`:return mu(t.value)?String(t.value):ta(e,t,n);case`String`:return JSON.stringify(t.value);case`Identifier`:{let r=n.locals.get(t.name);if(r)return r;if(B(t))return ta(e,t,n);let i=ou(t.name,e.environment);if(i?.kind===`Variable`){let r=JSON.stringify(t.name),a=Qi(e,t);return`(${n.state}?.[${i.index}] ?? unassigned(${r}, ${a}))`}return i?.kind===`Value`?Qi(e,i.value):ta(e,t,n)}case`Apply`:return ra(e,t,n);case`And`:case`Or`:{let n=Qi(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)}, ${Qi(e,t)}) ? ${r(t.consequent)} : ${r(t.alternative)})`;case`FunctionApplication`:{cd(t.function);let i=`expectFunction(${ia(t.function,n,e.environment)?r(t.function):ta(e,t.function,{...n,context:`keepLazyContext(${n.context})`})}, ${Qi(e,t)})`,a=nl(e.environment.runtime.version),o=a?`, ${Qi(e,a)}`:``;return t.args.length===1?`apply(${i}, ${r(t.args[0])}${o})`:`apply(${i}, tuple([${t.args.map(e=>r(e)).join(`, `)}])${o})`}case`FieldAccess`:return`${Qi(e,tl(t))}(${r(t.record)})`;case`Record`:{let i=fd(t.fields);if(pd(i))return ta(e,t,n);let a=Qi(e,i.map(e=>e.name)),o=`[${i.map(e=>r(e.value)).join(`, `)}]`,s=t.fields.map(e=>e.name);return s.every((e,t)=>e===i[t].name)?`record(${a}, ${o})`:`writtenRecord(${a}, ${o}, ${Qi(e,s)})`}case`Tuple`:return`tuple([${t.elements.map(e=>r(e)).join(`, `)}])`;case`SetEnumeration`:return`set([${t.elements.map(e=>r(e)).join(`, `)}])`;case`Prime`:{let i=Qi(e,t);if(n.isPrimed)return`primeOutsideAction(${i})`;let a={context:`(primed ??= prime(${n.context}))`,state:n.next,next:`undefined`,isPrimed:!0,locals:n.locals};return`(${n.next} === undefined ? primeOutsideAction(${i}) : ${r(t.expression,a)})`}case`Unchanged`:return`equal(${r({kind:`Prime`,expression:t.expression,location:t.location})}, ${r(t.expression)})`;case`Forall`:case`Exists`:return t.bounds.every(e=>e.pattern.kind===`Name`)?na(e,t,n):ta(e,t,n);default:return ta(e,t,n)}},oa=(e,t)=>{if(!Yi.has(e.kind))return;let n={environment:t,references:[],helpers:[],counter:0},r=aa(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(`
|
|
29
|
+
`)}\nreturn (context) => { const state = context.state; const next = context.next; let primed; return ${r}; };`;Zi.value??=Xi();let o=Zi.value,s=Object.keys(o);return Function(...s,...i,a)(...Object.values(o),...n.references)},sa={general:1e3,commandLineError:1102,initialState:2102,nestedExpression:2103,assumptionFalse:2104,assumptionEvaluationError:2105,exceptAppliedToUnknownField:2144,fingerprintFailed:2147,invariantViolatedInitial:2107,incompleteSuccessor:2109,propertyViolatedInitial:2108,invariantViolatedBehavior:2110,invariantEvaluationFailed:2111,actionPropertyViolatedBehavior:2112,actionPropertyEvaluationFailed:2113,deadlockReached:2114,temporalPropertyViolated:2116,behaviorUpToThisPoint:2121,backToState:2122,constantLevelInvariant:2149,javaOverrideLoaded:2168,starting:2185,modelChecking:2187,finished:2186,computingInit:2189,initGenerated1:2190,initGenerated2:2191,checkingTemporal:2192,success:2193,searchDepth:2194,stats:2199,progress:2200,temporalBranches:2212,statePrint2:2217,statePrint3:2218,sanyFinished:2219,startingSany:2220,stateLevelProperty:2255,version:2262,noSpecificationButProperty:2257,noFairnessButProperty:2259,counterExample:2264,checkingTemporalEnd:2267,stateGraphOutdegree:2268,computingInitProgress:2269,livenessSymmetry:2279,livenessConstraints:2284,symmetrySetTooSmall:2300,javaOverrideMismatch:2400,postconditionFalse:2404,postconditionFailed:2405,possibleUnwitnessed:2780,parsingFailed:3002,configFileError:5001},ca={none:0,error:1,warning:3,state:4},la={0:``,1:`Error: `,3:`Warning: `,4:`State `},ua=(e,t=!0,n=`master`)=>{let r=/* @__PURE__ */ new Set;return{isTool:e,version:n,print:(n,i,a)=>{let o=i===ca.warning;if(o&&!t)return;let s=o&&!e&&r.size===0?`
|
|
30
|
+
(Use the -nowarning option to disable this warning.)`:``,c=e?`@!@!@STARTMSG ${n}:${i} @!@!@\n${a}\n@!@!@ENDMSG ${n} @!@!@`:`${la[i]}${a}${s}`;o&&r.has(c)||(o&&r.add(c),console.log(c))}}},da=`The configuration file did not specify the initial state predicate.
|
|
31
|
+
Can also be caused by trying to run TLC on a specification from
|
|
32
|
+
a module imported with a parameterized INSTANCE statement.`,fa=[[1005,b,!1],[2117,`Failed to recover the next state from its fingerprint.`,!0],[2123,`Failed to recover the initial state from its fingerprint.`,!0],[2132,`The first argument of Assert evaluated to FALSE; the second argument was:
|
|
33
|
+
%1%`,!0],[2145,`TLCGet(%1%) was undefined.`,!0],[2154,`Attempted to apply the operator overridden by the Java method
|
|
34
|
+
%1%,
|
|
35
|
+
but it produced the following error:
|
|
36
|
+
%2%`,!1],[2148,`The action formula A appearing in a WF_v(A) or SF_v(A) operator does not specify the primed value of the variable %1% occurring in the state formula v.
|
|
37
|
+
`,!1],[2155,`Attempted to compare %1% with the value
|
|
38
|
+
%2%`,!0],[2158,`Attempted to check if the value:
|
|
39
|
+
%1%
|
|
40
|
+
is an element of %2%.`,!0],[2157,`Attempted to apply TransitiveClosure to a set containing
|
|
41
|
+
the following value:
|
|
42
|
+
%1%`,!0],[2165,`Choose can only deal with numbers up to %1%`,!1],[2169,`The %1% argument of %2% should be a %3%, but instead it is:
|
|
43
|
+
%4%`,!0],[2176,`Applying %1% to the following value,
|
|
44
|
+
which is not %2%:
|
|
45
|
+
%3%`,!0],[2177,`Attempted to apply BagUnion to the following set, whose
|
|
46
|
+
element is not a bag:
|
|
47
|
+
%1%`,!0],[2178,`Overflow when computing %1%`,!1],[2179,`The second argument of \\div is 0.`,!0],[2180,`0^0 is undefined.`,!0],[2181,`Attempted to compute cardinality of the value
|
|
48
|
+
%1%`,!0],[2182,`Evaluating an expression of the form %1% when s is not a %2%:
|
|
49
|
+
%3%`,!0],[2183,`The %1% argument of %2% must be in the domain of its %3% argument:
|
|
50
|
+
%4%
|
|
51
|
+
, but instead it is
|
|
52
|
+
%5%`,!0],[2184,`Attempted to apply %1% to the empty sequence.`,!0],[2115,`No next state actions defined to generate successor states from.`,!1],[2146,`The invariant %1% is not a state predicate (one with no primes or temporal operators).%2%`,!1],[2213,`TLC cannot handle the temporal formula %1%`,!1],[2214,`Temporal formulas containing actions must be of forms <>[]A or []<>A.`,!1],[2215,`TLC expected a %1% value, but did not find one. %2%`,!1],[2222,`The constant parameter %1% is not assigned a value by the configuration file.`,!1],[2223,`In the configuration file, the identifier %1% appears
|
|
53
|
+
on the right-hand side of a <- after already appearing on the
|
|
54
|
+
left-hand side of one.`,!1],[2224,`The configuration file substitutes for %1% with the undefined identifier %2%.`,!1],[2225,`The configuration file substitutes for %1% with %2% of different number of arguments.`,!1],[2226,`In the configuration file, the identifier %1% does not appear in the specification.`,!1],[2227,`The configuration file cannot specify both INIT/NEXT and SPECIFICATION fields.`,!1],[2228,`TLC requires %1% not to take any argument.`,!1],[2228,`TLC requires %1% not to take any argument, but one was given: %2%`,!1],[2229,`The %1% %2% specified in the configuration file
|
|
55
|
+
is not defined in the specification.`,!1],[2230,`The %1% of %2% is equal to %3%`,!1],[2231,`The configuration file did not specify the initial state predicate.`,!1],[2231,da,!1],[2232,`The configuration file did not specify the next state predicate.`,!1],[2233,`The %1% %2% cannot be a constant.`,!1],[2234,`The operator %1% cannot take any argument.`,!1],[2235,`The operator %1% is not defined in the spec.`,!1],[2237,`The spec is trivially false because %1% is false.`,!1],[2238,`TLC cannot handle subscript %1%`,!1],[2239,`TLC cannot handle this conjunct of the spec:
|
|
56
|
+
%1%`,!1],[2241,`The property %1% is not correctly defined.`,!1],[2242,`The arity of the operator %1% is inconsistent in the configuration file.`,!1],[2244,`TLC can't handle real numbers.
|
|
57
|
+
%1%`,!1],[2247,`In computing %1%, TLC expected a %2% expression,
|
|
58
|
+
but instead found %3%.
|
|
59
|
+
%4%`,!1],[2248,`In computing %1%, TLC expected a %2% expression,
|
|
60
|
+
but didn't find one.
|
|
61
|
+
%3%`,!1],[2260,`In computing ENABLED, TLC encountered a temporal formula (%1%).
|
|
62
|
+
%2%`,!1],[2261,`TLC encountered a temporal formula (%1%) when evaluating a predicate or action.
|
|
63
|
+
%2%`,!1],[2265,`TLC can't handle a number this big.
|
|
64
|
+
%1%`,!1],[2266,`The %1% argument of %2% should be an %3%, but instead it is:
|
|
65
|
+
%4%`,!0],[2280,`In evaluation, the identifier %1% is either undefined or not an operator.
|
|
66
|
+
%2%`,!1],[2281,`The configuration file substitutes constant %1% with non-constant %2%%3%`,!1],[2283,`The argument of %1% should be a %2%, but instead it is:
|
|
67
|
+
%3%`,!0],[5003,`TLC found an error in the configuration file at line %1%
|
|
68
|
+
The keyword %2% was not followed by an identifier.`,!1],[5004,`TLC found an error in the configuration file at line %1%
|
|
69
|
+
The keyword %2% appeared twice.`,!1],[5005,`TLC found an error in the configuration file at line %1%
|
|
70
|
+
Expected an identifier after %2%.`,!1],[5006,`TLC found an error in the configuration file at line %1%
|
|
71
|
+
It was expecting %2%, but did not find it.`,!1],[5007,`TLC found an error in the configuration file:
|
|
72
|
+
%1%`,!1],[5002,`TLC found an error in the configuration file at line %1%
|
|
73
|
+
`,!1],[2253,`Temporal formula is a tautology (its negation is unsatisfiable).`,!1],[2301,`TLC does not support temporal existential, nor universal, quantification over state variables.`,!1]],pa={value:void 0},ma=()=>pa.value??=fa.map(([e,t,n])=>({pattern:RegExp(`^${t.split(/%\d+%/).map(e=>e.replace(/[.*+?^${}()|[\]\\]/g,`\\$&`)).join(`[\\s\\S]*`)}$`),message:{code:e,isEvalException:n}})),ha=/^Overflow when computing the number of elements in( |:\n\[(?![A-Za-z0-9_]+ : ))/,ga=e=>ha.test(e)?void 0:ma().find(t=>t.pattern.test(e))?.message,_a=e=>e instanceof S||ga(e.message)?.isEvalException===!0,va=/* @__PURE__ */ new Map([[1e3,`
|
|
74
|
+
: `],[2105,`failed.
|
|
75
|
+
`],[2154,`but it produced the following error:
|
|
76
|
+
`],[2213,`:
|
|
77
|
+
`],[2281,` - specifically: `]]),ya=(e,t,n)=>{let r=n?va.get(e):void 0,i=r===void 0?-1:t.indexOf(r);if(r===void 0||i===-1)return t;let a=i+r.length;return`${t.slice(0,a)}${ba(t.slice(a),n)}`},ba=(e,t)=>{let n=t?ga(e)?.code:void 0;return n===void 0?e:`@!@!@STARTMSG ${n}:${ca.none} @!@!@\n${ya(n,e,t)}\n@!@!@ENDMSG ${n} @!@!@`},xa=e=>String(e).padStart(2,`0`),Sa=e=>{let t=Math.floor(e/1e3)%60,n=Math.floor(e/6e4)%60,r=Math.floor(e/36e5);return e>864e5?`${Math.floor(r/24)}d ${xa(r%24)}h`:e>36e5?`${xa(r%24)}h ${xa(n)}min`:e>6e4?`${xa(n)}min ${xa(t)}s`:`${xa(t)}s`},Ca=e=>`${e.getFullYear()}-${xa(e.getMonth()+1)}-${xa(e.getDate())} ${xa(e.getHours())}:${xa(e.getMinutes())}:${xa(e.getSeconds())}`,wa={kind:`Local`},Ta=/* @__PURE__ */ new WeakSet,Ea=/* @__PURE__ */ new WeakMap,Da=/* @__PURE__ */ new WeakMap,Oa=e=>{let t=e.lastIndexOf(`@`);return t>0&&t<e.length-1},ka=new Map([`~>`,`-+->`,`\\cdot`].map(e=>[e,{key:e,arity:2,kind:`Builtin`}])),Aa=(e,t)=>e.line<t.line||e.line===t.line&&e.column<t.column,ja=e=>e.kind===`Operator`?e.params.length:0,Ma=e=>e.kind===`Operator`?e.params.map(e=>e.arity):[],Na=e=>e.name.includes(`!`),Pa=(e,t)=>{for(let n=e;n;n=n.parent)if(n.name===t)return n},Fa=(e,t,n)=>{let r=t.bindings.get(e);return r&&Aa(r.position,t.location)&&(!n||Aa(r.position,n.start))?r:void 0},Ia=(e,t)=>e!==void 0&&t!==void 0&&g(e)===g(t),La=(e,t,n,r)=>{if(t===void 0)return!0;if(Ia(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 ${e} is a built-in operator, and cannot be redefined.`}):n.kind===`Parameter`||t.kind!==n.kind||t.arity!==n.arity?r.errors.push({location:a,message:`Multiply-defined symbol '${e}': this definition or declaration conflicts \nwith the one at ${o}.`}):r.warnings.push({location:a,message:`Multiple declarations or definitions for symbol ${e}. \nThis duplicates the one at ${o}.`}),!1},Ra=(e,t,n,r)=>La(t,Pa(e,t)??Fa(t,r,n.range),n,r)?{...n,name:t,parent:e}:e,za=(e,t,n)=>{La(e,n.bindings.get(e),t,n)&&n.bindings.set(e,{...t,position:n.location})},Ba=(e,t,n,r)=>t.reduce((e,t,i)=>Ra(e,t,{kind:`Parameter`,arity:0,range:n?.[i]},r),e),Va=(e,t,n)=>t.reduce((e,t)=>Ra(e,t.name,{kind:`Parameter`,arity:t.arity,range:t.location?.range},n),e),Ha=e=>e.kind===`Name`?[e.name]:e.names,Ua=e=>e.flatMap(e=>Ha(e.pattern)),Wa=(e,t)=>{let n=t.definitions.get(e);return n!==void 0&&(n===t.self?n.kind===`Function`||n.isRecursive:n.isRecursive||Aa(n.location,t.location))?n:void 0},Ga=(e,t)=>{let n=Wa(e,t);return n?{key:t.getKey(n),arity:ja(n),params:Ma(n),kind:`Definition`}:t.imported.get(e)},Ka=(e,t,n)=>Pa(t,e)??Ga(e,n),qa=(e,t)=>({module:e.range?.module??``,start:e,end:{line:e.line,column:e.column+t.length-1}}),Ja=(e,t)=>{let n=e.kind===`OperatorReference`?void 0:e.selectorRanges?.at(-1);return n?{module:n.module,start:e.location,end:n.end}:qa(e.location,e.spelling??t)},Ya=e=>{if(e.kind===`Apply`){if(e.args.length===2)return`infix`;if(e.args.length===1)return Aa(e.location,e.args[0].location)?`prefix`:`postfix`}},Xa=e=>!/^[\p{L}\d_]/u.test(e),Za=e=>e.startsWith(`<`)&&(e[1]>=`0`&&e[1]<=`9`||e[1]===`*`),Qa=(e,t)=>typeof e==`number`?e>=1&&e<=t?e-1:-1:e===`<<`?t>0?0:-1:t===2?1:-1,$a=(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])}})},eo=e=>e.kind===`Subexpression`?e.selectors:e.kind===`Identifier`?$a(e.name,[],void 0):$a(e.operator,e.args,e.argumentCounts),to=e=>e.filter((t,n)=>n===0||e[n-1].set!==t.set).map(e=>e.set),no=e=>{switch(e.kind){case`Forall`:case`Exists`:case`FunctionConstruction`:return{names:Ua(e.bounds),body:e.body,sets:to(e.bounds)};case`SetMap`:return{names:Ua(e.bounds),body:e.expression,sets:to(e.bounds)};case`SetFilter`:return{names:Ha(e.bound.pattern),body:e.predicate,sets:[e.bound.set]};case`Choose`:return{names:Ha(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}},ro=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}},io=e=>e.kind===`Identifier`||e.kind===`Apply`||e.kind===`Subexpression`,ao=(e,t)=>e.assumptions.slice(0,t).some(e=>e.kind===`NewSymbol`),oo=(e,t)=>{if(e.kind===`Label`)return e.name===t?e:void 0;if(e.kind!==`Lambda`)return e.kind===`Let`?oo(e.body,t):hi(e).reduce((e,n)=>e??oo(n,t),void 0)},so=(e,t,n)=>{if(e.kind===`AssumeProve`)return[...e.assumptions,e.conclusion].reduce((r,i,a)=>r??so(i,t,n||ao(e,a)),void 0);if(!n)return e.kind===`NewSymbol`?e.set&&oo(e.set,t):oo(e,t)},co=e=>e.kind===`Label`?co(e.body):e,lo=e=>typeof e==`number`?`argument selector ${e}`:e,uo=`within the scope of a declaration
|
|
78
|
+
from outside that declaration's scope.`,fo=(e,t,n,r,i,a)=>{let o=(t,n)=>{let r=(t===void 0?void 0:e.selectorRanges?.[t])??e.location.range;r&&i.errors.push({location:g(r),message:n})},s=n.isSuffices===n.isInProof,c=n.statement,l={node:c,isGoal:!0,isSufficesOpen:n.isSuffices};for(let[e,n]of t.slice(1).entries()){let a=e+1,u=l.node;if(n.kind===`Name`){if(t[a-1].kind!==`Name`)return u.kind!==`NewSymbol`&&u.kind!==`AssumeProve`&&co(u).kind===`Let`?void 0:o(a-1,`A name selector here must be from a LET clause.`);let e=c.kind===`AssumeProve`?[...c.assumptions,c.conclusion]:[c],r=a===1?e.map((e,t)=>({position:t,label:so(e,n.name,!1)})).find(e=>e.label!==void 0):{position:0,label:u.kind===`Label`?oo(u.body,n.name):void 0};if(!r?.label)return o(a,`Cannot find label \`${n.name}'.`);if(a===1&&c.kind===`AssumeProve`&&ao(c,r.position)&&s)return o(1,`Accessing subexpression labeled \`${n.name}' of ASSUME/PROVE clause ${uo}`);if(n.args.length!==r.label.params.length)return o(a,`Label \`${n.name}' used with wrong number of arguments.`);l.node=r.label,l.isGoal=!1,l.isSufficesOpen=!1;continue}if(n.kind!==`Operand`)return;let d=lo(n.operand);if(l.isSufficesOpen){if(Qa(n.operand,1)!==0)return o(a,u.kind===`AssumeProve`?`Accessing non-existent subexpression of a SUFFICES`:`Nonexistent operand specified by \`${d}'.`);l.isSufficesOpen=!1;continue}if(u.kind===`NewSymbol`)return;if(u.kind!==`AssumeProve`){let e=co(u);if([`Number`,`Decimal`,`String`].includes(e.kind))return o(a,`Selecting subexpression of expression that has none.`);let t=e.kind===`Identifier`?Ka(e.name,r,i)?.kind:void 0;if(t===`Variable`||t?.startsWith(`New`))return o(a,`Choosing operand \`${d}' of subexpression with no operands.`);let s=no(e)?.sets,c=e.kind===`Identifier`?[]:s?s.length>0?s:void 0:e.kind===`Except`?void 0:ro(e);if(!c)return;let f=Qa(n.operand,c.length);if(f===-1)return o(a,`Nonexistent operand specified by \`${d}'.`);l.node=c[f],l.isGoal=!1;continue}let f=[...u.assumptions,u.conclusion],p=Qa(n.operand,f.length);if(p===-1)return o(a,`Nonexistent operand specified by \`${d}'.`);if(ao(u,p)&&(!l.isGoal||s))return o(a,`Accessing ASSUME/PROVE clause ${uo}`);let m=f[p];if(m.kind===`NewSymbol`&&a!==t.length-1)return o(a,`Selected a subexpression of a NEW clause of an ASSUME.`);l.node=m,l.isGoal=!1}a||(l.node.kind===`AssumeProve`&&o(void 0,`Selected ASSUME/PROVE instead of expression.`),l.node.kind===`NewSymbol`&&o(void 0,`Selected a NEW declaration as an expression or operator.`))},po=(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)},mo=(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=Pa(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)},ho=(e,t,n,r)=>{if(!io(e))return!1;let i=eo(e),a=i[0],o=i.length>1&&a.kind===`Name`?Pa(t,a.name)?.goal??n.goals.get(a.name):void 0;return o&&fo(e,i,o,t,n,r),o!==void 0},go=(e,t,n,r)=>{let i=e.location;if(Eo(e,n,r))return;let a=Da.get(e);if(a!==void 0)return a;if(Oa(t)||ho(e,n,r,!1)||Za(t)&&Pa(n,t))return e.kind===`Apply`?e.args.length:0;let o=Pa(n,t);if(o&&e.kind!==`OperatorReference`&&(e.resolution=wa),o)return o.arity;let s=Ga(t,r);if(s)return e.kind===`Identifier`?e.name=s.key:e.operator=s.key,Da.set(e,s.arity),s.arity;let c=t.includes(`!`)?t.slice(0,t.indexOf(`!`)):``;if(c!==``&&(Pa(n,c)!==void 0||Ga(c,r)!==void 0||r.facts.has(c)))return e.kind===`Apply`?e.args.length:0;let l=(e.kind===`Identifier`?void 0:e.spelling)??t,u=g(e.kind===`Apply`&&l===`-.`?qa(i,`-`):Ja(e,t));if(!Xa(t)||Za(t)){r.errors.push({location:u,message:`Unknown operator: \`${t}'.`});return}r.errors.push({location:u,message:`Could not find declaration or definition of symbol '${l}'.`});let d=Ya(e);d&&i.range&&r.errors.push({location:g(i.range),message:`Couldn't resolve ${d} operator symbol \`${l}'.`})},_o=(e,t,n)=>(e.forEach(e=>U(e.set,t,n)),e.reduce((e,t)=>Ba(e,Ha(t.pattern),t.pattern.ranges,n),t)),vo=(e,t)=>e.kind===`Identifier`&&e.name===t&&B(e)||hi(e).some(e=>vo(e,t)),yo=(e,t)=>{e.kind===`FunctionConstruction`&&vo(e.body,t)&&(e.isRecursive=!0),hi(e).forEach(e=>yo(e,t))},bo=(e,t,n,r)=>{let i={...n,hasLabelScope:!0,labelParams:e.kind===`Function`?Ua(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`?_o(e.bounds,t,i):Va(t,e.params,i),l=Pa(c,a)??Fa(a,i,o),u=l?.isPending===!0&&r.has(l);return l?.isPending&&!u?s(`Recursive ${e.kind===`Function`?`function`:`operator`} ${a} defined at wrong LET/IN level.`):l&&!u&&s(e.kind===`Function`?`Function name \`${a}' already defined or declared.`:`Operator ${a} already defined or declared.`),e.kind===`Function`?(U(e.body,{name:a,kind:`Parameter`,arity:0,range:o,parent:c},i),yo(e.body,a),e.isSelfReferential=vo(e.body,a)):U(e.body,c,i),l&&u?(l.isPending=!1,l.range=o,!1):e.kind===`Function`?l===void 0:La(a,Pa(t,a)??Fa(a,i,o),{kind:`Definition`,arity:ja(e),range:o},i)},xo=(e,t,n,r=[])=>{let i=/* @__PURE__ */ new Set,a=e.filter(e=>e.isRecursive).reduce((e,t)=>{if(Pa(e,t.name)?.isPending)return e;let n={name:t.name,arity:ja(t),params:Ma(t),kind:`Definition`,parent:e,isPending:!0};return i.add(n),n},t),o=n.isGenerated?[]:[...r],s=(e,t)=>{let r=o.findIndex(e=>!t(e));return o.splice(0,r===-1?o.length:r).reduce((e,t)=>Mo(t,e,n),e)};return s(e.reduce((e,t)=>{let a=Oa(t.name)?e:s(e,e=>!Aa(t.location,e.location)),o={name:t.name,arity:ja(t),kind:`Definition`,range:t.location.range,parent:a};if(Na(t))return o;let c=r.some(e=>e.location===t.location),l=n.isGenerated||t.isLocal||Oa(t.name),u=c?{...n,isGenerated:!0,errors:[],warnings:[]}:l?{...n,isGenerated:l}:n;return bo(t,a,u,i)?{...o,params:Ma(t)}:a},a),()=>!0)},So=(e,t,n)=>{let r=e.split(`!`)[0],i=r===e?void 0:Pa(t,r)??Fa(r,n,void 0);return i?.kind===`Instance`?{name:r,arity:i.arity}:void 0},Co=(e,t,n)=>{if(e.kind!==`Identifier`&&e.kind!==`Apply`)return!1;let r=So(e.kind===`Identifier`?e.name:e.operator,t,n),i=e.kind===`Apply`?e.argumentCounts?.[0]??0:0;if(!r||i===r.arity)return!1;let a=(e.kind===`Apply`?e.argumentRanges?.[0]:void 0)??e.location.range;return a&&n.errors.push({location:g(a),message:`The operator ${r.name} requires ${r.arity} arguments.`}),!0},wo=(e,t,n)=>{if(Co(e,t,n))return;let r=e.operator,i=Ka(r,t,n),a=go(e,r,t,n);if(a===void 0)return;if(a!==e.args.length){n.errors.push({location:g(e.argumentsRange??Ja(e,r)),message:`The operator ${r} requires ${a-(So(r,t,n)?.arity??0)} arguments.`});return}let o=i&&(i.kind===`Definition`?i.params:[]);if(o===void 0){e.args.forEach(e=>To(e,t,n));return}let s=(e,t)=>{e&&n.errors.push({location:g(e),message:t})};e.args.map((i,a)=>{let c=o[a]??0,l=i.location.range;if(c===0){if(i.kind===`Lambda`&&i.operator!==void 0)s(l,`The operator ${i.operator} requires 1 arguments.`);else if(i.kind===`Lambda`&&l)s(l,`LAMBDA expression used where an expression is required.`);else if(i.kind===`OperatorReference`){let e=go(i,i.operator,t,n);e!==void 0&&s(l,`The operator ${i.operator} requires ${e} arguments.`)}else U(i,t,n);return!0}if(i.kind===`Lambda`){U(i,t,n);let o=i.params.length===c;return!o&&Ta.has(i)?s(l,`Expected arity ${c} but found operator of arity ${i.params.length}.`):!o&&l&&i.operator===void 0&&s(e.selectorRanges?.at(-1)??Ja(e,r),`Lambda expression with arity ${i.params.length} used as argument ${a+1} of operator \`${r}', \nbut an operator of arity ${c} is required.`),o}if(i.kind===`Subexpression`)return U(i,t,n),!0;if(i.kind===`Apply`&&i.argumentCounts?.at(-1)===0){let e=i.argumentCounts.findIndex(e=>e>0);return s(i.selectorRanges?.[e],`Selector \`${i.operator.split(`!`)[e]}' should not have argument(s).`),!1}if(i.kind!==`Identifier`&&i.kind!==`OperatorReference`)return s(l,`An expression appears as argument number ${a+1} (counting from 1) to operator '${r}', in a position an operator is required.`),!1;let u=i.kind===`Identifier`?i.name:i.operator,d=Ka(u,t,n)?.params??[],f=go(i,u,t,n);return i.kind===`Identifier`&&f!==void 0&&f!==c&&s(Ja(i,u),`Expected arity ${c} but found operator of arity ${f}.`),f===c&&d.every(e=>e===0)}).forEach((t,n)=>{t||s(e.location.range,`Argument number ${n+1} to operator '${r}' \nshould be a ${o[n]}-parameter operator.`)})},To=(e,t,n)=>{e.kind===`Identifier`?go(e,e.name,t,n):U(e,t,n)},Eo=(e,t,n)=>{let r=Ea.get(e);return r?(r.args.forEach(e=>To(e,t,n)),n.errors.push(r.error),!0):!1},U=(e,t,n)=>{if(Ta.has(e)&&!n.isGenerated){U(e,t,{...n,isGenerated:!0});return}let r=e=>e.forEach(e=>U(e,t,n)),i=e=>({...n,labelParams:[...n.labelParams,...e]});switch(e.kind){case`Number`:case`Decimal`:case`String`:case`ExceptAt`:return;case`Identifier`:{if(Co(e,t,n))return;let r=e.name,i=go(e,r,t,n);i!==void 0&&i>0&&n.errors.push({location:g(Ja(e,r)),message:`The operator ${r} requires ${i} arguments.`});return}case`OperatorReference`:go(e,e.operator,t,n);return;case`Apply`:wo(e,t,n);return;case`Lambda`:U(e.body,Ba(t,e.params,e.paramRanges,n),i(e.params));return;case`And`:case`Or`:r(e.operands);return;case`Prime`:case`Unchanged`:case`Enabled`:case`Always`:case`Eventually`:U(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&&U(e.other,t,n);return;case`Let`:U(e.body,xo(e.definitions,t,n,e.instances),n);return;case`Forall`:case`Exists`:case`FunctionConstruction`:U(e.body,_o(e.bounds,t,n),i(Ua(e.bounds)));return;case`UnboundedQuantifier`:U(e.body,Ba(t,e.names,e.nameRanges,n),i(e.names));return;case`Choose`:e.set&&U(e.set,t,n),U(e.body,Ba(t,Ha(e.pattern),e.pattern.ranges,n),i(Ha(e.pattern)));return;case`SetEnumeration`:case`Tuple`:r(e.elements);return;case`SetFilter`:U(e.predicate,_o([e.bound],t,n),i(Ha(e.bound.pattern)));return;case`SetMap`:U(e.expression,_o(e.bounds,t,n),i(Ua(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??qa(r.location,r.name)),message:`Non-unique fields in constructor.`}),U(r.value,t,n)});return;case`Except`:U(e.function,t,n),e.updates.forEach(e=>{r(e.path.flatMap(e=>e.kind===`Index`?e.args:[])),U(e.value,t,{...n,isInExcept:!0})});return;case`FunctionApplication`:r([e.function,...e.args]);return;case`FieldAccess`:U(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(po(e,n))return;U(e.body,t,{...n,labelParams:[],labels:/* @__PURE__ */ new Set}),mo(e,t,n);return;case`Subexpression`:if(Eo(e,t,n))return;e.selectors.flatMap(e=>`args`in e?e.args:[]).forEach(e=>To(e,t,n)),ho(e,t,n,!1)}},Do=(e,t,n)=>e.forEach(e=>{if(e.kind===`ModuleFact`||Co(e,t,n)||ho(e,t,n,!0))return;let r=e.kind===`Identifier`?e.name:e.kind===`Apply`?e.operator:``;n.facts.has(r)||U(e,t,n)}),Oo=(e,t,n)=>(e.set&&U(e.set,t,n),Ra(t,e.name,{kind:`New${e.level}`,arity:e.arity,range:e.nameRange},n)),ko=(e,t,n,r=!1)=>{let i=e.assumptions.reduce((e,t)=>t.kind===`NewSymbol`?{scope:Oo(t,e.scope,e.unit),unit:r?{...e.unit,isLabelForbidden:!0}:e.unit}:(t.kind===`AssumeProve`?ko(t,e.scope,e.unit,!0):U(t,e.scope,e.unit),e),{scope:t,unit:n});return U(e.conclusion,i.scope,i.unit),i.scope},Ao=(e,t,n)=>e.kind===`AssumeProve`?ko(e,t,n):(U(e,t,n),t),jo=(e,t,n)=>{let r=n.hasLabelScope?{...n,hasLabelScope:!1}:n;e?.kind===`By`&&Do(e.facts,t,r),e?.kind===`Steps`&&e.steps.reduce((e,t)=>No(t,e,r),t)},Mo=(e,t,n)=>{let r=zo(e,t,n);return e.name===void 0?r:Ra(r,e.name,{kind:`Instance`,arity:e.params.length,range:e.location.range},n)},No=(e,t,n)=>{let r=e.body,i=e.name===void 0?n:{...n,hasLabelScope:!0,labelParams:[],labels:/* @__PURE__ */ new Set},a=t=>e.name===void 0?t:{name:e.name,arity:0,kind:`Theorem`,parent:t};switch(r.kind){case`Assert`:{let a=Ao(r.statement,t,i),o=r.isSuffices?t:a,s=e.name;if(s===void 0)return jo(e.proof,o,n),r.isSuffices?a:t;let c={statement:r.statement,isSuffices:r.isSuffices,isInProof:!0};return jo(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 Do(r.facts,t,n),a(t);case`Instance`:return a(Mo(r,t,i));case`Define`:return a(r.definitions.reduce((e,t)=>t.kind===`Instance`?Mo(t,e,i):xo([t],e,n),t));case`Have`:case`Case`:return U(r.expression,t,i),jo(e.proof,a(t),n),a(t);case`Witness`:return r.expressions.forEach(e=>U(e,t,i)),a(t);case`Take`:return a(Ba(_o(r.bounds,t,i),r.names,r.nameRanges,i));case`Pick`:{let o=Ba(_o(r.bounds,t,i),r.names,r.nameRanges,i);return U(r.body,o,{...i,labelParams:[...i.labelParams,...Ua(r.bounds),...r.names]}),jo(e.proof,a(t),n),a(o)}default:return jo(e.proof,a(t),n),a(t)}},Po=(e,t)=>{let n=e.name!==void 0&&e.statement.kind!==`AssumeProve`?void 0:Ao(e.statement,void 0,t);e.name!==void 0&&za(e.name,{kind:`Theorem`,arity:0,range:e.location.range},t);let r=t.goals.get(e.name??``);r&&(r.isInProof=!0),jo(e.proof,n,t),r&&(r.isInProof=!1)},Fo={line:0,column:0},Io=(e,t)=>[...e.theorems,...e.assumptions].some(e=>e.name===t.name&&e.location.line===t.location.line&&e.location.column===t.location.column),Lo=(e,t)=>{let n=new Map([...ka,...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},Ro=(e,t,n,r,i)=>{let a=e.params.reduce((e,t)=>({name:t.name,arity:t.arity,kind:`Parameter`,parent:e}),r),o=(t,n)=>{if(t.arity===0||n.kind!==`Identifier`){U(n,a,i);return}let r=go(n,n.name,a,i);if(r!==void 0&&r!==t.arity)throw new u(`An operator must be substituted for symbol '${t.name}', and it must have arity ${t.arity} in the instance of ${e.module} at line ${e.location.line}, column ${e.location.column}`)},s=/* @__PURE__ */ new Map;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;o(r,a);let c=a.location.range;s.has(n)?c&&i.errors.push({location:g(c),message:`Multiple substitutions for symbol '${n}' in substitution.`}):s.set(n,a)});let c=t.filter(e=>!s.has(e.name)),l=e=>!Pa(a,e.name)&&!Ga(e.name,i);return c.filter(e=>!l(e)).forEach(t=>{let n={kind:`Identifier`,name:t.name,location:e.location};o(t,n),s.set(t.name,n)}),c.filter(l).forEach(t=>{let r=e.location.range,a=t.location.range;r&&a&&i.errors.push({location:g(r),message:`Substitution missing for symbol ${t.name} declared at ${g(a)} \nand instantiated in module ${n}.`})}),s},zo=(e,t,n)=>{let r=n.getInstance(e);return Ro(e,r.declarations,r.instancer,t,n),[...r.symbols].reduce((e,[t,r])=>Ra(e,t,r,n),t)},Bo=(e,t,n,r)=>{let i=Lo(n,r.imported),a={location:e.location,errors:[],warnings:[]};return r.reports.push(a),Ro(e,t,n.name,void 0,{imported:i,getInstance:r.getInstance,definitions:r.definitions,getKey:r.getKey,location:e.location,self:void 0,facts:/* @__PURE__ */ new Set,goals:/* @__PURE__ */ new Map,bindings:new Map([...i].map(([e,t])=>[e,{...t,position:Fo}])),errors:a.errors,warnings:a.warnings,hasLabelScope:!1,isLabelForbidden:!1,isInExcept:!1,labelParams:[],labels:/* @__PURE__ */ new Set,isGenerated:!1})},Vo=(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)=>Aa(e.location,t.location)?-1:+!!Aa(t.location,e.location)).forEach(e=>{let i=[],a=[];try{e.check(i,a)}catch(e){if(!(e instanceof u)||!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},Ho=(e,t)=>{let n=Lo(e,t.imported),r=/* @__PURE__ */ new Set([...t.facts,...[...e.theorems,...e.assumptions].flatMap(e=>e.name??[])]),i=new Map(e.theorems.flatMap(e=>e.name!==void 0&&e.statement.kind===`AssumeProve`?[[e.name,{statement:e.statement,isSuffices:!1,isInProof:!1}]]:[])),a=new Map([...ka,...t.bound].map(([e,t])=>[e,{...t,position:Fo}])),o=/* @__PURE__ */ new Set,s=[],c=(e,o,s,c,l)=>({imported:n,getInstance:t.getInstance,definitions:t.definitions,getKey:t.getKey,location:e,self:o,facts:r,goals:i,bindings:a,errors:s,warnings:c,hasLabelScope:l,isLabelForbidden:!1,isInExcept:!1,labelParams:[],labels:/* @__PURE__ */ new Set,isGenerated:!1}),l=(e,t)=>e.map(e=>({location:e.location,check:(n,r)=>za(e.name,{kind:t,arity:e.arity,range:e.location.range},c(e.location,void 0,n,r,!1))}));return Vo([...t.reports.map(e=>({location:e.location,check:(t,n)=>{t.push(...e.errors),n.push(...e.warnings)}})),...l(e.constants,`Constant`),...l(e.variables,`Variable`),...e.units.flatMap(e=>e.kind===`Recursive`?e.declarations:[]).map(e=>({location:e.location,check:(t,n)=>{let r={kind:`Definition`,arity:e.arity,range:e.location.range,position:e.location,isPending:!0},i=La(e.name,a.get(e.name),r,c(e.location,void 0,t,n,!1));i&&(a.set(e.name,r),o.add(r)),s.push({declaration:e,binding:i?r:void 0})}})),...e.definitions.map(t=>({location:t.location,check:(n,r)=>{let i=c(t.location,t,n,r,!0);Io(e,t)?U(t.body,void 0,i):bo(t,void 0,i,o)&&a.set(t.name,{kind:`Definition`,arity:ja(t),range:t.location.range,position:t.location})}})),...e.instances.map(e=>({location:e.location,check:(n,r)=>{let i=c(e.location,void 0,n,r,!1);Va(void 0,e.params,i),t.instanced.get(e)?.forEach((e,t)=>za(t,e,i)),e.name!==void 0&&za(e.name,{kind:`Instance`,arity:e.params.length,range:e.location.range},i)}})),...e.assumptions.map(e=>({location:e.location,check:(t,n)=>{let r=c(e.location,void 0,t,n,e.name!==void 0);U(e.expression,void 0,r),e.name!==void 0&&za(e.name,{kind:`Theorem`,arity:0,range:e.location.range},r)}})),...e.theorems.map(e=>({location:e.location,check:(t,n)=>Po(e,c(e.location,void 0,t,n,e.name!==void 0))})),...e.uses.map(e=>({location:e.location,check:(t,n)=>Do(e.facts,void 0,c(e.location,void 0,t,n,!1))})),{location:e.location.range?.end??e.location,check:e=>s.forEach(t=>{let n=t.declaration.location.range;n&&(!t.binding||t.binding.isPending)&&e.push({location:g(n),message:`Symbol ${t.declaration.name} declared in RECURSIVE statement but not defined.`})})}],t.warnings)},Uo=/* @__PURE__ */ new WeakSet,Wo=/* @__PURE__ */ new WeakSet,Go=(e,t,n=/* @__PURE__ */ new Set)=>{let r=Zo(e,(e,r)=>Go(e,t,r.length===0?n:/* @__PURE__ */ new Set([...n,...r])));return r.kind===`Identifier`&&B(r)&&!n.has(r.name)?{...r,name:t.get(r.name)??r.name}:r.kind===`Apply`&&B(r)&&!n.has(r.operator)?{...r,operator:t.get(r.operator)??r.operator}:r},Ko=(e,t)=>e.map(e=>({pattern:e.pattern,set:t(e.set)})),qo=/* @__PURE__ */ new WeakMap,Jo=e=>qo.get(e)??e.name,Yo=(e,t)=>(Jo(t)!==e.name&&qo.set(e,Jo(t)),e),Xo=(e,t)=>Yo(e.kind===`Function`?{...e,bounds:Ko(e.bounds,e=>t(e,[])),body:t(e.body,Ua(e.bounds))}:{...e,body:t(e.body,e.params.map(e=>e.name))},e),Zo=(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=>Xo(e,(e,r)=>t(e,[...n,...r]))),body:t(e.body,n)}}case`Forall`:case`Exists`:case`FunctionConstruction`:return{...e,bounds:Ko(e.bounds,n),body:t(e.body,Ua(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,Ha(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,Ha(e.bound.pattern))};case`SetMap`:return{...e,bounds:Ko(e.bounds,n),expression:t(e.expression,Ua(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)}}},Qo=`LAMBDA`,$o=(e,t=/* @__PURE__ */ new Set)=>{let n=e.kind===`Identifier`?e.name:e.kind===`Apply`||e.kind===`OperatorReference`?e.operator:void 0,r=n===void 0||t.has(n)?[]:[n];return Zo(e,(e,n)=>(r.push(...$o(e,n.length===0?t:/* @__PURE__ */ new Set([...t,...n]))),e)),r},es=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}},ts=(e,t,n)=>new Map([...e,...t.map(e=>[e,n(e)])]),ns=(e,t)=>e.kind===`Name`?{kind:`Name`,name:t(e.name)}:{kind:`Tuple`,names:e.names.map(t)},rs=(e,t)=>e.map(e=>({pattern:ns(e.pattern,t),set:e.set})),is=(e,t)=>e.kind===`Function`?{...e,bounds:rs(e.bounds,t)}:{...e,params:e.params.map(e=>({name:t(e.name),arity:e.arity}))},as=(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=>Yo({...is(e,n),name:n(e.name)},e))};case`Forall`:case`Exists`:case`FunctionConstruction`:case`SetMap`:return{...e,bounds:rs(e.bounds,n)};case`UnboundedQuantifier`:return{...e,names:e.names.map(n)};case`Choose`:return{...e,pattern:ns(e.pattern,n)};case`SetFilter`:return{...e,bound:{pattern:ns(e.bound.pattern,n),set:e.bound.set}};default:return e}},os=e=>`${e}@ENABLED`,ss=(e,t)=>e.modes.get(t)??e,cs=(e,t,n)=>e.kind===`Identifier`&&!n.has(e.name)&&!B(e)&&t.instantiation.variables.has(e.name),ls=(e,t,n)=>{if(e.kind===`Tuple`){let r=e.elements.map(e=>ls(e,t,n));return r.every(e=>e!==void 0)?r.flat():void 0}if(e.kind!==`Identifier`)return;if(cs(e,t,n))return[e.name];let r=B(e)?void 0:t.instantiation.getDefinition(e.name);return r?.kind===`Operator`&&r.params.length===0?ls(r.body,t,/* @__PURE__ */ new Map):void 0},us=(e,t,n)=>{if(t.mode===`Normal`)return;if(t.mode===`Primed`)return cs(e,t,n)&&e.kind===`Identifier`?{kind:`Identifier`,name:os(e.name),location:e.location}:void 0;if(e.kind===`Prime`)return{...e,expression:hs(e.expression,ss(t,`Primed`),n)};if(e.kind===`AngleAction`){let r=e.location;return{kind:`And`,operands:[hs(e.action,t,n),{kind:`Apply`,operator:`#`,args:[{kind:`Prime`,expression:hs(e.subscript,ss(t,`Primed`),n),location:r},hs(e.subscript,t,n)],location:r}],location:r}}if(e.kind!==`Unchanged`)return;let r=ls(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:os(r),location:e.location},location:e.location},hs({kind:`Identifier`,name:r,location:e.location},t,n)],location:e.location})),location:e.location}},ds=(e,t)=>({kind:`Identifier`,name:e,location:t,resolution:{kind:`Local`}}),fs=(e,t)=>e.map(e=>ds(e.name,t)),ps=(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:[...fs(t,r),...i.map(e=>ds(e,r))],location:r},location:r}},ms=(e,t)=>e.instantiation.isParameterized(t)?_s(e,t):void 0,hs=(e,t,n)=>{let r=e=>hs(e,t,n),i=t.instantiation,a=i.params,o=t=>!n.has(t)&&!B(e);if(e.kind===`Enabled`&&t.mode===`Normal`)return{...e,expression:hs(e.expression,ss(t,`Enabled`),n)};if((e.kind===`WeakFairness`||e.kind===`StrongFairness`)&&t.mode===`Normal`)return{...e,subscript:r(e.subscript),action:r(e.action),enabled:hs(e.enabled??{kind:`AngleAction`,action:e.action,subscript:e.subscript,location:e.location},ss(t,`Enabled`),n)};let s=us(e,t,n);if(s)return s;if(e.kind===`Identifier`&&o(e.name)){let n=i.substitutions.get(e.name);if(n)return Uo.add(n),n;let r=ms(t,e.name);if(r===void 0)return e;if(a.length===0)return{...e,name:r};let o=i.getDefinition(e.name);return o&&ja(o)>0?ps(r,a,ja(o),e.location):{kind:`Apply`,operator:r,args:fs(a,e.location),location:e.location}}if(e.kind===`Apply`&&o(e.operator)){let n=e.args.map(r),o=i.substitutions.get(e.operator),s=i.substitutions.size>0||a.length>0||Wo.has(e),c=e=>(s&&Wo.add(e),e);if(o?.kind===`Identifier`||o?.kind===`OperatorReference`){let t=o.kind===`Identifier`?o.name:o.operator;return c({...e,operator:t,args:n,resolution:o.kind===`Identifier`?o.resolution:void 0})}if(o?.kind===`Apply`)return c({...e,operator:o.operator,args:[...o.args,...n],resolution:o.resolution});if(o?.kind===`Lambda`)return{kind:`Let`,definitions:[{kind:`Operator`,name:Qo,params:o.params.map(e=>({name:e,arity:0})),body:o.body,isLocal:!0,isRecursive:!1,location:o.location}],body:{...e,operator:Qo,args:n,resolution:{kind:`Local`}},location:e.location};if(o)throw new u(`The operator ${e.operator} can only be substituted by an operator at line ${e.location.line}, column ${e.location.column}`);let l=ms(t,e.operator);return l===void 0?c({...e,args:n}):{...e,operator:l,args:[...fs(a,e.location),...n]}}if(e.kind===`OperatorReference`&&o(e.operator)){let n=ms(t,e.operator);if(n===void 0)return e;let r=i.getDefinition(e.operator);return a.length>0&&r?ps(n,a,ja(r),e.location):{...e,operator:n}}let c=es(t),l=Zo(e,(e,i)=>i.length===0?r(e):hs(e,t,ts(n,i,c)));return as(l,n,c)},gs=(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:ds(e.name,n),location:n},isLocal:e.isLocal,isRecursive:!1,location:e.location},_s=(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=es(e),o=is(Xo(i,(t,n)=>hs(t,e,ts(/* @__PURE__ */ new Map,n,a))),a);return gs(o,r.params,i.location)}):t},vs=e=>{let t=/* @__PURE__ */ new Map,n=new Set([...e.substitutions.values()].flatMap(e=>$o(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=>ms(i,e)??e,getQualifiedKey:t=>{let n=ms(i,t);if(n!==void 0)return n;let r=e.getDefinition(t);return r?e.addDefinition(t,r.name,()=>gs(r,e.params,r.location)):t}}},ys=e=>e.kind===`Let`&&e.instances!==void 0||hi(e).some(ys),bs=(e,t,n)=>{let r=e.kind===`Let`?[...n,...e.definitions]:n,i=Zo(e,e=>bs(e,t,r));if(i.kind!==`Let`||!i.instances)return i;let a=i.instances.reduce((e,n)=>{let i=e.findIndex(e=>Aa(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}},xs=e=>e.name===void 0&&e.statement.kind!==`AssumeProve`?e.statement:void 0,Ss=(e,t)=>e.definitions.some(e=>ys(e.body))||e.assumptions.some(e=>ys(e.expression))||e.theorems.some(e=>{let t=xs(e);return t!==void 0&&ys(t)})?{...e,definitions:e.definitions.map(e=>Xo(e,e=>bs(e,t,[]))),assumptions:e.assumptions.map(e=>({...e,expression:bs(e.expression,t,[])})),theorems:e.theorems.map(e=>{let n=xs(e);return n===void 0?e:{...e,statement:bs(n,t,[])}})}:e,Cs=(e,t,n)=>{let r=e.callStack;r.expressions.push(t);let i=Sr.sets,a=i??[],o=a.length;Sr.sets=a;try{return n()}catch(e){throw Ru(r,a.slice(o),e),e}finally{r.isFrozen||r.expressions.pop(),a.length=o,Sr.sets=i}},ws=(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},Ts=e=>!e.includes(void 0),Es=e=>e.variables.map(()=>void 0),Ds=(e,t,n)=>{let r=[...e];return r[t]=n,r},Os=(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}},ks=e=>e.kind===`Identifier`?e.name:void 0,As=(e,t,n)=>{if(t.kind===`Label`)return As(e,t.body,n);let r=ks(t);if(r===void 0)return;let i=sl(n,r);if(i?.kind===`Thunk`)return As(e,i.expression,i.scope);if(i)return;let a=e.environment.variableIndex.get(r);if(a!==void 0)return a;let o=Xl(r,e.environment);return o?.kind===`Closure`&&o.params.length===0?As(e,o.body,o.scope):void 0},js=(e,t,n)=>{if(t.kind===`Prime`)return As(e,t.expression,n);if(t.kind===`Label`)return js(e,t.body,n);let r=ks(t);if(r===void 0)return;let i=sl(n,r);if(i?.kind===`Thunk`)return js(e,i.expression,i.scope);if(i)return;let a=Xl(r,e.environment);return a?.kind===`Closure`&&a.params.length===0?js(e,a.body,a.scope):void 0},Ms=e=>{if(typeof e!=`boolean`)throw new y(`TLC expected a boolean expression.`);return e},Ns=e=>!e.isEnabled&&(e.isInit||e.environment.runtime.isWarningEnabled),Ps=(e,t,n)=>{t===void 0?Ts(n)&&e.onState(n):Ts(n)&&Ns(e)?Is(e,t,n):t.kind===`Predicate`?Ls(e,t.expression,t.rest,t.scope,n):t.kind===`Unchanged`?Ks(e,t.expression,t.rest,t.scope,n):Fs(e,t,n)&&Ps(e,t.rest,n)},Fs=(e,t,n)=>{let r=e.environment,i=W(t.expression,{environment:r,scope:t.scope,state:e.current,next:void 0}),a=(()=>{try{return W(t.expression,{environment:r,scope:t.scope,state:n,next:void 0})}catch(t){throw e.isEnabled?hd(t,r.runtime.version):t}})();return!Qt(i,a)},Is=(e,t,n)=>{for(let r=t;r!==void 0;r=r.rest){if(r.kind===`Unchanged`){Ks(e,r.expression,r.rest,r.scope,n);return}if(r.kind===`Changed`?!Fs(e,r,n):!Ms(W(r.expression,ws(e,r.scope,n))))return}e.onState(n)},Ls=(e,t,n,r,i)=>Cs(e,t,()=>{switch(t.kind){case`Let`:Ls(e,t.body,n,fu(t.definitions,ws(e,r,i)),i);return;case`Label`:Ls(e,t.body,n,r,i);return;default:if(Ws.has(t.kind))throw new y(`The state relation is not a boolean expression.`);Cs(e,t,()=>Gs(e,t,n,r,i))}}),Rs=(e,t,n,r)=>{Ms(t)&&Ps(e,n,r)},zs=(e,t,n,r,i)=>{let a=ws(e,r,i);if(t.kind===`Identifier`){let o=sl(r,t.name);if(o?.kind===`Thunk`&&o.cache===void 0){Ls(e,o.expression,n,o.scope,i);return}if(o?.kind===`Operator`&&o.operator.kind===`Closure`&&o.operator.params.length===0){Ls(e,o.operator.body,n,o.operator.scope,i);return}let s=o?void 0:e.environment.definitions.get(t.name),c=o?void 0:Xl(t.name,e.environment);if(c?.kind===`Closure`&&c.params.length===0&&!e.environment.variableIndex.has(t.name)&&!(s&&vl(s,e.environment))){Ls(e,c.body,n,c.scope,i);return}Rs(e,W(t,a),n,i);return}let o=Ql(t,a);o?.kind===`Closure`&&o.params.length===t.args.length?Ls(e,o.body,n,uu(o,t.args,a),i):Rs(e,W(t,a),n,i)},Bs=(e,t,n,r,i)=>{let a=n[r];a===void 0?Ps(e,t,Ds(n,r,i)):Qt(a,i)&&Ps(e,t,n)},Vs=(e,t,n,r)=>({kind:e,expression:t,scope:n,rest:r}),Hs=(e,t,n,r,i)=>{let[a,o]=t.args,s=e.isInit?As(e,a,r):js(e,a,r),c=ws(e,r,i);if(s===void 0){W(t,c)===!0&&Ps(e,n,i);return}let l=W(o,c),u=i[s];if(t.operator===`=`){Bs(e,n,i,s,l);return}let d=t.operator===`\\subseteq`?{kind:`Subset`,base:l}:l;if(u!==void 0)W(t,c)===!0&&Ps(e,n,i);else{if(!Zn(d))throw new y(`The right side of \\IN is not enumerable.`);for(let t of lr(d))Ps(e,n,Ds(i,s,t))}},Us=/* @__PURE__ */ new Set([`=`,`\\in`,`\\subseteq`]),Ws=/* @__PURE__ */ new Set([`Number`,`Decimal`,`String`]),Gs=(e,t,n,r,i)=>{let a=ws(e,r,i);switch(t.kind){case`Identifier`:zs(e,t,n,r,i);return;case`Apply`:if(Us.has(t.operator)&&t.args.length===2){Hs(e,t,n,r,i);return}if(t.operator===`=>`&&t.args.length===2){if(Ms(W(t.args[0],a))){Ls(e,t.args[1],n,r,i);return}Ps(e,n,i);return}zs(e,t,n,r,i);return;case`And`:{let a=t.operands;if(t.isBulleted||a.length===2){let t=a.slice(1).reduceRight((e,t)=>Vs(`Predicate`,t,r,e),n);Ls(e,a[0],t,r,i);return}let o=a[a.length-1];Ls(e,Os(t,a.length-1),Vs(`Predicate`,o,r,n),r,i);return}case`Or`:{let a=t.operands;if(t.isBulleted||a.length===2){a.forEach(t=>Ls(e,t,n,r,i));return}Ls(e,Os(t,a.length-1),n,r,i),Ls(e,a[a.length-1],n,r,i);return}case`Exists`:kl(t.bounds,a,r=>(Ls(e,t.body,n,r,i),!1));return;case`Forall`:{let r=[];if(kl(t.bounds,a,e=>(r.push(e),!1)),r.length===0){Ps(e,n,i);return}let o=r.slice(1).reduce((e,n)=>Vs(`Predicate`,t.body,n,e),n);Ls(e,t.body,o,r[0],i);return}case`If`:Ls(e,Ms(W(t.condition,a))?t.consequent:t.alternative,n,r,i);return;case`Case`:{let o=t.arms.find(e=>Ms(W(e.condition,a)))?.body??t.other;if(o===void 0)throw new y(`TLC encountered a CASE with no conditions true.`);Ls(e,o,n,r,i);return}case`FunctionApplication`:{let r=Pl(W(t.function,e.isInit?a:dl(a)));if(r){Ls(e,r.body,n,Fl(r,t,a),i);return}break}case`Unchanged`:if(!e.isInit){Ks(e,t.expression,n,r,i);return}break;case`BoxAction`:if(!e.isInit){Ls(e,t.action,n,r,i),Ks(e,t.subscript,n,r,i);return}break;case`AngleAction`:if(!e.isInit){Ls(e,t.action,Vs(`Changed`,t.subscript,r,n),r,i);return}}Rs(e,W(t,a),n,i)},Ks=(e,t,n,r,i)=>Cs(e,t,()=>{let a=As(e,t,r);if(a!==void 0){let t=e.current?.[a];t!==void 0&&Bs(e,n,i,a,t);return}if(t.kind===`Tuple`){let[a,...o]=t.elements;if(a===void 0){Ps(e,n,i);return}let s=o.reduceRight((e,t)=>Vs(`Unchanged`,t,r,e),n);Ks(e,a,s,r,i);return}if(t.kind===`Identifier`){let a=sl(r,t.name);if(a?.kind===`Thunk`){Ks(e,a.expression,n,a.scope,i);return}let o=a?void 0:Xl(t.name,e.environment);if(o?.kind===`Closure`&&o.params.length===0){Ks(e,o.body,n,o.scope,i);return}}let o=e.environment,s=W(t,{environment:o,scope:r,state:e.current,next:void 0}),c=W(t,{environment:o,scope:r,state:i,next:void 0});Qt(s,c)&&Ps(e,n,i)}),qs=(e,t,n,r,i=!1)=>{let a=e.callStack;if(!a)throw Error(`The replay needs an environment that records its call stack`);return{environment:e,callStack:a,isInit:t,isEnabled:i,current:n,onState:r}},Js=/* @__PURE__ */ Error(`The replay found a successor`),Ys=(e,t,n,r)=>{let i=qs(r,!1,n,()=>{throw Js},!0),a=i.callStack.expressions.length;try{if(e.kind===`AngleAction`&&e.location===e.action.location){let n=Vs(`Changed`,e.subscript,t,void 0);Ls(i,e.action,n,t,Es(r))}else Ls(i,e,void 0,t,Es(r));return!1}catch(e){if(e!==Js)throw e;return i.callStack.expressions.length=a,i.callStack.isFrozen=!1,!0}},Xs=(e,t,n)=>{let[r,...i]=e;if(r===void 0)return;let a=qs(t,!0,void 0,n),o=i.reduceRight((e,t)=>Vs(`Predicate`,t.expression,t.scope,e),void 0);Ls(a,r.expression,o,r.scope,Es(t))},Zs=(e,t,n,r)=>{e.some(e=>Ws.has(e.expression.kind))||e.forEach(e=>{let i=[],a=qs(n,!1,t,e=>i.push(e));Ls(a,e.expression,void 0,e.scope,Es(n)),i.forEach(t=>r(t,e))})},Qs=/* @__PURE__ */ new WeakMap,$s=/* @__PURE__ */ new WeakMap,ec=(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},tc=(e,t,n)=>{let r=e.slice();return r[t]=n,r},nc=e=>e.isInit?`initial states`:e.isEnabled?`ENABLED`:`next states`,rc=(t,r)=>{let i=new y(r);return t.isInit?i:n(i,e.error)},ic=(e,t,n,r)=>{let i=Qc(n);return r&&Ws.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 ${nc(e)}, TLC expected a boolean expression,\nbut instead found ${z(t)}.\n${i}`},ac=(e,t,n)=>{let r=zi(t),i=Zc(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 ${nc(e)}, a non-boolean expression (${r}) was used as the condition of an IF.${e.isInit?`
|
|
79
|
+
`:``}${i}`},oc=(e,t,n,r=!0)=>{let i=W(t,n);if(typeof i==`boolean`)return i;throw rc(e,ic(e,i,t,r))},sc=e=>e===`=`||e===`\\in`||e===`\\subseteq`,cc=(e,t,n)=>{let r=n?Qs:$s,i=r.get(e);if(i)return i;let a=Fc(e,t,n);return r.set(e,a),a},lc=(e,t)=>{if(t.constants.has(e))return;let n=ml(e,t);return n?.kind===`Operator`&&n.params.length===0?n:void 0},uc=(e,t,n,r=/* @__PURE__ */ new Set)=>{if(e.kind===`Prime`&&n)return uc(e.expression,t,!1,r);if(e.kind!==`Identifier`||B(e))return;let i=t.variableIndex.get(e.name);if(i!==void 0)return n?void 0:i;let a=lc(e.name,t);if(a&&!r.has(a))return r.add(a),uc(a.body,t,n,r)},dc=(e,t,n)=>uc(e,t,!n),fc=(e,t,n,r,i)=>{if(e.kind===`Prime`&&i)return fc(e.expression,t,n,r,!1);if(e.kind===`Let`){let a=fu(e.definitions,ec(r,t,n));return fc(e.body,a,n,r,i)}if(e.kind!==`Identifier`)return;let a=sl(t,e.name);if(a?.kind===`Thunk`)return fc(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=lc(e.name,r.environment);if(s)return fc(s.body,void 0,n,r,i)},pc=(e,t)=>e.kind===`Let`||e.kind===`Identifier`&&(t||B(e))||!t&&e.kind===`Prime`,mc=(e,t,n=/* @__PURE__ */ new Set)=>{if(e.kind===`Tuple`){let r=e.elements.map(e=>mc(e,t,n));return r.every(e=>e!==void 0)?r.flat():void 0}if(e.kind!==`Identifier`||n.has(e.name))return;let r=t.variableIndex.get(e.name);if(r!==void 0)return[r];let i=lc(e.name,t);if(i)return n.add(e.name),mc(i.body,t,n)},hc=/* @__PURE__ */ new Set([`Label`,`And`,`Or`,`Exists`,`Forall`,`If`,`Case`,`Let`,`Unchanged`,`BoxAction`,`AngleAction`,`FunctionApplication`]),gc=(e,t,n)=>hc.has(e.kind)?!1:e.kind===`Identifier`?t.variableIndex.has(e.name)||t.constants.has(e.name):e.kind===`Apply`?e.operator===`=>`||sc(e.operator)&&(pc(e.args[0],n)||dc(e.args[0],t,n)!==void 0)||B(e)?!1:t.definitions.get(t.substitutions.get(e.operator)??e.operator)===void 0&&t.builtins.has(e.operator):!0,_c=/* @__PURE__ */ new Set,vc=(e,t)=>{if(B(e))return e.kind===`Identifier`?t.has(e.name)?[]:[e.name]:void 0;let n=[],r={isReadOnly:!0};return Zo(e,(e,i)=>{let a=r.isReadOnly?vc(e,i.length===0?t:/* @__PURE__ */ new Set([...t,...i])):[];return a?n.push(...a):r.isReadOnly=!1,e}),r.isReadOnly?n:void 0},yc=(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||B(e)?void 0:ml(r,t);return i&&!n.has(i)&&(n.add(i),yc(i.body,t,n))?!0:hi(e).some(e=>yc(e,t,n))},bc=(e,t,n)=>{if(e.kind===`Apply`&&e.operator===`=`){let r=dc(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=mc(e.expression,t);if(n)return{kind:`Unchanged`,expression:e,indices:n}}return gc(e,t,n)?{kind:`Guard`,expression:e}:{kind:`Branch`,expression:e,runner:cc(e,t,n)}},xc=(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(xd(e,t)===void 0||yc(e,t,/* @__PURE__ */ new Set))return!0;let n=vc(e,_c);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)}},Sc=(e,t,n)=>{let r=e.map(e=>bc(e,t,n)),i=(e,t,n,a,o,s)=>{let c=a,l,u=Ns(t);for(let a=e;a<r.length;a++){if(a>0&&u&&zc(c)){l??=ec(t,n,c);for(let e=a;e<r.length;e++)if(!oc(t,r[e].expression,l,!1))return;s(c,o);return}let e=r[a];if(e.kind===`Guard`){if(l??=ec(t,n,c),!oc(t,e.expression,l))return;continue}if(e.kind===`Assign`){l??=ec(t,n,c);let r=W(e.value,l),i=c[e.index];if(i===void 0)c=tc(c,e.index,r),l=void 0;else if(!Qt(i,r))return;continue}if(e.kind===`Unchanged`){let n=t.current;if(!n)return;for(let t of e.indices){let e=c[t];if(e===void 0)c=tc(c,t,n[t]),l=void 0;else if(!Qt(e,n[t]))return}continue}let d=a+1;e.runner(t,n,c,o,!0,(e,r)=>i(d,t,n,e,r,s));return}s(c,o)};return(e,t,n,r,a,o)=>i(0,e,t,n,r,o)},Cc=e=>(t,n,r,i,a,o)=>{oc(t,e,ec(t,n,r))&&o(r,i)},wc=(e,t)=>{let n=e.args[1];return(r,i,a,o,s,c)=>{let l=t(r,i,a),u=ec(r,i,a);if(a[l]!==void 0){oc(r,e,u)&&c(a,o);return}let d=W(n,u),f=e.operator===`\\subseteq`?{kind:`Subset`,base:d}:d;if(!Zn(f)){let t=r.isEnabled?`The right side of \\IN is not enumerable.`:`In computing ${nc(r)}, the right side of \\IN is not enumerable.`;throw rc(r,`${t}\n${Zc(e)}`)}let p=lr(f);for(let e=0;e<p.length&&!r.isStopped;e++)c(tc(a,l,p[e]),o)}},Tc=/* @__PURE__ */ new WeakMap,Ec=e=>{let t=Tc.get(e);if(t)return t;let n=e.kind===`Tuple`?{kind:`And`,operands:e.elements.map(Ec),location:e.location}:{kind:`Unchanged`,expression:e,location:e.location};return Tc.set(e,n),n},Dc=(e,t)=>{let n=e.args[0],r=Cc(e),i=(e,r,i)=>fc(n,r,i,e,!t)??-1,a=wc(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],ec(t,n,o));l(tc(o,u,d),s)}},Oc=(e,t,n)=>{let r=Zc(e);return(i,a,o,s,c,l)=>{let u=ec(i,a,o),d=W(e.function,n?u:dl(u)),f=Pl(d);if(f!==void 0){cc(f.body,t,n)(i,Fl(f,e,u),o,s,c,l);return}if(!F(d))throw rc(i,`In computing ${nc(i)}, a non-function (${zi(d)}) was applied as a function.\n${r}`);let p=W(e,u);if(typeof p!=`boolean`)throw rc(i,`In computing ${nc(i)}, TLC expected a boolean expression,\nbut didn't find one.\n${r}`);p&&l(o,s)}},kc=(e,t)=>{if(mc(e,t))return Sc([Ec(e)],t,!1);if(e.kind===`Tuple`)return cc(Ec(e),t,!1);let n=Ec(e);return(r,i,a,o,s,c)=>{let l=e.kind===`Identifier`?sl(i,e.name):void 0;l?.kind===`Thunk`?cc(Ec(l.expression),t,!1)(r,l.scope,a,o,s,c):oc(r,n,ec(r,i,a))&&c(a,o)}},Ac=(e,t,n)=>{let r=e.operator,i=Cc(e),a=B(e)?void 0:Xl(r,t);if(a?.kind===`Builtin`)return i;if(a?.kind===`Closure`){let i=Zu(a,e.args,t),o={body:void 0};return(e,s,c,l,u,d)=>{o.body??=cc(a.body,t,n),o.body(e,i(ec(e,s,c)),c,u?l:r,u,d)}}return(a,o,s,c,l,u)=>{let d=ec(a,o,s),f=Ql(e,d);f?.kind===`Closure`?cc(f.body,t,n)(a,uu(f,e.args,d),s,l?c:r,l,u):i(a,o,s,c,l,u)}},jc=(e,t,n)=>{let r=Cc(e),i=B(e)?void 0:lc(e.name,t),a={body:void 0};return(o,s,c,l,u,d)=>{let f=sl(s,e.name);f?.kind===`Thunk`?cc(f.expression,t,n)(o,f.scope,c,l,u,d):f||!i?r(o,s,c,l,u,d):(a.body??=cc(i.body,t,n),a.body(o,void 0,c,u?l:i.name,u,d))}},Mc=(e,t,n)=>{if(n.has(e))return;if(n.add(e),e.kind===`And`){let n=e.operands[0];if(n.kind!==`Apply`||n.operator!==`=`||B(n))return;let r=n.args[0],i=n.args[1];if(r.kind!==`FunctionApplication`||i.kind!==`String`)return;let a=r.args.length===1?r.args[0]:void 0;if(a?.kind!==`Identifier`||!B(a))return;let o=uc(r.function,t,!1);return o===void 0?void 0:{variable:o,argument:a.name,labels:/* @__PURE__ */ new Set([i.value])}}if(e.kind===`Or`){let r=e.operands.map(e=>Mc(e,t,n)),i=r[0],a=r.every(e=>e!==void 0&&e.variable===i?.variable&&e.argument===i.argument);if(!i||!a)return;let o=new Set(r.flatMap(e=>[...e?.labels??[]]));return{variable:i.variable,argument:i.argument,labels:o}}if(e.kind!==`Apply`||B(e))return;let r=Xl(e.operator,t);if(r?.kind!==`Closure`||r.scope!==void 0)return;let i=Mc(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`&&B(o))return{variable:i.variable,argument:o.name,labels:i.labels}},Nc=(e,t,n)=>{let r=sl(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},Pc=(e,t,n)=>{let r=e.map(e=>cc(e,t,n)),i=n?[]:e.map(e=>Mc(e,t,/* @__PURE__ */ new Set)),a=i.find(e=>e!==void 0),o=i.map(e=>e?.variable===a?.variable&&e?.argument===a?.argument?e?.labels:void 0);return(e,t,n,i,s,c)=>{let l=a&&Nc(e,t,a);for(let a=0;a<r.length&&!e.isStopped;a++)(l===void 0||o[a]?.has(l)!==!1)&&r[a](e,t,n,i,s,c)}},Fc=(e,t,n)=>{let r=e=>cc(e,t,n);switch(e.kind){case`And`:return Sc(e.operands,t,n);case`Or`:return Pc(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=Sl(W(a.set,ec(n,r,o)),a.set,t.runtime.version);for(let t=0;t<u.length&&!n.isStopped;t++)i(n,cl(r,e,u[t]),o,s,c,l)}}let o=n?void 0:xc(e,t);if(o){let r=Sc(o.rest,t,n);return(n,i,a,s,c,l)=>{let u=ec(n,i,a),d=e.bounds.map(e=>Sl(W(e.set,u),e.set,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=cl(t,o.names[e],r);if(e===d.length-1){let e=ec(n,i,a);if(!o.guards.every(t=>oc(n,t,e)))continue}f(e-1,i)}};f(d.length-1,i)}}return(t,n,r,a,o,s)=>{kl(e.bounds,ec(t,n,r),e=>(i(t,e,r,a,o,s),t.isStopped))}}case`Forall`:{let i=r(e.body),a=!n&&xd(e,t)!==void 0&&!yc(e.body,t,/* @__PURE__ */ new Set)?vc(e,_c):void 0;return(t,n,r,o,s,c)=>{let l=[];kl(e.bounds,ec(t,n,r),e=>(l.push(e),!1));let u=[...l.slice(0,1),...l.slice(1).reverse()];if(a?.every(e=>sl(n,e)?.kind===`Value`)){u.every(n=>oc(t,e.body,ec(t,n,r)))&&c(r,o);return}let d=(n,r,a)=>{n===u.length?c(r,a):n>0&&t.isInit&&zc(r)?u.slice(n).every(n=>oc(t,e.body,ec(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,ec(r,i,a));if(typeof l!=`boolean`)throw rc(r,ac(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=ec(r,i,a),u=t.find(e=>{let t=W(e.condition,l);if(typeof t==`boolean`)return t;throw rc(r,`In computing ${nc(r)}, a non-boolean expression${r.isEnabled?``:` `}(${zi(t)}) was used as a guard condition of a CASE.\n${Qc(e.source)}`)})?.body??n;if(!u)throw rc(r,`In computing ${nc(r)}, TLC encountered a CASE with no conditions true.\n${Zc(e)}`);u(r,i,a,o,s,c)}}case`Let`:{let n=r(e.body),i=Cu(e.definitions,t);return(t,r,a,o,s,c)=>n(t,fu(e.definitions,ec(t,r,a),i),a,o,s,c)}case`Unchanged`:return n?()=>{throw new y(`UNCHANGED appears in an initial predicate at ${Yc(e)}`)}:kc(e.expression,t);case`AngleAction`:{let n=r(e.action),i=Ec(e.subscript),a=(e,n,r)=>{try{return oc(e,i,ec(e,n,r))}catch(n){throw e.isEnabled?hd(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 r({kind:`Or`,operands:[e.action,Ec(e.subscript)],location:e.location});case`Label`:return r(e.body);case`Identifier`:return jc(e,t,n);case`FunctionApplication`:return Oc(e,t,n);case`Apply`:{let i=e.args;if(sc(e.operator)){let r=dc(i[0],t,n);if(r!==void 0)return e.operator===`=`?Sc([e],t,n):wc(e,()=>r);if(pc(i[0],n))return Dc(e,n)}if(e.operator===`=>`){let e=r(i[1]);return(t,n,r,a,o,s)=>{let c=W(i[0],ec(t,n,r));(typeof c==`boolean`?c:pl(c,`the left side of => at ${Yc(i[0])}`))?e(t,n,r,a,o,s):s(r,a)}}return Ac(e,t,n)}default:return Cc(e)}},Ic=/* @__PURE__ */ new WeakMap,Lc=e=>{let t=Ic.get(e);if(t)return t;let n=e.variables.map(()=>void 0);return Ic.set(e,n),n},Rc=(e,t)=>t.variables.filter((t,n)=>e[n]===void 0),zc=e=>{for(let t=0;t<e.length;t++)if(e[t]===void 0)return!1;return!0},Bc=(e,t)=>{let n=t.state;if(!n||!zc(n))throw new y(`ENABLED needs a complete state at ${Yc(e)}`);let r=t.environment;if(r.callStack)return Ys(e,t.scope,n,r);let i={environment:r,isInit:!1,isEnabled:!0,current:n,isStopped:!1};return cc(e,r,!1)(i,t.scope,Lc(r),void 0,!1,()=>{i.isStopped=!0}),i.isStopped},Vc=(t,r,i,a)=>{let o={environment:r,isInit:!0,isEnabled:!1,current:void 0,isStopped:!1};cc(t,r,!0)(o,a,Lc(r),void 0,!1,t=>{if(!o.isStopped){if(!zc(t))throw n(new ne([...t]),e.error);o.isStopped=i(t)}})},Hc=(e,t,n)=>{let r=[];return Vc(e,t,e=>(r.push(e),!1),n),r},Uc=(e,t,n,r,i)=>{let a={environment:n,isInit:!1,isEnabled:!1,current:t,isStopped:!1},o={successors:0};return cc(e,n,!1)(a,i,Lc(n),void 0,!1,(e,t)=>{if(!a.isStopped){if(!zc(e)){let r=Rc(e,n);throw new ee(`Successor state is not completely specified by action ${t??`Next`}. The following variables are not assigned: ${r.join(`, `)}`,e,t,r)}o.successors++,a.isStopped=r({state:e,action:t})}}),o.successors},Wc=(e,t,n,r)=>{let i=[];return Uc(e,t,n,e=>(i.push(e),!1),r),i},Gc=/* @__PURE__ */ new Set([`SUBSET`,`UNION`,`DOMAIN`,`\\cup`,`\\cap`,`\\`]),Kc=/* @__PURE__ */ new Set([`SetEnumeration`,`SetFilter`,`SetMap`,`Tuple`,`FunctionSet`,`Record`,`RecordSet`,`Product`]),qc=e=>Kc.has(e.kind)||e.kind===`Apply`&&Gc.has(e.operator),Jc=(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&<(n)?e.args[0]:e.args[1]}return e.operator===`\\in`||e.operator===`\\notin`?e.args[1]:void 0}},Yc=e=>`line ${e.location.line}, column ${e.location.column}`,Xc=e=>`line ${e.start.line}, col ${e.start.column} to line ${e.end.line}, col ${e.end.column} of module ${e.module}`,Zc=e=>{let t=e.location.range;return t?Xc(t):Yc(e)},Qc=e=>e.kind===`Number`?e.text??String(e.value):Zc(e),$c=(e,t)=>new y(`A non-boolean expression (${zi(t)}) was used as the condition of an IF.\n${Zc(e)}`),el=(e,t,n)=>{let r=e.location.range;if(r?.start.line===e.location.line&&r.start.column===e.location.column||!r)return new y(`A non-boolean expression (${zi(n)}) was used as a formula in a ${e.kind===`And`?`conjunction`:`disjunction`}.\n${Qc(e.operands[t])}`);let i=e.prefixEnds?.[Math.max(t,1)-1]??r.end;return new y(`Attempted to evaluate an expression of form P ${e.kind===`And`?`/\\`:`\\/`} Q when ${t===0?`P`:`Q`} was\n${zi(n)}.\n${Zc({...e,location:{...e.location,range:{...r,end:i}}})}`)},tl=e=>{let t=e.field,n=n=>`Attempted to select nonexistent field "${t}" from the record\n${z(n)}\n${Zc(e)}`,r=e=>`Attempted to apply function:\n${N(z(e))}\nto argument "${t}", which is not in the domain of the function.`;return i=>{if(!F(i))throw new y(`Attempted to select field "${t}" from a non-record value ${N(z(i))}\n${Zc(e)}`);let a=Ut(i);if(a===`tuple`)throw jr(t);return Nr(i,t,a===`record`?n:r)}},nl=e=>e===`1.7.4`?(t,n)=>Or(t,n,e):void 0,rl=e=>t=>{if(!F(t))throw new y(`Attempted to apply the operator DOMAIN to a non-function\n(${zi(t)})\n${Zc(e)}`);return Fr(t)},il=(e,t)=>(n,r)=>{if(!P(n)||jt(n))throw new y(`Attempted to evaluate an expression of form S \\subseteq T, but S was not enumerable.\n${Zc(e)}`);return t.evaluate([n,r])},al=t=>n(new y(`TLC can't handle real numbers: ${t.text} at ${Yc(t)}`),e.configParseError),ol=t=>n(new y(`TLC can't handle a number this big: ${t.text??t.value} at ${Yc(t)}`),e.error),sl=(e,t)=>{for(let n=e;n;n=n.parent)if(n.name===t)return n.binding},cl=(e,t,n)=>({name:t,binding:{kind:`Value`,value:n},parent:e}),ll=(e,t,n)=>{if(t.kind===`Name`)return cl(e,t.name,n);let r=br(n);if(!r||r.length!==t.names.length)throw new y(`Cannot bind <<${t.names.join(`, `)}>> to ${z(n)}, which is not a tuple of that length`);return t.names.reduce((e,t,n)=>cl(e,t,r[n]),e)},ul=(e,t)=>{if(F(e))return e;throw new y(`A non-function (${zi(e)}) was applied as a function.\n${Zc(t)}`)},dl=e=>e.isKeepLazy?e:{...e,isKeepLazy:!0},fl=(e,t)=>({environment:e.environment,scope:t,state:e.state,next:e.next,isKeepLazy:e.isKeepLazy}),pl=(e,t)=>{if(typeof e!=`boolean`)throw new y(`Expected ${t} to be a boolean but found ${z(e)}`);return e},ml=(e,t)=>t.definitions.get(t.substitutions.get(e)??e),hl=/* @__PURE__ */ new Set([`Prime`,`Unchanged`,`Enabled`,`BoxAction`,`AngleAction`,`Always`,`Eventually`,`WeakFairness`,`StrongFairness`]),gl=/* @__PURE__ */ new Set([`~>`,`-+->`,`\\cdot`]),_l=(e,t)=>{if(hl.has(e.kind)||e.kind===`UnboundedQuantifier`&&e.isTemporal===!0||e.kind===`Apply`&&gl.has(e.operator))return!0;let n=e.kind===`Identifier`?e.name:e.kind===`Apply`?e.operator:void 0;if(n!==void 0){if(t.variableIndex.has(n)||t.builtins.get(n)?.isStateLevel)return!0;let e=ml(n,t);if(e&&!t.constants.has(n)&&!vl(e,t))return!0}return hi(e).some(e=>_l(e,t))},vl=(e,t)=>{let n=t.constantLevels.get(e);if(n!==void 0)return n;t.constantLevels.set(e,!0);let r=!_l(e.body,t)&&(e.kind===`Operator`||!e.bounds.some(e=>_l(e.set,t)));return t.constantLevels.set(e,r),r},yl=(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.`},bl=(e,t,n)=>{if(!P(e)||jt(e)){let r=z(e),i=n===`1.7.4`?void 0:yl(e,r);throw new y(i===void 0?`TLC encountered a non-enumerable quantifier bound\n${r}.\n${Qc(t)}`:`TLC encountered the non-enumerable quantifier bound\n${r}\n${Qc(t)}\n${i}`)}},xl=(e,t,n)=>(bl(e,t,n),typeof e==`object`&&e.kind===`Interval`?Gn(e):ir(e)??R(e).elements),Sl=(e,t,n)=>n===`1.7.4`?(bl(e,t,n),ir(e)??lr(e)):xl(e,t,n),Cl=e=>{if(typeof e==`object`&&e.kind===`Interval`)return gr(e),e},wl=(e,t,n)=>Cl(e)??Sl(e,t,n),Tl=(e,t,n)=>Cl(e)??xl(e,t,n),El=(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},Dl=(e,t)=>e.map(e=>wl(W(e.set,t),e.set,t.environment.runtime.version)),Ol=(e,t,n,r)=>{let i=(n,a)=>n<0?r(a):El(t[n],t=>i(n-1,ll(a,e[n].pattern,t)));return i(e.length-1,n)},kl=(e,t,n)=>Ol(e,Dl(e,t),t.scope,n),Al=(e,t)=>{let n=e.map(e=>W(e.set,t));return n.length===1?n[0]:{kind:`ProductSet`,factors:n}},jl=(e,t,n)=>{if(e.length===1)return ll(t,e[0].pattern,n);let r=br(n)??[];return e.reduce((e,t,n)=>ll(e,t.pattern,r[n]),t)},Ml=/* @__PURE__ */ new WeakMap,Nl=e=>(Ml.set(e.value,e),e.value),Pl=e=>typeof e==`object`&&e.kind===`LazyFunction`?Ml.get(e):void 0,Fl=(e,t,n)=>{let r=e.value,i=t.args.map(e=>W(e,n)),a=i.length===1?i[0]:Yn(i),o=(e,n,i)=>`In applying the function\n${N(z(r))},\nthe ${e} is:\n${N(z(n))}${i}.\n${Zc(t.function)}`,s=e.bounds;if(s.length===1){if(!wr(a,r.domain))throw new y(o(`first argument`,a,`which is not in its domain`));return jl(s,e.scope,a)}let c=br(a),l=typeof r.domain==`object`&&r.domain.kind===`ProductSet`?r.domain.factors:[];if(c===void 0||c.length<s.length)throw new y(`Attempted to apply a function to an argument not in its domain.\n${Zc(t.function)}`);return s.forEach((e,t)=>{let n=c[t],r=`argument number ${t+1}`;if(!wr(n,l[t]))throw new y(o(r,n,`${e.pattern.kind===`Name`?``:`
|
|
80
|
+
`}which is not in its domain`));if(e.pattern.kind===`Tuple`&&br(n)?.length!==e.pattern.names.length)throw new y(o(r,n,`which does not match its formal parameter`))}),jl(s,e.scope,Yn(c.slice(0,s.length)))},Il=/* @__PURE__ */ new WeakMap,Ll=(e,t)=>{let n=Il.get(t);if(n)return n;let r=t.location.range;if(!r)return;let i={parameters:e.flatMap((t,n)=>n>0&&e[n-1].set===t.set?[]:[{index:n,name:t.pattern.kind===`Name`?t.pattern.name:`<<${t.pattern.names.join(`, `)}>>`}]),body:Xc(r)};return Il.set(t,i),i},Rl=(e,t,n)=>{let r=Ll(e,t);if(!r)return;let i=e.length>1&&typeof n==`object`&&n.kind===`ProductSet`?n.factors:[n];return{parameters:r.parameters.map(e=>({name:e.name,domain:i[e.index]})),body:r.body}},zl=(e,t,n)=>{let r=/* @__PURE__ */ new Map,i={kind:`LazyFunction`,domain:e,source:n,apply:e=>{let n=Jr(e),a=r.get(n);if(a!==void 0){for(let t=0;t<a.length;t+=2)if(en(a[t],e))return a[t+1]}let o=t(e,i),s=r.get(n);return s===void 0?r.set(n,[e,o]):s.push(e,o),o}};return i},Bl=/* @__PURE__ */ new WeakMap,Vl=e=>{let t=Bl.get(e);if(t)return t;let n={kind:`FunctionConstruction`,bounds:e.bounds,body:e.body,location:e.location};return Bl.set(e,n),n},Hl=(e,t)=>{let n=Al(e.bounds,t),r=zl(n,(n,r)=>W(e.body,fl(t,jl(e.bounds,cl(void 0,e.name,r),n))),Rl(e.bounds,e.body,n));return Nl({value:r,bounds:e.bounds,body:e.body,scope:cl(void 0,e.name,r)}),e.bounds.length===1?Wt(r):r},Ul=(e,t)=>{if(typeof t!=`object`||Ut(t)!==`lambda`||e.kind===`Operator`||e.isSelfReferential||t.kind!==`LazyFunction`||!lt(t.domain))return t;try{let e=Dr(t);return Bt(e.domain,e.range)}catch(e){if(e instanceof y)return t;throw e}},Wl=(e,t)=>e.kind===`Function`?e.isSelfReferential?Hl(e,t):W(Vl(e),t):W(e.body,t),Gl=(e,t)=>{let n=vl(e,t.environment),r=n?t.environment.definitionValues.get(e):void 0;if(r!==void 0)return r;if(e.kind===`Operator`&&e.params.length>0)throw new y(`Operator ${e.name} requires ${e.params.length} arguments`);let i=fl(t,void 0);if(!n)return Wl(e,i);let a=t.environment.runtime.evaluateAtStartup(()=>Ul(e,Wl(e,i)));return t.environment.definitionValues.set(e,a),a},Kl=(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))&&vl(e,t))try{An(Gl(e,{environment:t,scope:void 0,state:void 0,next:void 0}))}catch(e){if(!(e instanceof y)&&!c(e))throw e}}),ql=(e,t)=>{let n=e.state===t.state&&e.next===t.next;if(n&&e.cache!==void 0)return e.cache;let r=W(e.expression,fl(t,e.scope));return n&&(e.cache=r),r},Jl=/* @__PURE__ */ new WeakMap,Yl=e=>{let t=Jl.get(e);if(t)return t;let n={kind:`Closure`,name:e.name,params:e.params,body:e.body,scope:void 0};return Jl.set(e,n),n},Xl=(e,t)=>{let n=t.substitutions.get(e);if(n!==void 0)return Xl(n,t);let r=t.definitions.get(e);return r?.kind===`Operator`?Yl(r):t.builtins.get(e)},Zl=/* @__PURE__ */ new WeakMap,Ql=(e,t)=>{if(B(e))return $l(e.operator,t);let n=Zl.get(e),r=n===void 0?Xl(e.operator,t.environment)??null:n;return n===void 0&&Zl.set(e,r),r??$l(e.operator,t)},$l=(e,t)=>{let n=sl(t.scope,e);if(n?.kind===`Operator`)return n.operator;if(!n)return Xl(e,t.environment)},eu=e=>e.kind===`Closure`?e.params.length:e.arity,tu=(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:$l(n,t);if(!r)throw new y(`Expected an operator argument at ${Yc(e)}`);return r},nu=(e,t,n)=>{if(e.kind===`Builtin`)return e.evaluate(t,n);if(e.kind===`Operator`)return e.call(t);let r=e.params.reduce((e,n,r)=>cl(e,n.name,t[r]),e.scope);return W(e.body,fl(n,r))},ru=(e,t)=>e.kind===`Operator`?e:{kind:`Operator`,name:e.name,arity:eu(e),call:n=>nu(e,n,t),literalBody:e.kind===`Closure`&&(e.body.kind===`Number`||e.body.kind===`String`)?e.body.value:void 0},iu=(e,t)=>{if(e.kind===`Lambda`||e.kind===`OperatorReference`)return!0;if(e.kind!==`Identifier`)return!1;let n=$l(e.name,t);return n!==void 0&&eu(n)>0},au=(e,t)=>({kind:`Thunk`,expression:e,scope:t.scope,state:t.state,next:t.next,cache:void 0}),ou=(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 ou(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([])}},su=(e,t)=>{if(e.kind===`String`||e.kind===`Number`&&mu(e.value)){let t={kind:`Value`,value:e.value};return()=>t}if(e.kind===`Identifier`){let n=B(e)?void 0:ou(e.name,t);if(n?.kind===`Value`){let e={kind:`Value`,value:n.value};return()=>e}if(n===void 0)return t=>{let n=sl(t.scope,e.name);return n?.kind===`Value`||n?.kind===`Thunk`?n:au(e,t)}}return t=>au(e,t)},cu=/* @__PURE__ */ new WeakMap,lu=(e,t)=>{let n=cu.get(e);if(n)return n;let r=su(e,t);return cu.set(e,r),r},uu=(e,t,n)=>{if(t.length!==e.params.length)throw new y(`Operator ${e.name} expects ${e.params.length} arguments but received ${t.length}`);let r=e.scope;for(let i=0;i<t.length;i++){let a=e.params[i],o=a.arity>0?{kind:`Operator`,operator:tu(t[i],n)}:lu(t[i],n.environment)(n);r={name:a.name,binding:o,parent:r}}return r},du=(e,t,n)=>e.kind===`Closure`?W(e.body,fl(n,uu(e,t,n))):e.kind===`Operator`?e.call(t.map(e=>W(e,n))):e.isLazy?e.evaluate(Yu(t,n),n):e.evaluate(t.map(e=>iu(e,n)?ru(tu(e,n),n):W(e,n)),n),fu=(e,t,n)=>e.reduce((e,r)=>{let i={name:r.name,binding:{kind:`Value`,value:!1},parent:e};return r.kind===`Function`?(i.binding={kind:`Thunk`,expression:{kind:`FunctionConstruction`,bounds:r.bounds,body:r.body,location:r.location,isRecursive:!0},scope:i,state:t.state,next:t.next,cache:void 0},i):r.params.length>0||n?.has(r)?(i.binding={kind:`Operator`,operator:{kind:`Closure`,name:r.name,params:r.params,body:r.body,scope:i}},i):(i.binding={kind:`Thunk`,expression:r.body,scope:i,state:t.state,next:t.next,cache:void 0},i)},t.scope),pu=(e,t,n)=>{let r=sl(n.scope,e);if(r?.kind===`Value`)return r.value;if(r?.kind===`Thunk`)return ql(r,n);if(r?.kind===`Operator`){if(eu(r.operator)===0)return nu(r.operator,[],n);throw new y(`Operator ${e} is used without arguments`)}let i=ou(e,n.environment);if(i?.kind===`Variable`){let r=n.state?.[i.index];if(r===void 0)throw md(e,t);return r}if(i?.kind===`Value`)return i.value;if(i?.kind===`Definition`)return Gl(i.definition,n);let a=n.environment.builtins.get(e);if(a?.arity===0)return a.evaluate([],n);throw new y(`Unknown identifier ${e} at ${Yc(t)}`)},mu=e=>Number.isInteger(e)&&e<=2147483647&&e>=-2147483648,hu=/* @__PURE__ */ new Set([`Print`,`PrintT`,`Assert`,`JavaTime`,`RandomElement`,`TLCGet`,`TLCSet`]),gu=(e,t)=>hu.has(e)||t.builtins.get(e)?.isStateLevel===!0,_u={builtins:hu,definitions:/* @__PURE__ */ new WeakMap},vu={builtins:new Set([...hu].filter(e=>e!==`Assert`)),definitions:/* @__PURE__ */ new WeakMap},yu=(e,t)=>e.kind===`Operator`&&e.params.length===0&&vl(e,t),bu=(e,t,n)=>{let r=e.kind===`Identifier`?e.name:e.kind===`Apply`||e.kind===`OperatorReference`?e.operator:void 0;if(r!==void 0&&!B(e)){let e=ml(r,t),i=n.builtins.has(r)||t.builtins.get(r)?.isStateLevel===!0;if(!e&&i||e&&!yu(e,t)&&xu(e,t,n))return!0}return hi(e).some(e=>bu(e,t,n))},xu=(e,t,n=_u)=>{let r=n.definitions.get(e);if(r!==void 0)return r;n.definitions.set(e,!1);let i=bu(e.body,t,n)||e.kind===`Function`&&e.bounds.some(e=>bu(e.set,t,n));return n.definitions.set(e,i),i},Su={builtins:/* @__PURE__ */ new Set([`UNION`,`\\cup`]),definitions:/* @__PURE__ */ new WeakMap},Cu=(e,t)=>new Set(e.filter(e=>xu(e,t)||xu(e,t,Su))),wu=e=>[...e.definitions.values()].some(t=>xu(t,e)),Tu=e=>[...e.definitions.values()].some(t=>xu(t,e,vu)),Eu=/* @__PURE__ */ new WeakMap,Du=(e,t)=>{let n=Eu.get(e);if(n!==void 0)return n;let r=ju(e,t,ku);return Eu.set(e,r),r},Ou=/* @__PURE__ */ new Set([`Number`,`String`,`Identifier`,`Apply`,`And`,`Or`,`If`,`Case`,`SetEnumeration`,`Tuple`,`FunctionSet`,`Record`,`RecordSet`,`FunctionApplication`,`FieldAccess`,`Product`,`SetFilter`,`SetMap`,`Forall`,`Exists`,`Choose`,`FunctionConstruction`,`Let`]),ku=/* @__PURE__ */ new Set,Au=(e,t,n)=>n.size===0?Du(e,t):ju(e,t,n),ju=(e,t,n)=>{if(!Ou.has(e.kind))return!1;if(e.kind===`Identifier`&&B(e))return n.has(e.name);if(B(e))return!1;if(e.kind===`Identifier`){let n=ou(e.name,t);return n?.kind===`Value`||n?.kind===`Definition`&&yu(n.definition,t)}if(e.kind===`Apply`){if(gu(e.operator,t)||Su.builtins.has(e.operator)||e.operator===`~>`)return!1;let r=Xl(e.operator,t);if(r?.kind!==`Builtin`&&r?.kind!==`Closure`)return!1;if(r.kind===`Closure`){let n=ml(e.operator,t);if(!n||!vl(n,t)||xu(n,t))return!1}return!(r.kind===`Closure`?r.params:[]).some(e=>e.arity>0)&&e.args.every(e=>e.kind!==`Lambda`&&e.kind!==`OperatorReference`&&Au(e,t,n))}let r={value:!0};return Zo(e,(e,i)=>(r.value&&=Au(e,t,i.length===0?n:/* @__PURE__ */ new Set([...n,...i])),e)),r.value},Mu=e=>e.kind!==`Number`&&e.kind!==`String`&&e.kind!==`Identifier`,Nu=e=>{let t={value:void 0};return n=>{if(t.value!==void 0)return t.value;let r=e(n);return t.value=r,r}},Pu=(e,t)=>{if(e.kind===`Identifier`&&B(e))return!t.has(e.name);if(B(e))return!0;let n={value:!1};return Zo(e,(e,r)=>(n.value||=Pu(e,r.length===0?t:/* @__PURE__ */ new Set([...t,...r])),e)),n.value},Fu=(e,t)=>Uo.has(e)&&Mu(e)&&xd(e,t)!==void 0&&!Pu(e,ku),Iu=/* @__PURE__ */ new WeakMap,Lu=(e,t,n,r)=>i=>{r.expressions.push(e);let a=Sr.sets,o=Sr.callStack,s=a??[],c=s.length;Sr.sets=s,Sr.callStack=r;try{let a=t(i),o=typeof a==`object`&&a.kind===`FilteredSet`?Iu.get(a):void 0,s=o?o(n):a;return r.values.set(e,s),typeof s==`object`&&s.kind!==`FilteredSet`&&qc(e)&&r.sources.set(s,e),s}catch(t){let n=t instanceof Error?r.failures.get(t):void 0;t instanceof Error&&r.failures.set(t,e);let i=Jc(e,r.values),a=i&&!hi(e).some(e=>e===n)?r.values.get(i):void 0,o=e.kind===`FunctionApplication`&&a!==void 0&&!F(a)?void 0:a;throw Ru(r,[o,...s.slice(c).filter(e=>e!==o)],t),t}finally{r.isFrozen||r.expressions.pop(),s.length=c,Sr.sets=a,Sr.callStack=o}},Ru=(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 y){e.isFrozen||e.expressions.push(...r);let t=e.fingerprint;e.fingerprint={sources:[...r,...t?.sources??[]],reason:t?.reason??n.message}}e.isFrozen=!0},zu=(e,t,n)=>{if(!(n instanceof y))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}},Bu=e=>({...e,evaluators:/* @__PURE__ */ new WeakMap,callStack:{expressions:[],isFrozen:!1,sources:/* @__PURE__ */ new WeakMap,values:/* @__PURE__ */ new WeakMap,failures:/* @__PURE__ */ new WeakMap}}),Vu=(e,t)=>{let n=t.evaluators.get(e);if(n)return n;let r=vd(e,t),i=t.callStack,a=i?Lu(e,r,t,i):Mu(e)&&Du(e,t)?Nu(r):Fu(e,t)?Ku(r):r;return t.evaluators.set(e,a),a},Hu=/* @__PURE__ */ new WeakMap,Uu=(e,t)=>{if(t.callStack)return Vu(e,t);let n=Hu.get(e);if(n)return n;let r=(Mu(e)&&Du(e,t)?void 0:oa(e,t))??Vu(e,t);return Hu.set(e,r),r},W=(e,t)=>Uu(e,t.environment)(t),Wu=(e,t)=>{let n=e.name,r=B(e)?void 0:ou(n,t);if(r?.kind===`Variable`){let t=r.index;return r=>{let i=r.state?.[t];if(i===void 0)throw md(n,e);return i}}if(r?.kind===`Value`){let e=r.value;return()=>e}if(r?.kind===`Definition`&&r.definition.kind===`Operator`){let e=r.definition;if(e.params.length===0&&vl(e,t))return t=>Gl(e,t);if(e.params.length===0){let n={body:void 0},r=r=>(n.body??=Uu(e.body,t),n.body(fl(r,void 0)));return Gu(e,t)?Ku(r):r}return t=>Gl(e,t)}if(r?.kind===`Definition`){let e=r.definition,n=t=>Gl(e,t);return vl(e,t)||!Gu(e,t)?n:Ku(n)}return t=>pu(n,e,t)},Gu=(e,t)=>xd(e.body,t)!==void 0&&(e.kind===`Operator`||e.bounds.every(e=>xd(e.set,t)!==void 0)),Ku=e=>{let t={recent:void 0,recentValue:void 0,previous:void 0,previousValue:void 0};return n=>{let r=n.state;if(r!==void 0&&t.recent===r&&t.recentValue!==void 0)return t.recentValue;if(r!==void 0&&t.previous===r&&t.previousValue!==void 0)return t.previousValue;let i=e(n);return t.previous=t.recent,t.previousValue=t.recentValue,t.recent=r,t.recentValue=i,i}},qu=(e,t)=>{let n=Xl(e,t);return n!==void 0&&eu(n)>0},Ju=(e,t)=>e.kind!==`Lambda`&&e.kind!==`OperatorReference`&&!(e.kind===`Identifier`&&!B(e)&&qu(e.name,t)),Yu=(e,t)=>e.map(e=>({kind:`Operator`,name:`argument`,arity:0,call:()=>W(e,t),expression:e})),Xu=(e,t,n)=>{if(e.isLazy)return n=>e.evaluate(Yu(t,n),n);let r=e.evaluateUnary;if(r&&t.length===1&&Ju(t[0],n)){let e=Vu(t[0],n);return t=>r(e(t))}let i=e.evaluateBinary,a=t.length===2&&Ju(t[0],n)&&Ju(t[1],n);if(i&&a){let e=Vu(t[0],n),r=Vu(t[1],n);return t=>i(e(t),r(t))}return n=>e.evaluate(t.map(e=>iu(e,n)?ru(tu(e,n),n):W(e,n)),n)},Zu=(e,t,n)=>{if(t.length!==e.params.length)return()=>{throw new y(`Operator ${e.name} expects ${e.params.length} arguments but received ${t.length}`)};let r=e.params,i=t.map((e,t)=>r[t].arity>0?void 0:lu(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:tu(t[e],n)};a={name:r[e].name,binding:s,parent:a}}return a}},Qu=/* @__PURE__ */ new WeakMap,$u=e=>{let t=Qu.get(e);if(t)return t;let n={calls:/* @__PURE__ */ new Map,size:0};return Qu.set(e,n),n},ed=(e,t)=>{let n=[];for(let r=e;n.length<t;r=r?.parent){if(r?.binding.kind!==`Value`)return;n.push(r.binding.value)}return n},td=(e,t)=>e.every((e,n)=>en(e,t[n])),nd=(e,t)=>{let n=ml(e.operator,t);return n?.kind===`Operator`&&n.params.length>0&&n.params.every(e=>e.arity===0)&&vl(n,t)&&!xu(n,t)},rd=(e,t,n,r)=>{let i=Zu(e,t,n),a={body:void 0},o=(t,r)=>(a.body??=Uu(e.body,n),a.body({environment:n,scope:t,state:r.state,next:r.next,isKeepLazy:r.isKeepLazy}));if(!r)return e=>o(i(e),e);let s=$u(e);return e=>{let n=i(e),r=ed(n,t.length);if(!r||e.isKeepLazy)return o(n,e);let a=r.length;for(let e of r)a=zr(a,Jr(e));let c=s.calls.get(a),l=c?.find(e=>td(e.args,r));if(l)return l.value;let u=o(n,e);return s.size<65536&&(s.size++,c?c.push({args:r,value:u}):s.calls.set(a,[{args:r,value:u}])),u}},id=(e,t)=>{let n=e.args;if(e.operator===`=>`){let e=Vu(n[0],t),r=Vu(n[1],t);return t=>!pl(e(t),`the left side of =>`)||pl(r(t),`the right side of =>`)}if(e.operator===`~>`)return()=>{throw new y(`TLC cannot evaluate a temporal formula such as ~> in a state`)};let r=B(e)?void 0:Xl(e.operator,t);if(r?.kind===`Closure`){let i=!t.callStack&&nd(e,t);return rd(r,n,t,i)}if(r?.kind===`Builtin`&&r.name===`DOMAIN`){let r=Vu(n[0],t),i=rl(e);return e=>i(r(e))}if(r?.kind===`Builtin`&&r.name===`TLCEval`&&n.length===1){let i=Vu(n[0],t);return Wo.has(e)||_l(n[0],t)?i:e=>e.scope===void 0?r.evaluate([i(e)]):i(e)}if(r?.kind===`Builtin`&&r.name===`\\subseteq`&&n.length===2){let i=Vu(n[0],t),a=Vu(n[1],t),o=il(e,r);return e=>o(i(e),a(e))}return r?.kind===`Builtin`?Xu(r,n,t):e.operator===`\\cdot`&&n.length===2?()=>{throw new y(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.`)}:r=>{let i=$l(e.operator,r);if(i)return du(i,n,r);throw t.definitions.get(e.operator)?.kind===`Function`?new y(`${e.operator} is a function; apply it with brackets`):new y(`Unknown operator ${e.operator} at ${Yc(e)}`)}},ad=(e,t)=>{let n=e.kind===`Forall`,r=n?`the body of \\A`:`the body of \\E`,i=Vu(e.body,t),a=e.bounds[0];if(e.bounds.length===1&&a.pattern.kind===`Name`){let e=a.pattern.name,o=Vu(a.set,t);return s=>El(wl(o(s),a.set,t.runtime.version),t=>pl(i(fl(s,cl(s.scope,e,t))),r)!==n)?!n:n}let o=e.bounds;if(o.every(e=>e.pattern.kind===`Name`)){let e=o.map(e=>e.pattern.kind===`Name`?e.pattern.name:``),a=o.map(e=>Vu(e.set,t));return s=>{let c=a.map((e,n)=>wl(e(s),o[n].set,t.runtime.version)),l=(t,a)=>t<0?pl(i(fl(s,a)),r)!==n:El(c[t],n=>l(t-1,cl(a,e[t],n)));return l(o.length-1,s.scope)?!n:n}}return e=>kl(o,e,t=>pl(i(fl(e,t)),r)!==n)?!n:n},od=(e,t)=>{if(e.kind===`Tuple`)return Yn(e.names.map(e=>{let n=sl(t,e);return n?.kind===`Value`&&n.value}));let n=sl(t,e.name);return n?.kind===`Value`?n.value:void 0},sd=/* @__PURE__ */ new WeakSet,cd=e=>{(e.kind===`FunctionConstruction`||e.kind===`Except`)&&sd.add(e)},ld=(e,t)=>{let n=sd.has(e),r=Vu(e.body,t),i=e.bounds,a=i[0],o=i.length===1&&a.pattern.kind===`Name`,s=Vu(a.set,t),c=(e,t)=>{if(o&&a.pattern.kind===`Name`){let n=a.pattern.name,i=qn(e),o=Bt(i,i.map(e=>r(fl(t,cl(t.scope,n,e)))));return lt(e)?o:Wt(o)}let n=[],s=i.map(e=>Tl(W(e.set,t),e.set,t.environment.runtime.version));return Ol(i,s,t.scope,e=>{let o=i.length===1?od(a.pattern,e)??!1:Yn(i.map(t=>od(t.pattern,e)??!1));return n.push([o,r(fl(t,e))]),!1}),zn(n)},l=(t,n)=>{let a=Nl({value:zl(t,e=>r(fl(n,jl(i,n.scope,e))),Rl(i,e.body,t)),bounds:i,body:e.body,scope:n.scope});return i.length===1?Wt(a):a},u=t.callStack;return t=>{let r=o?s(t):Al(i,t);if(e.isRecursive||n||t.isKeepLazy||!L(r))return l(r,t);if(!lt(r)){if(u)return l(r,t);try{return c(r,t)}catch(e){if(!(e instanceof y))throw e;return l(r,t)}}if(!u)return c(r,t);try{return c(r,t)}catch(t){throw zu(u,e,t),t}}},ud=(e,t)=>{let n=sd.has(e);n&&cd(e.function);let r=Vu(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=>Vu(e,t))}),value:Vu(e.value,t)})),a=(e,t)=>e.kind===`Field`?e.name:e.args.length===1?e.args[0](t):Yn(e.args.map(e=>e(t))),o=(e,t,r,i,s)=>r===t.length?s(fl(i,cl(i.scope,`@`,e))):Ir(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={value:!1};n=o(n,r.path,0,t,e=>(i.value=!0,r.value(e))),i.value||t.environment.runtime.warn(sa.exceptAppliedToUnknownField,`The EXCEPT was applied to non-existing fields of the value at\n${Zc(e.function)}`)}return n}},dd=(e,t)=>{if(e.kind===`SetFilter`){let n=Vu(e.predicate,t),r=Vu(e.bound.set,t),i=e.bound.pattern,a=e.predicate.location.range,o=a&&{names:i.kind===`Name`?i.name:i.names.join(`, `),predicate:Xc(a)},s=(e,t)=>n=>pl(e(fl(t,ll(t.scope,i,n))),`a set filter predicate`),c=(t,n,r)=>{let i={kind:`FilteredSet`,base:t,test:s(r,n),source:o};return Iu.set(i,r=>c(t,{...n,environment:r},Vu(e.predicate,r))),i};return e=>{let t=r(e);return lt(t)?zt(R(t).elements.filter(s(n,e))):c(t,e,n)}}if(e.kind===`SetMap`){let n=Vu(e.expression,t);return t=>{let r=[];return kl(e.bounds,t,e=>(r.push(n(fl(t,e))),!1)),Pn(r)}}let n=e.set;if(!n)return()=>{throw new y(`TLC cannot evaluate an unbounded CHOOSE at ${Yc(e)}`)};let r=Vu(e.body,t),i=Vu(n,t);return t=>{let a=i(t);if(!P(a)||jt(a))throw new y(`Attempted to compute the value of an expression of\nform CHOOSE x \\in S: P, but S was not enumerable.\n${Zc(e)}`);let o={value:void 0},s=Tl(a,n,t.environment.runtime.version);if(El(s,n=>{let i=ll(t.scope,e.pattern,n);return pl(r(fl(t,i)),`the body of CHOOSE`)?(o.value=od(e.pattern,i),!0):!1}),o.value===void 0)throw new y(`Attempted to compute the value of an expression of form\nCHOOSE x \\in S: P, but no element of S satisfied P.\n${Zc(e)}`);return o.value}},fd=e=>[...e].sort((e,t)=>It(e.name,t.name)),pd=e=>e.some((t,n)=>n>0&&e[n-1].name===t.name),md=(e,t)=>new te(`In evaluation, the identifier ${e} is either undefined or not an operator.\n${Zc(t)}`,e),hd=(e,t)=>e instanceof te&&t!==`1.7.4`?new y(`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,gd=e=>new y(`A primed expression appears outside an action at ${Yc(e)}`),_d=(e,t)=>{let n=fd(e),r=pd(n),i=n.map(e=>Vu(e.value,t));if(r)return e=>Xn(n.map((t,n)=>[t.name,i[n](e)]));let a=n.map(e=>e.name),o=e.map(e=>e.name);return o.some((e,t)=>e!==a[t])?e=>ht(a,i.map(t=>t(e)),o):e=>Zt(a,i.map(t=>t(e)))},vd=(e,t)=>{let n=e=>Vu(e,t);switch(e.kind){case`Number`:{let t=e.value;return mu(t)?()=>t:()=>{throw ol(e)}}case`Decimal`:return()=>{throw al(e)};case`String`:{let t=e.value;return()=>t}case`Identifier`:return Wu(e,t);case`Apply`:return id(e,t);case`Bracket`:return()=>{throw new y(`A bracket without a function or subscript is not an expression at ${Yc(e)}`)};case`OperatorReference`:case`Lambda`:return()=>{throw new y(`An operator cannot be used as a value at ${Yc(e)}`)};case`And`:{let t=e.operands.map(n);return n=>{for(let r=0;r<t.length;r++){let i=t[r](n);if(typeof i!=`boolean`)throw el(e,r,i);if(!i)return!1}return!0}}case`Or`:{let t=e.operands.map(n);return n=>{for(let r=0;r<t.length;r++){let i=t[r](n);if(typeof i!=`boolean`)throw el(e,r,i);if(i)return!0}return!1}}case`Prime`:{let t=n(e.expression);return n=>{if(!n.next)throw gd(e);return t({environment:n.environment,scope:n.scope,state:n.next,next:void 0,isKeepLazy:n.isKeepLazy})}}case`Unchanged`:{let t=n({kind:`Prime`,expression:e.expression,location:e.location}),r=n(e.expression);return e=>Qt(t(e),r(e))}case`If`:{let t=n(e.condition),r=n(e.consequent),i=n(e.alternative);return n=>{let a=t(n);if(typeof a!=`boolean`)throw $c(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 y(`A non-boolean expression (${zi(t)}) was used as a condition of a CASE. ${Qc(e.source)}`);if(t)return e.body(n)}if(r)return r(n);throw new y(`Attempted to evaluate a CASE with no conditions true.\n${Zc(e)}`)}}case`Let`:{let t=n(e.body);return n=>t(fl(n,fu(e.definitions,n)))}case`Forall`:case`Exists`:return ad(e,t);case`UnboundedQuantifier`:return()=>{throw new y(`TLC cannot evaluate an unbounded quantifier at ${Yc(e)}`)};case`Choose`:case`SetFilter`:case`SetMap`:return dd(e,t);case`SetEnumeration`:{let t=e.elements.map(n);return e=>Pn(t.map(t=>t(e)))}case`Tuple`:{let t=e.elements.map(n);return e=>Yn(t.map(t=>t(e)))}case`FunctionConstruction`:return ld(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 _d(e.fields,t);case`RecordSet`:{let t=fd(e.fields),r=t.map(e=>e.name),i=t.map(e=>n(e.value));return e=>({kind:`RecordSet`,names:r,sets:i.map(t=>t(e))})}case`Except`:return ud(e,t);case`ExceptAt`:return t=>{let n=sl(t.scope,`@`);if(n?.kind!==`Value`)throw new y(`@ appears outside an EXCEPT at ${Yc(e)}`);return n.value};case`FunctionApplication`:{cd(e.function);let r=n(e.function),i=t=>ul(r(dl(t)),e),a=e.args.map(n),o=nl(t.runtime.version);if(a.length===1){let e=a[0];return t=>Nr(i(t),e(t),o)}return e=>Nr(i(e),Yn(a.map(t=>t(e))),o)}case`FieldAccess`:{let t=n(e.record),r=tl(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=n({kind:`Unchanged`,expression:e.subscript,location:e.location}),i=e.kind===`BoxAction`;return e=>i?pl(t(e),`an action`)||r(e):pl(t(e),`an action`)&&!r(e)}case`Enabled`:{let t=e.expression;return e=>Bc(t,e)}case`Label`:return n(e.body);case`Subexpression`:return()=>{throw new y(`The subexpression reference at ${Yc(e)} does not name a subexpression`)};case`Always`:case`Eventually`:case`WeakFairness`:case`StrongFairness`:return()=>{throw new y(`TLC cannot evaluate a temporal formula in a state at ${Yc(e)}`)}}},yd=/* @__PURE__ */ new Set([`Prime`,`Unchanged`,`Enabled`,`Always`,`Eventually`,`BoxAction`,`AngleAction`,`WeakFairness`,`StrongFairness`]),bd=e=>{if(e.kind===`Identifier`)return e.name;if(e.kind===`Apply`||e.kind===`OperatorReference`)return e.operator},xd=(e,t)=>{let n=/* @__PURE__ */ new Set,r=/* @__PURE__ */ new Set,i=e=>{if(yd.has(e.kind))return!1;let a=bd(e),o=(e.kind===`Identifier`||e.kind===`Apply`)&&e.resolution?.kind===`Local`;if(a!==void 0&&!o&&!t.constants.has(a)){let e=t.substitutions.get(a)??a,o=t.definitions.get(e);if(!o&&gu(e,t))return!1;let s=t.variableIndex.get(a);if(s!==void 0&&n.add(s),o&&!r.has(o)&&(r.add(o),!i(o.body)||o.kind!==`Operator`&&!o.bounds.every(e=>i(e.set))))return!1}return hi(e).every(i)};return i(e)?[...n]:void 0},Sd=`-------------------------------- MODULE Reals -------------------------------
|
|
32
81
|
(***************************************************************************)
|
|
33
82
|
(* This module provides dummy definitions of the operators that are *)
|
|
34
83
|
(* defined by the real Reals module. It is expected that any tool that *)
|
|
@@ -45,7 +94,7 @@ EXTENDS Integers
|
|
|
45
94
|
Real == "Reals"
|
|
46
95
|
a / b == CHOOSE m \\in Real : m * b = a
|
|
47
96
|
Infinity == CHOOSE i : (i \\notin Real) /\\ (\\A r \\in Real : i > r)
|
|
48
|
-
|
|
97
|
+
=============================================================================`,Cd=`----------------------------- MODULE RealTime -------------------------------
|
|
49
98
|
(***************************************************************************)
|
|
50
99
|
(* This standard module is described in Chapter 9 of the book "Specifying *)
|
|
51
100
|
(* Systems". The type of specification described there cannot be handled *)
|
|
@@ -71,7 +120,7 @@ RTnow(v) == LET NowNext == /\\ now' \\in {r \\in Real : r > now}
|
|
|
71
120
|
IN /\\ now \\in Real
|
|
72
121
|
/\\ [][NowNext]_now
|
|
73
122
|
/\\ \\A r \\in Real : WF_now(NowNext /\\ (now'>r))
|
|
74
|
-
|
|
123
|
+
=============================================================================`,wd=`----------------------------- MODULE Toolbox --------------------------------
|
|
75
124
|
(***************************************************************************)
|
|
76
125
|
(* *)
|
|
77
126
|
(***************************************************************************)
|
|
@@ -97,9 +146,7 @@ _TEPosition ==
|
|
|
97
146
|
THEN _TETraceLength
|
|
98
147
|
ELSE IF TLCGet("level") = 0 THEN 1 ELSE TLCGet("level")
|
|
99
148
|
|
|
100
|
-
|
|
101
|
-
`)},rl=(e,t)=>{let n=de(e),r={index:0,offsideColumns:[]},i=[],a=/* @__PURE__ */ new Set,o=[],s={index:-1},c=[],l=e=>i[i.length-1].has(e),u=e=>({line:e.line,column:t&&e.kind===`String`?e.endColumn:e.column,range:void 0}),d=[],f=[],g=[],_=e=>{let t=r.index-1,i=e===t?g[e]:void 0;if(i)return i;let a=n[t];d[e]??=u(n[e]),f[t]??={line:a.line,column:a.endColumn};let o={module:c[c.length-1].name,start:d[e],end:f[t]};return e===t&&(g[e]=o),o},v=(e,t)=>(e.location.range=_(t),e),y=(e=0)=>n[Math.min(r.index+e,n.length-1)],b=(e=0)=>{let t=y(e),n=r.offsideColumns[r.offsideColumns.length-1];return n===void 0||n===-1||t.kind===`End`?t:t.column<=n?{...t,kind:`End`,text:``}:t},x=e=>e.kind===`End`?`end of input`:JSON.stringify(e.text),ee={index:0},te=e=>{let t=n.slice(ee.index,r.index).find(e=>e.text===`==`&&e.kind!==`String`);return t?{line:t.line,column:t.endColumn+1}:e},ne=e=>t&&(e.kind===`Keyword`||el.has(e.text)),re=e=>{let t=n.findLast(t=>t.kind!==`End`&&(t.line<e.line||t.line===e.line&&t.column<e.column));return t?{line:t.line,column:t.endColumn+1}:e},ie=e=>/^-{4,}$/.test(e.text)?`----`:/^={4,}$/.test(e.text)?`====`:qc.has(e.text)||e.kind===`Number`||e.kind===`Decimal`?e.text:e.kind===`String`?JSON.stringify(e.text):ne(e)?`keyword ${e.text}`:e.kind===`Identifier`?`identifier ${e.text}`:`operator ${e.text}`,S=(e,t=y(),r)=>{let i=n[n.length-1],a=t.line===i.line&&t.column===i.column;return new p(`${e} at line ${t.line}, column ${t.column}`,void 0,ae(e,t,a,r))},ae=(e,r,i,a)=>{if(t&&i){let e=n[n.length-1];return{reason:`Unexpected EOF`,...te(re(e)),isEnd:i}}return t&&a?{reason:`Unexpected ${ie(a)}`,...re(a),isEnd:i}:{reason:e,line:r.line,column:r.column,isEnd:i}},C=(e,t=y())=>S(e,t,t),oe=e=>(e.kind===`Identifier`||e.kind===`Keyword`)&&!ne(e),w=(e,t=0)=>{let n=b(t);return n.text===e&&n.kind!==`String`&&n.kind!==`End`},T=()=>{let e=b();if(e.kind===`End`)throw S(`Unexpected end of expression`);return r.index++,e},E=e=>w(e)?(r.index++,!0):!1,D=e=>{if(!w(e))throw C(`Expected ${JSON.stringify(e)} but found ${x(b())}`);return T()},O=()=>{let e=b();if(e.kind!==`Identifier`)throw C(`Expected an identifier but found ${x(e)}`);if(ne(e))throw C(`Unexpected keyword ${e.text}`);return r.index++,e.text},ce=e=>{r.offsideColumns.push(-1);let t=e();return r.offsideColumns.pop(),t},k=(e,t=`,`)=>{let n=[e()];for(;E(t);)n.push(e());return n},A=()=>{if(w(`<<`)){let e={value:1};for(;b(e.value).kind===`Identifier`||w(`,`,e.value);)e.value++;return w(`>>`,e.value)&&w(`\\in`,e.value+1)}let e={value:0};for(;b(e.value).kind===`Identifier`;){if(w(`\\in`,e.value+1))return!0;if(!w(`,`,e.value+1))return!1;e.value+=2}return!1},le=()=>{if(w(`::`))return!0;if(!w(`(`))return!1;let e={value:1};for(;b(e.value).kind===`Identifier`&&w(`,`,e.value+1);)e.value+=2;return b(e.value).kind===`Identifier`&&w(`)`,e.value+1)&&w(`::`,e.value+2)},ue=()=>{if(!E(`<<`))return{kind:`Name`,name:O()};let e=k(O);return D(`>>`),{kind:`Tuple`,names:e}},fe=()=>k(()=>{let e=k(ue);D(`\\in`);let t=N();return e.map(e=>({pattern:e,set:t}))}).flat(),pe=()=>{let e=b();if(e.kind===`Identifier`){let t=r.index,n=[T().text];for(;w(`!`)&&b(1).kind===`Identifier`;)T(),n.push(O());return v({kind:`Identifier`,name:n.join(`!`),location:u(e)},t)}if(w(`<<`)||w(`(`))return Te();throw C(`Expected a subscript but found ${x(e)}`)},me=e=>{let t=b(1),n=b(2);return t.kind===`Identifier`&&n.text===`==`?!0:t.line===e.line?!1:t.text===`-.`||t.kind===`Identifier`&&(n.text===`(`||n.text===`[`||n.kind===`Operator`&&w(`==`,Fc.has(n.text)?3:4))},j=e=>{if(!Lc.has(e.text))return!0;let t=b(1);return t.kind===`End`||t.kind===`ModuleEnd`||t.kind===`Separator`||w(`,`,1)||w(`)`,1)||t.kind===`Keyword`&&Uc.has(t.text)||me(e)},he=()=>{let e=b(),n=e.kind===`Operator`&&(Pc.has(e.text)||Ic.has(e.text))&&j(e);if(t&&e.kind!==`String`&&(Ic.has(e.text)||zc.has(e.text)&&e.text!==`'`&&!Fc.has(e.text)||Rc.has(e.text)&&b(-1).text===`(`&&b(-1).line===e.line&&b(-1).endColumn+1===e.column&&b(1).text===`)`&&b(1).line===e.line&&b(1).column===e.endColumn+1)&&j(e))throw S(`incomplete expression`,e);if(n)return r.index++,v({kind:`OperatorReference`,operator:e.text,location:u(e)},r.index-1);if(e.kind!==`String`&&zc.has(e.text)&&j(e)){r.index++;let t=u(e);if(Fc.has(e.text))return{kind:`OperatorReference`,operator:e.text,location:t};let n={kind:`Identifier`,name:`argument`,location:t};return{kind:`Lambda`,params:[n.name],body:Vc(e.text,n,t),location:t}}if(w(`LAMBDA`)){let t=r.index;T();let n=k(O);D(`:`);let i=N();return v({kind:`Lambda`,params:n,body:i,location:u(e)},t)}return N()},ge={range:void 0},_e=()=>ce(()=>{let e=r.index;D(`(`);let t=k(he);return D(`)`),ge.range=_(e),t}),ve=()=>{let e=T();r.offsideColumns.push(e.column);let t=[N()];for(;y().text===e.text&&y().column===e.column;)r.index++,t.push(N());return r.offsideColumns.pop(),{kind:e.text===`/\\`?`And`:`Or`,operands:t,isBulleted:!0,location:u(e)}},M=e=>ce(()=>{let t=u(e);if(b().kind===`Identifier`&&(w(`|->`,1)||w(`:`,1))){let e=w(`|->`,1)?`Record`:`RecordSet`,n=k(()=>{let t=r.index,n=u(b()),i=O();return n.range=_(t),D(e===`Record`?`|->`:`:`),{name:i,value:N(),location:n}});return D(`]`),{kind:e,fields:n,location:t}}if(A()){let e=fe();D(`|->`);let n=N();return D(`]`),{kind:`FunctionConstruction`,bounds:e,body:n,location:t}}let n=N();if(E(`->`)){let e=N();return D(`]`),{kind:`FunctionSet`,domain:n,range:e,location:t}}if(E(`EXCEPT`)){let e=k(()=>{D(`!`);let e=[];for(;w(`.`)||w(`[`);)if(E(`.`)){if(!oe(b()))throw C(`Expected a field name but found ${x(b())}`);e.push({kind:`Field`,name:T().text})}else D(`[`),e.push({kind:`Index`,args:k(()=>N())}),D(`]`);return D(`=`),{path:e,value:N()}});return D(`]`),{kind:`Except`,function:n,updates:e,location:t}}return D(`]_`),{kind:`BoxAction`,action:n,subscript:pe(),location:t}}),ye=e=>ce(()=>{let t=u(e);if(E(`}`))return{kind:`SetEnumeration`,elements:[],location:t};if(A()&&(b(1).text===`\\in`||w(`<<`))){let e=r.index,n=ue();D(`\\in`);let i=N();if(E(`:`)){let e=N();return D(`}`),{kind:`SetFilter`,bound:{pattern:n,set:i},predicate:e,location:t}}r.index=e}let n=N();if(E(`:`)){let e=fe();return D(`}`),{kind:`SetMap`,expression:n,bounds:e,location:t}}let i=[n];for(;E(`,`);)i.push(N());return D(`}`),{kind:`SetEnumeration`,elements:i,location:t}}),be=e=>{let t=u(e),n=ce(()=>w(`>>`)||w(`>>_`)?[]:k(()=>N()));if(E(`>>_`)){if(n.length!==1)throw S(`Expected a single action inside <<A>>_v`,e);return{kind:`AngleAction`,action:n[0],subscript:pe(),location:t}}return D(`>>`),{kind:`Tuple`,elements:n,location:t}},xe=e=>{let t=u(e),n=e.text===`\\A`?`Forall`:`Exists`,r=e.text===`\\AA`||e.text===`\\EE`;if(!r&&A()){let e=fe();return D(`:`),{kind:n,bounds:e,body:N(),location:t}}let i=k(O);return D(`:`),{kind:`UnboundedQuantifier`,quantifier:e.text===`\\A`||e.text===`\\AA`?`Forall`:`Exists`,names:i,body:N(),isTemporal:r,location:t}},Se=e=>{let t=[];do{if(E(`OTHER`))return D(`->`),{kind:`Case`,arms:t,other:N(),location:u(e)};let n=N();D(`->`),t.push({condition:n,body:N()})}while(E(`[]`));return{kind:`Case`,arms:t,other:void 0,location:u(e)}},Ce=()=>{let e=b(1);return w(`!`)&&(e.kind===`Identifier`||e.kind===`Number`||Hc.has(e.text)||e.kind===`Operator`&&(Pc.has(e.text)||Fc.has(e.text)||Ic.has(e.text)))},we=()=>{let e=T();if(e.kind===`Number`)return{kind:`Operand`,operand:se(e.text)};switch(e.text){case`<<`:case`>>`:return{kind:`Operand`,operand:e.text};case`:`:return{kind:`Colon`};case`@`:return{kind:`At`};case`(`:return r.index--,{kind:`Bound`,args:_e()}}return{kind:`Name`,name:e.text,args:w(`(`)?_e():[]}},Te=()=>{let e=r.index===s.index,n=T(),a=u(n);if(t&&n.kind===`Keyword`&&n.text===`LAMBDA`){let e=k(O);return D(`:`),{kind:`Lambda`,params:e,body:N(),location:a}}if(n.kind===`Number`){if(t&&/^\\[BOH]/.test(n.text))throw S(`incomplete expression`,n);return{kind:`Number`,value:se(n.text),text:n.text,location:a}}if(n.kind===`Decimal`)return{kind:`Decimal`,text:n.text,location:a};if(n.kind===`String`)return{kind:`String`,value:n.text,location:a};let o=n.kind===`Step`&&Re(n);if(o&&Fe()<0&&Pe.length<=1)throw S(`Step number used outside proof`,n);if(o&&n.text[1]===`+`)throw S(`<+> step number used in an expression`,n);if(n.kind===`Identifier`||o){let r=o?ze(n)??n.text:n.text;if(le()){let e=E(`(`)?k(O):[];return e.length>0&&D(`)`),D(`::`),{kind:`Label`,name:r,params:e,body:N(),location:a}}let i=w(`(`),s=i?_e():[];if(!Ce())return i?{kind:`Apply`,operator:r,args:s,argumentsRange:ge.range,location:a}:{kind:`Identifier`,name:r,location:a};let l=c.flatMap(e=>e.instances).find(e=>e.name===r);if(l&&!e&&!t&&l.params.length!==s.length)throw S(`The operator ${r} requires ${l.params.length} arguments`,n);let u=[{kind:`Name`,name:r,args:s}];for(;Ce();)T(),u.push(we());let d=u.flatMap(e=>e.kind===`Name`?[e.name]:[]);if(d.length<u.length)return{kind:`Subexpression`,selectors:u,location:a};let f=d.join(`!`),p=u.flatMap(e=>`args`in e?e.args:[]);if(p.length===0)return{kind:`Identifier`,name:f,location:a};let m=u.map(e=>`args`in e?e.args.length:0),h=ge.range;return m.slice(0,-1).some(e=>e>0)?{kind:`Apply`,operator:f,args:p,argumentCounts:m,argumentsRange:h,location:a}:{kind:`Apply`,operator:f,args:p,argumentsRange:h,location:a}}if(n.kind===`Operator`&&Bc(n.text)&&w(`(`))return{kind:`Apply`,operator:n.text,args:_e(),location:a};switch(n.text){case`(`:{let e=ce(()=>N());return D(`)`),e}case`[`:return M(n);case`{`:return ye(n);case`<<`:return be(n);case`@`:return{kind:`ExceptAt`,location:a};case`\\A`:case`\\E`:case`\\AA`:case`\\EE`:return xe(n);case`IF`:{let e=N();D(`THEN`);let t=N();return D(`ELSE`),{kind:`If`,condition:e,consequent:t,alternative:N(),location:a}}case`CASE`:return Se(n);case`LET`:{let e=[],n=[];for(i.push(/* @__PURE__ */ new Set);!E(`IN`);){if(t&&w(`RECURSIVE`))throw S(`Unexpected keyword RECURSIVE`,te(y()));if(E(`RECURSIVE`)){je();continue}let r=ke(!1);r.kind===`Instance`?n.push(r):e.push(r)}i.pop();let r=N();return n.length===0?{kind:`Let`,definitions:e,body:r,location:a}:{kind:`Let`,definitions:e,instances:n,body:r,location:a}}case`CHOOSE`:{let e=ue(),t=E(`\\in`)?N():void 0;return D(`:`),{kind:`Choose`,pattern:e,set:t,body:N(),location:a}}case`WF_`:case`SF_`:{let e=pe(),t=ce(()=>{D(`(`);let e=N();return D(`)`),e});return{kind:n.text===`WF_`?`WeakFairness`:`StrongFairness`,subscript:e,action:t,location:a}}}throw C(`Unexpected ${x(n)}`,n)},Ee=()=>{let e=b(),t=u(e);if(e.kind===`Operator`&&(e.text===`/\\`||e.text===`\\/`))return ve();if(e.kind===`Operator`||e.kind===`Keyword`)switch(e.text){case`~`:return T(),{kind:`Apply`,operator:`~`,args:[N(5)],location:t};case`-`:return T(),{kind:`Apply`,operator:`-.`,args:[N(13)],location:t};case`[]`:return T(),{kind:`Always`,expression:N(16),location:t};case`<>`:return T(),{kind:`Eventually`,expression:N(16),location:t};case`ENABLED`:return T(),{kind:`Enabled`,expression:N(16),location:t};case`UNCHANGED`:return T(),{kind:`Unchanged`,expression:N(16),location:t};case`SUBSET`:case`UNION`:case`DOMAIN`:return T(),{kind:`Apply`,operator:e.text,args:[N(9)],location:t}}return Te()},N=(e=0)=>{let t=r.index,n=Ee(),i={left:n.location.range?n:v(n,t),previous:void 0};for(;;){let n=b();if(n.kind!==`Operator`)break;let r=u(n);if(n.text===`'`&&e<=15){T(),i.left=v({kind:`Prime`,expression:i.left,location:r},t);continue}if(Fc.has(n.text)&&e<=15){T(),i.left=v({kind:`Apply`,operator:n.text,args:[i.left],location:r},t);continue}if(n.text===`[`){T();let e=ce(()=>k(()=>N()));ce(()=>D(`]`)),i.left=v({kind:`FunctionApplication`,function:i.left,args:e,location:r},t);continue}if(n.text===`.`&&oe(b(1))){T();let e=T().text;i.left=v({kind:`FieldAccess`,record:i.left,field:e,location:r},t);continue}let a=Pc.get(n.text);if(!a||a.low<e)break;let o=i.previous;if(o){let e=!(o.low>a.high||o.high<a.low),t=o.text===n.text&&a.isAssociative;if(e&&!t&&(o.text!==`\\X`||n.text!==`\\X`))throw S(`Precedence conflict between ${o.text} and ${n.text}`,n)}if(T(),a.low>12&&w(`-`))throw S(`Precedence conflict between ${n.text} and -`,b());let s=N(a.high+1),c=i.left;if(n.text===`/\\`||n.text===`\\/`){let e=n.text===`/\\`?`And`:`Or`;i.left=c.kind===e&&o?.text===n.text?{...c,operands:[...c.operands,s]}:{kind:e,operands:[c,s],location:r}}else i.left=n.text===`\\X`?c.kind===`Product`&&o?.text===`\\X`?{...c,factors:[...c.factors,s]}:{kind:`Product`,factors:[c,s],location:r}:{kind:`Apply`,operator:n.text,args:[c,s],location:r};i.left=v(i.left,t),i.previous={...a,text:n.text}}return i.left},De=()=>{if(!E(`(`))return[];let e=I();return D(`)`),e},Oe=()=>{let e=u(b()),t=N(),i=n[r.index-1],a={line:i.line,column:i.endColumn};return{body:t,bodyRange:{module:c[c.length-1].name,start:e,end:a}}},ke=e=>{let t=r.index;return v(P(e),t)},P=e=>{let t=b(),n=u(t),i=(t,r)=>({kind:`Operator`,name:t,params:r,...Oe(),isLocal:e,isRecursive:l(t),location:n});if(t.kind===`Identifier`&&b(1).kind===`Operator`&&Pc.has(b(1).text)&&b(2).kind===`Identifier`&&w(`==`,3)){let e=O(),t=T().text,n=O();return D(`==`),i(t,[{name:e,arity:0},{name:n,arity:0}])}let a=t.kind===`Operator`&&t.text===`-.`,o=t.kind===`Identifier`&&Fc.has(b(1).text)&&w(`==`,2);if(a||o){let e=a?t.text:b(1).text;r.index+=a?1:2;let n=a?O():t.text;return D(`==`),i(e,[{name:n,arity:0}])}let s=O();if(E(`[`)){let t=ce(()=>fe());return D(`]`),D(`==`),{kind:`Function`,name:s,bounds:t,body:N(),isLocal:e,isRecursive:l(s),location:n}}let c=r.index,d=De();return D(`==`),w(`INSTANCE`)?{...Ae(s,d,e,n),definitionRange:_(c)}:i(s,d)},Ae=(e,t,n,i)=>{let a=r.index;return D(`INSTANCE`),{kind:`Instance`,name:e,params:t,module:O(),substitutions:E(`WITH`)?k(()=>{let e=T().text;return D(`<-`),{name:e,expression:he()}}):[],isLocal:n,location:i,instanceRange:_(a)}},F=()=>{let e=u(b());if(w(`_`)&&b(1).kind===`Operator`)return T(),{name:T().text,arity:E(`_`)?2:1,location:e};if(b().kind===`Operator`&&w(`_`,1)){let t=T().text;return T(),{name:t===`-`?`-.`:t,arity:1,location:e}}let t=O();if(!E(`(`))return{name:t,arity:0,location:e};let n=k(()=>D(`_`));return D(`)`),{name:t,arity:n.length,location:e}},I=()=>k(F),je=()=>{let e=I();return e.forEach(e=>i[i.length-1].add(e.name)),e},Me=e=>{let t={value:0,offset:e};do{let e=b(t.offset);if(e.kind===`End`)return t.offset;e.kind===`Operator`&&Qc.has(e.text)&&t.value++,e.kind===`Operator`&&$c.has(e.text)&&t.value--,t.offset++}while(t.value>0);return t.offset},Ne=()=>{let e=b(),t=b(1);return e.kind===`Identifier`?w(`(`,1)||w(`[`,1)?w(`==`,Me(1)):t.kind===`Operator`&&Fc.has(t.text)?w(`==`,2):t.kind===`Operator`&&Pc.has(t.text)?b(2).kind===`Identifier`&&w(`==`,3):w(`==`,1):w(`-.`)&&t.kind===`Identifier`&&w(`==`,2)},Pe=[],Fe=()=>Pe[Pe.length-1]??-1,Ie=e=>e.text[1]===`*`?-1:e.text[1]===`+`?-2:Number(e.text.slice(1,e.text.indexOf(`>`))),Le=e=>{let t=e.text.slice(e.text.indexOf(`>`)+1),n={value:t.length};for(;t[n.value-1]===`.`;)n.value--;return t.slice(0,n.value)},Re=e=>!e.text.endsWith(`.`)&&!Jc.has(Le(e)),ze=e=>{let t=Le(e);if(Jc.has(t))return;let n=Ie(e);if(n>=0)return`<${n}>${t}`;let r=Fe(),i=Pe[Pe.length-2];return`<${r<0&&i!==void 0?i:r}>${t}`},L=e=>{if(e.kind===`Keyword`)return Gc.has(e.text);if(e.kind!==`Step`)return!1;if(e.text[1]===`*`)return Pe.length===0;if(e.text[1]===`+`||Pe.length===0)return!0;let t=Fe();return t>=0&&Ie(e)>t},Be=e=>{let t=Ie(e),n=Pe.length-1,r=Pe[n-1]??-1,i=Pe[n]<0;return i&&(Pe[n]=t<0?r+1:t),t===-1?!0:t===-2?i:i?t>r:Pe[n]===t},Ve=e=>!a.has(e)&&c.some(t=>t.constants.some(t=>t.name===e)||t.variables.some(t=>t.name===e)||t.definitions.some(t=>t.name===e)),He=e=>e.kind===`ModuleFact`||e.kind===`Subexpression`?!0:e.kind===`Apply`?e.operator.includes(`!`):e.kind===`Identifier`?e.name.startsWith(`<`)||e.name.includes(`!`)?!0:!el.has(e.name)&&!Ve(e.name):!1,Ue=()=>{let e=b();return e.kind===`Step`?Re(e):e.kind===`Keyword`?Yc.has(e.text):e.kind===`End`||e.kind===`ModuleEnd`||e.kind===`Separator`?!1:!Ne()},We=()=>{let e=r.index;s.index=e;let t=b();return t.kind===`Operator`&&!Lc.has(t.text)&&Bc(t.text)?(r.index++,v({kind:`OperatorReference`,operator:t.text,location:u(t)},e)):E(`MODULE`)?v({kind:`ModuleFact`,name:O(),location:u(t)},e):N()},R=e=>o[o.length-1]?.add(e),Ge=e=>{o.push(/* @__PURE__ */ new Set);let t=e();return o.pop(),t},Ke=e=>o.some(t=>t.has(e))||c.some(t=>t.constants.some(t=>t.name===e)||t.variables.some(t=>t.name===e)),qe=()=>{let e=r.index,t=b(),n=k(()=>{let e=b();if((e.kind!==`Identifier`||ne(e))&&e.kind!==`Operator`)throw C(`Expected a definition name but found ${x(e)}`,e);return r.index++,e.text},`!`),i=u(t);return v(n.length===1&&t.kind===`Operator`?{kind:`OperatorReference`,operator:t.text,location:i}:{kind:`Identifier`,name:n.join(`!`),location:i},e)},z=()=>{if(t)return k(qe);let e=k(We),n=e.find(e=>e.kind===`Identifier`&&Ke(e.name));if(n)throw S(`DEF clause entry should describe a defined operator`,n.location);return e},Je=()=>({facts:Ue()?k(We):[],defs:E(`DEF`)||E(`DEFS`)?z():[]}),Ye=()=>{let e=r.index,n=T(),i=n.text===`USE`&&E(`ONLY`),a=_(e),o={kind:n.text===`USE`?`Use`:`Hide`,isOnly:i,...Je(),keyword:a,location:u(n)},s=o.kind===`Hide`&&!t?o.facts.filter(e=>!He(e)):[];if(s.length>0)throw m(s.map(t=>({location:h(t.location.range??_(e)),message:`The only expression allowed as a fact in a HIDE is
|
|
102
|
-
the name of a theorem, assumption, or step.`})));return v(o,e)},Xe=()=>{let e=r.index,t=u(b()),n=E(`NEW`),i=b().kind===`Keyword`?Xc.get(b().text):void 0;if(!n&&i===void 0)throw C(`Expected a declaration but found ${x(b())}`);if(i!==void 0&&T(),i===`Variable`){let n=O();return R(n),v({kind:`NewSymbol`,name:n,arity:0,level:i,set:void 0,location:t},e)}let a=F();R(a.name);let o=(i??`Constant`)===`Constant`&&w(`\\in`);if(o&&a.arity>0)throw S(`declared symbol with arguments before \\in`);return o&&T(),v({kind:`NewSymbol`,name:a.name,arity:a.arity,level:i??`Constant`,set:o?N():void 0,location:t},e)},Ze=()=>{let e=r.index,t=u(D(`ASSUME`)),n=k(()=>w(`ASSUME`)?Ge(Ze):b().kind===`Keyword`&&Zc.has(b().text)?Xe():N());return D(`PROVE`),v({kind:`AssumeProve`,assumptions:n,conclusion:N(),location:t},e)},B=e=>{let t={value:0};for(;b(t.value).kind===`Identifier`&&w(`,`,t.value+1);)t.value+=2;return b(t.value).kind===`Identifier`&&w(e,t.value+1)},Qe=(e,t)=>{e.forEach(R),t.forEach(e=>(e.pattern.kind===`Name`?[e.pattern.name]:e.pattern.names).forEach(R))},$e=()=>{let e=b();if(w(`USE`)||w(`HIDE`))return Ye();if(w(`INSTANCE`))return v(Ae(void 0,[],!1,u(e)),r.index);if(w(`DEFINE`)||Ne()){let t=r.index;E(`DEFINE`);let n=[ke(!1)];for(;Ne();)n.push(ke(!1));let i={kind:`Define`,definitions:n,location:u(e)};return v(i,t)}if(E(`HAVE`))return{kind:`Have`,expression:N()};if(E(`TAKE`)){let e=A(),t=e?[]:k(O),n=e?fe():[];return Qe(t,n),{kind:`Take`,names:t,bounds:n}}if(E(`WITNESS`))return{kind:`Witness`,expressions:k(()=>N())};if(E(`PICK`)){let e=B(`:`),t=e?k(O):[],n=e?[]:fe();return Qe(t,n),D(`:`),{kind:`Pick`,names:t,bounds:n,body:N()}}return E(`CASE`)?{kind:`Case`,expression:N()}:{kind:`Assert`,isSuffices:E(`SUFFICES`),statement:w(`ASSUME`)?Ze():N()}},et=e=>{let t=b();if(t.kind!==`Step`)throw C(`Expected a step number but found ${x(t)}`,t);if(!Be(t))throw S(`${e?`QED step`:`step`}'s number has bad level`,t);if(Ie(t)<0&&ze(t)!==void 0)throw S(`<*> and <+> cannot be used for a named step`,t);return r.index++,{name:ze(t),token:t.text,location:u(t)}},tt=()=>{let e=r.index,t=et(w(`QED`,1)),n=/* @__PURE__ */ new Set;o.push(n);let i=E(`QED`)?{kind:`Qed`}:$e(),a=_(e),s=L(b());if(s&&!Kc.has(i.kind))throw S(`Proof of a step that does not take a proof`);let c=s?rt():void 0;return o.pop(),(i.kind!==`Assert`||i.isSuffices)&&n.forEach(R),v({...t,body:i,head:a,proof:c},e)},nt=()=>{let e=u(b());if(w(`BY`)||w(`PROOF`)&&w(`BY`,1)){E(`PROOF`),T();let t=_(r.index-1);return{kind:`By`,isOnly:E(`ONLY`),...Je(),keyword:t,location:e}}let t=b(+!!w(`PROOF`));if(t.kind===`Keyword`&&(t.text===`OBVIOUS`||t.text===`OMITTED`)){E(`PROOF`),T();let n=_(r.index-1);return{kind:t.text===`OBVIOUS`?`Obvious`:`Omitted`,keyword:n,location:e}}E(`PROOF`);let n=[tt()];for(;n[n.length-1].body.kind!==`Qed`;)n.push(tt());return{kind:`Steps`,level:Fe(),steps:n,location:e}},rt=()=>{let e=r.index;Pe.push(-1);let t=Ge(nt);return Pe.pop(),v(t,e)},it=e=>{let t=r.index,n=T(),i=b().kind===`Identifier`&&w(`==`,1)?O():void 0;i!==void 0&&(a.add(i),T());let o=Ge(()=>({statement:w(`ASSUME`)?Ze():N(),proof:L(b())?rt():void 0})),s=o.statement,c=v({name:i,statement:s,proof:o.proof,location:u(n)},t);e.theorems.push(c),e.units.push({kind:`Theorem`,theorem:c}),i!==void 0&&s.kind!==`AssumeProve`&&e.definitions.push(v({kind:`Operator`,name:i,params:[],body:s,isLocal:!1,isRecursive:!1,location:u(n)},t))},at=()=>{let e=r.index;return v(ot(),e)},ot=()=>{let e=T(),t=u(e),n=e.text===`AXIOM`;if(b().kind===`Identifier`&&w(`==`,1)){let e=O();return a.add(e),T(),{name:e,expression:N(),isAxiom:n,location:t}}return{name:void 0,expression:N(),isAxiom:n,location:t}},st=()=>{let e=u(D(`----`));D(`MODULE`);let t=O();D(`----`);let n={name:t,modules:[],extends:[],extendsRanges:[],constants:[],variables:[],definitions:[],instances:[],assumptions:[],location:e,theorems:[],uses:[],units:[]};for(c.push(n),i.push(/* @__PURE__ */ new Set),E(`EXTENDS`)&&k(()=>{let e=r.index;n.extends.push(O()),n.extendsRanges.push(_(e))});;){let a=r.index;ee.index=a;let o=b();if(o.kind===`ModuleEnd`||o.kind===`End`)return o.kind===`ModuleEnd`&&(e.range={module:t,start:{line:e.line,column:e.column},end:{line:o.line,column:o.endColumn}}),c.pop(),i.pop(),n;if(o.kind===`Separator`){if(w(`MODULE`,1)){let e=st();n.modules.push(e),n.units.push({kind:`Module`,module:e}),D(`====`);continue}T()}else{switch(o.text){case`CONSTANT`:case`CONSTANTS`:{T();let e=I();n.constants.push(...e),n.units.push({kind:`Constants`,declarations:e});continue}case`VARIABLE`:case`VARIABLES`:{T();let e=k(()=>{let e=r.index,t=u(b());return v({name:O(),arity:0,location:t},e)});n.variables.push(...e),n.units.push({kind:`Variables`,declarations:e});continue}case`ASSUME`:case`ASSUMPTION`:case`AXIOM`:{let e=at();n.assumptions.push(e),n.units.push({kind:`Assumption`,assumption:e}),e.name!==void 0&&n.definitions.push({kind:`Operator`,name:e.name,params:[],body:e.expression,isLocal:!1,isRecursive:!1,location:e.location});continue}case`USE`:case`HIDE`:{let e=Ye();n.uses.push(e),n.units.push({kind:`Use`,use:e});continue}case`RECURSIVE`:T(),n.units.push({kind:`Recursive`,declarations:je()});continue;case`INSTANCE`:ct(n,v(Ae(void 0,[],!1,u(o)),a));continue;case`LOCAL`:if(T(),w(`INSTANCE`)){ct(n,v(Ae(void 0,[],!0,u(o)),a));continue}ct(n,ke(!0));continue}o.kind===`Keyword`&&Wc.has(o.text)?it(n):ct(n,ke(!1))}}},ct=(e,t)=>{t.kind===`Instance`?(e.instances.push(t),e.units.push({kind:`Instance`,instance:t})):(e.definitions.push(t),e.units.push({kind:`Definition`,definition:t}))};return st()},il=e=>rl(e,!1),al=e=>rl(e,!0),ol=25214903917n,sl=(1n<<48n)-1n,cl=2147483647,ll=e=>{let t={value:(BigInt.asUintN(64,e)^ol)&sl},n=e=>(t.value=t.value*ol+11n&sl,Number(BigInt.asIntN(32,t.value>>BigInt(48-e))));return{setSeed:e=>{t.value=(BigInt.asUintN(64,e)^ol)&sl},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<=cl)return t}},nextLong:()=>BigInt.asIntN(64,(BigInt(n(32))<<32n)+BigInt(n(32))),nextDouble:()=>(n(26)*2**27+n(27))*2**-53}},ul=10454148508367108822n,dl=(()=>{let e=[];for(let t=1n<<63n;e.length<72;)e.push(t),t=t>>1n^((t&1n)==0n?0n:ul);return Array.from({length:256},(t,n)=>e.slice(64,72).reverse().reduce((e,t,r)=>n>>r&1?e^t:e,0n))})(),fl=Int32Array.from(dl,e=>Number(BigInt.asIntN(32,e>>32n))),pl=Int32Array.from(dl,e=>Number(BigInt.asIntN(32,e))),ml=Number(BigInt.asIntN(32,ul>>32n)),hl=Number(BigInt.asIntN(32,ul));let gl=ml,_l=hl;const vl=e=>{let t=(e^_l)&255;_l=(_l>>>8|gl<<24)^pl[t],gl=gl>>>8^fl[t]},yl=e=>{for(let t=0;t<32;t+=8)vl(e>>>t)},bl=e=>{if(typeof e==`boolean`)vl(0),vl(e?116:102);else if(typeof e==`number`)vl(1),yl(e);else if(typeof e==`string`){vl(3),yl(e.length);for(let t=0;t<e.length;t++)vl(e.charCodeAt(t))}else if(I(e))vl(21),yl(Ke(e.name)+1);else if(F(e)){let t=W(e);vl(9),yl(t.domain.length);for(let e=0;e<t.domain.length;e++)bl(t.domain[e]),bl(t.range[e])}else{let t=H(e).elements;vl(5),yl(t.length);for(let e of t)bl(e)}},xl=e=>{let t={high:gl,low:_l};gl=ml,_l=hl;for(let t of e)bl(t);let n=BigInt(gl>>>0)<<32n|BigInt(_l>>>0);return gl=t.high,_l=t.low,n},Sl=e=>{if(typeof e==`boolean`)return 2;if(typeof e==`number`||I(e))return 5;if(typeof e==`string`)return 5+e.length;if(F(e)){let t=W(e);return t.domain.reduce((e,n,r)=>e+Sl(n)+Sl(t.range[r]),5)}return H(e).elements.reduce((e,t)=>e+Sl(t),5)},Cl=e=>{let t=/* @__PURE__ */ new Int32Array(4096);for(let n=0;n<64;n++){gl=n<32?0:1<<n-32,_l=n<32?1<<n:0;for(let t=0;t<e;t++)vl(0);let r=n>>3,i=1<<(n&7);for(let e=i;e<2*i;e++){let n=(r*256+e)*2,a=(r*256+e-i)*2;t[n]=t[a]^gl,t[n+1]=t[a+1]^_l}}return t},wl=(e,t)=>{let n=/* @__PURE__ */ new Map,r=/* @__PURE__ */ new Map,i=[],a=e=>{let t=r.get(e);if(t!==void 0)return t;let n=Sl(e);return gl=0,_l=0,bl(e),r.set(e,i.length),i.push(n,gl,_l),i.length-3},o=e=>{let t=n.get(e);if(t)return t;let r=Cl(e);return n.set(e,r),r};return(n,r)=>{let s={high:gl,low:_l},c={high:ml,low:hl};for(let t of e){let e=a(n[t]),r=o(i[e]),s={high:i[e+1],low:i[e+2]};for(let e=0;e<8;e++){let t=e<4?c.low:c.high,n=(e*256+(t>>>(e&3)*8&255))*2;s.high^=r[n],s.low^=r[n+1]}c.high=s.high,c.low=s.low}gl=s.high,_l=s.low,t[2*r]=c.low,t[2*r+1]=c.high}},Tl=[],El=e=>{for(let t=2;t*t<=e;t++)if(e%t===0)return!1;return!0},Dl=()=>{for(let e=1277011;Tl.length<1341;e++)El(e)&&Tl.push(e);return Tl},Ol=e=>{let t=Dl(),n={index:t.length};for(;n.index===t.length;)n.index=Math.floor(e.nextDouble()*t.length);return t[n.index]},kl=e=>{let t=[],n={value:e};for(let e=2;e*e<=n.value;e++)for(;n.value%e===0;)t.push(e),n.value/=e;return n.value>1&&t.push(n.value),t},Al=e=>{for(let t=Math.max(e,9);;t++){let e=kl(t),n=new Set(e);if(t%4!=0&&n.size!==e.length)return{modulus:BigInt(t),multiplier:BigInt([...n].reduce((e,t)=>e*t,1)+1)}}},jl=(e,t,n)=>{if(t<=0)return[];let r=Al(t),i={index:BigInt(n.nextInt(t))},a=BigInt(Ol(n));return Array.from({length:e},()=>{do i.index=(r.multiplier*i.index+a)%r.modulus;while(i.index>=t);return i.index})},Ml=(1n<<63n)-1n-24n,Nl=(e,t,n)=>{let r=n.nextLong(),i=BigInt.asIntN(64,r<0n?-r:r);return Array.from({length:e},(e,n)=>{let r=(Ml*BigInt(n)+i)%t;return r<0n?r+t:r})},Pl=(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,Fl=e=>{if(typeof e==`object`){if(e.kind===`FunctionSet`){let t=Gt(e.domain),n=H(e.range).elements;return{lists:t.map(()=>n),create:e=>tt(t,e)}}if(e.kind===`RecordSet`)return{lists:e.sets.map(e=>H(e).elements),create:t=>Jt(e.names.map((e,n)=>[e,t[n]]))};if(e.kind===`ProductSet`)return{lists:e.factors.map(e=>H(e).elements),create:qt}}},Il=(e,t,n)=>{if(U(t))return[];if(typeof t==`object`&&t.kind===`Interval`)return jl(e,Math.max(0,t.high-t.low+1),n).map(e=>t.low+Number(e));let r=Fl(t);if(r){let t=r.lists.reduce((e,t)=>e*BigInt(t.length),1n);return(t>BigInt(cl)?Nl(e,t,n):jl(e,Number(t),n)).map(e=>r.create(Pl(r.lists,e)))}let i=H(t).elements;return jl(e,i.length,n).map(e=>i[Number(e)])},Ll=(e,t)=>{let n=e[Math.floor(t.nextDouble()*e.length)];if(n===void 0)throw new v(`RandomElement of the empty set`);return n},Rl=(e,t)=>{if(typeof e==`object`&&e.kind===`FunctionSet`){let n=[...Gt(e.domain)];return tt(n,n.map(()=>Rl(e.range,t)))}if(typeof e==`object`&&e.kind===`RecordSet`)return Jt(e.names.map((n,r)=>[n,Rl(e.sets[r],t)]));if(typeof e==`object`&&e.kind===`ProductSet`)return qt(e.factors.map(e=>Rl(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 v(`RandomElement of the empty set`);return e.low+r}return Ll(H(e).elements,t)},zl=(e,t=0n)=>{let n=ll(t),r={random:ll(t),state:void 0},i={isStartup:!1},a={getLevel:()=>0,getBehavior:()=>[],getSpecification:()=>Jt([]),counterExample:void 0,isSeen:()=>!1,setLivenessSource:()=>{},getCurrentState:()=>void 0,getFingerprint:xl,getRandom:()=>{let e=i.isStartup?void 0:a.getCurrentState();return e===void 0?n:(e!==r.state&&(r.random.setSeed(a.getFingerprint(e)^BigInt.asUintN(64,t)),r.state=e),r.random)},evaluateAtStartup:e=>{let t=i.isStartup;i.isStartup=!0;try{return e()}finally{i.isStartup=t}},pause:()=>{},seed:t,generatedStates:0,distinctStates:0,initialStates:0,queueSize:0,diameter:1,registers:/* @__PURE__ */ new Map,namedRegisters:/* @__PURE__ */ new Map,properties:/* @__PURE__ */ new Map,possibleCounts:/* @__PURE__ */ new Map,isStopped:!1,isStarted:!1,checkDeadlock:e,startedAt:Date.now()};return a},Bl=e=>Lt([...e.possibleCounts].map(([e,t])=>[e,t])),Vl=e=>e.possibleCounts.size===0?e.namedRegisters:new Map([...e.namedRegisters,[`s:_possible`,Bl(e)]]),Hl=(e,t,n)=>new y(`Applying ${e} to the following value,\nwhich is not ${t}:\n${G(n)}`),Ul=(e,t,n,r)=>new y(`The ${e} argument of ${t} should be a ${n}, but instead it is:\n${G(r)}`),Wl=e=>F(e)?W(e):void 0,Gl=(e,t,n)=>{let r=q(e,t,n),i=Wl(r);if(!i)throw Hl(n,`a function with a finite domain`,r);return i},Kl=(e,t,n)=>{let r=q(e,t,n),i=Wl(r);if(!i)throw Ul(t===0?`first`:`second`,n,`bag`,r);return i},ql=(e,t)=>{if(!P(e)||!V(e))throw t();return H(e).elements},Jl=e=>e.range.every(e=>typeof e==`number`&&e>0),Yl=(e,t)=>{let n=e.domain.findIndex(e=>nt(e,t));return n===-1?void 0:e.range[n]},Xl=(e,t,n)=>`public static ${t} tlc2.module.Bags.${e}(${Array.from({length:n},()=>`tlc2.value.impl.Value`).join(`,`)})`,Zl=Xl(`BagDiff`,`tlc2.value.impl.Value`,2),Ql=Xl(`SqSubseteq`,`tlc2.value.IBoolValue`,2),$l=Xl(`BagUnion`,`tlc2.value.impl.Value`,1),eu=Xl(`BagOfAll`,`tlc2.value.impl.Value`,2),tu=Xl(`BagCup`,`tlc2.value.impl.Value`,2),nu=Xl(`BagCardinality`,`tlc2.value.impl.IntValue`,1),ru=(e,t)=>{if(typeof e==`number`)return e;let n=`tlc2.value.impl.${jr(e)}`;throw Nr(t,`class ${n} cannot be cast to class tlc2.value.impl.IntValue (${n} and tlc2.value.impl.IntValue are in unnamed module of loader 'app')`)},iu=(e,t,n)=>{let r=ru(e,n)+ru(t,n);if(Er(r))throw Dr(`${e}+${t}`);return r},au=(e,t,n,r)=>{let i=Yl(n,e.domain[t]),a=ru(e.range[t],r);return i===void 0?a:a-ru(i,r)|0},ou=(e,t)=>Lt(e.reduce((e,n)=>(n.domain.forEach((r,i)=>{let a=e.find(e=>nt(e[0],r));a?a[1]=iu(a[1],n.range[i],t):e.push([r,n.range[i]])}),e),[])),su=tt([],[]),cu=[Sr(`EmptyBag`,su),J(`IsABag`,1,e=>{let t=Wl(q(e,0,`IsABag`));return t!==void 0&&Jl(t)}),J(`BagCardinality`,1,e=>{let t=q(e,0,`BagCardinality`);return Gl(e,0,`BagCardinality`).range.reduce((e,n)=>{if(typeof n!=`number`||n<=0)throw Hl(`BagCardinality`,`a bag`,t);return iu(e,n,nu)},0)}),J(`BagIn`,2,e=>{let t=q(e,1,`BagIn`),n=Yl(Gl(e,1,`BagIn`),q(e,0,`BagIn`));if(n===void 0)return!1;if(typeof n!=`number`)throw Ul(`second`,`BagIn`,`bag`,t);return n>0}),J(`CopiesIn`,2,e=>{let t=q(e,1,`CopiesIn`),n=Yl(Gl(e,1,`CopiesIn`),q(e,0,`CopiesIn`));if(n===void 0)return 0;if(typeof n!=`number`)throw Ul(`second`,`CopiesIn`,`bag`,t);return n}),J(`\\oplus`,2,e=>{let t=[0,1].map(t=>{let n=Kl(e,t,`(+)`);if(!Jl(n))throw Ul(t===0?`first`:`second`,`(+)`,`bag`,q(e,t,`(+)`));return n});return ou(t,tu)}),J(`\\ominus`,2,e=>{let t=Kl(e,0,`(-)`),n=Kl(e,1,`(-)`);return Lt(t.domain.flatMap((e,r)=>{let i=au(t,r,n,Zl);return i>0?[[e,i]]:[]}))}),J(`BagUnion`,1,e=>{let t=q(e,0,`BagUnion`),n=ql(t,()=>Hl(`BagUnion`,`a finite enumerable set`,t));if(n.length<2)return n[0]??su;let r=n.map(e=>{let n=Wl(e);if(!n)throw new y(`Attempted to apply BagUnion to the following set, whose\nelement is not a bag:\n${G(t)}`);return n});return ou(r,$l)}),J(`\\sqsubseteq`,2,e=>{let t=Gl(e,0,`\\sqsubseteq`),n=Gl(e,1,`\\sqsubseteq`);return t.domain.every((e,r)=>au(t,r,n,Ql)<=0)}),Cr(`BagOfAll`,2,e=>{let t=xr(e,0,`BagOfAll`);if(t.literalBody!==void 0)throw new y(`The first argument of BagOfAll should be an operator, but instead it is:\n${G(t.literalBody)}`);let n=q(e,1,`BagOfAll`),r=Wl(n);if(!r)throw Ul(`second`,`BagOfAll`,`function with a finite domain`,n);return ou(r.domain.map((e,n)=>tt([t.call([e])],[r.range[n]])),eu)}),J(`SubBag`,1,e=>{let t=q(e,0,`SubBag`);if(!F(t))throw new v(`DOMAIN expects a function but received ${G(t)}`);let n=W(t),r=jt(n.range).elements,i=r.find(e=>typeof e!=`number`);if(i!==void 0){let e=typeof r[0]!=`number`;throw new v(`The ${e?`first`:`second`} argument of >= should be an integer, but instead it is:\n${G(e?r[0]:i)}`)}let a=n.range.filter(e=>typeof e==`number`);if(a.some(e=>e<1))throw new v(`Attempted to apply a function to ${G(n)}, which is not in its domain`);return jt(n.domain.reduce((e,t,n)=>e.flatMap(e=>[e,...Array.from({length:a[n]},(n,r)=>[...e,[t,r+1]])]),[[]]).map(e=>tt(e.map(e=>e[0]),e.map(e=>e[1]))))}),J(`BagToSet`,1,e=>Pn(Gl(e,0,`BagToSet`))),J(`SetToBag`,1,e=>{let t=q(e,0,`SetToBag`),n=ql(t,()=>Hl(`BagToSet`,`a function with a finite domain`,t));return tt([...n],n.map(()=>1))})],lu=`public static tlc2.value.impl.StringValue tlc2.module.Json.toJsonArray(tlc2.value.IValue) throws java.io.IOException`,uu=`public static tlc2.value.impl.StringValue tlc2.module.Json.toJsonObject(tlc2.value.IValue) throws java.io.IOException`,du=`public static synchronized tlc2.value.impl.BoolValue tlc2.module.Json.serialize(tlc2.value.impl.StringValue,tlc2.value.impl.Value) throws java.io.IOException`,fu=`public static synchronized tlc2.value.impl.BoolValue tlc2.module.Json.ndSerialize(tlc2.value.impl.StringValue,tlc2.value.impl.Value) throws java.io.IOException`,pu=`public static tlc2.value.IValue tlc2.module.Json.deserialize(tlc2.value.impl.StringValue) throws java.io.IOException`,mu=`public static tlc2.value.IValue tlc2.module.Json.ndDeserialize(tlc2.value.impl.StringValue) throws java.io.IOException`,hu=e=>{if(!F(e))return!1;let t=W(e).domain;return t.length>0&&t.every(e=>typeof e==`string`)},gu=(e,t)=>Nr(e,`Cannot convert value: unsupported value type tlc2.value.impl.${jr(t)}`),_u=(e,t)=>Nr(e,`Cannot cast tlc2.value.impl.${jr(t)} to tlc2.value.impl.StringValue`),vu=e=>JSON.stringify(e).replaceAll(`\u2028`,`\\u2028`).replaceAll(`\u2029`,`\\u2029`),yu=(e,t)=>{if(typeof e==`object`&&(e.kind===`InfiniteSet`||e.kind===`SequenceSet`))throw gu(t,e);return`[${H(e).elements.map(e=>xu(e,t)).join(`,`)}]`},bu=(e,t)=>{let n=W(e),r=gn(n);return r?`[${r.map(e=>xu(e,t)).join(`,`)}]`:`{${n.domain.map((e,r)=>`${vu(typeof e==`string`?e:G(e))}:${xu(n.range[r],t)}`).join(`,`)}}`},xu=(e,t)=>typeof e==`string`?vu(e):typeof e==`object`?e.kind===`ModelValue`?vu(e.name):P(e)?yu(e,t):bu(e,t):String(e),Su=e=>{if(P(e))return yu(e,lu);if(!F(e)||hu(e))throw gu(lu,e);return bu(e,lu)},Cu=e=>{if(!F(e))throw gu(uu,e);return bu(e,uu)},wu=e=>{let[,t,n=`0`,r=``,i=`0`]=/^(-?)(\d+)(?:\.(\d*))?(?:[eE]([+-]?\d+))?$/.exec(e)??[],a=BigInt(n+r),o=Number(i)-r.length,s=o>=0?a*10n**BigInt(o):a/10n**BigInt(-o);return Number(BigInt.asIntN(32,t===`-`?-s:s))},Tu=(e,t)=>{if(typeof e==`boolean`||typeof e==`number`)return e;if(typeof e==`string`)return R(e);if(Array.isArray(e))return qt(e.map(e=>Tu(e,t)));if(typeof e==`object`&&e)return Jt(Object.entries(e).map(([e,n])=>[R(e),Tu(n,t)]));throw Nr(t,`Cannot convert value: unsupported JSON value ${String(e)}`)},Eu=(e,t)=>{if(e.trim()===``)return Tu(null,t);try{return Tu(JSON.parse(e,(e,t,n)=>typeof t==`number`?wu(n?.source??String(t)):t),t)}catch(e){throw e instanceof SyntaxError?Nr(t,e.message):e}},Du=(e,t)=>{if(typeof e!=`string`)throw _u(t,e);return e},Ou=(e,t,n)=>{let r=e.readFile?.(t);if(r===void 0)throw Nr(n,`${t} (No such file or directory)`);return r},ku=e=>[wr(`ToJson`,1,e=>R(xu(q(e,0,`ToJson`),`public static tlc2.value.impl.StringValue tlc2.module.Json.toJson(tlc2.value.IValue) throws java.io.IOException`))),wr(`ToJsonArray`,1,e=>R(Su(q(e,0,`ToJsonArray`)))),wr(`ToJsonObject`,1,e=>R(Cu(q(e,0,`ToJsonObject`)))),wr(`JsonSerialize`,2,t=>{let n=Du(q(t,0,`JsonSerialize`),du),r=q(t,1,`JsonSerialize`);if(!gn(r)&&!hu(r))throw new y(`The second argument of JsonSerialize should be a sequence or record, but instead it is:\n${G(r)}`);return e.writeFile?.(n,xu(r,du)),!0}),wr(`ndJsonSerialize`,2,t=>{let n=Du(q(t,0,`ndJsonSerialize`),fu),r=q(t,1,`ndJsonSerialize`),i=gn(r);if(!i)throw new y(`The second argument of ndJsonSerialize should be a sequence, but instead it is:\n${G(r)}`);return e.writeFile?.(n,i.map(e=>`${xu(e,fu)}\n`).join(``)),!0}),wr(`JsonDeserialize`,1,t=>{let n=Du(q(t,0,`JsonDeserialize`),pu);return Eu(Ou(e,n,pu),pu)}),wr(`ndJsonDeserialize`,1,t=>{let n=Du(q(t,0,`ndJsonDeserialize`),mu);return qt(Ou(e,n,mu).split(/\r\n|\r|\n/).map(e=>e.trim()).filter(e=>e!==``).map(e=>Eu(e,mu)))})],Au=(e,t,n,r)=>new y(`The ${e} argument of ${t} should be a ${n}, but instead it is:\n${r}`),ju=(e,t,n)=>{if(typeof e!=`number`||e<0)throw Au(t,n,`nonnegative integer`,G(e));return e},Mu=(e,t,n,r)=>{if(!P(e)||!V(e))throw Au(t,n,r,G(e));return H(e).elements},Nu=(e,t,n,r)=>jt(Array.from({length:t},()=>jt(e.filter(()=>r.nextDouble()<n)))),Pu=(e,t)=>{let n=`RandomSetOfSubsets`,r=ju(q(e,0,n),`first`,n),i=ju(q(e,1,n),`second`,n),a=Mu(q(e,2,n),`third`,n,`finite set`);if(a.length<31&&r>2**a.length)throw Au(`first`,n,`nonnegative integer that is smaller than the subset's size of 2^${a.length}`,String(r));if(a.length<i)throw Au(`second`,n,`nonnegative integer in range 0..Cardinality(S)`,String(i));return Nu(a,r,a.length===0?0:i/a.length,t.getRandom())},Fu=e=>[wr(`RandomSubset`,2,t=>{let n=q(t,0,`RandomSubset`);if(typeof n!=`number`)throw Au(`first`,`RandomSubset`,`nonnegative integer`,G(n));if(n<0)throw new v(`Attempted to apply the operator overridden by the Java method\npublic static tlc2.value.impl.Value tlc2.module.Randomization.RandomSubset(tlc2.value.impl.Value,tlc2.value.impl.Value),\nbut it produced the following error:\n${n}`);let r=q(t,1,`RandomSubset`);if(!P(r)||!U(r)&&!V(r))throw Au(`second`,`RandomSubset`,`a finite set`,G(r));return jt(Il(n,r,e.getRandom()))}),wr(`RandomSetOfSubsets`,3,t=>Pu(t,e)),wr(`TestRandomSetOfSubsets`,3,t=>qt(Array.from({length:5},()=>H(Pu(t,e)).elements.length)))],Iu=`tlc2.tool.impl.Tool,tla2sany.semantic.ExprOrOpArgNode[],tlc2.util.Context,tlc2.tool.TLCState,tlc2.tool.TLCState,int,tlc2.tool.coverage.CostModel`,Lu=`public static synchronized tlc2.value.impl.Value tlc2.module.TLCExt.assertError(${Iu})`,Ru=`public static tlc2.value.impl.TupleValue tlc2.module.TLCExt.getTrace(${Iu}) throws java.io.IOException`,zu=`public static synchronized tlc2.value.impl.Value tlc2.module.TLCExt.pickSuccessor(${Iu})`,Bu=()=>Jt([[`action`,jt([])],[`state`,jt([])]]),Vu=()=>Jt([[`beginLine`,0],[`beginColumn`,0],[`endLine`,0],[`endColumn`,0],[`module`,`--TLA+ BUILTINS--`]]),Hu=e=>Jt([[`name`,e??`UnnamedAction`],[`location`,Vu()]]),Uu=(e,t)=>{let n=e.map((e,t)=>qt([t+1,Jt(Object.entries(e.state))])),r=n.slice(1).map((t,r)=>qt([n[r],Hu(e[r+1].action),t])),i=t?[qt([n[n.length-1],Hu(t.action),n[t.start]])]:[];return Jt([[`action`,jt([...r,...i])],[`state`,jt(n)]])},Wu=(e,t)=>{if(typeof t==`number`)return e.registers.get(t);if(typeof t==`string`&&t.startsWith(`s:`))return Vl(e).get(t)},Gu=(e,t,n,r)=>{if(typeof n==`number`&&n>=0)e.registers.set(n,r);else if(n===`exit`)r===!0&&(e.isStopped=!0);else if(n===`pause`){if(r!==!0)return;t(`Press enter to resume model checking.`),e.pause()}else if(typeof n==`string`&&n.startsWith(`s:`))e.namedRegisters.set(n,r);else if(typeof n==`string`&&n.startsWith(`-D`))e.properties.set(n.slice(2),G(r));else throw new y(`The first argument of TLCSet should be a nonnegative integer, but instead it is:\n${G(n)}`)},Ku=e=>e.every(e=>e!==void 0),qu=(e,t)=>Jt(t.variables.map((t,n)=>[t,e[n]])),Ju=(e,t,n)=>{let r=e.kind===`Identifier`?e.name:e.kind===`Apply`?e.operator:void 0;if(e.kind===`Prime`||e.kind===`Unchanged`)return!0;if(r!==void 0&&!K(e)){if(t.variableIndex.has(r))return!0;let e=Io(r,t);if(e&&!n.has(e)&&(n.add(e),Ju(e.body,t,n)))return!0}return lr(e).some(e=>Ju(e,t,n))},Yu=(e,t)=>{let n=/* @__PURE__ */ new Map,r=/* @__PURE__ */ new WeakMap,i=e=>{let t=r.get(e)??/* @__PURE__ */ new Map;return r.set(e,t),t};return[J(`AssertEq`,2,t=>{let n=q(t,0,`AssertEq`),r=q(t,1,`AssertEq`),i=nt(n,r);return i||(e(G(`Assertion failed`,!0)),e(G(n,!0)),e(G(r,!0))),i}),Br(`AssertError`,2,e=>{let t=xr(e,0,`AssertError`).expression;if(t&&t.kind!==`String`)throw Nr(Lu,`In computing AssertError, a non-string expression (line ${t.location.line}, col ${t.location.column}) was used as the err of an AssertError(err, exp).`);let n=Vr(e,0,`AssertError`)();try{Vr(e,1,`AssertError`)()}catch(e){if(e instanceof v)return e.message===n;throw e}return!1}),wr(`TLCGetOrDefault`,2,e=>{let n=q(e,0,`TLCGetOrDefault`);return Wu(t,n)??q(e,1,`TLCGetOrDefault`)}),{...Cr(`TLCGetAndSet`,4,n=>{let r=q(n,0,`TLCGetAndSet`),i=Wu(t,r)??q(n,3,`TLCGetAndSet`),a=xr(n,1,`TLCGetAndSet`);return Gu(t,e,r,a.call([i,q(n,2,`TLCGetAndSet`)])),i}),isStateLevel:!0},wr(`Trace`,0,(e,n)=>{let r=n?.state;if(!n||!r||!Ku(r)){let e=(n?.environment.variables??[]).filter((e,t)=>r?.[t]===void 0);throw Nr(Ru,`In evaluating TLCExt!Trace, the state is not completely specified yet (variable${e.length>1?`s`:``} ${e.join(`, `)} undefined).`)}return qt(t.getBehavior(r).map(e=>qu(e,n.environment)))}),wr(`CounterExample`,0,()=>t.counterExample??Bu()),J(`ToTrace`,1,e=>{let t=q(e,0,`ToTrace`);if(!F(t)||!nt(Pn(t),jt([`action`,`state`])))throw new v(`The argument of ToTrace should be a CounterExample, but instead it is:\n${G(t)}`);let n=H(Mn(t,`state`)).elements.map(e=>gn(e)??[]);return qt(n.sort((e,t)=>Number(e[0])-Number(t[0])).map(e=>e[1]))}),J(`TLCModelValue`,1,e=>{let t=q(e,0,`TLCModelValue`);if(typeof t!=`string`)throw new y(`The argument of ModelValue should be a string, but instead it is:\n${G(t)}`);return $e(t)}),Br(`TLCDefer`,1,()=>!0),J(`TLCNoOp`,1,e=>q(e,0,`TLCNoOp`)),Br(`PickSuccessor`,1,(e,n)=>{let r=n?.next;if(!r||!Ku(r))throw Nr(zu,`Cannot invoke "tlc2.value.IValue.fingerPrint(long)" because "minVals[i]" is null`);if(t.isSeen(r)||Fo(Vr(e,0,`PickSuccessor`)(),`the condition of PickSuccessor`))return!0;throw new re(`PickSuccessor needs interactive input to extend the behavior with a new state`)}),Br(`TLCCache`,2,(e,t)=>{let r=xr(e,0,`TLCCache`),a=Qn(Vr(e,1,`TLCCache`)()),o=r.expression;if(!o||!t)return r.call([]);let s=Ju(o,t.environment,/* @__PURE__ */ new Set)&&t.state?i(t.state):n,c=s.get(o)??/* @__PURE__ */ new Map;s.set(o,c);let l=c.get(a);if(l!==void 0)return l;let u=r.call([]);return c.set(a,u),u}),J(`TLCFP`,1,e=>Number(BigInt.asIntN(32,xl([q(e,0,`TLCFP`)])))),wr(`TLCEvalDefinition`,1,(e,t)=>{let n=q(e,0,`TLCEvalDefinition`),r=typeof n==`string`&&t?Io(n,t.environment):void 0;if(!r||typeof n!=`string`||!t)throw new y(`The argument of TLCEvalDefinition should be a name of a definition reachable from the root module, but instead it is:\n${G(n)}`);if(r.kind===`Operator`&&r.params.length>0)throw new y(`The argument of TLCEvalDefinition should be a zero-arity definition, but instead it is:\n${n}`);return Z({kind:`Identifier`,name:n,location:r.location},t)})]},Xu=(e,t)=>[wr(`_Track`,2,e=>{let n=String(q(e,1,`_Track`)),r=t.possibleCounts.get(n)??0;return t.possibleCounts.set(n,q(e,0,`_Track`)===!0?r+1:r),!0}),wr(`_Counts`,0,()=>Bl(t)),wr(`_CheckName`,1,n=>{let r=String(q(n,0,`_CheckName`));return t.possibleCounts.get(r)?!0:(e(G(Bl(t),!0)),!1)}),wr(`_PrintCounts`,0,()=>(e(G(Bl(t),!0)),!0))],Zu=e=>String(e).padStart(2,`0`),Qu=e=>`${e.getUTCFullYear()}.${Zu(e.getUTCMonth()+1)}.${Zu(e.getUTCDate())}.${Zu(e.getUTCHours())}${Zu(e.getUTCMinutes())}${Zu(e.getUTCSeconds())}`,$u=e=>Lt([...e].map(([e,t])=>[e,qt([t])])),ed=/* @__PURE__ */ new Set([`diameter`,`generated`,`distinct`,`queue`,`stats`,`config`]),td=(e,t,n)=>{if(!e.isStarted&&ed.has(t))throw new v(`TLCGet(${t}) was undefined.`);let r=Math.floor((Date.now()-e.startedAt)/1e3);switch(t){case`level`:return n===void 0?0:e.getLevel(n);case`diameter`:return e.diameter;case`generated`:return e.generatedStates;case`distinct`:return e.distinctStates;case`queue`:return e.queueSize;case`duration`:return r;case`stats`:return Jt([[`queue`,e.queueSize],[`distinct`,e.distinctStates],[`initial`,e.initialStates],[`generated`,e.generatedStates],[`diameter`,e.diameter],[`duration`,r],[`worker`,0]]);case`config`:return Jt([[`mode`,`bfs`],[`deadlock`,e.checkDeadlock],[`worker`,1],[`seed`,String(e.seed)],[`fingerprint`,`0`],[`install`,`unknown`]]);case`revision`:{let t=/* @__PURE__ */ new Date;return Jt([[`count`,0],[`timestamp`,Math.floor(t.getTime()/1e3)],[`date`,R(`${t.toISOString().slice(0,19)}.${t.getUTCMilliseconds()}Z`)],[`tag`,`development`],[`calver`,R(Qu(new Date(e.startedAt)))]])}case`spec`:return e.getSpecification();case`action`:return Hu(void 0);case`all`:return $u(e.registers);case`all:named`:return $u(Vl(e))}if(t.startsWith(`s:`)){let n=Vl(e).get(t);if(n===void 0)throw new v(`TLCGet(${t}) was undefined.`);return n}if(t.startsWith(`-D`))return R(e.properties.get(t.slice(2))??t);throw new v(`TLCGet(${t}) was undefined.`)},nd=e=>e.length===0?[[]]:e.flatMap((t,n)=>nd([...e.slice(0,n),...e.slice(n+1)]).map(e=>[t,...e])),rd=e=>{typeof e==`object`&&((e.kind===`Set`||e.kind===`MixedSet`)&&H(e).elements.forEach(rd),e.kind===`Function`&&e.range.forEach(rd))},id=(t,n)=>[J(`Print`,2,e=>(t(`${Ee(G(q(e,0,`Print`),!0,!0))} ${Ee(G(q(e,1,`Print`),!0,!0))}`),q(e,1,`Print`))),J(`PrintT`,1,e=>(t(Ee(G(q(e,0,`PrintT`),!0,!0))),!0)),J(`Assert`,2,t=>{if(q(t,0,`Assert`)!==!0)throw new y(`The first argument of Assert evaluated to FALSE; the second argument was:\n${Ee(G(q(t,1,`Assert`)))}`,e.assertViolation);return!0}),J(`JavaTime`,0,()=>Math.floor(Date.now()/1e3)&2147483647),J(`:>`,2,e=>Lt([[q(e,0,`:>`),q(e,1,`:>`)]])),J(`@@`,2,e=>{let t=br(e,0,`@@`),n=br(e,1,`@@`);return Rt([...Fe(t),...Fe(n)])}),J(`ToString`,1,e=>R(G(q(e,0,`ToString`),!0))),J(`TLCEval`,1,e=>{let t=q(e,0,`TLCEval`);return rd(t),t}),J(`Permutations`,1,e=>{let t=vr(e,0,`Permutations`);return jt(nd(t).map(e=>Lt(t.map((t,n)=>[t,e[n]]))))}),Cr(`SortSeq`,2,e=>{let t=xr(e,1,`SortSeq`);return qt(yr(e,0,`SortSeq`).reduce((e,n)=>{let r=e.findIndex(e=>t.call([n,e])===!0);return r===-1?[...e,n]:[...e.slice(0,r),n,...e.slice(r)]},[]))}),wr(`TLCGet`,1,(e,t)=>{let r=q(e,0,`TLCGet`);if(typeof r==`number`&&r>=0){let e=n.registers.get(r);if(e===void 0)throw new v(`TLCGet(${r}) was undefined.`);return e}if(typeof r!=`string`)throw new v(`The argument of TLCGet should be a nonnegative integer, but instead it is:\n${G(r)}`);return td(n,r,t?.state)}),wr(`TLCSet`,2,e=>{let r=q(e,0,`TLCSet`);return Gu(n,t,r,q(e,1,`TLCSet`)),!0}),Sr(`Any`,Xe),J(`RandomElement`,1,e=>Rl(gr(e,0,`RandomElement`),n.getRandom()))],ad=/* @__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(`,`),od=[[`\\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`,`≀`],[`^+`,`⁺`]],sd=/* @__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(`,`),cd=/* @__PURE__ */ `exit.pause.config.spec.coverage.action.install.id.behavior.all.mode.deadlock.seed.fingerprint.worker.traces.depth.aril.sched.revision.timestamp.date.count.tag.calver.impliedinits.impliedactions.invariants.impliedtemporals.temporals.actions.inits.variables.actionconstraints.constraints.stats.duration.generated.diameter.distinct.initial.queue.retries.distinctvalues.levelmean.levelvariance.bfs`.split(`.`),ld=/* @__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(`.`),ud=/* @__PURE__ */ new Map([[`Naturals`,`-------------------------------- MODULE Naturals ----------------------------
|
|
149
|
+
=============================================================================`,Td=/* @__PURE__ */ new Map([[`Reals`,Sd],[`RealTime`,Cd],[`Toolbox`,wd]]),Ed=`tlc2/value/impl/`,Dd=e=>{let t=new DataView(e.buffer,e.byteOffset,e.byteLength),n={offset:0},r=e=>{let t=n.offset;return n.offset+=e,t};return{readUint8:()=>t.getUint8(r(1)),readUint16:()=>t.getUint16(r(2)),readUint32:()=>t.getUint32(r(4)),readInt32:()=>t.getInt32(r(4)),readBytes:t=>e.subarray(r(t),n.offset)}},Od=/* @__PURE__ */ new Map([[`B`,`byte`],[`C`,`char`],[`D`,`double`],[`F`,`float`],[`I`,`int`],[`J`,`long`],[`S`,`short`],[`Z`,`boolean`],[`V`,`void`]]),kd=[[1,`public`],[4,`protected`],[2,`private`],[1024,`abstract`],[8,`static`],[16,`final`],[32,`synchronized`],[256,`native`],[2048,`strictfp`]],Ad=e=>[...e.matchAll(/(\[*)(?:L([^;]*);|([BCDFIJSZV]))/g)].map(e=>`${e[2]?.replaceAll(`/`,`.`)??Od.get(e[3])}${`[]`.repeat(e[1].length)}`),jd=(e,t)=>e[e[t].first].text,Md=(e,t)=>jd(e,t).replaceAll(`/`,`.`),Nd=e=>{let t=Dd(e);if(t.readUint32()!==3405691582)throw new u(`A module override is not a class file`);t.readUint16(),t.readUint16();let n=[],r=t.readUint16(),i=new TextDecoder;for(let e=1;e<r;e++){let r=t.readUint8(),a={tag:r,text:``,value:0,first:0,second:0};n[e]=a,r===1?a.text=i.decode(t.readBytes(t.readUint16())):r===3?a.value=t.readInt32():r===4?t.readUint32():r===5||r===6?(t.readBytes(8),e++):r===7||r===8||r===16||r===19||r===20?a.first=t.readUint16():r===15?(t.readUint8(),a.first=t.readUint16()):(a.first=t.readUint16(),a.second=t.readUint16())}t.readUint16();let a=Md(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=Ad(i.slice(1,s)),l=Array.from({length:t.readUint16()},()=>({name:n[t.readUint16()].text,reader:Dd(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()},()=>Md(n,d.readUint16())):[],p=kd.filter(([t])=>(e&t)!==0).map(([,e])=>e),m=Ad(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}},Pd=(e,t)=>{let n=e[t],r=e[n.second];return{className:jd(e,n.first),name:e[r.first].text}},Fd=(e,t,n,r)=>{let i=()=>new C(`The Java override ${n}.${e.name} computes its value, which tla-ts cannot run`),a=e.code;if(!a)throw i();let o=[],s=()=>{let e=o.pop();if(e===void 0)throw i();return e},c=e=>{let n=t[e];if(n.tag===3)return n.value;if(n.tag===8)return t[n.first].text;throw i()};for(let e=0;e<a.length;){let n=a[e],l=()=>a[e+1]<<8|a[e+2];if(n>=2&&n<=8)o.push(n-3),e+=1;else if(n===16)o.push(a[e+1]<<24>>24),e+=2;else if(n===17)o.push(l()<<16>>16),e+=3;else if(n===18)o.push(c(a[e+1])),e+=2;else if(n===19)o.push(c(l())),e+=3;else if(n===89){let t=s();o.push(t,t),e+=1}else if(n===178){let n=Pd(t,l());if(n.className!==`${Ed}BoolValue`||n.name!==`ValTrue`&&n.name!==`ValFalse`)throw i();o.push({kind:`Identifier`,name:n.name===`ValTrue`?`TRUE`:`FALSE`,location:r}),e+=3}else if(n===184){let n=Pd(t,l()),a=s();if(n.className!==`${Ed}IntValue`||n.name!==`gen`||typeof a!=`number`)throw i();o.push({kind:`Number`,value:a,location:r}),e+=3}else if(n===187)o.push({className:jd(t,l()),value:void 0}),e+=3;else if(n===183){let n=Pd(t,l()),a=s(),o=s();if(!(n.className===`${Ed}StringValue`&&n.name===`<init>`&&typeof a==`string`&&typeof o==`object`&&`className`in o))throw i();o.value={kind:`String`,value:a,location:r},e+=3}else if(n===176){let e=s();if(typeof e!=`object`)throw i();if(`className`in e){if(!e.value)throw i();return e.value}return e}else throw i()}throw i()},Id=(e,t,n)=>{if(!t)return{module:e,overrides:[]};let r=Nd(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:Fd(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)}))}},Ld=/* @__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(`,`),Rd=[[`\\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`,`≀`],[`^+`,`⁺`]],zd=/* @__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(`,`),Bd=/* @__PURE__ */ `exit.pause.config.spec.coverage.action.install.id.behavior.all.mode.deadlock.seed.fingerprint.worker.traces.depth.aril.sched.revision.timestamp.date.count.tag.calver.impliedinits.impliedactions.invariants.impliedtemporals.temporals.actions.inits.variables.actionconstraints.constraints.stats.duration.generated.diameter.distinct.initial.queue.retries.distinctvalues.levelmean.levelvariance.bfs`.split(`.`),Vd=/* @__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(`.`),Hd=/* @__PURE__ */ new Map([[`Naturals`,`-------------------------------- MODULE Naturals ----------------------------
|
|
103
150
|
Nat == { }
|
|
104
151
|
a+b == {a, b}
|
|
105
152
|
a-b == CHOOSE n : b + n = a
|
|
@@ -415,16 +462,18 @@ _CheckName(name) ==
|
|
|
415
462
|
=> (PrintT(counts) /\\ FALSE)
|
|
416
463
|
_PrintCounts == PrintT(_Counts)
|
|
417
464
|
=============================================================================
|
|
418
|
-
`]]),dd=/* @__PURE__ */ new Map([[`FiniteSets`,/* @__PURE__ */ new Map([[`IsFiniteSet`,`public static tlc2.value.IBoolValue tlc2.module.FiniteSets.IsFiniteSet(tlc2.value.impl.Value)`],[`Cardinality`,`public static tlc2.value.impl.IntValue tlc2.module.FiniteSets.Cardinality(tlc2.value.impl.Value)`]])],[`Sequences`,/* @__PURE__ */ new Map([[`Seq`,`public static tlc2.value.impl.Value tlc2.module.Sequences.Seq(tlc2.value.impl.Value)`],[`Len`,`public static tlc2.value.impl.IntValue tlc2.module.Sequences.Len(tlc2.value.impl.Value)`],[`Head`,`public static tlc2.value.impl.Value tlc2.module.Sequences.Head(tlc2.value.impl.Value)`],[`Tail`,`public static tlc2.value.impl.Value tlc2.module.Sequences.Tail(tlc2.value.impl.Value)`],[`Append`,`public static tlc2.value.impl.Value tlc2.module.Sequences.Append(tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`\\o`,`public static tlc2.value.impl.Value tlc2.module.Sequences.Concat(tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`SubSeq`,`public static tlc2.value.impl.Value tlc2.module.Sequences.SubSeq(tlc2.value.impl.Value,tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`SelectSeq`,`public static tlc2.value.impl.Value tlc2.module.Sequences.SelectSeq(tlc2.value.impl.Value,tlc2.value.impl.Value)`]])],[`TLC`,/* @__PURE__ */ new Map([[`Print`,`public static tlc2.value.impl.Value tlc2.module.TLC.Print(tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`PrintT`,`public static tlc2.value.impl.Value tlc2.module.TLC.PrintT(tlc2.value.impl.Value)`],[`ToString`,`public static tlc2.value.impl.Value tlc2.module.TLC.ToString(tlc2.value.impl.Value)`],[`Assert`,`public static tlc2.value.impl.Value tlc2.module.TLC.Assert(tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`:>`,`public static tlc2.value.impl.Value tlc2.module.TLC.MakeFcn(tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`@@`,`public static tlc2.value.impl.Value tlc2.module.TLC.CombineFcn(tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`SortSeq`,`public static tlc2.value.impl.Value tlc2.module.TLC.SortSeq(tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`Permutations`,`public static tlc2.value.impl.Value tlc2.module.TLC.Permutations(tlc2.value.impl.Value)`],[`RandomElement`,`public static tlc2.value.impl.Value tlc2.module.TLC.RandomElement(tlc2.value.impl.Value)`],[`TLCGet`,`public static tlc2.value.impl.Value tlc2.module.TLCGetSet.TLCGetEval(tlc2.tool.impl.Tool,tla2sany.semantic.ExprOrOpArgNode[],tlc2.util.Context,tlc2.tool.TLCState,tlc2.tool.TLCState,int,tlc2.tool.coverage.CostModel)`],[`TLCEval`,`public static tlc2.value.impl.Value tlc2.module.TLCEval.tlcEval(tlc2.tool.impl.Tool,tla2sany.semantic.ExprOrOpArgNode[],tlc2.util.Context,tlc2.tool.TLCState,tlc2.tool.TLCState,int,tlc2.tool.coverage.CostModel)`]])]]),fd=(e,t)=>e.every(e=>bn(e,t)),pd=jt([!1,!0]),md=(e,t,n)=>{if(n-t===1)return e[t];let r=t+n>>1;return It(md(e,t,r),md(e,r,n))},hd=[`\\cup`,`\\cap`,`\\`],gd=e=>typeof e==`object`&&e.kind===`MixedSet`,_d=e=>e.kind===`Interval`?H(e).elements:e.elements,vd=(e,t,n)=>{let r=_d(t);if(e!==`\\cup`){let t=e===`\\cap`;return Mt(r.filter(e=>bn(e,n)===t))}if(r.length===0)return n;if(!Ae(n))return{kind:`SetOperation`,operator:e,left:t,right:n};let i=H(n).elements.filter(e=>!bn(e,t));return Mt([...r,...i])},yd=[Sr(`TRUE`,!0),Sr(`FALSE`,!1),Sr(`BOOLEAN`,pd),Sr(`STRING`,{kind:`InfiniteSet`,name:`STRING`}),Tr(`=`,kt),Tr(`#`,(e,t)=>!kt(e,t)),J(`~`,1,e=>!mr(e,0,`~`)),J(`<=>`,2,e=>mr(e,0,`<=>`)===mr(e,1,`<=>`)),J(`/\\`,2,e=>mr(e,0,`/\\`)&&mr(e,1,`/\\`)),J(`\\/`,2,e=>mr(e,0,`\\/`)||mr(e,1,`\\/`)),J(`=>`,2,e=>!mr(e,0,`=>`)||mr(e,1,`=>`)),J(`\\in`,2,e=>bn(q(e,0,`\\in`),q(e,1,`\\in`))),J(`\\notin`,2,e=>!bn(q(e,0,`\\notin`),q(e,1,`\\notin`))),J(`\\subseteq`,2,e=>{let t=hr(e,0,`\\subseteq`),n=q(e,1,`\\subseteq`);return typeof t==`object`&&t.kind===`Subset`&&typeof n==`object`&&n.kind===`Subset`&&V(t.base)?fd(H(t.base).elements,n.base):fd(H(t).elements,n)}),...hd.map(e=>J(e,2,t=>{let n=hr(t,0,e),r=hr(t,1,e);if(Ae(n)&&Ae(r)&&!gd(n)&&!gd(r)){if(e===`\\cup`&&U(n))return r;let t=e===`\\cup`?It:e===`\\cap`?Ft:Pt;try{return t(H(n),H(r))}catch(e){if(!(e instanceof v))throw e}}return Ae(n)?vd(e,n,r):e!==`\\`&&Ae(r)?vd(e,r,n):{kind:`SetOperation`,operator:e,left:n,right:r}})),J(`SUBSET`,1,e=>({kind:`Subset`,base:hr(e,0,`SUBSET`)})),J(`UNION`,1,e=>{let t=hr(e,0,`UNION`),n=_t(t)?t.elements.filter(_t):[];if(!_t(t)||n.length!==t.elements.length)return{kind:`Union`,base:t};if(gd(t)||n.some(gd)){let e={kind:`MixedSet`,elements:[]};return n.forEach(t=>t.elements.forEach(t=>{bn(t,e)||e.elements.push(t)})),Mt(e.elements)}return n.length===0?Nt:md(n.map(H),0,n.length)}),J(`DOMAIN`,1,e=>{let t=q(e,0,`DOMAIN`);if(!F(t))throw new v(`DOMAIN expects a function but received ${G(t)}`);return Pn(t)})],bd=Ir(`DotDot`,`IntervalValue`,2),xd=Ir(`Neg`,`IntValue`,1),Sd=[Sr(`Nat`,{kind:`InfiniteSet`,name:`Nat`}),Lr(`+`,`Plus`,(e,t)=>e+t),Lr(`-`,`Minus`,(e,t)=>e-t),Lr(`*`,`Times`,(e,t)=>e*t),Lr(`^`,`Expt`,(e,t)=>{if(t<0)throw new y(`The second argument of ^ should be a natural number, but instead it is:\n${t}`);if(e===0&&t===0)throw new y(`0^0 is undefined.`);return e**t}),Lr(`\\div`,`Divide`,(e,t)=>{if(t===0)throw new y(`The second argument of \\div is 0.`);let n=Math.floor(e/t);if(Er(n))throw Dr(`${e} \\div ${t}`);return n}),Lr(`%`,`Mod`,(e,t)=>{if(t<=0)throw new y(`The second argument of % should be a positive number, but instead it is:\n${t}`);return(e%t+t)%t}),zr(`<`,(e,t)=>e<t),zr(`>`,(e,t)=>e>t),zr(`<=`,(e,t)=>e<=t),zr(`>=`,(e,t)=>e>=t),J(`..`,2,e=>({kind:`Interval`,low:Fr(q(e,0,`..`),bd),high:Fr(q(e,1,`..`),bd)}))],Cd=[Sr(`Int`,{kind:`InfiniteSet`,name:`Int`}),J(`-.`,1,e=>{let t=Fr(q(e,0,`-`),xd);if(Er(-t))throw Dr(`-${t}`);return-t})],wd=(e,t,n)=>{let r=q(e,t,n),i=gn(r);if(!i)throw new y(`${n}\n${G(r)}`);return i},Td=(e,t,n)=>{let r=q(e,t,n);return typeof r==`string`?r:wd(e,t,n)},Ed=(e,t,n)=>typeof e==`string`?R(e.slice(t,n)):qt(e.slice(t,n)),Dd=(e,t)=>`The ${e}argument of ${t} should be a sequence, but instead it is:`,Od=(e,t)=>`Evaluating an expression of the form ${e} when s is not a ${t}:`,kd=(e,t)=>{let n=dd.get(e);return n?t.map(e=>{let t=n.get(e.name);return t?Pr(e,t):e}):t},Ad=kd(`Sequences`,[J(`Seq`,1,e=>({kind:`SequenceSet`,base:q(e,0,`Seq`)})),J(`Len`,1,e=>Td(e,0,Dd(``,`Len`)).length),J(`\\o`,2,e=>{let t=Td(e,0,Od(`s \\o t`,`sequence`));if(typeof t!=`string`){let n=wd(e,1,Od(`t \\o s`,`sequence`));return qt([...t,...n])}let n=q(e,1,`\\o`);if(typeof n!=`string`)throw new y(`${Od(`t \\o s`,`string`)}\n${G(n)}`);return R(t+n)}),J(`Append`,2,e=>qt([...wd(e,0,Od(`Append(s, v)`,`sequence`)),q(e,1,`Append`)])),J(`Head`,1,e=>{let t=wd(e,0,Dd(``,`Head`));if(t.length===0)throw new y(`Attempted to apply Head to the empty sequence.`);return t[0]}),J(`Tail`,1,e=>{let t=Td(e,0,Dd(``,`Tail`));if(t.length===0)throw new y(`Attempted to apply Tail to the empty sequence.`);return Ed(t,1)}),J(`SubSeq`,3,e=>{let t=Td(e,0,Dd(`first `,`SubSeq`)),n=pr(e,1,`SubSeq`),r=pr(e,2,`SubSeq`);if(n>r)return Ed(t,0,0);let i=n<1?{position:`second`,value:n}:r>t.length?{position:`third`,value:r}:void 0;if(i)throw new y(`The ${i.position} argument of SubSeq must be in the domain of its first argument:\n${G(q(e,0,`SubSeq`))}\n, but instead it is\n${i.value}`);return Ed(t,n-1,r)}),Cr(`SelectSeq`,2,e=>{let t=xr(e,1,`SelectSeq`);return qt(wd(e,0,Dd(`first `,`SelectSeq`)).filter(e=>{let n=t.call([e]);if(typeof n!=`boolean`)throw new y(`The second argument of SelectSeq should be a operator, but instead it is:\n${G(n)}`);return n}))})]),jd=kd(`FiniteSets`,[J(`IsFiniteSet`,1,e=>{let t=q(e,0,`IsFiniteSet`);if(P(t))return mn(t);if(typeof t==`object`&&t.kind===`Function`)return!0;throw new v(typeof t==`object`&&t.kind===`LazyFunction`?`Attempted to check if the function:\n${G(t)}\nis a finite set.`:`Attempted to check if the ${je(t)} ${G(t)} is a finite set.`)}),J(`Cardinality`,1,e=>{let t=q(e,0,`Cardinality`);if(!P(t)||typeof t==`object`&&(t.kind===`InfiniteSet`||t.kind===`SequenceSet`))throw new y(`Attempted to compute cardinality of the value\n${G(t)}`);return fn(t)})]),Md=/* @__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`]]]),Nd=(e,t,n,r)=>{switch(e){case`Naturals`:return{extends:[],operators:Sd};case`Integers`:return{extends:[`Naturals`],operators:Cd};case`Sequences`:return{extends:[],operators:Ad};case`FiniteSets`:return{extends:[],operators:jd};case`TLC`:return{extends:[],operators:kd(`TLC`,id(t,n))};case`Randomization`:return{extends:[],operators:Fu(n)};case`_Possible`:return{extends:[],operators:Xu(t,n)};case`Json`:return{extends:[],operators:ku(r)};case`Bags`:return{extends:[],operators:cu};case`TLCExt`:return{extends:[],operators:Yu(t,n)};default:return}},Pd=`$subexpression`,Fd=(e,t)=>new p(`${e} at line ${t.line}, column ${t.column}`),Id=e=>e.filter((t,n)=>n===0||e[n-1].set!==t.set).map(e=>e.set),Ld=(e,t)=>typeof e==`number`?e>=1&&e<=t?e-1:-1:e===`<<`?t>0?0:-1:t===2?1:-1,Rd=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}},zd=e=>{switch(e.kind){case`Forall`:case`Exists`:case`FunctionConstruction`:return{names:ui(e.bounds),body:e.body,sets:Id(e.bounds)};case`SetMap`:return{names:ui(e.bounds),body:e.expression,sets:Id(e.bounds)};case`SetFilter`:return{names:li(e.bound.pattern),body:e.predicate,sets:[e.bound.set]};case`Choose`:return{names:li(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}},Bd=(e,t,n)=>{if(e.kind===`Label`)return e.name===t?{label:e,lets:n}:void 0;if(e.kind===`Let`)return Bd(e.body,t,[...n,e.definitions]);if(e.kind!==`Lambda`)for(let r of lr(e)){let e=Bd(r,t,n);if(e)return e}},Vd=(e,t,n)=>e.length===0&&n.length>0?n.splice(0,t):e,Hd=(e,t,n)=>t.reduceRight((e,t)=>({kind:`Let`,definitions:t,body:e,location:n}),e),Ud=(e,t)=>{let n=e.location,r=Hd(t,e.lets,n);if(e.params.length===0)return r;if(e.args.length===0){if(e.params.some(e=>e.arity>0))throw Fd(`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 Fd(`The subexpression requires ${e.params.length} arguments but received ${e.args.length}`,n);return{kind:`Let`,definitions:[{kind:`Operator`,name:Pd,params:e.params,body:r,isLocal:!0,isRecursive:!1,location:n}],body:{kind:`Apply`,operator:Pd,args:e.args,location:n,resolution:$r},location:n}},Wd=(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:$r})),a=i.length===0?{kind:`Identifier`,name:e.name,location:n,resolution:$r}:{kind:`Apply`,operator:e.name,args:i,location:n,resolution:$r};return Ud({...t,params:[...t.params,...r]},a)},Gd=(e,t,n,r)=>{let i={params:[],args:[],lets:[],location:n},a={index:0,current:void 0},o=i=>{let o=[],s=[];for(;a.index<e.length;){let c=e[a.index];if(c.kind!==`Name`)throw Fd(`Expected an operator name`,n);o.push(c.name),s.push(...c.args);let l=o.join(`!`),u=i?i.find(e=>Yi(e)===l):t(l);if(u)return{definition:u,args:Vd(s,ii(u),r)};a.index++}throw Fd(`Unknown operator ${o.join(`!`)}`,n)},s=t=>{let r=o(t),s=r.definition,c=ii(s),l=a.index===e.length-1;if(r.args.length!==c&&r.args.length!==0)throw Fd(`The operator ${s.name} requires ${c} arguments`,n);if(l)return{definition:s,args:r.args};if(s.kind!==`Operator`)throw Fd(`Cannot select a subexpression of ${s.name}`,n);i.params.push(...s.params),i.args.push(...r.args),a.current=s.body,a.index++},c=()=>{for(;a.index<e.length;){let t=e[a.index];if(t.kind!==`Name`)return;let o=a.current&&Bd(a.current,t.name,[]);if(!o)throw Fd(`Cannot find label ${t.name}`,n);i.lets.push(...o.lets),i.params.push(...o.label.params.map(e=>({name:e,arity:0}))),i.args.push(...Vd(t.args,o.label.params.length,r)),a.current=o.label.body,a.index++}},l=t=>{let o=a.current;if(!o)throw Fd(`Subexpression selection failed`,n);if(t.kind===`Colon`)return;if(o.kind===`Label`){a.current=o.body,l(t);return}if(o.kind===`Let`){if(t.kind!==`Operand`||Ld(t.operand,1)!==0)throw Fd(`A LET/IN expression has only one operand`,n);i.lets.push(o.definitions),a.current=o.body;return}let s=zd(o);if(s&&(t.kind===`Bound`||t.kind===`At`)){i.params.push(...s.names.map(e=>({name:e,arity:0}))),t.kind===`Bound`&&i.args.push(...Vd(t.args,s.names.length,r)),a.current=s.body;return}if(o.kind===`Case`&&t.kind===`Operand`){let r=[...o.arms,...o.other?[{condition:void 0,body:o.other}]:[]],i=r[Ld(t.operand,r.length)],s=e[a.index+1];if(!i||s?.kind!==`Operand`)throw Fd(`A subexpression of CASE must have the form !i!j`,n);a.index++;let c=Ld(s.operand,2),l=c===0?i.condition:c===1?i.body:void 0;if(!l)throw Fd(`Nonexistent CASE operand`,n);a.current=l;return}if(t.kind!==`Operand`)throw Fd(`Unexpected subexpression selector`,n);let c=s?s.sets:Rd(o),u=c?.[Ld(t.operand,c.length)];if(!u)throw Fd(`Nonexistent operand specified by the selector`,n);a.current=u},u=s(void 0);if(u)return Wd(u.definition,{...i,args:u.args});for(c();a.index<e.length;){let t=e[a.index];if(t.kind===`Name`){for(;a.current?.kind===`Label`;)a.current=a.current.body;if(a.current?.kind!==`Let`)throw Fd(`A name selector here must be from a LET clause`,n);i.lets.push(a.current.definitions);let e=s(a.current.definitions);if(e)return Wd(e.definition,{...i,args:[...i.args,...e.args]});c()}else l(t),a.index++}if(!a.current)throw Fd(`Subexpression selection failed`,n);return Ud(i,a.current)},Kd=(e,t)=>{if(!e.includes(`!`)||t(e))return;let n=e.split(`!`),r=n.findIndex((e,r)=>t(n.slice(0,r+1).join(`!`)));if(r!==-1)return[{kind:`Name`,name:n.slice(0,r+1).join(`!`),args:[]},...n.slice(r+1).map(e=>({kind:`Name`,name:e,args:[]}))]},qd=e=>e.kind===`Subexpression`||e.kind===`Identifier`&&e.name.includes(`!`)||e.kind===`Apply`&&e.operator.includes(`!`)||lr(e).some(qd),Jd=(e,t)=>{if(!qd(e))return e;if(e.kind===`Let`){let n=n=>e.definitions.find(e=>e.name===n)??t(n);return Qi(e,e=>Jd(e,n))}let n=Qi(e,e=>Jd(e,t));if(n.kind===`Subexpression`)return Gd(n.selectors,t,n.location,[]);let r=n.kind===`Identifier`?n.name:n.kind===`Apply`?n.operator:``,i=Kd(r,t);if(!i)return n;let a=n.kind===`Apply`?[...n.args]:[],o=Gd(i,t,n.location,a);if(a.length>0)throw Fd(`Too many arguments for ${r}`,n.location);return o},Yd=e=>{let t=new Map(e.map(e=>[e.name,e]));return e=>t.get(e)},Xd=(e,t)=>{let n=Yd(t.definitions);return{...e,substitutions:e.substitutions.map(e=>({name:e.name,expression:Jd(e.expression,n)}))}},Zd=(e,t)=>{let n=Yd([...t,...e.definitions]);return e.definitions.some(e=>qd(e.body))||e.assumptions.some(e=>qd(e.expression))?{...e,definitions:e.definitions.map(e=>Zi(e,e=>Jd(e,n))),assumptions:e.assumptions.map(e=>({...e,expression:Jd(e.expression,n)}))}:e},Qd=new Map([[`Nat`,0,[],[],[]],[`+`,0,[0,0],[2,2],[1,1]],[`-`,0,[0,0],[2,2],[1,1]],[`*`,0,[0,0],[3,3],[0,0]],[`^`,0,[0,0],[2,2],[1,1]],[`<`,0,[0,0],[2,2],[1,1]],[`>`,0,[0,0],[2,2],[1,1]],[`<=`,0,[0,0],[2,2],[1,1]],[`>=`,0,[0,0],[2,2],[1,1]],[`%`,0,[0,0],[2,2],[1,1]],[`\\div`,0,[0,0],[2,2],[1,1]],[`..`,0,[0,0],[2,2],[1,1]],[`Int`,0,[],[],[]],[`-.`,0,[0],[2],[1]],[`Seq`,0,[0],[2],[1]],[`Len`,0,[0],[2],[1]],[`\\o`,0,[0,0],[2,2],[1,1]],[`Append`,0,[0,0],[2,2],[1,1]],[`Head`,0,[0],[2],[1]],[`Tail`,0,[0],[2],[1]],[`SubSeq`,0,[0,0,0],[2,2,2],[1,1,1]],[`SelectSeq`,0,[0,1],[2,2],[1,1],[],[`1,0,0`]],[`IsFiniteSet`,0,[0],[2],[1]],[`Cardinality`,0,[0],[2],[1]],[`IsABag`,0,[0],[2],[1]],[`BagToSet`,0,[0],[2],[1]],[`SetToBag`,0,[0],[3],[1]],[`BagIn`,0,[0,0],[2,2],[1,1]],[`EmptyBag`,0,[],[],[]],[`\\oplus`,0,[0,0],[2,2],[1,1]],[`\\ominus`,0,[0,0],[2,2],[1,1]],[`BagUnion`,0,[0],[2],[1]],[`\\sqsubseteq`,0,[0,0],[2,2],[1,1]],[`SubBag`,0,[0],[2],[1]],[`BagOfAll`,0,[1,0],[2,2],[1,1]],[`BagCardinality`,0,[0],[2],[1]],[`CopiesIn`,0,[0,0],[2,2],[1,1]],[`Print`,0,[0,0],[3,3],[0,1]],[`PrintT`,0,[0],[3],[0]],[`Assert`,0,[0,0],[2,3],[1,0]],[`JavaTime`,0,[],[],[]],[`TLCGet`,0,[0],[3],[0]],[`TLCSet`,0,[0,0],[3,3],[0,0]],[`:>`,0,[0,0],[2,3],[1,1]],[`@@`,0,[0,0],[2,2],[1,1]],[`Permutations`,0,[0],[2],[1]],[`SortSeq`,0,[0,2],[2,2],[1,1],[],[`1,0,0`,`1,0,1`]],[`RandomElement`,0,[0],[3],[1]],[`Any`,0,[],[],[]],[`ToString`,0,[0],[2],[1]],[`TLCEval`,0,[0],[3],[1]],[`AssertEq`,0,[0,0],[2,2],[1,1]],[`AssertError`,0,[0,0],[2,3],[1,0]],[`TLCGetOrDefault`,0,[0,0],[3,3],[0,0]],[`TLCGetAndSet`,0,[0,2,0,0],[3,3,3,3],[0,0,0,0],[],[`1,2,1`]],[`Trace`,0,[],[],[]],[`CounterExample`,0,[],[],[]],[`ToTrace`,0,[0],[3],[0]],[`TLCModelValue`,0,[0],[2],[1]],[`TLCDefer`,0,[0],[3],[0]],[`TLCNoOp`,0,[0],[3],[1]],[`PickSuccessor`,0,[0],[3],[1]],[`TLCCache`,0,[0,0],[3,3],[1,0]],[`TLCFP`,0,[0],[3],[0]],[`TLCEvalDefinition`,0,[0],[3],[0]],[`ToJson`,0,[0],[2],[1]],[`ToJsonArray`,0,[0],[2],[1]],[`ToJsonObject`,0,[0],[2],[1]],[`JsonSerialize`,0,[0,0],[3,3],[0,0]],[`JsonDeserialize`,0,[0],[3],[0]],[`ndJsonSerialize`,0,[0,0],[3,3],[0,0]],[`ndJsonDeserialize`,0,[0],[3],[0]],[`RandomSubset`,0,[0,0],[2,2],[1,1]],[`RandomSetOfSubsets`,0,[0,0,0],[2,3,2],[1,0,1]],[`TestRandomSetOfSubsets`,0,[0,0,0],[2,3,2],[1,0,1]]].map(e=>[e[0],{name:e[0],level:e[1],params:/* @__PURE__ */ new Set,constraints:/* @__PURE__ */ new Map,argConstraints:/* @__PURE__ */ new Map,argParams:/* @__PURE__ */ new Set,formals:e[2].map((e,t)=>({name:`$${t}`,arity:e})),maxLevels:e[3],weights:e[4],minMaxLevels:e[5]??[],conditions:new Set(e[6]),nonLeibniz:/* @__PURE__ */ new Set}])),$d=(e,t)=>`${e}${t}`,ef=(e,t,n)=>`${e}${t}${n}`,tf=e=>{let t=e.split(`\0`);return{operator:t[0],index:Number(t[1]),param:t[2]}},nf=(e,t,n)=>`${e},${t},${n}`,rf=(e=0)=>({level:e,params:/* @__PURE__ */ new Set,constraints:/* @__PURE__ */ new Map,argConstraints:/* @__PURE__ */ new Map,argParams:/* @__PURE__ */ new Set}),af=(e,t,n)=>e.set(t,Math.min(n,e.get(t)??3)),of=(e,t,n)=>e.set(t,Math.max(n,e.get(t)??0)),sf=(e,t,n,r)=>({...rf(t),name:e,formals:[],maxLevels:n,weights:r,minMaxLevels:[],conditions:/* @__PURE__ */ new Set,nonLeibniz:/* @__PURE__ */ new Set}),cf=(e,t)=>e.formals.length===0&&e.maxLevels.length>0?e.maxLevels[Math.min(t,e.maxLevels.length-1)]:e.maxLevels[t]??3,lf=(e,t)=>e.formals.length===0&&e.weights.length>0?e.weights[Math.min(t,e.weights.length-1)]:e.weights[t]??1,uf=new Map([[`=`,0,[2,2],[1,1]],[`#`,0,[2,2],[1,1]],[`\\in`,0,[2,2],[1,1]],[`\\notin`,0,[2,2],[1,1]],[`\\subseteq`,0,[2,2],[1,1]],[`\\cup`,0,[2,2],[1,1]],[`\\cap`,0,[2,2],[1,1]],[`\\`,0,[2,2],[1,1]],[`=>`,0,[3,3],[1,1]],[`<=>`,0,[3,3],[1,1]],[`/\\`,0,[3,3],[1,1]],[`\\/`,0,[3,3],[1,1]],[`~`,0,[3],[1]],[`SUBSET`,0,[2],[1]],[`UNION`,0,[2],[1]],[`DOMAIN`,0,[2],[1]],[`~>`,3,[3,3],[0,0]],[`-+->`,3,[3,3],[0,0]],[`\\cdot`,2,[2,2],[0,0]],[`TRUE`,0,[],[]],[`FALSE`,0,[],[]],[`BOOLEAN`,0,[],[]],[`STRING`,0,[],[]]].map(([e,t,n,r])=>[e,{...sf(e,t,[...n],[...r]),nonLeibniz:new Set(t>1?[0,1]:[])}])),df=sf(`$Set`,0,[2],[1]),ff=sf(`$Junction`,0,[3],[1]),pf=sf(`$Choose`,0,[2],[1]),mf=sf(`$Function`,0,[3],[1]),hf=sf(`$FcnApply`,0,[2,2],[1,1]),gf=sf(`$RcdSelect`,0,[2,0],[1,1]),_f=sf(`'`,2,[1],[0]),vf=sf(`ENABLED`,1,[2],[0]),yf=sf(`[]`,3,[3],[0]),bf=sf(`$SquareAct`,2,[2,1],[0,0]),xf=sf(`$WF`,3,[1,2],[0,0]),Sf=sf(`$TemporalExists`,3,[3],[0]),Cf=(e,t)=>t.length===0?e:new Map([...e,...t.map(e=>[e.name,{kind:`Formal`,arity:e.arity}])]),wf=e=>e.map(e=>({name:e,arity:0})),Tf=(e,t)=>t.location.range?g(`${e}.`,t.location.range):new p(`${e} at line ${t.location.line}, column ${t.location.column}`),Ef=/* @__PURE__ */ new Set([`/\\`,`\\/`,`=>`,`<=>`]),Df=e=>e.kind!==`Let`&&e.kind!==`Label`,Of=e=>{let t=/* @__PURE__ */ new Map,n=(t,n)=>{let r=n.get(t);if(r?.kind===`Formal`)return{kind:`Declared`,name:t,level:0,arity:r.arity};if(r?.kind===`Let`)return{kind:`Defined`,levels:v(r.definition,r.scope)};if(e.constants.has(t))return{kind:`Declared`,name:t,level:0,arity:0};if(e.variables.has(t))return{kind:`Declared`,name:t,level:1,arity:0};let i=e.getDefinition(t);if(i)return{kind:`Defined`,levels:v(i,/* @__PURE__ */ new Map)};let a=uf.get(t)??Qd.get(t);return a?{kind:`Defined`,levels:a}:{kind:`Declared`,name:t,level:0,arity:0}},r=(e,t,n)=>{let r=rf(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(ef(e,n,t))}),t.data.constraints.forEach((e,t)=>af(r.constraints,t,e)),of(r.argConstraints,$d(e,n),t.data.level),t.data.argConstraints.forEach((e,t)=>of(r.argConstraints,t,e)),t.data.argParams.forEach(e=>r.argParams.add(e))}),r},i=(e,t,n=[],r=[])=>{let i=e=>r.includes(e);if(t.forEach((t,n)=>{if(!(t.operator||t.declared)&&t.data.level>cf(e,n))throw new p(`Level error in applying operator ${e.name}:\nThe level of argument ${n+1} exceeds the maximum level allowed by the operator`)}),n.some(e=>e.level>2))throw new p(`Level error in applying operator ${e.name}:\nThe level of the range for a bounded variable exceeds the maximum level allowed by the operator`);let a=n=>{let r=e.formals.findIndex(e=>e.name===n);return r===-1?void 0:t[r]},o=(t,n,r)=>e.conditions.has(nf(t,n,r)),s=rf(Math.max(e.level,...t.filter((t,n)=>lf(e,n)===1).map(e=>e.data.level),...n.map(e=>e.level)));return e.params.forEach(e=>s.params.add(e)),t.forEach((t,n)=>{lf(e,n)===1&&t.data.params.forEach(e=>s.params.add(e))}),n.forEach(e=>e.params.forEach(e=>s.params.add(e))),r.forEach(e=>s.params.delete(e)),e.constraints.forEach((e,t)=>af(s.constraints,t,e)),t.forEach(e=>e.data.constraints.forEach((e,t)=>{i(t)||af(s.constraints,t,e)})),n.forEach(e=>e.constraints.forEach((e,t)=>af(s.constraints,t,e))),t.forEach((t,n)=>t.data.params.forEach(t=>{i(t)||af(s.constraints,t,cf(e,n))})),t.forEach((e,n)=>{let r=e.operator;r&&t.forEach((e,t)=>r.formals.forEach((i,a)=>{o(n,t,a)&&e.data.params.forEach(e=>af(s.constraints,e,cf(r,a)))}))}),e.argParams.forEach(e=>{let t=tf(e),n=a(t.operator)?.operator;n&&af(s.constraints,t.param,cf(n,t.index))}),[e.argConstraints,...t.map(e=>e.data.argConstraints),...n.map(e=>e.argConstraints)].forEach(e=>e.forEach((e,t)=>of(s.argConstraints,t,e))),t.forEach((n,r)=>{let i=n.declared;i&&(Array.from({length:i.arity},(t,n)=>of(s.argConstraints,$d(i.name,n),e.minMaxLevels[r]?.[n]??0)),t.forEach((e,t)=>Array.from({length:i.arity},(n,a)=>{o(r,t,a)&&of(s.argConstraints,$d(i.name,a),e.data.level)})))}),e.argParams.forEach(e=>{let t=tf(e),n=a(t.operator);n&&of(s.argConstraints,$d(t.operator,t.index),n.data.level)}),t.forEach(e=>e.data.argParams.forEach(e=>{i(tf(e).param)||s.argParams.add(e)})),n.forEach(e=>e.argParams.forEach(e=>s.argParams.add(e))),e.argParams.forEach(e=>{let t=tf(e),n=a(t.operator);if(n)n.declared&&s.argParams.add(ef(n.declared.name,t.index,t.param));else{let n=a(t.param);if(!n){s.argParams.add(e);return}n.data.params.forEach(e=>s.argParams.add(ef(t.operator,t.index,e)))}}),t.forEach((e,n)=>{let r=e.declared;r&&t.forEach((e,t)=>Array.from({length:r.arity},(i,a)=>{o(n,t,a)&&e.data.params.forEach(e=>s.argParams.add(ef(r.name,a,e)))}))}),s},a=(e,t)=>{if(e.kind===`Lambda`){let n=_(`LAMBDA`,wf(e.params),e.body,t);return{data:n,operator:n}}let r=e.kind===`OperatorReference`?e.operator:e.kind===`Identifier`?e.name:void 0;if(r!==void 0){let i=n(r,t);if(i.kind===`Defined`&&(i.levels.formals.length>0||e.kind===`OperatorReference`))return{data:i.levels,operator:i.levels};if(i.kind===`Declared`&&i.arity>0){let e=rf();return e.params.add(r),{data:e,declared:{name:r,arity:i.arity}}}}return{data:m(e,t)}},o=(e,t)=>e.map(e=>a(e,t)),s=(e,t,n,r=[],a=[])=>{let s=Cf(n,wf(a));return i(e,o(t,s),r.map(e=>m(e,n)),a)},c=(e,t)=>e.kind===`Declared`?r(e.name,e.level,t):i(e.levels,t),l=(e,t)=>{let n=e.map(e=>e.data.level);if(n.includes(2)&&n.includes(3))throw Tf(`Formula has both temporal formula and action as arguments`,t)},u=(e,t)=>{if((e.operator===`~>`||e.operator===`-+->`)&&t.some(e=>e.data.level===2))throw Tf(`Action used where only temporal formula or state predicate allowed`,e);Ef.has(e.operator)&&l(t,e)},d=(e,t)=>{let n=e.expression,r=e.kind===`Always`?`BoxAction`:`AngleAction`;if(t===2&&Df(n)&&n.kind!==r)throw Tf(e.kind===`Always`?`[] followed by action not of form [A]_v`:`<> followed by action not of form <<A>>_v`,e)},f=(e,t)=>{let n=new Map(t);e.definitions.forEach(e=>n.set(e.name,{kind:`Let`,definition:e,scope:n}));let r=m(e.body,n),i={level:r.level,params:new Set(r.params),constraints:new Map(r.constraints),argConstraints:new Map(r.argConstraints),argParams:new Set(r.argParams)};return e.definitions.forEach(e=>{let t=v(e,n);t.constraints.forEach((e,t)=>af(i.constraints,t,e)),t.argConstraints.forEach((e,t)=>of(i.argConstraints,t,e)),t.argParams.forEach(e=>i.argParams.add(e))}),i},m=(e,t)=>{try{return h(e,t)}catch(t){throw!(t instanceof p)||t.sany?t:Tf(t.message,e)}},h=(e,t)=>{switch(e.kind){case`Number`:case`Decimal`:case`String`:case`ExceptAt`:return rf();case`Identifier`:return c(n(e.name,t),[]);case`Apply`:{let r=o(e.args,t);return u(e,r),c(n(e.operator,t),r)}case`OperatorReference`:case`Lambda`:return a(e,t).data;case`And`:case`Or`:{let n=o(e.operands,t);return l(n,e),i(ff,n)}case`Prime`:case`Unchanged`:return s(_f,[e.expression],t);case`Enabled`:return s(vf,[e.expression],t);case`Always`:case`Eventually`:{let n=a(e.expression,t);return d(e,n.data.level),i(yf,[n])}case`If`:return s(ff,[e.condition,e.consequent,e.alternative],t);case`Case`:return s(ff,[...e.arms.flatMap(e=>[e.condition,e.body]),...e.other?[e.other]:[]],t);case`Let`:return f(e,t);case`Forall`:case`Exists`:{let n=s(ff,[e.body],t,e.bounds.map(e=>e.set),ui(e.bounds)),r=n.level===3?e.bounds.find(e=>m(e.set,t).level===2):void 0;if(r)throw Tf(`Action-level bound of quantified temporal formula`,r.set);return n}case`UnboundedQuantifier`:return s(e.isTemporal?Sf:ff,[e.body],t,[],e.names);case`Choose`:return s(pf,[e.body],t,e.set?[e.set]:[],li(e.pattern));case`SetEnumeration`:case`Tuple`:case`FunctionSet`:case`Product`:return s(df,e.kind===`FunctionSet`?[e.domain,e.range]:e.kind===`Product`?e.factors:e.elements,t);case`SetFilter`:return s(df,[e.predicate],t,[e.bound.set],li(e.bound.pattern));case`SetMap`:return s(df,[e.expression],t,e.bounds.map(e=>e.set),ui(e.bounds));case`FunctionConstruction`:return s(mf,[e.body],t,e.bounds.map(e=>e.set),ui(e.bounds));case`Record`:return s(mf,e.fields.map(e=>e.value),t);case`RecordSet`:return s(df,e.fields.map(e=>e.value),t);case`Except`:return s(df,[e.function,...e.updates.flatMap(e=>[...e.path.flatMap(e=>e.kind===`Index`?e.args:[]),e.value])],t);case`FunctionApplication`:return i(hf,[a(e.function,t),e.args.length===1?a(e.args[0],t):{data:s(df,e.args,t)}]);case`FieldAccess`:return i(gf,[a(e.record,t),{data:rf()}]);case`BoxAction`:case`AngleAction`:return s(bf,[e.action,e.subscript],t);case`WeakFairness`:case`StrongFairness`:return s(xf,[e.subscript,e.action],t);case`Label`:return m(e.body,t);case`Subexpression`:return rf()}},g=(e,t,r=!1,i=/* @__PURE__ */ new Set)=>{let a=(e,n=r,a=t)=>g(e,a,n,i),o=(e,o)=>{let s=n(e,t);s.kind===`Declared`?(r&&i.add(e),o.forEach(e=>a(e))):o.forEach((e,t)=>a(e,r||s.levels.nonLeibniz.has(t)))};switch(e.kind){case`Identifier`:return o(e.name,[]),i;case`Apply`:return o(e.operator,e.args),i;case`Lambda`:case`Let`:return i;case`Prime`:case`Unchanged`:case`Enabled`:case`Always`:case`Eventually`:case`BoxAction`:case`AngleAction`:case`WeakFairness`:case`StrongFairness`:return lr(e).forEach(e=>a(e,!0)),i;case`UnboundedQuantifier`:return a(e.body,r||e.isTemporal===!0,Cf(t,wf(e.names))),i;default:return Qi(e,(e,n)=>(a(e,r,Cf(t,wf(n))),e)),i}},_=(e,t,n,r)=>{let i=Cf(r,t),a=m(n,i),o=e=>t.some(t=>t.name===e),s=g(n,i),c={...rf(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($d(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(ef(e.name,n,t.name))).map(e=>nf(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(tf(t).operator)||c.argConstraints.set(t,e)}),a.argParams.forEach(e=>{let t=tf(e);o(t.operator)&&o(t.param)||c.argParams.add(e)}),c},v=(e,n)=>{let r=t.get(e);if(r)return r;let i=e.kind===`Operator`?e.params:[];t.set(e,{...rf(),name:e.name,formals:i,maxLevels:i.map(()=>3),weights:i.map(()=>0),minMaxLevels:i.map(()=>[]),conditions:/* @__PURE__ */ new Set,nonLeibniz:/* @__PURE__ */ new Set});let a=e.kind===`Function`?{kind:`FunctionConstruction`,bounds:e.bounds,body:e.body,location:e.location}:e.body,o=_(e.name,i,a,n);return t.set(e,o),o};return{analyze:m,analyzeDefinition:v,toOperand:a}},kf=(e,t,n)=>{let r=new Map(t);e.assumptions.forEach(e=>{e.kind===`NewSymbol`?(e.set&&n.analyze(e.set,r),r.set(e.name,{kind:`Formal`,arity:e.arity})):e.kind===`AssumeProve`?kf(e,r,n):n.analyze(e,r)}),n.analyze(e.conclusion,r)},Af=(e,t)=>{let n=Of(t);Hi([...e.definitions.filter(e=>!e.name.includes(`!`)).map(e=>({location:e.location,check:()=>n.analyzeDefinition(e,/* @__PURE__ */ new Map)})),...e.assumptions.map(e=>({location:e.location,check:()=>n.analyze(e.expression,/* @__PURE__ */ new Map)})),...e.theorems.map(e=>({location:e.location,check:()=>e.statement.kind===`AssumeProve`?kf(e.statement,/* @__PURE__ */ new Map,n):n.analyze(e.statement,/* @__PURE__ */ new Map)}))])},jf=(e,t)=>e.maxLevels[t]??3,Mf=(e,t)=>{let n=/* @__PURE__ */ new Map,r=e=>{let r=n.get(e);if(r)return r;let i=t(e),a=Of({constants:new Set(i.constants.map(e=>e.name)),variables:new Set(i.variables),getDefinition:i.getDefinition});return n.set(e,a),a},i=/* @__PURE__ */ new Map,a=e=>{let n=i.get(e);if(n)return n;let a=t(e),o=r(e),s=a.definitions.map(e=>o.analyzeDefinition(e,/* @__PURE__ */ new Map)),c={isConstant:a.variables.length===0&&s.every(e=>e.level===0),constraints:/* @__PURE__ */ new Map,argConstraints:/* @__PURE__ */ new Map,argParams:/* @__PURE__ */ new Set};c.isConstant||a.constants.forEach(e=>af(c.constraints,e.name,0));let l=(e,t)=>{e.constraints.forEach((e,t)=>af(c.constraints,t,e)),e.argConstraints.forEach((e,t)=>of(c.argConstraints,t,e)),e.argParams.forEach(e=>{let n=tf(e);t(n.operator,n.param)&&c.argParams.add(e)})};return s.forEach(e=>l(e,(t,n)=>e.formals.every(e=>e.name!==t&&e.name!==n))),a.assumptions.forEach(e=>l(o.analyze(e,/* @__PURE__ */ new Map),()=>!0)),i.set(e,c),c},o=/* @__PURE__ */ new Set;if(e.forEach(e=>{let n=`at line ${e.location.line}, column ${e.location.column}`,i=e=>o.add(`${e} ${n}`),s=t(e.module),c=a(e.module),l=r(e.instancer),u=/* @__PURE__ */ new Map;e.lets.forEach(e=>u.set(e.name,{kind:`Let`,definition:e,scope:u}));let d=[...s.constants.map(e=>({...e,maximumLevel:0})),...s.variables.map(e=>({name:e,arity:0,maximumLevel:1}))].flatMap(t=>{let n=e.substitutions.get(t.name);if(!n)return[];if(t.arity===0){let e=l.analyze(n,u);return[{...t,level:e.level,operator:void 0,isLeibniz:!0}]}let r=l.toOperand(n,u);return[{...t,level:r.data.level,operator:r.operator,isLeibniz:r.operator===void 0||r.operator.nonLeibniz.size===0}]}),f=(t,n)=>`Level error in instantiating module '${e.module}': the level of the expression or operator substituted for '${t}' must be at most ${n}`;d.forEach(t=>{!c.isConstant&&t.level>t.maximumLevel&&i(f(t.name,t.maximumLevel)),t.isLeibniz||i(`Error in instantiating module '${e.module}': a non-Leibniz operator substituted for '${t.name}'`)}),d.forEach(t=>{let n=c.constraints.get(t.name);n!==void 0&&t.level>n&&i(f(t.name,n));let r=t.operator;r&&Array.from({length:t.arity},(n,a)=>{let o=c.argConstraints.get($d(t.name,a));o!==void 0&&jf(r,a)<o&&i(`Level error in instantiating module '${e.module}': the level of the argument ${a+1} of the operator ${r.name} must be at least ${o}`)})}),c.argParams.forEach(t=>{let n=tf(t),r=d.find(e=>e.name===n.operator)?.operator,a=d.find(e=>e.name===n.param);if(!r||!a)return;let o=jf(r,n.index);a.level>o&&i(`Level error when instantiating module '${e.module}': the level of the argument ${n.index} of the operator ${n.operator}' must be at most ${o}`)})}),o.size>0)throw new p([...o].join(`
|
|
419
|
-
`))},Nf=[`LAMBDA`,`$$InAssume`,`nullODN`,`nullOpArg`,`nullLabelNode`],Pf=/* @__PURE__ */ new Set([`THEOREM`,`LEMMA`,`COROLLARY`,`PROPOSITION`]),Ff=new Map(od.flatMap(e=>e.map(t=>[t,e[0]]))),If=e=>Ff.get(e)??e,Lf=e=>{let t=0;for(let n=0;n<e.length;n++)t=Math.imul(t,31)+e.charCodeAt(n)|0;return t},Rf=()=>{let e={buckets:Array.from({length:11},()=>[]),threshold:8},t=/* @__PURE__ */ new Set,n=[],r=(e,t)=>(Lf(e.name)&2147483647)%t,i=()=>{let t=e.buckets.length*2+1,n=Array.from({length:t},()=>[]);for(let i=e.buckets.length-1;i>=0;i--)for(let a of e.buckets[i])n[r(a,t)].unshift(a);e.buckets=n,e.threshold=Math.floor(t*.75)};return{put:a=>{t.has(a.key)||(n.length>=e.threshold&&i(),e.buckets[r(a,e.buckets.length)].unshift(a),t.add(a.key),n.push(a))},inserted:n,enumerate:()=>e.buckets.toReversed().flat()}},zf=(e,t,n)=>({key:t===`module`?`module ${e}`:e,name:e,kind:t,isLocal:n}),Bf=(e,t)=>{let n=e[t],r=e[t+1];if(n.text===`_`&&r.kind===`Operator`)return e[t+2]?.text===`_`?{name:If(r.text),end:t+3}:{name:r.text,end:t+2};if(n.kind===`Operator`)return{name:n.text===`-`?`-.`:If(n.text),end:t+2};if(r?.text!==`(`)return{name:n.text,end:t+1};let i=e.findIndex((e,n)=>n>t&&e.text===`)`);return{name:n.text,end:i+1}},Vf=(e,t)=>{let n=[];for(let r=t;;){let t=Bf(e,r);if(n.push(t.name),e[t.end]?.text!==`,`)return n;r=t.end+1}},Hf=e=>({line:e.line,column:e.column}),Uf=(e,t,n)=>{let r=/* @__PURE__ */ new Set,i=(a,o)=>{let s={key:o,unit:t,extends:[],instances:[],inner:[],allExtends:r};for(let t=a+1;t<e.length;t++){let a=e[t];if(a.kind===`ModuleEnd`)return{references:s,end:t};if(a.kind===`Separator`&&e[t+1]?.text===`MODULE`){let r=e[t+2].text,a=i(t,`${o}/${r}`);n.set(r,a.references),s.inner.push(a.references),t=a.end}else if(a.text===`EXTENDS`){let n=Vf(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},Wf=(e,t)=>t!==void 0&&t.line===e.line&&t.column===e.column+e.text.length,Gf={"\\":`\\\\`,'"':`\\"`,"\n":`\\n`," ":`\\t`,"\r":`\\r`,"\f":`\\f`},Kf=e=>{let t=[];for(let n=0;n<e.length;n++){let r=e[n];r.text===`<`&&Wf(r,e[n+1])&&/^(\d+|\*|\+)$/.test(e[n+1].text)&&e[n+2]?.text===`>`&&Wf(e[n+1],e[n+2])?n+=Wf(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=>Gf[e])}"`:r.text)}return t},qf=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},Jf=(e,t)=>e.find(e=>e.name===t)??e.map(e=>Jf(e.modules,t)).find(Boolean),Yf=(e,t)=>{let n=/* @__PURE__ */ new Map,r=/* @__PURE__ */ new Map,i=i=>{let a=n.get(i??``);if(a)return a;let o=i===void 0?e:ud.get(i)??t?.(i)??nl(e,i),s=o===void 0?[]:de(o),c=qf(s),l=c.get(s[2]?.text??``)??{start:0,end:0},u={module:void 0},d={tokens:s,...l,getModule:()=>u.module??=il(o??``)};return n.set(i??``,d),c.forEach((e,t)=>{e.start===l.start||r.has(t)||r.set(t,{tokens:s,...e,getModule:()=>Jf(d.getModule().modules,t)??d.getModule()})}),d};return i(void 0),e=>(e===void 0?void 0:r.get(e))??i(e)},Xf=(e,t,n)=>{let r=Yf(e,t),i=e=>{let t=e.tokens,n=e.getModule(),r=[],i=[],a=(e,n)=>{let i=Vf(t,e+1);r.push({location:Hf(t[e]),apply:e=>i.forEach(t=>e.put(zf(t,n,!1)))})},s=new Set(n.definitions.filter(e=>e.isRecursive).map(e=>e.name)),c={value:0};t.slice(e.start,e.end).forEach((n,o)=>{let l=e.start+o,u=t[l];if(u.kind===`Separator`&&t[l+1]?.text===`MODULE`){if(c.value++,c.value===2){let e=t[l+2].text;r.push({location:Hf(u),apply:t=>t.put(zf(e,`module`,!1))})}}else u.kind===`ModuleEnd`&&c.value--,c.value===1&&u.kind===`Keyword`&&((u.text===`CONSTANT`||u.text===`CONSTANTS`)&&a(l,`constant`),(u.text===`VARIABLE`||u.text===`VARIABLES`)&&a(l,`variable`),u.text===`RECURSIVE`&&Vf(t,l+1).every(e=>s.has(e))&&a(l,`definition`),Pf.has(u.text)&&t[l+1]?.kind===`Identifier`&&t[l+2]?.text===`==`&&(i.push(Hf(u)),r.push({location:Hf(u),apply:e=>e.put(zf(t[l+1].text,`theorem`,!1))})))}),n.assumptions.forEach(e=>{i.push(e.location);let t=e.name;t!==void 0&&r.push({location:e.location,apply:e=>e.put(zf(t,`theorem`,!1))})});let l=e=>i.some(t=>t.line===e.line&&t.column===e.column);return n.definitions.forEach(e=>{if(l(e.location))return;let t=If(e.name);r.push({location:e.location,apply:n=>n.put(zf(t,`definition`,e.isLocal))})}),n.instances.forEach(e=>{r.push({location:e.location,apply:t=>{let n=o(e.module).enumerate(),r=e.name===void 0?``:`${e.name}!`,i=n.filter(e=>e.kind===`definition`),a=n.filter(e=>e.kind===`theorem`);[...i,...a].forEach(n=>{n.isLocal||t.put(zf(`${r}${n.name}`,n.kind,e.isLocal))}),e.name!==void 0&&t.put(zf(e.name,`definition`,e.isLocal))}})}),r.sort((e,t)=>ri(e.location,t.location)?-1:+!!ri(t.location,e.location))},a=/* @__PURE__ */ new Map,o=e=>{let t=a.get(e??``);if(t)return t;let n=Rf();a.set(e??``,n),ad.toReversed().forEach(e=>n.put(zf(e,`builtin`,!1)));let s=r(e);return s.getModule().extends.forEach(e=>o(e).inserted.forEach(e=>{e.isLocal||n.put(e)})),i(s).forEach(e=>e.apply(n)),n};return o(void 0).enumerate().filter(e=>e.kind===n).map(e=>e.name).reverse()},Zf=(e,t,n)=>{let r=Yf(e,n),i=/* @__PURE__ */ new Set,a=e=>{i.add(e)},o=e=>{e.kind===`ModelValue`&&a(e.name),e.kind===`String`&&a(e.value),e.kind===`Set`&&e.elements.forEach(o)};t.constants.forEach(e=>{e.args?.forEach(o),o(e.value)}),sd.forEach(a);let s=e=>{let t=r(e);return t.tokens.slice(t.start,t.end)},c=/* @__PURE__ */ new Map,l=/* @__PURE__ */ new Map,u=e=>{let t=l.get(e);if(t)return t;let n=Uf(s(e),e,c);return l.set(e,n),n},d=e=>c.get(e)??u(e),f=/* @__PURE__ */ new Set,p=(e,t)=>c.has(t)||f.has(`${e.key}>${t}`),m=(e,t,n)=>{let r=[...e.extends.map(d),...e.instances.filter(t=>p(e,t)).map(d),...e.inner];for(let e of r){let r=n(e,t);if(r)return r}},h=e=>{let t=(n,r)=>{if(r.has(n.key))return;r.add(n.key);let i=e(n).find(e=>!p(n,e));return i===void 0?m(n,r,t):[n,i]};return t},g=h(e=>e.extends),_=h(e=>e.instances),v=/* @__PURE__ */ new Set([void 0]),y=/* @__PURE__ */ new Map;Kf(s(void 0)).forEach((e,t)=>{t===3&&ld.forEach(a),a(e)});let b=u(void 0);for(;;){let e=g(b,/* @__PURE__ */ new Set)??_(b,/* @__PURE__ */ new Set);if(!e)break;let[t,n]=e;f.add(`${t.key}>${n}`),y.set(t.unit,[...y.get(t.unit)??[],n]),!v.has(n)&&(v.add(n),Kf(s(n)).forEach(a))}Nf.forEach(a);let x=/* @__PURE__ */ new Set,ee=e=>{if(x.has(e))return;x.add(e);let t=y.get(e)??[],n=u(e).allExtends;[...t.filter(e=>n.has(e)),...t.filter(e=>!n.has(e))].forEach(ee),s(e).forEach(e=>{e.kind===`String`&&a(e.text)})};return ee(void 0),cd.forEach(a),[...i]},Qf=t=>{switch(t.kind){case`Number`:try{return Me(t.value)}catch(t){throw n(t,e.error)}case`String`:case`Boolean`:return t.value;case`ModelValue`:return $e(t.name);case`Set`:return jt(t.elements.map(Qf))}},$f=e=>[...e.constants,...e.variables.map(e=>({name:e,arity:0}))],ep=e=>new p(`Multiply-defined module '${e.name}' at line ${e.location.line}, column ${e.location.column}`),tp=(e,t)=>({kind:`Operator`,name:t,params:[],body:{kind:`Let`,definitions:[e],body:{kind:`Identifier`,name:e.name,location:e.location,resolution:$r},location:e.location},isLocal:!0,isRecursive:!1,location:e.location}),np=(e,t,n)=>{let r=`{ ${n.map(e=>`<${[...e[0],e[1]].map(e=>G(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 v(`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`)&&nt(t,r)})});if(t)return t[1];throw new v(`Attempted to apply operator:\n${r}\nto arguments (${e.map(e=>typeof e==`object`&&e.kind===`Operator`?e.name:G(e)).join(`, `)}), which is undefined.`)},evaluateUnary:void 0,evaluateBinary:void 0}},rp=(e,t)=>e.kind===`Identifier`&&t.has(e.name)||e.kind===`Apply`&&t.has(e.operator)||lr(e).some(e=>rp(e,t)),ip=(e,t)=>{let n=new Map(e.map((e,t)=>[e,t]));return new Set(t).forEach(e=>n.set(sa(e),n.get(e)??n.size)),n},ap=e=>e.flatMap(e=>e.substitutions.map(e=>e.expression)),op=e=>e.forEach(e=>{if(e.kind===`Decimal`)throw ko(e);if(e.kind===`Number`&&!vs(e.value))throw Ao(e);op(e.kind===`Let`?[...lr(e),...ap(e.instances??[])]:lr(e))}),sp=(e,t)=>{let n=il(t.source),r=/* @__PURE__ */ new Map,i=/* @__PURE__ */ new Map,a=/* @__PURE__ */ new Map,o=new Map(yd.map(e=>[e.name,e])),s=/* @__PURE__ */ new Map,c=zl(e.checkDeadlock,t.seed),l=/* @__PURE__ */ new Map,u=/* @__PURE__ */ new Map,d=[],f=/* @__PURE__ */ new Map,h=[],g=[],b=(e,t)=>h.forEach(n=>{n.add(e),[...t].forEach(e=>n.add(e))}),x={value:0},ee=e=>`${e}#${x.value++}`,te=[],ne=/* @__PURE__ */ new Map,re=e=>{let n=s.get(e);if(n)return n;let r=Nd(e,t.print,c,t.files);if(!r)return;let i=/* @__PURE__ */ new Map;return r.extends.forEach(e=>re(e)?.forEach((e,t)=>i.set(t,e))),r.operators.forEach(e=>{o.set(e.name,e),i.set(e.name,{key:e.name,arity:e.arity})}),s.set(e,i),i},ie=e=>{let t=re(e);return t&&b(e,Md.get(e)??[]),t},S=e=>(op([...e.definitions.flatMap(e=>e.kind===`Function`?[...e.bounds.map(e=>e.set),e.body]:[e.body]),...e.assumptions.map(e=>e.expression),...e.theorems.flatMap(e=>e.statement.kind===`AssumeProve`?[]:[e.statement]),...ap(e.instances)]),e.modules.forEach(S),e);S(n);let ae=(e,n)=>{let r=t.loadModule?.(e)??Tc.get(e)??nl(t.source,e);if(r===void 0)throw m([{location:`In module ${n}`,message:`Cannot find source file for module ${e} imported in module ${n}.`}],!0);let i=il(r);if(i.name!==e)throw m([{location:`Unknown location`,message:`File name '${e}' does not match the name '${i.name}' of the top level module it contains.`}],!0);return S(i)},C=e=>{let t=g.indexOf(e.name);if(t!==-1)throw new p(`Circular dependency among .tla files; dependency cycle is: ${[...g.slice(t),e.name].map(e=>`${e}.tla`).join(` --> `)}`);let n=/* @__PURE__ */ new Set,r=[];g.push(e.name),h.push(n);let i=k(e,{id:e.name,symbols:/* @__PURE__ */ new Map,modules:/* @__PURE__ */ new Map,nested:r});h.pop(),g.pop();let a=r.find(e=>n.has(e.name));if(a)throw ep(a);return{linked:i,closure:n}},oe=(e,t)=>{let n=l.get(e);if(n)return b(e,f.get(e)??[]),n;let r=C(ae(e,t));return l.set(e,r.linked),f.set(e,r.closure),b(e,r.closure),r.linked},w=(e,t,n,o,s)=>{let c=s?void 0:ie(e.module);if(c)return e.name===void 0?c:new Map([...c].map(([t,n])=>[`${e.name}!${t}`,n]));let l=s??oe(e.module,t.name),u=$f(l),d=`#${x.value++}`,f=new Map(e.params.map(e=>[e.name,`${e.name}${d}`])),p=Vi(Xd(e,t),u,t,n);te.push({module:e.module,instancer:t.name,lets:[],substitutions:p,location:e.location});let m=ya({params:e.params.map(e=>({...e,name:`${e.name}${d}`})),substitutions:new Map([...p].map(([e,t])=>[e,Ki(t,f)])),variables:new Set(l.variables),getDefinition:e=>r.get(e),isParameterized:e=>i.get(e)===!0,addDefinition:(n,s,c)=>{let l=ee(`${s}@${t.name}`);return r.set(l,c(l)),i.set(l,!o),a.set(l,{source:n,prefix:e.params.length}),l},createName:ee}),h=new Set(u.map(e=>e.name)),g=/* @__PURE__ */ new Map;return l.exported.forEach((t,n)=>{if(h.has(n))return;if(e.name===void 0){let r=m.getKey(t.key);u.length>0&&ne.set(r,{name:n,location:e.location}),g.set(n,{key:r,arity:t.arity});return}let r=m.getQualifiedKey(t.key);u.length>0&&ne.set(r,{name:`${e.name}!${n}`,location:e.location}),g.set(`${e.name}!${n}`,{key:r,arity:t.arity+e.params.length})}),g},T=(e,t)=>e.map(e=>({kind:`Identifier`,name:e.name,location:t,resolution:$r})),E=(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:T(r,i),location:i},isLocal:!0,isRecursive:!1,location:i}),se=e=>Array.from({length:e},(e,t)=>({name:`argument${t}`,arity:0})),D=(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=se(t.arity);return{params:r,body:{kind:`Apply`,operator:e.kind===`Identifier`?e.name:e.kind===`OperatorReference`?e.operator:t.name,args:T(r,n),location:n}}},O=(e,t,n,a)=>{let o=e.location,s=a?void 0:ie(e.module);if(s)return e.name===void 0?[]:[...s].map(([t,n])=>{let r=se(n.arity);return E(`${e.name}!${t}`,n.key,[...e.params,...r],r,o)});let c=a??oe(e.module,n),l=`#${x.value++}`,u=new Map(e.substitutions.map(e=>[e.name,e.expression])),d=$f(c),f=e=>u.get(e.name)??{kind:`Identifier`,name:e.name,location:o};te.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=>rp(f(e),p),h=d.map(t=>{let n=D(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=[],_=ya({params:e.params,substitutions:new Map(d.map(t=>[t.name,m(t)?{kind:`Apply`,operator:`${t.name}${l}`,args:T(e.params,o),location:o,resolution:$r}:{kind:`Identifier`,name:`${t.name}${l}`,location:o,resolution:$r}])),variables:new Set(c.variables),getDefinition:e=>r.get(e),isParameterized:e=>i.get(e)===!0,addDefinition:(t,n,r)=>{let i=`${n}@${e.module}${l}.${g.length}`,a=r(i);return g.push(a.kind===`Operator`?{...a,name:i}:tp(a,i)),i},createName:ee}),v=new Set(d.map(e=>e.name)),y=[...c.exported].filter(([e])=>!v.has(e)).map(([t,n])=>{let r=_.getKey(n.key),i=se(n.arity),a=[...e.params,...i];return E(e.name===void 0?t:`${e.name}!${t}`,r,a,r===n.key?i:a,o)});return[...h,...g,...y]},ce=e=>[...e].flatMap(([e,t])=>{let n=r.get(t.key);return n?[{...n,name:e}]:[]}),k=(e,a)=>{let o=Nc(e,t.loadClass?.(e.name)),s=new Map([...yd.map(e=>[e.name,{key:e.name,arity:e.arity}]),...a.symbols]),c=/* @__PURE__ */ new Map,l=/* @__PURE__ */ new Map,f=[],p=[...o.constants],m=o.variables.map(e=>e.name),h=o.variables.map(e=>e.location),g=(e,t)=>e.forEach((e,n)=>{s.set(n,e),t&&c.set(n,e)});o.extends.forEach(e=>{let t=a.modules.get(e),n=t?void 0:ie(e);if(n){g(n,!0);return}let r=t??oe(e,o.name);p.push(...r.constants.filter(e=>p.every(t=>t.name!==e.name))),r.variables.forEach((e,t)=>{m.includes(e)||(m.push(e),h.push(r.variableLocations[t]))}),g(r.exported,!0),r.modules.forEach((e,t)=>l.set(t,e)),f.push(r)}),o.constants.forEach(e=>c.set(e.name,{key:e.name,arity:e.arity,declaration:`Constant`})),o.variables.forEach(e=>c.set(e.name,{key:e.name,arity:0,declaration:`Variable`}));let _=p.length===0&&m.length===0,v=e=>o===n?e.name:`${e.name}@${a.id}`,y=/* @__PURE__ */ new Map,b=e=>({imported:s,importedAt:y,definitions:new Map(e.definitions.map(e=>[e.name,e])),getKey:v}),x=()=>new Map([...a.modules,...l]),ee=e=>new Map([...s,...[...o.constants.map(e=>({...e,kind:`Constant`})),...o.variables.map(e=>({...e,kind:`Variable`}))].filter(t=>ri(t.location,e)).map(e=>[e.name,{key:e.name,arity:e.arity,declaration:e.kind}]),...o.definitions.filter(t=>ri(t.location,e)).map(e=>[e.name,{key:v(e),arity:ii(e)}])]),te=e=>{let t=x();if(t.has(e.name))throw ep(e);a.nested.push(e);let n=k(e,{id:`${a.id}/${e.name}`,symbols:ee(e.location),modules:t,nested:a.nested});l.set(e.name,n),u.has(e.name)||u.set(e.name,n)};[...o.instances.map(e=>({location:e.location,link:()=>{let t=w(e,o,b(o),_,x().get(e.module));t.forEach((t,n)=>{s.has(n)||y.set(n,e.location)}),g(t,!e.isLocal)}})),...o.modules.map(e=>({location:e.location,link:()=>te(e)}))].sort((e,t)=>ri(e.location,t.location)?-1:1).forEach(e=>e.link()),zi(o,b(o));let ne=e=>{let t=o.instances.find(t=>t.module===e.name);return t!==void 0&&ri(e.location,t.location)},re=e=>{let t=o.modules.find(t=>t.name===e.module);return t?ne(t)?l.get(t.name):void 0:x().get(e.module)},S=Zd(Ca(o,(e,t)=>O(e,t,o.name,re(e))),ce(s));Ui(S,b(S)),S.definitions.forEach(e=>{let t=v(e);r.set(t,e),i.set(t,!_);let n={key:t,arity:ii(e)};s.set(e.name,n),e.isLocal||c.set(e.name,n)}),Af(S,{constants:new Set(p.map(e=>e.name)),variables:new Set(m),getDefinition:e=>r.get(s.get(e)?.key??e)});let ae={module:S,constants:p,variables:m,variableLocations:h,visible:s,exported:c,modules:l,extended:f};return d.push(ae),ae},A=C(n).linked,le=e=>A.visible.get(e)?.key??e;A.visible.forEach((e,t)=>{let n=r.get(e.key);n&&e.key!==t&&r.set(t,n)});let ue=[],de=(e,t)=>{t.has(e)||(t.add(e),e.extended.forEach(e=>de(e,t)),ue.push(...e.module.assumptions))};de(A,/* @__PURE__ */ new Set);let fe=A.constants.map(e=>e.name),pe=A.variables,me=e=>e.module===void 0?[e.name,le(e.name)]:e.module===n.name||fe.includes(e.name)?[]:[(l.get(e.module)??u.get(e.module))?.visible.get(e.name)?.key??e.name],j=e=>{let t=r.get(e);return t?.kind===`Operator`?t.params.length:A.constants.find(t=>t.name===e)?.arity??0},he=/* @__PURE__ */ new Map,ge=/* @__PURE__ */ new Set,_e=(e,t)=>{o.set(e,t),r.delete(e),he.delete(e),ge.add(e)};e.constants.filter(e=>e.args===void 0).forEach(e=>{let t=Qf(e.value);me(e).forEach(e=>{let n=j(e);n===0?he.set(e,t):_e(e,{kind:`Builtin`,name:e,arity:n,evaluate:()=>t,evaluateUnary:void 0,evaluateBinary:void 0,isLazy:!0})})});let ve=/* @__PURE__ */ new Map;e.constants.forEach(e=>{if(e.args===void 0)return;let t=`${e.module??``}!${e.name}`,n=ve.get(t)??{name:e.name,module:e.module,rows:[]};if(n.rows.length>0&&n.rows[0][0].length!==e.args.length)throw new _(`The arity of the operator ${e.name} is inconsistent in the configuration file.`);n.rows.push([e.args.map(Qf),Qf(e.value)]),ve.set(t,n)}),ve.forEach(e=>me(e).forEach(t=>_e(t,np(e.name,j(t)||e.rows[0][0].length,e.rows))));let M=new Map(e.substitutions.flatMap(e=>me(e).map(t=>[t,le(e.target)])));e.substitutions.filter(e=>e.module===void 0).forEach(t=>{let n=t.name,i=t.target;if(!fe.includes(n)&&!A.visible.has(n))throw new _(`In the configuration file, the identifier ${n} does not appear in the specification.`);if(e.substitutions.some(e=>e.name===i))throw new _(`In the configuration file, the identifier ${i} appears\non the right-hand side of a <- after already appearing on the\nleft-hand side of one.`);let a=le(i),s=r.get(a);if(!(s!==void 0||o.has(a)||he.has(a)||fe.includes(i)||pe.includes(i)))throw new _(`The configuration file substitutes for ${n} with the undefined identifier ${i}.`);if(s?.kind===`Operator`&&s.params.length!==(A.constants.find(e=>e.name===n)?.arity??A.visible.get(n)?.arity))throw new _(`The configuration file substitutes for ${n} with ${i} of different number of arguments.`)});let ye=new Set([...e.constants,...e.substitutions].filter(e=>e.module!==void 0).flatMap(me)),be=(e,t)=>{if(ye.has(e))return{key:e,prefix:t};let n=a.get(e);return n&&be(n.source,t+n.prefix)};a.forEach((e,t)=>{let n=be(e.source,e.prefix),i=r.get(t);if(!n||!i)return;let a=i.kind===`Operator`?i.params:[],o=E(t,n.key,a,a.slice(n.prefix),i.location);r.set(t,o),A.visible.forEach((e,n)=>{e.key===t&&n!==t&&r.set(n,o)})});let xe=fe.filter(e=>!he.has(e)&&!M.has(e)&&!ge.has(e));if(xe.length>0)throw new _(`The constant parameter ${Xf(t.source,t.loadModule,`constant`).find(e=>xe.includes(e))??xe[0]} is not assigned a value by the configuration file.`);let Se={runtime:c,definitions:r,builtins:o,constants:he,substitutions:M,variables:pe,variableIndex:ip(pe,d.flatMap(e=>e.module.variables.map(e=>e.name))),definitionValues:/* @__PURE__ */ new Map,constantLevels:/* @__PURE__ */ new Map,evaluators:/* @__PURE__ */ new WeakMap};Mf(te,e=>{let t=l.get(e)??u.get(e)??A;return{constants:t.constants,variables:t.variables,definitions:[...new Set([...t.visible.values()].flatMap(e=>r.get(e.key)??[]))],assumptions:t.module.assumptions.map(e=>e.expression),getDefinition:e=>r.get(t.visible.get(e)?.key??e)}});let Ce=Of({constants:new Set(he.keys()),variables:/* @__PURE__ */ new Set([...pe,...[`TLCGet`,`Trace`,`CounterExample`].filter(e=>o.has(e))]),getDefinition:e=>Io(e,Se)}),we=e=>{try{Z(e,{environment:Se,scope:void 0,state:void 0,next:void 0});return}catch(e){if(e instanceof v)return e;throw e}};return M.forEach((e,t)=>{let n=r.get(e),i=fe.includes(t)&&n?.kind===`Operator`&&n.params.length===0&&Ce.analyzeDefinition(n,/* @__PURE__ */ new Map).level>0?we(n.body):void 0;if(i)throw new _(`The configuration file substitutes constant ${t} with non-constant ${e}${i instanceof y?``:` - specifically: ${i.message}`}`)}),c.isStarted=!0,{environment:Se,assumptions:ue,variableLocations:A.variableLocations,instanceActions:ne}},cp={kind:`Boolean`,value:!0},lp={kind:`Boolean`,value:!1},up=e=>e?cp:lp,dp=e=>e.kind===`State`||e.kind===`Enabled`||e.kind===`Action`,fp=e=>e.kind===`State`||e.kind===`Enabled`||e.kind===`Boolean`,$=(e,t)=>({kind:e,body:t}),pp=(e,t,n)=>({kind:e,operands:[t,n]}),mp=(e,t)=>({kind:e,operands:t.flatMap(t=>t.kind===e?mp(e,t.operands).operands:[t])}),hp=e=>{switch(e.kind){case`Boolean`:return 0;case`State`:case`Enabled`:return 1;case`Action`:case`Next`:return 2;case`Not`:return hp(e.body);case`Always`:case`Eventually`:return 3;case`And`:case`Or`:return e.operands.reduce((e,t)=>Math.max(e,hp(t)),0)}},gp=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 gp(e.body);case`And`:case`Or`:return e.operands.some(gp)}},_p=/* @__PURE__ */ new WeakMap,vp={count:0},yp=e=>{let t=_p.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`#${vp.count++}`;case`And`:case`Or`:return`${e.kind}(${e.operands.map(yp).join(`,`)})`;default:return`${e.kind}(${yp(e.body)})`}})();return _p.set(e,n),n},bp=(e,t)=>e===t||yp(e)===yp(t),xp=(e,t)=>{let n=yp(t);return e.some(e=>e===t||yp(e)===n)},Sp=e=>e===`And`?`Or`:`And`,Cp=(e,t)=>{switch(e.kind){case`Boolean`:return t?up(!e.value):e;case`State`:case`Enabled`:case`Action`:case`Next`:return t?$(`Not`,e):e;case`Not`:return Cp(e.body,!t);case`And`:case`Or`:return mp(t?Sp(e.kind):e.kind,e.operands.map(e=>Cp(e,t)));case`Always`:case`Eventually`:{let n=t===(e.kind===`Always`)?`Eventually`:`Always`;return $(n,Cp(e.body,t))}}},wp=e=>{switch(e.kind){case`Boolean`:return up(!e.value);case`Not`:return e.body;case`And`:case`Or`:return mp(Sp(e.kind),e.operands.map(wp));case`Always`:return $(`Eventually`,wp(e.body));case`Eventually`:return $(`Always`,wp(e.body));default:return $(`Not`,e)}},Tp=e=>{switch(e.kind){case`And`:case`Or`:{let t=e.kind===`Or`,n=[];for(let r of e.operands){let e=Tp(r);if(e.kind!==`Boolean`)n.push(e);else if(e.value===t)return up(t)}return n.length===0?up(!t):n.length===1?n[0]:mp(e.kind,n)}case`Not`:{let t=Tp(e.body);return t.kind===`Boolean`?up(!t.value):$(`Not`,t)}case`Always`:case`Eventually`:{let t=Tp(e.body);return $(e.kind,t.kind===e.kind?t.body:t)}default:return e}},Ep=e=>e.kind===`Always`&&e.body.kind===`Eventually`?e.body.body:void 0,Dp=e=>{switch(e.kind){case`And`:{let t=[],n={value:1};for(let r of e.operands){let e=Dp(r);if(e.kind===`And`)t.push(...e.operands);else{if(e.kind===`Or`&&(n.value*=e.operands.length,n.value>2147483647))throw new v(`TLC cannot handle the temporal formula because it exceeds the maximum supported size in disjunctive normal form.`);t.push(e)}}if(n.value===1)return{kind:`And`,operands:t};let r=Array.from({length:n.value},()=>[]),i={groups:1,repeat:n.value};for(let e of t){if(e.kind!==`Or`){r.forEach(t=>t.push(e));continue}i.repeat/=e.operands.length;let t={value:0};for(let n=0;n<i.groups;n++)for(let n of e.operands)for(let e=0;e<i.repeat;e++)r[t.value++].push(n);i.groups*=e.operands.length}return{kind:`Or`,operands:r.map(e=>mp(`And`,e))}}case`Or`:{let t=[],n=[];for(let r of e.operands){let e=Dp(r);for(let r of e.kind===`Or`?e.operands:[e]){let e=Ep(r);e?t.push(e):n.push(r)}}if(t.length>0){let e=t.length===1?t[0]:mp(`Or`,t);n.push($(`Always`,$(`Eventually`,e)))}return mp(`Or`,n)}case`Not`:return dp(e.body)?e:Dp(wp(e.body));default:return e}},Op=e=>{switch(e.kind){case`And`:case`Or`:return e.operands.length===1?Op(e.operands[0]):mp(e.kind,e.operands.map(Op));case`Not`:return e.body.kind===`Not`?Op(e.body.body):$(`Not`,Op(e.body));case`Always`:case`Eventually`:case`Next`:return $(e.kind,Op(e.body));default:return e}},kp=e=>{switch(e.kind){case`And`:case`Or`:{if(e.operands.length===1)return kp(e.operands[0]);let t=Math.floor(e.operands.length/2);return pp(e.kind,kp(mp(e.kind,e.operands.slice(0,t))),kp(mp(e.kind,e.operands.slice(t))))}case`Not`:case`Always`:case`Eventually`:case`Next`:return $(e.kind,kp(e.body));default:return e}},Ap=(e,t)=>{e.kind===`Eventually`&&!xp(t,e)&&t.push(e),`body`in e&&Ap(e.body,t),`operands`in e&&e.operands.forEach(e=>Ap(e,t))},jp=e=>{let t=e.filter(fp),n=e.flatMap(e=>e.kind===`Not`&&fp(e.body)?[e.body]:[]);return!t.some(e=>xp(n,e))},Mp=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,$(`Next`,e)),t.push(e.body);break;case`And`:case`Or`:t.push(...e.operands),n.push(e);break;case`Action`:throw new v(`TLC encountered actions while constructing the tableau`);default:n.push(e)}}return n},Np=(e,t,n)=>{if(e.kind===t&&`body`in e)return{first:e.body,second:$(`Next`,e)};if(e.kind===n&&`operands`in e)return{first:e.operands[0],second:e.operands[1]}},Pp=(e,t,n)=>e.flatMap(e=>{let r=Np(e,t,n);return r?[{whole:e,first:r.first,second:r.second}]:[]}),Fp=e=>[...new Set(e.map(yp))].sort().join(`|`),Ip=(e,t)=>{let n=new Set(t.map(Fp));return[...e.filter(e=>!n.has(Fp(e))),...t]},Lp=e=>{let t=Mp(e),n=Pp(t,`Always`,`And`),r=Pp(t,`Eventually`,`Or`),i=e=>{for(let t of e){let n=Np(t,`Eventually`,`Or`);if(n&&!(xp(e,n.first)||xp(e,n.second)))return Ip(a([...e,n.first]),a([...e,n.second]))}let t=r.find(t=>(xp(e,t.first)||xp(e,t.second))&&!xp(e,t.whole));return t?a([...e,t.whole]):[e]},a=e=>{if(!jp(e))return[];let t=[...e];for(let e=0;e<t.length;e++){let n=Np(t[e],`Always`,`And`);n&&(xp(t,n.first)||t.push(n.first),xp(t,n.second)||t.push(n.second))}let r={isChanged:!0};for(;r.isChanged;){r.isChanged=!1;for(let e of n)xp(t,e.first)&&xp(t,e.second)&&!xp(t,e.whole)&&(t.push(e.whole),r.isChanged=!0)}return t.length>e.length&&!jp(t)?[]:i(t)};return a(e)},Rp=e=>({particle:e,successors:[],statePredicates:e.filter(e=>hp(e)<=1)}),zp=e=>{let t=Lp([e]).map(Rp),n=t.length,r=/* @__PURE__ */ new Map;t.forEach((e,t)=>{let n=Fp(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 Lp(n)){let n=Fp(i),a=r.get(n);a===void 0&&(r.set(n,t.length),t.push(Rp(i))),t[e].successors.push(a??t.length-1)}}return{nodes:t,initialCount:n}},Bp=(e,t)=>!xp(e,t)||xp(e,t.body),Vp=(e,t)=>{if(e.kind===`Eventually`&&e.body.kind===`Always`&&hp(e.body.body)<3){t.eventuallyAlways.push(e.body.body);return}let n=Ep(e);if(n){let e=hp(n);if(e<=1){t.infinitelyOftenStates.push(n);return}if(e===2){t.infinitelyOftenActions.push(n);return}}if(gp(e))throw new v(`TLC cannot handle the temporal formula: actions may only appear as []<>A or <>[]A`);t.formulas.push(e)},Hp=(e,t)=>{let n=e.findIndex(e=>bp(e,t));return n===-1?(e.push(t),e.length-1):n},Up=e=>{let t=Dp(Tp(Cp(e,!1)));if(t.kind===`Boolean`&&!t.value)return[];let n=[];for(let e of t.kind===`Or`?t.operands:[t]){let t=Op(e),r={eventuallyAlways:[],infinitelyOftenStates:[],infinitelyOftenActions:[],formulas:[]};for(let e of t.kind===`And`?t.operands:[t])Vp(e,r);let i=r.formulas,a=i.length===0?void 0:i.length===1?i[0]:mp(`And`,i),o=n.find(e=>e.formula===void 0||a===void 0?e.formula===a:bp(e.formula,a));o?o.classifications.push(r):n.push({formula:a,classifications:[r]})}return n.map(e=>{let t=e.formula&&kp(e.formula),n=[];t&&Ap(t,n);let r=[],i=[],a=e.classifications.map(e=>({infinitelyOftenActions:e.infinitelyOftenActions.map(e=>Hp(i,e)),infinitelyOftenStates:e.infinitelyOftenStates.map(e=>Hp(r,e)),eventuallyAlways:e.eventuallyAlways.map(e=>Hp(i,e))}));return{tableau:t&&zp(t),promises:n,stateChecks:r,actionChecks:i,models:a}})},Wp=/* @__PURE__ */ new Set([`~>`,`-+->`]),Gp=/* @__PURE__ */ new WeakMap,Kp=/* @__PURE__ */ new WeakSet,qp=(e,t)=>({environment:e,scope:t,state:void 0,next:void 0}),Jp=(t,r)=>{try{return Z(t,r)}catch(t){if(!(t instanceof v)||t instanceof y)throw t;let r=o(t);throw r===void 0?n(new v(`${l}${t.message}`,t),e.error):n(t,r)}},Yp=e=>new v(`TLC cannot handle the temporal formula at ${bo(e)}`),Xp=(e,t,n,r=/* @__PURE__ */ new Set)=>{let i=e=>{let r=jo(t,e);if(!r)return;if(r.kind===`Value`)return 0;if(r.kind===`Thunk`)return Xp(r.expression,r.scope,n);let i=r.operator;return i.kind===`Closure`?Xp(i.body,i.scope,n):0},a=e=>{if(n.variableIndex.has(e))return 1;if(n.constants.has(e))return 0;let t=Io(e,n);if(t)return Zp(t,n);let r=n.builtins.get(n.substitutions.get(e)??e);return r?+!!r.isStateLevel:void 0},o=(e,t)=>r.has(e)?0:K(t)?i(e)??a(e)??0:a(e)??i(e)??0,s=e=>{let i={value:0};return Qi(e,(e,a)=>(i.value=Math.max(i.value,Xp(e,t,n,a.length===0?r:/* @__PURE__ */ new Set([...r,...a]))),e)),i.value};switch(e.kind){case`Prime`:case`Unchanged`:case`BoxAction`:case`AngleAction`:return 2;case`Enabled`:return 1;case`Always`:case`Eventually`:case`WeakFairness`:case`StrongFairness`:return 3;case`UnboundedQuantifier`:return e.isTemporal?3:s(e);case`Identifier`:return o(e.name,e);case`OperatorReference`:return o(e.operator,e);case`Apply`:return Wp.has(e.operator)?3:e.operator===`\\cdot`?2:Math.max(o(e.operator,e),s(e));default:return s(e)}},Zp=(e,t)=>{let n=Gp.get(e);if(n!==void 0)return n;Gp.set(e,0);let r=e.kind===`Function`?e.bounds:[],i=Math.max(Xp(e.body,void 0,t),...r.map(e=>Xp(e.set,void 0,t)));return Gp.set(e,i),i},Qp=`Temporal formula is a tautology (its negation is unsatisfiable).`,$p=(t,r,i,a,o=``,s=/* @__PURE__ */ new Set)=>{let c=(e,t,n=o,r=s)=>$p(e,t,i,a,n,r);if(t.kind===`And`)return t.operands.flatMap(e=>c(e,r,xo(e)));if(t.kind===`Label`)return c(t.body,r);if(t.kind===`Let`)return c(t.body,em(t,r,i));if(t.kind===`Identifier`){let o=K(t)?jo(r,t.name):void 0;if(o?.kind===`Thunk`)return c(o.expression,o.scope);let l=i.constants.has(t.name)?void 0:Io(t.name,i);if(!o&&l?.kind===`Operator`&&l.params.length===0&&Zp(l,i)>0){if(s.has(l))throw n(new v(u),e.error);let r=c(l.body,void 0,t.name,/* @__PURE__ */ new Set([...s,l]));return!a&&Zp(l,i)<2?[{expression:l.body,scope:void 0,name:t.name}]:r}}let l=qp(i,r);if(t.kind===`Apply`&&(e=>a||Xp(e,r,i)===3)(t)){let e=ns(t,l),n=K(t)?void 0:Io(t.operator,i);if(e?.kind===`Closure`&&e.params.length===t.args.length&&!n?.isRecursive)return c(e.body,ms(e,t.args,l),t.operator)}if(a&&t.kind===`Forall`&&t.bounds.every(e=>Xp(e.set,r,i)===0)){let r=[],i={count:0};if(Vo(t.bounds,l,e=>(i.count++,r.push(...c(t.body,e,xo(t.body))),!1)),i.count===0)throw n(new v(Qp),e.livenessEvaluationFailure);return r}return[{expression:t,scope:r,name:o}]},em=(e,t,n)=>{let r=gs(e.definitions,qp(n,t));for(let e=r;e&&e!==t;e=e.parent)e.binding.kind===`Thunk`&&Kp.add(e.binding);return r},tm=(e,t)=>({kind:`AngleAction`,action:e,subscript:t,location:e.location}),nm=(t,r,i)=>{let a=(e,t,n)=>{let r=n===0?Xp(e,t,i):n;if(r===0){let n=Jp(e,qp(i,t));if(typeof n!=`boolean`)throw new v(`TLC expected a boolean in the temporal formula at ${bo(e)}`);return up(n)}return r===1?{kind:`State`,expression:e,scope:t}:{kind:`Action`,expression:e,unchanged:void 0,scope:t}},o={depth:0},s=(t,r,i,s)=>{if(o.depth>=100)throw n(new v(u),e.error);o.depth++;let c=f(t,r);o.depth--;let l=hp(c);return l>2?c:a(i,s,l)},c=(e,t)=>{let n=e.kind===`Identifier`?e.name:e.operator,r=qp(i,t),a=K(e)||Io(n,i)===void 0?jo(t,n):void 0;if(a?.kind===`Thunk`&&Kp.has(a))return s(a.expression,a.scope,e,t);let o=a?.kind===`Operator`?a.operator:a?void 0:K(e)?rs(n,r):es(n,i);if(o?.kind!==`Closure`)throw Yp(e);let c=e.kind===`Apply`?e.args:[];return s(o.body,ms(o,c,r),e,t)},l=(e,t)=>{if(!e.bounds.every(e=>Xp(e.set,t,i)===0))throw Yp(e);let n=[];Vo(e.bounds,qp(i,t),t=>(n.push(f(e.body,t)),!1));let r=e.kind===`Forall`;if(n.length===0)return up(r);let o=mp(r?`And`:`Or`,n),s=hp(o);return s>2?o:a(e,t,s)},d=(e,t)=>{switch(e.kind){case`Label`:f(e.body,t);return;case`Let`:f(e.body,em(e,t,i));return;case`And`:case`Or`:for(let n of e.operands)f(n,t);return;case`Apply`:if(e.operator===`=>`||e.operator===`~`&&!K(e))for(let n of e.args)f(n,t);return;case`If`:{let n=f(e.condition,t),r=n.kind===`Boolean`?[n.value?e.consequent:e.alternative]:[e.consequent,e.alternative];for(let e of r)f(e,t)}}},f=(e,t)=>{let n=Xp(e,t,i);if(n<=2)return d(e,t),a(e,t,n);switch(e.kind){case`Label`:return f(e.body,t);case`Let`:return f(e.body,em(e,t,i));case`Identifier`:return c(e,t);case`Apply`:{let n=e.args;return e.operator===`~>`?$(`Always`,pp(`Or`,$(`Not`,f(n[0],t)),$(`Eventually`,f(n[1],t)))):e.operator===`~`&&!K(e)?$(`Not`,f(n[0],t)):e.operator===`=>`?pp(`Or`,$(`Not`,f(n[0],t)),f(n[1],t)):c(e,t)}case`And`:case`Or`:return mp(e.kind,e.operands.map(e=>f(e,t)));case`Forall`:case`Exists`:return l(e,t);case`If`:{if(Xp(e.condition,t,i)===0){let n=Jp(e.condition,qp(i,t));if(typeof n==`boolean`)return f(n?e.consequent:e.alternative,t)}let n=f(e.condition,t);return pp(`Or`,pp(`And`,n,f(e.consequent,t)),pp(`And`,$(`Not`,n),f(e.alternative,t)))}case`Always`:case`Eventually`:return $(e.kind,f(e.expression,t));case`WeakFairness`:case`StrongFairness`:{let n=tm(e.action,e.subscript),r={kind:`Enabled`,step:e.enabled??n,scope:t},i=$(`Not`,r),a={kind:`Action`,expression:e.action,unchanged:{kind:`Unchanged`,expression:e.subscript,location:n.location},scope:t,enabled:r};return e.kind===`WeakFairness`?$(`Always`,$(`Eventually`,pp(`Or`,i,a))):pp(`Or`,$(`Eventually`,$(`Always`,i)),$(`Always`,$(`Eventually`,a)))}default:throw Yp(e)}};return f(t,r)},rm=(e,t,n,r,i)=>{let a=e=>rm(e,t,n,r,i);switch(e.kind){case`Boolean`:return e.value;case`State`:case`Enabled`:{let n=i.get(e);if(n!==void 0)return n;let a={environment:r,scope:e.scope,state:t,next:void 0},o=e.kind===`State`?Fo(Z(e.expression,a),`a temporal property predicate`):ho(e.step,a);return i.set(e,o),o}case`Action`:{if(e.enabled&&i.get(e.enabled)===!1)return!1;let a={environment:r,scope:e.scope,state:t,next:n};return e.unchanged&&Fo(Z(e.unchanged,a),`a subscript`)?!1:Fo(Z(e.expression,a),`an action predicate`)}case`Not`:return!a(e.body);case`And`:return e.operands.every(a);case`Or`:return e.operands.some(a);case`Next`:return rm(e.body,n??t,void 0,r,/* @__PURE__ */ new Map);case`Always`:case`Eventually`:throw new v(`TLC cannot evaluate a temporal formula in a single step`)}},im=(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)=>im(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 rm(e,t[r],t[a(r)],i,/* @__PURE__ */ new Map)}},am=(e,t)=>e.every((e,n)=>it(e,t[n])),om=e=>e.filter((t,n)=>n===0||e[n-1]!==t),sm=(e,t,n)=>(e.nodeStates.push(t),e.nodeTableaux.push(n),e.pending.push(void 0),e.offsets.push(-1),e.edgeOffsets.push(-1),e.nodeStates.length-1),cm=(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}},lm=(e,t)=>(e.offsets[t]??-1)!==-1,um=(e,t)=>e.pending[t]??=[],dm=(e,t)=>{let n=e.edgeOffsets[t];return e.edges.ids.subarray(n+1,n+1+e.edges.ids[n])},fm=(e,t,n)=>e.results.bytes[e.offsets[t]+n]===1,pm=2**53-1,mm=(t,r,i,a)=>{if(t.length===0)return;let o=r.map(e=>nm(e.expression,e.scope,i)),s=t.map(e=>$(`Not`,nm(e.expression,e.scope,i))),c=s.length===1?s[0]:mp(`Or`,s),l=o.length===0?c:mp(`And`,[...o,c]),u=Up(l);if(u.length===0)throw n(new v(Qp),e.livenessEvaluationFailure);let d=/* @__PURE__ */ new Map,f=u.map(e=>({solution:e,actionIds:Int32Array.from(e.actionChecks,e=>{let t=yp(e),n=d.get(t)??d.size;return d.set(t,n),n}),nodeStates:[],nodeTableaux:[],pending:[],offsets:[],results:{bytes:/* @__PURE__ */ new Uint8Array(1024),length:0},edgeOffsets:[],edges:{ids:/* @__PURE__ */ new Int32Array(1024),length:0},initial:[],nodeIds:{slots:/* @__PURE__ */ new Int32Array(3072),size:0,shift:22},isDone:[],errorNode:void 0})),p={multiplier:1},m=!Os(i),h={states:/* @__PURE__ */ new Map,actions:/* @__PURE__ */ new Map},g=e=>{let t=h.states.get(e)??/* @__PURE__ */ new Map;return h.states.set(e,t),t},_=(e,t)=>{i.runtime.setLivenessSource(e);let n=t();return i.runtime.setLivenessSource(void 0),n},y=(e,t)=>rm(e,t,void 0,i,m?g(t):/* @__PURE__ */ new Map),b=(e,t,n)=>_(t,()=>Uint8Array.from(e.solution.stateChecks,e=>+!!y(e,n))),x=(e,t,n,r)=>_(t,()=>{let t=e.solution.actionChecks;if(!m)return Uint8Array.from(t,e=>+!!rm(e,n,r,i,/* @__PURE__ */ new Map));let a=g(n),o=h.actions.get(n)??/* @__PURE__ */ new Map;h.actions.set(n,o);let s=o.get(r)??new Int8Array(d.size).fill(-1);return o.set(r,s),Uint8Array.from(e.actionIds,(e,o)=>(s[e]===-1&&(s[e]=+!!rm(t[o],n,r,i,a)),s[e]))}),ee=(e,t,n,r)=>_(n,()=>e.nodes[t].statePredicates.every(e=>y(e,r))),te=(e,t)=>{let n=e.nodes[t];return n.particle.length===0&&n.successors.length===1&&n.successors[0]===t},ne=e=>e.solution.models.some(e=>e.eventuallyAlways.length===0&&e.infinitelyOftenStates.length===0&&e.infinitelyOftenActions.length===0),re=(e,t,n)=>{if(!e.solution.tableau)return t;let r=e.nodeIds.slots,i=cm(e.nodeIds,t,n);return r[i]===0?void 0:r[i+2]},ie=(e,t,n)=>{let r=sm(e,t,n),i=e.nodeIds;if(++i.size*2>i.slots.length/3){let e=i.slots;i.slots=new Int32Array(e.length*2),i.shift--;for(let t=0;t<e.length;t+=3)e[t]!==0&&i.slots.set(e.subarray(t,t+3),cm(i,e[t]-1,e[t+1]))}return i.slots.set([t+1,n,r],cm(i,t,n)),r},S=(e,t,n)=>t.nodes.flatMap((t,r)=>re(e,n,r)??[]).sort((e,t)=>e-t),ae=(e,t,n,r)=>{let i=e.solution.actionChecks.length,a=e.results,o=a.length;if(a.length+=r.length+n.length*i,a.length>a.bytes.length){let e=new Uint8Array(Math.max(2*a.bytes.length,a.length));e.set(a.bytes),a.bytes=e}a.bytes.set(r,o),n.forEach((e,t)=>a.bytes.set(e,o+r.length+t*i)),e.offsets[t]=o;let s=e.pending[t]??[],c=e.edges,l=c.length;if(c.length+=s.length+1,c.length>c.ids.length){let e=new Int32Array(Math.max(2*c.ids.length,c.length));e.set(c.ids),c.ids=e}c.ids[l]=s.length,c.ids.set(s,l+1),e.edgeOffsets[t]=l,e.pending[t]=void 0},C=(e,t,n)=>{let r={slots:Array.from({length:16*p.multiplier}),count:0},i=(e,t)=>{for(let n=(a.getFingerprint(t.index)&2147483647)%e.length;;n=(n+1)%e.length){let r=e[n];if(r===void 0)return e[n]=t,!0;if(r.index===t.index&&am(r.state,t.state))return!1}},o=e=>{if(r.count>=r.slots.length>>1){let e=r.slots;r.slots=Array.from({length:2*e.length+1});for(let t of e)t&&i(r.slots,t)}i(r.slots,e)&&r.count++};return n.forEach(o),o({index:e,state:t}),r.slots.length>16*p.multiplier&&p.multiplier++,r.slots.filter(e=>e!==void 0)},oe=(e,t,n,r,i)=>{let o=b(e,r,n),s=t.nodes[e.nodeTableaux[i]],c=[],l=um(e,i),u=s.successors.length>0?x(e,r,n,n):/* @__PURE__ */ new Uint8Array;for(let a of s.successors){if(!ee(t,a,r,n))continue;if(te(t,a)&&e.errorNode===void 0&&ne(e)){e.errorNode=i;return}let o=re(e,r,a);if(o!==void 0&&l.includes(o))continue;let s=o??ie(e,r,a);l.push(s),c.push(u),o===void 0&&oe(e,t,n,r,s)}for(let i of a.getSuccessors(n)){let a=x(e,r,n,i.state),o=e.isDone[i.index]===!0;for(let n of s.successors){if(!ee(t,n,r,i.state))continue;let s=re(e,i.index,n);if(s!==void 0&&l.includes(s))continue;let u=s??ie(e,i.index,n);l.push(u),c.push(a),s===void 0&&o&&oe(e,t,i.state,i.index,u)}}l.length>0&&ae(e,i,c,o)},w=(e,t,n,r,i,a)=>{let o=t.nodes.map((e,r)=>n.map(e=>ee(t,r,a,e.state)));e.isDone[a]=!0;for(let s of S(e,t,a)){let a=um(e,s),c=[];n.forEach((n,i)=>{let l=e.isDone[n.index]===!0;for(let u of t.nodes[e.nodeTableaux[s]].successors){if(!o[u][i])continue;let s=re(e,n.index,u);if(s!==void 0&&a.includes(s))continue;let d=s??ie(e,n.index,u);a.push(d),c.push(r[i]),s===void 0&&l&&oe(e,t,n.state,n.index,d)}}),ae(e,s,c,i)}if(e.errorNode!==void 0)return om(E(e,e.errorNode).reverse().map(t=>e.nodeStates[t]))},T=(e,t,n,r,i)=>{for(;e.nodeStates.length<=i;)sm(e,e.nodeStates.length,-1);let a=um(e,i),o=[];t.forEach((t,r)=>{lm(e,t.index)&&a.includes(t.index)||(a.push(t.index),o.push(n[r]))}),ae(e,i,o,r)},E=(e,t)=>{if(e.initial.includes(t))return[t];let n=/* @__PURE__ */ new Map,r=[];for(let t of e.initial)lm(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 dm(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}lm(e,i)&&!n.has(i)&&(n.set(i,a),r.push(i))}}throw new v(`Couldn't re-create liveness trace (path) starting at: ${t}`)},se=(e,t)=>{let n=e.solution,r=n.actionChecks.length,i=n.stateChecks.length,a=(t,n,a)=>e.results.bytes[e.offsets[t]+i+n*r+a]===1,o=(e,n)=>t.eventuallyAlways.every(t=>a(e,n,t)),s=new Float64Array(e.nodeStates.length).fill(-1),c=e.initial.filter(t=>lm(e,t)),l=[],u=t=>{let n=dm(e,t).indexOf(t);return n!==-1&&o(t,n)},d=(t,r)=>n.tableau!==void 0&&Bp(n.tableau.nodes[e.nodeTableaux[t]].particle,r),f=r=>{let i=l.pop()??r;if(i===r&&!u(i)){s[i]=pm;return}let c=/* @__PURE__ */ new Set,f=/* @__PURE__ */ new Map;for(let t=i;;t=l.pop()??r){c.add(t);let n=f.get(e.nodeStates[t]);if(n?n.push(t):f.set(e.nodeStates[t],[t]),s[t]=pm,t===r)break}let m=t.infinitelyOftenStates.every(t=>[...c].some(n=>fm(e,n,t))),h=t.infinitelyOftenActions.every(t=>[...c].some(n=>dm(e,n).some((e,r)=>c.has(e)&&o(n,r)&&a(n,r,t)))),g=n.promises.every(e=>[...c].some(t=>d(t,e)));if(m&&h&&g)return p(r,c,f)},p=(r,i,s)=>{let c=om(E(e,r).reverse().map(t=>e.nodeStates[t])),l=[],u=/* @__PURE__ */ new Set([r]),f=t.infinitelyOftenStates.map(()=>!1),p=t.infinitelyOftenActions.map(()=>!1),h=n.promises.map(()=>!1),g={count:f.length+p.length+h.length},_={node:r},y=e=>i.has(e),b=e=>{l.push(_.node),_.node=e};for(;g.count>0;){let r=g.count;for(;t.infinitelyOftenStates.forEach((t,n)=>{!f[n]&&fm(e,_.node,t)&&(f[n]=!0,g.count--)}),n.promises.forEach((e,t)=>{!h[t]&&d(_.node,e)&&(h[t]=!0,g.count--)}),!(g.count<=0);){let n={last:-1,unvisited:-1},i=g.count;if(dm(e,_.node).some((r,c)=>{if(s.has(e.nodeStates[r])){if(!y(r)||!o(_.node,c))return!1;n.last=r,t.infinitelyOftenActions.forEach((e,t)=>{!p[t]&&a(_.node,c,e)&&(p[t]=!0,g.count--)})}return g.count<i?(b(r),u.clear(),!0):(y(r)&&!u.has(r)&&(n.unvisited=r),!1)}))break;if(g.count<r){b(n.last),u.clear();break}for(;n.unvisited===-1;){let t=l.pop();if(t===void 0)throw new v(`TLC failed to build the counterexample of a liveness property`);_.node=t,n.unvisited=dm(e,t).find(e=>y(e)&&!u.has(e))??-1}b(n.unvisited),u.add(n.unvisited)}}let x=m(r,_.node,s,o);for(let t=l.length-1;t>=0;t--){let n=e.nodeStates[l[t]];x[x.length-1]!==n&&x.push(n)}let ee=c[c.length-1];return x[x.length-1]===ee&&x.pop(),{prefix:c.slice(0,-1),cycle:[ee,...x.reverse()]}},m=(t,n,r,i)=>{if(n===t)return[];let a=e.nodeStates[n],o=/* @__PURE__ */ new Map,s=/* @__PURE__ */ new Set([a]),c=[];for(let n=a,l=-1,u=0;;u++){for(let u of r.get(n)??[])for(let[d,f]of dm(e,u).entries()){if(f===u||!i(u,d))continue;if(f===t){let e=[];for(let t=n,r=l;t!==a;)e.push(t),t=r,r=o.get(t)??-1;return e.push(a),e}let p=e.nodeStates[f];r.has(p)&&!s.has(p)&&(s.add(p),c.push([p,n]))}o.set(n,l);let d=c[u];if(d===void 0)throw new v(`TLC failed to build the counterexample of a liveness property`);n=d[0],l=d[1]}};for(let t=0;t<c.length;t++){let n=[c[t],-1,0],r={link:0};for(;n.length>=3;){let t=n.pop()??0,i=n.pop(),a=n.pop()??0;if(i===-42){if(s[a]===t){let e=f(a);if(e)return e}n.push(Math.min(n.pop()??t,t));continue}if(s[a]!==-1){n.push(Math.min(t,s[a]));continue}s[a]=r.link,n.push(t,a,-42),l.push(a);let u={value:r.link++};dm(e,a).forEach((t,r)=>{lm(e,t)&&(o(a,r)?s[t]===-1?n.push(t,-1):u.value=Math.min(u.value,s[t]):s[t]===-1&&c.push(t))}),n.push(u.value)}}};return{addInitialState:(e,t)=>{h.states.clear(),h.actions.clear();for(let n of f){let r=n.solution.tableau;if(!r)n.initial.push(e);else for(let i=0;i<r.initialCount;i++)ee(r,i,void 0,t)&&n.initial.push(re(n,e,i)??ie(n,e,i))}},addState:(e,t,n)=>{h.states.clear(),h.actions.clear();let r=C(e,t,n);for(let n of f){let i=r.map(r=>x(n,e,t,r.state)),a=b(n,e,t),o=n.solution.tableau,s=o?w(n,o,r,i,a,e):T(n,r,i,a,e);if(s)return s}},findViolation:()=>{for(let e of f)for(let t of e.solution.models){let n=se(e,t);if(n)return n}},getViolatedProperties:(e,n)=>[...new Set(t.filter((t,r)=>!im(s[r].body,e,n,0,i)).map(e=>e.name))]}},hm=`UnnamedAction`,gm={module:`--TLA+ BUILTINS--`,start:{line:0,column:0},end:{line:0,column:0}},_m=e=>{let t=e.range??gm;return Jt([[`beginLine`,t.start.line],[`beginColumn`,t.start.column],[`endLine`,t.end.line],[`endColumn`,t.end.column],[`module`,t.module]])},vm=e=>{let t=[[`name`,e.name],[`location`,_m(e.location)]];return e.parameters.length===0?Jt(t):Jt([...t,[`context`,Jt(e.parameters)],[`parameters`,qt(e.parameters.map(e=>e[0]))]])},ym=(e,t)=>({name:e,location:t.location,parameters:[],expression:t,scope:void 0}),bm=(e,t)=>({environment:e,scope:t,state:void 0,next:void 0}),xm=e=>e.kind===`Identifier`?e.name:e.kind===`Apply`?e.operator:void 0,Sm=e=>e.kind===`Apply`?e.args:[],Cm=(e,t,n)=>{let r=xm(e);if(r===void 0)return;if(K(e)){let e=jo(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=es(r,n);return i?.kind===`Closure`?i:void 0},wm=(e,t)=>{try{return Z(e,bm(t,void 0)),!0}catch(e){if(e instanceof f)return!1;throw e}},Tm=(e,t)=>e?.kind===`Operator`&&e.params.length===0&&e.body.kind!==`Number`&&e.body.kind!==`String`&&Ro(e,t)&&wm(e.body,t),Em=(e,t)=>{let n=Io(e.name,t);return n?.body===e.body&&Tm(n,t)},Dm=(e,t)=>{if(e.kind!==`Identifier`||!K(e))return;let n=jo(t,e.name);return n?.kind===`Thunk`?n:void 0},Om=(e,t)=>(e?.params??[]).flatMap(e=>{let n=jo(t,e.name);return n?.kind===`Value`?[[e.name,n.value]]:[]}),km=(e,t)=>{try{return e()}catch(e){if(e instanceof f)return t();throw e}},Am=(e,t,n,r,i)=>{let a=Sm(t),o=()=>[{name:e.name,location:t.location,parameters:[],expression:t,scope:n}];return!r||a.length===0?[{...e,parameters:[],expression:t,scope:n}]:a.some(e=>Xp(e,n,i)!==0)?o():km(()=>[{...e,parameters:a.map((e,t)=>[r.params[t].name.replace(/#\d+$/,``),Z(e,bm(i,n))]),expression:t,scope:n}],o)},jm=(e,t,n,r,i)=>{let a=()=>({name:n?.name??hm,location:e.location,parameters:Om(n,t),expression:e,scope:t});switch(e.kind){case`Let`:return jm(e.body,gs(e.definitions,bm(r,t)),n,r,i);case`Label`:return jm(e.body,t,n,r,i);case`Or`:return e.operands.flatMap(e=>jm(e,t,n,r,i));case`Exists`:return km(()=>{let o=[];return Vo(e.bounds,bm(r,t),t=>(o.push(...jm(e.body,t,n,r,i)),!1)),o.length===0?[a()]:o},()=>[a()])}let o=K(e)?void 0:i.get(xm(e)??``),s=Cm(e,t,r);if(o)return Am(o,e,t,s,r);if(!s)return[a()];let c=Sm(e),l=()=>[{name:s.name,location:e.location,parameters:[],expression:e,scope:t}];return Em(s,r)||c.some(e=>Xp(e,t,r)!==0)?l():km(()=>{let e=c.reduce((e,n,i)=>({name:s.params[i].name,binding:{kind:`Value`,value:Z(n,bm(r,t))},parent:e}),s.scope);return jm(s.body,e,s,r,i)},l)},Mm=(e,t,n,r,i)=>{let a=(e,t)=>Mm(e,t,n,r,i);if(e.kind===`Let`){a(e.body,gs(e.definitions,bm(n,t)));return}let o=Dm(e,t);if(o){a(o.expression,o.scope);return}let s=Cm(e,t,n);if(s&&Em(s,n))return;if(s&&s.params.length===0){if(Xp(s.body,s.scope,n)===1){r.inits.push(ym(s.name,s.body));return}a(s.body,s.scope);return}if(s&&e.kind===`Apply`&&s.params.length===e.args.length){a(s.body,ms(s,e.args,bm(n,t)));return}if(e.kind===`And`){e.operands.forEach(e=>a(e,t));return}if(e.kind===`Always`){if(e.expression.kind===`BoxAction`){i.push({expression:e.expression.action,scope:t});return}r.temporals.push(ym(hm,e));return}let c=Xp(e,t,n);c<=1?r.inits.push(ym(hm,e)):c===3&&r.temporals.push(ym(hm,e))},Nm=(e,t,n,r,i)=>{let a=(t,n)=>Nm(e,t,n,r,i);if(t.kind===`Let`){a(t.body,gs(t.definitions,bm(r,n)));return}let o=Dm(t,n);if(o){a(o.expression,o.scope);return}let s=Cm(t,n,r);if(s&&Em(s,r))return;if(s&&s.params.length===Sm(t).length){a(s.body,t.kind===`Apply`?ms(s,t.args,bm(r,n)):s.scope);return}if(t.kind===`Forall`&&km(()=>(Vo(t.bounds,bm(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(ym(e,a)):Xp(a,n,r)<2?i.invariants.push(ym(e,a)):i.impliedTemporals.push(ym(e,t));return}let c=Xp(t,n,r);c<=1?i.impliedInits.push(ym(e,t)):c===3&&i.impliedTemporals.push(ym(e,t))},Pm=(e,t)=>{let n=Io(e,t);return n?.kind===`Operator`&&!Tm(n,t)?n:void 0},Fm=e=>Jt([[`name`,e.name],[`location`,_m(e.location)]]),Im=(e,t,n)=>{let r={inits:[],actions:[],temporals:[],invariants:[],impliedInits:[],impliedActions:[],impliedTemporals:[]},i=[],a=e.specification===void 0?void 0:Pm(e.specification,t);a&&(Mm(a.body,void 0,t,r,i),i.forEach(e=>r.actions.push(...jm(e.expression,e.scope,void 0,t,n))));let o=e.init===void 0?void 0:es(e.init,t);o?.kind===`Closure`&&r.inits.push(ym(e.init??``,o.body));let s=e.next===void 0?void 0:es(e.next,t);return s?.kind===`Closure`&&r.actions.push(...jm(s.body,s.scope,s,t,n)),e.invariants.forEach(e=>{let n=Pm(e,t);n&&r.invariants.push(ym(e,n.body))}),e.properties.forEach(e=>{let n=Pm(e,t);n&&Nm(e,n.body,void 0,t,r)}),r},Lm=(e,t,n)=>Im(e,t,n).actions,Rm=e=>e.parameters.length===0?``:`(${e.parameters.map(e=>G(e[1])).join(`,`)})`,zm=e=>`${e.name===hm?`Action`:e.name}${Rm(e)} ${h(e.location.range??gm)}`,Bm=e=>`${e.name}${Rm(e)}`,Vm=(e,t,n,r)=>{let i=Im(e,t,r),a=e=>jt(e.map(vm)),o=e=>jt(e.flatMap(e=>{let n=Pm(e,t);return n?[Fm(n)]:[]}));return Jt([[`inits`,a(i.inits)],[`actions`,a(i.actions)],[`temporals`,a(i.temporals)],[`invariants`,a(i.invariants)],[`impliedinits`,a(i.impliedInits)],[`impliedactions`,a(i.impliedActions)],[`impliedtemporals`,a(i.impliedTemporals)],[`variables`,jt(t.variables.map((e,t)=>Jt([[`name`,e],[`location`,_m(n[t])]])))],[`actionconstraints`,o(e.actionConstraints)],[`constraints`,o(e.constraints)]])},Hm=`paired12`,Um=(e,t=16)=>e<=t*.75?t:Um(e,t*2),Wm=(e,t)=>{let n=Um(e.length)-1,r=e=>{let r=t(e);return(r^r>>>16)&n};return e.map((e,t)=>({key:e,position:t,bucket:r(e)})).sort((e,t)=>e.bucket-t.bucket||e.position-t.position).map(e=>e.key)},Gm=e=>Number(BigInt.asIntN(32,e^BigInt.asUintN(64,e)>>32n)),Km=e=>[...Array(e.length).keys()].reduce((t,n)=>Math.imul(31,t)+e.charCodeAt(n)|0,0),qm=e=>e.replaceAll(`\\`,`\\\\`).replaceAll(`"`,`\\"`).trim(),Jm=e=>qm(e).replaceAll(`
|
|
420
|
-
`,`\\n`),Ym=(e,t)=>{let n=[],r=e=>n.push(`State ${n.length+1}:\n${e.getText()}\n`);return{writeInitialState:r,writeSuccessor:(e,t,n)=>{n||r(t)},close:()=>t?.(e.path,n.join(``))}},Xm=(e,t)=>{let n=[`strict digraph DiskGraph {
|
|
421
|
-
|
|
422
|
-
`,
|
|
465
|
+
`]]),Ud=/* @__PURE__ */ new Map([[`FiniteSets`,/* @__PURE__ */ new Map([[`IsFiniteSet`,`public static tlc2.value.IBoolValue tlc2.module.FiniteSets.IsFiniteSet(tlc2.value.impl.Value)`],[`Cardinality`,`public static tlc2.value.impl.IntValue tlc2.module.FiniteSets.Cardinality(tlc2.value.impl.Value)`]])],[`Sequences`,/* @__PURE__ */ new Map([[`Seq`,`public static tlc2.value.impl.Value tlc2.module.Sequences.Seq(tlc2.value.impl.Value)`],[`Len`,`public static tlc2.value.impl.IntValue tlc2.module.Sequences.Len(tlc2.value.impl.Value)`],[`Head`,`public static tlc2.value.impl.Value tlc2.module.Sequences.Head(tlc2.value.impl.Value)`],[`Tail`,`public static tlc2.value.impl.Value tlc2.module.Sequences.Tail(tlc2.value.impl.Value)`],[`Append`,`public static tlc2.value.impl.Value tlc2.module.Sequences.Append(tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`\\o`,`public static tlc2.value.impl.Value tlc2.module.Sequences.Concat(tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`SubSeq`,`public static tlc2.value.impl.Value tlc2.module.Sequences.SubSeq(tlc2.value.impl.Value,tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`SelectSeq`,`public static tlc2.value.impl.Value tlc2.module.Sequences.SelectSeq(tlc2.value.impl.Value,tlc2.value.impl.Value)`]])],[`TLC`,/* @__PURE__ */ new Map([[`Print`,`public static tlc2.value.impl.Value tlc2.module.TLC.Print(tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`PrintT`,`public static tlc2.value.impl.Value tlc2.module.TLC.PrintT(tlc2.value.impl.Value)`],[`ToString`,`public static tlc2.value.impl.Value tlc2.module.TLC.ToString(tlc2.value.impl.Value)`],[`Assert`,`public static tlc2.value.impl.Value tlc2.module.TLC.Assert(tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`:>`,`public static tlc2.value.impl.Value tlc2.module.TLC.MakeFcn(tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`@@`,`public static tlc2.value.impl.Value tlc2.module.TLC.CombineFcn(tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`SortSeq`,`public static tlc2.value.impl.Value tlc2.module.TLC.SortSeq(tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`Permutations`,`public static tlc2.value.impl.Value tlc2.module.TLC.Permutations(tlc2.value.impl.Value)`],[`RandomElement`,`public static tlc2.value.impl.Value tlc2.module.TLC.RandomElement(tlc2.value.impl.Value)`],[`TLCEval`,`public static tlc2.value.impl.Value tlc2.module.TLCEval.tlcEval(tlc2.tool.impl.Tool,tla2sany.semantic.ExprOrOpArgNode[],tlc2.util.Context,tlc2.tool.TLCState,tlc2.tool.TLCState,int,tlc2.tool.coverage.CostModel)`]])]]),Wd=k(`EOF`),Gd=k(`IDENTIFIER`),Kd=k(`DEFBREAK`),qd=(e,t)=>Array.from({length:k(t)-k(e)+1},(t,n)=>k(e)+n),Jd=new Set(qd(`op_57`,`op_119`)),Yd=new Set(qd(`op_1`,`op_119`)),Xd=new Set(qd(`op_57`,`op_70`)),Zd=/* @__PURE__ */ new Set([...qd(`ACTION`,`EXCEPT`),k(`EXTENDS`),...qd(`IF`,`SF`),k(`STATE`),...qd(`THEN`,`WITH`),k(`US`),...qd(`op_112`,`op_116`)]),Qd=(e,t,n,r,...i)=>i.map(i=>[i,{name:i,low:t,high:n,isLeftAssociative:r,fix:e}]),$d=new Map([...Qd(`postfix`,160,160,!0,`[`),...Qd(`postfix`,150,150,!1,`'`,`^+`,`^*`,`^#`),...Qd(`prefix`,120,120,!1,`-.`),...Qd(`prefix`,100,130,!1,`SUBSET`,`UNION`,`DOMAIN`),...Qd(`prefix`,40,150,!1,`[]`,`<>`,`ENABLED`,`UNCHANGED`),...Qd(`prefix`,40,40,!0,`\\lnot`),...Qd(`nfix`,100,130,!0,`\\times`),...Qd(`infix`,140,140,!1,`^`,`^^`),...Qd(`infix`,130,130,!1,`/`,`//`,`\\oslash`,`\\div`),...Qd(`infix`,130,130,!0,`*`,`&&`,`&`,`**`,`\\odot`,`\\otimes`,`\\star`,`\\o`,`\\bigcirc`,`\\bullet`),...Qd(`infix`,110,110,!0,`-`,`--`,`\\ominus`),...Qd(`infix`,100,110,!0,`|`,`||`,`%%`),...Qd(`infix`,100,110,!1,`%`),...Qd(`infix`,100,100,!0,`+`,`++`,`\\oplus`),...Qd(`infix`,90,140,!1,`\\wr`),...Qd(`infix`,90,130,!0,`$$`,`$`,`??`,`##`,`\\uplus`,`\\sqcap`,`\\sqcup`),...Qd(`infix`,90,130,!1,`!!`),...Qd(`infix`,90,90,!1,`...`,`..`),...Qd(`infix`,80,80,!0,`\\intersect`,`\\union`),...Qd(`infix`,80,80,!1,`\\`),...Qd(`infix`,70,70,!1,`<:`,`:>`),...Qd(`infix`,60,60,!0,`@@`),...Qd(`infix`,50,140,!0,`\\cdot`),...Qd(`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`,`|-`,`|=`,`-|`,`=|`,`:=`,`::=`),...Qd(`infix`,30,30,!0,`\\land`,`\\lor`),...Qd(`infix`,20,20,!1,`~>`,`\\equiv`,`-+->`),...Qd(`infix`,10,10,!1,`=>`)]),ef=new Map([...$d,...Rd.flatMap(e=>e.slice(1).map(t=>[t,$d.get(e[0])]))]),tf=ef.get(`[`),nf={name:`$$_void`,low:0,high:0,isLeftAssociative:!1,fix:`infix`},rf=e=>({type:`tokens`,kinds:new Set(e)}),af=e=>typeof e==`string`?e.startsWith(`<`)?rf([k(e.slice(1,-1))]):{type:`call`,name:e}:e,G=(...e)=>({type:`sequence`,units:e.map(af)}),K=(...e)=>({type:`choice`,alternatives:e.map(e=>typeof e!=`string`&&e.type===`sequence`?e:G(e))}),of=e=>(...t)=>({type:e,body:G(...t)}),q=of(`zeroOrMore`),sf=of(`oneOrMore`),J=of(`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}),cf=(e,t)=>(t.next===void 0&&(t.next=e.readToken()),t.next),lf=(e,t)=>{let n=e.isLookingAhead?e.scanPosition:e.token;for(let r=0;r<t;r++)n=cf(e,n);return n},uf=(...e)=>{let t=e.map(k);return e=>t.includes(lf(e,1).kind)},df=(e,t=lf(e,1).beginColumn)=>{let n=e.junctions.at(-1);return n===void 0||n.column<t},ff=e=>{let t=lf(e,1),n=e.junctions.at(-1);return n?.column===t.beginColumn&&n.kind===t.kind},pf=e=>uf(`CASESEP`)(e)&&df(e),mf=e=>{let t=lf(e,1);Zd.has(t.kind)&&(t.kind=Gd)},hf=(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}`,gf=(e,t)=>({kind:e,heirs:t,first:t[0].first,last:t[t.length-1].last}),_f=(e,t)=>{let n=e.frames[e.frames.length-1].heirs;return n[n.length-t]},vf=e=>e.operatorStacks[e.operatorStacks.length-1],yf=(e,t)=>e.low>t.high,bf=(e,t)=>e.high<t.low,xf=e=>e.fix===`prefix`?e:ef.get(`${e.name}.`),Sf=(e,t)=>{let n=e[t-2].node,r=e[t-1];e.splice(t-2,2,{node:r.operator===tf?gf(`FcnAppl`,[n,...r.node.heirs]):gf(`PostfixExpr`,[n,r.node]),operator:void 0})},Cf=(e,t)=>{let n=e.length-1;if(t.fix!==`infix`&&t.fix!==`nfix`){e.splice(n-2,2,{node:gf(`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:gf(i?`Times`:`InfixExpr`,[...i&&r.kind===`Times`?r.heirs:[r],e[n-2].node,e[n-1].node]),operator:void 0})},wf=e=>{let t=vf(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 Sf(t,n),wf(e);if(i.operator!==void 0){let t=xf(r.operator);return t!==void 0&&yf(i.operator,t)?`\n Precedence conflict between ops ${i.operator.name} in block ${hf(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 ${hf(e,a.node.first,a.node.last)} and expression at location ${hf(e,i.node.first,i.node.last)} follow each other without any intervening operator.`;if(r.operator.fix===`postfix`)return bf(a.operator,r.operator)?void 0:yf(a.operator,r.operator)?(Cf(t,a.operator),wf(e)):`Precedence conflict between ops ${a.operator.name} in block ${hf(e,r.node.first,r.node.last)} and ${r.operator.name}.`;let o=xf(a.operator),s=o!==void 0&&(n===2||t[n-3].operator!==void 0)?o:a.operator;if(bf(s,r.operator))return;if(!yf(s,r.operator)&&!(s===r.operator&&s.isLeftAssociative))return`\n Precedence conflict between ops ${s.name} in block ${hf(e,a.node.first,a.node.last)} and ${r.operator.name}.`;if(s.fix!==`postfix`)return Cf(t,s),wf(e);let c=hf(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===nf?`\n Error following expression at ${c}, missing operator or separator.`:`\n Illegal combination of operators ${s.name} in block ${c} and ${r.operator.name}.`},Tf=e=>Y(t=>{let n=vf(t),r=_f(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:wf(t)}),Ef=Tf(()=>!1),Df=Tf(()=>!0),Of=Y(e=>{e.lastOperator=ef.get(e.token.image)}),kf=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},Af=e=>{if(e.kind===`GeneralId`)return!0;let t=e.kind===`OpApplication`?kf(e.heirs):void 0;return t!==void 0&&t.heirs.every((e,t)=>t%2==0||e.kind===`GeneralId`)},jf=(e,t)=>{for(let n of t.heirs){if(n.kind===`Junctions`)continue;if(!df(e,n.first.beginColumn))return n;let t=jf(e,n);if(t!==void 0)return t}},Mf=e=>{let t=[`EOF`,`THEOREM`,`PROPOSITION`,`ASSUMPTION`,`END_MODULE`].map(k),n=(e,...t)=>t.some(t=>e.kind===k(t)),r=e=>e!==void 0&&Jd.has(e.kind),i=e.token,a=cf(e,i);i.next=void 0;let o=cf(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===Gd&&(e=e.next)}else if(e.kind===Gd){let t=e.next;!r(t)||Xd.has(t.kind)||Yd.has(t.kind)&&t.next?.kind!==Gd||(e=t.next?.kind===k(`SUBSTITUTE`)?i:Yd.has(t.kind)?t.next:t)}else r(e)&&(e=e.next);e!==void 0&&e.next?.kind!==Kd&&(e.next={kind:Kd,image:`Beginning of definition`,beginLine:e.beginLine,beginColumn:e.beginColumn,next:e.next});break}i=a,a=o,o=cf(e,a),a.next=i}for(;i!==void 0;)a.next=o,o=a,a=i,i=a.next;a.next=o},Nf=e=>{let t=lf(e,1);if(t.kind===k(`LAB`)){let n=1;for(;n!==0;)if(t=cf(e,t),t.kind===k(`LAB`)&&n++,t.kind===k(`RAB`)&&n--,t.kind===Wd)return!1;return cf(e,t).kind===k(`IN`)}if(t.kind!==Gd)return!1;for(t=cf(e,t);t.kind===k(`COMMA`);){if(t=cf(e,t),t.kind!==Gd)return!1;t=cf(e,t)}return t.kind===k(`IN`)},Pf=e=>e.image[1]===`*`?-1:e.image[1]===`+`?-2:Number.parseInt(e.image.slice(1)),Ff=e=>e.proofLevels.at(-1)??-1,If=e=>{let t=lf(e,1);return t.image.length<2?!1:t.image[1]===`*`?e.proofLevels.length===0:t.image[1]===`+`?!0:uf(`ProofStepLexeme`,`BareLevelLexeme`,`UnnumberedStepLexeme`,`ProofStepDotLexeme`)(e)?e.proofLevels.length===0||Ff(e)>=0&&Pf(t)>Ff(e):uf(`BY`,`PROOF`,`OBVIOUS`,`OMITTED`)(e)},Lf=(e,t)=>{let n=Pf(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},Rf=e=>Y(t=>Lf(t,t.token)?void 0:`${hf(t,t.token)}: ${e}`),zf=rf([`op_26`,`op_29`,`op_58`,`CASESEP`,`op_61`,`op_112`,`op_113`,`op_114`,`op_115`,`op_116`].map(k)),Bf=rf([...zf.kinds,k(`op_76`)]),Vf=rf(Yd),Hf=rf(Xd),Uf=rf([`ProofStepLexeme`,`ProofImplicitStepLexeme`,`ProofStepDotLexeme`,`BareLevelLexeme`,`UnnumberedStepLexeme`].map(k)),Wf=()=>q(Z({expansion:[K(zf,`<op_77>`)],semantic:df}),K(`PrefixOp`,`InfixOp`),Df),Gf=()=>K(G(Z({expansion:[`OpenStart`],semantic:df}),`OpenExpression`,Ef),G(Z({semantic:df}),`ExtendableExpr`)),Kf=()=>K(G(`<MODULE>`,X(`identifier`),`Identifier`),`Expression`),qf=()=>K(G(Z({semantic:e=>uf(`ASSUME`,`BOXASSUME`)(e)||lf(e,2).kind===k(`COLONCOLON`)&&[k(`ASSUME`),k(`BOXASSUME`)].includes(lf(e,3).kind)}),`AssumeProve`),`NewSymb`,`Expression`),Jf=()=>[`JuncItem`,q(Z({semantic:ff}),`JuncItem`)],Yf=e=>Y(t=>{t.expecting=e,mf(t)}),Xf=e=>Y(t=>{t.isTerminalProof=e}),Zf=(e,...t)=>G(...t.slice(0,-1),X(`==`),`<DEF>`,Y(t=>{Mf(t),t.expecting=e}),t[t.length-1]),Q=(e,t,n)=>({message:e,body:G(...t),exit:n}),Qf={CompilationUnit:Q(void 0,[Y(Mf),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>`),Yf(`Identifier`),`Identifier`,Y(e=>{e.moduleName??=e.token.image,e.expecting=`----`}),`<SEPARATOR>`]),EndModule:Q(void 0,[`<END_MODULE>`]),Extends:Q(`Extends`,[J(`<EXTENDS>`,Yf(`Identifier`),`Identifier`,X(`comma or module body`),q(`<COMMA>`,Yf(`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(Mf)),G(Z({semantic:e=>uf(`USE`)(e)&&lf(e,2).kind!==k(`ONLY`)||uf(`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(Zf(`Expression`,Z({expansion:[`<IDENTIFIER>`,`<LSB>`]}),`Identifier`,X(`[`),`<LSB>`,X(`Identifier`),`QuantBound`,X(`COMMA or ]`),q(`<COMMA>`,X(`Identifier`),`QuantBound`),`<RSB>`,`Expression`),Zf(`Expression`,Z({expansion:[`<IDENTIFIER>`,Hf]}),`PostfixLHS`,`Expression`),Zf(`Expression`,Z({expansion:[`<IDENTIFIER>`,Vf]}),`InfixLHS`,`Expression`),Zf(`Expression or Instance`,Z({expansion:[`<IDENTIFIER>`,K(`<LBR>`,`<DEF>`)]}),`IdentLHS`,K(`Expression`,`Instantiation`)),Zf(`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`,[Bf,X(`Identifier`),`Identifier`]),InfixLHS:Q(`Infix LHS`,[`Identifier`,Vf,`Identifier`]),PostfixLHS:Q(`Postfix LHS`,[`Identifier`,Hf]),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>`,Yf(`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,[zf,Of]),NonExpPrefixOp:Q(void 0,[Bf,Of]),InfixOp:Q(`Infix Op`,[Vf,Of]),PostfixOp:Q(void 0,[Hf,Of]),Identifier:Q(void 0,[`<IDENTIFIER>`]),Assumption:Q(`Assumption`,[X(`ASSUM...`),K(`<ASSUMPTION>`,`<ASSUME>`),J(Z({amount:2}),J(`<DEFBREAK>`),`Identifier`,X(`==`),`<DEF>`),Y(e=>{Mf(e),e.expecting=`Expression`}),`Expression`]),AssumeProve:Q(`Assume-Prove`,[K(G(`Identifier`,`<COLONCOLON>`,`AssumeProve`),G(K(`<ASSUME>`,`<BOXASSUME>`),X(`Expression, Declaration, or AssumeProve`),qf(),X("PROVE or `,'"),q(`<COMMA>`,X(`Expression, Declaration, or AssumeProve`),qf(),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=_f(e,2);return t.heirs.length>1?`declared symbol with arguments before \\in at ${hf(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(Mf),K(G(Z({amount:3}),Z({semantic:uf(`ASSUME`,`BOXASSUME`)}),`AssumeProve`),`Expression`),J(Z({semantic:If}),`Proof`)]),Proof:Q(`Proof`,[Y(e=>{e.proofLevels.push(-1)}),K(G(Z({semantic:e=>uf(`BY`)(e)||lf(e,2).kind===k(`BY`)}),`UseOrHideOrBy`),G(Z({amount:2}),J(`<PROOF>`),K(`<OBVIOUS>`,`<OMITTED>`)),G(J(Z({amount:2}),`<PROOF>`),q(Z({semantic:e=>lf(e,2).kind!==k(`QED`)}),`Step`,X(`a proof step`)),`QEDStep`)),Y(e=>{e.proofLevels.pop()})]),UseOrHideOrBy:Q(`UseOrHideOrBy`,[K(G(J(`<PROOF>`),`<BY>`,Xf(!0),J(`<ONLY>`)),G(`<USE>`,Xf(!1),J(`<ONLY>`)),G(`<HIDE>`,Xf(!1))),X("an expression, `MODULE' or `DEF'"),J(Kf(),q(`<COMMA>`,X(`MODULE or expression`),Kf(),Y(e=>{e.expecting=e.isTerminalProof?`comma, DEF, or [.]`:`comma, DEF, or proof step`}))),J(`<DF>`,X(`MODULE or expression`),Kf(),q(`<COMMA>`,X(`MODULE or expression`),Kf(),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`),Uf,Rf(`QED step's number has bad level.`),X(`QED`),`<QED>`,J(Z({semantic:If}),`Proof`)]),Step:Q(`Step`,[X(`Step number`),Uf,Rf(`step's number has bad level.`),X(`proof step`),K(G(Z({semantic:uf(`USE`,`HIDE`)}),`UseOrHideOrBy`),G(Z({semantic:uf(`INSTANCE`)}),`Instantiation`),G(Z({semantic:uf(`DEFBREAK`,`DEFINE`)}),`DefStep`),`HaveStep`,`TakeStep`,`WitnessStep`,`PickStep`,`CaseStep`,`AssertStep`),J(Z({semantic:If}),Y(e=>{let t=_f(e,1);return[`PickStep`,`CaseStep`,`AssertStep`].includes(t.kind)?void 0:`${hf(e,t.first,t.last)}: proof of step that does not take a proof.`}),`Proof`)]),DefStep:Q(`DefStep`,[J(`<DEFINE>`),sf(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:uf(`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(Bf,Vf,Hf),rf([`COMMA`,`RBR`,`DEFBREAK`,`LOCAL`,`INSTANCE`,`THEOREM`,`ASSUME`,`END_MODULE`,`SEPARATOR`,`_BM0`,`ASSUMPTION`,`CONSTANT`,`VARIABLE`,`RECURSIVE`].map(k))],semantic:df}),K(`NonExpPrefixOp`,G(`InfixOp`,Y(e=>e.token.image===`\\X`||e.token.image===`\\times`?`${hf(e,e.token)}: \\X may not be used as an infix operator.`:void 0)),`PostfixOp`)),G(Z({expansion:[`<LAMBDA>`],semantic:df}),`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:Nf}),K(`IdentifierTuple`,`Identifier`),X(`\\in`),`<IN>`,`Expression`,X(`':', ',' or '}'`),J(K(G(`<COLON>`,`Expression`),sf(`<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=_f(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`)),sf(`<COMMA>`,`Expression`)))))),`<RBC>`]),SBracketCases:Q(`Some [] Form`,[`<LSB>`,K(G(Z({semantic:Nf}),`QuantBound`,q(`<COMMA>`,`QuantBound`),`<MAPTO>`,`Expression`,`<RSB>`),G(Z({expansion:[`<IDENTIFIER>`,`<MAPTO>`]}),`FieldVal`,q(`<COMMA>`,`FieldVal`),`<RSB>`),G(Z({semantic:e=>lf(e,2).kind===k(`MAPTO`)&&Zd.has(lf(e,1).kind)}),Y(e=>{lf(e,1).kind=Gd}),`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=gf(`FcnAppl`,t.heirs),e.lastOperator=tf})),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>`,sf(`ExceptComponent`,X(`= or ,`)),`<EQUALS>`,`Expression`]),ExceptComponent:Q(`Except Component`,[K(G(`<DOT>`,Y(mf),`Identifier`),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===k(`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=>pf(e)&&lf(e,2).kind!==k(`OTHER`)}),`<CASESEP>`,`CaseArm`),J(Z({semantic:pf}),`<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`,[sf(K(`OperatorOrFunctionDefinition`,`Recursive`))]),Junctions:Q(`AND-OR Junction`,[Y(e=>{let t=lf(e,1);e.junctions.push({kind:t.kind,column:t.beginColumn})}),K(G(Z({expansion:[`<OR>`]}),...Jf()),G(Z({expansion:[`<AND>`]}),...Jf())),Y(e=>{e.junctions.pop()})]),JuncItem:Q(`Junction Item`,[K(`<OR>`,`<AND>`),`Expression`],(e,t)=>{let n=jf(t,e.heirs[1]);return n&&`Item at ${hf(t,n.first,n.last)} is not properly indented inside conjunction or disjunction list item at ${hf(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([])}),Wf(),Gf()],(e,t)=>{let n=vf(t);n.push({node:e.heirs[0],operator:nf});let r=wf(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`),Ef,q(K(G(Z({expansion:[`PostfixOp`],semantic:df}),`PostfixOp`,Df),G(Z({expansion:[`<DOT>`],semantic:df}),`<DOT>`,Y(mf),Z({semantic:df}),`Identifier`,Y(e=>{let t=vf(e);t[t.length-1].operator!==void 0&&Sf(t,t.length),t[t.length-1]={node:gf(`RecordComponent`,[t[t.length-1].node,_f(e,2),_f(e,1)]),operator:void 0}})),G(Z({expansion:[`<LSB>`],semantic:df}),X(`function argument`),`SBracketCases`,Tf(e=>e.kind===`FcnAppl`)))),J(K(G(Z({expansion:[`InfixOp`],semantic:df}),`InfixOp`,Df,Wf(),Gf()),G(Z({expansion:[`<COLONCOLON>`],semantic:df}),`<COLONCOLON>`,Y(e=>{let t=vf(e);if(!Af(t[t.length-1].node))return`\`::' at ${hf(e,e.token)} does not follow a label.`;t.pop()}),`Expression`,Y(e=>{let t=vf(e),n=_f(e,1),r=t.at(-1)?.operator;if((n.kind===`InfixExpr`||n.kind===`PostfixExpr`)&&r!==void 0&&e.lastOperator!==void 0&&!bf(r,e.lastOperator)){let t=_f(e,3);return`Removing label at ${hf(e,t.first,t.last)} would change expression parsing.`}t.push({node:gf(`Label`,[_f(e,3),_f(e,2),n]),operator:void 0})}))))]),PrimitiveExp:Q(`Primitive expression`,[K(G(Z({expansion:[`String`],semantic:df}),`String`),G(Z({expansion:[`<NUMBER_LITERAL>`],semantic:df}),`Number`),G(K(`Identifier`,G(K(`<ProofStepLexeme>`,`<ProofImplicitStepLexeme>`),Y(e=>Ff(e)<0&&e.proofLevels.length<=1?`${hf(e,e.token)}: Step number used outside proof.`:e.token.image[1]===`+`?`${hf(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:kf(e.heirs)===void 0?e.heirs.length===1?gf(`GeneralId`,e.heirs):void 0:gf(`OpApplication`,e.heirs)}),BangExt:Q(`Bang Extension`,[`<BANG>`,K(G(K(G(Z({expansion:[`Identifier`],semantic:e=>lf(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=>lf(e,1).image===`@`}),`<IDENTIFIER>`))],(e,t)=>{let n=e.heirs[0];return n.kind===`Number`&&n.heirs.length>1?`Illegal structural term at ${hf(t,n.first,n.last)}`:void 0}),OpenStart:Q(void 0,[K(`<CASE>`,`<CHOOSE>`,`<EXISTS>`,`<FORALL>`,`<IF>`,`<LET>`,`<T_EXISTS>`,`<T_FORALL>`)])},$f=/* @__PURE__ */ new Map,ep=e=>{let t=$f.get(e);if(t)return t;let n={first:/* @__PURE__ */ new Set,isNullable:!0,hasSemanticStart:!1},r=e=>{let t=ep(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,ep(Qf[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 $f.set(e,n),n},tp=(e,t)=>{e.isLookingAhead=!0;let n=t(e);return e.isLookingAhead=!1,n},np=(e,t)=>{if(e.scanPosition===e.lastPosition&&(e.remaining--,e.lastPosition=cf(e,e.scanPosition)),e.scanPosition=cf(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`},rp=(e,t)=>{if(t.type===`tokens`)return np(e,t.kinds);if(t.type===`call`)return rp(e,Qf[t.name].body);if(t.type===`action`)return`matched`;if(t.type===`lookahead`)return t.semantic===void 0||tp(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=rp(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||tp(e,t.semantic)?rp(e,r):`failed`;if(i!==`failed`)return i;e.scanPosition=n}return`failed`}let r=rp(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=rp(e,t.body);if(r===`done`)return r;if(r===`failed`)return e.scanPosition=n,`matched`}},ip=(e,t,n)=>{e.remaining=t,e.scanPosition=e.token,e.lastPosition=e.token;let r=rp(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},ap=(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||ep(a).isNullable?o===void 0||o(e):i===1&&o===void 0&&!ep(a).hasSemanticStart?ep(a).first.has(lf(e,1).kind)?!0:(e.failedSwitchGeneration=e.generation,!1):ip(e,i,a)&&(o===void 0||o(e))}),op=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,rp(e,t)===`done`)break;e.isRescanning=!1;let t=Math.max(+(e.failedSwitchGeneration===e.generation),e.farthestRescan),n=[],r=cf(e,e.token),i=r;for(let r=0;r<t;r++){if(i.kind===Wd){n.push(`<EOF>`);break}n.push(i.image),r<t-1&&(i=cf(e,i))}return`Encountered "${n.join(` `)}" at line ${r.beginLine}, column ${r.beginColumn} and token "${Ge(e.token.image)}" `},sp=(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??op(e)}\n\nResidual stack trace follows:\n${r}`,!1},cp=(e,t)=>{let n=cf(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,sp(e))},lp=(e,t)=>{let n=Qf[t];n.message!==void 0&&(e.messages.push({name:n.message,token:lf(e,1)}),e.expecting=``);let r={heirs:[],node:void 0};if(e.frames.push(r),!up(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 sp(e,i);let a=r.node??(r.heirs.length===0?void 0:gf(t,r.heirs));return a!==void 0&&e.frames.at(-1)?.heirs.push(a),!0},up=(e,t)=>{if(t.type===`tokens`)return cp(e,t.kinds);if(t.type===`call`)return lp(e,t.name);if(t.type===`action`){let n=t.run(e);return n===void 0||sp(e,n)}if(t.type===`lookahead`)return t.semantic===void 0||t.semantic(e)||sp(e);if(t.type===`sequence`)return t.units.every((t,n)=>n===0&&t.type===`lookahead`||up(e,t));if(t.type===`choice`){let n=ap(e,t.alternatives);return n===-1?sp(e):up(e,t.alternatives[n])}if(t.type===`oneOrMore`&&!up(e,t.body))return!1;if(t.type===`optional`)return ap(e,[t.body])===-1||up(e,t.body);for(;ap(e,[t.body])===0;)if(!up(e,t.body))return!1;return!0},dp=e=>{let t=Ue(e),n={kind:Wd,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:[],moduleName:void 0,junctions:[],frames:[],operatorStacks:[],lastOperator:void 0,proofLevels:[],isTerminalProof:!1,isFairnessHooked:!1,isFairnessParenthesized:[],report:void 0},i=up(r,{type:`call`,name:`CompilationUnit`});return r.lexicalError===void 0?i||r.report===void 0?void 0:`***Parse Error***\n${r.report}`:r.lexicalError},fp={low:15,high:15},pp={low:16,high:16},$=(e,t,n)=>({low:e,high:t,isAssociative:n}),mp=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)]]),hp=/* @__PURE__ */ new Set([`^+`,`^*`,`^#`]),gp=/* @__PURE__ */ new Set([`-`,`~`,`-.`]),_p=/* @__PURE__ */ new Set([`-.`,`~`,`[]`,`<>`,`ENABLED`,`UNCHANGED`,`SUBSET`,`UNION`,`DOMAIN`]),vp=/* @__PURE__ */ new Set([`-`,`~`,`/\\`,`\\/`,`SUBSET`,`UNION`,`DOMAIN`,`ENABLED`,`UNCHANGED`,`[]`,`<>`]),yp=/* @__PURE__ */ new Set([`+`,`-`,`/`,`\\X`]),bp=/* @__PURE__ */ new Set([`SUBSET`,`UNION`,`DOMAIN`,`ENABLED`,`UNCHANGED`,`[]`,`<>`,`'`,...hp]),xp=e=>e.kind===`Prime`||e.kind===`Product`||(e.kind===`And`||e.kind===`Or`)&&!e.isBulleted||e.kind===`Apply`&&(e.args.length===2?mp.has(e.operator):hp.has(e.operator)),Sp=e=>mp.has(e)||hp.has(e)||e===`-.`,Cp=(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}}},wp=/* @__PURE__ */ new Set([`<<`,`>>`,`:`,`@`,`(`]),Tp=/* @__PURE__ */ new Set([`ASSUME`,`ASSUMPTION`,`AXIOM`,`CONSTANT`,`CONSTANTS`,`COROLLARY`,`INSTANCE`,`LEMMA`,`LOCAL`,`PROPOSITION`,`RECURSIVE`,`THEOREM`,`VARIABLE`,`VARIABLES`]),Ep=/* @__PURE__ */ new Set([`THEOREM`,`LEMMA`,`COROLLARY`,`PROPOSITION`]),Dp=/* @__PURE__ */ new Set([`BY`,`PROOF`,`OBVIOUS`,`OMITTED`]),Op=/* @__PURE__ */ new Set([`Qed`,`Pick`,`Case`,`Assert`]),kp=/* @__PURE__ */ new Set(/* @__PURE__ */ `, . _ ( ) [ ] { } << >> ]_ >>_ == ! @ : :: ; -> <- |-> \\A \\AA \\E \\EE \\forall \\exists WF_ SF_ (*{ }*)`.split(` `)),Ap=/* @__PURE__ */ new Set([``,`*`,`-`]),jp=/* @__PURE__ */ new Set([`CASE`,`CHOOSE`,`DOMAIN`,`ENABLED`,`IF`,`LAMBDA`,`LET`,`MODULE`,`SF_`,`SUBSET`,`UNCHANGED`,`UNION`,`WF_`]),Mp=/* @__PURE__ */ new Map([[`CONSTANT`,`Constant`],[`CONSTANTS`,`Constant`],[`VARIABLE`,`Variable`],[`VARIABLES`,`Variable`],[`STATE`,`State`],[`ACTION`,`Action`],[`ACTIONS`,`Action`],[`TEMPORAL`,`Temporal`],[`TEMPORALS`,`Temporal`]]),Np=/* @__PURE__ */ new Set([`NEW`,...Mp.keys()]),Pp=/* @__PURE__ */ new Set([`(`,`[`,`{`,`<<`]),Fp=/* @__PURE__ */ new Set([`)`,`]`,`}`,`>>`,`]_`,`>>_`]),Ip=/* @__PURE__ */ new Set([`TRUE`,`FALSE`,`BOOLEAN`,`STRING`]),Lp=(e,t)=>{let n=RegExp(`^-{4,}\\s*MODULE\\s+${t}\\s*-{3,}$`),r=e.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(`
|
|
466
|
+
`)}\n`},Rp=(e,t)=>{let n=t===`tlapm`,r=n?xe(e):xe(e).map(ye),i={index:0,offsideColumns:[]},a={},o=[],s=/* @__PURE__ */ new Set,c=[],l=[],d=e=>o[o.length-1].has(e),f=e=>({line:e.line,column:n&&e.kind===`String`?e.endColumn:e.column,range:void 0}),m=[],h=[],_=[],v=(e,t=i.index-1)=>{let n=e===t?_[e]:void 0;if(n)return n;let a=r[t];m[e]??=f(r[e]),h[t]??={line:a.line,column:a.endColumn};let o={module:l[0].name,start:m[e],end:h[t]};return e===t&&(_[e]=o),o},y=(e,t)=>(e.location.range=v(t),e),b=(e=0)=>r[Math.min(i.index+e,r.length-1)],x=(e=0)=>{let t=b(e),n=i.offsideColumns[i.offsideColumns.length-1];return n===void 0||n===-1||t.kind===`End`?t:t.column<=n?{...t,kind:`End`,text:``}:t},ee=e=>e.kind===`End`?`end of input`:JSON.stringify(e.text),te={index:0},S=e=>{let t=r.slice(te.index,i.index).find(e=>e.text===`==`&&e.kind!==`String`);return t?{line:t.line,column:t.endColumn+1}:e},ne=e=>n&&(e.kind===`Keyword`||Ip.has(e.text)),re=e=>{let t=r.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},ie=e=>/^-{4,}$/.test(e.text)?`----`:/^={4,}$/.test(e.text)?`====`:kp.has(e.text)||e.kind===`Number`||e.kind===`Decimal`?e.text:e.kind===`String`?JSON.stringify(e.text):ne(e)?`keyword ${e.text}`:e.kind===`Identifier`?`identifier ${e.text}`:`operator ${e.text}`,C=(e,t=b(),n)=>{let i=r[r.length-1],a=t.line===i.line&&t.column===i.column;return new u(`${e} at line ${t.line}, column ${t.column}`,void 0,ae(e,t,a,n))},ae=(e,t,i,a)=>{if(n&&i){let e=r[r.length-1];return{reason:`Unexpected EOF`,...S(re(e)),isEnd:i}}return n&&a?{reason:`Unexpected ${ie(a)}`,...re(a),isEnd:i}:{reason:e,line:t.line,column:t.column,isEnd:i}},oe=(e,t=b())=>C(e,t,t),se=e=>(e.kind===`Identifier`||e.kind===`Keyword`||e.kind===`Operator`&&e.text===`_`)&&!ne(e),w=(e,t=0)=>{let n=x(t);return n.text===e&&n.kind!==`String`&&n.kind!==`End`},T=()=>{let e=x();if(e.kind===`End`)throw C(`Unexpected end of expression`);return i.index++,e},E=e=>w(e)?(i.index++,!0):!1,D=e=>{if(!w(e))throw oe(`Expected ${JSON.stringify(e)} but found ${ee(x())}`);return T()},ce=()=>{let e=x();if(e.kind!==`Identifier`)throw oe(`Expected an identifier but found ${ee(e)}`);if(ne(e))throw oe(`Unexpected keyword ${e.text}`);return i.index++,e.text},le=()=>{let e=i.index;return{name:ce(),range:v(e)}},ue=e=>({names:e.map(e=>e.name),ranges:e.map(e=>e.range)}),de=()=>{let e=x();return e.kind!==`String`&&(_p.has(e.text)||mp.has(e.text)||hp.has(e.text)||e.text===`'`)?(i.index++,e.text):ce()},fe={isUsed:!1},me=()=>x().kind===`Identifier`||!se(x())?ce():(fe.isUsed=!0,T().text),he=e=>{if(!n)return e();i.offsideColumns.push(-1);let t=e();return i.offsideColumns.pop(),t},O=(e,t=`,`)=>{let n=[e()];for(;E(t);)n.push(e());return n},ge=()=>{if(w(`<<`)){let e={value:1};for(;x(e.value).kind===`Identifier`||w(`,`,e.value);)e.value++;return w(`>>`,e.value)&&w(`\\in`,e.value+1)}let e={value:0};for(;x(e.value).kind===`Identifier`;){if(w(`\\in`,e.value+1))return!0;if(!w(`,`,e.value+1))return!1;e.value+=2}return!1},_e=()=>{if(w(`::`))return!0;if(!w(`(`))return!1;let e={value:1};for(;x(e.value).kind===`Identifier`&&w(`,`,e.value+1);)e.value+=2;return x(e.value).kind===`Identifier`&&w(`)`,e.value+1)&&w(`::`,e.value+2)},ve=()=>{if(!E(`<<`)){let e=le();return{kind:`Name`,name:e.name,ranges:[e.range]}}let e=ue(O(le));return D(`>>`),{kind:`Tuple`,names:e.names,ranges:e.ranges}},be=()=>O(()=>{let e=O(ve);D(`\\in`);let t=j();return e.map(e=>({pattern:e,set:t}))}).flat(),Se=()=>{let e=x();if(e.kind===`Identifier`){let t=i.index,n=[T().text];for(;w(`!`)&&x(1).kind===`Identifier`;)T(),n.push(ce());return y({kind:`Identifier`,name:n.join(`!`),location:f(e)},t)}if(w(`<<`)||w(`(`))return Fe();throw oe(`Expected a subscript but found ${ee(e)}`)},Ce=e=>{let t=x(1),n=x(2);return t.kind===`Identifier`&&n.text===`==`?!0:t.line===e.line?!1:t.text===`-.`||t.kind===`Identifier`&&(n.text===`(`||n.text===`[`||n.kind===`Operator`&&w(`==`,hp.has(n.text)?3:4))},we=e=>{let t=x(1);return t.kind===`End`||t.kind===`ModuleEnd`||t.kind===`Separator`||w(`,`,1)||w(`)`,1)||t.kind===`Keyword`&&Tp.has(t.text)||Ce(e)},k=()=>{let e=x(),t=e.kind===`Operator`&&(mp.has(e.text)||gp.has(e.text))&&we(e);if(n&&e.kind!==`String`&&(gp.has(e.text)||bp.has(e.text)&&e.text!==`'`&&!hp.has(e.text)||yp.has(e.text)&&x(-1).text===`(`&&x(-1).line===e.line&&x(-1).endColumn+1===e.column&&x(1).text===`)`&&x(1).line===e.line&&x(1).column===e.endColumn+1)&&we(e))throw C(`incomplete expression`,e);if(t)return i.index++,y({kind:`OperatorReference`,operator:e.text,spelling:e.spelling,location:f(e)},i.index-1);if(e.kind!==`String`&&bp.has(e.text)&&we(e)){i.index++;let t=f(e);if(hp.has(e.text))return y({kind:`OperatorReference`,operator:e.text,spelling:e.spelling,location:t},i.index-1);let n={kind:`Identifier`,name:`argument`,location:t};return y({kind:`Lambda`,params:[n.name],body:Cp(e.text,n,t),operator:e.text,location:f(e)},i.index-1)}if(w(`LAMBDA`)){let t=i.index;T();let n=ue(O(le));D(`:`);let r=j();return y({kind:`Lambda`,params:n.names,paramRanges:n.ranges,body:r,location:f(e)},t)}return j()},Te={range:void 0},A=()=>he(()=>{let e=i.index;D(`(`);let t=O(k);return D(`)`),Te.range=v(e),t}),Ee=()=>{let e=T();i.offsideColumns.push(e.column);let t=[j()];for(;b().text===e.text&&b().column===e.column;)i.index++,t.push(j());return i.offsideColumns.pop(),{kind:e.text===`/\\`?`And`:`Or`,operands:t,isBulleted:!0,location:f(e)}},De=e=>he(()=>{let t=f(e),r=x().kind===`Identifier`,a=w(`|->`,1)&&(r||se(x()));if(a||r&&w(`:`,1)){let e=a?`Record`:`RecordSet`,n=e=>{let t=i.index,n=f(x()),r=e();return n.range=v(t),D(a?`|->`:`:`),{name:r,value:j(),location:n}},o=[n(()=>r?ce():T().text),...E(`,`)?O(()=>n(ce)):[]];return D(`]`),{kind:e,fields:o,location:t}}if(ge()){let e=be();D(`|->`);let n=j();return D(`]`),{kind:`FunctionConstruction`,bounds:e,body:n,location:t}}let o=j();if(E(`->`)){let e=j();return D(`]`),{kind:`FunctionSet`,domain:o,range:e,location:t}}if(E(`EXCEPT`)){let e=O(()=>{D(`!`);let e=[];for(;w(`.`)||w(`[`);)if(E(`.`)){if(!se(x()))throw oe(`Expected a field name but found ${ee(x())}`);e.push({kind:`Field`,name:T().text})}else D(`[`),e.push({kind:`Index`,args:O(()=>j())}),D(`]`);return D(`=`),{path:e,value:j()}});return D(`]`),{kind:`Except`,function:o,updates:e,location:t}}if(!n&&!w(`]_`)){let e=[o];for(;E(`,`);)e.push(j());return D(`]`),{kind:`Bracket`,args:e,location:t}}return D(`]_`),{kind:`BoxAction`,action:o,subscript:Se(),location:t}}),Oe=()=>{let e=i.index,t=y(Le(),e),n=f(T());return y({kind:`Apply`,operator:`\\in`,args:[t,j()],location:n},e)},ke=e=>he(()=>{let t=f(e);if(E(`}`))return{kind:`SetEnumeration`,elements:[],location:t};if(ge()&&(x(1).text===`\\in`||w(`<<`))){let e=i.index,n=ve();D(`\\in`);let r=j();if(E(`:`)){let e=j();return D(`}`),{kind:`SetFilter`,bound:{pattern:n,set:r},predicate:e,location:t}}i.index=e}let n=x().kind===`Identifier`&&w(`\\in`,1)?Oe():j();if(E(`:`)){let e=be();return D(`}`),{kind:`SetMap`,expression:n,bounds:e,location:t}}let r=[n];for(;E(`,`);)r.push(j());return D(`}`),{kind:`SetEnumeration`,elements:r,location:t}}),Ae=e=>{let t=f(e),n=he(()=>w(`>>`)||w(`>>_`)?[]:O(()=>j()));if(E(`>>_`)){if(n.length!==1)throw C(`Expected a single action inside <<A>>_v`,e);return{kind:`AngleAction`,action:n[0],subscript:Se(),location:t}}return D(`>>`),{kind:`Tuple`,elements:n,location:t}},je=e=>{let t=f(e),n=e.text===`\\A`?`Forall`:`Exists`,r=e.text===`\\AA`||e.text===`\\EE`;if(!r&&ge()){let e=be();return D(`:`),{kind:n,bounds:e,body:j(),location:t}}let i=ue(O(le));return D(`:`),{kind:`UnboundedQuantifier`,quantifier:e.text===`\\A`||e.text===`\\AA`?`Forall`:`Exists`,names:i.names,nameRanges:i.ranges,body:j(),isTemporal:r,location:t}},Me=e=>{let t=[];do{if(E(`OTHER`))return D(`->`),{kind:`Case`,arms:t,other:j(),location:f(e)};let n=j();D(`->`),t.push({condition:n,body:j()})}while(E(`[]`));return{kind:`Case`,arms:t,other:void 0,location:f(e)}},Ne=()=>{let e=x(1);return w(`!`)&&(e.kind===`Identifier`||e.kind===`Number`||wp.has(e.text)||e.kind===`Operator`&&(mp.has(e.text)||hp.has(e.text)||gp.has(e.text)))},Pe=()=>{let e=T();if(e.kind===`Number`)return{kind:`Operand`,operand:pe(e.text)};switch(e.text){case`<<`:case`>>`:return{kind:`Operand`,operand:e.text};case`:`:return{kind:`Colon`};case`@`:return{kind:`At`};case`(`:return i.index--,{kind:`Bound`,args:A()}}return{kind:`Name`,name:e.text,args:w(`(`)?A():[]}},Fe=e=>{let t=i.index,r=T(),s=f(r);if(n&&r.kind===`Keyword`&&r.text===`LAMBDA`){let e=O(ce);return D(`:`),{kind:`Lambda`,params:e,body:j(),location:s}}if(r.kind===`Number`){if(n&&/^\\[BOH]/.test(r.text))throw C(`incomplete expression`,r);return{kind:`Number`,value:pe(r.text),text:r.text,location:s}}if(r.kind===`Decimal`)return{kind:`Decimal`,text:r.text,location:s};if(r.kind===`String`)return{kind:`String`,value:r.text,location:s};let c=r.kind===`Step`&&et(r);if(c&&Ze()<0&&Xe.length<=1)throw C(`Step number used outside proof`,r);if(c&&r.text[1]===`+`)throw C(`<+> step number used in an expression`,r);if(r.kind===`Identifier`||c){let o=c?tt(r)??r.text:r.text;if(_e()){let t=ue(E(`(`)?O(le):[]);t.names.length>0&&D(`)`),D(`::`);let i=j();if(!n&&e!==void 0&&a.last!==void 0&&xp(i)&&e.high>=a.last.low)throw C(`Removing the label would change expression parsing`,r);return{kind:`Label`,name:o,params:t.names,paramRanges:t.ranges,body:i,location:s}}let l=w(`(`);if(o===`@`&&!l&&!Ne())return{kind:`ExceptAt`,location:s};let u=l?A():[],d=[l?Te.range:void 0];if(!Ne())return l?{kind:`Apply`,operator:o,args:u,argumentsRange:Te.range,location:s}:{kind:`Identifier`,name:o,location:s};let f=[{kind:`Name`,name:o,args:u}],p=[v(t,t)];for(;Ne();)T(),p.push(v(i.index,i.index)),Te.range=void 0,f.push(Pe()),d.push(Te.range);let m=f.flatMap(e=>e.kind===`Name`?[e.name]:[]),h=m.join(`!`),g=f.flatMap(e=>`args`in e?e.args:[]),_=f.map(e=>`args`in e?e.args.length:0),y=d.at(-1)??v(t);return m.length<f.length?{kind:`Subexpression`,selectors:f,selectorRanges:p,argumentRanges:d,location:s}:g.length===0?{kind:`Identifier`,name:h,selectorRanges:p,location:s}:_.slice(0,-1).some(e=>e>0)?{kind:`Apply`,operator:h,args:g,argumentCounts:_,argumentsRange:y,selectorRanges:p,argumentRanges:d,location:s}:{kind:`Apply`,operator:h,args:g,argumentsRange:y,selectorRanges:p,argumentRanges:d,location:s}}if(r.kind===`Operator`&&Sp(r.text)&&w(`(`))return{kind:`Apply`,operator:r.text,spelling:r.spelling,args:A(),location:s};if(r.kind===`Operator`&&Sp(r.text)&&!n)return{kind:`Identifier`,name:r.text,spelling:r.spelling,location:s};switch(r.text){case`(`:{let e=he(()=>j());return D(`)`),e}case`[`:return De(r);case`{`:return ke(r);case`<<`:return Ae(r);case`@`:return{kind:`ExceptAt`,location:s};case`\\A`:case`\\E`:case`\\AA`:case`\\EE`:return je(r);case`IF`:{let e=j();D(`THEN`);let t=j();return D(`ELSE`),{kind:`If`,condition:e,consequent:t,alternative:j(),location:s}}case`CASE`:return Me(r);case`LET`:{let e=[],t=[];for(o.push(/* @__PURE__ */ new Set);!E(`IN`);){if(n&&w(`RECURSIVE`))throw C(`Unexpected keyword RECURSIVE`,S(b()));if(E(`RECURSIVE`)){qe();continue}let r=Be(!1);r.kind===`Instance`?t.push(r):e.push(r)}o.pop();let r=j();return t.length===0?{kind:`Let`,definitions:e,body:r,location:s}:{kind:`Let`,definitions:e,instances:t,body:r,location:s}}case`CHOOSE`:{let e=ve(),t=E(`\\in`)?j():void 0;return D(`:`),{kind:`Choose`,pattern:e,set:t,body:j(),location:s}}case`WF_`:case`SF_`:{let e=Se(),t=he(()=>{D(`(`);let e=j();return D(`)`),e});return{kind:r.text===`WF_`?`WeakFairness`:`StrongFairness`,subscript:e,action:t,location:s}}}throw oe(`Unexpected ${ee(r)}`,r)},Ie=(e,t,r)=>{a.last=a.preceding={low:t,high:r};let i=j(r+1),o=x(),s=o.text===`'`||hp.has(o.text)?fp.high:mp.get(o.text)?.high;if(!n&&o.kind===`Operator`&&s!==void 0&&s>=t)throw C(`Precedence conflict between ${e.text} and ${o.text}`,o);return i},Le=()=>{let e=a.preceding;a.preceding=void 0;let t=x(),r=f(t);if(t.kind===`Operator`&&(t.text===`/\\`||t.text===`\\/`))return Ee();if(t.kind===`Operator`||t.kind===`Keyword`)switch(t.text){case`~`:return T(),{kind:`Apply`,operator:`~`,args:[Ie(t,4,4)],location:r};case`-`:return T(),{kind:`Apply`,operator:`-.`,args:[Ie(t,12,12)],location:r};case`[]`:return T(),{kind:`Always`,expression:Ie(t,4,15),location:r};case`<>`:return T(),{kind:`Eventually`,expression:Ie(t,4,15),location:r};case`ENABLED`:return T(),{kind:`Enabled`,expression:Ie(t,4,15),location:r};case`UNCHANGED`:return T(),{kind:`Unchanged`,expression:Ie(t,4,15),location:r};case`SUBSET`:case`UNION`:case`DOMAIN`:return T(),{kind:`Apply`,operator:t.text,args:[n?j(9):Ie(t,10,13)],location:r}}return Fe(e)},j=(e=0)=>{let t=i.index,n=Le(),r={left:n.location.range?n:y(n,t),previous:void 0};for(;;){let n=x();if(n.kind!==`Operator`)break;let i=f(n);if(n.text===`'`&&e<=15){T(),a.last=fp,r.left=y({kind:`Prime`,expression:r.left,location:i},t);continue}if(hp.has(n.text)&&e<=15){T(),a.last=fp,r.left=y({kind:`Apply`,operator:n.text,spelling:n.spelling,args:[r.left],location:i},t);continue}if(n.text===`[`){T();let e=he(()=>O(()=>j()));he(()=>D(`]`)),a.last=pp,r.left=y({kind:`FunctionApplication`,function:r.left,args:e,location:i},t);continue}if(n.text===`.`&&se(x(1))){T();let e=T().text;r.left=y({kind:`FieldAccess`,record:r.left,field:e,location:i},t);continue}let o=mp.get(n.text);if(!o||o.low<e)break;let s=r.previous;if(s){let e=!(s.low>o.high||s.high<o.low),t=s.text===n.text&&o.isAssociative;if(e&&!t&&(s.text!==`\\X`||n.text!==`\\X`))throw C(`Precedence conflict between ${s.text} and ${n.text}`,n)}if(T(),o.low>12&&w(`-`))throw C(`Precedence conflict between ${n.text} and -`,x());a.last=a.preceding=o;let c=j(o.high+1),l=r.left;if(n.text===`/\\`||n.text===`\\/`){let e=n.text===`/\\`?`And`:`Or`,a=[v(t).end];r.left=l.kind===e&&s?.text===n.text?{...l,operands:[...l.operands,c],prefixEnds:[...l.prefixEnds??[],...a]}:{kind:e,operands:[l,c],prefixEnds:a,location:i}}else r.left=n.text===`\\X`?l.kind===`Product`&&s?.text===`\\X`?{...l,factors:[...l.factors,c]}:{kind:`Product`,factors:[l,c],location:i}:{kind:`Apply`,operator:n.text,spelling:n.spelling,args:[l,c],location:i};r.left=y(r.left,t),r.previous={...o,text:n.text}}return r.left},Re=()=>{if(!E(`(`))return[];let e=Ke();return D(`)`),e},ze=()=>{let e=f(x()),t=j(),n=r[i.index-1],a={line:n.line,column:n.endColumn};return{body:t,bodyRange:{module:l[0].name,start:e,end:a}}},Be=e=>{let t=i.index;return y(He(e),t)},Ve=e=>({name:e.name,arity:0,location:{line:e.range.start.line,column:e.range.start.column,range:e.range}}),He=e=>{let t=x(),n=f(t),r=(t,r)=>({kind:`Operator`,name:t,params:r,...ze(),isLocal:e,isRecursive:d(t),location:n});if(t.kind===`Identifier`&&x(1).kind===`Operator`&&mp.has(x(1).text)&&x(2).kind===`Identifier`&&w(`==`,3)){let e=le(),t=T().text,n=le();return D(`==`),r(t,[Ve(e),Ve(n)])}let a=t.kind!==`String`&&_p.has(t.text),o=t.kind===`Identifier`&&hp.has(x(1).text)&&w(`==`,2);if(a||o){let e=a?t.text:x(1).text;a&&T();let n=le();return o&&T(),D(`==`),r(e,[Ve(n)])}let s=ce();if(E(`[`)){let t=he(()=>be());return D(`]`),D(`==`),{kind:`Function`,name:s,bounds:t,body:j(),isLocal:e,isRecursive:d(s),location:n}}let c=i.index,l=Re();return D(`==`),w(`INSTANCE`)?{...Ue(s,l,e,n),definitionRange:v(c)}:r(s,l)},Ue=(e,t,n,r)=>{let a=i.index;return D(`INSTANCE`),{kind:`Instance`,name:e,params:t,module:me(),substitutions:E(`WITH`)?O(()=>{let e=i.index,t=de(),n=v(e);return D(`<-`),{name:t,nameRange:n,expression:k()}}):[],isLocal:n,location:r,instanceRange:v(a)}},We=()=>{let e=i.index;return y(Ge(),e)},Ge=()=>{let e=f(x());if(w(`_`)&&x(1).kind===`Operator`)return T(),{name:T().text,arity:E(`_`)?2:1,location:e};if(x().kind===`Operator`&&w(`_`,1)){let t=T().text;return T(),{name:t===`-`?`-.`:t,arity:1,location:e}}let t=ce();if(!E(`(`))return{name:t,arity:0,location:e};let n=O(()=>D(`_`));return D(`)`),{name:t,arity:n.length,location:e}},Ke=()=>O(We),qe=()=>{let e=Ke();return e.forEach(e=>o[o.length-1].add(e.name)),e},Je=e=>{let t={value:0,offset:e};do{let e=x(t.offset);if(e.kind===`End`)return t.offset;e.kind===`Operator`&&Pp.has(e.text)&&t.value++,e.kind===`Operator`&&Fp.has(e.text)&&t.value--,t.offset++}while(t.value>0);return t.offset},Ye=()=>{let e=x(),t=x(1);return e.kind===`Identifier`?w(`(`,1)||w(`[`,1)?w(`==`,Je(1)):t.kind===`Operator`&&hp.has(t.text)?w(`==`,2):t.kind===`Operator`&&mp.has(t.text)?x(2).kind===`Identifier`&&w(`==`,3):w(`==`,1):e.kind!==`String`&&_p.has(e.text)&&t.kind===`Identifier`&&w(`==`,2)},Xe=[],Ze=()=>Xe[Xe.length-1]??-1,Qe=e=>e.text[1]===`*`?-1:e.text[1]===`+`?-2:Number(e.text.slice(1,e.text.indexOf(`>`))),$e=e=>{let t=e.text.slice(e.text.indexOf(`>`)+1),n={value:t.length};for(;t[n.value-1]===`.`;)n.value--;return t.slice(0,n.value)},et=e=>!e.text.endsWith(`.`)&&!Ap.has($e(e)),tt=e=>{let t=$e(e);if(Ap.has(t))return;let n=Qe(e);if(n>=0)return`<${n}>${t}`;let r=Ze(),i=Xe[Xe.length-2];return`<${r<0&&i!==void 0?i:r}>${t}`},nt=e=>{if(e.kind===`Keyword`)return Dp.has(e.text);if(e.kind!==`Step`)return!1;if(e.text[1]===`*`)return Xe.length===0;if(e.text[1]===`+`||Xe.length===0)return!0;let t=Ze();return t>=0&&Qe(e)>t},rt=e=>{let t=Qe(e),n=Xe.length-1,r=Xe[n-1]??-1,i=Xe[n]<0;return i&&(Xe[n]=t<0?r+1:t),t===-1?!0:t===-2?i:i?t>r:Xe[n]===t},it=e=>!s.has(e)&&l.some(t=>t.constants.some(t=>t.name===e)||t.variables.some(t=>t.name===e)||t.definitions.some(t=>t.name===e)),M=e=>e.kind===`ModuleFact`||e.kind===`Subexpression`?!0:e.kind===`Apply`?e.operator.includes(`!`):e.kind===`Identifier`?e.name.startsWith(`<`)||e.name.includes(`!`)?!0:!Ip.has(e.name)&&!it(e.name):!1,at=()=>{let e=x();return e.kind===`Step`?et(e):e.kind===`Keyword`?jp.has(e.text):e.kind===`End`||e.kind===`ModuleEnd`||e.kind===`Separator`?!1:!Ye()},ot=()=>{let e=i.index,t=x();return t.kind===`Operator`&&!vp.has(t.text)&&Sp(t.text)?(i.index++,y({kind:`OperatorReference`,operator:t.text,spelling:t.spelling,location:f(t)},e)):E(`MODULE`)?y({kind:`ModuleFact`,name:ce(),location:f(t)},e):j()},st=e=>c[c.length-1]?.add(e),ct=e=>{c.push(/* @__PURE__ */ new Set);let t=e();return c.pop(),t},N=e=>c.some(t=>t.has(e))||l.some(t=>t.constants.some(t=>t.name===e)||t.variables.some(t=>t.name===e)),P=()=>{let e=i.index,t=x(),n=O(()=>{let e=x();if((e.kind!==`Identifier`||ne(e))&&e.kind!==`Operator`)throw oe(`Expected a definition name but found ${ee(e)}`,e);return i.index++,e.text},`!`),r=f(t);return y(n.length===1&&t.kind===`Operator`?{kind:`OperatorReference`,operator:t.text,location:r}:{kind:`Identifier`,name:n.join(`!`),location:r},e)},lt=()=>{if(n)return O(P);let e=O(ot),r=t===`tlc`?e.find(e=>e.kind===`Identifier`&&N(e.name)):void 0;if(r)throw C(`DEF clause entry should describe a defined operator`,r.location);return e},F=()=>({facts:at()?O(ot):[],defs:E(`DEF`)||E(`DEFS`)?lt():[]}),I=()=>{let e=i.index,n=T(),r=n.text===`USE`&&E(`ONLY`),a=v(e),o={kind:n.text===`USE`?`Use`:`Hide`,isOnly:r,...F(),keyword:a,location:f(n)},s=o.kind===`Hide`&&t===`tlc`?o.facts.filter(e=>!M(e)):[];if(s.length>0)throw p(s.map(t=>({location:g(t.location.range??v(e)),message:`The only expression allowed as a fact in a HIDE is
|
|
467
|
+
the name of a theorem, assumption, or step.`})));return y(o,e)},ut=()=>{let e=i.index,t=f(x()),n=E(`NEW`),r=x().kind===`Keyword`?Mp.get(x().text):void 0;if(!n&&r===void 0)throw oe(`Expected a declaration but found ${ee(x())}`);if(r!==void 0&&T(),r===`Variable`){let n=le();return st(n.name),y({kind:`NewSymbol`,name:n.name,arity:0,level:r,set:void 0,nameRange:n.range,location:t},e)}let a=We();st(a.name);let o=(r??`Constant`)===`Constant`&&w(`\\in`);if(o&&a.arity>0)throw C(`declared symbol with arguments before \\in`);return o&&T(),y({kind:`NewSymbol`,name:a.name,arity:a.arity,level:r??`Constant`,set:o?j():void 0,nameRange:a.location.range,location:t},e)},dt=()=>{let e=i.index,t=f(D(`ASSUME`)),n=O(()=>w(`ASSUME`)?ct(dt):x().kind===`Keyword`&&Np.has(x().text)?ut():j());return D(`PROVE`),y({kind:`AssumeProve`,assumptions:n,conclusion:j(),location:t},e)},ft=e=>{let t={value:0};for(;x(t.value).kind===`Identifier`&&w(`,`,t.value+1);)t.value+=2;return x(t.value).kind===`Identifier`&&w(e,t.value+1)},pt=(e,t)=>{e.forEach(st),t.forEach(e=>(e.pattern.kind===`Name`?[e.pattern.name]:e.pattern.names).forEach(st))},mt=()=>{let e=x();if(w(`USE`)||w(`HIDE`))return I();if(w(`INSTANCE`)){let t=i.index;return y(Ue(void 0,[],!1,f(e)),t)}if(w(`DEFINE`)||Ye()){let t=i.index;E(`DEFINE`);let n=[Be(!1)];for(;Ye();)n.push(Be(!1));let r={kind:`Define`,definitions:n,location:f(e)};return y(r,t)}if(E(`HAVE`))return{kind:`Have`,expression:j()};if(E(`TAKE`)){let e=ge(),t=ue(e?[]:O(le)),n=e?be():[];return pt(t.names,n),{kind:`Take`,names:t.names,nameRanges:t.ranges,bounds:n}}if(E(`WITNESS`))return{kind:`Witness`,expressions:O(()=>j())};if(E(`PICK`)){let e=ft(`:`),t=ue(e?O(le):[]),n=e?[]:be();return pt(t.names,n),D(`:`),{kind:`Pick`,names:t.names,nameRanges:t.ranges,bounds:n,body:j()}}return E(`CASE`)?{kind:`Case`,expression:j()}:{kind:`Assert`,isSuffices:E(`SUFFICES`),statement:w(`ASSUME`)?dt():j()}},ht=e=>{let t=x();if(t.kind!==`Step`)throw oe(`Expected a step number but found ${ee(t)}`,t);if(!rt(t))throw C(`${e?`QED step`:`step`}'s number has bad level`,t);if(Qe(t)<0&&tt(t)!==void 0)throw C(`<*> and <+> cannot be used for a named step`,t);return i.index++,{name:tt(t),token:t.text,location:f(t)}},gt=()=>{let e=i.index,t=ht(w(`QED`,1)),n=i.index,r=/* @__PURE__ */ new Set;c.push(r);let a=E(`QED`)?{kind:`Qed`}:mt(),o=v(e),s=v(n),l=nt(x());if(l&&!Op.has(a.kind))throw C(`Proof of a step that does not take a proof`);let u=l?vt():void 0;return c.pop(),(a.kind!==`Assert`||a.isSuffices)&&r.forEach(st),y({...t,body:a,head:o,statement:s,proof:u},e)},_t=()=>{let e=f(x());if(w(`BY`)||w(`PROOF`)&&w(`BY`,1)){E(`PROOF`),T();let t=v(i.index-1);return{kind:`By`,isOnly:E(`ONLY`),...F(),keyword:t,location:e}}let t=x(+!!w(`PROOF`));if(t.kind===`Keyword`&&(t.text===`OBVIOUS`||t.text===`OMITTED`)){E(`PROOF`),T();let n=v(i.index-1);return{kind:t.text===`OBVIOUS`?`Obvious`:`Omitted`,keyword:n,location:e}}E(`PROOF`);let n=[gt()];for(;n[n.length-1].body.kind!==`Qed`;)n.push(gt());return{kind:`Steps`,level:Ze(),steps:n,location:e}},vt=()=>{let e=i.index;Xe.push(-1);let t=ct(_t);return Xe.pop(),y(t,e)},yt=(e,t)=>{e.definitions.some(e=>e.name===t.name)||e.definitions.push(t)},bt=e=>{let t=i.index,n=T(),r=x().kind===`Identifier`&&w(`==`,1)?ce():void 0;r!==void 0&&(s.add(r),T());let a=ct(()=>({statement:w(`ASSUME`)?dt():j(),proof:nt(x())?vt():void 0})),o=a.statement,c=y({name:r,statement:o,proof:a.proof,location:f(n)},t);e.theorems.push(c),e.units.push({kind:`Theorem`,theorem:c}),r!==void 0&&o.kind!==`AssumeProve`&&yt(e,y({kind:`Operator`,name:r,params:[],body:o,isLocal:!1,isRecursive:!1,location:f(n)},t))},xt=()=>{let e=i.index;return y(St(),e)},St=()=>{let e=T(),t=f(e),n=e.text===`AXIOM`;if(x().kind===`Identifier`&&w(`==`,1)){let e=ce();return s.add(e),T(),{name:e,expression:j(),isAxiom:n,location:t}}return{name:void 0,expression:j(),isAxiom:n,location:t}},Ct=()=>{let e=f(D(`----`));D(`MODULE`);let t=me();D(`----`);let n={name:t,modules:[],extends:[],extendsRanges:[],constants:[],variables:[],definitions:[],instances:[],assumptions:[],location:e,theorems:[],uses:[],units:[]};for(l.push(n),o.push(/* @__PURE__ */ new Set),E(`EXTENDS`)&&O(()=>{let e=i.index;n.extends.push(me()),n.extendsRanges.push(v(e))});;){let t=i.index;te.index=t;let r=x();if(r.kind===`ModuleEnd`)return e.range={module:l[0].name,start:{line:e.line,column:e.column},end:{line:r.line,column:r.endColumn}},l.pop(),o.pop(),n;if(r.kind===`Separator`){if(w(`MODULE`,1)){let e=Ct();n.modules.push(e),n.units.push({kind:`Module`,module:e}),D(`====`);continue}T()}else{switch(r.text){case`CONSTANT`:case`CONSTANTS`:{let e=f(T()),r=Ke();n.constants.push(...r),e.range=v(t),n.units.push({kind:`Constants`,declarations:r,location:e});continue}case`VARIABLE`:case`VARIABLES`:{let e=f(T()),r=O(()=>{let e=i.index,t=f(x());return y({name:ce(),arity:0,location:t},e)});n.variables.push(...r),e.range=v(t),n.units.push({kind:`Variables`,declarations:r,location:e});continue}case`ASSUME`:case`ASSUMPTION`:case`AXIOM`:{let e=xt();n.assumptions.push(e),n.units.push({kind:`Assumption`,assumption:e}),e.name!==void 0&&yt(n,{kind:`Operator`,name:e.name,params:[],body:e.expression,isLocal:!1,isRecursive:!1,location:e.location});continue}case`USE`:case`HIDE`:{if(w(`USE`)&&w(`ONLY`,1))throw oe(`Expected a module unit but found ${ee(r)}`);let e=I();n.uses.push(e),n.units.push({kind:`Use`,use:e});continue}case`RECURSIVE`:T(),n.units.push({kind:`Recursive`,declarations:qe()});continue;case`INSTANCE`:wt(n,y(Ue(void 0,[],!1,f(r)),t));continue;case`LOCAL`:if(T(),w(`INSTANCE`)){wt(n,y(Ue(void 0,[],!0,f(r)),t));continue}wt(n,y(He(!0),t));continue}r.kind===`Keyword`&&Ep.has(r.text)?bt(n):wt(n,Be(!1))}}},wt=(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}))},Tt=Ct(),Et=fe.isUsed?dp(e):void 0;if(Et!==void 0)throw new u(Et);return Tt},zp=e=>Rp(e,`tlc`),Bp=e=>Rp(e,`tlapm`),Vp=e=>Rp(e,`sany`),Hp=25214903917n,Up=(1n<<48n)-1n,Wp=2147483647,Gp=e=>{let t={value:(BigInt.asUintN(64,e)^Hp)&Up},n=e=>(t.value=t.value*Hp+11n&Up,Number(BigInt.asIntN(32,t.value>>BigInt(48-e))));return{setSeed:e=>{t.value=(BigInt.asUintN(64,e)^Hp)&Up},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<=Wp)return t}},nextLong:()=>BigInt.asIntN(64,(BigInt(n(32))<<32n)+BigInt(n(32))),nextDouble:()=>(n(26)*2**27+n(27))*2**-53}},Kp=10454148508367108822n,qp=(()=>{let e=[];for(let t=1n<<63n;e.length<72;)e.push(t),t=t>>1n^((t&1n)==0n?0n:Kp);return Array.from({length:256},(t,n)=>e.slice(64,72).reverse().reduce((e,t,r)=>n>>r&1?e^t:e,0n))})(),Jp=Int32Array.from(qp,e=>Number(BigInt.asIntN(32,e>>32n))),Yp=Int32Array.from(qp,e=>Number(BigInt.asIntN(32,e))),Xp=Number(BigInt.asIntN(32,Kp>>32n)),Zp=Number(BigInt.asIntN(32,Kp));let Qp=Xp,$p=Zp;const em=e=>{let t=(e^$p)&255;$p=($p>>>8|Qp<<24)^Yp[t],Qp=Qp>>>8^Jp[t]},tm=e=>{for(let t=0;t<32;t+=8)em(e>>>t)},nm=e=>{if(typeof e==`boolean`)em(0),em(e?116:102);else if(typeof e==`number`)em(1),tm(e);else if(typeof e==`string`){em(3),tm(e.length);for(let t=0;t<e.length;t++)em(e.charCodeAt(t))}else if(I(e))em(21),tm(kt(e.name)+1);else if(F(e)){let t=Dr(e);em(9),tm(t.domain.length);for(let e=0;e<t.domain.length;e++)nm(t.domain[e]),nm(t.range[e])}else{let t=R(e).elements;em(5),tm(t.length);for(let e of t)nm(e)}},rm=e=>{let t={high:Qp,low:$p};Qp=Xp,$p=Zp;for(let t of e)nm(t);let n=BigInt(Qp>>>0)<<32n|BigInt($p>>>0);return Qp=t.high,$p=t.low,n},im=e=>{if(typeof e==`boolean`)return 2;if(typeof e==`number`||I(e))return 5;if(typeof e==`string`)return 5+e.length;if(F(e)){let t=Dr(e);return t.domain.reduce((e,n,r)=>e+im(n)+im(t.range[r]),5)}return R(e).elements.reduce((e,t)=>e+im(t),5)},am=e=>{let t=/* @__PURE__ */ new Int32Array(4096);for(let n=0;n<64;n++){Qp=n<32?0:1<<n-32,$p=n<32?1<<n:0;for(let t=0;t<e;t++)em(0);let r=n>>3,i=1<<(n&7);for(let e=i;e<2*i;e++){let n=(r*256+e)*2,a=(r*256+e-i)*2;t[n]=t[a]^Qp,t[n+1]=t[a+1]^$p}}return t},om=(e,t)=>{let n=/* @__PURE__ */ new Map,r=/* @__PURE__ */ new Map,i=[],a=e=>{let t=r.get(e);if(t!==void 0)return t;let n=im(e);return Qp=0,$p=0,nm(e),r.set(e,i.length),i.push(n,Qp,$p),i.length-3},o=e=>{let t=n.get(e);if(t)return t;let r=am(e);return n.set(e,r),r};return(n,r)=>{let s={high:Qp,low:$p},c={high:Xp,low:Zp};for(let t of e){let e=a(n[t]),r=o(i[e]),s={high:i[e+1],low:i[e+2]};for(let e=0;e<8;e++){let t=e<4?c.low:c.high,n=(e*256+(t>>>(e&3)*8&255))*2;s.high^=r[n],s.low^=r[n+1]}c.high=s.high,c.low=s.low}Qp=s.high,$p=s.low,t[2*r]=c.low,t[2*r+1]=c.high}},sm=[],cm=e=>{for(let t=2;t*t<=e;t++)if(e%t===0)return!1;return!0},lm=()=>{for(let e=1277011;sm.length<1341;e++)cm(e)&&sm.push(e);return sm},um=e=>{let t=lm(),n={index:t.length};for(;n.index===t.length;)n.index=Math.floor(e.nextDouble()*t.length);return t[n.index]},dm=e=>{let t=[],n={value:e};for(let e=2;e*e<=n.value;e++)for(;n.value%e===0;)t.push(e),n.value/=e;return n.value>1&&t.push(n.value),t},fm=e=>{for(let t=Math.max(e,9);;t++){let e=dm(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)}}},pm=(e,t,n)=>{if(t<=0)return[];let r=fm(t),i={index:BigInt(n.nextInt(t))},a=BigInt(um(n));return Array.from({length:e},()=>{do i.index=(r.multiplier*i.index+a)%r.modulus;while(i.index>=t);return i.index})},mm=(e,t,n)=>{if(t<=0)return[];let r=BigInt(t<191?191:Wp),i=BigInt(n.nextInt(t));return Array.from({length:Math.min(e,t)},(e,n)=>(r*BigInt(n)+i)%BigInt(t))},hm=(1n<<63n)-1n-24n,gm=(e,t,n)=>{let r=n.nextLong(),i=BigInt.asIntN(64,r<0n?-r:r);return Array.from({length:e},(e,n)=>{let r=(hm*BigInt(n)+i)%t;return r<0n?r+t:r})},_m=(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,vm=e=>{if(typeof e==`object`){if(e.kind===`FunctionSet`){let t=qn(e.domain),n=R(e.range).elements;return{lists:t.map(()=>n),create:e=>Bt(t,e)}}if(e.kind===`RecordSet`)return{lists:e.sets.map(e=>R(e).elements),create:t=>Xn(e.names.map((e,n)=>[e,t[n]]))};if(e.kind===`ProductSet`)return{lists:e.factors.map(e=>R(e).elements),create:Yn}}},ym=(e,t)=>t===`1.7.4`&&typeof e==`object`&&e.kind===`ProductSet`?e.factors:void 0,bm=(e,t,n,r)=>{if(pr(t))return[];let i=r===`1.7.4`?mm:pm;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=ym(t,r)?void 0:vm(t);if(a){let t=a.lists.reduce((e,t)=>e*BigInt(t.length),1n);return(t>BigInt(Wp)?gm(e,t,n):i(e,Number(t),n)).map(e=>a.create(_m(a.lists,e)))}let o=R(t).elements;return i(e,o.length,n).map(e=>o[Number(e)])},xm=(e,t)=>{let n=e[Math.floor(t.nextDouble()*e.length)];if(n===void 0)throw new y(`RandomElement of the empty set`);return n},Sm=(e,t)=>{if(typeof e==`object`&&e.kind===`FunctionSet`){let n=[...qn(e.domain)];return Bt(n,n.map(()=>Sm(e.range,t)))}if(typeof e==`object`&&e.kind===`RecordSet`)return Xn(e.names.map((n,r)=>[n,Sm(e.sets[r],t)]));if(typeof e==`object`&&e.kind===`ProductSet`)return Yn(e.factors.map(e=>Sm(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 y(`RandomElement of the empty set`);return e.low+r}return xm(R(e).elements,t)},Cm=(e,t=0n)=>{let n=Gp(t),r={random:Gp(t),state:void 0},i={isStartup:!1},a={getLevel:()=>0,getBehavior:()=>[],getSpecification:()=>Xn([]),counterExample:void 0,isSeen:()=>!1,setLivenessSource:()=>{},getCurrentState:()=>void 0,getFingerprint:rm,getRandom:()=>{let e=i.isStartup?void 0:a.getCurrentState();return e===void 0?n:(e!==r.state&&(r.random.setSeed(a.getFingerprint(e)^BigInt.asUintN(64,t)),r.state=e),r.random)},evaluateAtStartup:e=>{let t=i.isStartup;i.isStartup=!0;try{return e()}finally{i.isStartup=t}},pause:()=>{},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 a},wm=e=>zn([...e.possibleCounts].map(([e,t])=>[e,t])),Tm=e=>e.possibleCounts.size===0?e.namedRegisters:new Map([...e.namedRegisters,[`s:_possible`,wm(e)]]),Em=(e,t,n)=>new S(`Applying ${e} to the following value,\nwhich is not ${t}:\n${z(n)}`),Dm=(e,t,n,r)=>new S(`The ${e} argument of ${t} should be a ${n}, but instead it is:\n${z(r)}`),Om=e=>F(e)?Dr(e):void 0,km=(e,t,n)=>{let r=V(e,t,n),i=Om(r);if(!i)throw Em(n,`a function with a finite domain`,r);return i},Am=(e,t,n)=>{let r=V(e,t,n),i=Om(r);if(!i)throw Dm(t===0?`first`:`second`,n,`bag`,r);return i},jm=(e,t)=>{if(!P(e)||!L(e))throw t();return R(e).elements},Mm=e=>e.range.every(e=>typeof e==`number`&&e>0),Nm=(e,t)=>{let n=e.domain.findIndex(e=>Qt(e,t));return n===-1?void 0:e.range[n]},Pm=(e,t,n)=>`public static ${t} tlc2.module.Bags.${e}(${Array.from({length:n},()=>`tlc2.value.impl.Value`).join(`,`)})`,Fm=Pm(`BagDiff`,`tlc2.value.impl.Value`,2),Im=Pm(`SqSubseteq`,`tlc2.value.IBoolValue`,2),Lm=Pm(`BagUnion`,`tlc2.value.impl.Value`,1),Rm=Pm(`BagOfAll`,`tlc2.value.impl.Value`,2),zm=Pm(`BagCup`,`tlc2.value.impl.Value`,2),Bm=Pm(`BagCardinality`,`tlc2.value.impl.IntValue`,1),Vm=(e,t)=>{if(typeof e==`number`)return e;let n=`tlc2.value.impl.${Ri(e)}`;throw Bi(t,`class ${n} cannot be cast to class tlc2.value.impl.IntValue (${n} and tlc2.value.impl.IntValue are in unnamed module of loader 'app')`)},Hm=(e,t,n)=>{let r=Vm(e,n)+Vm(t,n);if(Mi(r))throw Ni(`${e}+${t}`);return r},Um=(e,t,n,r)=>{let i=Nm(n,e.domain[t]),a=Vm(e.range[t],r);return i===void 0?a:a-Vm(i,r)|0},Wm=(e,t)=>zn(e.reduce((e,n)=>(n.domain.forEach((r,i)=>{let a=e.find(e=>Qt(e[0],r));a?a[1]=Hm(a[1],n.range[i],t):e.push([r,n.range[i]])}),e),[])),Gm=Bt([],[]),Km=e=>[Oi(`EmptyBag`,Gm),H(`IsABag`,1,e=>{let t=Om(V(e,0,`IsABag`));return t!==void 0&&Mm(t)}),H(`BagCardinality`,1,e=>{let t=V(e,0,`BagCardinality`);return km(e,0,`BagCardinality`).range.reduce((e,n)=>{if(typeof n!=`number`||n<=0)throw Em(`BagCardinality`,`a bag`,t);return Hm(e,n,Bm)},0)}),H(`BagIn`,2,e=>{let t=V(e,1,`BagIn`),n=Nm(km(e,1,`BagIn`),V(e,0,`BagIn`));if(n===void 0)return!1;if(typeof n!=`number`)throw Dm(`second`,`BagIn`,`bag`,t);return n>0}),H(`CopiesIn`,2,e=>{let t=V(e,1,`CopiesIn`),n=Nm(km(e,1,`CopiesIn`),V(e,0,`CopiesIn`));if(n===void 0)return 0;if(typeof n!=`number`)throw Dm(`second`,`CopiesIn`,`bag`,t);return n}),H(`\\oplus`,2,e=>{let t=[0,1].map(t=>{let n=Am(e,t,`(+)`);if(!Mm(n))throw Dm(t===0?`first`:`second`,`(+)`,`bag`,V(e,t,`(+)`));return n});return Wm(t,zm)}),H(`\\ominus`,2,e=>{let t=Am(e,0,`(-)`),n=Am(e,1,`(-)`);return zn(t.domain.flatMap((e,r)=>{let i=Um(t,r,n,Fm);return i>0?[[e,i]]:[]}))}),H(`BagUnion`,1,e=>{let t=V(e,0,`BagUnion`),n=jm(t,()=>Em(`BagUnion`,`a finite enumerable set`,t));if(n.length<2)return n[0]??Gm;let r=n.map(e=>{let n=Om(e);if(!n)throw new S(`Attempted to apply BagUnion to the following set, whose\nelement is not a bag:\n${z(t)}`);return n});return Wm(r,Lm)}),H(`\\sqsubseteq`,2,e=>{let t=km(e,0,`\\sqsubseteq`),n=km(e,1,`\\sqsubseteq`);return t.domain.every((e,r)=>Um(t,r,n,Im)<=0)}),ki(`BagOfAll`,2,e=>{let t=Di(e,0,`BagOfAll`);if(t.literalBody!==void 0)throw new S(`The first argument of BagOfAll should be an operator, but instead it is:\n${z(t.literalBody)}`);let n=V(e,1,`BagOfAll`),r=Om(n);if(!r)throw Dm(`second`,`BagOfAll`,`function with a finite domain`,n);return Wm(r.domain.map((e,n)=>Bt([t.call([e])],[r.range[n]])),Rm)}),H(`SubBag`,1,t=>{let n=V(t,0,`SubBag`);if(!F(n))throw new y(`DOMAIN expects a function but received ${z(n)}`);let r=Dr(n),i=Nn(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 y(`Attempted to apply a function to ${z(r)}, which is not in its domain`);return Nn(r.domain.reduce((e,t,n)=>e.flatMap(e=>[e,...Array.from({length:o[n]},(n,r)=>[...e,[t,r+1]])]),[[]]).map(e=>Bt(e.map(e=>e[0]),e.map(e=>e[1]))))}),H(`BagToSet`,1,e=>Fr(km(e,0,`BagToSet`))),H(`SetToBag`,1,e=>{let t=V(e,0,`SetToBag`),n=jm(t,()=>Em(`BagToSet`,`a function with a finite domain`,t));return Bt([...n],n.map(()=>1))})],qm=`public static tlc2.value.impl.StringValue tlc2.module.Json.toJsonArray(tlc2.value.IValue) throws java.io.IOException`,Jm=`public static tlc2.value.impl.StringValue tlc2.module.Json.toJsonObject(tlc2.value.IValue) throws java.io.IOException`,Ym=`public static synchronized tlc2.value.impl.BoolValue tlc2.module.Json.serialize(tlc2.value.impl.StringValue,tlc2.value.impl.Value) throws java.io.IOException`,Xm=`public static synchronized tlc2.value.impl.BoolValue tlc2.module.Json.ndSerialize(tlc2.value.impl.StringValue,tlc2.value.impl.Value) throws java.io.IOException`,Zm=`public static tlc2.value.IValue tlc2.module.Json.deserialize(tlc2.value.impl.StringValue) throws java.io.IOException`,Qm=`public static tlc2.value.IValue tlc2.module.Json.ndDeserialize(tlc2.value.impl.StringValue) throws java.io.IOException`,$m=e=>{if(!F(e))return!1;let t=Dr(e).domain;return t.length>0&&t.every(e=>typeof e==`string`)},eh=(e,t)=>Bi(e,`Cannot convert value: unsupported value type tlc2.value.impl.${Ri(t)}`),th=(e,t)=>Bi(e,`Cannot cast tlc2.value.impl.${Ri(t)} to tlc2.value.impl.StringValue`),nh=e=>JSON.stringify(e).replaceAll(`\u2028`,`\\u2028`).replaceAll(`\u2029`,`\\u2029`),rh=(e,t)=>{if(typeof e==`object`&&(e.kind===`InfiniteSet`||e.kind===`SequenceSet`))throw eh(t,e);return`[${R(e).elements.map(e=>ah(e,t)).join(`,`)}]`},ih=(e,t)=>{let n=Dr(e),r=br(n);return r?`[${r.map(e=>ah(e,t)).join(`,`)}]`:`{${n.domain.map((e,r)=>`${nh(typeof e==`string`?e:z(e))}:${ah(n.range[r],t)}`).join(`,`)}}`},ah=(e,t)=>typeof e==`string`?nh(e):typeof e==`object`?e.kind===`ModelValue`?nh(e.name):P(e)?rh(e,t):ih(e,t):String(e),oh=e=>{if(P(e))return rh(e,qm);if(!F(e)||$m(e))throw eh(qm,e);return ih(e,qm)},sh=e=>{if(!F(e))throw eh(Jm,e);return ih(e,Jm)},ch=e=>{let[,t,n=`0`,r=``,i=`0`]=/^(-?)(\d+)(?:\.(\d*))?(?:[eE]([+-]?\d+))?$/.exec(e)??[],a=BigInt(n+r),o=Number(i)-r.length,s=o>=0?a*10n**BigInt(o):a/10n**BigInt(-o);return Number(BigInt.asIntN(32,t===`-`?-s:s))},lh=(e,t)=>{if(typeof e==`boolean`||typeof e==`number`)return e;if(typeof e==`string`)return Dt(e);if(Array.isArray(e))return Yn(e.map(e=>lh(e,t)));if(typeof e==`object`&&e)return Xn(Object.entries(e).map(([e,n])=>[Dt(e),lh(n,t)]));throw Bi(t,`Cannot convert value: unsupported JSON value ${String(e)}`)},uh=(e,t)=>{if(e.trim()===``)return lh(null,t);try{return lh(JSON.parse(e,(e,t,n)=>typeof t==`number`?ch(n?.source??String(t)):t),t)}catch(e){throw e instanceof SyntaxError?Bi(t,e.message):e}},dh=(e,t)=>{if(typeof e!=`string`)throw th(t,e);return e},fh=(e,t,n)=>{let r=e.readFile?.(t);if(r===void 0)throw Bi(n,`${t} (No such file or directory)`);return r},ph=e=>[Ai(`ToJson`,1,e=>Dt(ah(V(e,0,`ToJson`),`public static tlc2.value.impl.StringValue tlc2.module.Json.toJson(tlc2.value.IValue) throws java.io.IOException`))),Ai(`ToJsonArray`,1,e=>Dt(oh(V(e,0,`ToJsonArray`)))),Ai(`ToJsonObject`,1,e=>Dt(sh(V(e,0,`ToJsonObject`)))),Ai(`JsonSerialize`,2,t=>{let n=dh(V(t,0,`JsonSerialize`),Ym),r=V(t,1,`JsonSerialize`);if(!br(r)&&!$m(r))throw new S(`The second argument of JsonSerialize should be a sequence or record, but instead it is:\n${z(r)}`);return e.writeFile?.(n,ah(r,Ym)),!0}),Ai(`ndJsonSerialize`,2,t=>{let n=dh(V(t,0,`ndJsonSerialize`),Xm),r=V(t,1,`ndJsonSerialize`),i=br(r);if(!i)throw new S(`The second argument of ndJsonSerialize should be a sequence, but instead it is:\n${z(r)}`);return e.writeFile?.(n,i.map(e=>`${ah(e,Xm)}\n`).join(``)),!0}),Ai(`JsonDeserialize`,1,t=>{let n=dh(V(t,0,`JsonDeserialize`),Zm);return uh(fh(e,n,Zm),Zm)}),Ai(`ndJsonDeserialize`,1,t=>{let n=dh(V(t,0,`ndJsonDeserialize`),Qm);return Yn(fh(e,n,Qm).split(/\r\n|\r|\n/).map(e=>e.trim()).filter(e=>e!==``).map(e=>uh(e,Qm)))})],mh=`public static tlc2.value.impl.Value tlc2.module.Randomization.RandomSubset(tlc2.value.impl.Value,tlc2.value.impl.Value)`,hh=1e6,gh=(e,t,n,r)=>new S(`The ${e} argument of ${t} should be a ${n}, but instead it is:\n${r}`),_h=(e,t,n)=>{if(typeof e!=`number`||e<0)throw gh(t,n,`nonnegative integer`,z(e));return e},vh=(e,t,n,r)=>{if(!P(e)||!L(e))throw gh(t,n,r,z(e));return R(e).elements},yh=(e,t,n,r)=>Nn(Array.from({length:t},()=>Nn(e.filter(()=>r.nextDouble()<n)))),bh=(e,t)=>{let n=`RandomSetOfSubsets`,r=_h(V(e,0,n),`first`,n),i=_h(V(e,1,n),`second`,n),a=vh(V(e,2,n),`third`,n,`finite set`);if(a.length<31&&r>2**a.length)throw gh(`first`,n,`nonnegative integer that is smaller than the subset's size of 2^${a.length}`,String(r));if(a.length<i)throw gh(`second`,n,`nonnegative integer in range 0..Cardinality(S)`,String(i));return yh(a,r,a.length===0?0:i/a.length,t.getRandom())},xh=e=>[Ai(`RandomSubset`,2,t=>{let n=V(t,0,`RandomSubset`);if(typeof n!=`number`)throw gh(`first`,`RandomSubset`,`nonnegative integer`,z(n));if(n<0)throw Bi(mh,String(n));let r=V(t,1,`RandomSubset`);if(!P(r)||!pr(r)&&!L(r))throw gh(`second`,`RandomSubset`,`a finite set`,z(r));let i=ym(r,e.version);if(i&&i.reduce((e,t)=>e*R(t).elements.length,1)>hh)throw Bi(mh,`Attempted to construct a set with too many elements (>${hh}).`);return Nn(bm(n,r,e.getRandom(),e.version))}),Ai(`RandomSetOfSubsets`,3,t=>bh(t,e)),Ai(`TestRandomSetOfSubsets`,3,t=>Yn(Array.from({length:5},()=>R(bh(t,e)).elements.length)))],Sh=`tlc2.tool.impl.Tool,tla2sany.semantic.ExprOrOpArgNode[],tlc2.util.Context,tlc2.tool.TLCState,tlc2.tool.TLCState,int,tlc2.tool.coverage.CostModel`,Ch=`public static synchronized tlc2.value.impl.Value tlc2.module.TLCExt.assertError(${Sh})`,wh=`public static tlc2.value.impl.TupleValue tlc2.module.TLCExt.getTrace(${Sh}) throws java.io.IOException`,Th=`public static synchronized tlc2.value.impl.Value tlc2.module.TLCExt.pickSuccessor(${Sh})`,Eh=()=>Xn([[`action`,Nn([])],[`state`,Nn([])]]),Dh=()=>Xn([[`beginLine`,0],[`beginColumn`,0],[`endLine`,0],[`endColumn`,0],[`module`,`--TLA+ BUILTINS--`]]),Oh=e=>Xn([[`name`,e??`UnnamedAction`],[`location`,Dh()]]),kh=(e,t,n)=>{let r=e.map((e,t)=>Yn([t+1,Xn(Object.entries(e))])),i=r.slice(1).map((e,n)=>Yn([r[n],t[n],e])),a=n?[Yn([r[r.length-1],n.action,r[n.start]])]:[];return Xn([[`action`,Nn([...i,...a])],[`state`,Nn(r)]])},Ah=(e,t)=>{if(typeof t==`number`)return e.registers.get(t);if(typeof t==`string`&&t.startsWith(`s:`))return Tm(e).get(t)},jh=(e,t,n,r)=>{if(typeof n==`number`&&n>=0)e.registers.set(n,r);else if(n===`exit`)r===!0&&(e.isStopped=!0);else if(n===`pause`){if(r!==!0)return;t(`Press enter to resume model checking.`),e.pause()}else if(typeof n==`string`&&n.startsWith(`s:`))e.namedRegisters.set(n,r);else if(typeof n==`string`&&n.startsWith(`-D`))e.properties.set(n.slice(2),z(r));else throw new S(`The first argument of TLCSet should be a nonnegative integer, but instead it is:\n${z(n)}`)},Mh=e=>e.every(e=>e!==void 0),Nh=(e,t)=>Xn(t.variables.map((t,n)=>[t,e[n]])),Ph=(e,t,n)=>{let r=e.kind===`Identifier`?e.name:e.kind===`Apply`?e.operator:void 0;if(e.kind===`Prime`||e.kind===`Unchanged`)return!0;if(r!==void 0&&!B(e)){if(t.variableIndex.has(r))return!0;let e=ml(r,t);if(e&&!n.has(e)&&(n.add(e),Ph(e.body,t,n)))return!0}return hi(e).some(e=>Ph(e,t,n))},Fh=(e,t)=>{let n=/* @__PURE__ */ new Map,r=/* @__PURE__ */ new WeakMap,i=e=>{let t=r.get(e)??/* @__PURE__ */ new Map;return r.set(e,t),t};return[H(`AssertEq`,2,t=>{let n=V(t,0,`AssertEq`),r=V(t,1,`AssertEq`),i=Qt(n,r);return i||(e(z(`Assertion failed`,!0)),e(z(n,!0)),e(z(r,!0))),i}),qi(`AssertError`,2,e=>{let n=Di(e,0,`AssertError`).expression;if(n&&n.kind!==`String`)throw Bi(Ch,`In computing AssertError, a non-string expression (line ${n.location.line}, col ${n.location.column}) was used as the err of an AssertError(err, exp).`);let r=Ji(e,0,`AssertError`)();try{Ji(e,1,`AssertError`)()}catch(e){if(e instanceof y)return ba(e.message,t.isTool)===r;throw e}return!1}),Ai(`TLCGetOrDefault`,2,e=>{let n=V(e,0,`TLCGetOrDefault`);return Ah(t,n)??V(e,1,`TLCGetOrDefault`)}),{...ki(`TLCGetAndSet`,4,n=>{let r=V(n,0,`TLCGetAndSet`),i=Ah(t,r)??V(n,3,`TLCGetAndSet`),a=Di(n,1,`TLCGetAndSet`);return jh(t,e,r,a.call([i,V(n,2,`TLCGetAndSet`)])),i}),isStateLevel:!0},Ai(`Trace`,0,(e,n)=>{let r=n?.state;if(!n||!r||!Mh(r)){let e=(n?.environment.variables??[]).filter((e,t)=>r?.[t]===void 0);throw Bi(wh,`In evaluating TLCExt!Trace, the state is not completely specified yet (variable${e.length>1?`s`:``} ${e.join(`, `)} undefined).`)}return Yn(t.getBehavior(r).map(e=>Nh(e,n.environment)))}),Ai(`CounterExample`,0,()=>t.counterExample??Eh()),H(`ToTrace`,1,e=>{let t=V(e,0,`ToTrace`);if(!F(t)||!Qt(Fr(t),Nn([`action`,`state`])))throw new y(`The argument of ToTrace should be a CounterExample, but instead it is:\n${z(t)}`);let n=R(Nr(t,`state`)).elements.map(e=>br(e)??[]);return Yn(n.sort((e,t)=>Number(e[0])-Number(t[0])).map(e=>e[1]))}),H(`TLCModelValue`,1,e=>{let t=V(e,0,`TLCModelValue`);if(typeof t!=`string`)throw new S(`The argument of ModelValue should be a string, but instead it is:\n${z(t)}`);return Rt(t)}),qi(`TLCDefer`,1,()=>!0),H(`TLCNoOp`,1,e=>V(e,0,`TLCNoOp`)),qi(`PickSuccessor`,1,(e,n)=>{let r=n?.next;if(!r||!Mh(r))throw Bi(Th,`Cannot invoke "tlc2.value.IValue.fingerPrint(long)" because "minVals[i]" is null`);if(t.isSeen(r)||pl(Ji(e,0,`PickSuccessor`)(),`the condition of PickSuccessor`))return!0;throw new C(`PickSuccessor needs interactive input to extend the behavior with a new state`)}),qi(`TLCCache`,2,(e,t)=>{let r=Di(e,0,`TLCCache`),a=ri(Ji(e,1,`TLCCache`)()),o=r.expression;if(!o||!t)return r.call([]);let s=Ph(o,t.environment,/* @__PURE__ */ new Set)&&t.state?i(t.state):n,c=s.get(o)??/* @__PURE__ */ new Map;s.set(o,c);let l=c.get(a);if(l!==void 0)return l;let u=r.call([]);return c.set(a,u),u}),H(`TLCFP`,1,e=>Number(BigInt.asIntN(32,rm([V(e,0,`TLCFP`)])))),Ai(`TLCEvalDefinition`,1,(e,t)=>{let n=V(e,0,`TLCEvalDefinition`),r=typeof n==`string`&&t?ml(n,t.environment):void 0;if(!r||typeof n!=`string`||!t)throw new S(`The argument of TLCEvalDefinition should be a name of a definition reachable from the root module, but instead it is:\n${z(n)}`);if(r.kind===`Operator`&&r.params.length>0)throw new S(`The argument of TLCEvalDefinition should be a zero-arity definition, but instead it is:\n${n}`);return W({kind:`Identifier`,name:n,location:r.location},t)})]},Ih=(e,t)=>[Ai(`_Track`,2,e=>{let n=String(V(e,1,`_Track`)),r=t.possibleCounts.get(n)??0;return t.possibleCounts.set(n,V(e,0,`_Track`)===!0?r+1:r),!0}),Ai(`_Counts`,0,()=>wm(t)),Ai(`_CheckName`,1,n=>{let r=String(V(n,0,`_CheckName`));return t.possibleCounts.get(r)?!0:(e(z(wm(t),!0)),!1)}),Ai(`_PrintCounts`,0,()=>(e(z(wm(t),!0)),!0))],Lh=e=>String(e).padStart(2,`0`),Rh=e=>`${e.getUTCFullYear()}.${Lh(e.getUTCMonth()+1)}.${Lh(e.getUTCDate())}.${Lh(e.getUTCHours())}${Lh(e.getUTCMinutes())}${Lh(e.getUTCSeconds())}`,zh=e=>zn([...e].map(([e,t])=>[e,Yn([t])])),Bh=/* @__PURE__ */ new Set([`diameter`,`generated`,`distinct`,`queue`,`stats`,`config`]),Vh=/* @__PURE__ */ new Set([`diameter`,`distinct`,`queue`,`duration`,`level`]),Hh=/* @__PURE__ */ new Set([`diameter`,`distinct`,`queue`,`level`]),Uh=(e,t,n)=>{if(e.version===`1.7.4`?!Vh.has(t)||!e.isStarted&&Hh.has(t):!e.isStarted&&Bh.has(t))throw new S(`TLCGet(${t}) was undefined.`);let r=Math.floor((Date.now()-e.startedAt)/1e3);switch(t){case`level`:return n===void 0?0:e.getLevel(n);case`diameter`:return e.diameter;case`generated`:return e.generatedStates;case`distinct`:return e.distinctStates;case`queue`:return e.queueSize;case`duration`:return r;case`stats`:return Xn([[`queue`,e.queueSize],[`distinct`,e.distinctStates],[`initial`,e.initialStates],[`generated`,e.generatedStates],[`diameter`,e.diameter],[`duration`,r],[`worker`,0]]);case`config`:return Xn([[`mode`,`bfs`],[`deadlock`,e.checkDeadlock],[`worker`,1],[`seed`,String(e.seed)],[`fingerprint`,`0`],[`install`,`unknown`]]);case`revision`:{let t=/* @__PURE__ */ new Date;return Xn([[`count`,0],[`timestamp`,Math.floor(t.getTime()/1e3)],[`date`,Dt(`${t.toISOString().slice(0,19)}.${t.getUTCMilliseconds()}Z`)],[`tag`,`development`],[`calver`,Dt(Rh(new Date(e.startedAt)))]])}case`spec`:return e.getSpecification();case`action`:return Oh(void 0);case`all`:return zh(e.registers);case`all:named`:return zh(Tm(e))}if(t.startsWith(`s:`)){let n=Tm(e).get(t);if(n===void 0)throw new S(`TLCGet(${t}) was undefined.`);return n}if(t.startsWith(`-D`))return Dt(e.properties.get(t.slice(2))??t);throw new S(`TLCGet(${t}) was undefined.`)},Wh=(e,t,n)=>{if(typeof t==`number`&&t>=0){let n=e.registers.get(t);if(n===void 0)throw new S(`TLCGet(${t}) was undefined.`);return n}if(typeof t!=`string`)throw new S(`The argument of TLCGet should be a nonnegative integer, but instead it is:\n${z(t)}`);return Uh(e,t,n?.state)},Gh=e=>e.length===0?[[]]:e.flatMap((t,n)=>Gh([...e.slice(0,n),...e.slice(n+1)]).map(e=>[t,...e])),Kh=e=>{typeof e==`object`&&((e.kind===`Set`||e.kind===`MixedSet`)&&R(e).elements.forEach(Kh),e.kind===`Function`&&e.range.forEach(Kh))},qh=(t,n)=>[H(`Print`,2,e=>(t(`${N(z(V(e,0,`Print`),!0,!0))} ${N(z(V(e,1,`Print`),!0,!0))}`),V(e,1,`Print`))),H(`PrintT`,1,e=>(t(N(z(V(e,0,`PrintT`),!0,!0))),!0)),H(`Assert`,2,t=>{if(V(t,0,`Assert`)!==!0)throw new S(`The first argument of Assert evaluated to FALSE; the second argument was:\n${N(z(V(t,1,`Assert`)))}`,e.assertViolation);return!0}),H(`JavaTime`,0,()=>Math.floor(Date.now()/1e3)&2147483647),H(`:>`,2,e=>zn([[V(e,0,`:>`),V(e,1,`:>`)]])),H(`@@`,2,e=>{let t=Ei(e,0,`@@`),n=Ei(e,1,`@@`);return Bn([...mt(t),...mt(n)])}),H(`ToString`,1,e=>Dt(z(V(e,0,`ToString`),!0))),H(`TLCEval`,1,e=>{let t=V(e,0,`TLCEval`);return Kh(t),t}),H(`Permutations`,1,e=>{let t=wi(e,0,`Permutations`);return Nn(Gh(t).map(e=>zn(t.map((t,n)=>[t,e[n]]))))}),ki(`SortSeq`,2,e=>{let t=Di(e,1,`SortSeq`);return Yn(Ti(e,0,`SortSeq`).reduce((e,n)=>{let r=e.findIndex(e=>t.call([n,e])===!0);return r===-1?[...e,n]:[...e.slice(0,r),n,...e.slice(r)]},[]))}),n.version===`1.7.4`?Vi({...Ai(`TLCGet`,1,(e,t)=>Wh(n,V(e,0,`TLCGet`),t)),isLevelConstant:!0},`public static tlc2.value.impl.Value tlc2.module.TLC.TLCGet(tlc2.value.impl.Value)`):Vi(qi(`TLCGet`,1,(e,t)=>Wh(n,Ji(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)`),Ai(`TLCSet`,2,e=>{let r=V(e,0,`TLCSet`);return jh(n,t,r,V(e,1,`TLCSet`)),!0}),Oi(`Any`,Pt),H(`RandomElement`,1,e=>Sm(Si(e,0,`RandomElement`),n.getRandom()))],Jh=(e,t)=>e.every(e=>wr(e,t)),Yh=Nn([!1,!0]),Xh=(e,t,n)=>{if(n-t===1)return e[t];let r=t+n>>1;return Rn(Xh(e,t,r),Xh(e,r,n))},Zh=[`\\cup`,`\\cap`,`\\`],Qh=e=>typeof e==`object`&&e.kind===`MixedSet`,$h=e=>e.kind===`Interval`?R(e).elements:e.elements,eg=(e,t,n)=>{let r=$h(t);if(e!==`\\cup`){let t=e===`\\cap`;return Pn(r.filter(e=>wr(e,n)===t))}if(r.length===0)return n;if(!lt(n))return Jt({kind:`SetOperation`,operator:e,left:t,right:n});let i=R(n).elements.filter(e=>!wr(e,t));return Pn([...r,...i])},tg=[Oi(`TRUE`,!0),Oi(`FALSE`,!1),Oi(`BOOLEAN`,Yh),Oi(`STRING`,{kind:`InfiniteSet`,name:`STRING`}),ji(`=`,jn),ji(`#`,(e,t)=>!jn(e,t)),H(`~`,1,e=>!bi(e,0,`~`)),H(`<=>`,2,e=>bi(e,0,`<=>`)===bi(e,1,`<=>`)),H(`/\\`,2,e=>bi(e,0,`/\\`)&&bi(e,1,`/\\`)),H(`\\/`,2,e=>bi(e,0,`\\/`)||bi(e,1,`\\/`)),H(`=>`,2,e=>!bi(e,0,`=>`)||bi(e,1,`=>`)),H(`\\in`,2,e=>wr(V(e,0,`\\in`),V(e,1,`\\in`))),H(`\\notin`,2,e=>!wr(V(e,0,`\\notin`),V(e,1,`\\notin`))),H(`\\subseteq`,2,e=>{let t=xi(e,0,`\\subseteq`),n=V(e,1,`\\subseteq`);return typeof t==`object`&&t.kind===`Subset`&&typeof n==`object`&&n.kind===`Subset`&&L(t.base)?Jh(R(t.base).elements,n.base):Jh(R(t).elements,n)}),...Zh.map(e=>H(e,2,t=>{let n=V(t,0,e),r=V(t,1,e);if(lt(n)&<(r)&&!Qh(n)&&!Qh(r)){if(e===`\\cup`&&pr(n))return r;let t=e===`\\cup`?Rn:e===`\\cap`?Ln:In;return Cr(()=>t(R(n),R(r)),()=>eg(e,n,r))}return lt(n)?eg(e,n,r):e!==`\\`&<(r)?eg(e,r,n):Jt({kind:`SetOperation`,operator:e,left:n,right:r})})),H(`SUBSET`,1,e=>({kind:`Subset`,base:V(e,0,`SUBSET`)})),H(`UNION`,1,e=>{let t=xi(e,0,`UNION`),n=hn(t)?t.elements.filter(hn):[];if(!hn(t)||n.length!==t.elements.length)return Jt({kind:`Union`,base:t});if(Qh(t)||n.some(Qh)){let e={kind:`MixedSet`,elements:[]};return n.forEach(t=>t.elements.forEach(t=>{wr(t,e)||e.elements.push(t)})),Pn(e.elements)}return n.length===0?Fn:Xh(n.map(R),0,n.length)}),H(`DOMAIN`,1,e=>{let t=V(e,0,`DOMAIN`);if(!F(t))throw new y(`DOMAIN expects a function but received ${z(t)}`);return Fr(t)})],ng=Ui(`Integers`,`Neg`,`IntValue`,1),rg=e=>{let t=Ui(e,`DotDot`,`IntervalValue`,2);return[Wi(e,`+`,`Plus`,(e,t)=>e+t),Wi(e,`-`,`Minus`,(e,t)=>e-t),Wi(e,`*`,`Times`,(e,t)=>e*t),Wi(e,`^`,`Expt`,(e,t)=>{if(t<0)throw new S(`The second argument of ^ should be a natural number, but instead it is:\n${t}`);if(e===0&&t===0)throw new S(`0^0 is undefined.`);return e**t}),Wi(e,`\\div`,`Divide`,(t,n)=>{if(n===0)throw new S(`The second argument of \\div is 0.`);if(e===`Naturals`){let e=Math.trunc(t/n)|0;return e<0&&Math.imul(e,n)!==t?e-1:e}let r=Math.floor(t/n);if(Mi(r))throw Ni(`${t} \\div ${n}`);return r}),Wi(e,`%`,`Mod`,(e,t)=>{if(t<=0)throw new S(`The second argument of % should be a positive number, but instead it is:\n${t}`);return(e%t+t)%t}),H(`..`,2,e=>({kind:`Interval`,low:Hi(V(e,0,`..`),t),high:Hi(V(e,1,`..`),t)}))]},ig=rg(`Naturals`),ag=rg(`Integers`),og=e=>{let t=ig.indexOf(e);return t===-1?void 0:ag[t]},sg=[Oi(`Nat`,{kind:`InfiniteSet`,name:`Nat`}),...ig,Ki(`<`,(e,t)=>e<t),Ki(`>`,(e,t)=>e>t),Ki(`<=`,(e,t)=>e<=t),Ki(`>=`,(e,t)=>e>=t,`>`)],cg=[Oi(`Int`,{kind:`InfiniteSet`,name:`Int`}),...ag,Ki(`>=`,(e,t)=>e>=t),H(`-.`,1,e=>{let t=Hi(V(e,0,`-`),ng);if(Mi(-t))throw Ni(`-${t}`);return-t})],lg=(e,t,n)=>{let r=V(e,t,n),i=br(r);if(!i)throw new S(`${n}\n${z(r)}`);return i},ug=(e,t,n)=>{let r=V(e,t,n);return typeof r==`string`?r:lg(e,t,n)},dg=(e,t,n)=>typeof e==`string`?Dt(e.slice(t,n)):Yn(e.slice(t,n)),fg=(e,t)=>`The ${e}argument of ${t} should be a sequence, but instead it is:`,pg=(e,t)=>`Evaluating an expression of the form ${e} when s is not a ${t}:`,mg=(e,t)=>{let n=Ud.get(e);return n?t.map(e=>{let t=n.get(e.name);return t?Vi(e,t):e}):t},hg=e=>mg(`Sequences`,[H(`Seq`,1,e=>({kind:`SequenceSet`,base:V(e,0,`Seq`)})),H(`Len`,1,e=>ug(e,0,fg(``,`Len`)).length),H(`\\o`,2,e=>{let t=ug(e,0,pg(`s \\o t`,`sequence`));if(typeof t!=`string`){let n=lg(e,1,pg(`t \\o s`,`sequence`));return Yn([...t,...n])}let n=V(e,1,`\\o`);if(typeof n!=`string`)throw new S(`${pg(`t \\o s`,`string`)}\n${z(n)}`);return Dt(t+n)}),H(`Append`,2,t=>Yn([...lg(t,0,pg(e===`1.7.4`?`Append(v, s)`:`Append(s, v)`,`sequence`)),V(t,1,`Append`)])),H(`Head`,1,e=>{let t=lg(e,0,fg(``,`Head`));if(t.length===0)throw new S(`Attempted to apply Head to the empty sequence.`);return t[0]}),H(`Tail`,1,e=>{let t=ug(e,0,fg(``,`Tail`));if(t.length===0)throw new S(`Attempted to apply Tail to the empty sequence.`);return dg(t,1)}),H(`SubSeq`,3,e=>{let t=ug(e,0,fg(`first `,`SubSeq`)),n=yi(e,1,`SubSeq`),r=yi(e,2,`SubSeq`);if(n>r)return dg(t,0,0);let i=n<1||n>t.length?{position:`second`,value:n}:r>t.length?{position:`third`,value:r}:void 0;if(i)throw new S(`The ${i.position} argument of SubSeq must be in the domain of its first argument:\n${z(V(e,0,`SubSeq`))}\n, but instead it is\n${i.value}`);return dg(t,n-1,r)}),ki(`SelectSeq`,2,e=>{let t=Di(e,1,`SelectSeq`);return Yn(lg(e,0,fg(`first `,`SelectSeq`)).filter(e=>{let n=t.call([e]);if(typeof n!=`boolean`)throw new S(`The second argument of SelectSeq should be a operator, but instead it is:\n${z(n)}`);return n}))})]),gg=e=>mg(`FiniteSets`,[H(`IsFiniteSet`,1,e=>{let t=V(e,0,`IsFiniteSet`);if(P(t))return vr(t);if(typeof t==`object`&&t.kind===`Function`)return!0;throw new y(typeof t==`object`&&t.kind===`LazyFunction`?`Attempted to check if the function:\n${z(t)}\nis a finite set.`:`Attempted to check if the ${ut(t)} ${z(t)} is a finite set.`)}),H(`Cardinality`,1,t=>{let n=V(t,0,`Cardinality`);if(!P(n)||typeof n==`object`&&(n.kind===`InfiniteSet`||n.kind===`SequenceSet`))throw new S(`Attempted to compute cardinality of the value\n${z(n)}`);return gr(n,e)})]),_g=/* @__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`]]]),vg=(e,t,n,r,i)=>{switch(e){case`Naturals`:return{extends:[],operators:sg};case`Integers`:return{extends:[`Naturals`],operators:cg};case`Sequences`:return{extends:[],operators:hg(n.version)};case`FiniteSets`:return{extends:[],operators:gg(n.version)};case`TLC`:return{extends:[],operators:mg(`TLC`,qh(t,n))};case`Randomization`:return{extends:[],operators:xh(n)};case`_Possible`:return{extends:[],operators:Ih(t,n)};case`Json`:return{extends:[],operators:ph(r)};case`Bags`:return{extends:[],operators:Km(i)};case`TLCExt`:return{extends:[],operators:Fh(t,n)};default:return}},yg=new Map([[`Nat`,0,[],[],[]],[`+`,0,[0,0],[2,2],[1,1]],[`-`,0,[0,0],[2,2],[1,1]],[`*`,0,[0,0],[3,3],[0,0]],[`^`,0,[0,0],[2,2],[1,1]],[`<`,0,[0,0],[2,2],[1,1]],[`>`,0,[0,0],[2,2],[1,1]],[`<=`,0,[0,0],[2,2],[1,1]],[`>=`,0,[0,0],[2,2],[1,1]],[`%`,0,[0,0],[2,2],[1,1]],[`\\div`,0,[0,0],[2,2],[1,1]],[`..`,0,[0,0],[2,2],[1,1]],[`Int`,0,[],[],[]],[`-.`,0,[0],[2],[1]],[`Seq`,0,[0],[2],[1]],[`Len`,0,[0],[2],[1]],[`\\o`,0,[0,0],[2,2],[1,1]],[`Append`,0,[0,0],[2,2],[1,1]],[`Head`,0,[0],[2],[1]],[`Tail`,0,[0],[2],[1]],[`SubSeq`,0,[0,0,0],[2,2,2],[1,1,1]],[`SelectSeq`,0,[0,1],[2,2],[1,1],[],[`1,0,0`]],[`IsFiniteSet`,0,[0],[2],[1]],[`Cardinality`,0,[0],[2],[1]],[`IsABag`,0,[0],[2],[1]],[`BagToSet`,0,[0],[2],[1]],[`SetToBag`,0,[0],[3],[1]],[`BagIn`,0,[0,0],[2,2],[1,1]],[`EmptyBag`,0,[],[],[]],[`\\oplus`,0,[0,0],[2,2],[1,1]],[`\\ominus`,0,[0,0],[2,2],[1,1]],[`BagUnion`,0,[0],[2],[1]],[`\\sqsubseteq`,0,[0,0],[2,2],[1,1]],[`SubBag`,0,[0],[2],[1]],[`BagOfAll`,0,[1,0],[2,2],[1,1]],[`BagCardinality`,0,[0],[2],[1]],[`CopiesIn`,0,[0,0],[2,2],[1,1]],[`Print`,0,[0,0],[3,3],[0,1]],[`PrintT`,0,[0],[3],[0]],[`Assert`,0,[0,0],[2,3],[1,0]],[`JavaTime`,0,[],[],[]],[`TLCGet`,0,[0],[3],[0]],[`TLCSet`,0,[0,0],[3,3],[0,0]],[`:>`,0,[0,0],[2,3],[1,1]],[`@@`,0,[0,0],[2,2],[1,1]],[`Permutations`,0,[0],[2],[1]],[`SortSeq`,0,[0,2],[2,2],[1,1],[],[`1,0,0`,`1,0,1`]],[`RandomElement`,0,[0],[3],[1]],[`Any`,0,[],[],[]],[`ToString`,0,[0],[2],[1]],[`TLCEval`,0,[0],[3],[1]],[`AssertEq`,0,[0,0],[2,2],[1,1]],[`AssertError`,0,[0,0],[2,3],[1,0]],[`TLCGetOrDefault`,0,[0,0],[3,3],[0,0]],[`TLCGetAndSet`,0,[0,2,0,0],[3,3,3,3],[0,0,0,0],[],[`1,2,1`]],[`Trace`,0,[],[],[]],[`CounterExample`,0,[],[],[]],[`ToTrace`,0,[0],[3],[0]],[`TLCModelValue`,0,[0],[2],[1]],[`TLCDefer`,0,[0],[3],[0]],[`TLCNoOp`,0,[0],[3],[1]],[`PickSuccessor`,0,[0],[3],[1]],[`TLCCache`,0,[0,0],[3,3],[1,0]],[`TLCFP`,0,[0],[3],[0]],[`TLCEvalDefinition`,0,[0],[3],[0]],[`ToJson`,0,[0],[2],[1]],[`ToJsonArray`,0,[0],[2],[1]],[`ToJsonObject`,0,[0],[2],[1]],[`JsonSerialize`,0,[0,0],[3,3],[0,0]],[`JsonDeserialize`,0,[0],[3],[0]],[`ndJsonSerialize`,0,[0,0],[3,3],[0,0]],[`ndJsonDeserialize`,0,[0],[3],[0]],[`RandomSubset`,0,[0,0],[2,2],[1,1]],[`RandomSetOfSubsets`,0,[0,0,0],[2,3,2],[1,0,1]],[`TestRandomSetOfSubsets`,0,[0,0,0],[2,3,2],[1,0,1]]].map(e=>[e[0],{name:e[0],level:e[1],params:/* @__PURE__ */ new Set,constraints:/* @__PURE__ */ new Map,argConstraints:/* @__PURE__ */ new Map,argParams:/* @__PURE__ */ new Set,formals:e[2].map((e,t)=>({name:`$${t}`,arity:e})),maxLevels:e[3],weights:e[4],minMaxLevels:e[5]??[],conditions:new Set(e[6]),nonLeibniz:/* @__PURE__ */ new Set}])),bg={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]}},xg=(e,t)=>{let n=bg[e]?.[t];return n&&{module:e,start:{line:n[0],column:n[1]},end:{line:n[2],column:n[3]}}},Sg=`$subexpression`,Cg=(e,t)=>new u(`${e} at line ${t.line}, column ${t.column}`),wg=(e,t,n)=>{if(e.kind===`Label`)return e.name===t?{label:e,lets:n}:void 0;if(e.kind===`Let`)return wg(e.body,t,[...n,e.definitions]);if(e.kind!==`Lambda`)for(let r of hi(e)){let e=wg(r,t,n);if(e)return e}},Tg=(e,t,n)=>t.reduceRight((e,t)=>({kind:`Let`,definitions:t,body:e,location:n}),e),Eg=(e,t)=>{let n=e.location,r=Tg(t,e.lets,n);if(e.params.length===0)return r;if(e.args.length===0){if(e.params.some(e=>e.arity>0))throw Cg(`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 Cg(`The subexpression requires ${e.params.length} arguments but received ${e.args.length}`,n);return{kind:`Let`,definitions:[{kind:`Operator`,name:Sg,params:e.params,body:r,isLocal:!0,isRecursive:!1,location:n}],body:{kind:`Apply`,operator:Sg,args:e.args,location:n,resolution:wa},location:n}},Dg=(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:wa})),a=i.length===0?{kind:`Identifier`,name:e.name,location:n,resolution:wa}:{kind:`Apply`,operator:e.name,args:i,location:n,resolution:wa};return Eg({...t,params:[...t.params,...r]},a)},Og=(e,t,n,r)=>{let i=n.location,a={params:[],args:[],lets:[],location:i},o={index:0,current:void 0,isFailed:!1},s=(t,r)=>{if(!t)throw Cg(r,i);Ea.set(n,{args:e.slice(0,o.index).flatMap(e=>`args`in e?e.args:[]),error:{location:g(t),message:r}}),o.isFailed=!0},c=n=>{let r=[],a=[];for(;o.index<e.length;){let s=e[o.index];if(s.kind!==`Name`)throw Cg(`Expected an operator name`,i);r.push(s.name),a.push(...s.args);let c=r.join(`!`),l=n?n.find(e=>Jo(e)===c):t(c);if(l)return{definition:l,name:c,args:a,earlier:a.length-s.args.length};o.index++}throw Cg(`Unknown operator ${r.join(`!`)}`,i)},l=t=>{let l=c(t),u=l.definition,d=ja(u),f=o.index===e.length-1;if(l.args.length!==d&&(!r||l.args.length!==0))return s(n.argumentRanges?.[o.index]??i.range,`The operator ${l.name} requires ${d-l.earlier} arguments.`);if(f)return{definition:u,args:l.args};if(u.kind!==`Operator`)throw Cg(`Cannot select a subexpression of ${u.name}`,i);a.params.push(...u.params),a.args.push(...l.args),o.current=u.body,o.index++},u=()=>{for(;o.index<e.length&&!o.isFailed;){let t=e[o.index];if(t.kind!==`Name`)return;let i=n.selectorRanges?.[o.index],c=o.current&&wg(o.current,t.name,[]);if(!c)return s(i,`Cannot find label \`${t.name}'.`);let l=c.label.params;if(!r&&t.args.length!==l.length)return s(i,`Label \`${t.name}' used with wrong number of arguments.`);a.lets.push(...c.lets),a.params.push(...l.map(e=>({name:e,arity:0}))),a.args.push(...t.args),o.current=c.label.body,o.index++}},d=t=>{let n=o.current;if(!n)throw Cg(`Subexpression selection failed`,i);if(t.kind===`Colon`)return;if(n.kind===`Label`){o.current=n.body,d(t);return}if(n.kind===`Let`){if(t.kind!==`Operand`||Qa(t.operand,1)!==0)throw Cg(`A LET/IN expression has only one operand`,i);a.lets.push(n.definitions),o.current=n.body;return}let r=no(n);if(r&&(t.kind===`Bound`||t.kind===`At`)){a.params.push(...r.names.map(e=>({name:e,arity:0}))),t.kind===`Bound`&&a.args.push(...t.args),o.current=r.body;return}if(n.kind===`Case`&&t.kind===`Operand`){let r=[...n.arms,...n.other?[{condition:void 0,body:n.other}]:[]],a=r[Qa(t.operand,r.length)],s=e[o.index+1];if(!a||s?.kind!==`Operand`)throw Cg(`A subexpression of CASE must have the form !i!j`,i);o.index++;let c=Qa(s.operand,2),l=c===0?a.condition:c===1?a.body:void 0;if(!l)throw Cg(`Nonexistent CASE operand`,i);o.current=l;return}if(t.kind!==`Operand`)throw Cg(`Unexpected subexpression selector`,i);let s=r?r.sets:ro(n),c=s?.[Qa(t.operand,s.length)];if(!c)throw Cg(`Nonexistent operand specified by the selector`,i);o.current=c},f=l(void 0);if(o.isFailed)return n;if(f)return Dg(f.definition,{...a,args:f.args});for(u();o.index<e.length&&!o.isFailed;){let t=e[o.index];if(t.kind===`Name`){for(;o.current?.kind===`Label`;)o.current=o.current.body;if(o.current?.kind!==`Let`)throw Cg(`A name selector here must be from a LET clause`,i);a.lets.push(o.current.definitions);let e=l(o.current.definitions);if(o.isFailed)return n;if(e)return Dg(e.definition,{...a,args:[...a.args,...e.args]});u()}else d(t),o.index++}if(o.isFailed)return n;if(!o.current)throw Cg(`Subexpression selection failed`,i);return Eg(a,o.current)},kg=(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 $a(e,t,n)},Ag=e=>e.kind===`Subexpression`||e.kind===`Identifier`&&e.name.includes(`!`)||e.kind===`Apply`&&e.operator.includes(`!`)||hi(e).some(Ag),jg=(e,t,n,r=!1)=>{if(!Ag(e))return e;if(e.kind===`Let`){let r=n=>e.definitions.find(e=>e.name===n)??t(n),i=Zo(e,e=>jg(e,r,n));return i.kind===`Let`&&i.instances?{...i,instances:i.instances.map(e=>Mg(e,r,n))}:i}let i=e.kind===`Apply`?t(e.operator):void 0,a=e.kind===`Apply`?{...e,args:e.args.map((e,r)=>jg(e,t,n,i?.kind!==`Operator`||i.params[r]?.arity!==0))}:Zo(e,e=>jg(e,t,n)),o=a.kind===`Subexpression`?a.selectors:a.kind===`Identifier`?kg(a.name,[],void 0,t):a.kind===`Apply`?kg(a.operator,a.args,a.argumentCounts,t):void 0,s=o?.[0];if(!o||s?.kind===`Name`&&n(s.name))return a;let c=Og(o,t,a,r);return c!==a&&Ta.add(c),c},Mg=(e,t,n)=>({...e,substitutions:e.substitutions.map(e=>({...e,expression:jg(e.expression,t,n,!0)}))}),Ng=e=>{let t=new Map(e.map(e=>[e.name,e]));return e=>t.get(e)},Pg=(e,t)=>Mg(e,Ng(t.definitions),()=>!1),Fg=(e,t)=>{let n=Ng([...t,...e.definitions]),r=new Set(e.theorems.flatMap(e=>e.name!==void 0&&e.statement.kind===`AssumeProve`?[e.name]:[])),i=e=>r.has(e),a=e=>jg(e,n,i),o=e=>i(e)||!n(e),s=e=>jg(e,n,o),c=e=>e.map(e=>e.kind===`ModuleFact`?e:s(e)),l=e=>e.map(e=>({...e,set:s(e.set)})),u=e=>e.kind===`AssumeProve`?{...e,assumptions:e.assumptions.map(e=>e.kind===`NewSymbol`?{...e,set:e.set&&s(e.set)}:u(e)),conclusion:s(e.conclusion)}:s(e),d=e=>{switch(e.kind){case`Use`:case`Hide`:return{...e,facts:c(e.facts)};case`Instance`:return Mg(e,n,o);case`Define`:return{...e,definitions:e.definitions.map(e=>e.kind===`Instance`?Mg(e,n,o):Xo(e,s))};case`Have`:case`Case`:return{...e,expression:s(e.expression)};case`Witness`:return{...e,expressions:e.expressions.map(s)};case`Take`:return{...e,bounds:l(e.bounds)};case`Pick`:return{...e,bounds:l(e.bounds),body:s(e.body)};case`Assert`:return{...e,statement:u(e.statement)};default:return e}},f=e=>e?.kind===`By`?{...e,facts:c(e.facts)}:e?.kind===`Steps`?{...e,steps:e.steps.map(e=>({...e,body:d(e.body),proof:f(e.proof)}))}:e,p={...e,theorems:e.theorems.map(e=>({...e,statement:e.name!==void 0&&e.statement.kind!==`AssumeProve`?e.statement:u(e.statement),proof:f(e.proof)})),uses:e.uses.map(e=>({...e,facts:c(e.facts)}))};return e.definitions.some(e=>Ag(e.body))||e.assumptions.some(e=>Ag(e.expression))?{...p,definitions:e.definitions.map(e=>Xo(e,a)),assumptions:e.assumptions.map(e=>({...e,expression:a(e.expression)}))}:p},Ig=(e,t)=>`${e}${t}`,Lg=(e,t,n)=>`${e}${t}${n}`,Rg=e=>{let t=e.split(`\0`);return{operator:t[0],index:Number(t[1]),param:t[2]}},zg=(e,t,n)=>`${e},${t},${n}`,Bg=(e=0)=>({level:e,params:/* @__PURE__ */ new Set,constraints:/* @__PURE__ */ new Map,argConstraints:/* @__PURE__ */ new Map,argParams:/* @__PURE__ */ new Set}),Vg=(e,t,n)=>e.set(t,Math.min(n,e.get(t)??3)),Hg=(e,t,n)=>e.set(t,Math.max(n,e.get(t)??0)),Ug=(e,t,n,r)=>({...Bg(t),name:e,formals:[],maxLevels:n,weights:r,minMaxLevels:[],conditions:/* @__PURE__ */ new Set,nonLeibniz:/* @__PURE__ */ new Set}),Wg=(e,t)=>e.formals.length===0&&e.maxLevels.length>0?e.maxLevels[Math.min(t,e.maxLevels.length-1)]:e.maxLevels[t]??3,Gg=(e,t)=>e.formals.length===0&&e.weights.length>0?e.weights[Math.min(t,e.weights.length-1)]:e.weights[t]??1,Kg=new Map([[`=`,0,[2,2],[1,1]],[`#`,0,[2,2],[1,1]],[`\\in`,0,[2,2],[1,1]],[`\\notin`,0,[2,2],[1,1]],[`\\subseteq`,0,[2,2],[1,1]],[`\\cup`,0,[2,2],[1,1]],[`\\cap`,0,[2,2],[1,1]],[`\\`,0,[2,2],[1,1]],[`=>`,0,[3,3],[1,1]],[`<=>`,0,[3,3],[1,1]],[`/\\`,0,[3,3],[1,1]],[`\\/`,0,[3,3],[1,1]],[`~`,0,[3],[1]],[`SUBSET`,0,[2],[1]],[`UNION`,0,[2],[1]],[`DOMAIN`,0,[2],[1]],[`~>`,3,[3,3],[0,0]],[`-+->`,3,[3,3],[0,0]],[`\\cdot`,2,[2,2],[0,0]],[`TRUE`,0,[],[]],[`FALSE`,0,[],[]],[`BOOLEAN`,0,[],[]],[`STRING`,0,[],[]]].map(([e,t,n,r])=>[e,{...Ug(e,t,[...n],[...r]),nonLeibniz:new Set(t>1?[0,1]:[])}])),qg=Ug(`$Set`,0,[2],[1]),Jg=Ug(`$Junction`,0,[3],[1]),Yg=Ug(`$Choose`,0,[2],[1]),Xg=Ug(`$Function`,0,[3],[1]),Zg=Ug(`$FcnApply`,0,[2,2],[1,1]),Qg=Ug(`$RcdSelect`,0,[2,0],[1,1]),$g=Ug(`'`,2,[1],[0]),e_=Ug(`ENABLED`,1,[2],[0]),t_=Ug(`[]`,3,[3],[0]),n_=Ug(`$SquareAct`,2,[2,1],[0,0]),r_=Ug(`$WF`,3,[1,2],[0,0]),i_=Ug(`$TemporalExists`,3,[3],[0]),a_=(e,t)=>t.length===0?e:new Map([...e,...t.map(e=>[e.name,{kind:`Formal`,arity:e.arity}])]),o_=e=>e.map(e=>({name:e,arity:0})),s_=(e,t)=>t.location.range?_(`${e}.`,t.location.range):new u(`${e} at line ${t.location.line}, column ${t.location.column}`),c_=/* @__PURE__ */ new Set([`/\\`,`\\/`,`=>`,`<=>`]),l_=e=>e.kind!==`Let`&&e.kind!==`Label`,u_=e=>{let t=/* @__PURE__ */ new Map,n=(t,n)=>{let r=n.get(t);if(r?.kind===`Formal`)return{kind:`Declared`,name:t,level:0,arity:r.arity};if(r?.kind===`Let`)return{kind:`Defined`,levels:v(r.definition,r.scope)};if(e.constants.has(t))return{kind:`Declared`,name:t,level:0,arity:0};if(e.variables.has(t))return{kind:`Declared`,name:t,level:1,arity:0};let i=e.getDefinition(t);if(i){let n=v(i,/* @__PURE__ */ new Map),r=e.getQualifiedName?.(t);return{kind:`Defined`,levels:r?{...n,name:r}:n}}let a=Kg.get(t)??yg.get(t);return a?{kind:`Defined`,levels:a}:{kind:`Declared`,name:t,level:0,arity:0}},r=(e,t,n)=>{let r=Bg(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(Lg(e,n,t))}),t.data.constraints.forEach((e,t)=>Vg(r.constraints,t,e)),Hg(r.argConstraints,Ig(e,n),t.data.level),t.data.argConstraints.forEach((e,t)=>Hg(r.argConstraints,t,e)),t.data.argParams.forEach(e=>r.argParams.add(e))}),r},i=(e,t,n=[],r=[])=>{let i=e=>r.includes(e);if(t.forEach((t,n)=>{if(!(t.operator||t.declared)&&t.data.level>Wg(e,n))throw new u(`Level error in applying operator ${e.name}:\nThe level of argument ${n+1} exceeds the maximum level allowed by the operator`)}),n.some(e=>e.level>2))throw new u(`Level error in applying operator ${e.name}:\nThe level of the range for a bounded variable exceeds the maximum level allowed by the operator`);let a=n=>{let r=e.formals.findIndex(e=>e.name===n);return r===-1?void 0:t[r]},o=(t,n,r)=>e.conditions.has(zg(t,n,r)),s=Bg(Math.max(e.level,...t.filter((t,n)=>Gg(e,n)===1).map(e=>e.data.level),...n.map(e=>e.level)));return e.params.forEach(e=>s.params.add(e)),t.forEach((t,n)=>{Gg(e,n)===1&&t.data.params.forEach(e=>s.params.add(e))}),n.forEach(e=>e.params.forEach(e=>s.params.add(e))),r.forEach(e=>s.params.delete(e)),e.constraints.forEach((e,t)=>Vg(s.constraints,t,e)),t.forEach(e=>e.data.constraints.forEach((e,t)=>{i(t)||Vg(s.constraints,t,e)})),n.forEach(e=>e.constraints.forEach((e,t)=>Vg(s.constraints,t,e))),t.forEach((t,n)=>t.data.params.forEach(t=>{i(t)||Vg(s.constraints,t,Wg(e,n))})),t.forEach((e,n)=>{let r=e.operator;r&&t.forEach((e,t)=>r.formals.forEach((i,a)=>{o(n,t,a)&&e.data.params.forEach(e=>Vg(s.constraints,e,Wg(r,a)))}))}),e.argParams.forEach(e=>{let t=Rg(e),n=a(t.operator)?.operator;n&&Vg(s.constraints,t.param,Wg(n,t.index))}),[e.argConstraints,...t.map(e=>e.data.argConstraints),...n.map(e=>e.argConstraints)].forEach(e=>e.forEach((e,t)=>Hg(s.argConstraints,t,e))),t.forEach((n,r)=>{let i=n.declared;i&&(Array.from({length:i.arity},(t,n)=>Hg(s.argConstraints,Ig(i.name,n),e.minMaxLevels[r]?.[n]??0)),t.forEach((e,t)=>Array.from({length:i.arity},(n,a)=>{o(r,t,a)&&Hg(s.argConstraints,Ig(i.name,a),e.data.level)})))}),e.argParams.forEach(e=>{let t=Rg(e),n=a(t.operator);n&&Hg(s.argConstraints,Ig(t.operator,t.index),n.data.level)}),t.forEach(e=>e.data.argParams.forEach(e=>{i(Rg(e).param)||s.argParams.add(e)})),n.forEach(e=>e.argParams.forEach(e=>s.argParams.add(e))),e.argParams.forEach(e=>{let t=Rg(e),n=a(t.operator);if(n)n.declared&&s.argParams.add(Lg(n.declared.name,t.index,t.param));else{let n=a(t.param);if(!n){s.argParams.add(e);return}n.data.params.forEach(e=>s.argParams.add(Lg(t.operator,t.index,e)))}}),t.forEach((e,n)=>{let r=e.declared;r&&t.forEach((e,t)=>Array.from({length:r.arity},(i,a)=>{o(n,t,a)&&e.data.params.forEach(e=>s.argParams.add(Lg(r.name,a,e)))}))}),s},a=(e,t)=>{if(e.kind===`Lambda`){let n=_(`LAMBDA`,o_(e.params),e.body,t);return{data:n,operator:n}}let r=e.kind===`OperatorReference`?e.operator:e.kind===`Identifier`?e.name:void 0;if(r!==void 0){let i=n(r,t);if(i.kind===`Defined`&&(i.levels.formals.length>0||e.kind===`OperatorReference`))return{data:i.levels,operator:i.levels};if(i.kind===`Declared`&&i.arity>0){let e=Bg();return e.params.add(r),{data:e,declared:{name:r,arity:i.arity}}}}return{data:m(e,t)}},o=(e,t)=>e.map(e=>a(e,t)),s=(e,t,n,r=[],a=[])=>{let s=a_(n,o_(a));return i(e,o(t,s),r.map(e=>m(e,n)),a)},c=(e,t)=>e.kind===`Declared`?r(e.name,e.level,t):i(e.levels,t),l=(e,t)=>{let n=e.map(e=>e.data.level);if(n.includes(2)&&n.includes(3))throw s_(`Formula has both temporal formula and action as arguments`,t)},d=(e,t)=>{if((e.operator===`~>`||e.operator===`-+->`)&&t.some(e=>e.data.level===2))throw s_(`Action used where only temporal formula or state predicate allowed`,e);c_.has(e.operator)&&l(t,e)},f=(e,t)=>{let n=e.expression,r=e.kind===`Always`?`BoxAction`:`AngleAction`;if(t===2&&l_(n)&&n.kind!==r)throw s_(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=>{let t=v(e,n);t.constraints.forEach((e,t)=>Vg(i.constraints,t,e)),t.argConstraints.forEach((e,t)=>Hg(i.argConstraints,t,e)),t.argParams.forEach(e=>i.argParams.add(e))}),i},m=(e,t)=>{try{return h(e,t)}catch(t){throw!(t instanceof u)||t.sany?t:s_(t.message,e)}},h=(e,t)=>{switch(e.kind){case`Number`:case`Decimal`:case`String`:case`ExceptAt`:return Bg();case`Identifier`:return c(n(e.name,t),[]);case`Apply`:{let r=o(e.args,t);return d(e,r),c(n(e.operator,t),r)}case`OperatorReference`:case`Lambda`:return a(e,t).data;case`And`:case`Or`:{let n=o(e.operands,t);return l(n,e),i(Jg,n)}case`Prime`:case`Unchanged`:return s($g,[e.expression],t);case`Enabled`:return s(e_,[e.expression],t);case`Always`:case`Eventually`:{let n=a(e.expression,t);return f(e,n.data.level),i(t_,[n])}case`If`:return s(Jg,[e.condition,e.consequent,e.alternative],t);case`Case`:return s(Jg,[...e.arms.flatMap(e=>[e.condition,e.body]),...e.other?[e.other]:[]],t);case`Let`:return p(e,t);case`Forall`:case`Exists`:{let n=s(Jg,[e.body],t,e.bounds.map(e=>e.set),Ua(e.bounds)),r=n.level===3?e.bounds.find(e=>m(e.set,t).level===2):void 0;if(r)throw s_(`Action-level bound of quantified temporal formula`,r.set);return n}case`UnboundedQuantifier`:return s(e.isTemporal?i_:Jg,[e.body],t,[],e.names);case`Choose`:return s(Yg,[e.body],t,e.set?[e.set]:[],Ha(e.pattern));case`SetEnumeration`:case`Tuple`:case`FunctionSet`:case`Product`:return s(qg,e.kind===`FunctionSet`?[e.domain,e.range]:e.kind===`Product`?e.factors:e.elements,t);case`SetFilter`:return s(qg,[e.predicate],t,[e.bound.set],Ha(e.bound.pattern));case`SetMap`:return s(qg,[e.expression],t,e.bounds.map(e=>e.set),Ua(e.bounds));case`FunctionConstruction`:return s(Xg,[e.body],t,e.bounds.map(e=>e.set),Ua(e.bounds));case`Record`:return s(Xg,e.fields.map(e=>e.value),t);case`RecordSet`:return s(qg,e.fields.map(e=>e.value),t);case`Except`:return s(qg,[e.function,...e.updates.flatMap(e=>[...e.path.flatMap(e=>e.kind===`Index`?e.args:[]),e.value])],t);case`FunctionApplication`:return i(Zg,[a(e.function,t),e.args.length===1?a(e.args[0],t):{data:s(qg,e.args,t)}]);case`Bracket`:return Bg();case`FieldAccess`:return i(Qg,[a(e.record,t),{data:Bg()}]);case`BoxAction`:case`AngleAction`:return s(n_,[e.action,e.subscript],t);case`WeakFairness`:case`StrongFairness`:return s(r_,[e.subscript,e.action],t);case`Label`:return m(e.body,t);case`Subexpression`:return Bg()}},g=(e,t,r=!1,i=/* @__PURE__ */ new Set)=>{let a=(e,n=r,a=t)=>g(e,a,n,i),o=(e,o)=>{let s=n(e,t);s.kind===`Declared`?(r&&i.add(e),o.forEach(e=>a(e))):o.forEach((e,t)=>a(e,r||s.levels.nonLeibniz.has(t)))};switch(e.kind){case`Identifier`:return o(e.name,[]),i;case`Apply`:return o(e.operator,e.args),i;case`Lambda`:case`Let`:return i;case`Prime`:case`Unchanged`:case`Enabled`:case`Always`:case`Eventually`:case`BoxAction`:case`AngleAction`:case`WeakFairness`:case`StrongFairness`:return hi(e).forEach(e=>a(e,!0)),i;case`UnboundedQuantifier`:return a(e.body,r||e.isTemporal===!0,a_(t,o_(e.names))),i;default:return Zo(e,(e,n)=>(a(e,r,a_(t,o_(n))),e)),i}},_=(e,t,n,r)=>{let i=a_(r,t),a=m(n,i),o=e=>t.some(t=>t.name===e),s=g(n,i),c={...Bg(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(Ig(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(Lg(e.name,n,t.name))).map(e=>zg(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(Rg(t).operator)||c.argConstraints.set(t,e)}),a.argParams.forEach(e=>{let t=Rg(e);o(t.operator)&&o(t.param)||c.argParams.add(e)}),c},v=(e,n)=>{let r=t.get(e);if(r)return r;let i=e.kind===`Operator`?e.params:[];t.set(e,{...Bg(),name:e.name,formals:i,maxLevels:i.map(()=>3),weights:i.map(()=>0),minMaxLevels:i.map(()=>[]),conditions:/* @__PURE__ */ new Set,nonLeibniz:/* @__PURE__ */ new Set});let a=e.kind===`Function`?{kind:`FunctionConstruction`,bounds:e.bounds,body:e.body,location:e.location}:e.body,o=_(e.name,i,a,n);return t.set(e,o),o};return{analyze:m,analyzeDefinition:v,toOperand:a}},d_=(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`?d_(e,r,n):n.analyze(e,r)]});i.push(n.analyze(e.conclusion,r));let a=Bg(Math.max(...i.map(e=>e.level)));return i.forEach(e=>{e.params.forEach(e=>a.params.add(e)),e.constraints.forEach((e,t)=>Vg(a.constraints,t,e)),e.argConstraints.forEach((e,t)=>Hg(a.argConstraints,t,e)),e.argParams.forEach(e=>a.argParams.add(e))}),a},f_=(e,t,n,r)=>{let i=u_(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`?d_(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):[]}):[],c=e=>e?.kind===`Steps`?e.steps.flatMap(e=>{let t=e.body,n=()=>o(e)===3,r=t.kind===`Pick`&&t.bounds.length>0&&n()?t.bounds.filter(e=>a([e.set])!==0).flatMap(e=>e.set.location.range?[{location:g(e.set.location.range),message:`Non-constant bound of temporal PICK.`}]:[]):[];return[...c(e.proof),...r,...e.proof?.kind===`Steps`&&n()?s(e.proof):[]]}):[],l=Vo([...e.definitions.filter(e=>!e.name.includes(`!`)).map(e=>({location:e.location,check:()=>i.analyzeDefinition(e,/* @__PURE__ */ new Map)})),...e.assumptions.map(e=>({location:e.location,check:()=>i.analyze(e.expression,/* @__PURE__ */ new Map)})),...e.theorems.map(e=>({location:e.location,check:()=>{let t=e.statement.kind===`AssumeProve`?d_(e.statement,/* @__PURE__ */ new Map,i):i.analyze(e.statement,/* @__PURE__ */ new Map),n=[...c(e.proof),...t.level===3?s(e.proof):[]];if(n.length>0)throw p(n)}})),...n],r);if(l.length>0)throw p(l,!1,void 0,r)},p_=(e,t)=>e.maxLevels[t]??3,m_=e=>{let t=/* @__PURE__ */ new Map,n=n=>{let r=t.get(n);if(r)return r;let i=e(n),a=u_({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=>Vg(c.constraints,e.name,0));let l=(e,t)=>{e.constraints.forEach((e,t)=>Vg(c.constraints,t,e)),e.argConstraints.forEach((e,t)=>Hg(c.argConstraints,t,e)),e.argParams.forEach(e=>{let n=Rg(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)&&Vg(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(d_(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),c=i(t.module),l=n(t.instancer),u=/* @__PURE__ */ new Map;t.lets.forEach(e=>u.set(e.name,{kind:`Let`,definition:e,scope:u}));let d=[...s.constants.map(e=>({...e,maximumLevel:0})),...s.variables.map(e=>({name:e,arity:0,maximumLevel:1}))].flatMap(e=>{let n=t.substitutions.get(e.name);if(!n)return[];if(e.arity===0){let t=l.analyze(n,u);return[{...e,level:t.level,operator:void 0,isLeibniz:!0}]}let r=l.toOperand(n,u);return[{...e,level:r.data.level,operator:r.operator,isLeibniz:r.operator===void 0||r.operator.nonLeibniz.size===0}]}),f=(e,n)=>`Level error in instantiating module '${t.module}':\nThe level of the expression or operator substituted for '${e}' \nmust be at most ${n}.`;if(d.forEach(e=>{!c.isConstant&&e.level>e.maximumLevel&&o(f(e.name,e.maximumLevel)),e.isLeibniz||o(`Error in instantiating module '${t.module}':\n A non-Leibniz operator substituted for '${e.name}'.`)}),d.forEach(e=>{let n=c.constraints.get(e.name);n!==void 0&&e.level>n&&o(f(e.name,n));let r=e.operator;r&&Array.from({length:e.arity},(n,i)=>{let a=c.argConstraints.get(Ig(e.name,i));a!==void 0&&p_(r,i)<a&&o(`Level error in instantiating module '${t.module}':\nThe level of the argument ${i+1} of the operator ${r.name} \nmust be at least ${a}.`)})}),c.argParams.forEach(e=>{let n=Rg(e),r=d.find(e=>e.name===n.operator)?.operator,i=d.find(e=>e.name===n.param);if(!r||!i)return;let a=p_(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 p([...r.values()])}},h_=[`LAMBDA`,`$$InAssume`,`nullODN`,`nullOpArg`,`nullLabelNode`],g_=/* @__PURE__ */ new Set([`THEOREM`,`LEMMA`,`COROLLARY`,`PROPOSITION`]),__=new Map(Rd.flatMap(e=>e.map(t=>[t,e[0]]))),v_=e=>__.get(e)??e,y_=e=>{let t=0;for(let n=0;n<e.length;n++)t=Math.imul(t,31)+e.charCodeAt(n)|0;return t},b_=()=>{let e={buckets:Array.from({length:11},()=>[]),threshold:8},t=/* @__PURE__ */ new Set,n=[],r=(e,t)=>(y_(e.name)&2147483647)%t,i=()=>{let t=e.buckets.length*2+1,n=Array.from({length:t},()=>[]);for(let i=e.buckets.length-1;i>=0;i--)for(let a of e.buckets[i])n[r(a,t)].unshift(a);e.buckets=n,e.threshold=Math.floor(t*.75)};return{put:a=>{t.has(a.key)||(n.length>=e.threshold&&i(),e.buckets[r(a,e.buckets.length)].unshift(a),t.add(a.key),n.push(a))},inserted:n,enumerate:()=>e.buckets.toReversed().flat()}},x_=(e,t,n)=>({key:t===`module`?`module ${e}`:e,name:e,kind:t,isLocal:n}),S_=(e,t)=>{let n=e[t],r=e[t+1];if(n.text===`_`&&r.kind===`Operator`)return e[t+2]?.text===`_`?{name:v_(r.text),end:t+3}:{name:r.text,end:t+2};if(n.kind===`Operator`)return{name:n.text===`-`?`-.`:v_(n.text),end:t+2};if(r?.text!==`(`)return{name:n.text,end:t+1};let i=e.findIndex((e,n)=>n>t&&e.text===`)`);return{name:n.text,end:i+1}},C_=(e,t)=>{let n=[];for(let r=t;;){let t=S_(e,r);if(n.push(t.name),e[t.end]?.text!==`,`)return n;r=t.end+1}},w_=e=>({line:e.line,column:e.column}),T_=(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===`.`)continue;else if(a.text===`EXTENDS`){let n=C_(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},E_=(e,t)=>t!==void 0&&t.line===e.line&&t.column===e.column+e.text.length,D_={"\\":`\\\\`,'"':`\\"`,"\n":`\\n`," ":`\\t`,"\r":`\\r`,"\f":`\\f`},O_=e=>{let t=[];for(let n=0;n<e.length;n++){let r=e[n];r.text===`<`&&E_(r,e[n+1])&&/^(\d+|\*|\+)$/.test(e[n+1].text)&&e[n+2]?.text===`>`&&E_(e[n+1],e[n+2])?n+=E_(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=>D_[e])}"`:r.text)}return t},k_=e=>e[2]?.text,A_=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},j_=(e,t)=>e.find(e=>e.name===t)??e.map(e=>j_(e.modules,t)).find(Boolean),M_=(e,t)=>{let n=/* @__PURE__ */ new Map,r=/* @__PURE__ */ new Map,i=i=>{let a=n.get(i??``);if(a)return a;let o=i===void 0?e:Hd.get(i)??t?.(i)??Lp(e,i),s=o===void 0?[]:xe(o),c=A_(s),l=c.get(k_(s)??``)??{start:0,end:0},u={module:void 0},d={tokens:s,...l,getModule:()=>u.module??=zp(o??``)};return n.set(i??``,d),c.forEach((e,t)=>{e.start===l.start||r.has(t)||r.set(t,{tokens:s,...e,getModule:()=>j_(d.getModule().modules,t)??d.getModule()})}),d};return i(void 0),e=>(e===void 0?void 0:r.get(e))??i(e)},N_=(e,t)=>{let n=M_(e,t),r=e=>{let t=e.tokens,n=e.getModule(),r=[],i=[],a=(e,n)=>{let i=C_(t,e+1);r.push({location:w_(t[e]),apply:e=>i.forEach(t=>e.put(x_(t,n,!1)))})},s=new Set(n.definitions.filter(e=>e.isRecursive).map(e=>e.name)),c={value:0};t.slice(e.start,e.end).forEach((n,o)=>{let l=e.start+o,u=t[l];if(u.kind===`Separator`&&t[l+1]?.text===`MODULE`){if(c.value++,c.value===2){let e=t[l+2].text;r.push({location:w_(u),apply:t=>t.put(x_(e,`module`,!1))})}}else u.kind===`ModuleEnd`&&c.value--,c.value===1&&u.kind===`Keyword`&&((u.text===`CONSTANT`||u.text===`CONSTANTS`)&&a(l,`constant`),(u.text===`VARIABLE`||u.text===`VARIABLES`)&&a(l,`variable`),u.text===`RECURSIVE`&&C_(t,l+1).every(e=>s.has(e))&&a(l,`definition`),g_.has(u.text)&&t[l+1]?.kind===`Identifier`&&t[l+2]?.text===`==`&&(i.push(w_(u)),r.push({location:w_(u),apply:e=>e.put(x_(t[l+1].text,`theorem`,!1))})))}),n.assumptions.forEach(e=>{i.push(e.location);let t=e.name;t!==void 0&&r.push({location:e.location,apply:e=>e.put(x_(t,`theorem`,!1))})});let l=e=>i.some(t=>t.line===e.line&&t.column===e.column);return n.definitions.forEach(e=>{if(l(e.location))return;let t=v_(e.name);r.push({location:e.location,apply:n=>n.put(x_(t,`definition`,e.isLocal))})}),n.instances.forEach(e=>{r.push({location:e.location,apply:t=>{let n=o(e.module).enumerate(),r=e.name===void 0?``:`${e.name}!`,i=n.filter(e=>e.kind===`definition`),a=n.filter(e=>e.kind===`theorem`);[...i,...a].forEach(n=>{n.isLocal||t.put(x_(`${r}${n.name}`,n.kind,e.isLocal))}),e.name!==void 0&&t.put(x_(e.name,`definition`,e.isLocal))}})}),r.sort((e,t)=>Aa(e.location,t.location)?-1:+!!Aa(t.location,e.location))},i=/* @__PURE__ */ new Map,a=/* @__PURE__ */ new Map,o=e=>{let t=i.get(e??``);if(t)return t;let s=b_();i.set(e??``,s),Ld.toReversed().forEach(e=>s.put(x_(e,`builtin`,!1)));let c=n(e);return c.getModule().extends.forEach(e=>o(e).inserted.forEach(e=>{e.isLocal||s.put(e)})),a.set(s,s.inserted.length),r(c).forEach(e=>e.apply(s)),s};return{getContext:o,getOwnEntries:e=>{let t=o(e);return t.inserted.slice(a.get(t))}}},P_=(e,t,n)=>N_(e,t).getContext(void 0).enumerate().filter(e=>e.kind===n).map(e=>e.name).reverse(),F_=(e,t)=>{let n=N_(e,t);return n.getContext(void 0),e=>n.getOwnEntries(e).filter(e=>e.kind===`definition`).map(e=>e.name)},I_=(e,t)=>P_(e,t,`variable`),L_=(e,t,n)=>{let r=M_(e,n),i=/* @__PURE__ */ new Set,a=e=>{i.add(e)},o=e=>{e.kind===`ModelValue`&&a(e.name),e.kind===`String`&&a(e.value),e.kind===`Set`&&e.elements.forEach(o)};t.constants.forEach(e=>{e.args?.forEach(o),o(e.value)}),zd.forEach(a);let s=e=>{let t=r(e);return t.tokens.slice(t.start,t.end)},c=/* @__PURE__ */ new Map,l=/* @__PURE__ */ new Map,u=e=>{let t=l.get(e);if(t)return t;let n=T_(s(e),e,c);return l.set(e,n),n},d=e=>c.get(e)??u(e),f=/* @__PURE__ */ new Set,p=(e,t)=>c.has(t)||f.has(`${e.key}>${t}`),h=(e,t,n)=>{let r=[...e.extends.map(d),...e.instances.filter(t=>p(e,t)).map(d),...e.inner];for(let e of r){let r=n(e,t);if(r)return r}},g=e=>{let t=(n,r)=>{if(r.has(n.key))return;r.add(n.key);let i=e(n).find(e=>!p(n,e));return i===void 0?h(n,r,t):[n,i]};return t},_=g(e=>e.extends),v=g(e=>e.instances),y=/* @__PURE__ */ new Set([void 0]),b=/* @__PURE__ */ new Map;O_(s(void 0)).forEach((e,t)=>{t===3&&Vd.forEach(a),a(e)});let x=u(void 0);for(;;){let e=_(x,/* @__PURE__ */ new Set)??v(x,/* @__PURE__ */ new Set);if(!e)break;let[t,n]=e;if(f.add(`${t.key}>${n}`),b.set(t.unit,[...b.get(t.unit)??[],n]),!y.has(n)){if(y.add(n),r(n).tokens.length===0){let e=t.unit??k_(r(void 0).tokens);throw m(n,e)}O_(s(n)).forEach(a)}}h_.forEach(a);let ee=/* @__PURE__ */ new Set,te=e=>{if(ee.has(e))return;ee.add(e);let t=b.get(e)??[],n=u(e).allExtends;[...t.filter(e=>n.has(e)),...t.filter(e=>!n.has(e))].forEach(te),s(e).forEach(e=>{e.kind===`String`&&a(e.text)})};return te(void 0),Bd.forEach(a),[...i]},R_=t=>{switch(t.kind){case`Number`:try{return dt(t.value)}catch(t){throw n(t,e.error)}case`String`:case`Boolean`:return t.value;case`ModelValue`:return Rt(t.name);case`Set`:return Nn(t.elements.map(R_))}},z_=e=>[...e.constants,...e.variables.map((t,n)=>({name:t,arity:0,location:e.variableLocations[n]}))],B_=(e,t)=>{try{return zp(e)}catch(n){if(!(n instanceof u))throw n;let r=dp(e);throw r===void 0?n:p([{location:`In module ${t}`,message:`Could not parse module ${t} from file ${t}.tla`}],!0,r)}},V_=e=>new u(`Multiply-defined module '${e.name}' at line ${e.location.line}, column ${e.location.column}`),H_=(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)}.`},U_=e=>[`Builtin`,`Definition`,`Instance`,`Parameter`].includes(e)?`definition`:`declaration`,W_=e=>e===`Theorem`?`ThmOrAssumpDefNode`:U_(e),G_=(e,t)=>({kind:`Operator`,name:t,params:[],body:{kind:`Let`,definitions:[e],body:{kind:`Identifier`,name:e.name,location:e.location,resolution:wa},location:e.location},isLocal:!0,isRecursive:!1,location:e.location}),K_=(e,t,n)=>{let r=`{ ${n.map(e=>`<${[...e[0],e[1]].map(e=>z(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 y(`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`)&&Qt(t,r)})});if(t)return t[1];throw new y(`Attempted to apply operator:\n${r}\nto arguments (${e.map(e=>typeof e==`object`&&e.kind===`Operator`?e.name:z(e)).join(`, `)}), which is undefined.`)},evaluateUnary:void 0,evaluateBinary:void 0}},q_=(e,t)=>e.kind===`Identifier`&&t.has(e.name)||e.kind===`Apply`&&t.has(e.operator)||hi(e).some(e=>q_(e,t)),J_=(e,t)=>{let n=new Map(e.map((e,t)=>[e,t]));return new Set(t).forEach(e=>n.set(os(e),n.get(e)??n.size)),n},Y_=e=>e.flatMap(e=>e.substitutions.map(e=>e.expression)),X_=e=>e.forEach(e=>{if(e.kind===`Decimal`)throw al(e);if(e.kind===`Number`&&!mu(e.value))throw ol(e);X_(e.kind===`Let`?[...hi(e),...Y_(e.instances??[])]:hi(e))}),Z_=(e,t)=>{let n=zp(t.source),r=/* @__PURE__ */ new Map,i=/* @__PURE__ */ new Map,a=/* @__PURE__ */ new Map,o=/* @__PURE__ */ new Set,s=new Map(tg.map(e=>[e.name,e])),c=/* @__PURE__ */ new Map,l=Cm(e.checkDeadlock,t.seed);l.isWarningEnabled=t.isWarningEnabled??!0,l.isTool=t.isTool??!1,l.version=t.version??`master`;let d=/* @__PURE__ */ new Map,f=/* @__PURE__ */ new Map,_=/* @__PURE__ */ new Map,b=[],x=/* @__PURE__ */ new Map,ee=[],te=[],S=(e,t)=>ee.forEach(n=>{n.add(e),[...t].forEach(e=>n.add(e))}),ne={value:0},re=e=>`${e}#${ne.value++}`,ie=[],C=[],ae=m_(e=>{let t=_.get(e)??ue(e,e);return{constants:t.constants,variables:t.variables,definitions:[...new Set([...t.visible.values()].flatMap(e=>r.get(e.key)??[]))],assumptions:t.module.assumptions.map(e=>e.expression),theorems:t.module.theorems,getDefinition:e=>r.get(t.visible.get(e)?.key??e)}}),oe=/* @__PURE__ */ new Map,se=/* @__PURE__ */ new Map,w=/* @__PURE__ */ new Map,T=e=>{let n=c.get(e);if(n)return n;let r=vg(e,t.print,l,t.files,s);if(!r)return;_g.get(e)?.forEach(T);let i=/* @__PURE__ */ new Map;return r.extends.forEach(e=>T(e)?.forEach((e,t)=>i.set(t,e))),r.operators.forEach(t=>{s.set(t.name,t),i.set(t.name,{key:t.name,arity:t.arity,params:yg.get(t.name)?.formals.map(e=>e.arity),kind:`Definition`,range:xg(e,t.name)??i.get(t.name)?.range})}),c.set(e,i),i},E=e=>{let t=T(e),n=_g.get(e)??[];return t&&S(e,n),t&&n.includes(`Integers`)&&T(`Integers`),t},D=e=>(X_([...e.definitions.flatMap(e=>e.kind===`Function`?[...e.bounds.map(e=>e.set),e.body]:[e.body]),...e.assumptions.map(e=>e.expression),...e.theorems.flatMap(e=>e.statement.kind===`AssumeProve`?[]:[e.statement]),...Y_(e.instances)]),e.modules.forEach(D),e);D(n);let ce=(e,n)=>{let r=t.loadModule?.(e)??Td.get(e)??Lp(t.source,e);if(r===void 0)throw m(e,n);let i=B_(r,e);if(i.name!==e)throw p([{location:`Unknown location`,message:`File name '${e}' does not match the name '${i.name}' of the top level module it contains.`}],!0);return D(i)},le=e=>{let t=te.indexOf(e.name);if(t!==-1)throw new u(`Circular dependency among .tla files; dependency cycle is: ${[...te.slice(t),e.name].map(e=>`${e}.tla`).join(` --> `)}`);let n=/* @__PURE__ */ new Set,r=[],i=[],a=[];te.push(e.name),ee.push(n);let o=be(e,{id:e.name,symbols:/* @__PURE__ */ new Map,modules:/* @__PURE__ */ new Map,nested:r,errors:i,warnings:C,levelChecks:a});if(ee.pop(),te.pop(),i.length>0)throw p(i,!1,void 0,C);let s=r.find(e=>n.has(e.name)),c=s&&d.get(s.name),l=c&&H_(s,c.module);if(l)throw p([l],!1,void 0,C);if(s)throw V_(s);return a.forEach(e=>e()),{linked:o,closure:n}},ue=(e,t)=>{let n=d.get(e);if(n)return S(e,x.get(e)??[]),n;let r=le(ce(e,t));return d.set(e,r.linked),x.set(e,r.closure),S(e,r.closure),r.linked},de=(e,t,n,s,c)=>{let l=c?void 0:E(e.module);if(l)return fe(e,l);let u=c??ue(e.module,t.name);u.facts.forEach(t=>n.facts.add(e.name===void 0?t:`${e.name}!${t}`));let d=z_(u),f=`#${ne.value++}`,p=new Map(e.params.map(e=>[e.name,`${e.name}${f}`])),m=Bo(Pg(e,t),d,t,n);ie.push({module:e.module,instancer:t.name,lets:[],substitutions:m,location:e.location});let h=vs({params:e.params.map(e=>({...e,name:`${e.name}${f}`})),substitutions:new Map([...m].map(([e,t])=>[e,Go(t,p)])),variables:new Set(u.variables),getDefinition:e=>r.get(e),isParameterized:e=>i.get(e)===!0,addDefinition:(n,c,l)=>{let u=re(`${c}@${t.name}`),f=l(u);return r.set(u,f),d.length>0&&o.add(f),e.name!==void 0&&se.set(u,`${e.name}!${se.get(n)??c}`),i.set(u,!s),a.set(u,{source:n,prefix:e.params.length}),u},createName:re});return pe(e,u.exported,d,(t,n)=>{let r=e.name===void 0?h.getKey(t):h.getQualifiedKey(t);return d.length>0&&oe.set(r,{name:n,location:e.location}),e.name!==void 0&&w.set(r,n),r})},fe=(e,t)=>e.name===void 0?t:new Map([...t].map(([t,n])=>[`${e.name}!${t}`,{key:n.key,arity:n.arity,params:n.params,kind:n.kind}])),pe=(e,t,n,r)=>{let a=new Set(n.map(e=>e.name));return new Map([...t].filter(([e])=>!a.has(e)).map(([t,n])=>{if(e.name===void 0)return[t,{key:r(n.key,t),arity:n.arity,params:n.params,kind:n.kind,range:i.get(n.key)===!0?e.location.range:n.range}];let a=`${e.name}!${t}`;return[a,{key:r(n.key,a),arity:n.arity+e.params.length,params:n.params&&[...e.params.map(e=>e.arity),...n.params],kind:n.kind}]}))},me=(e,t)=>e.map(e=>({kind:`Identifier`,name:e.name,location:t,resolution:wa})),he=(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:me(r,i),location:i},isLocal:!0,isRecursive:!1,location:i}),O=e=>Array.from({length:e},(e,t)=>({name:`argument${t}`,arity:0})),ge=(e,t,n)=>{if(t.arity===0)return{params:[],body:e};if(e.kind===`Lambda`)return{params:e.params.map(e=>({name:e,arity:0})),body:e.body};let r=O(t.arity);return{params:r,body:{kind:`Apply`,operator:e.kind===`Identifier`?e.name:e.kind===`OperatorReference`?e.operator:t.name,args:me(r,n),location:n}}},_e=(e,t,n,a)=>{let o=e.location,s=a?void 0:E(e.module);if(s)return e.name===void 0?[]:[...s].map(([t,n])=>{let r=O(n.arity);return he(`${e.name}!${t}`,n.key,[...e.params,...r],r,o)});let c=a??ue(e.module,n),l=`#${ne.value++}`,u=new Map(e.substitutions.map(e=>[e.name,e.expression])),d=z_(c),f=e=>u.get(e.name)??{kind:`Identifier`,name:e.name,location:o};ie.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=>q_(f(e),p),h=d.map(t=>{let n=ge(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=[],_=vs({params:e.params,substitutions:new Map(d.map(t=>[t.name,m(t)?{kind:`Apply`,operator:`${t.name}${l}`,args:me(e.params,o),location:o,resolution:wa}:{kind:`Identifier`,name:`${t.name}${l}`,location:o,resolution:wa}])),variables:new Set(c.variables),getDefinition:e=>r.get(e),isParameterized:e=>i.get(e)===!0,addDefinition:(t,n,r)=>{let i=`${n}@${e.module}${l}.${g.length}`,a=r(i);return g.push(a.kind===`Operator`?{...a,name:i}:G_(a,i)),i},createName:re}),v=new Set(d.map(e=>e.name)),y=[...c.exported].filter(([e])=>!v.has(e)).map(([t,n])=>{let r=_.getKey(n.key),i=O(n.arity),a=[...e.params,...i];return he(e.name===void 0?t:`${e.name}!${t}`,r,a,r===n.key?i:a,o)});return[...h,...g,...y]},ve=e=>[...e].flatMap(([e,t])=>{let n=r.get(t.key);return n?[{...n,name:e}]:[]}),ye=/* @__PURE__ */ new Map,be=(e,a)=>{let o=Id(e,t.loadClass?.(e.name),e===n);ye.set(e.name,o.overrides);let s=o.module,c=ie.length,l=new Map([...tg.map(e=>[e.name,{key:e.name,arity:e.arity,kind:`Builtin`}]),...a.symbols]),u=/* @__PURE__ */ new Map,d={location:Fo,errors:[],warnings:[]},p=[d],m=e=>e.forEach((e,t)=>{let n=h.get(t);if(!n){l.set(t,e),h.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);W_(n.kind)===W_(e.kind)?d.warnings.push({location:r,message:`Warning: the ${U_(n.kind)} of '${t}' conflicts with \nits ${U_(n.kind)} at ${i}.`}):d.errors.push({location:r,message:`The ${U_(e.kind)} of '${t}' conflicts with \nits ${U_(n.kind)} at ${i}.`})}),h=/* @__PURE__ */ new Map,v=/* @__PURE__ */ new Set,y=/* @__PURE__ */ new Map,x=[],ee=[...s.constants],te=s.variables.map(e=>e.name),S=s.variables.map(e=>e.location);s.extends.forEach(e=>{let t=a.modules.get(e),n=t?void 0:E(e);if(n){m(n);return}let r=t??ue(e,s.name);ee.push(...r.constants.filter(e=>ee.every(t=>t.name!==e.name))),r.variables.forEach((e,t)=>{te.includes(e)||(te.push(e),S.push(r.variableLocations[t]))}),m(r.exported),r.facts.forEach(e=>v.add(e)),r.modules.forEach((e,t)=>y.set(t,e)),x.push(r)});let ne=new Map(l),re=[...s.constants.map(e=>({...e,kind:`Constant`})),...s.variables.map(e=>({...e,kind:`Variable`}))],oe=e=>({key:e.name,arity:e.arity,kind:e.kind,range:e.location.range});re.forEach(e=>h.set(e.name,oe(e)));let se=e=>({key:D(e),arity:ja(e),params:Ma(e),kind:Io(s,e)?`Theorem`:`Definition`,range:e.location.range}),T=ee.length===0&&te.length===0,D=e=>s===n?e.name:`${e.name}@${a.id}`,ce=/* @__PURE__ */ new Map,le=()=>new Map([...a.modules,...y]),me=e=>{let t=s.instances.find(t=>t.module===e.name);return t!==void 0&&Aa(e.location,t.location)},he=e=>{let t=s.modules.find(t=>t.name===e.module);return t?me(t)?y.get(t.name):void 0:le().get(e.module)},O=e=>({imported:l,getInstance:e=>{let t=he(e),n=t?void 0:E(e.module);if(n)return{declarations:[],symbols:fe(e,n),instancer:s.name};let r=t??ue(e.module,s.name),i=z_(r);return{declarations:i,symbols:pe(e,r.exported,i,e=>e),instancer:s.name}},bound:ne,definitions:new Map(e.definitions.toReversed().map(e=>[e.name,e])),getKey:D,instanced:ce,facts:v,reports:p,warnings:a.warnings}),ge=e=>[...re.filter(t=>Aa(t.location,e)).map(e=>[e.name,oe(e)]),...s.definitions.filter(t=>Aa(t.location,e)).map(e=>[e.name,se(e)])].reduce((e,[t,n])=>e.has(t)?e:e.set(t,n),new Map(l)),xe=e=>{let t=le(),n=t.get(e.name),r=n&&H_(e,n.module);if(n&&!r)throw V_(e);a.nested.push(e);let i={location:e.location,errors:[],warnings:[]};p.push(i);let o=be(e,{id:`${a.id}/${e.name}`,symbols:ge(e.location),modules:t,nested:a.nested,errors:i.errors,warnings:i.warnings,levelChecks:a.levelChecks});r&&i.errors.push(r),n||y.set(e.name,o),f.has(e.name)||f.set(e.name,o)};[...s.instances.map(e=>({location:e.location,link:()=>{let t=de(e,s,O(s),T,le().get(e.module));ce.set(e,t),t.forEach((t,n)=>{l.has(n)||(u.set(n,e.location),l.set(n,t),e.isLocal||h.set(n,t))})}})),...s.modules.map(e=>({location:e.location,link:()=>xe(e)}))].sort((e,t)=>Aa(e.location,t.location)?-1:1).forEach(e=>e.link());let Se=Fg(Ss(s,(e,t)=>_e(e,t,s.name,he(e))),ve(l));a.errors.push(...Ho(Se,O(Se))),Se.definitions.forEach(e=>{let t=D(e);r.set(t,e),i.set(t,!T);let n=se(e),a=u.get(e.name);(n.kind!==`Theorem`||l.get(e.name)?.kind!==`Theorem`||a!==void 0&&!Aa(a,e.location))&&(l.set(e.name,n),e.isLocal||h.set(e.name,n))});let Ce={module:Se,constants:ee,variables:te,variableLocations:S,visible:l,exported:h,modules:y,extended:x,facts:/* @__PURE__ */ new Set([...v,...[...Se.theorems,...Se.assumptions].flatMap(e=>e.name??[])])};_.has(s.name)||_.set(s.name,Ce);let we=ie.splice(c).map(e=>({location:e.location,check:()=>ae(e)}));return a.levelChecks.push(()=>f_(Se,{constants:new Set(ee.map(e=>e.name)),variables:new Set(te),getDefinition:e=>r.get(l.get(e)?.key??e),getQualifiedName:e=>w.get(l.get(e)?.key??e)},we,C)),b.push(Ce),Ce},xe=le(n).linked;C.length>0&&!t.isSanyReported&&t.print(h(C));let Se=e=>xe.visible.get(e)?.key??e;xe.visible.forEach((e,t)=>{let n=r.get(e.key);n&&e.key!==t&&r.set(t,n)});let Ce=[],we=(e,t)=>{t.has(e)||(t.add(e),e.extended.forEach(e=>we(e,t)),Ce.push(...e.module.assumptions))};we(xe,/* @__PURE__ */ new Set);let k=xe.constants.map(e=>e.name),Te=xe.variables,A=e=>e.module===void 0?[e.name,Se(e.name)]:e.module===n.name||k.includes(e.name)?[]:[(d.get(e.module)??f.get(e.module))?.visible.get(e.name)?.key??e.name],Ee=e=>{let t=r.get(e);return t?.kind===`Operator`?t.params.length:xe.constants.find(t=>t.name===e)?.arity??0},De=/* @__PURE__ */ new Map,Oe=/* @__PURE__ */ new Set,ke=(e,t)=>{s.set(e,t),r.delete(e),De.delete(e),Oe.add(e)};e.constants.filter(e=>e.args===void 0).forEach(e=>{let t=R_(e.value);An(t),A(e).forEach(e=>{let n=Ee(e);n===0?De.set(e,t):ke(e,{kind:`Builtin`,name:e,arity:n,evaluate:()=>t,evaluateUnary:void 0,evaluateBinary:void 0,isLazy:!0})})});let Ae=/* @__PURE__ */ new Map;e.constants.forEach(e=>{if(e.args===void 0)return;let t=`${e.module??``}!${e.name}`,n=Ae.get(t)??{name:e.name,module:e.module,rows:[]};if(n.rows.length>0&&n.rows[0][0].length!==e.args.length)throw new v(`The arity of the operator ${e.name} is inconsistent in the configuration file.`);n.rows.push([e.args.map(R_),R_(e.value)]),Ae.set(t,n)}),Ae.forEach(e=>A(e).forEach(t=>ke(t,K_(e.name,Ee(t)||e.rows[0][0].length,e.rows))));let je=new Map(e.substitutions.flatMap(e=>A(e).map(t=>[t,Se(e.target)])));e.substitutions.filter(e=>e.module===void 0).forEach(t=>{let n=t.name,i=t.target;if(!k.includes(n)&&!xe.visible.has(n))throw new v(`In the configuration file, the identifier ${n} does not appear in the specification.`);if(e.substitutions.some(e=>e.name===i))throw new v(`In the configuration file, the identifier ${i} appears\non the right-hand side of a <- after already appearing on the\nleft-hand side of one.`);let a=Se(i),o=r.get(a);if(!(o!==void 0||s.has(a)||De.has(a)||k.includes(i)||Te.includes(i)))throw new v(`The configuration file substitutes for ${n} with the undefined identifier ${i}.`);if(o?.kind===`Operator`&&o.params.length!==(xe.constants.find(e=>e.name===n)?.arity??xe.visible.get(n)?.arity))throw new v(`The configuration file substitutes for ${n} with ${i} of different number of arguments.`)});let Me=new Set([...e.constants,...e.substitutions].filter(e=>e.module!==void 0).flatMap(A)),Ne=(e,t)=>{if(Me.has(e))return{key:e,prefix:t};let n=a.get(e);return n&&Ne(n.source,t+n.prefix)};a.forEach((e,t)=>{let n=Ne(e.source,e.prefix),i=r.get(t);if(!n||!i)return;let a=i.kind===`Operator`?i.params:[],o=he(t,n.key,a,a.slice(n.prefix),i.location);r.set(t,o),xe.visible.forEach((e,n)=>{e.key===t&&n!==t&&r.set(n,o)})});let Pe=k.filter(e=>!De.has(e)&&!je.has(e)&&!Oe.has(e));if(Pe.length>0&&!t.isUnconfigured)throw new v(`The constant parameter ${P_(t.source,t.loadModule,`constant`).find(e=>Pe.includes(e))??Pe[0]} is not assigned a value by the configuration file.`);t.isTraceRecorded&&s.forEach((e,t)=>{let n=og(e);n&&s.set(t,n)});let Fe={runtime:l,definitions:r,builtins:s,constants:De,substitutions:je,instanceNames:se,variables:Te,variableIndex:J_(Te,b.flatMap(e=>e.module.variables.map(e=>e.name))),definitionValues:/* @__PURE__ */ new Map,constantLevels:/* @__PURE__ */ new Map,substitutedDefinitions:o,evaluators:/* @__PURE__ */ new WeakMap},Ie=u_({constants:new Set(De.keys()),variables:/* @__PURE__ */ new Set([...Te,...[`TLCGet`,`Trace`,`CounterExample`].filter(e=>s.has(e))]),getDefinition:e=>ml(e,Fe)}),Le=e=>{try{W(e,{environment:Fe,scope:void 0,state:void 0,next:void 0});return}catch(e){if(e instanceof y)return e;throw e}};je.forEach((e,t)=>{let n=r.get(e),i=k.includes(t)&&n?.kind===`Operator`&&n.params.length===0&&Ie.analyzeDefinition(n,/* @__PURE__ */ new Map).level>0?Le(n.body):void 0;if(i)throw new v(`The configuration file substitutes constant ${t} with non-constant ${e}${_a(i)?``:` - specifically: ${i.message}`}`)}),l.version!==`1.7.4`&&(l.isStarted=!0);let j=new Set(b.flatMap(e=>e.module.instances.map(e=>e.module))),Re=F_(t.source,t.loadModule);return{environment:Fe,assumptions:Ce,variableLocations:xe.variableLocations,instanceActions:oe,startupDefinitions:b.filter(e=>!j.has(e.module.name)||z_(e).length===0).flatMap(e=>Re(e===xe?void 0:e.module.name).flatMap(t=>{let n=r.get(e.visible.get(t)?.key??t);return n?[n]:[]})),rootConstants:xe.constants,rootSymbols:xe.visible,javaOverrides:b.flatMap(e=>ye.get(e.module.name)??[])}},Q_={kind:`Boolean`,value:!0},$_={kind:`Boolean`,value:!1},ev=e=>e?Q_:$_,tv=e=>e.kind===`State`||e.kind===`Enabled`||e.kind===`Action`,nv=e=>e.kind===`State`||e.kind===`Enabled`||e.kind===`Boolean`,rv=(e,t)=>({kind:e,body:t}),iv=(e,t,n)=>({kind:e,operands:[t,n]}),av=(e,t)=>({kind:e,operands:t.flatMap(t=>t.kind===e?av(e,t.operands).operands:[t])}),ov=e=>{switch(e.kind){case`Boolean`:return 0;case`State`:case`Enabled`:return 1;case`Action`:case`Next`:return 2;case`Not`:return ov(e.body);case`Always`:case`Eventually`:return 3;case`And`:case`Or`:return e.operands.reduce((e,t)=>Math.max(e,ov(t)),0)}},sv=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 sv(e.body);case`And`:case`Or`:return e.operands.some(sv)}},cv=/* @__PURE__ */ new WeakMap,lv={count:0},uv=e=>{let t=cv.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`#${lv.count++}`;case`And`:case`Or`:return`${e.kind}(${e.operands.map(uv).join(`,`)})`;default:return`${e.kind}(${uv(e.body)})`}})();return cv.set(e,n),n},dv=(e,t)=>e===t||uv(e)===uv(t),fv=(e,t)=>{let n=uv(t);return e.some(e=>e===t||uv(e)===n)},pv=e=>e===`And`?`Or`:`And`,mv=(e,t)=>{switch(e.kind){case`Boolean`:return t?ev(!e.value):e;case`State`:case`Enabled`:case`Action`:case`Next`:return t?rv(`Not`,e):e;case`Not`:return mv(e.body,!t);case`And`:case`Or`:return av(t?pv(e.kind):e.kind,e.operands.map(e=>mv(e,t)));case`Always`:case`Eventually`:{let n=t===(e.kind===`Always`)?`Eventually`:`Always`;return rv(n,mv(e.body,t))}}},hv=e=>{switch(e.kind){case`Boolean`:return ev(!e.value);case`Not`:return e.body;case`And`:case`Or`:return av(pv(e.kind),e.operands.map(hv));case`Always`:return rv(`Eventually`,hv(e.body));case`Eventually`:return rv(`Always`,hv(e.body));default:return rv(`Not`,e)}},gv=e=>{switch(e.kind){case`And`:case`Or`:{let t=e.kind===`Or`,n=[];for(let r of e.operands){let e=gv(r);if(e.kind!==`Boolean`)n.push(e);else if(e.value===t)return ev(t)}return n.length===0?ev(!t):n.length===1?n[0]:av(e.kind,n)}case`Not`:{let t=gv(e.body);return t.kind===`Boolean`?ev(!t.value):rv(`Not`,t)}case`Always`:case`Eventually`:{let t=gv(e.body);return rv(e.kind,t.kind===e.kind?t.body:t)}default:return e}},_v=e=>e.kind===`Always`&&e.body.kind===`Eventually`?e.body.body:void 0,vv=e=>{switch(e.kind){case`And`:{let t=[],n={value:1};for(let r of e.operands){let e=vv(r);if(e.kind===`And`)t.push(...e.operands);else{if(e.kind===`Or`&&(n.value*=e.operands.length,n.value>2147483647))throw new y(`TLC cannot handle the temporal formula because it exceeds the maximum supported size in disjunctive normal form.`);t.push(e)}}if(n.value===1)return{kind:`And`,operands:t};let r=Array.from({length:n.value},()=>[]),i={groups:1,repeat:n.value};for(let e of t){if(e.kind!==`Or`){r.forEach(t=>t.push(e));continue}i.repeat/=e.operands.length;let t={value:0};for(let n=0;n<i.groups;n++)for(let n of e.operands)for(let e=0;e<i.repeat;e++)r[t.value++].push(n);i.groups*=e.operands.length}return{kind:`Or`,operands:r.map(e=>av(`And`,e))}}case`Or`:{let t=[],n=[];for(let r of e.operands){let e=vv(r);for(let r of e.kind===`Or`?e.operands:[e]){let e=_v(r);e?t.push(e):n.push(r)}}if(t.length>0){let e=t.length===1?t[0]:av(`Or`,t);n.push(rv(`Always`,rv(`Eventually`,e)))}return av(`Or`,n)}case`Not`:return tv(e.body)?e:vv(hv(e.body));default:return e}},yv=e=>{switch(e.kind){case`And`:case`Or`:return e.operands.length===1?yv(e.operands[0]):av(e.kind,e.operands.map(yv));case`Not`:return e.body.kind===`Not`?yv(e.body.body):rv(`Not`,yv(e.body));case`Always`:case`Eventually`:case`Next`:return rv(e.kind,yv(e.body));default:return e}},bv=e=>{switch(e.kind){case`And`:case`Or`:{if(e.operands.length===1)return bv(e.operands[0]);let t=Math.floor(e.operands.length/2);return iv(e.kind,bv(av(e.kind,e.operands.slice(0,t))),bv(av(e.kind,e.operands.slice(t))))}case`Not`:case`Always`:case`Eventually`:case`Next`:return rv(e.kind,bv(e.body));default:return e}},xv=(e,t)=>{e.kind===`Eventually`&&!fv(t,e)&&t.push(e),`body`in e&&xv(e.body,t),`operands`in e&&e.operands.forEach(e=>xv(e,t))},Sv=e=>{let t=e.filter(nv),n=e.flatMap(e=>e.kind===`Not`&&nv(e.body)?[e.body]:[]);return!t.some(e=>fv(n,e))},Cv=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,rv(`Next`,e)),t.push(e.body);break;case`And`:case`Or`:t.push(...e.operands),n.push(e);break;case`Action`:throw new y(`TLC encountered actions while constructing the tableau`);default:n.push(e)}}return n},wv=(e,t,n)=>{if(e.kind===t&&`body`in e)return{first:e.body,second:rv(`Next`,e)};if(e.kind===n&&`operands`in e)return{first:e.operands[0],second:e.operands[1]}},Tv=(e,t,n)=>e.flatMap(e=>{let r=wv(e,t,n);return r?[{whole:e,first:r.first,second:r.second}]:[]}),Ev=e=>[...new Set(e.map(uv))].sort().join(`|`),Dv=(e,t)=>{let n=new Set(t.map(Ev));return[...e.filter(e=>!n.has(Ev(e))),...t]},Ov=e=>{let t=Cv(e),n=Tv(t,`Always`,`And`),r=Tv(t,`Eventually`,`Or`),i=e=>{for(let t of e){let n=wv(t,`Eventually`,`Or`);if(n&&!(fv(e,n.first)||fv(e,n.second)))return Dv(a([...e,n.first]),a([...e,n.second]))}let t=r.find(t=>(fv(e,t.first)||fv(e,t.second))&&!fv(e,t.whole));return t?a([...e,t.whole]):[e]},a=e=>{if(!Sv(e))return[];let t=[...e];for(let e=0;e<t.length;e++){let n=wv(t[e],`Always`,`And`);n&&(fv(t,n.first)||t.push(n.first),fv(t,n.second)||t.push(n.second))}let r={isChanged:!0};for(;r.isChanged;){r.isChanged=!1;for(let e of n)fv(t,e.first)&&fv(t,e.second)&&!fv(t,e.whole)&&(t.push(e.whole),r.isChanged=!0)}return t.length>e.length&&!Sv(t)?[]:i(t)};return a(e)},kv=e=>({particle:e,successors:[],statePredicates:e.filter(e=>ov(e)<=1)}),Av=e=>{let t=Ov([e]).map(kv),n=t.length,r=/* @__PURE__ */ new Map;t.forEach((e,t)=>{let n=Ev(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 Ov(n)){let n=Ev(i),a=r.get(n);a===void 0&&(r.set(n,t.length),t.push(kv(i))),t[e].successors.push(a??t.length-1)}}return{nodes:t,initialCount:n}},jv=(e,t)=>!fv(e,t)||fv(e,t.body),Mv=(e,t)=>{if(e.kind===`Eventually`&&e.body.kind===`Always`&&ov(e.body.body)<3){t.eventuallyAlways.push(e.body.body);return}let n=_v(e);if(n){let e=ov(n);if(e<=1){t.infinitelyOftenStates.push(n);return}if(e===2){t.infinitelyOftenActions.push(n);return}}if(sv(e))throw new y(`Temporal formulas containing actions must be of forms <>[]A or []<>A.`);t.formulas.push(e)},Nv=(e,t)=>{let n=e.findIndex(e=>dv(e,t));return n===-1?(e.push(t),e.length-1):n},Pv=e=>{let t=vv(gv(mv(e,!1)));if(t.kind===`Boolean`&&!t.value)return[];let n=[];for(let e of t.kind===`Or`?t.operands:[t]){let t=yv(e),r={eventuallyAlways:[],infinitelyOftenStates:[],infinitelyOftenActions:[],formulas:[]};for(let e of t.kind===`And`?t.operands:[t])Mv(e,r);let i=r.formulas,a=i.length===0?void 0:i.length===1?i[0]:av(`And`,i),o=n.find(e=>e.formula===void 0||a===void 0?e.formula===a:dv(e.formula,a));o?o.classifications.push(r):n.push({formula:a,classifications:[r]})}return n.map(e=>{let t=e.formula&&bv(e.formula),n=[];t&&xv(t,n);let r=[],i=[],a=e.classifications.map(e=>({infinitelyOftenActions:e.infinitelyOftenActions.map(e=>Nv(i,e)),infinitelyOftenStates:e.infinitelyOftenStates.map(e=>Nv(r,e)),eventuallyAlways:e.eventuallyAlways.map(e=>Nv(i,e))}));return{tableau:t&&Av(t),promises:n,stateChecks:r,actionChecks:i,models:a}})},Fv=()=>n(new y(`Temporal formula is a tautology (its negation is unsatisfiable).`),e.livenessEvaluationFailure),Iv=()=>n(new x,e.error),Lv=/* @__PURE__ */ new Set([`~>`,`-+->`]),Rv=/* @__PURE__ */ new WeakMap,zv=/* @__PURE__ */ new WeakSet,Bv=(e,t)=>({environment:e,scope:t,state:void 0,next:void 0}),Vv=(e,t)=>new y(`TLC cannot handle the temporal formula ${Zc(e)}${t===void 0?``:`:\n${t}`}`),Hv=(e,t,n,r=/* @__PURE__ */ new Set)=>{let i=e=>{let r=sl(t,e);if(!r)return;if(r.kind===`Value`)return 0;if(r.kind===`Thunk`)return Hv(r.expression,r.scope,n);let i=r.operator;return i.kind===`Closure`?Hv(i.body,i.scope,n):0},a=e=>{if(n.variableIndex.has(e))return 1;if(n.constants.has(e))return 0;let t=ml(e,n);if(t)return Uv(t,n);let r=n.builtins.get(n.substitutions.get(e)??e);return r?r.isStateLevel&&!r.isLevelConstant?1:0:void 0},o=(e,t)=>r.has(e)?0:B(t)?i(e)??a(e)??0:a(e)??i(e)??0,s=e=>{let i={value:0};return Zo(e,(e,a)=>(i.value=Math.max(i.value,Hv(e,t,n,a.length===0?r:/* @__PURE__ */ new Set([...r,...a]))),e)),i.value};switch(e.kind){case`Prime`:case`Unchanged`:case`BoxAction`:case`AngleAction`:return 2;case`Enabled`:return 1;case`Always`:case`Eventually`:case`WeakFairness`:case`StrongFairness`:return 3;case`UnboundedQuantifier`:return e.isTemporal?3:s(e);case`Identifier`:return o(e.name,e);case`OperatorReference`:return o(e.operator,e);case`Apply`:return Lv.has(e.operator)?3:e.operator===`\\cdot`?2:Math.max(o(e.operator,e),s(e));default:return s(e)}},Uv=(e,t)=>{let n=Rv.get(e);if(n!==void 0)return n;Rv.set(e,0);let r=e.kind===`Function`?e.bounds:[],i=Math.max(Hv(e.body,void 0,t),...r.map(e=>Hv(e.set,void 0,t)));return Rv.set(e,i),i},Wv=(t,r)=>{try{return Dl(t,r)}catch(t){if(!(t instanceof y))throw t;if(!_a(t))return;throw n(new y(`${o(`tlc2.tool.EvalException`)}${t.message}`),e.error)}},Gv=(e,t,n,r,i=/* @__PURE__ */ new Set,a=!1,o)=>{let s=(e,t,s=o,c=i,l)=>Gv(e,t,n,r,c,a||l!==void 0&&n.substitutedDefinitions.has(l),s);if(e.kind===`And`)return e.operands.flatMap(e=>s(e,t,Zc(e)));if(e.kind===`Label`)return s(e.body,t);if(e.kind===`Let`)return s(e.body,Kv(e,t,n));if(e.kind===`Identifier`){let r=B(e)?sl(t,e.name):void 0;if(r?.kind===`Thunk`)return s(r.expression,r.scope);let a=n.constants.has(e.name)?void 0:ml(e.name,n);if(!r&&a?.kind===`Operator`&&a.params.length===0&&Uv(a,n)>0){if(i.has(a))throw Iv();return s(a.body,void 0,a.name,/* @__PURE__ */ new Set([...i,a]),a)}}let c=Bv(n,t);if(e.kind===`Apply`&&n.runtime.version!==`1.7.4`&&(r||Hv(e,t,n)===3)){let t=Ql(e,c),r=B(e)?void 0:ml(e.operator,n);if(t?.kind===`Closure`&&t.params.length===e.args.length&&!r?.isRecursive&&!a)return s(t.body,uu(t,e.args,c),e.operator,i,r)}let l=r&&e.kind===`Forall`&&e.bounds.every(e=>Hv(e.set,t,n)===0),u=l?Wv(e.bounds,c):void 0;if(l&&u){let n=[];if(Ol(e.bounds,u,t,t=>(n.push(...s(e.body,t,Zc(e.body))),!1)),n.length===0)throw Fv();return n}return[{expression:e,scope:t,name:o}]},Kv=(e,t,n)=>{let r=fu(e.definitions,Bv(n,t));for(let e=r;e&&e!==t;e=e.parent)e.binding.kind===`Thunk`&&zv.add(e.binding);return r},qv=(e,t)=>({kind:`AngleAction`,action:e,subscript:t,location:e.location}),Jv=(e,t,n)=>{let r=n.runtime.version===`1.7.4`,i=(e,t,i)=>{let a=i===0&&!r?Hv(e,t,n):i;if(a===0){let r=W(e,Bv(n,t));if(typeof r!=`boolean`)throw new y(`TLC expected a boolean value, but did not find one. ${Qc(e)}`);return ev(r)}return a===1?{kind:`State`,expression:e,scope:t}:{kind:`Action`,expression:e,unchanged:void 0,scope:t}},a={depth:0},o=(e,t,n,r)=>{if(a.depth>=100)throw Iv();a.depth++;let o=f(e,t);a.depth--;let s=ov(o);return s>2?o:i(n,r,s)},s=(e,t)=>{let i=e.kind===`Identifier`?e.name:e.operator,a=Bv(n,t),s=B(e)||ml(i,n)===void 0?sl(t,i):void 0;if(s?.kind===`Thunk`&&zv.has(s))return c(e,()=>o(s.expression,s.scope,e,t));let l=s?.kind===`Operator`?s.operator:s?void 0:B(e)?$l(i,a):Xl(i,n);if(l?.kind!==`Closure`)throw Vv(e);let u=e.kind===`Apply`?e.args:[],d=!B(e)&&ml(i,n)?.isRecursive===!0;return c(e,()=>(r&&u.filter(e=>e.kind!==`Lambda`&&e.kind!==`OperatorReference`).forEach(e=>W(e,a)),o(l.body,uu(l,u,a),e,t)),d)},c=(e,t,n=!1)=>{try{return t()}catch(t){let i=t instanceof x||n&&!r;throw!(t instanceof y)||i?t:Vv(e)}},l=(e,t)=>{let r=Hv(e,t,n);if(!e.bounds.every(e=>Hv(e.set,t,n)===0)){if(r<=2)return i(e,t,r);throw Vv(e)}let a=[],o=e.kind===`Forall`;try{kl(e.bounds,Bv(n,t),t=>(a.push(f(e.body,t)),!1))}catch(n){if(!(n instanceof y)||n instanceof x)throw n;if(r<=2)return i(e,t,r);throw Vv(e,o&&!_a(n)?n.message:void 0)}return a.length===0?ev(o):u(e,t,av(o?`And`:`Or`,a))},u=(e,t,n)=>{let r=ov(n);return r>2?n:i(e,t,r)},d=e=>e.kind===`Label`||e.kind===`Let`||e.kind===`And`||e.kind===`Or`||e.kind===`Forall`||e.kind===`Exists`||e.kind===`If`||e.kind===`Apply`&&(e.operator===`~`&&!B(e)||e.operator===`=>`),f=(e,t)=>{let a=Hv(e,t,n);if(a<=2&&!d(e))return i(e,t,a);switch(e.kind){case`Label`:return f(e.body,t);case`Let`:return f(e.body,Kv(e,t,n));case`Identifier`:return s(e,t);case`Apply`:{let n=e.args;return e.operator===`~>`?rv(`Always`,iv(`Or`,rv(`Not`,f(n[0],t)),rv(`Eventually`,f(n[1],t)))):e.operator===`~`&&!B(e)?u(e,t,rv(`Not`,f(n[0],t))):e.operator===`=>`?u(e,t,iv(`Or`,rv(`Not`,f(n[0],t)),f(n[1],t))):s(e,t)}case`And`:case`Or`:return u(e,t,av(e.kind,e.operands.map(e=>f(e,t))));case`Forall`:case`Exists`:return l(e,t);case`If`:{if(!r&&Hv(e.condition,t,n)===0){let r=W(e.condition,Bv(n,t));if(typeof r==`boolean`)return f(r?e.consequent:e.alternative,t)}let i=f(e.condition,t);return u(e,t,iv(`Or`,iv(`And`,i,f(e.consequent,t)),iv(`And`,rv(`Not`,i),f(e.alternative,t))))}case`Always`:case`Eventually`:return rv(e.kind,f(e.expression,t));case`WeakFairness`:case`StrongFairness`:{let n=qv(e.action,e.subscript),r={kind:`Enabled`,step:e.enabled??n,scope:t},i=rv(`Not`,r),a={kind:`Action`,expression:e.action,unchanged:{kind:`Unchanged`,expression:e.subscript,location:n.location},scope:t,enabled:r};return e.kind===`WeakFairness`?rv(`Always`,rv(`Eventually`,iv(`Or`,i,a))):iv(`Or`,rv(`Eventually`,rv(`Always`,i)),rv(`Always`,rv(`Eventually`,a)))}default:throw Vv(e)}};return f(e,t)},Yv=(e,t,n,r,i)=>{let a=e=>Yv(e,t,n,r,i);switch(e.kind){case`Boolean`:return e.value;case`State`:case`Enabled`:{let n=i.get(e);if(n!==void 0)return n;let a={environment:r,scope:e.scope,state:t,next:void 0},o=e.kind===`State`?pl(W(e.expression,a),`a temporal property predicate`):Bc(e.step,a);return i.set(e,o),o}case`Action`:{if(e.enabled&&i.get(e.enabled)===!1)return!1;let a={environment:r,scope:e.scope,state:t,next:n};return e.unchanged&&pl(W(e.unchanged,a),`a subscript`)?!1:pl(W(e.expression,a),`an action predicate`)}case`Not`:return!a(e.body);case`And`:return e.operands.every(a);case`Or`:return e.operands.some(a);case`Next`:return Yv(e.body,n??t,void 0,r,/* @__PURE__ */ new Map);case`Always`:case`Eventually`:throw new y(`TLC cannot evaluate a temporal formula in a single step`)}},Xv=(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)=>Xv(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 Yv(e,t[r],t[a(r)],i,/* @__PURE__ */ new Map)}},Zv=e=>{switch(e.kind){case`Always`:return!0;case`Eventually`:case`Not`:case`Next`:return Zv(e.body);case`And`:case`Or`:return e.operands.some(Zv);default:return!1}},Qv=e=>e.promises.some(e=>Zv(e.body))||e.models.some(e=>e.eventuallyAlways.length>0||e.infinitelyOftenStates.length>0||e.infinitelyOftenActions.length>0),$v=(e,t)=>e.every((e,n)=>en(e,t[n])),ey=e=>e.filter((t,n)=>n===0||e[n-1]!==t),ty=e=>({data:e(1024),length:0,create:e}),ny=(e,t,n)=>{let r=t+n.length;if(r>e.data.length){let t=e.create(Math.max(2*e.data.length,r));t.set(e.data),e.data=t}e.data.set(n,t),e.length=Math.max(e.length,r)},ry=e=>new Int32Array(e).fill(-1),iy=(e,t)=>(e.edgeStarts[t]??-1)!==-1,ay=(e,t)=>{let n=e.edgeStarts[t];return e.edgeTargets.data.subarray(n,n+e.edgeCounts[t])},oy=(e,t,n)=>e.stateResults.data[e.nodeStates[t]*e.solution.stateChecks.length+n]===1,sy=(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),cy=(e,t)=>{let n=[];for(let r=e.firstNodes.data[t]??-1;r!==-1;r=e.nextSiblings[r])n.push(r);return n},ly=2**53-1,uy=(e,t,n,r)=>{if(e.length===0)return;let i=t.map(e=>Jv(e.expression,e.scope,n)),a=e.map(e=>rv(`Not`,Jv(e.expression,e.scope,n))),o=a.length===1?a[0]:av(`Or`,a),s=i.length===0?o:av(`And`,[...i,o]),c=Pv(s);if(c.length===0)throw Fv();let l=/* @__PURE__ */ new Map,u=c.map(e=>({solution:e,actionIds:Int32Array.from(e.actionChecks,e=>{let t=uv(e),n=l.get(t)??l.size;return l.set(t,n),n}),nodeStates:[],nodeTableaux:[],edgeStarts:[],edgeCounts:[],edgeTargets:ty(e=>new Int32Array(e)),edgeActions:ty(e=>new Uint8Array(e)),stateResults:ty(e=>new Uint8Array(e)),initial:[],firstNodes:ty(ry),lastNodes:ty(ry),nextSiblings:[],isDone:[],errorNode:void 0})),d={multiplier:1},f=!Tu(n),p={environment:n},m={states:/* @__PURE__ */ new Map,actions:/* @__PURE__ */ new Map},h=e=>{let t=m.states.get(e)??/* @__PURE__ */ new Map;return m.states.set(e,t),t},g=(e,t)=>{n.runtime.setLivenessSource(e);let r=t();return n.runtime.setLivenessSource(void 0),r},_=(e,t)=>Yv(e,t,void 0,p.environment,f?h(t):/* @__PURE__ */ new Map),v=(e,t,n)=>g(t,()=>Uint8Array.from(e.solution.stateChecks,e=>+!!_(e,n))),b=(e,t,n,r)=>g(t,()=>{let t=e.solution.actionChecks;if(!f)return Uint8Array.from(t,e=>+!!Yv(e,n,r,p.environment,/* @__PURE__ */ new Map));let i=h(n),a=m.actions.get(n)??/* @__PURE__ */ new Map;m.actions.set(n,a);let o=a.get(r)??new Int8Array(l.size).fill(-1);return a.set(r,o),Uint8Array.from(e.actionIds,(e,a)=>(o[e]===-1&&(o[e]=+!!Yv(t[a],n,r,p.environment,i)),o[e]))}),x=(e,t,n,r)=>g(n,()=>e.nodes[t].statePredicates.every(e=>_(e,r))),ee=(e,t)=>{if(n.runtime.version===`1.7.4`)return!1;let r=e.nodes[t];return r.particle.length===0&&r.successors.length===1&&r.successors[0]===t},te=e=>e.solution.models.some(e=>e.eventuallyAlways.length===0&&e.infinitelyOftenStates.length===0&&e.infinitelyOftenActions.length===0),S=(e,t,n)=>e.solution.tableau?cy(e,t).find(t=>e.nodeTableaux[t]===n):t,ne=(e,t,n)=>{let r=sy(e,t,n),i=e.lastNodes.data[t]??-1;return i===-1?ny(e.firstNodes,t,[r]):e.nextSiblings[i]=r,ny(e.lastNodes,t,[r]),r},re=(e,t,n,r,i)=>{let a=e.edgeTargets.length,o=e.solution.actionChecks.length;ny(e.edgeTargets,a,n),r.forEach((t,n)=>ny(e.edgeActions,(a+n)*o,t)),ny(e.stateResults,e.nodeStates[t]*i.length,i),e.edgeStarts[t]=a,e.edgeCounts[t]=n.length},ie=(e,t,n)=>{let i={slots:Array.from({length:16*d.multiplier}),count:0},a=(e,t)=>{for(let n=(r.getFingerprint(t)&2147483647)%e.length;;n=(n+1)%e.length){let r=e[n];if(r===void 0)return e[n]=t,!0;if(r.index===t.index&&$v(r.state,t.state))return!1}},o=e=>{if(i.count>=i.slots.length>>1){let e=i.slots;i.slots=Array.from({length:2*e.length+1});for(let t of e)t&&a(i.slots,t)}a(i.slots,e)&&i.count++};return n.forEach(o),o({index:e,state:t}),i.slots.length>16*d.multiplier&&d.multiplier++,i.slots.filter(e=>e!==void 0)},C=(e,t,n,i,a)=>{let o=v(e,i,n),s=t.nodes[e.nodeTableaux[a]],c=[],l=[],u=s.successors.length>0?b(e,i,n,n):/* @__PURE__ */ new Uint8Array;for(let r of s.successors){if(!x(t,r,i,n))continue;if(ee(t,r)&&e.errorNode===void 0&&te(e)){e.errorNode=a;return}let o=S(e,i,r);if(o!==void 0&&l.includes(o))continue;let s=o??ne(e,i,r);l.push(s),c.push(u),o===void 0&&C(e,t,n,i,s)}for(let a of r.getSuccessors(i,n)){let r=b(e,i,n,a.state),o=e.isDone[a.index]===!0;for(let n of s.successors){if(!x(t,n,i,a.state)||a.index===-1)continue;let s=S(e,a.index,n);if(s!==void 0&&l.includes(s))continue;let u=s??ne(e,a.index,n);l.push(u),c.push(r),s===void 0&&o&&C(e,t,a.state,a.index,u)}}l.length>0&&re(e,a,l,c,o)},ae=(e,t,n,r,i,a)=>{let o=t.nodes.map((e,r)=>n.map(e=>x(t,r,a,e.state)));e.isDone[a]=!0;for(let s of cy(e,a)){let a=[],c=[];n.forEach((n,i)=>{let l=e.isDone[n.index]===!0;for(let u of t.nodes[e.nodeTableaux[s]].successors){if(!o[u][i])continue;let s=S(e,n.index,u);if(s!==void 0&&a.includes(s))continue;let d=s??ne(e,n.index,u);a.push(d),c.push(r[i]),s===void 0&&l&&C(e,t,n.state,n.index,d)}}),re(e,s,a,c,i)}if(e.errorNode!==void 0)return ey(se(e,e.errorNode).reverse().map(t=>e.nodeStates[t]))},oe=(e,t,n,r,i)=>{for(;e.nodeStates.length<=i;)sy(e,e.nodeStates.length,-1);let a=[],o=[];t.forEach((t,r)=>{iy(e,t.index)&&a.includes(t.index)||(a.push(t.index),o.push(n[r]))}),re(e,i,a,o,r)},se=(e,t)=>{if(e.initial.includes(t))return[t];let n=/* @__PURE__ */ new Map,r=[];for(let t of e.initial)iy(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 ay(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}iy(e,i)&&!n.has(i)&&(n.set(i,a),r.push(i))}}throw new y(`Couldn't re-create liveness trace (path) starting at: ${t}`)},w=(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=>iy(e,t)),c=[],l=t=>{let n=ay(e,t).indexOf(t);return n!==-1&&a(t,n)},u=(t,r)=>n.tableau!==void 0&&jv(n.tableau.nodes[e.nodeTableaux[t]].particle,r),d=r=>{let s=c.pop()??r;if(s===r&&!l(s)){o[s]=ly;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]=ly,t===r)break}let m=t.infinitelyOftenStates.every(t=>[...d].some(n=>oy(e,n,t))),h=t.infinitelyOftenActions.every(t=>[...d].some(n=>ay(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=ey(se(e,r).reverse().map(t=>e.nodeStates[t])),l=[],d=/* @__PURE__ */ new Set([r]),f=t.infinitelyOftenStates.map(()=>!1),m=t.infinitelyOftenActions.map(()=>!1),h=n.promises.map(()=>!1),g={count:f.length+m.length+h.length},_={node:r},v=e=>o.has(e),b=e=>{l.push(_.node),_.node=e};for(;g.count>0;){let r=g.count;for(;t.infinitelyOftenStates.forEach((t,n)=>{!f[n]&&oy(e,_.node,t)&&(f[n]=!0,g.count--)}),n.promises.forEach((e,t)=>{!h[t]&&u(_.node,e)&&(h[t]=!0,g.count--)}),!(g.count<=0);){let n={last:-1,unvisited:-1},o=g.count;if(ay(e,_.node).some((r,c)=>{if(s.has(e.nodeStates[r])){if(!v(r)||!a(_.node,c))return!1;n.last=r,t.infinitelyOftenActions.forEach((e,t)=>{!m[t]&&i(_.node,c,e)&&(m[t]=!0,g.count--)})}return g.count<o?(b(r),d.clear(),!0):(v(r)&&!d.has(r)&&(n.unvisited=r),!1)}))break;if(g.count<r){b(n.last),d.clear();break}for(;n.unvisited===-1;){let t=l.pop();if(t===void 0)throw new y(`TLC failed to build the counterexample of a liveness property`);_.node=t,n.unvisited=ay(e,t).find(e=>v(e)&&!d.has(e))??-1}b(n.unvisited),d.add(n.unvisited)}}let x=p(r,_.node,s,a);for(let t=l.length-1;t>=0;t--){let n=e.nodeStates[l[t]];x[x.length-1]!==n&&x.push(n)}let ee=c[c.length-1];return x[x.length-1]===ee&&x.pop(),{prefix:c.slice(0,-1),cycle:[ee,...x.reverse()],isCycleConstrained:Qv(n)}},p=(t,n,r,i)=>{if(n===t)return[];let a=e.nodeStates[n],o=/* @__PURE__ */ new Map,s=/* @__PURE__ */ new Set([a]),c=[];for(let n=a,l=-1,u=0;;u++){for(let u of r.get(n)??[])for(let[d,f]of ay(e,u).entries()){if(f===u||!i(u,d))continue;if(f===t){let e=[];for(let t=n,r=l;t!==a;)e.push(t),t=r,r=o.get(t)??-1;return e.push(a),e}let p=e.nodeStates[f];r.has(p)&&!s.has(p)&&(s.add(p),c.push([p,n]))}o.set(n,l);let d=c[u];if(d===void 0)throw new y(`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={link:0};for(;n.length>=3;){let t=n.pop()??0,i=n.pop(),l=n.pop()??0;if(i===-42){if(o[l]===t){let e=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.link,n.push(t,l,-42),c.push(l);let u={value:r.link++};ay(e,l).forEach((t,r)=>{iy(e,t)&&(a(l,r)?o[t]===-1?n.push(t,-1):u.value=Math.min(u.value,o[t]):o[t]===-1&&s.push(t))}),n.push(u.value)}}};return{branches:u.length,addInitialState:(e,t,r)=>{p.environment=r??n,m.states.clear(),m.actions.clear();try{for(let n of u){let r=n.solution.tableau;if(!r)n.initial.push(e);else for(let i=0;i<r.initialCount;i++)x(r,i,void 0,t)&&n.initial.push(S(n,e,i)??ne(n,e,i))}}finally{p.environment=n}},addState:(e,t,r,i)=>{p.environment=i??n,m.states.clear(),m.actions.clear();try{let n=ie(e,t,r);for(let r of u){let i=n.map(n=>b(r,e,t,n.state)),a=v(r,e,t),o=r.solution.tableau,s=o?ae(r,o,n,i,a,e):oe(r,n,i,a,e);if(s)return s}return}finally{p.environment=n}},findViolation:()=>{for(let e of u)for(let t of e.solution.models){let n=w(e,t);if(n)return n}},getViolatedProperties:(t,r)=>[...new Set(e.filter((e,i)=>!Xv(a[i].body,t,r,0,n)).map(e=>e.name))]}},dy=`UnnamedAction`,fy={module:`--TLA+ BUILTINS--`,start:{line:0,column:0},end:{line:0,column:0}},py=e=>{let t=e.range??fy;return Xn([[`beginLine`,t.start.line],[`beginColumn`,t.start.column],[`endLine`,t.end.line],[`endColumn`,t.end.column],[`module`,t.module]])},my=e=>{let t=[[`name`,e.name],[`location`,py(e.location)]];return e.parameters.length===0?Xn(t):Xn([...t,[`context`,Xn(e.parameters)],[`parameters`,Yn(e.parameters.map(e=>e[0]))]])},hy=(e,t)=>({name:e,location:t.location,parameters:[],expression:t,scope:void 0}),gy=(e,t)=>({environment:e,scope:t,state:void 0,next:void 0}),_y=e=>e.kind===`Identifier`?e.name:e.kind===`Apply`?e.operator:void 0,vy=e=>e.kind===`Apply`?e.args:[],yy=(e,t,n)=>{let r=_y(e);if(r===void 0)return;if(B(e)){let e=sl(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=Xl(r,n);return i?.kind===`Closure`?i:void 0},by=(e,t)=>{try{return W(e,gy(t,void 0)),!0}catch(e){if(e instanceof l)return!1;throw e}},xy=(e,t)=>e?.kind===`Operator`&&e.params.length===0&&e.body.kind!==`Number`&&e.body.kind!==`String`&&vl(e,t)&&by(e.body,t),Sy=(e,t)=>{let n=ml(e.name,t);return n?.body===e.body&&xy(n,t)},Cy=(e,t)=>{if(e.kind!==`Identifier`||!B(e))return;let n=sl(t,e.name);return n?.kind===`Thunk`?n:void 0},wy=(e,t)=>(e?.params??[]).flatMap(e=>{let n=sl(t,e.name);return n?.kind===`Value`?[[e.name,n.value]]:[]}),Ty=(e,t)=>{try{return e()}catch(e){if(e instanceof l)return t();throw e}},Ey=(e,t,n,r,i)=>{let a=vy(t),o=()=>[{name:e.name,location:t.location,parameters:[],expression:t,scope:n}];return!r||a.length===0?[{...e,parameters:[],expression:t,scope:n}]:a.some(e=>Hv(e,n,i)!==0)?o():Ty(()=>[{...e,parameters:a.map((e,t)=>[r.params[t].name.replace(/#\d+$/,``),W(e,gy(i,n))]),expression:t,scope:n}],o)},Dy=(e,t,n,r,i)=>{let a=()=>({name:n?.name??dy,location:e.location,parameters:wy(n,t),expression:e,scope:t});switch(e.kind){case`Let`:return Dy(e.body,fu(e.definitions,gy(r,t)),n,r,i);case`Label`:return Dy(e.body,t,n,r,i);case`Or`:return e.operands.flatMap(e=>Dy(e,t,n,r,i));case`Exists`:return Ty(()=>{let o=[];return kl(e.bounds,gy(r,t),t=>(o.push(...Dy(e.body,t,n,r,i)),!1)),o.length===0?[a()]:o},()=>[a()])}let o=B(e)?void 0:i.get(_y(e)??``),s=yy(e,t,r);if(o)return Ey(o,e,t,s,r);if(!s)return[a()];let c=vy(e),l=B(e)?s.name:r.instanceNames.get(_y(e)??``)??s.name,u=()=>[{name:l,location:e.location,parameters:[],expression:e,scope:t}];return Sy(s,r)||c.some(e=>Hv(e,t,r)!==0)?u():Ty(()=>{let e=c.reduce((e,n,i)=>({name:s.params[i].name,binding:{kind:`Value`,value:W(n,gy(r,t))},parent:e}),s.scope);return Dy(s.body,e,{...s,name:l},r,i)},u)},Oy=(e,t,n,r,i)=>{let a=(e,t)=>Oy(e,t,n,r,i);if(e.kind===`Let`){a(e.body,fu(e.definitions,gy(n,t)));return}let o=Cy(e,t);if(o){a(o.expression,o.scope);return}let s=yy(e,t,n);if(s&&Sy(s,n))return;if(s&&s.params.length===0){if(Hv(s.body,s.scope,n)===1){r.inits.push(hy(s.name,s.body));return}a(s.body,s.scope);return}if(s&&e.kind===`Apply`&&s.params.length===e.args.length){a(s.body,uu(s,e.args,gy(n,t)));return}if(e.kind===`And`){e.operands.forEach(e=>a(e,t));return}if(e.kind===`Always`){if(e.expression.kind===`BoxAction`){i.push({expression:e.expression.action,scope:t});return}r.temporals.push(hy(dy,e));return}let c=Hv(e,t,n);c<=1?r.inits.push(hy(dy,e)):c===3&&r.temporals.push(hy(dy,e))},ky=(e,t,n,r,i)=>{let a=(t,n)=>ky(e,t,n,r,i);if(t.kind===`Let`){a(t.body,fu(t.definitions,gy(r,n)));return}let o=Cy(t,n);if(o){a(o.expression,o.scope);return}let s=yy(t,n,r);if(s&&Sy(s,r))return;if(s&&s.params.length===vy(t).length){a(s.body,t.kind===`Apply`?uu(s,t.args,gy(r,n)):s.scope);return}if(t.kind===`Forall`&&Ty(()=>(kl(t.bounds,gy(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(hy(e,a)):Hv(a,n,r)<2?i.invariants.push(hy(e,a)):i.impliedTemporals.push(hy(e,t));return}let c=Hv(t,n,r);c<=1?i.impliedInits.push(hy(e,t)):c===3&&i.impliedTemporals.push(hy(e,t))},Ay=(e,t)=>{let n=ml(e,t);return n?.kind===`Operator`&&!xy(n,t)?n:void 0},jy=e=>Xn([[`name`,e.name],[`location`,py(e.location)]]),My=(e,t,n)=>{let r={inits:[],actions:[],temporals:[],invariants:[],impliedInits:[],impliedActions:[],impliedTemporals:[]},i=[],a=e.specification===void 0?void 0:Ay(e.specification,t);a&&(Oy(a.body,void 0,t,r,i),i.forEach(e=>r.actions.push(...Dy(e.expression,e.scope,void 0,t,n))));let o=e.init===void 0?void 0:Xl(e.init,t);o?.kind===`Closure`&&r.inits.push(hy(e.init??``,o.body));let s=e.next===void 0?void 0:Xl(e.next,t);return s?.kind===`Closure`&&r.actions.push(...Dy(s.body,s.scope,s,t,n)),e.invariants.forEach(e=>{let n=Ay(e,t);n&&r.invariants.push(hy(e,n.body))}),e.properties.forEach(e=>{let n=Ay(e,t);n&&ky(e,n.body,void 0,t,r)}),r},Ny=(e,t,n)=>My(e,t,n).inits,Py=(e,t,n)=>My(e,t,n).actions,Fy=e=>e.parameters.length===0?``:`(${e.parameters.map(e=>z(e[1])).join(`,`)})`,Iy=(e,t)=>`${e.name===dy?`Action`:e.name}${t===`1.7.4`?``:Fy(e)} ${g(e.location.range??fy)}`,Ly=e=>`${e.name}${Fy(e)}`,Ry=(e,t,n,r)=>{let i=My(e,t,r),a=e=>Nn(e.map(my)),o=e=>Nn(e.flatMap(e=>{let n=Ay(e,t);return n?[jy(n)]:[]}));return Xn([[`inits`,a(i.inits)],[`actions`,a(i.actions)],[`temporals`,a(i.temporals)],[`invariants`,a(i.invariants)],[`impliedinits`,a(i.impliedInits)],[`impliedactions`,a(i.impliedActions)],[`impliedtemporals`,a(i.impliedTemporals)],[`variables`,Nn(t.variables.map((e,t)=>Xn([[`name`,e],[`location`,py(n[t])]])))],[`actionconstraints`,o(e.actionConstraints)],[`constraints`,o(e.constraints)]])},zy=`paired12`,By=(e,t=16)=>e<=t*.75?t:By(e,t*2),Vy=(e,t)=>{let n=By(e.length)-1,r=e=>{let r=t(e);return(r^r>>>16)&n};return e.map((e,t)=>({key:e,position:t,bucket:r(e)})).sort((e,t)=>e.bucket-t.bucket||e.position-t.position).map(e=>e.key)},Hy=e=>Number(BigInt.asIntN(32,e^BigInt.asUintN(64,e)>>32n)),Uy=e=>[...Array(e.length).keys()].reduce((t,n)=>Math.imul(31,t)+e.charCodeAt(n)|0,0),Wy=e=>e.replaceAll(`\\`,`\\\\`).replaceAll(`"`,`\\"`).trim(),Gy=e=>Wy(e).replaceAll(`
|
|
468
|
+
`,`\\n`),Ky=(e,t)=>{let n=[],r=e=>n.push(`State ${n.length+1}:\n${e.getText()}\n`);return{writeInitialState:r,writeSuccessor:(e,t,n)=>{n||r(t)},writeStuttering:r,close:()=>t?.(e.path,n.join(``))}},qy=(e,t,n)=>{let r=n===`1.7.4`,i=[`strict digraph DiskGraph {
|
|
469
|
+
`,r?``:`node [shape=box,style=rounded]
|
|
470
|
+
`,e.colorize?`edge [colorscheme="${zy}"]\n`:``,`nodesep=0.35;
|
|
423
471
|
`,`subgraph cluster_graph {
|
|
424
472
|
`,`color="white";
|
|
425
|
-
`],
|
|
426
|
-
`,`node [ labeljust="l",colorscheme="${
|
|
427
|
-
`,e.colorize&&
|
|
473
|
+
`],a=/* @__PURE__ */ new Map,o=/* @__PURE__ */ new Map,s=e=>{let t=a.get(e.level)??/* @__PURE__ */ new Set;a.set(e.level,t.add(e.fingerprint))},c=e=>{if(!e)return 1;let t=o.get(e.name)??o.size+2;return o.set(e.name,t),t},l=()=>[`subgraph cluster_legend {graph[style=bold];label = "Next State Actions" style="solid"
|
|
474
|
+
`,`node [ labeljust="l",colorscheme="${zy}",style=filled,shape=record ]\n`,...Vy([...o.keys()],Uy).map(e=>`${e.replaceAll(`!`,`:`)} [label="${e}",fillcolor=${o.get(e)}]\n`),`}`].join(``),u=()=>[...Vy([...a],e=>e[0]).map(e=>`{rank = same; ${Vy([...e[1]],Hy).map(e=>`${e};`).join(``)}}\n`),`}
|
|
475
|
+
`,e.colorize&&o.size>1?l():``,`}`].join(``),d=()=>{e.snapshot&&t?.(e.path.replaceAll(`.dot`,`_snapshot.dot`),i.join(``)+u())};return{writeInitialState:e=>{i.push(`${e.fingerprint} [label="${Gy(e.getLabel())}",style = filled]\n`),s(e),d()},writeSuccessor:(t,n,a,o)=>{let l=e.colorize?String(c(o)):`black`,u=e.actionLabels&&o?Wy(r?o.name:o.signature):``;if(i.push(`${t.fingerprint} -> ${n.fingerprint} [label="${u}",color="${l}",fontcolor="${l}"];\n`),!a){let e=r?``:`,tooltip="${Gy(n.getText())}"`;i.push(`${n.fingerprint} [label="${Gy(n.getLabel())}"${e}];\n`)}s(t),d()},writeStuttering:e=>{i.push(`${e.fingerprint} -> ${e.fingerprint} [style="dashed"];\n`),s(e),d()},close:()=>t?.(e.path,i.join(``)+u())}},Jy=(e,t,n)=>e.dot?qy(e,t,n):Ky(e,t),Yy=e=>[...e].map(([e,t])=>`${e}>${t.name}`).sort().join(`,`),Xy=(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},Zy=t=>n(new y(`${s}${t}`),e.error),Qy=e=>{let t=Dr(e),n=/* @__PURE__ */ new Map;return t.domain.forEach((e,r)=>{let i=t.range[r];if(!I(e)||!I(i))throw Zy(`Symmetry function must have model values as domain and range.`);e.name!==i.name&&n.set(e.name,i)}),n},$y=e=>{if(e.kind===`Identifier`)return e.name;if(e.kind!==`Apply`)return``;let t=e.args.map($y);return/^[A-Za-z_]/.test(e.operator)?`${e.operator}(${t.join(`,`)})`:t.join(e.operator)},eb=e=>e.kind===`Apply`&&e.operator===`Permutations`&&e.args.length===1,tb=(e,t,n)=>{let r=t.definitions.get(e);if(r===void 0&&!t.constants.has(e))throw new v(`The symmetry function ${e} specified in the configuration file\nis not defined in the specification.`);if(r?.kind!==`Operator`||r.params.length>0)throw Zy(`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(!P(a)||!L(a))throw Zy(`The symmetry operator must specify a set of functions.`);let o=R(a).elements;if(!o.every(F))throw Zy(`The symmetry values must be function records.`);let s=o.map(Qy),c=r.body.kind===`Apply`?r.body.args:[],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=$y(eb(e)?e.args[0]:e);return l.get(t)??t}),r=e.length>1;t.runtime.warn(sa.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;s.forEach(e=>{e.size>0&&d.set(Yy(e),e)});let f=[...d.values()],p={start:0};for(;p.start<d.size;){let e=[...d.values()],t=e.length;f.forEach(n=>e.slice(p.start,t).forEach(e=>{let t=Xy(n,e),r=Yy(t);t.size>0&&!d.has(r)&&d.set(r,t)})),p.start=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(!eb(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=>I(e)&&m.has(e.name))})),d.size===0)return;let g=Math.max(256,Math.floor(4194304/d.size));return{permutations:[...d.values()].map(e=>({images:e,cache:/* @__PURE__ */ new WeakMap,cacheSize:0,cacheLimit:g})),orbits:/* @__PURE__ */ new WeakMap,orbitCount:0,orbitLimit:g}},nb=(e,t)=>{for(let n=0;n<e.length;n++){let r=e[n],i=ab(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(ab(e[r],t));return a}},rb=(e,t)=>{let n=[],r=[];for(let i of e){let e=ab(i,t);e===i?n.push(i):r.push(e)}if(r.length===0)return;r.sort(It);let i=[],a=0,o=0;for(;a<n.length&&o<r.length;)i.push(It(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},ib=e=>e.kind===`Set`?e.elements.length:e.kind===`Function`?e.domain.length:0,ab=(e,t)=>{if(typeof e!=`object`)return e;if(e.kind===`ModelValue`)return t.images.get(e.name)??e;let n=ib(e);if(n===0||n>64)return ob(e,t);let r=t.cache.get(e);if(r!==void 0)return r;let i=ob(e,t),a=i!==e&&en(i,e)?e:i;return t.cacheSize>=t.cacheLimit&&(t.cache=/* @__PURE__ */ new WeakMap,t.cacheSize=0),t.cache.set(e,a),t.cacheSize++,a},ob=(e,t)=>{let n=e.kind;if(n===`Set`){let n=rb(e.elements,t);return n?zt(n):e}if(n===`Function`||n===`LazyFunction`&&L(e.domain)){let n=Dr(e),r=nb(n.domain,t),i=nb(n.range,t)??n.range;if(r){let e=zn(r.map((e,t)=>[e,i[t]]));return e.domain.every((e,t)=>e===n.domain[t])?Bt(n.domain,e.range):e}return i===n.range?n:Bt(n.domain,i)}if(n===`Interval`||!P(e)||!L(e))return e;let r=R(e),i=nb(r.elements,t);return i?Nn(i):r},sb=(e,t)=>{let n=t.orbits.get(e);if(n!==void 0)return n;t.orbitCount>=t.orbitLimit&&(t.orbits=/* @__PURE__ */ new WeakMap,t.orbitCount=0);let r={images:[e],comparisons:[]};return t.orbits.set(e,r),t.orbitCount++,r},cb=(e,t,n)=>e.images[t]??=ab(e.images[0],n.permutations[t-1]),lb=(e,t,n,r)=>{let i=sb(e,r),a=i.comparisons[n]??=new Int8Array(r.permutations.length+1);if(a[t]===0){let e=It(cb(i,t,r),cb(i,n,r));a[t]=Math.sign(e)+2}return a[t]-2},ub=(e,t,n,r,i)=>{for(let a of i){let i=e[a],o=typeof i==`object`?lb(i,t,n,r):0;if(o!==0)return o<0}return!1},db=(e,t,n)=>{let r=t.permutations.reduce((r,i,a)=>ub(e,a+1,r,t,n)?a+1:r,0);return r===0?e:e.map(e=>typeof e==`object`?cb(sb(e,t),r,t):e)},fb=(e,t)=>e*((t-e)/2**64),pb=e=>e.includes(`.`)?e:`${e}.0`,mb=e=>{let t=Math.abs(e);if(t>=.001&&t<1e7)return pb(String(e));let[n,r]=e.toExponential().split(`e`);return`${pb(n)}E${r.replace(`+`,``)}`},hb=e=>e!==void 0&&e>=`0`&&e<=`9`,gb=e=>{if(e===0)return`0.0`;let t=mb(e),n={next:0,digits:0,result:``};for(;t[n.next]===`0`;)n.next++;for(;hb(t[n.next]);)n.result+=t[n.next++],n.digits++;if(n.next===t.length)return n.result;if(t[n.next]!==`.`)return t;if(n.next++,n.digits>=2)for(;hb(t[n.next]);)n.next++;else{if(n.result+=`.`,n.digits===0)for(;t[n.next]===`0`;)n.result+=t[n.next++];for(;hb(t[n.next])&&n.digits<2;)n.result+=t[n.next++],n.digits++;for(hb(t[n.next])&&Number(t[n.next])>=5&&(n.result=_b(n.result));hb(t[n.next]);)n.next++}return n.next>=t.length?n.result:t[n.next]===`E`?`${n.result}${t.slice(n.next)}`:t},_b=e=>{let t=e.length-1;if(t<0)return`1`;let n=e[t],r=e.slice(0,t);return n===`.`?`${_b(r)}.`:n===`9`?`${_b(r)}0`:`${r}${Number(n)+1}`},vb=e=>{let t={value:0};for(;10n**BigInt(t.value+1)<e*10n;)t.value++;let n=10n**BigInt(t.value+1),r=n/e,i=n%e*2n>=e;return Number(`${r+(i?1n:0n)}e-${t.value+1}`)},yb=(e,t,n)=>{if(fb(e,t)<1e-10)return;let r=n().sort(),i=new Int32Array(r.buffer),a={narrow:1/0,wide:9223372036854775807n};for(let e=1;e<r.length;e++){let t=i[2*e+1],n=i[2*e-1];if(t<0!=n<0)continue;let o=t-n;if(o<=1048576){let t=o*4294967296+(i[2*e]>>>0)-(i[2*e-2]>>>0);a.narrow=Math.min(a.narrow,t)}else{let t=r[e]-r[e-1];t<a.wide&&(a.wide=t)}}if(a.narrow===1/0)return a.wide;let o=BigInt(a.narrow);return o<a.wide?o:a.wide},bb=e=>{let t=e.reduce((e,t)=>e+t,0);if(t===0)return;let n=e.flatMap((e,t)=>e>0?[t]:[]),r=e.reduce((e,t,n)=>e+t*n,0),i=Math.floor(t*.95),a={count:0},o=n.find(t=>(a.count+=e[t],a.count>i));return`The average outdegree of the complete state graph is ${Math.round(r/t)} (minimum is ${n[0]}, the maximum ${n[n.length-1]} and the 95th percentile is ${o}).`},xb=(e,t)=>({...e,traceOutput:[...e.traceOutput??[],...t]}),Sb={line:0,column:0},Cb=`Failed to recover the initial state from its fingerprint.`,wb=`Failed to recover the next state from its fingerprint.`,Tb=e=>({kind:`Identifier`,name:e,location:Sb}),Eb=/* @__PURE__ */ new Set([`name`,`property`]),Db=(e,t,n)=>{let r=ml(t,n);if(!r)throw new v(`The ${e} ${t} specified in the configuration file\nis not defined in the specification.`);if(r.kind===`Operator`&&r.params.length>0)throw new v(Eb.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},Ob=(e,t,n)=>{if(vl(t,n)&&t.body.kind!==`Number`&&t.body.kind!==`String`)try{return W(Tb(e),Zb(n,void 0,void 0))}catch(e){if(e instanceof y||c(e))return;throw e}},kb=(e,t,n)=>{let r=Db(e,t,n);if(Ob(t,r,n)!==void 0)throw new v(`The ${e} ${t} cannot be a constant.`);return r},Ab=(e,t,n)=>{let r=n.constants.has(t)?void 0:Db(e,t,n),i=r?Ob(t,r,n):n.constants.get(t);if(i!==void 0&&i!==!0)throw new v(`The ${e} of ${t} is equal to ${z(i)}`);return i===void 0?r:void 0},jb=(e,t)=>{e>1&&!(e&e-1)&&t?.({kind:`initial-states-progress`,count:e})},Mb=(e,t,n)=>{let r=e.environment,i=/* @__PURE__ */ new Set;r.runtime.warn=(e,t)=>{i.has(t)||(i.add(t),n?.({kind:`warning`,code:e,text:t}))},n?.({kind:`parsed`}),e.javaOverrides.forEach(e=>n?.({kind:`java-override`,...e})),Kl(e.startupDefinitions,r),t.invariants.forEach(e=>{Ab(`invariant`,e,r)||n?.({kind:`constant-level-invariant`,name:e})})},Nb=(t,r)=>{let i=u_({constants:new Set(r.constants.keys()),variables:new Set(r.variables),getDefinition:e=>ml(e,r)});return t.flatMap(t=>{let a=Ab(`invariant`,t,r);if(!a)return[];let o=i.analyzeDefinition(a,/* @__PURE__ */ new Map);if(o.level>=2){let r=o.params.size===0?``:`
|
|
428
476
|
Note that a bug can cause TLC to incorrectly report this error.
|
|
429
477
|
If you believe your TLA+ or PlusCal specification to be correct,
|
|
430
|
-
please check if this bug described in LevelNode.java starting at line 590ff affects you.`;throw n(new _(`The invariant ${t} is not a state predicate (one with no primes or temporal operators).${r}`),e.safetyEvaluationFailure)}return[{name:t,expression:Ch(t),scope:void 0}]})},Ah=(e,t)=>{if(!F(e))return;let n=W(e);if(!n.domain.every(e=>typeof e==`string`))return;let r=n.domain.map((e,t)=>[String(e),n.range[t]]);return Object.fromEntries(r.sort((e,n)=>t.indexOf(e[0])-t.indexOf(n[0])))},jh=(e,t)=>{if(e.kind===`And`)return e.operands.flatMap(e=>jh(e,t));if(e.kind===`Identifier`&&!t.constants.has(e.name)){let n=Io(e.name,t);if(n?.kind===`Operator`&&n.params.length===0)return jh(n.body,t)}return[e]},Mh=(e,t,n)=>{let r=e.expression;if(r.kind!==`Identifier`||Xp(r,e.scope,t)>0)return!1;let i=Z(r,Kh(t,void 0,void 0,e.scope));if(i===!1)throw new _(`The spec is trivially false because ${r.name} is false.`);if(i!==!0)throw new _(`The operator ${r.name}, which equals ${G(i)},\ncannot be used as a ${n}`);return!0},Nh=(t,r)=>{if(t.specification===void 0){let e=(e,t)=>{if(e===void 0)return;let n=Th(t,e,r).body,i=Ch(e);if(n.kind!==`Number`&&n.kind!==`String`&&Xp(i,void 0,r)===0)throw new _(`The ${t} ${e} cannot be a constant.`);return i};return{init:e(t.init,`initial predicate`),next:e(t.next,`next state action`),scope:void 0,temporals:[]}}let i=[],a=[],o=[],s=Th(`name`,t.specification,r),c=Dh(t.specification,s,r);if(c!==void 0)throw new _(`The value of ${t.specification} is equal to ${G(c)}`);if($p(s.body,void 0,r,!1).forEach(s=>{let c=s.expression;if(Mh(s,r,`spec`))return;if(c.kind===`UnboundedQuantifier`&&c.isTemporal)throw n(new _(`TLC does not support temporal existential, nor universal, quantification over state variables.`),e.error);if(c.kind===`Always`&&c.expression.kind===`BoxAction`){a.push({expression:c.expression.action,scope:s.scope});return}if(c.kind===`Always`&&Xp(c.expression,s.scope,r)<2)throw n(new _(`TLC cannot handle the temporal formula ${xo(c.expression)}`),e.error);let l=Xp(c,s.scope,r);if(l===3)o.push(s);else{if(l===2)throw new _(`TLC cannot handle the action-level conjunct of the specification ${t.specification}`);i.push(s)}}),a.length>1)throw new _(`The specification ${t.specification} must contain at most one [][Next]_vars`);let l=[...i,...a],u=e=>`$specification${e}`,d=l.reduce((e,t,n)=>t.scope===void 0?e:{name:u(n),binding:{kind:`Thunk`,expression:t.expression,scope:t.scope,state:void 0,next:void 0,cache:void 0},parent:e},void 0),f=(e,t)=>e.scope===void 0?e.expression:{kind:`Identifier`,name:u(t),location:e.expression.location,resolution:{kind:`Local`}};return{init:i.length===0?void 0:{kind:`And`,operands:i.map(f),location:bh},next:a.length===0?void 0:f(a[0],i.length),scope:d,temporals:o}},Ph=(e,t)=>{let n={initialPredicates:[],invariants:[],actionProperties:[],liveness:[]};return e.properties.forEach(e=>{let r=Oh(`property`,e,t);r&&$p(r.body,void 0,t,!0,e).forEach(r=>{let i=r.expression;if(Mh(r,t,`property`))return;if(i.kind===`Always`&&i.expression.kind===`BoxAction`){n.actionProperties.push({name:r.name,box:i.expression,action:i.expression.action,subscript:i.expression.subscript,scope:r.scope});return}if(i.kind===`Always`&&Xp(i.expression,r.scope,t)<=1){let e=i.expression;n.invariants.push({name:e.kind===`Identifier`?e.name:r.name,expression:e,scope:r.scope});return}let a=Xp(i,r.scope,t);if(a<2)n.initialPredicates.push({name:r.name,expression:i,scope:r.scope});else{if(a===2)throw new _(`The property ${e} is an action-level formula`);n.liveness.push({name:e,expression:i,scope:r.scope})}})}),n},Fh=(e,t,n)=>t.flatMap(t=>Oh(e,t,n)?[{name:t,expression:Ch(t),scope:void 0}]:[]),Ih=(e,t)=>{let n=Io(e,t);return n?.kind===`Operator`?n.bodyRange:void 0},Lh=(e,t)=>e.map((n,r)=>{if(e.indexOf(n)!==r)throw new _(`_POSSIBLE lists ${n} more than once`);Eh(`possible`,n,t);let i=Ch(n);if(Xp(i,void 0,t)===3)throw new _(`The possible of ${n} is equal to a temporal formula; only state- and action-level predicates are supported`);return{name:n,expression:i,scope:void 0}}),Rh=(e,t,n)=>{if(e.kind!==`Apply`||e.operator!==`\\in`||t?.length!==1)return;let r=e.args[0];if(!(r.kind!==`Identifier`||K(r)))return n.variableIndex.get(r.name)===t[0]?{variable:t[0],set:e.args[1]}:void 0},zh=(e,t)=>e.flatMap(e=>jh(e.expression,t).map(n=>{let r=e.scope===void 0?wc(n,t):void 0;return{name:e.name,expression:n,scope:e.scope,variables:r,membership:Rh(n,r,t)}})),Bh=(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},Vh=/[\u0100-\uffff]/,Hh=/* @__PURE__ */ new Set([`JsonDeserialize`,`ndJsonDeserialize`]),Uh=e=>e.kind===`String`?Vh.test(e.value):e.kind===`Set`&&e.elements.some(Uh),Wh=e=>e.kind===`String`&&Vh.test(e.value)||e.kind===`Apply`&&Hh.has(e.operator)||lr(e).some(Wh),Gh=(e,t)=>e.constants.some(e=>Uh(e.value)||(e.args??[]).some(Uh))||[...t.definitions.values()].some(e=>Wh(e.body)||e.kind===`Function`&&e.bounds.some(e=>Wh(e.set))),Kh=(e,t,n,r)=>({environment:e,scope:r,state:t,next:n}),qh=(e,t,n)=>Fo(Z(e,t),n),Jh=(e,t,n=Yh)=>{let r=Z(e,t);if(typeof r!=`boolean`)throw new v(n(e,t.environment));return r},Yh=(e,t)=>{let n=e.kind===`Identifier`?Io(e.name,t):void 0,r=n?.kind===`Operator`?n.body:e,i=n?.kind===`Operator`?n.bodyRange:void 0;return`TLC expected a boolean value, but did not find one. ${r.kind===`Number`?r.text??String(r.value):i?h(i):xo(r)}`},Xh=()=>{},Zh=(e,t,n)=>e.forEach(e=>{let r=t.possibleCounts.get(e.name)??0,i=qh(e.expression,n,`_POSSIBLE ${e.name}`);t.possibleCounts.set(e.name,i?r+1:r)}),Qh=(e,t,n)=>{try{return qh(e,Kh(t,void 0,void 0),n)?void 0:{message:void 0}}catch(e){if(e instanceof v)return{message:e.message};throw e}},$h=(e,t)=>{for(let n of e.filter(e=>!e.isAxiom)){let e=Qh(n.expression,t,`an assumption`);if(e)return{name:xo(n.expression),trace:[],message:e.message}}},eg=(t,r,i)=>{let a=kh(t.invariants,r),o=Nh(t,r),s=Ph(t,r),c=zh([...a,...s.invariants],r),l=c.length>0||s.actionProperties.length>0||s.liveness.length>0;if(o.init===void 0&&(l||s.initialPredicates.length>0||r.variables.length>0))throw new _(`The configuration file did not specify the initial state predicate.`);if(o.next===void 0&&l)throw new _(`The configuration file did not specify the next state predicate.`);let u=zh(Fh(`constraint`,t.constraints,r),r),d=Fh(`action constraint`,t.actionConstraints,r);t.rlReward!==void 0&&Th(`rlreward`,t.rlReward,r),t.periodic!==void 0&&Th(`periodic`,t.periodic,r);let f=Lh(t.possible,r);if(r.variables.length===0)return;let p=t.symmetry===void 0?[]:nh(t.symmetry,r);t.view!==void 0&&Th(`view function`,t.view,r);let m=t.view===void 0?void 0:{name:t.view,expression:Ch(t.view),scope:void 0},g=s.actionProperties.map(e=>{let t={kind:`Unchanged`,expression:e.subscript,location:bh};return{...e,unchanged:t}}),v=e=>Xp(e.expression,void 0,r)>=2,y=f.filter(e=>!v(e)),b=f.filter(v),x=r.runtime,ee={indices:void 0},te=()=>{if(ee.indices)return ee.indices;let e=i(),t=t=>{let n=e.indexOf(r.variables[t]);return n===-1?r.variables.length:n};return ee.indices=r.variables.map((e,t)=>t).sort((e,n)=>t(e)-t(n)),ee.indices},ne=p.length>0?te():void 0,re=(e,t)=>Z(e,Kh(r,t,void 0)),ie=e=>{let t=te(),n=p.length===0?e:uh(e,p,t);return xl(m===void 0?t.map(e=>n[e]):[re(m.expression,n)])},S=Gh(t,r);x.getFingerprint=ie;let ae=()=>{let e=f.find(e=>!x.possibleCounts.get(e.name));if(!e)return;let t=Ih(e.name,r),n=t?` at ${h(t)}`:``;return{name:e.name,message:`The _POSSIBLE predicate ${e.name}${n} was never witnessed.\nOthers may be unwitnessed too; only witnessed predicates appear with a\nnon-zero count in the record printed above.\nSee https://explain.tlapl.us/possible-conditions for additional details.`,counts:Ee(G(Bl(x),!0))}};return{properties:s,spec:o,isSymmetric:p.length>0,getTlcOrder:te,getStoredFingerprints:(e,t)=>{if(m!==void 0||S)return BigInt64Array.from(e,ie);let n=new BigInt64Array(t.length),r=wl(te(),new Int32Array(n.buffer));return t.forEach(r),n},getFingerprintState:e=>{if(S)return[String(ie(e))];let t=p.length===0?e:uh(e,p,ne);return m===void 0?t:[re(m.expression,t)]},findViolatedInvariant:(t,i)=>c.find(a=>{if(Bh(a,t,i))return!1;try{let e=Kh(r,t,void 0,a.scope),n=a.membership;return i&&n?!xn(t[n.variable],i[n.variable],Z(n.set,e)):!Jh(a.expression,e)}catch(t){throw i?og(n(t,e.safetyEvaluationFailure),`Evaluating invariant ${a.name} failed.`):t}}),satisfiesConstraints:(e,t)=>u.every(n=>{try{return Bh(n,e,t)||Jh(n.expression,Kh(r,e,void 0))}catch(e){throw t?ng(e):e}}),findFailedInitialPredicate:e=>s.initialPredicates.find(t=>!Jh(t.expression,Kh(r,e,void 0,t.scope))),findViolatedActionProperty:(e,t)=>g.find(n=>{try{return!Jh(n.action,Kh(r,e,t,n.scope),()=>`Attempted to evaluate an expression of form [A]_e, but A was not a boolean.\n${xo(n.box)}`)&&!qh(n.unchanged,Kh(r,e,t,n.scope),`a subscript`)}catch(e){throw og(tg(e),`Evaluating action property ${n.name} failed.`)}}),satisfiesActionConstraints:(e,t)=>d.every(n=>{try{return Jh(n.expression,Kh(r,e,t))}catch(e){throw ng(e)}}),trackStatePossible:y.length===0?Xh:e=>Zh(y,x,Kh(r,e,void 0)),trackActionPossible:b.length===0?Xh:(e,t)=>Zh(b,x,Kh(r,e,t)),findUnwitnessedPossible:ae,findPostconditionViolation:()=>{let e=ae();if(e)return e;for(let e of t.postconditions){let t=Qh(Ch(e),r,`a postcondition`);if(t)return{name:e,message:t.message??`Postcondition ${e} is false.`}}}}},tg=e=>e instanceof y?n(e,e.exitCode):e,ng=e=>e instanceof v&&!(e instanceof y)&&!(e instanceof x)?n(new v(`${l}${e.message}`,e),ie(e)):tg(e),rg=(e,t,n)=>t>0&&n[t-1]===e,ig=e=>e.flatMap(e=>e.location.range?[h(e.location.range)]:[]).filter((e,t,n)=>!rg(e,t,n)).map((e,t)=>`${t}) ${e}`).reverse(),ag=(e,t)=>{try{return e(),{callStack:void 0}}catch(e){if(!(e instanceof v))return{callStack:[]};let n=t.flatMap(e=>{let t=e.location.range;return t?[`Line ${t.start.line}, column ${t.start.column} to line ${t.end.line}, column ${t.end.column} in ${t.module}`]:[]}).filter((e,t,n)=>!rg(e,t,n)),r=Oe(e);return{callStack:n,fingerprint:r&&{sources:ig(r),reason:e.message}}}},og=(e,t)=>e instanceof v?n(new v(`${t}\n${e.message}`,e),ie(e)):e,sg=t=>{let r=t.dump&&Zm(t.dump,t.writeFile);try{return cg(t,r)}catch(t){throw d(t)?n(new v(u),e.error):t}finally{r?.close()}},cg=(t,r)=>{let i=typeof t.config==`string`?be(t.config):t.config,a=t.onPrint??console.log,o={isMuted:!1,replayed:void 0},s=e=>{o.replayed?o.replayed.push(e):o.isMuted||a(e)},l=e=>{o.isMuted=!0;let t=e();return o.isMuted=!1,t};We(Zf(t.source,i,t.loadModule));let f=sp(i,{source:t.source,loadModule:t.loadModule,loadClass:t.loadClass,print:s,files:{readFile:t.readFile,writeFile:t.writeFile},seed:t.seed}),p=f.environment,m=p.runtime;m.pause=t.onPause??(()=>{}),m.getSpecification=()=>Vm(i,p,f.variableLocations,f.instanceActions);let h={depth:0},g=(e,t,n)=>({status:e,violation:t&&{...t,loopStart:t.loopStart},failure:n,generatedStates:m.generatedStates,distinctStates:m.distinctStates,queuedStates:m.queueSize,depth:m.generatedStates===0?0:Math.max(h.depth,1),outDegrees:void 0,fingerprintDistance:void 0}),b=Array.from({length:32},()=>0),te={newStates:0},ne=()=>Math.min(te.newStates,31),re=()=>b.map((e,t)=>t===ne()?e+1:e),S=()=>({...g(`success`),outDegrees:[...b],fingerprintDistance:vh(m.distinctStates,m.generatedStates,()=>C?C.getStoredFingerprints(j,he):BigInt64Array.from(j,m.getFingerprint))}),ae=()=>Xf(t.source,t.loadModule,`variable`),C=eg(i,p,ae),oe=$h(f.assumptions,p);if(oe)return g(`assumption-violation`,oe);if(!C)return S();let w=i.postconditions.length>0||i.possible.length>0,T=(e,t,n)=>{if(w){let e=t.loopStart;m.counterExample=Uu(t.trace,e===void 0||!n?void 0:{start:e,action:n()})}let r=C.findUnwitnessedPossible();return r||C.findPostconditionViolation(),g(e,r?{...t,unwitnessed:r}:t)},E=C.spec,se=C.getFingerprintState,D={value:void 0},O=(e,t,n=!1)=>{if(!e.failure)return e;let r=[],a={...p,evaluators:/* @__PURE__ */ new WeakMap,trace:r},s=eg(i,a,ae);if(!s)return e;let c=[];o.replayed=c,N.current=/* @__PURE__ */ new WeakMap;let l=ag(()=>t(s,a),r);return N.current=void 0,o.replayed=void 0,{...e,failure:{...e.failure,replay:{output:c,...l,isBeforeError:n}}}},ce=(e,t)=>{try{Me(se(e))}catch(e){throw t.trace&&(t.trace.length=0),e}},k=e=>O(e,(e,t)=>{E.init!==void 0&&go(E.init,t,n=>(e.satisfiesConstraints(n)&&ce(n,t),e.findViolatedInvariant(n)!==void 0||e.findFailedInitialPredicate(n)!==void 0),E.scope)}),A=e=>{let t=ge[e];t===-1?Ee():(A(t),we(t,j[t],j[e]))},le=(e,t)=>O(e,(e,n)=>{A(t);let r=j[t];D.value??=Lm(i,p,f.instanceActions),D.value.find(t=>yo(t.expression,r,n,t.scope).some(t=>{let i=e.satisfiesConstraints(t.state)&&e.satisfiesActionConstraints(r,t.state);return i&&ce(t.state,n),!i&&e.findViolatedInvariant(t.state)!==void 0||e.findViolatedActionProperty(r,t.state)!==void 0}))}),ue=i.view!==void 0||i.symmetry!==void 0,de=[],fe={getFingerprint:e=>de[e]??=Number(BigInt.asIntN(32,m.getFingerprint(j[e]))),getSuccessors:e=>{let t=[];return E.next===void 0||vo(E.next,e,p,n=>{if(ye(n.state),!(C.satisfiesConstraints(n.state,e)&&C.satisfiesActionConstraints(e,n.state)))return!1;let r=se(n.state),i=Fe(Me(r),r);return t.push({index:i,state:n.state}),!1},E.scope),t}},pe=c(()=>mm(C.properties.liveness,E.temporals,p,fe)),me=C.isSymmetric||pe!==void 0,j=[],he=[],ge=[],_e=[],ve=[],M={slots:new Int32Array(1<<17),size:0,shift:16},ye=cr(),xe=e=>Object.fromEntries(C.getTlcOrder().map(t=>[p.variables[t],e[t]])),Se=(e,t,n,r)=>(m.getLevel=()=>n+1,m.getBehavior=()=>t.slice(0,n+1).map(e=>e.state),Ce(e,t[n].state,(t[n+1]??t[r??n]).state)),Ce=(e,t,n)=>{try{let r=Eh(`alias`,e,p).body,i=Z(Ch(e),Kh(p,t,n)),a=r.kind===`Record`?r.fields.map(e=>e.name):[];return Ah(i,a)??xe(t)}catch(e){if(!(e instanceof _||e instanceof v))throw e;return{...xe(t),_ALIASEvalError:e.message}}},we=(e,t,n)=>{D.value??=Lm(i,p,f.instanceActions);let r={...L};Object.assign(L,{index:e,isExpanding:!0,candidate:void 0});let a=se(n),o=D.value.find(e=>yo(e.expression,t,p,e.scope).some(e=>Ne(se(e.state),a)));return Object.assign(L,r),o&&zm(o)},Te=(e,t,n)=>{let r=i.alias,a=l(()=>(e.length>1&&Ds(p)&&Ee(),e.map((n,r)=>r===0||n.action===`Stuttering`?void 0:we(t[r-1],e[r-1].state,n.state))));return e.map((t,i)=>({action:t.action,label:a[i],state:r===void 0?xe(t.state):Se(r,e,i,n)}))},Ee=()=>E.init===void 0?[]:_o(E.init,p,E.scope),De=e=>E.next===void 0?[]:yo(E.next,e,p,E.scope),Oe=(e,t)=>Ne(se(e),he[t]),ke=(e,t)=>De(e).find(e=>Oe(e.state,t)),P=(e,t)=>{let n=ue||Ds(p)?Ee().find(t=>Oe(t,e[0])):j[e[0]];if(!n)throw new v(xh);let r=[{state:n,action:void 0}];for(let n=1;n<e.length;n++){let i=r[n-1].state;if(e[n-1]===e[n]){r.push({state:i,action:`Stuttering`});continue}let a=ke(i,e[n]);if(!a)throw new v(t);r.push(a)}return r},Ae=(e,t)=>{let n=[];for(let t=e;t!==-1;t=ge[t])n.unshift(t);let r=ue&&n.length>1?P(n,xh):n.map(e=>({state:j[e],action:_e[e]}));if(!t)return Te(r,n);let i=ue?De(j[e]).find(e=>Ne(e.state,t.state))?.action:t.action;return Te([...r,{state:t.state,action:i}],n)},F=e=>ge[e]===-1?[{action:void 0,label:void 0,state:xe(j[e])}]:Ae(e),I=(t,r,i,a)=>{if(d(t))return L.isExpanding?I(n(new v(u),e.error),F(L.index)):I(new v(u),r,i);if(!(t instanceof v))throw t;return{...g(`error`,void 0,{message:t.message,trace:r,initialState:i&&!(t instanceof y)?xe(i):void 0,exitCode:ie(t)}),outDegrees:a}},je=(e,t)=>{let n=P(e,Sh),r=n[n.length-1].state;if(ue&&t!==void 0&&t!==e.length-1&&ke(r,e[t])===void 0)throw new v(Sh);return n},Me=e=>{let t=2166136261;for(let n=0;n<e.length;n++)t=Rn(t,Un(e[n]));return t&1073741823},Ne=(e,t)=>{for(let n=0;n<t.length;n++)if(!it(e[n],t[n]))return!1;return!0},Pe=e=>Math.imul(e,2654435761)>>>M.shift<<1,Fe=(e,t)=>{let n=M.slots.length-1;for(let r=Pe(e);;r=r+2&n){let n=M.slots[r+1];if(n===0)return-1;if(M.slots[r]===e&&Ne(he[n-1],t))return n-1}},Ie=(e,t)=>{let n=M.slots.length-1,r=Pe(e);for(;M.slots[r+1]!==0;)r=r+2&n;M.slots[r]=e,M.slots[r+1]=t},Le=(e,t)=>{if(M.size++,M.size*4>M.slots.length){let e=M.slots;M.slots=new Int32Array(e.length*2),M.shift--;for(let t=0;t<e.length;t+=2)e[t+1]!==0&&Ie(e[t],e[t+1])}Ie(e,t+1)},Re=e=>{m.distinctStates=j.length+1,h.depth=Math.max(h.depth,e),m.diameter=Math.max(m.diameter,e)},ze=(e,t,n,r)=>{let i=n===-1?1:ve[n]+1;j.push(e),he.push(t),ge.push(n),_e.push(r),ve.push(i)},L={index:-1,isExpanding:!1,candidate:void 0,candidateLevel:0,isFingerprinting:!1,livenessSource:-1},Be=e=>e===-1?[]:[...Be(ge[e]),j[e]];m.isSeen=e=>{let t=se(e);return Fe(Me(t),t)!==-1},m.getBehavior=e=>{let t=e===L.candidate?-1:j.indexOf(e);return t===-1?[...Be(L.index),e]:Be(t)},m.getCurrentState=()=>L.index===-1?void 0:j[L.index],m.setLivenessSource=e=>{L.livenessSource=e??-1},m.getLevel=e=>{let t=L.livenessSource;return t===-1?e===L.candidate?L.candidateLevel:L.index===-1?0:e===j[L.index]?ve[L.index]:L.isExpanding?ve[L.index]+1:0:e===j[t]?ve[t]:ve[t]+1};let Ve=(e,t)=>({fingerprint:BigInt.asIntN(64,m.getFingerprint(e)),level:t,getLabel:()=>or(i.alias===void 0?xe(e):Ce(i.alias,e,void 0)),getText:()=>or(xe(e))}),He=e=>{ye(e),m.generatedStates++,m.initialStates++,L.candidate=e,L.candidateLevel=1;let t=se(e),n=Me(t),i=C.satisfiesConstraints(e);if(i&&C.trackStatePossible(e),i&&Fe(n,t)!==-1)return;i&&(Re(1),m.queueSize++,pe?.addInitialState(j.length,e),r?.writeInitialState(Ve(e,1)));let a=C.findViolatedInvariant(e);if(a)return T(`invariant-violation`,{name:a.name,trace:Te([{action:void 0,state:e}],[])});let o=C.findFailedInitialPredicate(e);if(o)return T(`liveness-violation`,{name:o.name,trace:Te([{action:void 0,state:e}],[])});i&&(Le(n,j.length),ze(e,t,-1,void 0))},Ue=(e,t,n,i,a)=>{let o=j[e];m.generatedStates++,L.candidate=t.state,L.candidateLevel=ve[e]+1,me&&ye(t.state),L.isFingerprinting=!0;let s=se(t.state),c=Me(s);L.isFingerprinting=!1;let l=Fe(c,s),u=C.satisfiesConstraints(t.state,o);u&&C.trackStatePossible(t.state);let d=u&&C.satisfiesActionConstraints(o,t.state);d&&C.trackActionPossible(o,t.state);let f=d?l:-1;if(i&&d&&r?.writeSuccessor(i,Ve(t.state,ve[e]+1),f!==-1,a&&{name:a.name,signature:Bm(a)}),f!==-1&&pe){let e=j[f],r=e.every((e,n)=>e===t.state[n]);n.push({index:f,state:r?e:t.state})}let p=d&&f===-1;if(p&&(Re(ve[e]+1),te.newStates++),f===-1)try{let n=C.findViolatedInvariant(t.state,o);if(n)return T(`invariant-violation`,{name:n.name,trace:Ae(e,t)})}catch(n){return I(n,Ae(e,t),void 0,re())}let h=C.findViolatedActionProperty(o,t.state);if(h)return T(`liveness-violation`,{name:h.name,trace:Ae(e,t)});p&&(me||ye(t.state),Le(c,j.length),pe&&n.push({index:j.length,state:t.state}),ze(t.state,s,e,t.action),m.queueSize++)},R={result:void 0};if(E.init!==void 0)try{go(E.init,p,e=>{try{R.result=He(e)}catch(t){R.result=I(t,[],e)}return R.result!==void 0},E.scope)}catch(e){if(!(e instanceof ee))return k(I(e,[]));let t=I(e,[],e.state.map(e=>e??$e(`null`)));return{...t,failure:t.failure&&{...t.failure,isWithoutStatistics:!0}}}if(R.result)return k(R.result);let Ge=E.next;if(Ge===void 0){if(j.length>0)throw new v(`No next state actions defined to generate successor states from.`);return S()}let Ke=!!(t.dump?.dot&&(t.dump.actionLabels||t.dump.colorize)),qe=(e,t)=>{if(!Ke)return vo(Ge,e,p,e=>t(e,void 0),E.scope);D.value??=Lm(i,p,f.instanceActions);let n={isStopped:!1};return D.value.reduce((r,i)=>n.isStopped?r:r+vo(i.expression,e,p,e=>(n.isStopped=t(e,i),n.isStopped),i.scope),0)},z=e=>{let t=j[e],n=[],a=r&&Ve(t,ve[e]),o=qe(t,(t,r)=>{try{R.result=Ue(e,t,n,a,r)}catch(n){if(L.isFingerprinting)throw n;let r=I(n,Ae(e,t));R.result=d(n)?r:le(r,e)}return R.result!==void 0});if(L.isExpanding=!1,R.result)return R.result;if(o===0&&i.checkDeadlock)return T(`deadlock`,{name:`deadlock`,trace:F(e)});try{let r=pe?.addState(e,t,n);if(!pe||!r)return;let i=je(r),a=pe.getViolatedProperties(i.map(e=>e.state),i.length-1);return T(`property-violation`,{name:a[0],properties:a,trace:Te(i,r)})}catch(r){return O(I(ng(r),F(e),void 0,re()),(r,i)=>mm(C.properties.liveness,E.temporals,i,fe)?.addState(e,t,n),!0)}},Je=(e,t)=>{D.value??=Lm(i,p,f.instanceActions);let n=D.value,r=n.length===1?n[0]:n.find(t=>t.name===e.action),a=`variable${e.missing.length>1?`s are`:` is`} not defined: ${e.missing.join(`, `)}.\n`;return m.generatedStates++,I(n.length===1?e:new v(`Successor state is not completely specified by action ${e.action} of the next-state relation. The following ${a}`),[...F(t),{action:e.action,label:r&&zm(r),state:xe(e.state.map(e=>e??$e(`null`)))}])},Ye=(e,t)=>{let n=[...t.prefix,...t.cycle],r=t.prefix.length,i=je(n,r),a=Te(i,n,r),o=e.getViolatedProperties(i.map(e=>e.state),r),s=n[r],c=n[n.length-1],u=i[i.length-1].state,d=s===c?void 0:l(()=>we(c,u,j[s]));return T(`liveness-violation`,{name:o[0],properties:o,trace:a,loopStart:r,loopLabel:d},()=>s===c?a[a.length-1].action:ke(u,s)?.action)},Xe=pe!==void 0&&t.livenessCheck!==`final`,Ze=performance.now(),B={at:Ze+3e3,size:1,time:0},Qe=e=>{let t=performance.now();if(B.at=t+6e4,!((e-B.size)/B.size>.1)||B.time>(t-Ze)*.2)return;B.size=e;let n=pe?.findViolation();return B.time+=performance.now()-t,n};for(let e=0;e<j.length&&!m.isStopped;e++){L.index=e,L.candidate=void 0,m.queueSize=j.length-e-1,L.isExpanding=!0;try{R.result=z(e)}catch(t){let n=t instanceof x?Je(t,e):I(ng(t),F(e));R.result=t instanceof x||d(t)?n:le(n,e)}if(R.result)return R.result;if(b[ne()]++,te.newStates=0,Xe&&performance.now()>=B.at){let t=Qe(e+1);if(pe&&t)return Ye(pe,t)}}L.index=-1,L.candidate=void 0;let et=pe?.findViolation();if(pe&&et)return Ye(pe,et);let tt=C.findPostconditionViolation();return tt?g(`postcondition-violation`,{...tt,trace:[]}):S()},lg=e=>{let t=Math.imul(e^e>>>16,2146121005),n=Math.imul(t^t>>>15,2221713035);return n^n>>>16},ug=(e,t)=>{let n=2166136261,r=1779033703;for(let t=0;t<e.length;t++)n=Math.imul(n^Un(e[t]),16777619),r=Math.imul(r^Xn(e[t]),1540483477);t[0]=lg(n)||1,t[1]=lg(r)},dg=()=>{let e={slots:/* @__PURE__ */ new Int32Array(8192),used:0},t=(e,t,n)=>{let r=e.length/2-1;for(let i=t&r;;i=i+1&r){let r=e[i*2];if(r===0||r===t&&e[i*2+1]===n)return i}},n=()=>{let n=e.slots,r=new Int32Array(n.length*2);for(let e=0;e<n.length;e+=2){if(n[e]===0)continue;let i=t(r,n[e],n[e+1]);r[i*2]=n[e],r[i*2+1]=n[e+1]}e.slots=r};return{insert:(r,i)=>{e.used*4>=e.slots.length&&n();let a=t(e.slots,r,i);return e.slots[a*2]!==r&&(e.slots[a*2]=r,e.slots[a*2+1]=i,e.used++,!0)}}},fg=(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}},pg=()=>({slots:new BigInt64Array(new SharedArrayBuffer(8192)),used:new Int32Array(new SharedArrayBuffer(4))}),mg=(e,t,n)=>{let r=BigInt.asIntN(64,BigInt(t)<<32n|BigInt(n>>>0));return fg(e.slots,r)?(Atomics.add(e.used,0,1),!0):!1},hg=e=>Atomics.load(e.used,0)*2>=e.slots.length,gg=e=>{let t=new BigInt64Array(new SharedArrayBuffer(e.slots.byteLength*2));for(let n of e.slots)n!==0n&&fg(t,n);return{slots:t,used:e.used}},_g=()=>{let e={words:/* @__PURE__ */ new Int32Array(1024),length:0,count:0},t=[],n=/* @__PURE__ */ new Map,r=t=>{if(e.length===e.words.length){let t=new Int32Array(e.words.length*2);t.set(e.words),e.words=t}e.words[e.length++]=t},i=e=>{let i=n.get(e);if(i!==void 0)return r(i);n.set(e,t.length),r(t.length),t.push(e)},a=e=>{if(typeof e==`boolean`)return r(+!!e),!0;if(typeof e==`number`)return(e|0)===e&&(r(2),r(e),!0);if(typeof e==`string`)return r(3),i(e),!0;if(e.kind===`ModelValue`)return r(4),i(e.name),!0;if(e.kind===`Set`)return r(5),r(e.elements.length),e.elements.every(a);if(e.kind===`Function`){let t=Nn(e.domain);return t?(r(7),r(t.low),r(e.range.length),e.range.every(a)):(r(6),r(e.domain.length),e.domain.every(a)&&e.range.every(a))}return!1};return{encode:t=>{let n=e.length;return t.every(a)?(e.count++,!0):(e.length=n,!1)},finish:()=>({words:e.words.slice(0,e.length),strings:t,count:e.count})}},vg=e=>t=>{let n=t.words,r={index:0},i=e=>Array.from({length:e},()=>a()),a=()=>{let e=n[r.index++];if(e===0)return!1;if(e===1)return!0;if(e===2)return n[r.index++];if(e===3)return t.strings[n[r.index++]];if(e===4)return $e(t.strings[n[r.index++]]);if(e===7){let e=n[r.index++],t=n[r.index++],a=Gt({kind:`Interval`,low:e,high:e+t-1});return tt(a,i(t))}let a=n[r.index++];if(e===5)return et(i(a));let o=i(a);return tt(o,i(a))};return Array.from({length:t.count},()=>Array.from({length:e},()=>a()))};export{be as A,ie as B,_o as C,G as D,or as E,te as F,p as I,re as L,_ as M,f as N,Ge as O,v as P,ne as R,Ds as S,cr as T,e as V,sp as _,gg as a,il as b,ug as c,$h as d,hh as f,yh as g,dh as h,pg as i,de as j,We as k,sg as l,vh as m,_g as n,mg as o,_h as p,dg as r,hg as s,vg as t,eg as u,Xf as v,yo as w,al as x,Zf as y,m as z};
|
|
478
|
+
please check if this bug described in LevelNode.java starting at line 590ff affects you.`;throw n(new v(`The invariant ${t} is not a state predicate (one with no primes or temporal operators).${r}`),e.safetyEvaluationFailure)}return[{name:t,expression:Tb(t),scope:void 0}]})},Pb=(e,t)=>{if(!F(e))return;let n=Dr(e);if(!n.domain.every(e=>typeof e==`string`))return;let r=n.domain.map((e,t)=>[String(e),n.range[t]]);return Object.fromEntries(r.sort((e,n)=>t.indexOf(e[0])-t.indexOf(n[0])))},Fb=(e,t)=>{if(e.kind===`And`)return e.operands.flatMap(e=>Fb(e,t));if(e.kind===`Identifier`&&!t.constants.has(e.name)){let n=ml(e.name,t);if(n?.kind===`Operator`&&n.params.length===0)return Fb(n.body,t)}return[e]},Ib=(e,t,n)=>{let r=e.expression;if(r.kind!==`Identifier`||Hv(r,e.scope,t)>0)return!1;let i=W(r,Zb(t,void 0,void 0,e.scope));if(i===!1)throw new v(`The spec is trivially false because ${r.name} is false.`);if(i!==!0)throw new v(`The operator ${r.name}, which equals ${z(i)},\ncannot be used as a ${n}`);return!0},Lb=(t,r)=>{if(t.specification===void 0){let e=(e,t)=>{if(e!==void 0)return kb(t,e,r),Tb(e)};return{init:e(t.init,`initial predicate`),next:e(t.next,`next state action`),scope:void 0,temporals:[]}}if(t.init!==void 0||t.next!==void 0)throw new v(`The configuration file cannot specify both INIT/NEXT and SPECIFICATION fields.`);let i=[],a=[],o=[],s=Db(`name`,t.specification,r),c=Ob(t.specification,s,r);if(c!==void 0)throw new v(`The value of ${t.specification} is equal to ${z(c)}`);if(Gv(s.body,void 0,r,!1).forEach(s=>{let c=s.expression;if(Ib(s,r,`spec`))return;if(c.kind===`UnboundedQuantifier`&&c.isTemporal)throw n(new v(`TLC does not support temporal existential, nor universal, quantification over state variables.`),e.error);if(c.kind===`Always`&&c.expression.kind===`BoxAction`){a.push({expression:c.expression.action,scope:s.scope});return}if(c.kind===`Always`&&Hv(c.expression,s.scope,r)<2)throw n(new y(`TLC cannot handle the temporal formula ${Zc(c.expression)}`),e.error);let l=Hv(c,s.scope,r);if(l===3)o.push(s);else{if(l===2)throw new v(`TLC cannot handle the action-level conjunct of the specification ${t.specification}`);i.push(s)}}),a.length>1)throw new v(`The specification ${t.specification} must contain at most one [][Next]_vars`);let l=[...i,...a],u=e=>`$specification${e}`,d=l.reduce((e,t,n)=>t.scope===void 0?e:{name:u(n),binding:{kind:`Thunk`,expression:t.expression,scope:t.scope,state:void 0,next:void 0,cache:void 0},parent:e},void 0),f=(e,t)=>e.scope===void 0?e.expression:{kind:`Identifier`,name:u(t),location:e.expression.location,resolution:{kind:`Local`}};return{init:i.length===0?void 0:{kind:`And`,operands:i.map(f),location:Sb},next:a.length===0?void 0:f(a[0],i.length),scope:d,temporals:o}},Rb=(e,t,n)=>{let r={initialPredicates:[],invariants:[],actionProperties:[],liveness:[]};return e.properties.forEach(e=>{let i=Ab(`property`,e,t);if(!i)return;Hv(i.body,void 0,t)===1&&n?.({kind:`state-level-property`,name:e});let a=t.runtime.version!==`1.7.4`;Gv(i.body,void 0,t,a).forEach(n=>{let i=n.expression;if(Ib(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`&&Hv(i.expression,n.scope,t)<=1){let e=i.expression,o=e.kind===`Identifier`&&!B(e)?ml(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=Hv(i,n.scope,t);if(o<2)r.initialPredicates.push({name:a,expression:i,scope:n.scope});else{if(o===2)throw new v(`The property ${e} is an action-level formula`);r.liveness.push({name:e,expression:i,scope:n.scope})}})}),r},zb=(e,t,n)=>t.flatMap(t=>Ab(e,t,n)?[{name:t,expression:Tb(t),scope:void 0}]:[]),Bb=(e,t)=>{let n=ml(e,t);return n?.kind===`Operator`?n.bodyRange:void 0},Vb=(e,t)=>e.map((n,r)=>{if(e.indexOf(n)!==r)throw new v(`_POSSIBLE lists ${n} more than once`);kb(`possible`,n,t);let i=Tb(n);if(Hv(i,void 0,t)===3)throw new v(`The possible of ${n} is equal to a temporal formula; only state- and action-level predicates are supported`);return{name:n,expression:i,scope:void 0}}),Hb=(e,t,n)=>{if(e.kind!==`Apply`||e.operator!==`\\in`||t?.length!==1)return;let r=e.args[0];if(!(r.kind!==`Identifier`||B(r)))return n.variableIndex.get(r.name)===t[0]?{variable:t[0],set:e.args[1]}:void 0},Ub=(e,t)=>{if(e.kind!==`Identifier`||t.constants.has(e.name))return e;let n=ml(e.name,t);return n?.kind===`Operator`&&n.params.length===0?n.body:e},Wb=(e,t)=>e.flatMap(e=>Fb(e.expression,t).map(n=>{let r=e.scope===void 0?xd(n,t):void 0;return{name:e.name,expression:n,scope:e.scope,variables:r,membership:Hb(n,r,t),predicate:Ub(e.expression,t)}})),Gb=(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},Kb=/[\u0100-\uffff]/,qb=/* @__PURE__ */ new Set([`JsonDeserialize`,`ndJsonDeserialize`]),Jb=e=>e.kind===`String`?Kb.test(e.value):e.kind===`Set`&&e.elements.some(Jb),Yb=e=>e.kind===`String`&&Kb.test(e.value)||e.kind===`Apply`&&qb.has(e.operator)||hi(e).some(Yb),Xb=(e,t)=>e.constants.some(e=>Jb(e.value)||(e.args??[]).some(Jb))||[...t.definitions.values()].some(e=>Yb(e.body)||e.kind===`Function`&&e.bounds.some(e=>Yb(e.set))),Zb=(e,t,n,r)=>({environment:e,scope:r,state:t,next:n}),Qb=(e,t,n)=>pl(W(e,t),n),$b=(e,t,n=ex)=>{let r=W(e,t);if(typeof r!=`boolean`)throw new y(n(e,t.environment));return r},ex=(e,t)=>{let n=e.kind===`Identifier`?ml(e.name,t):void 0,r=n?.kind===`Operator`?n.body:e,i=n?.kind===`Operator`?n.bodyRange:void 0;return`TLC expected a boolean value, but did not find one. ${i&&r.kind!==`Number`?Xc(i):Qc(r)}`},tx=(e,t)=>$b(e.expression,t,(n,r)=>($b(e.predicate,t),ex(n,r))),nx=()=>{},rx=(e,t,n)=>e.forEach(e=>{let r=t.possibleCounts.get(e.name)??0,i=Qb(e.expression,n,`_POSSIBLE ${e.name}`);t.possibleCounts.set(e.name,i?r+1:r)}),ix=(e,t,n)=>{try{return Qb(e,Zb(t,void 0,void 0),n)?void 0:{message:void 0}}catch(e){if(e instanceof y)return{message:e.message};throw e}},ax=(e,t)=>{for(let n of e.filter(e=>!e.isAxiom)){let e=ix(n.expression,t,`an assumption`);if(e)return{name:Zc(n.expression),trace:[],message:e.message}}},ox=(t,r,i,a)=>{let o=Nb(t.invariants,r),c=Lb(t,r),l=Rb(t,r,a),u=Wb([...o,...l.invariants],r),d=[...new Map(u.map(e=>[e.predicate,e])).values()],f=u.length>0||l.actionProperties.length>0||l.liveness.length>0;if(c.init===void 0&&(f||l.initialPredicates.length>0||r.variables.length>0))throw new v(r.runtime.version===`1.7.4`?da:`The configuration file did not specify the initial state predicate.`);if(c.next===void 0&&f)throw new v(`The configuration file did not specify the next state predicate.`);let p=Wb(zb(`constraint`,t.constraints,r),r),m=zb(`action constraint`,t.actionConstraints,r);t.rlReward!==void 0&&Db(`rlreward`,t.rlReward,r),t.periodic!==void 0&&Db(`periodic`,t.periodic,r);let h=Vb(t.possible,r);if(r.variables.length===0)return;let g=t.symmetry===void 0?void 0:tb(t.symmetry,r,t.substitutions);t.view!==void 0&&Db(`view function`,t.view,r);let _=t.view===void 0?void 0:{name:t.view,expression:Tb(t.view),scope:void 0},b=l.actionProperties.map(e=>{let t={kind:`Unchanged`,expression:e.subscript,location:Sb};return{...e,unchanged:t}}),x=e=>Hv(e.expression,void 0,r)>=2,ee=h.filter(e=>!x(e)),te=h.filter(x),S=r.runtime,ne={indices:void 0},re=()=>{if(ne.indices)return ne.indices;let e=i(),t=t=>{let n=e.indexOf(r.variables[t]);return n===-1?r.variables.length:n};return ne.indices=r.variables.map((e,t)=>t).sort((e,n)=>t(e)-t(n)),ne.indices},ie=(e,t)=>W(e,Zb(r,t,void 0)),C=e=>{let t=re(),n=g===void 0?e:db(e,g,t);return rm(_===void 0?t.map(e=>n[e]):[ie(_.expression,n)])},ae=Xb(t,r);S.getFingerprint=C;let oe=()=>{let e=h.find(e=>!S.possibleCounts.get(e.name));if(!e)return;let t=Bb(e.name,r),n=t?` at ${Xc(t)}`:``;return{name:e.name,code:sa.possibleUnwitnessed,message:`The _POSSIBLE predicate ${e.name}${n} was never witnessed.\nOthers may be unwitnessed too; only witnessed predicates appear with a\nnon-zero count in the record printed above.\nSee https://explain.tlapl.us/possible-conditions for additional details.`,counts:N(z(wm(S),!0))}};return{properties:l,spec:c,isSymmetric:g!==void 0,isConstrained:p.length>0||m.length>0,getTlcOrder:re,getStoredFingerprints:(e,t)=>{if(_!==void 0||ae)return BigInt64Array.from(e,C);let n=new BigInt64Array(t.length),r=om(re(),new Int32Array(n.buffer));return t.forEach(r),n},getFingerprintState:e=>{if(ae)return[String(C(e))];let t=g===void 0?e:db(e,g,re());return _===void 0?t:[ie(_.expression,t)]},findViolatedInvariant:(t,i)=>u.find(a=>{if(Gb(a,t,i))return!1;try{let e=Zb(r,t,void 0,a.scope),n=a.membership;return i&&n?!Er(t[n.variable],i[n.variable],W(n.set,e)):!tx(a,e)}catch(t){throw i?px(n(t,e.safetyEvaluationFailure),sa.invariantEvaluationFailed,`Evaluating invariant ${a.name} failed.`):t}}),checkReplayedInitialState:(e,t,n)=>{let r=(n,r)=>$b(n,Zb(t,e,void 0,r));p.every(e=>r(e.predicate,e.scope))&&n();let i=d.find(e=>!r(e.predicate,e.scope));if(i)return{status:`invariant-violation`,name:i.name};let a=l.initialPredicates.find(e=>!r(e.expression,e.scope));return a&&{status:`liveness-violation`,name:a.name}},checkReplayedSuccessor:(e,t,n,r)=>(!(!(p.every(e=>$b(e.predicate,Zb(n,t,void 0,e.scope)))&&m.every(r=>$b(r.expression,Zb(n,e,t,r.scope))))||r())||d.every(e=>$b(e.predicate,Zb(n,t,void 0,e.scope))))&&b.every(r=>$b(r.box,Zb(n,e,t,r.scope))),satisfiesConstraints:(e,t)=>p.every(n=>Gb(n,e,t)||tx(n,Zb(r,e,void 0))),findFailedInitialPredicate:e=>l.initialPredicates.find(t=>!$b(t.expression,Zb(r,e,void 0,t.scope))),findViolatedActionProperty:(e,t)=>b.find(n=>{try{return!$b(n.action,Zb(r,e,t,n.scope),()=>`Attempted to evaluate an expression of form [A]_e, but A was not a boolean.\n${Zc(n.box)}`)&&!Qb(n.unchanged,Zb(r,e,t,n.scope),`a subscript`)}catch(e){throw px(sx(e),sa.actionPropertyEvaluationFailed,`Evaluating action property ${n.name} failed.`)}}),satisfiesActionConstraints:(e,t)=>m.every(n=>$b(n.expression,Zb(r,e,t),e=>`${s}${ex(e,r)}`)),trackStatePossible:ee.length===0?nx:e=>rx(ee,S,Zb(r,e,void 0)),trackActionPossible:te.length===0?nx:(e,t)=>rx(te,S,Zb(r,e,t)),findUnwitnessedPossible:oe,findPostconditionViolation:(i=!1)=>{let a=t.postconditions.find(e=>{let t=ml(e,r);return t!==void 0&&r.definitionValues.has(t)});if(a!==void 0){if(i)return;throw n(new y(`${s}The post condition ${a} cannot be a constant.`),e.error)}let o=oe();if(o)return o;for(let e of t.postconditions){let t=ix(Tb(e),r,`a postcondition`);if(!t)continue;let n=Bb(e,r),i=n?` at ${Xc(n)}`:``;return t.message===void 0?{name:e,code:sa.postconditionFalse,message:`Postcondition ${e}${i} is false.`}:{name:e,code:sa.postconditionFailed,message:`Evaluating postcondition ${e}${i} failed.\n${t.message}`}}}}},sx=e=>e instanceof S?n(e,e.exitCode):e,cx=/* @__PURE__ */ Error(`The replay stopped`),lx=/* @__PURE__ */ new Set([...Array.from({length:24},(e,t)=>2222+t),2272,2273,2274,2280,2281]),ux=t=>{let n=ga(t.message);return n&&!n.isEvalException&&lx.has(n.code)?e.configParseError:oe(t)},dx=t=>{let n=t.cause;return n instanceof y?dx(n):t instanceof S?t.exitCode:e.specEvaluationFailure},fx=/* @__PURE__ */ new WeakMap,px=(e,t,r)=>{if(!(e instanceof y))return e;let i=n(new y(`${r}\n${e.message}`,e),oe(e));return fx.set(i,{code:t,headline:r,inner:e}),i},mx=s.slice(0,s.indexOf(`
|
|
479
|
+
`)),hx=`${s}tlc2.tool.EvalException: `,gx=`${s}util.Assert$TLCRuntimeException: `,_x=o(`tlc2.tool.EvalException`),vx=e=>_a(e)?hx:gx,yx=e=>{try{return e()}catch(e){throw e instanceof y?_a(e)?new y(`${_x}${e.message}`):ga(e.message)?e:new y(`${s}${e.message}`):e}},bx=[hx,gx,s,_x],xx=(e,t)=>{let n=fx.get(e);if(n)return`${n.headline}\n${xx(n.inner,t)}`;let r=e.message,i=bx.find(e=>r.startsWith(e))??``;return`${i}${ba(r.slice(i.length),t)}`},Sx=(e,t)=>{let n=fx.get(e),r=e.message;if(n)return{code:n.code,message:r,toolMessage:xx(e,!0)};if(t&&_a(e))return{code:ga(r)?.code??sa.general,message:r,toolMessage:r};let i=t&&!r.startsWith(mx)?s:``;return{code:sa.general,message:`${i}${r}`,toolMessage:`${i}${xx(e,!0)}`}},Cx=e=>{let t=e.dump&&Jy(e.dump,e.writeFile,e.version);try{return Tx(e,t)}catch(e){throw c(e)?wx():e}finally{t?.close()}},wx=()=>n(new x,e.error),Tx=(t,i)=>{let o=typeof t.config==`string`?it(t.config,t.version):t.config,l=t.onPrint??console.log,u={lines:void 0},d=e=>{u.lines?u.lines.push(e):l(e)},f=e=>{let t=u.lines,n=[];u.lines=n;try{return{result:e(),lines:n}}finally{u.lines=t}};wt(L_(t.source,o,t.loadModule)),Et(t.version);let p=Z_(o,{source:t.source,loadModule:t.loadModule,loadClass:t.loadClass,print:d,files:{readFile:t.readFile,writeFile:t.writeFile},seed:t.seed,isTool:t.isTool,isTraceRecorded:t.isTraceRecorded,isSanyReported:t.isSanyReported,isWarningEnabled:t.isWarningEnabled,version:t.version});Mb(p,o,t.onProgress);let m=p.environment,h=m.runtime,g=h.version===`1.7.4`;h.pause=t.onPause??(()=>{}),h.getSpecification=()=>Ry(o,m,p.variableLocations,p.instanceActions);let _={depth:0,initialStates:void 0},b=(e,t,n)=>({status:e,violation:t&&{...t,loopStart:t.loopStart},failure:n,generatedStates:h.generatedStates,distinctStates:h.distinctStates,queuedStates:h.queueSize,depth:h.generatedStates===0?0:Math.max(_.depth,1),initialStates:_.initialStates,outDegrees:void 0,fingerprintDistance:void 0}),te=Array.from({length:32},()=>0),re={newStates:0},ie=()=>Math.min(re.newStates,31),C=()=>te.map((e,t)=>t===ie()?e+1:e),ae=()=>g?[...te]:C(),se=(e,t,n)=>g?[]:e.getViolatedProperties(t,n),w=(e,t=[...te])=>({...e,violationOutDegrees:t}),T=()=>({...b(`success`),outDegrees:[...te],fingerprintDistance:yb(h.distinctStates,h.generatedStates,()=>E?E.getStoredFingerprints(A,Ee):BigInt64Array.from(A,h.getFingerprint))}),E=ox(o,m,()=>I_(t.source,t.loadModule),t.onProgress),D=()=>ax(p.assumptions,m);if(!E){h.isStarted=!0;let e=D();return e?b(`assumption-violation`,e):(_.initialStates={generated:0,distinct:0},t.onProgress?.({kind:`initial-states-started`}),t.onProgress?.({kind:`initial-states-computed`,initialStates:_.initialStates}),T())}let ce=o.postconditions.length>0||o.possible.length>0,le=/* @__PURE__ */ new WeakMap,ue=e=>le.get(e)?.state??e.state,de=e=>{let t=le.get(e)?.action;return t?my(t):Oh(e.action)},fe=(e,t)=>{ce&&(h.counterExample=kh(e.map(ue),e.slice(1).map(de),t));let n=E.findUnwitnessedPossible(),r=n?{result:void 0,lines:[]}:f(()=>E.findPostconditionViolation(!0));return{unwitnessed:n,postcondition:r.result,lines:r.lines}},pe=(e,t,n)=>{let r=t.loopStart,i=fe(t.trace,r===void 0||!n?void 0:{start:r,action:n()}),a=[...t.traceOutput??[],...i.lines];return b(e,{...t,...a.length>0&&{traceOutput:a},...i.unwitnessed&&{unwitnessed:i.unwitnessed},...i.postcondition&&{postcondition:i.postcondition}})},me=E.spec,he=E.getFingerprintState,O={value:void 0},ge=()=>O.value??=Py(o,m,p.instanceActions),_e=e=>{let t=Bu(m),n=t.callStack;try{e(t);return}catch(e){return c(e)?{callStack:[],fingerprint:void 0}:!(e instanceof y)||!n?void 0:{callStack:n.expressions,fingerprint:n.fingerprint}}},ve=(e,t)=>{if(typeof e!=`object`)return[];let n=t.get(e),r=qr(e).find(e=>Kr(e)!==void 0);return[...n?[n]:[],...r===void 0?[]:ve(r,t)]},ye=(e,t)=>{for(let n of he(e)){let e=Kr(n);if(!e)continue;let r=t?ve(n,t.sources):[];throw t&&r.length>0&&(t.expressions.length=0,t.isFrozen=!0,t.fingerprint={sources:r,reason:e.message}),e}e.forEach(Xt)},be=()=>{let e=tt.fingerprint?[tt.fingerprint]:[];return(t,n)=>{ye(t,n);let r=he(t);return Qe(Je(r),r)!==-1||e.some(e=>Xe(e,r))?!1:(e.push(r),h.distinctStates++,!0)}},xe=()=>{let e={count:0},t=[],n=be();return _e(r=>{if(Xs(Ny(o,m,p.instanceActions),r,i=>{if(jb(e.count,e=>u.lines?.push(e)),e.count++,h.generatedStates=e.count,!(t.length>0))try{let e=E.checkReplayedInitialState(i,r,()=>{n(i,r.callStack)&&(h.queueSize++,k?.addInitialState(A.length,i,r))});if(e){let t=Ie([{action:void 0,state:i}],[]).trace[0].state;throw u.lines?.push({kind:`initial-state-violation`,...e,state:t}),cx}}catch(e){if(!(e instanceof y)||!r.callStack?.fingerprint)throw e;t.push(e)}}),t.length>0)throw t[0]})},Se=e=>_e(t=>{let n=A[e],r=i&&ot(n,ke[e]),a=be();Zs(ge(),n,t,(o,s)=>{if(!E.checkReplayedSuccessor(n,o,t,()=>{let n=a(o,t.callStack);return r&&i?.writeSuccessor(r,ot(o,ke[e]+1),!n,F?{name:s.name,signature:Ly(s)}:void 0),n}))throw cx})}),Ce=o.view!==void 0||o.symmetry!==void 0,we=[];E.properties.liveness.length>0&&t.onProgress?.({kind:`liveness-initializing`,isSymmetric:E.isSymmetric,isConstrained:E.isConstrained});let k=a(()=>yx(()=>uy(E.properties.liveness,me.temporals,m,{getFingerprint:({index:e,state:t})=>we[e]??=Number(BigInt.asIntN(32,h.getFingerprint(t))),getSuccessors:(e,t)=>{let n=[];if(me.next===void 0)return n;let r=M.livenessSource;return M.livenessSource=e,Uc(me.next,t,m,e=>{if(je(e.state),!(E.satisfiesConstraints(e.state,t)&&E.satisfiesActionConstraints(t,e.state)))return!1;let r=he(e.state),i=Qe(Je(r),r);return n.push({index:i,state:e.state}),!1},me.scope),M.livenessSource=r,n}})));h.isStarted=!0;let Te=E.isSymmetric||k!==void 0,A=[],Ee=[],De=[],Oe=[],ke=[],Ae={slots:new Int32Array(1<<17),size:0,shift:16},je=mi(),Me=e=>Object.fromEntries(E.getTlcOrder().map(t=>[m.variables[t],e[t]])),Ne=(e,t,n,r)=>(h.getLevel=()=>n+1,h.getBehavior=()=>t.slice(0,n+1).map(e=>e.state),Pe(e,t[n].state,(t[n+1]??t[r??n]).state)),Pe=(e,n,r)=>{try{let t=kb(`alias`,e,m).body,i=W(Tb(e),Zb(m,n,r)),a=t.kind===`Record`?t.fields.map(e=>e.name):[];return Pb(i,a)??Me(n)}catch(e){if(!(e instanceof v||e instanceof y))throw e;return{...Me(n),_ALIASEvalError:ba(e.message,t.isTool??!1)}}},Fe=(e,t,n,r)=>{let i=ge(),a={...M};Object.assign(M,{index:e,isExpanding:!0,candidate:void 0});let o=r?e=>e:he,s=o(n),c=i.find(e=>Wc(e.expression,t,m,e.scope).some(e=>Xe(o(e.state),s)));return Object.assign(M,a),c},Ie=(e,n,r={})=>{let i=o.alias,a=r.known??1,s=e.length>1?f(Le).lines:[],c=e.map((t,r)=>r===0||t.action===`Stuttering`?{result:void 0,lines:[]}:f(()=>Fe(n[r-1],e[r-1].state,t.state,a===2&&r===e.length-1))),l=c.map(e=>e.lines),u=r.loopStart,d=g&&u!==void 0?u+1:e.length-a,p=d>0?[s,...l.slice(1,d)].flat():[];return{trace:e.map((n,r)=>{let a=c[r].result,o={action:n.action,label:a&&Iy(a,t.version),state:i===void 0?Me(n.state):Ne(i,e,r,u),output:r===0?p:r<d?[]:l[r]};return(i!==void 0||a)&&le.set(o,{state:Me(n.state),action:a}),o}),traceOutput:a>0&&!g?[s,...l].flat():[]}},Le=()=>me.init===void 0?[]:Hc(me.init,m,me.scope),j=(e,t)=>f(()=>{for(let n of ge()){let r=Wc(n.expression,e,m,n.scope).find(t);if(r)return{...r,action:r.action??n.name}}}).result,Re=(e,t)=>Xe(he(e),Ee[t]),ze=(e,t)=>j(e,e=>Re(e.state,t)),Be=(e,t)=>{let n=f(()=>Ce||wu(m)?Le().find(t=>Re(t,e[0])):A[e[0]]).result;if(!n)throw new y(Cb);let r=[{state:n,action:void 0}];for(let n=1;n<e.length;n++){let i=r[n-1].state;if(e[n-1]===e[n]){r.push({state:i,action:`Stuttering`});continue}let a=ze(i,e[n]);if(!a)throw new y(t);r.push(a)}return r},Ve=(e,t)=>{let n=[];for(let t=e;t!==-1;t=De[t])n.unshift(t);let r=Ce&&n.length>1?Be(n,Cb):n.map(e=>({state:A[e],action:Oe[e]}));if(!t)return Ie(r,n);let i=Ce?j(A[e],e=>Xe(e.state,t.state))?.action:t.action;return Ie([...r,{state:t.state,action:i}],n,{known:2})},He=e=>De[e]===-1?{trace:[{action:void 0,label:void 0,state:Me(A[e])}],traceOutput:g?[]:f(Le).lines}:Ve(e),Ue=(e,t)=>({trace:Ve(e,t).trace}),We=(t,n)=>n.isInitial&&!n.callStack&&!n.fingerprint&&g?e.success:n.callStack?n.isCallStackFirst?oe(t):n.isLiveCallStack?r(t)??(t instanceof S?t.exitCode:e.error):n.isInitial||n.fingerprint?e.specEvaluationFailure:dx(t):n.isInitial?ux(t):oe(t),Ge=(e,t,n={})=>{let r=c(e)?new x:e;if(!(r instanceof y))throw r;let i=t.trace.length>0&&!n.traceFailure?fe(t.trace,void 0):void 0,a=i?.unwitnessed??i?.postcondition,o=[...t.traceOutput??[],...i?.lines??[]];return{...b(`error`,void 0,{...Sx(r,n.isNextState??!1),...t,...o.length>0&&{traceOutput:o},...a&&{postcondition:a},initialState:n.initialState&&!(r instanceof S)?Me(n.initialState):void 0,exitCode:We(r,n),callStack:n.callStack,...n.isCallStackFirst&&{isCallStackFirst:!0},...n.fingerprint&&{fingerprint:n.fingerprint},...n.traceFailure&&{traceFailure:n.traceFailure}}),outDegrees:n.outDegrees}},Ke=(n,r)=>{h.generatedStates++;let i=ge(),a=i.length===1?i[0]:i.find(e=>e.name===r.action),o=r.variables,s=i.length===1?`the next-state action`:`action ${r.action} of the next-state relation`,c=g?`assigned`:`defined`,l=`Successor state is not completely specified by ${s}. The following variable${o.length>1?`s are`:` is`} not ${c}: ${o.join(`, `)}.\n`,u=Rt(`null`),d=r.state.map(e=>e??u),f=Ge(r,He(n));return w({...f,failure:f.failure&&{...f.failure,code:sa.incompleteSuccessor,message:l,toolMessage:l,exitCode:e.specEvaluationFailure,trace:[...f.failure.trace,{action:r.action,label:a&&Iy(a,t.version),state:Me(d)}]}})},qe=(e,t)=>{let n=Be(e,wb),r=n[n.length-1].state;if(Ce&&t!==void 0&&t!==e.length-1&&ze(r,e[t])===void 0)throw new y(wb);return n},Je=e=>{let t=2166136261;for(let n=0;n<e.length;n++)t=zr(t,Jr(e[n]));return t&1073741823},Ye=e=>{for(let t of e){let e=Kr(t);if(e)throw e}},Xe=(e,t)=>{for(let n=0;n<t.length;n++)if(!en(e[n],t[n]))return!1;return!0},Ze=e=>Math.imul(e,2654435761)>>>Ae.shift<<1,Qe=(e,t)=>{let n=Ae.slots.length-1;for(let r=Ze(e);;r=r+2&n){let n=Ae.slots[r+1];if(n===0)return-1;if(Ae.slots[r]===e&&Xe(Ee[n-1],t))return n-1}},$e=(e,t)=>{let n=Ae.slots.length-1,r=Ze(e);for(;Ae.slots[r+1]!==0;)r=r+2&n;Ae.slots[r]=e,Ae.slots[r+1]=t},et=(e,t)=>{if(Ae.size++,Ae.size*4>Ae.slots.length){let e=Ae.slots;Ae.slots=new Int32Array(e.length*2),Ae.shift--;for(let t=0;t<e.length;t+=2)e[t+1]!==0&&$e(e[t],e[t+1])}$e(e,t+1)},tt={fingerprint:void 0},nt=e=>{h.distinctStates=A.length+1,_.depth=Math.max(_.depth,e),h.diameter=Math.max(h.diameter,e)},rt=(e,t,n,r)=>{let i=n===-1?1:ke[n]+1;A.push(e),Ee.push(t),De.push(n),Oe.push(r),ke.push(i)},M={index:-1,isExpanding:!1,candidate:void 0,candidateLevel:0,livenessSource:-1},at=e=>e===-1?[]:[...at(De[e]),A[e]];h.isSeen=e=>{let t=he(e);return Qe(Je(t),t)!==-1},h.getBehavior=e=>{let t=e===M.candidate?-1:A.indexOf(e);return t===-1?[...at(M.index),e]:at(t)},h.getCurrentState=()=>M.index===-1?void 0:A[M.index],h.setLivenessSource=e=>{M.livenessSource=e??-1},h.getLevel=e=>{let t=M.livenessSource;if(g){let e=t===-1?M.isExpanding?M.index:-1:t;return e===-1?0:ke[e]}return t===-1?e===M.candidate?M.candidateLevel:M.index===-1?0:e===A[M.index]?ke[M.index]:M.isExpanding?ke[M.index]+1:0:e===A[t]?ke[t]:ke[t]+1};let ot=(e,t)=>({fingerprint:BigInt.asIntN(64,h.getFingerprint(e)),level:t,getLabel:()=>fi(o.alias===void 0?Me(e):Pe(o.alias,e,void 0)),getText:()=>fi(Me(e))}),st=e=>{je(e),h.generatedStates++,h.initialStates++,M.candidate=e,M.candidateLevel=1;let t=he(e),n=Je(t),r=E.satisfiesConstraints(e);if(r&&(E.trackStatePossible(e),Ye(t),e.forEach(Xt)),r&&Qe(n,t)!==-1)return;tt.fingerprint=r?t:void 0,r&&(nt(1),h.queueSize++,k?.addInitialState(A.length,e),i?.writeInitialState(ot(e,1)));let a=E.findViolatedInvariant(e);if(a)return pe(`invariant-violation`,{name:a.name,...Ie([{action:void 0,state:e}],[])});let o=E.findFailedInitialPredicate(e);if(o)return pe(`liveness-violation`,{name:o.name,...Ie([{action:void 0,state:e}],[])});r&&(et(n,A.length),rt(e,t,-1,void 0))},ct=(e,t,n,r,a)=>{let o=A[e];h.generatedStates++,M.candidate=t.state,M.candidateLevel=ke[e]+1,Te&&je(t.state);let s=he(t.state),l=Je(s),u=Qe(l,s),d=E.satisfiesConstraints(t.state,o);d&&E.trackStatePossible(t.state);let p=d&&E.satisfiesActionConstraints(o,t.state);p&&(E.trackActionPossible(o,t.state),Ye(s),t.state.forEach(Xt));let m=p?u:-1;if(r&&p&&i?.writeSuccessor(r,ot(t.state,ke[e]+1),m!==-1,a&&{name:a.name,signature:Ly(a)}),m!==-1&&k){let e=A[m],r=e.every((e,n)=>e===t.state[n]);n.push({index:m,state:r?e:t.state})}let g=p&&m===-1;if(g&&k&&n.push({index:A.length,state:t.state}),tt.fingerprint=g?s:void 0,g&&(nt(ke[e]+1),re.newStates++),m===-1)try{let n=E.findViolatedInvariant(t.state,o);if(n)return w(pe(`invariant-violation`,{name:n.name,...Ve(e,t)}))}catch(n){if(c(n))throw n;let r=f(()=>Se(e));return Ge(n,xb(Ue(e,t),r.lines),r.result??{outDegrees:ae()})}let _=E.findViolatedActionProperty(o,t.state);if(_)return w(pe(`liveness-violation`,{name:_.name,...Ve(e,t)}));g&&(Te||je(t.state),et(l,A.length),rt(t.state,s,e,t.action),h.queueSize++)},N={result:void 0};k&&t.onProgress?.({kind:`liveness-prepared`,branches:k.branches});let P=D();if(P)return b(`assumption-violation`,P);if(t.onProgress?.({kind:`initial-states-started`}),me.init!==void 0)try{Vc(me.init,m,e=>{jb(h.initialStates,t.onProgress);try{N.result=st(e)}catch(t){let n=f(xe);N.result=Ge(t,{trace:[],traceOutput:n.lines},{initialState:e,...n.result,isInitial:!0})}return N.result!==void 0},me.scope)}catch(e){if(e instanceof ne){let t=Ge(e,{trace:[]},{initialState:e.state.map(e=>e??Rt(`null`))});return{...t,failure:t.failure&&{...t.failure,isWithoutStatistics:!0}}}let t=f(xe);return Ge(e,{trace:[],traceOutput:t.lines},{...t.result,isInitial:!0})}if(N.result)return N.result;_.initialStates={generated:h.initialStates,distinct:h.distinctStates},t.onProgress?.({kind:`initial-states-computed`,initialStates:_.initialStates});let lt=me.next;if(lt===void 0){if(A.length>0)throw new y(`No next state actions defined to generate successor states from.`);return T()}let F=!!(t.dump?.dot&&(t.dump.actionLabels||t.dump.colorize)),I=(e,t)=>{if(!F)return Uc(lt,e,m,e=>t(e,void 0),me.scope);let n={isStopped:!1};return ge().reduce((r,i)=>n.isStopped?r:r+Uc(i.expression,e,m,e=>(n.isStopped=t(e,i),n.isStopped),i.scope),0)},ut=(e,t)=>{if(!k||g)return;let n=_e(n=>k.addState(e,A[e],t,n));return n?.callStack.length&&!n.fingerprint?n.callStack:void 0},dt=(e,t)=>{try{k?.addState(e,A[e],t);return}catch(n){if(!(n instanceof y))throw n;return ut(e,t)}},ft=(e,t)=>{let n=f(()=>dt(e,t));if(n.result)return{result:{callStack:n.result,fingerprint:void 0,isLiveCallStack:!0},lines:n.lines};let r=f(()=>Se(e));return{result:r.result,lines:[...n.lines,...r.lines]}},pt=e=>Ge(wx(),He(e)),mt=(e,t,n)=>{if(c(e))return pt(t);let r=ft(t,n);return Ge(sx(e),xb(He(t),r.lines),{isNextState:!0,...r.result})},ht=(t,r)=>{let a=A[t],l=i&&ot(a,ke[t]),u=I(a,(e,n)=>{try{N.result=ct(t,e,r,l,n)}catch(n){if(c(n))return N.result=pt(t),!0;let i=g?f(()=>Se(t)):ft(t,r);if(g&&n instanceof y&&!fx.has(n))return N.result=Ge(new y(`${vx(n)}${n.message}`,n),xb({trace:[]},i.lines),{isNextState:!0,...i.result}),!0;let a=he(e.state).some(e=>Kr(e)!==void 0)&&n instanceof y?Sx(_a(n)?new y(`${_x}${n.message}`):n,!0):void 0;N.result=Ge(n,xb(a?He(t):Ue(t,e),i.lines),{isNextState:!0,...i.result,traceFailure:a})}return N.result!==void 0});M.isExpanding=!1;let d=N.result;if(d?.violation&&!g){let e=f(()=>dt(t,r));return{...d,violation:xb(d.violation,e.lines),...e.result&&{liveCallStack:e.result}}}if(d)return d;let p=()=>{k&&l&&g&&i?.writeStuttering(l);let e=k?.addState(t,a,r);if(!k||!e)return;let n=qe(e),o=se(k,n.map(e=>e.state),n.length-1);return pe(`property-violation`,{name:o[0],properties:o,...Ie(n,e,{known:0})})};if(u===0&&o.checkDeadlock){let e=pe(`deadlock`,{name:`deadlock`,...He(t)}),n=f(()=>{try{return{additional:p()?.violation}}catch(e){if(!(e instanceof y))throw e;return{isFailed:!0,callStack:ut(t,r)}}}),i=e.violation?{...e,violation:xb(e.violation,n.lines)}:e,a=w(i,n.result.isFailed?ae():C());return n.result.additional?{...a,additionalViolation:n.result.additional}:n.result.callStack?{...a,liveCallStack:n.result.callStack}:a}try{return p()}catch(i){if(g&&i instanceof y){let t=new y(`${_a(i)?_x:s}${i.message}`);return Ge(n(t,e.error),{trace:[]},{outDegrees:ae()})}let o=_e(e=>k?.addState(t,a,r,e));return Ge(i,He(t),{outDegrees:ae(),callStack:o?.callStack.length?o.callStack:void 0,isNextState:!0,isCallStackFirst:!0})}},gt=()=>{let e=o.specification,t=`(compare Chapter 8, page 87ff of Specifying Systems at https://lamport.azurewebsites.net/tla/book.html).`;if(e===void 0)return{code:sa.noSpecificationButProperty,text:`The stuttering counterexample above may be caused by the absence of a behavior specification (SPECIFICATION). Only INIT and NEXT have been provided, so TLC permits infinite stuttering. To rule out such counterexamples, use SPECIFICATION Spec, with Spec asserting a suitable fairness constraint ${t}`};let n=ml(e,m)?.location.range;if(!(me.temporals.length>0||!n))return{code:sa.noFairnessButProperty,text:`The stuttering counterexample above may be caused by the absence of a fairness constraint in the behavior specification ${e} defined at ${Xc(n)}. To rule out such counterexamples, conjoin a suitable fairness constraint to ${e} ${t}`}},_t=(e,n)=>{let r=[...n.prefix,...n.cycle],i=n.prefix.length,a=qe(r,i),o=Ie(a,r,{loopStart:i,known:0}).trace,s=se(e,a.map(e=>e.state),i),c=r[i],l=r[r.length-1],u=a[a.length-1].state,d=c===l?{result:void 0,lines:[]}:f(()=>Fe(l,u,A[c],!1)),p=c===l&&n.isCycleConstrained;return pe(`liveness-violation`,{name:s[0],properties:s,trace:o,traceOutput:d.lines,loopStart:i,loopLabel:d.result&&Iy(d.result,t.version),warning:p?gt():void 0},()=>c===l?de(o[o.length-1]):d.result?my(d.result):Oh(ze(u,c)?.action))},vt=k!==void 0&&t.livenessCheck!==`final`,yt=performance.now(),bt={at:yt+3e3,size:1,time:0},xt=e=>{let n=performance.now();if(!((e-bt.size)/bt.size>.1)||bt.time>(n-yt)*.2||(bt.size=e,!k))return;t.onProgress?.({kind:`liveness-started`,branches:k.branches,isComplete:!1,states:e,statistics:b(`success`)});let r=k.findViolation();return r||t.onProgress?.({kind:`liveness-finished`}),bt.time+=performance.now()-n,r};for(let e=0;e<A.length&&!h.isStopped;e++){M.index=e,M.candidate=void 0,h.queueSize=A.length-e-1,M.isExpanding=!0;let n=[];try{N.result=ht(e,n)}catch(t){N.result=t instanceof ee?Ke(e,t):mt(t,e,n)}if(N.result)return N.result;if(te[ie()]++,re.newStates=0,(vt||t.onProgress)&&performance.now()>=bt.at){bt.at=performance.now()+6e4;let n=vt?xt(e+1):void 0;if(k&&n)return _t(k,n);t.onProgress?.({kind:`progress`,statistics:b(`success`)})}}M.index=-1,M.candidate=void 0,k&&t.onProgress?.({kind:`liveness-started`,branches:k.branches,isComplete:!0,states:h.distinctStates,statistics:b(`success`)});let St=k?.findViolation();if(k&&St)return _t(k,St);k&&t.onProgress?.({kind:`liveness-finished`});try{let e=E.findPostconditionViolation();if(e)return b(`postcondition-violation`,{name:e.name,message:e.message,counts:e.counts,trace:[],postcondition:e})}catch(e){return Ge(e,{trace:[]})}return T()},Ex=e=>{let t=Math.imul(e^e>>>16,2146121005),n=Math.imul(t^t>>>15,2221713035);return n^n>>>16},Dx=(e,t)=>{let n=2166136261,r=1779033703;for(let t=0;t<e.length;t++)n=Math.imul(n^Jr(e[t]),16777619),r=Math.imul(r^ti(e[t]),1540483477);t[0]=Ex(n)||1,t[1]=Ex(r)},Ox=()=>{let e={slots:/* @__PURE__ */ new Int32Array(8192),used:0},t=(e,t,n)=>{let r=e.length/2-1;for(let i=t&r;;i=i+1&r){let r=e[i*2];if(r===0||r===t&&e[i*2+1]===n)return i}},n=()=>{let n=e.slots,r=new Int32Array(n.length*2);for(let e=0;e<n.length;e+=2){if(n[e]===0)continue;let i=t(r,n[e],n[e+1]);r[i*2]=n[e],r[i*2+1]=n[e+1]}e.slots=r};return{insert:(r,i)=>{e.used*4>=e.slots.length&&n();let a=t(e.slots,r,i);return e.slots[a*2]!==r&&(e.slots[a*2]=r,e.slots[a*2+1]=i,e.used++,!0)}}},kx=(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}},Ax=()=>({slots:new BigInt64Array(new SharedArrayBuffer(8192)),used:new Int32Array(new SharedArrayBuffer(4))}),jx=(e,t,n)=>{let r=BigInt.asIntN(64,BigInt(t)<<32n|BigInt(n>>>0));return kx(e.slots,r)?(Atomics.add(e.used,0,1),!0):!1},Mx=e=>Atomics.load(e.used,0)*2>=e.slots.length,Nx=e=>{let t=new BigInt64Array(new SharedArrayBuffer(e.slots.byteLength*2));for(let n of e.slots)n!==0n&&kx(t,n);return{slots:t,used:e.used}},Px=[void 0,`lambda`,`tuple`,`record`],Fx=()=>{let e={words:/* @__PURE__ */ new Int32Array(1024),length:0,count:0},t=[],n=/* @__PURE__ */ new Map,r=t=>{if(e.length===e.words.length){let t=new Int32Array(e.words.length*2);t.set(e.words),e.words=t}e.words[e.length++]=t},i=e=>{let i=n.get(e);if(i!==void 0)return r(i);n.set(e,t.length),r(t.length),t.push(e)},a=e=>{if(typeof e==`boolean`)return r(+!!e),!0;if(typeof e==`number`)return(e|0)===e&&(r(2),r(e),!0);if(typeof e==`string`)return r(3),i(e),!0;if(e.kind===`ModelValue`)return r(4),i(e.name),!0;if(e.kind===`Set`)return r(5),r(e.elements.length),e.elements.every(a);if(e.kind===`Function`){let t=Pr(e.domain);return t?(r(7),r(Px.indexOf(Ut(e))),r(t.low),r(e.range.length),e.range.every(a)):(r(6),r(Px.indexOf(Ut(e))),r(e.domain.length),e.domain.every(a)&&e.range.every(a))}return!1};return{encode:t=>{let n=e.length;return t.every(a)?(e.count++,!0):(e.length=n,!1)},finish:()=>({words:e.words.slice(0,e.length),strings:t,count:e.count})}},Ix=e=>t=>{let n=t.words,r={index:0},i=e=>Array.from({length:e},()=>a()),a=()=>{let e=n[r.index++];if(e===0)return!1;if(e===1)return!0;if(e===2)return n[r.index++];if(e===3)return t.strings[n[r.index++]];if(e===4)return Rt(t.strings[n[r.index++]]);if(e===5)return zt(i(n[r.index++]));let a=Px[n[r.index++]];if(e===7){let e=n[r.index++],t=n[r.index++],o=qn({kind:`Interval`,low:e,high:e+t-1});return Ht(Bt(o,i(t)),a)}let o=n[r.index++],s=i(o);return Ht(Bt(s,i(o)),a)};return Array.from({length:t.count},()=>Array.from({length:e},()=>a()))};export{Re as $,Cd as A,ba as B,Lp as C,dp as D,Bp as E,Wc as F,mi as G,Sa as H,sa as I,Ot as J,fi as K,ca as L,Zc as M,wu as N,Rd as O,Hc as P,qe as Q,ua as R,I_ as S,Vp as T,ga as U,Ca as V,hi as W,Et as X,wt as Y,it as Z,fb as _,o as _t,Nx as a,v as at,P_ as b,Dx as c,ae as ct,ax as d,d as dt,ye as et,jb as f,u as ft,yb as g,oe as gt,vb as h,s as ht,Ax as i,w as it,wd as j,Sd as k,Cx as l,f as lt,gb as m,ie as mt,Fx as n,T as nt,jx as o,l as ot,Mb as p,C as pt,z as q,Ox as r,se as rt,Mx as s,y as st,Ix as t,xe as tt,ox as u,re as ut,bb as v,e as vt,zp as w,L_ as x,Z_ as y,n as yt,ya as z};
|