tla-ts 0.0.7-dev.bd12468 → 0.0.8
This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
- package/dist/deciders.cjs +16 -16
- package/dist/deciders.js +49 -49
- package/dist/index.cjs +1 -1
- package/dist/index.js +1 -1
- package/dist/parallel-worker.cjs +1 -1
- package/dist/parallel-worker.js +1 -1
- package/dist/prove-worker.cjs +1 -1
- package/dist/prove-worker.js +1 -1
- package/dist/prove.cjs +32 -32
- package/dist/prove.js +34 -34
- package/dist/run.cjs +23 -23
- package/dist/run.js +28 -28
- package/dist/tlapm.cjs +1 -1
- package/dist/tlapm.js +1 -1
- package/dist/transfer.cjs +28 -28
- package/dist/transfer.js +28 -28
- package/dist/worker.cjs +4 -1
- package/dist/worker.js +4 -1
- package/package.json +1 -1
- package/src/check.ts +5 -3
- package/src/codegen.ts +14 -0
- package/src/environment.ts +8 -6
- package/src/parallel-worker.ts +18 -4
- package/src/parallel.ts +5 -3
- package/src/parser.ts +5 -2
- package/src/tlc/order.ts +137 -71
- package/src/worker.ts +16 -0
package/dist/run.cjs
CHANGED
|
@@ -6,40 +6,40 @@
|
|
|
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=require("./tlapm.cjs"),t=require("./worker.cjs"),n=require("./transfer.cjs"),r=require("./prove.cjs");let i=require("node:path"),a=require("node:fs"),o=require("node:url"),s=require("node:os"),c=require("node:v8");const l=`META-INF/MANIFEST.MF`,u=async e=>{if(e===void 0||!(0,a.existsSync)(e))return`master`;let t=await import(`fflate`),n=t.unzipSync((0,a.readFileSync)(e),{filter:e=>e.name===l})[l];return(n&&/^X-Git-Tag: *(\S*)/m.exec(t.strFromU8(n))?.[1])===`v1.7.4`?`1.7.4`:`master`},d=/[*?[{]/,f=e=>e.flatMap(e=>d.test(e)?(0,a.globSync)(e).sort().map(e=>({path:e,isGlobbed:!0})):[{path:e,isGlobbed:!1}]),p=(e,t)=>e.map(e=>(0,i.join)(e,`${t}.tla`)).find(a.existsSync),m=e=>t=>{let n=p(e,t);return n===void 0?void 0:(0,a.readFileSync)(n,`utf8`)},h=(e,t,n)=>console.error(`File does not exist: ${e}/${t} while looking in these directories: ${e}, ${n.join(`, `)}, classpath:/tla2sany/StandardModules, classpath:/`),g=e=>`jar:file:${(0,o.pathToFileURL)((0,i.resolve)(e)).pathname}!/tla2sany/StandardModules/`,_=(e,r)=>{if(e instanceof t.
|
|
10
|
-
`),he=/* @__PURE__ */ new Set([`--toolbox`,`--line`,`--threads`,`--nofpl`]),ge=t=>[`.`,...e.t().map(e=>(0,i.join)((0,i.dirname)((0,i.dirname)((0,a.realpathSync)(e))),`lib/tlapm/stdlib`)).filter(e=>(0,a.existsSync)(e)).slice(0,1),...t.options.flatMap(e=>e.name===`-I`?e.values:[]).toReversed()],_e=e=>console.error(`@!!BEGIN\n${e.map(e=>`@!!${e}\n`).join(``)}@!!END\n`),ve=(e,t,n)=>_e([`type:obligation`,`id:${e.id}`,`loc:${e.location}`,`status:${t}`,...n]),ye=`9ed0376`,be=e=>/^[+,\-./0-9:=@A-Z_a-z]+$/.test(e)?e:`'${e.replaceAll(`'`,`'\\''`)}'`,xe={failed:10,incomplete:11,emptyTarget:12},Se=(e,t,n)=>{let i=e.summary;n||(i.absent.forEach(e=>console.error(`Missing proof at ${r.p(e)}`)),i.omitted.forEach(e=>console.error(`Omitted proof at ${r.p(e)}`)));let a=i.absent.length+i.omitted.length>0;a&&console.error(`${r.f(e.location)}[ERROR]: Proof incomplete in module ${JSON.stringify(e.name)}: ${i.absent.length} missing, ${i.omitted.length} omitted proof step(s).`);let o=t&&e.obligations.length===0;return o&&console.error(`${r.f(e.location)}[ERROR]: No proof obligation found for the selected target.`),[...a?[xe.incomplete]:[],...o?[xe.emptyTarget]:[]]},Ce=e=>{try{return e()}catch(e){if(!(e instanceof t.
|
|
9
|
+
const e=require("./tlapm.cjs"),t=require("./worker.cjs"),n=require("./transfer.cjs"),r=require("./prove.cjs");let i=require("node:path"),a=require("node:fs"),o=require("node:url"),s=require("node:os"),c=require("node:v8");const l=`META-INF/MANIFEST.MF`,u=async e=>{if(e===void 0||!(0,a.existsSync)(e))return`master`;let t=await import(`fflate`),n=t.unzipSync((0,a.readFileSync)(e),{filter:e=>e.name===l})[l];return(n&&/^X-Git-Tag: *(\S*)/m.exec(t.strFromU8(n))?.[1])===`v1.7.4`?`1.7.4`:`master`},d=/[*?[{]/,f=e=>e.flatMap(e=>d.test(e)?(0,a.globSync)(e).sort().map(e=>({path:e,isGlobbed:!0})):[{path:e,isGlobbed:!1}]),p=(e,t)=>e.map(e=>(0,i.join)(e,`${t}.tla`)).find(a.existsSync),m=e=>t=>{let n=p(e,t);return n===void 0?void 0:(0,a.readFileSync)(n,`utf8`)},h=(e,t,n)=>console.error(`File does not exist: ${e}/${t} while looking in these directories: ${e}, ${n.join(`, `)}, classpath:/tla2sany/StandardModules, classpath:/`),g=e=>`jar:file:${(0,o.pathToFileURL)((0,i.resolve)(e)).pathname}!/tla2sany/StandardModules/`,_=(e,r)=>{if(e instanceof t.h||e instanceof t._){let t=n.vt(e.message),i=t&&!t.isEvalException?t.code:n.dt.general;return r.print(i,n.ft.error,n.mt(i,e.message,r.isTool))}console.error(`${e.name}: ${e.message}`)},v=async(e,r=n.pt(!1))=>{try{return await e()}catch(e){if(!(e instanceof t.g))throw e;return _(e,r),t.V(e)}},y=(e,t,n)=>console.error(`File does not exist: ${(0,i.isAbsolute)(e)?e:`${process.cwd()}/${e}`} while looking in these directories: ${[...t,...n===void 0?[]:[g(n)]].join(`, `)}`),b=e=>e.endsWith(`/`)?e:`${e}/`,x=(e,t)=>r=>{let i=e(r);return i===void 0&&!n.I.has(r)&&t(`${r}.tla`),i},S=e=>e.classPath?.split(i.delimiter).find(e=>e.endsWith(`.jar`));var C=`0.0.8`;const w=2224400062,T={int8:0,int16:1,int32:2,shared8:4,shared16:5,shared32:6,block32:8,string8:9,string32:10,doubleLittle:12},E={smallInt:64,smallString:32,smallBlock:128},D=(e,...t)=>({tag:e,fields:t}),O=e=>typeof e==`object`&&`tag`in e,ee=(e,n)=>{let r=new DataView(e.buffer,e.byteOffset,e.byteLength);if(e.length<n+20||r.getUint32(n)!==w)throw new t.w(`corrupted fingerprint file`);let i=n+20+r.getUint32(n+4),a=[],o={position:n+20},s=e=>{let n=o.position;if(o.position+=e,o.position>i)throw new t.w(`corrupted fingerprint file`);return n},c=new TextDecoder,l=t=>{let n=s(t),r=c.decode(e.subarray(n,n+t));return a.push(r),r},u=(e,t)=>{let n=D(e);t>0&&a.push(n);for(let e=0;e<t;e++)n.fields.push(f());return n},d=e=>a[a.length-e],f=()=>{let n=e[s(1)];if(n>=E.smallBlock)return u(n&15,n>>4&7);if(n>=E.smallInt)return n&63;if(n>=E.smallString)return l(n&31);switch(n){case T.int8:return r.getInt8(s(1));case T.int16:return r.getInt16(s(2));case T.int32:return r.getInt32(s(4));case T.shared8:return d(r.getUint8(s(1)));case T.shared16:return d(r.getUint16(s(2)));case T.shared32:return d(r.getUint32(s(4)));case T.block32:{let e=r.getUint32(s(4));return u(e&255,e>>>10)}case T.string8:return l(r.getUint8(s(1)));case T.string32:return l(r.getUint32(s(4)));case T.doubleLittle:{let e={float:r.getFloat64(s(8),!0)};return a.push(e),e}}throw new t.w(`corrupted fingerprint file`)};return{value:f(),next:i}},te=e=>{let t=[],n={objects:0,words32:0,words64:0},r=(e,n)=>{for(let r=(n-1)*8;r>=0;r-=8)t.push(e>>>r&255)},i=new TextEncoder,a=e=>{if(typeof e==`number`)return e>=0&&e<64?t.push(E.smallInt+e):e>=-128&&e<128?t.push(T.int8,e&255):e>=-32768&&e<32768?(t.push(T.int16),r(e,2)):(t.push(T.int32),r(e,4));if(n.objects++,typeof e==`string`){let a=i.encode(e);a.length<32?t.push(E.smallString+a.length):a.length<256?t.push(T.string8,a.length):(t.push(T.string32),r(a.length,4)),t.push(...a),n.words32+=1+Math.floor((a.length+4)/4),n.words64+=1+Math.floor((a.length+8)/8);return}if(!O(e)){let r=/* @__PURE__ */ new DataView(/* @__PURE__ */ new ArrayBuffer(8));r.setFloat64(0,e.float,!0),t.push(T.doubleLittle,...new Uint8Array(r.buffer)),n.words32+=3,n.words64+=2;return}let o=e.fields.length;o===0?n.objects--:(n.words32+=1+o,n.words64+=1+o),e.tag<16&&o<8?t.push(E.smallBlock+e.tag+(o<<4)):(t.push(T.block32),r(o*1024+e.tag,4)),e.fields.forEach(a)};a(e);let o=/* @__PURE__ */ new DataView(/* @__PURE__ */ new ArrayBuffer(20));return[w,t.length,n.objects,n.words32,n.words64].forEach((e,t)=>o.setUint32(t*4,e)),new Uint8Array([...new Uint8Array(o.buffer),...t])},k=20210223,A={zenon:{field:1,tag:1},isabelle:{field:2,tag:0},smt:{field:10,tag:8},z3:{field:11,tag:9},ls4:{field:17,tag:16}},j=[`false`,`timeout`],ne=`tla-ts ${C}`,re=/* @__PURE__ */ new Map([[A.zenon.field,3],[A.isabelle.field,4]]),M=(e,t)=>e!==void 0&&O(e)?e.fields[t]:void 0,ie=e=>e!==void 0&&typeof e==`object`&&`float`in e?e.float:1/0,N=e=>{let t=new TextEncoder().encode(e),n=(e,t)=>e<<t|e>>>32-t,r=Array.from({length:Math.ceil(t.length/4)},(e,n)=>t[n*4]|t[n*4+1]<<8|t[n*4+2]<<16|t[n*4+3]<<24).reduce((e,t)=>{let r=Math.imul(n(Math.imul(t,3432918353),15),461845907);return Math.imul(n(e^r,13),5)+3864292196|0},0),i=Math.imul(r^t.length^(r^t.length)>>>16,2246822507),a=Math.imul(i^i>>>13,3266489909);return(a^a>>>16)&1073741823},ae=e=>e!==void 0&&O(e)?[[e.fields[0],e.fields[1]],...ae(e.fields[2])]:[],oe=(e,n,r)=>{let i=(0,a.readFileSync)(n),o=ee(i,0),s=ee(i,o.next).value;if(o.value!==k||!O(s)||s.tag!==0)throw new t.w(`corrupted fingerprint file`);let c=M(M(s,0),1),l=(e,t)=>{let n=re.get(t);return!r||n===void 0||M(M(e,0),n)===ne};e.clear(),(c!==void 0&&O(c)?c.fields:[]).flatMap(e=>ae(e).toReversed()).forEach(([n,r])=>{if(typeof n!=`string`||!O(r))throw new t.w(`corrupted fingerprint file`);e.set(n,r.fields.map((e,t)=>l(e,t)?e:0))})},se=(e,t)=>{let n=M(t,0),r=M(n,0),i=M(M(n,1),0);if(r===void 0||r===1)return;let a=ie(M(e===`isabelle`?M(i,0):i,0)),o=e===`isabelle`?M(i,1):void 0,s=M(M(r,0),0);return{method:{prover:e,timeLimitMs:a*1e3,...typeof o==`string`&&{tactic:o}},isProved:r===0,isReused:!1,...s!==void 0&&{reason:typeof s==`number`?j[s]:String(M(s,0))}}},ce=e=>{let t=/* @__PURE__ */ new Date,n=e.method,r={float:n.rlimit??n.timeLimitMs/1e3},i=n.prover===`zenon`?D(0,r,5):n.prover===`isabelle`?D(0,D(0,r),n.tactic??`auto`):D(0,r),a=j.indexOf(e.reason??``),o=e.reason===void 0?0:D(0,a===-1?D(0,e.reason):a);return D(0,D(0,D(0,e.isProved?0:D(0,o),D(A[n.prover].tag,i)),D(0,t.getFullYear(),t.getMonth(),t.getDate(),t.getHours(),t.getMinutes(),t.getSeconds()),ne,ne,ne))},le=e=>{let t=2**Math.max(9,Math.ceil(Math.log2(e.size/2))),n=Array.from({length:t},()=>0);return e.forEach((e,r)=>{let i=N(r)&t-1;n[i]=D(0,r,D(0,...e),n[i])}),D(0,D(0,e.size,D(0,...n),0,512))},ue=e=>String(e).padStart(2,`0`),de=(e,t)=>{let n=/* @__PURE__ */ new Date,r=`${e}.history`,o=(0,i.join)(r,`${n.getFullYear()}-${ue(n.getMonth()+1)}-${ue(n.getDate())}_${ue(n.getHours())}_${ue(n.getMinutes())}_${ue(n.getSeconds())}`);(0,a.mkdirSync)(o,{recursive:!0}),[e,...t].filter(e=>(0,a.existsSync)(e)).forEach(e=>(0,a.cpSync)(e,(0,i.join)(o,(0,i.basename)(e)),{preserveTimestamps:!0})),(0,a.readdirSync)(r).map(e=>(0,i.join)(r,e)).sort((e,t)=>(0,a.statSync)(t).mtimeMs-(0,a.statSync)(e).mtimeMs).slice(10).forEach(e=>(0,a.rmSync)(e,{recursive:!0,force:!0}))},fe=e=>{let t=/* @__PURE__ */ new Map,n=/* @__PURE__ */ new Map,r=new Map([...e].map(([e,r])=>{let i=new Map(Object.entries(A).flatMap(([e,n])=>{let i=se(e,M(r[n.field],0));return i?(t.set(i,r[n.field]),[[e,i]]):[]}));return n.set(i,r),[e,i]}));return{results:r,save:i=>{e.clear(),r.forEach((r,i)=>{let a=[...n.get(r)??Array(23).fill(0)];r.forEach((e,n)=>{a[A[n].field]=t.get(e)??ce(e)}),e.set(i,a)}),(0,a.writeFileSync)(`${i}.tmp`,Buffer.concat([te(k),te(le(e))])),(0,a.renameSync)(`${i}.tmp`,i)}}},pe=(e,t)=>{let n=new Map(t.map(e=>{let[t,...n]=e.flag.split(` `);return[t,e.getArity??(()=>n.length)]}));return{usage:e.replace(`{options}`,t.map(e=>`[${e.flag}]${e.isRepeatable?`...`:``}`).join(` `)),parse:e=>{let t=[],r=[],i=[],a=[];for(let o=0;o<e.length;o++){let s=n.get(e[o]);if(s===void 0){(e[o].startsWith(`-`)?i:r).push(e[o]);continue}let c=s(e.slice(o+1)),l={name:e[o],values:e.slice(o+1,o+1+c)};t.push(l),l.values.length<c&&a.push(l),o+=c}return{options:t,positionals:r,unknown:i,incomplete:a[0],has:e=>t.some(t=>t.name===e),get:e=>t.findLast(t=>t.name===e)?.values}}}},me=pe(`tla-ts <Spec.tla|Spec.cfg|glob>... {options}`,[{flag:`-config <Spec.cfg>`},{flag:`-deadlock`},{flag:`-dump [<format>] <file>`,getArity:e=>e.length>1&&e[0].startsWith(`dot`)?2:1},{flag:`-fp <num>`},{flag:`-lncheck <final|default>`},{flag:`-metadir <directory>`},{flag:`-nowarning`},{flag:`-seed <num>`},{flag:`-tool`},{flag:`-workers <count|auto>`}]),P=pe(`tla-ts tlapm {options} <Module.tla|glob>...`,[{flag:`-N`},{flag:`--summary`},{flag:`--strict`},{flag:`--toolbox <start> <end>`},{flag:`--line <num>`},{flag:`--printallobs`},{flag:`--threads <num>`},{flag:`--version`},{flag:`-I <directory>`,isRepeatable:!0},{flag:`-k`},{flag:`--noproving`},{flag:`--nofp`},{flag:`--nofpl <start> <end>`},{flag:`--safefp`},{flag:`--cleanfp`},{flag:`--usefp <file>`},{flag:`--cache-dir <directory>`}]),F=[`Usage: ${me.usage}`,` ${P.usage}`,` tla-ts [<JVM option>]... tlc2.TLC <TLC option>... <Spec>`,` (-cp tla2tools.jar or -Dtla-ts.tlc=1.7.4 picks the TLC to reproduce)`,` tla-ts [<JVM option>]... tla2sany.xml.XMLExporter [-I <directory>]... [-o] [-t] [-r] [-u] <Module.tla>`].join(`
|
|
10
|
+
`),he=/* @__PURE__ */ new Set([`--toolbox`,`--line`,`--threads`,`--nofpl`]),ge=t=>[`.`,...e.t().map(e=>(0,i.join)((0,i.dirname)((0,i.dirname)((0,a.realpathSync)(e))),`lib/tlapm/stdlib`)).filter(e=>(0,a.existsSync)(e)).slice(0,1),...t.options.flatMap(e=>e.name===`-I`?e.values:[]).toReversed()],_e=e=>console.error(`@!!BEGIN\n${e.map(e=>`@!!${e}\n`).join(``)}@!!END\n`),ve=(e,t,n)=>_e([`type:obligation`,`id:${e.id}`,`loc:${e.location}`,`status:${t}`,...n]),ye=`9ed0376`,be=e=>/^[+,\-./0-9:=@A-Z_a-z]+$/.test(e)?e:`'${e.replaceAll(`'`,`'\\''`)}'`,xe={failed:10,incomplete:11,emptyTarget:12},Se=(e,t,n)=>{let i=e.summary;n||(i.absent.forEach(e=>console.error(`Missing proof at ${r.p(e)}`)),i.omitted.forEach(e=>console.error(`Omitted proof at ${r.p(e)}`)));let a=i.absent.length+i.omitted.length>0;a&&console.error(`${r.f(e.location)}[ERROR]: Proof incomplete in module ${JSON.stringify(e.name)}: ${i.absent.length} missing, ${i.omitted.length} omitted proof step(s).`);let o=t&&e.obligations.length===0;return o&&console.error(`${r.f(e.location)}[ERROR]: No proof obligation found for the selected target.`),[...a?[xe.incomplete]:[],...o?[xe.emptyTarget]:[]]},Ce=e=>{try{return e()}catch(e){if(!(e instanceof t.w))throw e;console.error(` tlapm ending abnormally with ${e.exception}\n`);return}},we=(e,t)=>{let n=t.method.timeLimitMs,i=t.timeUsedMs===void 0?``:`; time-used: ${(t.timeUsedMs/1e3).toFixed(1)} (${Math.round(100*t.timeUsedMs/n)}%)`,a=n===0?``:`time-limit: ${n===1/0?`inf`:Number((n/1e3).toPrecision(6))}${i}`,o=[t.method.tactic,a].filter(Boolean).join(`; `),s=(t.method.prover===`smt`||t.method.prover===`z3`)&&t.reason===`false`&&t.verdict?`(* SMT failed with status = ${t.verdict}\n *)\n`:``;ve(e,t.isProved?`proved`:`failed`,[`prover:${t.method.prover}`,...o===``?[]:[`meth:${o}`],...t.reason===void 0?[]:[`reason:${t.reason}`],`already:${t.isReused}`,...t.isProved?[]:[`obl:${t.isReused?``:`\n${s}`}${r.n(e,t.isReused)}`]])},Te=(e,t)=>ve(e,`failed`,[`prover:fail`,`meth:time-limit: inf`,`reason:${t}`,`already:false`,`obl:${e.text}`]),Ee=async(e,t,n,i)=>{let o=fe(i.fingerprints),s=await r.i(e.obligations,{workers:i.workers,results:o.results,isFingerprinted:i.isFingerprinted,isProving:i.isProving,onReport:(e,t)=>{if(i.isToolbox){if(e.obligation.status===`trivial`)return ve(t,`trivial`,[`prover:tlapm`,`already:false`]);if(t.kind.kind===`Error`)return Te(t,`user error`);e.attempts.forEach(e=>we(t,e))}}});if((0,a.writeFileSync)(t,r.t(e.name,s,e.obligations)),console.log(`(* created new ${JSON.stringify(t)} *)`),o.save(n),console.log(`(* fingerprints written in ${JSON.stringify(n)} *)`),!i.isProving)return!1;let c=s.flatMap((t,n)=>`reason`in t.obligation?[{report:t,obligation:e.obligations[n]}]:[]);i.isToolbox&&c.filter(e=>e.report.attempts.length===0&&e.obligation.kind.kind!==`Error`).forEach(e=>Te(e.obligation,`unexpected error`)),c.toReversed().forEach(e=>console.error(`${r.f(e.obligation.locus)}${r.d(r.u(`[ERROR]: @[<v2>Could not prove or check:@,%a@]`,r.l(e.obligation.sequent)),35)}`));let l=`${e.obligations.length} obligation${e.obligations.length>1?`s`:``}`;return console.error(c.length===0?`${r.f(e.location)}[INFO]: All ${l} proved.`:`${r.f(e.location)}[ERROR]: ${c.length}/${l} failed.\nThere were backend errors processing module \`${JSON.stringify(e.name)}\`.`),c.length>0},De=async e=>{let o=P.parse(e),c=!o.has(`-N`)&&!o.has(`--summary`),l=o.unknown[0]??(c&&o.has(`--printallobs`)?`--printallobs`:void 0);if(l!==void 0)return console.error(`Error: tla-ts tlapm does not support the tlapm option ${l}.`),1;if(o.incomplete)return console.error(`Error: option '${o.incomplete.name}' needs an argument.`),1;let u=o.options.find(e=>he.has(e.name)&&e.values.some(e=>!/^-?\d+$/.test(e)));if(u)return console.error(`Error: option '${u.name}' expects an integer.`),1;if(o.has(`--version`))return console.log(ye),t.W.success;let d=f(o.positionals).map(e=>e.path),p=d.map(e=>e.endsWith(`.tla`)?e:`${e}.tla`);if(p.length===0)return console.error(F),1;let m=o.has(`--toolbox`)||o.has(`--line`);m&&console.log(`\n\\* TLAPM version ${ye}\n\\* launched at ${n.gt(/* @__PURE__ */ new Date)} with command line:\n\\* ${[`tla-ts`,`tlapm`,...e].map(be).join(` `)}\n`);let h=o.options.reduce((e,t)=>{let[n,i]=t.values.map(Number);return t.name===`--toolbox`?{start:n,end:i===0?1/0:i}:t.name===`--line`?n===0?r.o:{start:n,end:n}:e},r.o),g=p.reduce((e,t)=>e.includes((0,i.dirname)(t))?e:[(0,i.dirname)(t),...e],ge(o)),_=/* @__PURE__ */ new Set,v=Ce(()=>{let e=p.findIndex(e=>!(0,a.existsSync)(e));if(e!==-1){let n=d[e];throw console.error(`File "<unknown>":\nError: File ${JSON.stringify(n)} not found`),new t.w(`File ${n} not found`,{failure:`Module.Parser.parse_file`})}return r.c(p.map(e=>({file:`./${e}`,source:(0,a.readFileSync)(e,`utf8`)})),e=>{_.add(e);let t=g.map(t=>`${t}/${e}.tla`).find(e=>(0,a.existsSync)(e));return t===void 0?e===`TLAPS`?{file:`TLAPS.tla`,source:r.a}:void 0:{file:t,source:(0,a.readFileSync)(t,`utf8`)}},{lines:h,onWarning:e=>{if(e.channel===`stdout`)return console.log(e.text);let t=e.channel===`toolbox`||e.channel===`toolboxOnly`;if(m&&t)return _e([`type:warning`,`msg:${e.text}`]);e.channel!==`toolboxOnly`&&console.error(e.text)}})});if(!v)return 3;let y=o.get(`--cache-dir`)?.[0]??process.env.TLAPM_CACHE_DIR??`.tlacache`,b=o.get(`--nofpl`)?.map(Number)??[0,0],x={isToolbox:m,isProving:!o.has(`--noproving`),workers:Math.max(1,Number(o.get(`--threads`)?.[0]??(0,s.availableParallelism)())),isFingerprinted:e=>!o.has(`--nofp`)&&!(e.locus&&e.locus.startLine>=b[0]&&e.locus.endLine<=b[1]),fingerprints:/* @__PURE__ */ new Map},S=[];for(let[e,t]of v.entries()){let n=`${y}/${t.name}.tlaps`,i=`${n}/fingerprints`,s=o.get(`--usefp`)?.[0]??i;if((0,a.mkdirSync)(n,{recursive:!0}),o.has(`--cleanfp`)&&(0,a.existsSync)(i)&&((0,a.rmSync)(i),console.log(`(* fingerprints file ${JSON.stringify(i)} removed *)`)),!o.has(`--cleanfp`)&&(0,a.existsSync)(s)&&t.summary.total!==0&&(console.log(o.has(`--nofp`)?`(* will not use fingerprints (because of option \`--nofp\`), but will now load fingerprints from the file \`${s}\`, in order to overwrite with the new fingerprints, and then save the results at the end. *)`:`(* loading fingerprints in ${JSON.stringify(s)} *)`),oe(x.fingerprints,s,o.has(`--safefp`))),o.has(`--summary`)&&console.log(r.s(t)),m&&(t.obligations.forEach(e=>ve(e,`to be proved`,o.has(`--printallobs`)?[`obl:${e.text}`]:[])),_e([`type:obligationsnumber`,`count:${t.obligations.length}`])),o.has(`--strict`)&&S.push(...Se(t,h.start>0||h.end<1/0,o.has(`--summary`))),!c)continue;de(i,[..._,...v.slice(0,e+1).map(e=>e.name)].map(e=>`${e}.tla`));let l=await Ee(t,`${n}/${t.name}.thy`,i,x);if(l&&o.has(`--strict`)&&S.push(xe.failed),l&&!o.has(`--strict`)&&!m)return console.error(` tlapm ending abnormally with Failure("backend errors: there are unproved obligations")
|
|
11
11
|
Raised at Stdlib.failwith in file "stdlib.ml", line 29, characters 17-33
|
|
12
12
|
Called from Tlapm_lib.process_module in file "src/tlapm_lib.ml", lines 492-493, characters 12-37
|
|
13
13
|
Called from Tlapm_lib.main.f in file "src/tlapm_lib.ml", line 640, characters 23-43
|
|
14
14
|
Called from Stdlib__List.fold_left in file "list.ml", line 125, characters 24-34
|
|
15
15
|
Called from Tlapm_lib.main in file "src/tlapm_lib.ml", line 643, characters 13-40
|
|
16
16
|
Called from Tlapm_lib.init in file "src/tlapm_lib.ml", line 659, characters 8-59
|
|
17
|
-
`),3}return Object.values(xe).find(e=>S.includes(e))??t.
|
|
17
|
+
`),3}return Object.values(xe).find(e=>S.includes(e))??t.W.success},I={builtin:1,number:2,string:3,ident:4,added:5},Oe=()=>({labelFlag:!1,labelRoot:`Lbl_`,fairnessOption:``,checkTermination:!1,specOption:!1,myspecOption:!1,inputVersionNumber:1903}),ke=e=>{let t={result:0,digitsAfterDecimal:0,isAfterDecimal:!1};for(let n of e)if(n===`.`)t.isAfterDecimal=!0;else if(n<`0`||n>`9`||(t.result=10*t.result+Number(n),t.isAfterDecimal&&(t.digitsAfterDecimal+=1),t.digitsAfterDecimal>3))return-1;return t.result*10**Math.max(0,3-t.digitsAfterDecimal)},L=[`unfair`,`wf`,`sf`],R=()=>({col:0,line:0,macroCol:0,macroLine:-1,lbl:``}),Ae=e=>e.macroLine<0?`line ${e.line}, column ${e.col}`:`line ${e.line}, column ${e.col} of macro called at line ${e.macroLine}, column ${e.macroCol}`,je=e=>{if(e.kind!==`LabeledStmt`)throw new t.c(`ClassCastException: ${e.kind}`);return e},Me=(e,n)=>{if(n<0||n>=e.length)throw new t.c(`ArrayIndexOutOfBoundsException: ${n}`);return e[n]},Ne=(e,t,n)=>({string:e,column:t,type:n}),Pe=e=>e.type===I.string?e.string.length+2:e.string.length,Fe=(e=[])=>({tokens:e,anchorTokens:void 0,anchorTokCol:void 0}),Ie=e=>{for(;e.tokens.length>0&&e.tokens[0].length===0;)e.tokens.shift();for(;e.tokens.length>0&&e.tokens[e.tokens.length-1].length===0;)e.tokens.pop();let t=Math.min(999999,...e.tokens.filter(e=>e.length>0).map(e=>e[0].column));e.tokens.forEach(e=>e.forEach(e=>{e.column-=t}));let n=[],r=[];e.tokens.forEach((t,i)=>{if(r.push(0),n.push(void 0),t.length===0)return;let a=t[0].column,o=e.tokens.slice(0,i).findLast(e=>e.length>0&&e[0].column<=a);if(o===void 0)return;let s=o.findIndex((e,t)=>t>0&&e.column>a),c=o[(s===-1?o.length:s)-1];n[i]=c,r[i]=c.column}),e.anchorTokens=n,e.anchorTokCol=r},Le=e=>{let t=Fe(e);return Ie(t),t},Re=e=>{let n=e.anchorTokens,r=e.anchorTokCol;if(n===void 0||r===void 0)throw new t.c(`NullPointerException: TLAExpr.renormalize`);e.tokens.forEach((e,i)=>{let a=n[i];if(a===void 0)return;let o=a.column-r[i];if(r[i]=a.column,o<0)throw new t.s(`TLAExpr.renormalize() found anchor has moved to left.`);e.forEach(e=>{e.column+=o})})},ze=e=>Le(e.tokens.map(e=>e.map(e=>({...e})))),Be=(e,t,n)=>{let r=t.tokens.length;e.tokens.splice(0,0,...t.tokens.slice(0,r-1));let i=t.tokens[r-1],a=e.tokens[r-1],o=i[i.length-1],s=o.column+Pe(o)+n;a.forEach(e=>{e.column+=s}),a.splice(0,0,...i);let c=[...t.anchorTokens??[]],l=[...t.anchorTokCol??[]];for(let t=r;t<e.tokens.length;t++)c.push(e.anchorTokens?.[t-r+1]),l.push(e.anchorTokCol?.[t-r+1]??0);e.anchorTokens=c,e.anchorTokCol=l,Re(e)},Ve=e=>e.tokens.length===1&&e.tokens[0].length===1,He=(e,t)=>Me(Me(e.tokens,t.line),t.item),Ue=(e,n,r)=>{if(e.tokens.length<=n.line)throw new t.o(`TLAExpr.StepCoord called with line too big`);if(e.tokens[n.line].length<=n.item)throw new t.o(`TLAExpr.StepCoord called with col too big`);let i={line:n.line,item:n.item};for(let t=0;t<r;t++)if(i.item+=1,e.tokens[i.line].length===i.item){for(i.item=0,i.line+=1;i.line<e.tokens.length&&e.tokens[i.line].length===0;)i.line+=1;if(i.line===e.tokens.length)return}return i},We=(e,t,n)=>{for(let r=e.tokens.length===0?void 0:{...n};r!==void 0;){let n=He(e,r),i=n.type===I.string;if(!i&&n.string===t)return r;let a=!i&&(n.string===`[`||n.string===`,`)?Ue(e,r,2):void 0,o=a===void 0?void 0:He(e,a),s=o!==void 0&&o.type!==I.string&&[`:`,`|->`,`↦`].includes(o.string),c=i?1:n.string===`.`?2:s?3:1;r=Ue(e,r,c)}},Ge=(e,t,n,r)=>{let i=He(e,n);if(Ve(e)){let n=ze(t);e.tokens=n.tokens,e.anchorTokens=n.anchorTokens,e.anchorTokCol=n.anchorTokCol;return}let a=e.tokens[n.line],o=n.item+1<a.length?a[n.item+1].column-(i.column+Pe(i)):0,s=a.splice(n.item+1),c={lineIndex:n.line,indent:+!!r+i.column,isInserting:!r},l=()=>e.tokens[c.lineIndex];if(Ve(t)){let e=t.tokens[0][0];i.string=e.string,i.type=e.type}else{r&&(i.string=`(`,i.type=I.builtin);let n=ze(t);if(n.tokens.forEach((t,r)=>{if(t.forEach(e=>{e.column+=c.indent,c.isInserting?(i.string=e.string,i.type=e.type,c.isInserting=!1):l().push(e)}),r+1>=n.tokens.length)return;c.indent=0,c.lineIndex+=1;let a=c.lineIndex;e.tokens.splice(a,0,[]);let o=e.anchorTokens??[],s=e.anchorTokCol??[];e.anchorTokens=e.tokens.map((e,t)=>t<a?o[t]:t===a?n.anchorTokens?.[r+1]:o[t-1]),e.anchorTokCol=e.tokens.map((e,t)=>t<a?s[t]:t===a?n.anchorTokCol?.[r+1]??0:s[t-1])}),r){let e=l()[l().length-1];l().push(Ne(`)`,e.column+Pe(e),I.builtin))}}let u=l(),d={line:c.lineIndex,item:u.length-1};if(s.length>0){let e=u[u.length-1],t=e.column+Pe(e)+o-s[0].column;s.forEach(e=>{e.column+=t,u.push(e)})}return Re(e),Ue(e,d,1)},Ke=(e,n,r,i=!0)=>{let a=r.map(t=>We(e,t,{line:0,item:0}));for(;;){let o=a.reduce((e,t,n)=>t!==void 0&&(e===void 0||t.line<e.position.line||t.line===e.position.line&&t.item<e.position.item)?{index:n,position:t}:e,void 0);if(o===void 0)return;let s=Ue(e,o.position,1),c=Ge(e,n[o.index],o.position,i);a[o.index]=c===void 0?void 0:We(e,r[o.index],c),a.forEach((e,n)=>{if(n!==o.index&&e!==void 0&&c!==void 0){if(s===void 0)throw new t.c(`NullPointerException: TLAExpr.substituteForAll`);e.line===o.position.line&&(e.item+=c.item-s.item),e.line+=c.line-s.line}})}},qe=(e,t,n)=>{let r=ze(e);return Ke(r,t,n),r},Je=(e,t,n)=>e.map(e=>qe(e,t,n)),Ye=(e,t)=>{let n=e=>t===`1.7.4`?``:`(col${e.column}) `,r=e.tokens.map(e=>e.map(e=>e.type===I.string?`"\\"", "${e.string}", "\\""`:e.string===`\\/`?`"${n(e)}\\\\/"`:e.string.startsWith(`\\`)?`"\\${e.string}"`:e.string===`/\\`?`"${n(e)}/\\\\"`:`"${e.string}"`)),i=r.findIndex(e=>e.length>0);return`<< ${r.map((e,t)=>{let n=i!==-1&&t>i;return e.map((e,t)=>n||t>0?`, ${e}`:e).join(``)}).join(`
|
|
18
18
|
`)} >>`},Xe=(e,t,n)=>{let r=e=>Ye(e,n),i=[0],a={value:0},o=e=>(i[a.value+1]=i[a.value]+e.length,a.value+=1,e),s=()=>(--a.value,``),c=()=>`\n${` `.repeat(i[a.value])}`,l=t<1500,u=e=>`${o(`<<`)}${e.map((e,t)=>`${t>0?`, ${c()}`:``}${`kind`in e?m(e):r(e)}`).join(``)}>>${s()}`,d=e=>`${o(`<<`)}${e.map(e=>`"${e}"`).join(`, `)}>>${s()}`,f=e=>`${o(`<< `)}${e.map((e,t)=>`${t>0?`, ${c()}`:``}${u(e)}`).join(``)} >>${s()}`,p=e=>e?`"="`:`"\\\\in"`,m=e=>{switch(e.kind){case`Uniprocess`:return`${o(``)}[type |-> "uniprocess", ${c()} name |-> "${e.name}", ${c()}${o(` decls |-> `)}${u(e.decls)},${s()}${c()}${o(` defs |-> `)}${r(e.defs)},${s()}${c()}${o(` prcds |-> `)}${u(e.prcds)},${s()}${c()}${o(` body |-> `)}${u(e.body)}]${s()}${s()}`;case`Multiprocess`:return`${o(``)}[type |-> "multiprocess", ${c()} name |-> "${e.name}", ${c()}${o(` decls |-> `)}${u(e.decls)},${s()}${c()}${o(` defs |-> `)}${r(e.defs)},${s()}${c()}${o(` prcds |-> `)}${u(e.prcds)},${s()}${c()}${o(` procs |-> `)}${u(e.procs)}]${s()}${s()}`;case`Procedure`:return l?`${o(``)}[name |-> "${e.name}", ${c()}${o(` params |-> `)}${u(e.params)},${s()}${c()}${o(` decls |-> `)}${u(e.decls)},${s()}${c()}${o(` body |-> `)}${u(e.body)}]${s()}${s()}`:`${o(``)}[name |-> "${e.name}", ${c()}minusLabels |-> ${d(e.minusLabels)}, plusLabels |->${d(e.plusLabels)}, proceduresCalled |->${d(e.proceduresCalled)},${c()}${o(` params |-> `)}${u(e.params)},${s()}${c()}${o(` decls |-> `)}${u(e.decls)},${s()}${c()}${o(` body |-> `)}${u(e.body)}]${s()}${s()}`;case`Process`:return l?`${o(``)}[name |-> "${e.name}", ${c()} eqOrIn |-> ${p(e.isEq)},${c()} id |-> ${r(e.id)},${c()}${o(` decls |-> `)}${u(e.decls)},${s()}${c()}${o(` body |-> `)}${u(e.body)}]${s()}${s()}`:`${o(``)}[name |-> "${e.name}",${c()} fairness |-> "${L[e.fairness]}", minusLabels |-> ${d(e.minusLabels)}, plusLabels |->${d(e.plusLabels)}, proceduresCalled |->${d(e.proceduresCalled)},${c()} eqOrIn |-> ${p(e.isEq)},${c()} id |-> ${r(e.id)},${c()}${o(` decls |-> `)}${u(e.decls)},${s()}${c()}${o(` body |-> `)}${u(e.body)}]${s()}${s()}`;case`VarDecl`:return`${o(``)}[var |-> "${e.var}", eqOrIn |-> ${p(e.isEq)}, val |-> ${r(e.val)}]${s()}`;case`PVarDecl`:return`${o(``)}[var |-> "${e.var}", eqOrIn |-> "=", val |-> ${r(e.val)}]${s()}`;case`LabeledStmt`:return`${o(``)}[label |-> "${e.label}",${c()}${o(` stmts |-> `)}${u(e.stmts)}]${s()}${s()}`;case`While`:return`${o(``)}[type |-> "while", ${c()} test |-> ${r(e.test)},${c()}${o(` labDo |-> `)}${u(e.labDo)},${s()}${c()}${o(` unlabDo |-> `)}${u(e.unlabDo)}]${s()}${s()}`;case`Assign`:return`${o(``)}[type |-> "assignment",${c()}${o(` ass |-> `)}${u(e.ass)}]${s()}${s()}`;case`SingleAssign`:return`${o(``)}[lhs |-> ${m(e.lhs)},${c()} rhs |-> ${r(e.rhs)}]${s()}`;case`Lhs`:return`[var |-> "${e.var}", sub |-> ${r(e.sub)}]`;case`If`:return`${o(``)}[type |-> "if", ${c()} test |-> ${r(e.test)},${c()}${o(` then |-> `)}${u(e.Then)},${s()}${c()}${o(` else |-> `)}${u(e.Else)}]${s()}${s()}`;case`Either`:return`${o(``)}[type |-> "either", ${c()}${o(` ors |-> `)}${f(e.ors)}]${s()}${s()}`;case`With`:return`${o(``)}[type |-> "with", ${c()} var |-> "${e.var}",${c()} eqOrIn |-> ${p(e.isEq)},${c()} exp |-> ${r(e.exp)},${c()}${o(` do |-> `)}${u(e.Do)}]${s()}${s()}`;case`When`:return`${o(``)}[type |-> "when", ${c()} exp |-> ${r(e.exp)}]${s()}`;case`PrintS`:return`${o(``)}[type |-> "print", ${c()} exp |-> ${r(e.exp)}]${s()}`;case`Assert`:return`${o(``)}[type |-> "assert", ${c()} exp |-> ${r(e.exp)}]${s()}`;case`Skip`:return`[type |-> "skip"]`;case`LabelIf`:return`${o(``)}[type |-> "labelIf",${c()} test |-> ${r(e.test)},${c()}${o(` unlabThen |-> `)}${u(e.unlabThen)},${s()}${c()}${o(` labThen |-> `)}${u(e.labThen)},${s()}${c()}${o(` unlabElse |-> `)}${u(e.unlabElse)},${s()}${c()}${o(` labElse |-> `)}${u(e.labElse)}]${s()}${c()}${s()}`;case`LabelEither`:return`${o(``)}[type |-> "labelEither",${c()}${o(` clauses |-> `)}${u(e.clauses)}]${s()}${c()}${s()}`;case`Clause`:return`${o(``)}${o(`[unlabOr |-> `)}${u(e.unlabOr)},${s()}${c()}${o(` labOr |-> `)}${u(e.labOr)}]${s()}${c()}${s()}`;case`Call`:return`${o(``)}[type |-> "call",${c()} returnTo |-> "${e.returnTo}",${c()} to |-> "${e.to}",${c()}${o(` args |-> `)}${u(e.args)}]${s()}${s()}`;case`Return`:return`[type |-> "return", from |-> "${e.from??`null`}"]`;case`CallReturn`:return`${o(``)}[type |-> "callReturn",${c()} from |-> "${e.from??`null`}",${c()} to |-> "${e.to}",${c()}${o(`args |-> `)}${u(e.args)}]${c()}${s()}${s()}`;case`CallGoto`:return`${o(``)}[type |-> "callGoto",${c()} after |-> "${e.after}",${c()} to |-> "${e.to}",${c()}${o(`args |-> `)}${u(e.args)}]${c()}${s()}${s()}`;case`Goto`:return`[type |-> "goto", to |-> "${e.to}"]`;case`Macro`:return`${o(``)}[name |-> "${e.name}", ${c()}${o(` params |-> `)}${o(`<<`)}${e.params.join(`, ${c()}`)}>>${s()},${s()}${c()}${o(` body |-> `)}${u(e.body)}]${s()}${s()}`;case`MacroCall`:return`${o(``)}[type |-> "macrocall",${c()} name |-> "${e.name}",${c()}${o(` args |-> `)}${u(e.args)}]${s()}${s()}`}};return m(e)},Ze=(e,t,n)=>({lines:e,currentLine:t<e.length?Array.from(e[t]):void 0,line:t,column:n,vcolumn:t<e.length?Array.from(e[t].slice(0,n)).length:0}),Qe=e=>{if(e.currentLine===void 0)return` `;if(e.currentLine.length===e.column)return e.line+=1,e.column=0,e.vcolumn=0,e.currentLine=e.line>=e.lines.length?void 0:Array.from(e.lines[e.line]),`
|
|
19
|
-
`;let t=e.currentLine[e.column];return e.column+=1,e.vcolumn+=1,t},$e=e=>{if(e.column>0)--e.column,--e.vcolumn;else{if(e.line===0)throw new t.
|
|
20
|
-
`)break}return $e(e),`${(e.currentLine??[]).slice(e.column).join(``)}\n`},tt=/* @__PURE__ */ new Set([`(`,`[`,`{`,`<<`,`⟨`]),nt=/* @__PURE__ */ new Set([`>>_`,`⟩_`,`]_`,`)`,`}`,`]`,`>>`,`⟩`]),rt=/* @__PURE__ */ new Set([...tt,...nt,...`_ ASSUME ASSUMPTION AXIOM BOOLEAN CASE CONSTANT CONSTANTS EXCEPT EXTENDS FALSE IF INSTANCE LOCAL MODULE OTHER STRING THEOREM TRUE VARIABLE VARIABLES WITH WF_ SF_`.split(` `),...`\\A ∀ \\forall \\E ∃ \\exists \\AA \\EE ~ ¬ \\lnot \\neg <> ◇ CHOOSE ENABLED UNCHANGED SUBSET UNION DOMAIN ' ^+ ⁺ ^* ^#`.split(` `),...`=> ⇒ \\cdot ⋅ <=> ⇔ \\equiv ≡ ~> ↝ -+-> ⇸ \\subseteq ⊆ \\subset ⊂ \\supset ⊃ \\supseteq ⊇ \\ll ≪ \\gg ≫ \\ \\cap \\intersect ∩ \\cup \\union ∪ /\\ ∧ \\/ ∨ \\land \\lor \\X × - + * / ^ | || ‖ & && ++ -- ** // ^^ |- ⊢ |= ⊨ -| ⊣ =| ⫤ <: :> := ≔ ::= ⩴`.split(` `),...`(+) ⊕ (-) ⊖ \\oplus \\ominus (.) ⊙ \\odot (/) ⊘ \\oslash (\\X) ⊗ \\otimes \\uplus ⊎ \\sqcap ⊓ \\sqcup ⊔ \\div ÷ \\star ⋆ \\o ∘ \\circ \\bigcirc ◯ \\bullet ●`.split(` `),...`\\in ∈ \\notin ∉ = # /= ≠ < > =< <= ≤ >= ≥ \\prec ≺ \\succ ≻ \\preceq ⪯ \\succeq ⪰ \\sim ∼ \\simeq ≃ \\approx ≈ \\doteq ≐ \\asymp ≍ \\sqsubset ⊏ \\sqsupset ⊐ \\sqsubseteq ⊑ \\sqsupseteq ⊒ \\propto ∝`.split(` `),...`: -> → |-> ↦ <- ← == ≜ ELSE THEN LET IN [] □ .. ‥ ... … $ $$ ? ?? ⁇ % %% ## @@ !! ‼ \\times \\leq \\geq \\mod \\wr ≀ ≅ ! ; , . -. @`.split(` `)]),it=e=>/^[A-Za-z_]$/.test(e),at=e=>/^[0-9]$/.test(e),ot=e=>e===` `||e===`\f`||e===`\r`,st=new Set([...rt].filter(e=>!it(e[0])&&!(e[0]===`\\`&&it(e[1]??``))).flatMap(e=>Array.from(e,(t,n)=>e.slice(0,e.length-n)))),ct=/* @__PURE__ */ new Set("abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ ~!@#$%^&*()_-+={}[]|:;<,>.?/`'0123456789"),lt=new Set(`; do then := ≔ begin variable variables || ‖ end else elsif if either or while with call return goto print assert skip procedure define process fair`.split(` `)),z={...I,dashes:6,endModule:7},ut=()=>({delimiter:``,delimiterLine:0,delimiterCol:0,commentDepth:0}),dt=(e,n,r,i)=>{let a={lines:[],line:[],token:``,state:`start`,column:n.vcolumn,nextColumn:n.vcolumn,nextChar:Qe(n),parenDepth:0,isInQuantifier:!1,isExprEnd:!1,previousToken:` `},o=()=>{a.nextColumn=n.vcolumn,a.nextChar=Qe(n)},s=()=>{a.token+=a.nextChar,o()},c=()=>{a.state=`start`,a.column=a.nextColumn},l=()=>{a.lines.push(a.line),a.line=[],a.column=0},u=e=>{throw new t.
|
|
19
|
+
`;let t=e.currentLine[e.column];return e.column+=1,e.vcolumn+=1,t},$e=e=>{if(e.column>0)--e.column,--e.vcolumn;else{if(e.line===0)throw new t.o(`PcalCharReader.backspace trying to move past beginning of reader`);--e.line,e.currentLine=Array.from(e.lines[e.line]),e.column=Math.max(e.currentLine.length-1,0),e.vcolumn=e.column}},et=e=>{for(;;){let t=Qe(e);if(t===` `)return` `;if(t!==` `&&t!==`
|
|
20
|
+
`)break}return $e(e),`${(e.currentLine??[]).slice(e.column).join(``)}\n`},tt=/* @__PURE__ */ new Set([`(`,`[`,`{`,`<<`,`⟨`]),nt=/* @__PURE__ */ new Set([`>>_`,`⟩_`,`]_`,`)`,`}`,`]`,`>>`,`⟩`]),rt=/* @__PURE__ */ new Set([...tt,...nt,...`_ ASSUME ASSUMPTION AXIOM BOOLEAN CASE CONSTANT CONSTANTS EXCEPT EXTENDS FALSE IF INSTANCE LOCAL MODULE OTHER STRING THEOREM TRUE VARIABLE VARIABLES WITH WF_ SF_`.split(` `),...`\\A ∀ \\forall \\E ∃ \\exists \\AA \\EE ~ ¬ \\lnot \\neg <> ◇ CHOOSE ENABLED UNCHANGED SUBSET UNION DOMAIN ' ^+ ⁺ ^* ^#`.split(` `),...`=> ⇒ \\cdot ⋅ <=> ⇔ \\equiv ≡ ~> ↝ -+-> ⇸ \\subseteq ⊆ \\subset ⊂ \\supset ⊃ \\supseteq ⊇ \\ll ≪ \\gg ≫ \\ \\cap \\intersect ∩ \\cup \\union ∪ /\\ ∧ \\/ ∨ \\land \\lor \\X × - + * / ^ | || ‖ & && ++ -- ** // ^^ |- ⊢ |= ⊨ -| ⊣ =| ⫤ <: :> := ≔ ::= ⩴`.split(` `),...`(+) ⊕ (-) ⊖ \\oplus \\ominus (.) ⊙ \\odot (/) ⊘ \\oslash (\\X) ⊗ \\otimes \\uplus ⊎ \\sqcap ⊓ \\sqcup ⊔ \\div ÷ \\star ⋆ \\o ∘ \\circ \\bigcirc ◯ \\bullet ●`.split(` `),...`\\in ∈ \\notin ∉ = # /= ≠ < > =< <= ≤ >= ≥ \\prec ≺ \\succ ≻ \\preceq ⪯ \\succeq ⪰ \\sim ∼ \\simeq ≃ \\approx ≈ \\doteq ≐ \\asymp ≍ \\sqsubset ⊏ \\sqsupset ⊐ \\sqsubseteq ⊑ \\sqsupseteq ⊒ \\propto ∝`.split(` `),...`: -> → |-> ↦ <- ← == ≜ ELSE THEN LET IN [] □ .. ‥ ... … $ $$ ? ?? ⁇ % %% ## @@ !! ‼ \\times \\leq \\geq \\mod \\wr ≀ ≅ ! ; , . -. @`.split(` `)]),it=e=>/^[A-Za-z_]$/.test(e),at=e=>/^[0-9]$/.test(e),ot=e=>e===` `||e===`\f`||e===`\r`,st=new Set([...rt].filter(e=>!it(e[0])&&!(e[0]===`\\`&&it(e[1]??``))).flatMap(e=>Array.from(e,(t,n)=>e.slice(0,e.length-n)))),ct=/* @__PURE__ */ new Set("abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ ~!@#$%^&*()_-+={}[]|:;<,>.?/`'0123456789"),lt=new Set(`; do then := ≔ begin variable variables || ‖ end else elsif if either or while with call return goto print assert skip procedure define process fair`.split(` `)),z={...I,dashes:6,endModule:7},ut=()=>({delimiter:``,delimiterLine:0,delimiterCol:0,commentDepth:0}),dt=(e,n,r,i)=>{let a={lines:[],line:[],token:``,state:`start`,column:n.vcolumn,nextColumn:n.vcolumn,nextChar:Qe(n),parenDepth:0,isInQuantifier:!1,isExprEnd:!1,previousToken:` `},o=()=>{a.nextColumn=n.vcolumn,a.nextChar=Qe(n)},s=()=>{a.token+=a.nextChar,o()},c=()=>{a.state=`start`,a.column=a.nextColumn},l=()=>{a.lines.push(a.line),a.line=[],a.column=0},u=e=>{throw new t.s(`${e} \`${a.token}' found at\n line ${n.line+1}, column ${a.column+1}`)},d=()=>{a.isExprEnd=!0,e.delimiter=a.token,e.delimiterCol=a.column,e.delimiterLine=n.line-+(a.nextChar===`
|
|
21
21
|
`)},f=e=>{if(!r){d(),a.token=``;return}e>z.ident&&u(`Illegal token in an expression`);let t=a.token;e!==z.string&&(lt.has(t)&&!(e===z.ident&&[`.`,`[`,`,`].includes(a.previousToken))||(t===`,`&&!a.isInQuantifier&&!i||t===`)`||t===`}`)&&a.parenDepth===0)?(a.parenDepth!==0&&u(`Expression with an unmatched (, [, {, or << followed by`),a.isInQuantifier&&u("Expression with \\A or \\E but no following `:` followed by"),d(),a.line.length>0&&l()):(e===z.builtin&&tt.has(t)&&(a.parenDepth+=1),e===z.builtin&&nt.has(t)&&(--a.parenDepth,a.parenDepth<0&&u(`Extra (unmatching)`)),a.previousToken=e===z.string?` `:t,[`\\A`,`∀`,`\\E`,`∃`].includes(t)&&a.parenDepth===0&&(a.isInQuantifier=!0),a.isInQuantifier&&t===`:`&&a.parenDepth===0&&(a.isInQuantifier=!1),(t!==``||e===z.string)&&a.line.push(Ne(t,a.column,e)),a.token=``)},p=e=>{f(e),c()},m=e=>{s(),a.state=e},h=e=>{o(),a.state=e},g=r=>{switch(a.state){case`start`:if(ot(r))return o(),c();if(it(r))return m(`id`);if(r===`ℕ`||r===`ℤ`||r===`ℝ`)return s(),p(z.ident);if(at(r))return m(`numOrId`);if(r===`\\`)return m(`bs`);if(r===`-`)return m(`dash1`);if(r===`=`)return m(`eq1`);if(r===`(`)return h(`leftParen`);if(r===`"`)return h(`string`);if(r===`
|
|
22
22
|
`)return o(),l(),c();if(st.has(r))return m(`builtIn`);if(r===` `){a.state=`done`;return}return s(),u(`Illegal lexeme`);case`id`:return a.token===`WF_`||a.token===`SF_`?p(z.builtin):it(r)||at(r)?s():p(rt.has(a.token)?z.builtin:z.ident);case`numOrId`:return at(r)?s():it(r)?m(`id`):p(z.number);case`bs`:if([`b`,`B`,`o`,`O`,`h`,`H`].includes(r))return m(`numOrBi`);if(it(r)){a.state=`bsBuiltIn`;return}if(r===`*`){o(),a.token=``,a.state=`lineComment`;return}a.state=`builtIn`;return;case`numOrBi`:a.state=at(r)?`num`:`bsBuiltIn`;return;case`num`:if(at(r))return s();if(!it(r))return p(z.number);s(),a.token.startsWith(`\\`)&&u(`Illegal lexeme`),a.state=`id`;return;case`bsBuiltIn`:return it(r)&&r!==`_`?s():rt.has(a.token)?p(z.builtin):u(`Illegal lexeme `);case`builtIn`:if(st.has(a.token+r))return s();if(!rt.has(a.token)){for($e(n);!rt.has(a.token);)$e(n),a.token.length===0&&u(`Illegal lexeme`),a.token=Array.from(a.token).slice(0,-1).join(``);o()}return p(z.builtin);case`dash1`:case`dash2`:if(r===`-`)return m(a.state===`dash1`?`dash2`:`dash3`);a.state=`builtIn`;return;case`dash3`:return r!==`-`&&u(`Illegal lexeme`),m(`dashes`);case`dashes`:return r===`-`?s():p(z.dashes);case`eq1`:case`eq2`:if(r===`=`)return m(a.state===`eq1`?`eq2`:`eq3`);a.state=`builtIn`;return;case`eq3`:return r!==`=`&&u(`Illegal lexeme`),m(`eqs`);case`eqs`:return r===`=`?s():p(z.endModule);case`leftParen`:if(r===`*`)return e.commentDepth=1,h(`comment`);a.token=`(`,a.state=`builtIn`;return;case`string`:if(r===`\\`)return m(`escString`);if(r===`"`)return o(),p(z.string);s(),ct.has(r)||u(`Illegal character in string`);return;case`escString`:s(),[`"`,`\\`,`t`,`n`,`f`,`r`].includes(r)||u(`Illegal character following \\ in string`),a.state=`string`;return;case`lineComment`:return r===`(`?h(`lineComParen`):r===`*`&&e.commentDepth>0?h(`lineComStar`):r===`
|
|
23
|
-
`||r===` `?(a.token=``,e.commentDepth=0,c()):e.commentDepth===0?s():o();case`lineComParen`:if(r===`*`)return e.commentDepth+=1,h(`lineComment`);e.commentDepth===0&&(a.token+=`(`),a.state=`lineComment`;return;case`lineComStar`:if(r===`)`){if(--e.commentDepth,e.commentDepth<0)throw new t.
|
|
24
|
-
`){a.token=``,o(),l(),a.state=`orComment`;return}if(r===` `)throw new t.
|
|
25
|
-
`&&$e(n),Le(a.lines)},ft=(e,t,n)=>dt(e,t,!0,n),pt=(e,t)=>(dt(e,t,!1,!1),e.delimiter),mt=(e,t)=>({params:e,tokenizer:ut(),lookahead:{tokens:Array.from({length:10},()=>``),columns:Array.from({length:10},()=>0),lines:Array.from({length:10},()=>0)},lastToken:{column:0,line:0,text:``},isInMacro:!1,log:t}),ht=()=>Le([[Ne(`defaultInitValue`,0,0)]]),gt=(e,t)=>[...e,...t.filter((n,r)=>!e.includes(n)&&t.indexOf(n)===r)],_t=(e,t)=>!t.some(t=>e.includes(t)),vt=(e,t)=>{t.splice(0,t.length,...e)},yt=(e,n,r)=>{let i=e.params,a=e.lookahead,o=e.lastToken,s={lookaheadSize:0,addedLabels:[],addedLabelsLocs:[],nextLabelNum:1,allLabels:/* @__PURE__ */ new Set,hasLabel:!1,hasDefaultInitialization:!1,currentProcedure:void 0,procedures:[],cSyntax:!1,plusLabels:[],minusLabels:[],proceduresCalled:[],gotoUsed:!1,gotoDoneUsed:!1,omitPC:i.inputVersionNumber>=1500},c=e=>{throw new t.
|
|
26
|
-
it has already peeked at`);for(;r>s.lookaheadSize;)a.tokens[s.lookaheadSize]=pt(e.tokenizer,n),s.lookaheadSize+=1;return et(n)},f=(r=!1)=>{if(s.lookaheadSize!==0)throw new t.a(`ParseAlgorithm: GetExpr called after lookahead`);let i=ft(e.tokenizer,n,r);return a.tokens[0]=e.tokenizer.delimiter,a.columns[0]=e.tokenizer.delimiterCol,a.lines[0]=e.tokenizer.delimiterLine,s.lookaheadSize=1,i},p=(e,n)=>{if(e===`;`){let e=u(1);if(`end begin else elsif or do macro procedure process fair define } {`.split(` `).includes(e))return;if(`if either while with call return goto print assert skip`.split(` `).includes(e))throw new t.o(`Missing \`;' before line ${a.lines[0]+1}, column ${a.columns[0]+1}`)}let r=l();r!==e&&r!==n&&c(`Expected "${e}" but found "${r}"`)},m=e=>{let t=l();t!==e&&c(`Expected "${e}" but found "${t}"`)},h=()=>{let e=l();return e===`=`?!0:e===`\\in`||e===`∈`?!1:c(`Expected "=" or "\\in" but found "${e}"`)},g=()=>p(u(1)===`,`?`,`:`;`),_=()=>p(s.cSyntax?`{`:`begin`),v=e=>{s.cSyntax?p(`}`):(p(`end`),p(e))},y=()=>{u(1)===`variables`?m(`variables`):p(`variable`)},b=()=>{let e={...R(),kind:`VarDecl`,var:l(),col:o.column,line:o.line,isEq:!0,val:ht()};if(![`=`,`\\in`,`∈`].includes(u(1)))return s.hasDefaultInitialization=!0,e;if(e.isEq=h(),e.val=f(),e.val.tokens.length===0)throw new t.s(`NullPointerException`);return e},x=()=>{y();let e=[],t=[`begin`,`{`,`procedure`,`process`,`fair`,`define`,`macro`];for(;!t.includes(u(1));)e.push(b()),g();return e},S=()=>{let e={...R(),kind:`PVarDecl`,var:l(),col:o.column,line:o.line,val:ht()};if(u(1)!==`=`)return s.hasDefaultInitialization=!0,e;if(p(`=`),e.val=f(),e.val.tokens.length===0)throw new t.s(`NullPointerException`);return e},C=()=>{y();let e=[];for(;u(1)!==`begin`&&u(1)!==`{`;)e.push(S()),g();return e},w=()=>{if(`while if assert print else elsif either or end with when await skip call return goto`.split(` `).includes(u(1)))return!1;let e=et(n);return e.length>0&&e[0]===`:`&&!(e.length>1&&e[1]===`=`)},T=()=>{if(!w())return``;let t=l();e.isInMacro&&c(`A label may not appear in a macro.`),t===`Done`&&c("Cannot use `Done' as a label."),t===`Error`&&c("Cannot use `Error' as a label."),p(`:`),s.hasLabel=!0,s.allLabels.add(t);let n=u(1);return n!==`+`&&n!==`-`||(p(n),(n===`+`?s.plusLabels:s.minusLabels).push(t),s.omitPC=!1),t},E=()=>{let e=[],t=e=>!s.cSyntax&&[`end`,`else`,`elsif`,`or`].includes(e)||s.cSyntax&&e===`}`;for(;!t(u(1));)e.push(...O());return s.cSyntax&&e.length===0&&c(`Empty statement list`),e},D=e=>{m(`{`);let n=E();if(p(`}`),p(`;`),e!==``){if(n[0].lbl!==``)throw new t.o(`Duplicate labeling of statement`,n[0]);n[0].lbl=e}return n},O=()=>{let e=T();if(s.cSyntax&&u(1)===`{`)return D(e);let t=ee();return t.lbl=e,[t]},ee=()=>{let e=u(1);if(e===`if`)return k(0);if(e===`either`)return A();if(e===`with`)return j(0);if(e===`when`||e===`await`){m(e);let n=o.column,r=o.line,i=f();if(i.tokens.length===0)throw new t.s(`NullPointerException`);return p(`;`),{...R(),kind:`When`,col:n,line:r,exp:i}}if(e===`print`||e===`assert`){m(e);let t=o.column,n=o.line,r=f();return r.tokens.length===0&&c(`Empty expression in ${e} statement at `),p(`;`),{...R(),kind:e===`print`?`PrintS`:`Assert`,col:t,line:n,exp:r}}if(e===`skip`){m(`skip`);let e={...R(),kind:`Skip`,col:o.column,line:o.line};return p(`;`),e}if(e===`call`)return N();if(e===`return`){m(`return`);let e={...R(),kind:`Return`,col:o.column,line:o.line,from:s.currentProcedure};return p(`;`),e}if(e===`goto`){m(`goto`);let e=o.column,t=o.line,n=l();return s.gotoUsed=!0,(n===`Done`||n===`"Done"`)&&(s.gotoDoneUsed=!0),p(`;`),{...R(),kind:`Goto`,col:e,line:t,to:n}}return e===`while`?te():d(1)[0]===`(`?ae():re()},te=()=>{m(`while`);let e=o.column,t=o.line;s.cSyntax&&p(`(`);let n=f();s.cSyntax&&p(`)`),n.tokens.length===0&&c(`Empty while test at `),s.cSyntax||p(`do`);let r=s.cSyntax?O():E();return s.cSyntax||(p(`end`),p(`while`),p(`;`)),r.length===0&&c(`Missing body of while statement at`),{...R(),kind:`While`,col:e,line:t,test:n,unlabDo:r,labDo:[]}},k=e=>{m(e===0?`if`:`elsif`);let t={...R(),kind:`LabelIf`,col:o.column,line:o.line,test:Fe(),unlabThen:[],labThen:[],unlabElse:[],labElse:[]};s.cSyntax&&p(`(`),t.test=f(),s.cSyntax&&p(`)`),t.test.tokens.length===0&&c(`Empty if test at `),s.cSyntax||p(`then`),t.unlabThen=s.cSyntax?O():E();let n=u(1);return n===`else`&&(m(`else`),t.unlabElse=s.cSyntax?O():E()),!s.cSyntax&&n===`elsif`&&(t.unlabElse=[k(e+1)]),!s.cSyntax&&![`else`,`elsif`,`end`].includes(n)&&c(`Expecting "else", "elsif", or "end"`),!s.cSyntax&&e===0&&(p(`end`),p(`if`),p(`;`)),t.unlabElse.length===0&&Me(t.unlabThen,t.unlabThen.length-1),t},A=()=>{m(`either`);let e={...R(),kind:`LabelEither`,col:o.column,line:o.line,clauses:[]};for(;;){let n={...R(),kind:`Clause`,unlabOr:s.cSyntax?O():E(),labOr:[]};if(n.unlabOr.length===0)throw new t.o("`either' statement with empty `or' clause",e);if(e.clauses.push(n),u(1)!==`or`)break;m(`or`)}if(s.cSyntax||(m(`end`),p(`either`),p(`;`)),e.clauses.length===1)throw new t.o("`either' statement has no `or'",e);return e},j=e=>{e===0&&(p(`with`),s.cSyntax&&p(`(`));let n={...R(),kind:`With`,col:o.column,line:o.line,var:l(),isEq:!0,exp:Fe(),Do:[]};n.isEq=h(),n.exp=f(),s.cSyntax&&u(1)===`)`||g(),n.exp.tokens.length===0&&c(`Empty with expression at `);let r=!s.cSyntax&&u(1)===`do`,i=s.cSyntax&&u(1)===`)`;if(r&&p(`do`),i&&m(`)`),n.Do=r?E():i?O():[j(e+1)],r&&(p(`end`),p(`with`),p(`;`)),n.Do.length===0)throw new t.o(`Missing body of with statement`,n);return n},ne=()=>{let e=a.columns[0]+1,t=a.lines[0]+1,n={...R(),kind:`Lhs`,col:e,line:t,var:l(),sub:f()};p(`:=`,`≔`);let r=f();return r.tokens.length===0&&c(`Empty right-hand side of assignment at `),{...R(),kind:`SingleAssign`,col:e,line:t,lhs:n,rhs:r}},re=()=>{let e={...R(),kind:`Assign`,col:a.columns[0]+1,line:a.lines[0]+1,ass:[ne()]};for(;u(1)===`||`||u(1)===`‖`;){l();try{e.ass.push(ne())}catch(e){if(!(e instanceof t.o))throw e;c(`Bad assignment statement at `)}}return p(`;`),e},M=()=>{let e=[];if(d(0)[0]!==`)`)for(;;){let t=f();if(e.push(t),t.tokens.length===0&&c(`Empty argument in call statement at `),u(1)===`)`)break;p(`,`)}return p(`)`),p(`;`),e},ie=()=>{m(`call`);let e={...R(),kind:`Call`,col:o.column,line:o.line,returnTo:``,to:l(),args:[]};return p(`(`),e.args=M(),s.proceduresCalled.includes(e.to)||s.proceduresCalled.push(e.to),e},N=()=>{let e=ie();if(u(1)===`return`)return m(`return`),p(`;`),{...R(),kind:`CallReturn`,col:e.col,line:e.line,to:e.to,from:s.currentProcedure,args:e.args};if(u(1)!==`goto`)return e;m(`goto`);let t={...R(),kind:`CallGoto`,col:e.col,line:e.line,to:e.to,after:l(),args:e.args};return s.gotoUsed=!0,(t.to===`Done`||t.to===`"Done"`)&&(s.gotoDoneUsed=!0),p(`;`),t},ae=()=>{let e={...R(),kind:`MacroCall`,name:l(),col:o.column,line:o.line,args:[]};return m(`(`),e.args=M(),e},oe=t=>{e.isInMacro=!0,m(`macro`);let n={...R(),kind:`Macro`,col:o.column,line:o.line,name:l(),params:[],body:[]};for(p(`(`);u(1)!==`)`;)n.params.length>0&&p(`,`),n.params.push(l());return m(`)`),_(),n.body=E(),v(`macro`),u(1)===`;`&&l(),_e(n.body,t),e.isInMacro=!1,n},se=()=>{p(`procedure`);let e={...R(),kind:`Procedure`,col:o.column,line:o.line,name:l(),minusLabels:[],plusLabels:[],proceduresCalled:[],params:[],decls:[],body:[]};for(s.currentProcedure=e.name,s.plusLabels=[],s.minusLabels=[],s.proceduresCalled=[],p(`(`);u(1)!==`)`;)e.params.length>0&&p(`,`),e.params.push(S());return m(`)`),u(1)!==`begin`&&u(1)!==`{`&&(e.decls=C()),_(),e.body=E(),v(`procedure`),u(1)===`;`&&l(),s.currentProcedure=void 0,e.plusLabels=s.plusLabels,e.minusLabels=s.minusLabels,e.proceduresCalled=s.proceduresCalled,e},ce=()=>{p(`process`);let e=o.column,t=o.line;s.cSyntax&&p(`(`);let n=l(),r=h(),i=f();s.plusLabels=[],s.minusLabels=[],s.proceduresCalled=[],s.cSyntax&&p(`)`),i.tokens.length===0&&c(`Empty process id at `);let a=u(1)===`begin`||u(1)===`{`?[]:x();_();let d=E();return v(`process`),u(1)===`;`&&l(),{...R(),kind:`Process`,col:e,line:t,name:n,fairness:0,minusLabels:s.minusLabels,plusLabels:s.plusLabels,proceduresCalled:s.proceduresCalled,isEq:r,id:i,decls:a,body:d}},le=()=>{let e=`${i.labelRoot}${s.nextLabelNum}`;return s.nextLabelNum+=1,s.allLabels.has(e)?le():e},ue=e=>{e.lbl===``&&(e.lbl=le(),s.addedLabels.push(e.lbl),s.addedLabelsLocs.push(Ae(e)))},de=(e,n,r,i,a)=>{vt(i,a);let o={isNextLabeled:n,hasLabel:!1},c=e=>{ue(e),o.hasLabel=!0,a.length=0};return e.forEach(e=>{if(e.lbl!==``&&(o.hasLabel=!0,a.length=0,r))throw new t.o("Label in `with' statement",e);if(o.isNextLabeled){if(r)throw new t.o("Statement follows `call' or `return' inside a `with' statement.",e);c(e),o.isNextLabeled=!1}switch(e.kind){case`LabelIf`:{let t=[],n=[],i=de(e.unlabThen,!1,r,a,t);o.isNextLabeled=de(e.unlabElse,!1,r,a,n)||i,vt(gt(t,n),a);return}case`LabelEither`:{let t=[];e.clauses.forEach(e=>{let n=[];o.isNextLabeled=de(e.unlabOr,!1,r,a,n)||o.isNextLabeled,vt(gt(n,t),t)}),vt(t,a);return}case`While`:if(r)throw new t.o("`while' inside a `with' statement",e);c(e),de(e.unlabDo,!1,!1,a,[]),o.isNextLabeled=!1;return;case`With`:{let t=[];o.isNextLabeled=de(e.Do,!1,!0,r?[...i]:[],t),vt(t,a),!r&&!_t(i,a)&&c(e);return}}let n=e.kind===`Call`||e.kind===`CallGoto`,l=e.kind===`Return`||e.kind===`CallReturn`,u=e.kind===`Assign`?gt([],e.ass.map(e=>e.lhs.var)):n||l?[`stack`,...l||e.to===s.currentProcedure?s.procedures.flatMap(e=>[...e.params,...e.decls].map(e=>e.var)):[]]:[];if(o.isNextLabeled=n||l||e.kind===`Goto`,_t(a,u))vt(gt(a,u),a);else{if(r)throw new t.o(e.kind===`Assign`?"Second assignment to same variable inside a `with' statement":"Call or return makes second assignment to a variable inside a `with' statement",e);c(e),vt(u,a)}}),o.hasLabel||o.isNextLabeled},fe=e=>{let t=e=>{let t=e.findIndex(e=>e.lbl!==``),n=t===-1?e:e.slice(0,t);return fe(n),{unlabeled:n,labeled:pe(t===-1?[]:e.slice(t))}};e.forEach(e=>{switch(e.kind){case`LabelIf`:{let n=t(e.unlabThen);e.unlabThen=n.unlabeled,e.labThen=n.labeled;let r=t(e.unlabElse);e.unlabElse=r.unlabeled,e.labElse=r.labeled;return}case`LabelEither`:e.clauses.forEach(e=>{let n=t(e.unlabOr);e.unlabOr=n.unlabeled,e.labOr=n.labeled});return;case`While`:{let n=t(e.unlabDo);e.unlabDo=n.unlabeled,e.labDo=n.labeled}}})},pe=e=>{let n=[];return e.forEach(e=>{if(e.lbl===``&&n.length>0)n[n.length-1].stmts.push(e);else{if(e.lbl===``)throw new t.a(`Failure of assertion: Missing Label in MakeLabeledStmtSeq`);n.push({...R(),kind:`LabeledStmt`,col:e.col,line:e.line,macroCol:e.macroCol,macroLine:e.macroLine,label:e.lbl,stmts:[e]})}}),n.forEach(e=>fe(e.stmts)),n},me=(e,n)=>{let r=e[n];switch(r.kind){case`LabelIf`:{let t=P(r.unlabThen);r.labThen.forEach(e=>P(e.stmts));let i=P(r.unlabElse);return r.labElse.forEach(e=>P(e.stmts)),r.labThen.length>0||r.labElse.length>0||t===2||i===2?2:(e[n]={...R(),kind:`If`,test:r.test,Then:r.unlabThen,Else:r.unlabElse},+(t+i>0))}case`LabelEither`:{let t=r.clauses.reduce((e,t)=>{let n=Math.max(e,P(t.unlabOr));return t.labOr.forEach(e=>P(e.stmts)),t.labOr.length>0?2:n},0);return t===2?2:(e[n]={...R(),kind:`Either`,ors:r.clauses.map(e=>e.unlabOr)},t)}case`With`:{let e=P(r.Do);if(e===2)throw new t.o(`with statement at ${Ae(r)} contains a labeled statement`);return e}case`While`:if(n!==0)throw new t.a("ParseAlgorithm.ClassifyStmtSeq encountered `while' not at beginning of StmtSeq.");return P(r.unlabDo),r.labDo.forEach(e=>P(e.stmts)),0;case`Call`:return e[n+1]?.kind===`Return`?0:1;case`Return`:case`CallReturn`:if(s.currentProcedure===void 0)throw new t.o(`return statement not in a procedure at ${Ae(r)}`);return 1;case`Goto`:case`CallGoto`:return 1;case`Assign`:case`When`:case`PrintS`:case`Assert`:case`Skip`:case`MacroCall`:return 0;default:throw new t.a(`ParseAlgorithm.ClassifyStmtSeq encountered the unexpected statement type ${r.kind}`)}},P=e=>{for(let n=0;n<e.length;n++){let r=me(e,n);if(r!==0){if(n===e.length-1)return r;throw new t.a(`Translator discovered later than it should have that\n Statement at ${Ae(e[n+1])} must have a label`)}}return 0},F=e=>{de(e,!0,!1,[],[]);let t=pe(e);return t.forEach(e=>P(e.stmts)),t},he=(e,n,r,i,a)=>{let o=e=>qe(e,n,r),s=e=>e.map(e=>he(e,n,r,i,a)),c=e=>e.map(e=>({...R(),kind:`LabeledStmt`,label:e.label,stmts:e.stmts.map(e=>he(e,n,r,-1,0))})),l={...R(),col:e.col,line:e.line,macroCol:i>0?a:e.macroCol,macroLine:i>0?i:e.macroLine};switch(e.kind){case`Assign`:return{...l,kind:`Assign`,ass:e.ass.map(e=>ge(e,n,r,i,a))};case`If`:return{...l,kind:`If`,test:o(e.test),Then:s(e.Then),Else:s(e.Else)};case`Either`:return{...l,kind:`Either`,ors:e.ors.map(s)};case`With`:return{...l,kind:`With`,var:e.var,isEq:e.isEq,exp:o(e.exp),Do:s(e.Do)};case`When`:case`Assert`:case`PrintS`:return{...l,kind:e.kind,exp:o(e.exp)};case`Skip`:return{...l,kind:`Skip`,macroCol:i>0?a:0,macroLine:i>0?i:-1};case`While`:return{...l,kind:`While`,test:o(e.test),unlabDo:s(e.unlabDo),labDo:c(e.labDo)};case`LabelIf`:return{...l,kind:`LabelIf`,test:o(e.test),unlabThen:s(e.unlabThen),labThen:c(e.labThen),unlabElse:s(e.unlabElse),labElse:c(e.labElse)};case`LabelEither`:return{...l,kind:`LabelEither`,clauses:e.clauses.map(e=>({...R(),kind:`Clause`,labOr:c(e.labOr),unlabOr:s(e.unlabOr)}))};case`Call`:return{...l,kind:`Call`,to:e.to,returnTo:e.returnTo,args:Je(e.args,n,r)};case`Return`:return{...l,kind:`Return`,from:e.from};case`CallReturn`:return{...l,kind:`CallReturn`,to:e.to,from:e.from,args:Je(e.args,n,r)};case`CallGoto`:return{...l,kind:`CallGoto`,to:e.to,after:e.after,args:Je(e.args,n,r)};case`Goto`:return{...l,kind:`Goto`,to:e.to};default:throw new t.a(`Found unexpected statement type in macro at${Ae(e)}`)}},ge=(e,n,r,i,a)=>{let o=qe(e.rhs,n,r),s={...R(),kind:`Lhs`,var:e.lhs.var,sub:e.lhs.sub.tokens.length===0?e.lhs.sub:qe(e.lhs.sub,n,r)},c={...R(),kind:`SingleAssign`,col:e.col,line:e.line,macroCol:i>0?a:e.macroCol,macroLine:i>0?i:e.macroLine,lhs:s,rhs:o},l=r.indexOf(s.var);if(l===-1)return c;let u=n[l],d=He(u,{line:0,item:0});if(d.type!==I.ident)throw new t.o(`Macro expansion substitutes \`${d.string}' for assignment variable\n at ${Ae(c)}`);if(s.var=d.string,Ue(u,{line:0,item:0},1)===void 0)return c;let f=ze(u);return f.tokens[0].splice(0,1),Ie(f),s.sub.tokens.length===0?s.sub=f:Be(s.sub,f,0),c},_e=(e,t)=>{let n=e.flatMap(e=>{switch(e.kind){case`LabelIf`:return _e(e.unlabThen,t),_e(e.unlabElse,t),[e];case`LabelEither`:return e.clauses.forEach(e=>_e(e.unlabOr,t)),[e];case`With`:return _e(e.Do,t),[e];case`While`:return _e(e.unlabDo,t),[e];case`MacroCall`:return ve(e,t);default:return[e]}});e.splice(0,e.length,...n)},ve=(e,n)=>{let r=n.findLast(t=>t.name===e.name);if(r===void 0)throw new t.o(`Macro ${e.name} undefined,\n at ${Ae(e)}`);if(r.params.length!==e.args.length)throw new t.o(`Macro ${e.name} called with wrong number of arguments at \n ${Ae(e)}`);let i=r.body.map(t=>he(t,e.args,r.params,e.line,e.col));return i.length>0&&(i[0].lbl=e.lbl),i},ye=e=>{e.forEach((n,r)=>{if(e.slice(r+1).some(e=>e.name===n.name))throw new t.o(`Multiple definitions of macro name \`${n.name}'`)})},be=e=>{if(e.length===0)return;let t=()=>{s.omitPC=!1},n=e[0];if(e.length>1||n.kind!==`LabeledStmt`)return t();if(n.stmts.length===0)return;let r=n.stmts[0];if(n.stmts.length>1||r.kind!==`While`||!Ve(r.test)||r.test.tokens[0][0].string!==`TRUE`)return t();r.labDo.length>0&&(s.omitPC=!1),r.unlabDo.some(e=>[`LabelIf`,`LabelEither`,`LabeledStmt`].includes(e.kind))&&(s.omitPC=!1)},xe=()=>{let e=s.addedLabels.length>1?`Missing labels at the following locations:`:`Missing label at the following location:`;throw new t.o([e,...s.addedLabelsLocs].join(`
|
|
27
|
-
`))},Se=e=>s.procedures.forEach(t=>{s.currentProcedure=t.name,_e(t.body,e),t.body=F(t.body)}),Ce=()=>{r&&l()!==`algorithm`&&c("`--fair' not followed by `algorithm'");let t=l();s.cSyntax=u(1)===`{`,s.cSyntax&&m(`{`);let n=u(1)===`variable`||u(1)===`variables`?x():[],a={value:Fe()};u(1)===`define`&&(m(`define`),s.cSyntax&&p(`{`),a.value=f(!0),v(`define`),p(`;`));let o=[];for(;u(1)===`macro`;)o.push(oe(o));for(;u(1)===`procedure`;)s.procedures.push(se()),s.omitPC=!1;if(u(1)===`fair`&&(u(2)===`process`||u(2)===`+`&&u(3)===`process`)||u(1)===`process`){let r=[];for(;u(1)===`fair`||u(1)===`process`;){let e=u(1)===`fair`;e&&m(`fair`);let t=e&&u(1)===`+`;t&&m(`+`);let n=t||!e&&i.fairnessOption===`sf`?2:e||i.fairnessOption===`wf`?1:0;r.push({...ce(),fairness:n})}return v(`algorithm`),ye(o),r.forEach(e=>{_e(e.body,o),e.body=F(e.body),be(e.body)}),Se(o),s.addedLabels.length>0&&(i.labelFlag||xe(),e.log(`Labels added.`)),(s.gotoDoneUsed||s.gotoUsed)&&(s.omitPC=!1),{...R(),kind:`Multiprocess`,name:t,decls:n,defs:a.value,macros:o,prcds:s.procedures,procs:r}}i.inputVersionNumber===1500&&u(1)===`fair`&&(p(`fair`),u(1)===`+`&&p(`+`),i.fairnessOption=`wf`),r&&([``,`wf`,`wfNext`].includes(i.fairnessOption)||e.log(`Warning: Option \`${i.fairnessOption}' specified for --fair algorithm.`),i.fairnessOption=`wf`),_();let d=E();ye(o),_e(d,o),Se(o),s.cSyntax&&p(`}`),v(`algorithm`);let h=F(d);return s.addedLabels.length>0&&(s.hasLabel&&!i.labelFlag&&xe(),e.log(`Labels added.`)),(s.gotoUsed||s.gotoDoneUsed)&&(s.omitPC=!1),be(h),{...R(),kind:`Uniprocess`,name:t,decls:n,defs:a.value,macros:o,prcds:s.procedures,body:h}};try{return{ast:Ce(),omitPC:s.omitPC,hasDefaultInitialization:s.hasDefaultInitialization}}catch(e){if(!(e instanceof t.s))throw e;return c(`Unknown error at or before`)}},B={global:0,label:1,procedure:2,process:3,processVar:4,procedureVar:5,parameter:6},bt=[`Global variable`,`Label`,`Procedure`,`Process`,`Process variable`,`Procedure variable`,`Parameter`],xt=/* @__PURE__ */ new Set([B.global,B.processVar,B.procedureVar,B.parameter]),St=(e,t,n,r)=>e.symbols.find(e=>e.id===n&&e.context===r&&e.type===t),Ct=(e,t,n)=>e.symbols.find(e=>e.id===t&&e.context===n),wt=(e,t)=>{let n=e.procedures.findIndex(e=>e.name===t);return n===-1?e.procedures.length:n},Tt=(e,t,n,r)=>!(t===B.procedureVar||t===B.processVar||t===B.parameter?St(e,B.global,n,``)!==void 0||Ct(e,n,r)!==void 0:St(e,t,n,r)!==void 0)&&(e.symbols.push({type:t,id:n,context:r,useThis:n}),!0),Et=(e,t,n,r)=>St(e,t,n,r)?.useThis??n,Dt=(e,t,n)=>{let r=Ct(e,t,n);return r===void 0?t:xt.has(r.type)?r.useThis:t},Ot=e=>{let n={symbols:[],procedures:[],processNames:[],errorReport:``},r=(e,t)=>{Tt(n,B.label,e.label,t)||(n.errorReport+=`\nLabel ${e.label} redefined at line ${e.line}, column ${e.col}`),e.stmts.forEach(e=>i(e,t))},i=(e,n)=>{let a=e=>e.forEach(e=>i(e,n)),o=e=>e.forEach(e=>r(e,n));switch(e.kind){case`While`:a(e.unlabDo),o(e.labDo);return;case`If`:a(e.Then),a(e.Else);return;case`With`:a(e.Do);return;case`LabelIf`:a(e.unlabThen),o(e.labThen),a(e.unlabElse),o(e.labElse);return;case`Either`:e.ors.forEach(a);return;case`LabelEither`:e.clauses.forEach(e=>{a(e.unlabOr),o(e.labOr)});return;case`Assign`:case`When`:case`PrintS`:case`Assert`:case`Skip`:case`Call`:case`Return`:case`CallReturn`:case`CallGoto`:case`Goto`:return;default:throw new t.a(`Unexpected AST type ${e.kind}`)}},a=(e,t,r=t===``?B.global:B.processVar)=>{Tt(n,r,e.var,t)||(n.errorReport+=`\n${bt[r]} ${e.var} redefined at line ${e.line}, column ${e.col}`)};if(Tt(n,B.global,`pc`,``),e.prcds.length>0&&Tt(n,B.global,`stack`,``),e.decls.forEach(e=>a(e,``)),e.prcds.forEach(e=>{let t=wt(n,e.name)<n.procedures.length;t&&(n.errorReport+=`\nProcedure ${e.name} redefined at line ${e.line}, column ${e.col}`),t||n.procedures.push({name:e.name,params:e.params,decls:e.decls,initialPC:e.body.length===0?void 0:je(e.body[0]).label}),Tt(n,B.procedure,e.name,``),e.decls.forEach(t=>a(t,e.name,B.procedureVar)),e.params.forEach(t=>a(t,e.name,B.parameter)),e.body.forEach(t=>r(je(t),e.name))}),e.kind===`Multiprocess`&&e.procs.forEach(e=>{let t=n.processNames.includes(e.name);t&&(n.errorReport+=`\nProcess ${e.name} redefined at line ${e.line}, column ${e.col}`),t||n.processNames.push(e.name),Tt(n,B.process,e.name,``),e.decls.forEach(t=>a(t,e.name)),e.body.forEach(t=>r(je(t),e.name))}),e.kind===`Uniprocess`&&e.body.forEach(e=>r(je(e),``)),n.errorReport.length>0)throw new t.o(n.errorReport);return n},kt=e=>{let t=t=>e.symbols.filter(e=>e.useThis===t).length>1,n={isAny:!1};for(let r=0;r<=7;r+=1)e.symbols.forEach(e=>{if(e.type===r){e.useThis=e.id;for(let n=1;r>0&&t(e.useThis);n+=1)e.useThis+=n===1?`_`:e.context[n-2]??String(r);e.id!==e.useThis&&(n.isAny=!0)}});return n.isAny},At=e=>{let n=e.symbols.filter(e=>e.id===`defaultInitValue`).map(e=>`${bt[e.type]} name`);if(n.length>0)throw new t.o(`Cannot use \`defaultInitValue' as ${n.join(` or `)}`)},jt=(e,n,r)=>{let i=(e,t)=>{let r=[],i=[];e.tokens.forEach(e=>e.forEach(e=>{if(e.type!==I.ident)return;let a=Dt(n,e.string,t);r.includes(e.string)||a===e.string||(r.push(e.string),i.push(Le([[Pt(a)]])))})),i.length>0&&Ke(e,i,r,!1)},a=(e,t)=>{e.var=Dt(n,e.var,t),i(e.val,t)},o=(e,t)=>e.forEach((r,i)=>{e[i]=Et(n,B.label,r,t)}),s=(e,t)=>e===void 0?void 0:Et(n,B.procedure,e,t),c=(e,t)=>{e.label=Et(n,B.label,e.label,t),e.stmts.forEach(e=>l(e,t))},l=(e,r)=>{let a=e=>e.forEach(e=>l(e,r)),o=e=>e.forEach(e=>c(e,r)),u=e=>e.forEach(e=>i(e,r));switch(e.kind){case`LabeledStmt`:c(e,r);return;case`While`:a(e.unlabDo),o(e.labDo),i(e.test,r);return;case`Assign`:e.ass.forEach(e=>{e.lhs.var=Dt(n,e.lhs.var,r),i(e.lhs.sub,r),i(e.rhs,r)});return;case`If`:a(e.Then),a(e.Else),i(e.test,r);return;case`With`:i(e.exp,r),a(e.Do);return;case`When`:case`PrintS`:case`Assert`:i(e.exp,r);return;case`Skip`:return;case`LabelIf`:i(e.test,r),a(e.unlabThen),o(e.labThen),a(e.unlabElse),o(e.labElse);return;case`Call`:e.returnTo=Et(n,B.procedure,e.returnTo,r),e.to=Et(n,B.procedure,e.to,r),u(e.args);return;case`Return`:e.from=s(e.from,r);return;case`CallReturn`:e.from=s(e.from,r),e.to=Et(n,B.procedure,e.to,r),u(e.args);return;case`CallGoto`:e.after=Et(n,B.procedure,e.after,r),e.to=Et(n,B.procedure,e.to,r),u(e.args);return;case`Goto`:if(St(n,B.label,e.to,r)===void 0&&e.to!==`Done`)throw new t.o(`goto to non-existent label \`${e.to}' at line ${e.line}, column ${e.col}`);e.to=Et(n,B.label,e.to,r);return;case`Either`:e.ors.forEach(a);return;case`LabelEither`:e.clauses.forEach(e=>{a(e.unlabOr),o(e.labOr)});return;default:throw new t.a(`Unexpected AST type${e.kind}`)}},u=e=>{e.decls.forEach(t=>a(t,e.name)),e.params.forEach(t=>a(t,e.name)),e.body.forEach(t=>c(je(t),e.name));let t=Me(n.procedures,wt(n,e.name));o(e.plusLabels,e.name),o(e.minusLabels,e.name),t.initialPC!==void 0&&(t.initialPC=Et(n,B.label,t.initialPC,e.name)),e.name=Et(n,B.procedure,e.name,``),t.name=e.name},d=e=>{e.decls.forEach(t=>a(t,e.name)),e.body.forEach(t=>c(je(t),e.name)),o(e.plusLabels,e.name),o(e.minusLabels,e.name),e.name=Et(n,B.process,e.name,``)};e.decls.forEach(e=>a(e,``)),e.kind===`Multiprocess`&&((e,t)=>{e.forEach(u);let n=e.map(e=>e.name),i=e.map(e=>n.map(t=>e.proceduresCalled.includes(t)));n.forEach((e,t)=>i.forEach(e=>e.forEach((n,r)=>{e[r]=n||e[t]&&i[t][r]}))),e.forEach((e,t)=>{e.proceduresCalled=n.filter((e,n)=>i[t][n])});for(let e of t){d(e);let t=e.proceduresCalled;for(let e=0;e<t.length;e+=1){let a=n.indexOf(t[e]);if(a===-1){r(`\nUnrecoverable error:\n -- Could not find procedure name \`${t[e]}'.\n`);return}n.forEach((e,n)=>{i[a][n]&&!t.includes(e)&&t.push(e)})}}})(e.prcds,e.procs),e.kind===`Uniprocess`&&(e.prcds.forEach(u),e.body.forEach(e=>c(je(e),``)))},Mt=e=>Ne(e,0,I.string),Nt=e=>Ne(e,0,I.added),V=e=>Ne(e,0,I.builtin),Pt=e=>Ne(e,0,I.ident),Ft=(e,t)=>{let n=[];return e.forEach(e=>{let r=n.at(-1),i=r===void 0?0:r.column+Pe(r)+t;n.push(Ne(e.string,i,e.type))}),Le([n])},It=e=>e.tokens.forEach((t,n)=>{let r={column:n===0||n===e.tokens.length-1?1:6};t.forEach(e=>{if(e.column=r.column,r.column+=Pe(e),e.type===I.builtin)switch(e.string){case`|->`:case`↦`:e.column=Math.max(16,e.column+1),r.column=e.column+5;return;case`[`:case`<<`:r.column+=1;return;case`]`:case`>>`:e.column+=1,r.column+=1;return;case`\\o`:e.column+=1,r.column+=2}})}),Lt=(e,t,n,r=0,i=0)=>({...R(),kind:`SingleAssign`,line:r,col:i,lhs:{...R(),kind:`Lhs`,var:e,sub:t},rhs:n}),Rt=(e,t=0,n=0)=>({...R(),kind:`Assign`,line:t,col:n,ass:e}),zt=(e,t,n=0,r=0)=>Rt([Lt(e,Le([]),t,n,r)],n,r),Bt=e=>{if(e.tokens.length>1)return!1;let t=Me(e.tokens,0);return t.length===1?t[0].string===`TRUE`:t.length===3&&t[0].string===`(`&&t[1].string===`TRUE`&&t[2].string===`)`},Vt=e=>({...R(),kind:`When`,exp:Ft([Nt(`pc`),V(`=`),Mt(e)],1)}),Ht=e=>zt(`pc`,Le([[Mt(e??`null`)]])),Ut=e=>[Pt(`Head`),V(`(`),Nt(`stack`),V(`)`),V(`.`),Pt(e)],Wt=()=>[Pt(`Tail`),V(`(`),Nt(`stack`),V(`)`)],Gt=e=>Le([Ut(e)]),Kt=(e,t,n,r)=>{let i=[[V(`<<`),V(`[`),Pt(`procedure`),V(`|->`),Mt(e),V(`,`)],[Pt(`pc`),V(`|->`),...t]];n.forEach(e=>{i[i.length-1].push(V(`,`)),i.push([Pt(e.var),V(`|->`),Pt(e.var)])}),i[i.length-1].push(V(`]`),V(`>>`)),i.push(r);let a=Fe(i);return It(a),Ie(a),a},qt=(e,n,r)=>{if(n.params.length!==r.args.length)throw new t.o(`Procedure ${r.to} called with wrong number of arguments`,r);return n.params.forEach((t,n)=>e.ass.push(Lt(t.var,Le([]),r.args[n],r.line,r.col))),[e,...n.decls.map(e=>zt(e.var,e.val,r.line,r.col)),Ht(n.initialPC)]},Jt=(e,n,r)=>{let i={procedure:void 0},a=(e,r)=>{let i=wt(n,e.to);if(i===n.procedures.length)throw new t.o(`Call of non-existent procedure ${e.to}`,e);let a=n.procedures[i],o=Kt(e.to,[Mt(r)],[...a.decls,...a.params],[V(`\\o`),Nt(`stack`)]);return qt(zt(`stack`,o,e.line,e.col),a,e)},o=e=>{e.from??=i.procedure;let r=e.from;if(r===void 0)throw new t.o("`return' statement not in procedure",e);let a=wt(n,r);if(a>=n.procedures.length)throw new t.o(`Error in procedure (perhaps name used elsewhere)`,e);let o=n.procedures[a],s=(t,n)=>Rt([Lt(t,Fe(),n,e.line,e.col)],e.line,e.col);return[s(`pc`,Gt(`pc`)),...o.decls.map(e=>s(e.var,Gt(e.var))),...o.params.map(e=>s(e.var,Gt(e.var))),s(`stack`,Le([Wt()]))]},s=e=>{let r=e.from;if(r===void 0)throw new t.o(`\`return' statement following \`call' at ${Ae(e)} not in a procedure`);let i=Me(n.procedures,wt(n,r)),a=wt(n,e.to);if(a===n.procedures.length)throw new t.o(`Call of non-existent procedure ${e.to}`,e);let o=n.procedures[a],s=Rt([],e.line,e.col);if(r!==e.to){i.decls.forEach(t=>s.ass.push(Lt(t.var,Fe(),Gt(t.var),e.line,e.col)));let t=Kt(e.to,Ut(`pc`),[...o.decls,...o.params],[V(`\\o`),...Wt()]);s.ass.push(Lt(`stack`,Le([]),t,e.line,e.col))}return qt(s,o,e)},c=(e,t)=>{if(e.length===0)return{stmts:[],labeledStmts:[],needsGoto:!r};let n={stmts:e,labeledStmts:[],needsGoto:!1},i=e[e.length-1];switch(i.kind){case`LabelIf`:case`LabelEither`:{let r=i.kind===`LabelIf`?p(i,t):m(i,t);e.pop(),e.push(r.stmt),n.labeledStmts=r.labeledStmts;break}case`Goto`:e.pop(),e.push(Ht(i.to));break;case`Call`:e.pop(),e.push(...a(i,t));break;case`Return`:e.pop(),e.push(...o(i));break;case`CallReturn`:e.pop(),e.push(...s(i));break;case`CallGoto`:e.pop(),e.push(...a({...R(),kind:`Call`,returnTo:``,to:i.to,args:i.args,line:i.line,col:i.col},i.after));break;case`If`:{let e=c(i.Then,t),a=c(i.Else,t);n.labeledStmts.push(...e.labeledStmts,...a.labeledStmts),i.Then=e.stmts,i.Else=a.stmts,r||(n.needsGoto=e.needsGoto&&a.needsGoto,n.needsGoto||(e.needsGoto&&i.Then.push(Ht(t)),a.needsGoto&&i.Else.push(Ht(t))));break}case`Either`:{let e=i.ors.map((e,r)=>{let a=c(e,t);return i.ors[r]=a.stmts,n.labeledStmts.push(...a.labeledStmts),a});n.needsGoto=e.every(e=>e.needsGoto),!r&&!n.needsGoto&&e.forEach((e,n)=>{e.needsGoto&&i.ors[n].push(Ht(t))});break}case`With`:{let e=c(i.Do,t);i.Do=e.stmts,n.labeledStmts.push(...e.labeledStmts),n.needsGoto=e.needsGoto;break}default:n.needsGoto=!0}return r&&(n.needsGoto=!1),n},l=(e,t)=>{let n=c(e,t);return n.needsGoto&&n.stmts.push(Ht(t)),n},u=(e,t)=>{let n=e.stmts.at(0);if(n?.kind===`While`)return f(e,n,t);let i=l([...e.stmts],t),a=[];return r||(i.stmts.unshift(Vt(e.label)),a.push({...R(),kind:`LabeledStmt`,col:e.col,line:e.line,label:e.label,stmts:i.stmts})),a.push(...i.labeledStmts),a},d=(e,t)=>e.flatMap((n,r)=>u(n,r<e.length-1?e[r+1].label:t)),f=(e,t,n)=>{let i=t.labDo.length===0?e.label:t.labDo[0].label,a=l([...t.unlabDo],i),o=l(e.stmts.slice(1),n),s=Bt(t.test),c=s?a.stmts:[{...R(),kind:`If`,test:t.test,Then:a.stmts,Else:o.stmts}];return[{...R(),kind:`LabeledStmt`,col:e.col,line:e.line,label:e.label,stmts:[...r?[]:[Vt(e.label)],...c]},...d(t.labDo,e.label),...a.labeledStmts,...s?[]:o.labeledStmts]},p=(e,t)=>{let n=l(e.unlabThen,e.labThen.length===0?t:e.labThen[0].label),r=l(e.unlabElse,e.labElse.length===0?t:e.labElse[0].label),i=d(e.labThen,t);return i.push(...d(e.labElse,t)),i.push(...n.labeledStmts,...r.labeledStmts),{stmt:{...R(),kind:`If`,col:e.col,line:e.line,test:e.test,Then:n.stmts,Else:r.stmts},labeledStmts:i}},m=(e,t)=>{let n=[],r=[];return e.clauses.forEach(e=>{let i=l(e.unlabOr,e.labOr.length>0?e.labOr[0].label:t);n.push(i.stmts),r.push(...i.labeledStmts),r.push(...d(e.labOr,t))}),{stmt:{...R(),kind:`Either`,col:e.col,line:e.line,ors:n},labeledStmts:r}},h=(e,t)=>d(e.map(je),t),g=e=>{i.procedure=e.name;let t=h(e.body,Et(n,B.label,`Error`,``));return i.procedure=void 0,{...R(),kind:`Procedure`,col:e.col,line:e.line,name:e.name,minusLabels:[],plusLabels:[],proceduresCalled:[],params:e.params,decls:e.decls,body:t}},_=e=>({...R(),kind:`Process`,col:e.col,line:e.line,name:e.name,fairness:0,minusLabels:[],plusLabels:[],proceduresCalled:[],isEq:e.isEq,id:e.id,decls:e.decls,body:h(e.body,`Done`)}),v=e.prcds.map(g);return e.kind===`Uniprocess`?{...R(),kind:`Uniprocess`,col:e.col,line:e.line,name:e.name,decls:e.decls,defs:e.defs,macros:[],prcds:v,body:h(e.body,`Done`)}:{...R(),kind:`Multiprocess`,col:e.col,line:e.line,name:e.name,decls:e.decls,defs:e.defs,macros:[],prcds:v,procs:e.procs.map(_)}},Yt=(e,n)=>{let r=n?[]:[`pc`];if(r.push(...e.decls.map(e=>e.var)),e.prcds.length>0&&r.push(`stack`),e.prcds.forEach(e=>{r.push(...e.params.map(e=>e.var)),r.push(...e.decls.map(e=>e.var))}),e.kind===`Multiprocess`&&e.procs.forEach(e=>r.push(...e.decls.map(e=>e.var))),r.length===0)throw new t.o(`The algorithm has no variables.`);let i=(e,t)=>{let n=r.indexOf(t);return n===-1?0:(e[n]+=1,e[n])},a=(e,t)=>t.forEach((t,n)=>{e[n]=Math.max(e[n],t)}),o=e=>[...e].sort((e,t)=>e.lhs.var<t.lhs.var?-1:+(e.lhs.var>t.lhs.var)),s=(e,n)=>{let s=[...n];e.ass=o(e.ass),new Set(e.ass.map(e=>e.lhs.var)).forEach(n=>{let a=e.ass.filter(e=>e.lhs.var===n);if(!r.includes(n))throw new t.o(`Assignment to undeclared variable ${n}`,a[0]);let o=a.some(e=>e.lhs.sub.tokens.length===0);if(i(s,n)>1||a.length>1&&o)throw new t.o(`Multiple assignment to ${n}`,e)}),a(n,s)},c=(e,n)=>{switch(e.kind){case`Assign`:s(e,n);return;case`If`:{let t=[...n],r=[...n];e.Then.forEach(e=>c(e,t)),e.Else.forEach(e=>c(e,r)),a(n,t),a(n,r);return}case`Either`:{let t=[...n];e.ors.forEach(e=>{let r=[...n];e.forEach(e=>c(e,r)),a(t,r)}),a(n,t);return}case`With`:e.Do.forEach(e=>c(e,n));return;case`When`:case`PrintS`:case`Assert`:case`Skip`:return;default:throw new t.a(`Unexpected AST type ${e.kind}`)}},l=e=>e.forEach(e=>{let t=r.map(()=>0);je(e).stmts.forEach(e=>c(e,t))});e.prcds.forEach(e=>l(e.body)),(e.kind===`Uniprocess`?[e.body]:e.procs.map(e=>e.body)).forEach(l)},Xt=(e,t,n,r)=>{let i=Ot(e);kt(i)&&r(`Warning: symbols were renamed.`),jt(e,i,r),Yt(Jt(e,i,t),t),n&&At(i)},Zt=`[ \\t\\n\\x0B\\f\\r]`,Qt=RegExp(`\\\\\\* BEGIN TRANSLATION${Zt}+\\(${Zt}*([cC][hH]([eE][cC])?[kK][sS][uU][mM]\\([pP]([lL][uU][sS])?[cC][aA][lL]\\))${Zt}*(=${Zt}*"(?<pcal>[0-9A-Fa-f]*)"|\\\\in${Zt}*STRING)${Zt}*\\/\\\\${Zt}*([cC][hH]([eE][cC])?[kK][sS][uU][mM]\\([tT][lL][aA]\\+?\\))${Zt}*(=${Zt}*"(?<tla>[0-9A-Fa-f]*)"|\\\\in${Zt}*STRING)${Zt}*\\)`),$t=e=>process.getBuiltinModule(`node:zlib`).crc32(Buffer.from(e,`utf8`)).toString(16),en=(e,t)=>e.log(`\nUnrecoverable error:\n -- ${t}.\n`),tn=(e,t)=>en(e,t.node===void 0||t.node.line===0?t.message:`${t.message}\n at ${Ae(t.node)}`),nn=e=>e.map(e=>`${Array.from(e).reduce((e,t)=>t===` `?e+` `.repeat(8-e.length%8):e+t,``)} `),rn=(e,t,n,r)=>{for(let i=Math.max(t,0);i<e.length;i++){let t=e[i],a=t.indexOf(n);if(a===-1)continue;let o=a+n.length,s=t.slice(o).search(/[^ ]/);if(s!==-1&&o+s===t.indexOf(r))return i}return-1},an=(e,t)=>{for(;t.line<e.length;){let n=e[t.line];for(;t.column<n.length&&n[t.column]===` `;)t.column+=1;if(t.column<n.length)return n;t.line+=1,t.column=0}return``},on=(e,t,n)=>{let r=Array.from(e.slice(t)).findIndex(e=>n.includes(e));return r===-1?e.length:t+e.slice(t,t+r).length},sn=e=>/^[\p{L}\p{Nd}_]$/u.test(e),cn=(e,t,n)=>{for(;t.line<e.length;){let r=an(e,t);if(r.slice(t.column).startsWith(n)){let e=t.column+n.length;if(e>=r.length||!/^[\p{L}_]$/u.test(r[e]))return t.column=on(r,e,` `),!0}t.column=on(r,t.column,` `)}return!1},ln=(e,t)=>en(e,`Command-line error: ${t}`),un=(e,t)=>{let n=e.params,r={isFirst:!0,isExplicitNof:!1},i=t=>(r.isFirst&&=(n.fairnessOption=``,!1),n.fairnessOption===``?(n.fairnessOption=t,!0):(ln(e,`Can only have one of -wf, -sf, -wfNext, and -nof options`),!1));for(let a=0;a<t.length;a++){let o=t[a],s=t[a+1];switch(o){case`-spec`:case`spec`:case`-myspec`:case`myspec`:{let t=o.endsWith(`myspec`);if(n[t?`myspecOption`:`specOption`]=!0,n.specOption&&n.myspecOption){ln(e,`
|
|
28
|
-
Can have at most one of the options -spec, -myspec, -spec2, -myspec2, writeAST`);return}if(s===void 0){ln(e,`Specification name must follow \`-${t?`myspec`:`spec`}' option`);return}a+=1;continue}case`-termination`:case`termination`:n.checkTermination=!0;continue;case`-noold`:case`-nocfg`:case`-noDoneDisjunct`:case`noDoneDisjunct`:continue;case`-wf`:case`wf`:case`-sf`:case`sf`:case`-wfNext`:case`wfNext`:case`-nof`:case`nof`:if(!i(o.replace(/^-/,``)))return;o.endsWith(`nof`)&&(r.isExplicitNof=!0);continue;case`-label`:case`label`:n.labelFlag=!0;continue;case`-labelRoot`:case`labelRoot`:if(s===void 0){ln(e,"Label root must follow `-labelRoot' option");return}if(!/^[a-zA-Z][a-zA-Z0-9_]*$/.test(s)){ln(e,`Label root must be a valid PlusCal identifier (must start with a letter and contain only letters, numbers, and underscores)`);return}n.labelRoot=s,a+=1;continue;case`-version`:case`version`:{if(s===void 0){ln(e,"Version number must follow `-version' option");return}let t=ke(s);if(t<0||t>1903){en(e,t<0?`Illegal version ${s} specified.`:`Specified version ${s} later than current version 1.12`),ln(e,`Bad version number`);return}n.inputVersionNumber=t,a+=1;continue}case`-lineWidth`:if(!/^[+-]?\d+$/.test(s??``)||Number(s)<60){ln(e,"Integer value at least 60 must follow `-lineWidth' option");return}a+=1;continue;default:ln(e,`Unknown or illegal option in options statement: ${o}`);return}}n.checkTermination&&n.fairnessOption===``&&!r.isExplicitNof&&(n.fairnessOption=`wf`)},dn=(e,t,n)=>{if(an(t,n),n.column+=7,!an(t,n).slice(n.column).startsWith(`(`)){en(e,"`PlusCal options' not followed by '('");return}n.column+=1;let r=[];for(;;){let e=an(t,n);if(n.line>=t.length||e[n.column]===`)`)break;if(e[n.column]===`,`){n.column+=1;continue}let i=on(e,n.column,` ,)`);r.push(e.slice(n.column,i)),n.column=i}n.line>=t.length?en(e,`No closing ')' found in options statement`):un(e,r)},fn=(e,n,r)=>{let i={depth:0,isDone:!1,isInString:!1};for(let a=n;!i.isDone&&a<e.length;a++){let o=e[a],s=a===n?r:0,c=[o.slice(0,s)];i.isInString=!1;for(let e=s;!i.isDone&&e<o.length;e++){let t=o[e],n=o.slice(e,e+2);if(n===`(*`&&!i.isInString)i.depth+=1,c.push(` `),e+=1;else if(n===`*)`&&!i.isInString&&i.depth===0)c.push(n),i.isDone=!0;else if(n===`*)`&&!i.isInString)--i.depth,c.push(` `),e+=1;else if(i.depth>0)c.push(` `);else if(i.isInString&&t===`\\`&&n.length===2)c.push(n),e+=1;else{if(!i.isInString&&n===`\\*`){c.push(` `);break}t===`"`&&(i.isInString=!i.isInString),c.push(t)}}if(i.isInString)return new t.o(`Unterminated string in line ${a+1}`);e[a]=c.join(``)}},pn=(e,n)=>{let r=10*2**Math.max(0,Math.ceil(Math.log2(n/10)));throw new t.s(`java.lang.ArrayIndexOutOfBoundsException: Index ${e} out of bounds for length ${r}`)},mn=(e,n,r)=>{if(!n.some(e=>e.indexOf(`algorithm`)>0))return/* @__PURE__ */ new Set([`NO_PLUSCAL_EXISTS`]);let i=nn(n),a={line:0,column:0};for(;cn(i,a,`PlusCal`);){let t=an(i,a).slice(a.column),n=Array.from(t).findIndex(e=>!sn(e));if(t.startsWith(`options`)&&(n===-1?t.length:n)===7){dn(e,i,a);break}}let o={line:0,column:-1,isFound:!1,isFair:!1};for(;o.line<i.length;o.line++){let e=i[o.line];if(/^=+$/.test(e))break;let t=e.indexOf(`--algorithm`),n=e.indexOf(`--fair`);if(t!==-1){o.column=t+11,o.isFound=!0;break}if(n!==-1){o.column=n+6,o.isFound=!0,o.isFair=!0;break}}let s=/* @__PURE__ */ new Set,c=rn(i,0,`BEGIN`,`TRANSLATION`);c===-1&&s.add(`NO_TRANSLATION_EXISTS`);let l=rn(i,c+1,`END`,`TRANSLATION`);if(l===-1&&s.add(`NO_TRANSLATION_EXISTS`),c===-1&&l===-1)return s;if(!o.isFound)return s.add(`NO_PLUSCAL_EXISTS`),s;let u=fn(i,o.line,o.column);if(u!==void 0)return tn(e,u),/* @__PURE__ */ new Set([`ERROR_ENCOUNTERED`]);let d={ast:void 0};try{let t=yt(e,Ze(i,o.line,o.column),o.isFair);d.ast=t.ast,Xt(t.ast,t.omitPC,t.hasDefaultInitialization,e.log)}catch(n){if(!(n instanceof t.o))throw n;tn(e,n)}c===-1&&pn(-1,i.length);let f=Qt.exec(i[c]);if(f===null)return s.add(`NO_PCAL_CHECKSUMS_EXIST`),s;let p=f.groups?.pcal,m=o.isFair&&r!==`1.7.4`?`fair`:d.ast===void 0?void 0:Xe(d.ast,e.params.inputVersionNumber,r);p!==void 0&&(m===void 0||p!==$t(m))&&s.add(`PCAL_DIVERGENCE_EXISTS`);let h=f.groups?.tla;if(h!==void 0){if(l===-1)throw new t.s(`java.lang.IllegalArgumentException: fromIndex(${c+1}) > toIndex(-1)`);let e=n.slice(c+1,l).join(``);h!==$t(e)&&s.add(`TLA_DIVERGENCE_EXISTS`)}return s.size===0?/* @__PURE__ */ new Set([`NO_DIVERGENCE`]):s},hn=[[`STRING`,0,0,[],[]],[`FALSE`,0,0,[],[]],[`TRUE`,0,0,[],[]],[`BOOLEAN`,0,0,[],[]],[`=`,2,0,[2,2],[1,1]],[`/=`,2,0,[2,2],[1,1]],[`.`,2,0,void 0,void 0],[`'`,1,2,[1],[0]],[`\\lnot`,1,0,[3],[1]],[`\\neg`,1,0,void 0,void 0],[`\\land`,2,0,[3,3],[1,1]],[`\\lor`,2,0,[3,3],[1,1]],[`\\equiv`,2,0,[3,3],[1,1]],[`=>`,2,0,[3,3],[1,1]],[`SUBSET`,1,0,[2],[1]],[`UNION`,1,0,[2],[1]],[`DOMAIN`,1,0,[2],[1]],[`\\subseteq`,2,0,[2,2],[1,1]],[`\\in`,2,0,[2,2],[1,1]],[`\\notin`,2,0,[2,2],[1,1]],[`\\`,2,0,[2,2],[1,1]],[`\\intersect`,2,0,[2,2],[1,1]],[`\\union`,2,0,[2,2],[1,1]],[`\\times`,2,0,[2,2],[1,1]],[`~>`,2,3,[3,3],[0,0]],[`[]`,1,3,[3],[0]],[`<>`,1,3,[3],[0]],[`ENABLED`,1,1,[2],[0]],[`UNCHANGED`,1,2,[1],[0]],[`\\cdot`,2,2,[2,2],[0,0]],[`-+->`,2,3,[3,3],[0,0]],[`$AngleAct`,2,2,[2,1],[0,0]],[`$BoundedChoose`,-1,0,[2],[1]],[`$BoundedExists`,-1,0,[3],[1]],[`$BoundedForall`,-1,0,[3],[1]],[`$CartesianProd`,-1,0,[2],[1]],[`$Case`,-1,0,[3],[1]],[`$ConjList`,-1,0,[3],[1]],[`$DisjList`,-1,0,[3],[1]],[`$Except`,-1,0,[2],[1]],[`$FcnApply`,2,0,[2,2],[1,1]],[`$FcnConstructor`,-1,0,[3],[1]],[`$IfThenElse`,3,0,[3,3,3],[1,1,1]],[`$NonRecursiveFcnSpec`,1,0,[3],[1]],[`$Pair`,2,0,[3,3],[1,1]],[`$RcdConstructor`,-1,0,[3],[1]],[`$RcdSelect`,2,0,[2,0],[1,1]],[`$RecursiveFcnSpec`,1,0,[3],[1]],[`$Seq`,-1,0,[2],[1]],[`$SetEnumerate`,-1,0,[2],[1]],[`$SetOfAll`,-1,0,[2],[1]],[`$SetOfFcns`,-1,0,[2],[1]],[`$SetOfRcds`,-1,0,[2],[1]],[`$SF`,2,3,[1,2],[0,0]],[`$SquareAct`,2,2,[2,1],[0,0]],[`$SubsetOf`,1,0,[2],[1]],[`$TemporalExists`,1,3,[3],[0]],[`$TemporalForall`,1,3,[3],[0]],[`$TemporalWhile`,2,3,[3,3],[0,0]],[`$Tuple`,-1,0,[2],[1]],[`$UnboundedChoose`,1,0,[2],[1]],[`$UnboundedExists`,1,0,[3],[1]],[`$UnboundedForall`,1,0,[3],[1]],[`$WF`,2,3,[1,2],[0,0]],[`$Nop`,1,0,[3],[1]],[`$Qed`,0,0,[],[]],[`$Pfcase`,1,0,[3],[1]],[`$Have`,1,0,[3],[1]],[`$Take`,1,0,[3],[1]],[`$Pick`,1,0,[3],[1]],[`$Witness`,-1,0,[2],[1]],[`$Suffices`,1,0,[3],[1]]],gn={file:`--TLA+ BUILTINS--`,beginLine:0,beginColumn:0,endLine:0,endColumn:0},H=e=>({id:e,levelChecked:0,level:0,levelParams:/* @__PURE__ */ new Set,allParams:/* @__PURE__ */ new Set,nonLeibnizParams:/* @__PURE__ */ new Set,argLevelParams:/* @__PURE__ */ new Map,levelCorrect:!0,levelConstraints:/* @__PURE__ */ new Map,argLevelConstraints:/* @__PURE__ */ new Map}),_n=e=>hn.map(([t,n,r,i,a])=>{let o=e(),s=n<0?void 0:Array.from({length:n},(t,n)=>({...H(e()),kind:`FormalParam`,name:`Formal_${n}`,arity:0,location:void 0})),c=i!==void 0&&a!==void 0,l=a?.map(e=>e>0);return{...H(o),levelChecked:c?99:0,level:r,kind:`OpDef`,defKind:`BuiltIn`,name:t,arity:n,params:s,body:void 0,isLocal:!1,location:gn,module:void 0,source:void 0,preComments:[],isDefined:!0,inRecursive:!1,inRecursiveSection:!1,recursiveSection:-1,letInLevel:0,weights:n<0?(a??[]).slice(0,1):a??[],isLeibnizArg:c?l:void 0,isLeibniz:l?.every(Boolean)??!0,opLevelCond:void 0,maxLevels:n<0?(i??[]).slice(0,1):i??[],minMaxLevel:void 0,labels:/* @__PURE__ */ new Map,step:void 0}}),vn=(e,t)=>{let n=JSON.stringify(t);e.some(e=>JSON.stringify(e)===n)||e.push(t)},yn=e=>e===void 0?`Unknown location`:typeof e==`string`?`In module ${e}`:e.beginLine===0&&e.beginColumn===0&&e.endLine===0&&e.endColumn===0?`In module ${e.file}`:`line ${e.beginLine}, col ${e.beginColumn} to line ${e.endLine}, col ${e.endColumn} of module ${e.file}`,bn=e=>e?.kind===`OpAppl`&&e.isAbsent===!0,xn=e=>{let t=0;for(let n=0;n<e.length;n++)t=Math.imul(t,31)+e.charCodeAt(n)|0;return t},Sn=()=>({buckets:Array.from({length:11},()=>[]),count:0,threshold:8}),Cn=(e,t)=>(e&2147483647)%t,wn=e=>{let t=e.buckets.length*2+1,n=Array.from({length:t},()=>[]);for(let r=e.buckets.length-1;r>=0;r--)e.buckets[r].forEach(e=>n[Cn(e.hash,t)].unshift(e));e.buckets=n,e.threshold=Math.floor(t*.75)},Tn=(e,t,n=t)=>e.buckets[Cn(xn(n),e.buckets.length)].find(e=>e.key===t)?.value,En=(e,t,n,r=t)=>{let i=xn(r),a=e.buckets[Cn(i,e.buckets.length)].find(e=>e.key===t);a?a.value=n:(e.count>=e.threshold&&wn(e),e.buckets[Cn(i,e.buckets.length)].unshift({hash:i,key:t,value:n}),e.count++)},Dn=e=>e.buckets.toReversed().flatMap(e=>e.map(e=>e.value)),On=`\0module `,U=()=>({table:Sn(),symbols:[]}),kn=e=>e.kind===`Module`?On+e.name:e.name,An=(e,t)=>{En(e.table,kn(t),t,t.name),e.symbols.push(t)},jn=e=>e.kind===`ThmOrAssumpDef`?e.params.length:e.kind===`Module`?0:e.arity,Mn=(e,t)=>Tn(e.table,t),Nn=(e,t)=>Tn(e.table,On+t,t),Pn=e=>e.context.symbols.filter(e=>e.kind===`OpDef`&&e.defKind===`UserDefined`),Fn=(e,t)=>Dn(e.context.table).filter(e=>e.kind===`OpDecl`&&e.declKind===t).toReversed(),In=e=>e.context.symbols.filter(e=>e.kind===`ThmOrAssumpDef`),Ln=/* @__PURE__ */ new Map([[`$Qed`,`QED step`],[`$Pfcase`,`CASE`],[`$Have`,`HAVE`],[`$Take`,`TAKE`],[`$Pick`,`PICK`],[`$Witness`,`WITNESS`],[`$Suffices`,`SUFFICES`]]),Rn=e=>{let t=e.split(`!`);return t.some(e=>e.length===0)?[e]:t},zn=e=>{switch(e.kind){case`Identifier`:return Rn(e.name).map(e=>({op:`Name`,name:e,args:void 0}));case`Apply`:{let t=Rn(e.operator),n=e.argumentCounts??t.map((n,r)=>r===t.length-1?e.args.length:0),r={value:0};return t.map((t,i)=>{let a=e.args.slice(r.value,r.value+n[i]);return r.value+=n[i],{op:`Name`,name:t,args:a.length>0?a:void 0}})}case`Subexpression`:return e.selectors.map(e=>{switch(e.kind){case`Name`:return{op:`Name`,name:e.name,args:e.args.length>0?e.args:void 0};case`Operand`:return{op:e.operand,name:String(e.operand),args:void 0};case`Bound`:return{op:`Null`,name:`!(...)`,args:e.args};case`At`:return{op:`@`,name:`@`,args:void 0};case`Colon`:return{op:`:`,name:`:`,args:void 0}}})}},Bn=e=>{let t=e[e.length-1];return t.op!==`Name`||t.args===void 0},Vn=e=>typeof e.op==`number`?`argument selector ${e.name}`:e.name,Hn=(e,t)=>typeof e==`number`?e>0&&e<=t?e:-1:e===`<<`?t>0?1:-1:e===`>>`&&t===2?2:-1,Un=e=>e.kind===`OpDecl`||e.kind===`FormalParam`||e.kind===`OpDef`&&(e.defKind===`BuiltIn`||e.defKind===`NumberedProofStep`),Wn=e=>e.kind===`FormalParam`||e.kind===`OpDecl`||e.kind===`OpDef`||e.kind===`ThmOrAssumpDef`||e.kind===`Module`,Gn=e=>(e.bounded?.length??0)>0?(e.bounded??[]).flat():e.unbounded??[],Kn=(e,t)=>e===void 0?t:{...e,endLine:t.endLine,endColumn:t.endColumn},qn=e=>(t,n,r,i,a)=>{let o=[],s=[],c=[],l=e=>t[e].location??a,u={name:void 0,nameLocation:void 0,node:void 0,index:0,mode:`FindingOpName`,previousMode:void 0,letInContext:void 0,definitionArityFound:0,definitionArgs:[],isInSuffices:!1},d=e=>e.args??[];for(;u.index<t.length;){let f=t[u.index];if((f.op!==`Name`&&f.op!==`Null`||n!==0)&&f.args!==void 0)return e.addError(l(u.index),`Selector \`${f.name}' should not have argument(s).`);switch(u.mode){case`FindingOpName`:{let f,p,m=[];for(;f===void 0&&u.index<t.length;){let n=t[u.index];if(p=n.op===`Name`?u.name===void 0?e.resolveSynonym(n.name):`${u.name}!${e.resolveSynonym(n.name)}`:void 0,u.name===void 0&&n.op!==`Name`)return e.addError(l(u.index),`Need name or step number here, not \`${n.name}'.`);p!==void 0&&(f=u.letInContext===void 0?e.resolveSymbol(p):Mn(u.letInContext,p)),f===void 0&&(p!==void 0&&(u.name=p,u.nameLocation=Kn(u.nameLocation,l(u.index))),m.push(...d(n)),u.index++)}if(f===void 0&&e.version===`1.7.4`){let n=t.length-1;return e.addError(l(n),`Unknown operator: \`${Vn(t[n])}'.`)}if(f===void 0)return e.addError(u.nameLocation??a,`Unknown operator: \`${u.name}'.`);if(f.kind===`Module`)return e.addError(l(u.index),`Module name (${t[u.index].name}) not allowed here.`);if(u.node=f,u.nameLocation=Kn(u.nameLocation,l(u.index)),u.name=p,Un(f)&&t.length!==1)return e.addError(l(u.index),`Cannot take subexpression of \`${u.name}'.`);let h=jn(f);if(n===0){if(m.push(...d(t[u.index])),u.definitionArityFound+m.length!==h)return e.addError(t[u.index].argsLocation??a,`The operator ${u.name} requires ${h-u.definitionArityFound} arguments.`);m.forEach((t,n)=>u.definitionArgs.push(e.generateArgument(f,n+u.definitionArityFound,t,l(u.index))))}if(u.definitionArityFound=h,f.kind===`OpDef`&&f.defKind===`ModuleInstance`){if(u.index===t.length-1&&!(i||r))return e.addError(l(u.index),`Operator name ${u.name} is incomplete.`)}else{let n=f.kind===`OpDef`&&f.defKind===`UserDefined`||f.kind===`ThmOrAssumpDef`?f:void 0;if(f.kind===`OpDef`&&f.defKind===`UserDefined`&&!f.isDefined&&t.length!==1)return e.addError(l(u.index),`Subexpression of \`${u.name}' used inside the operator's definition.`);if(u.index!==t.length-1&&n!==void 0){s.push(...n.params??[]),u.name=void 0,u.nameLocation=void 0,u.mode=t[u.index+1].op===`Name`?`FollowingLabels`:`FindingSubExpr`,c.push(...u.definitionArgs),u.definitionArityFound=0,u.definitionArgs=[];let e=n.body;for(;e?.kind===`SubstIn`;)o.push(e),e=e.body;for(;e?.kind===`APSubstIn`;)o.push(e),e=e.body;u.mode===`FindingSubExpr`&&(u.node=e)}}u.previousMode=`FindingOpName`;break}case`FollowingLabels`:{let r=u.node,i=r?.kind===`OpDef`||r?.kind===`ThmOrAssumpDef`||r?.kind===`Label`?r.labels.get(f.name):void 0;if(i===void 0)return e.addError(l(u.index),`Cannot find label \`${f.name}'.`);if(u.node=i,e.isOutOfLabelScope(i))return e.addError(l(u.index),`Accessing subexpression labeled \`${f.name}' of ASSUME/PROVE clause within the scope of a declaration\n from outside that declaration's scope.`);if(n===0){if(i.params.length!==d(f).length)return e.addError(l(u.index),`Label \`${f.name}' used with wrong number of arguments.`);c.push(...d(f).map(e.generateExpression))}s.push(...i.params),u.index<t.length-1&&t[u.index+1].op!==`Name`&&(u.mode=`FindingSubExpr`),u.mode===`FindingSubExpr`&&(u.node=i.body),u.previousMode=`FollowingLabels`;break}case`FindingSubExpr`:{let n=u.node,r=()=>e.addError(l(u.index),`Nonexistent operand specified by \`${Vn(f)}'.`);if(f.op===`:`){if(!(u.previousMode!==`FindingSubExpr`&&(u.index===t.length-1&&u.previousMode===`FindingOpName`||u.index<t.length-1&&t[u.index+1].op===`Name`)))return e.addError(l(u.index),`\`!:' can be used only after a name and either at the end after an
|
|
23
|
+
`||r===` `?(a.token=``,e.commentDepth=0,c()):e.commentDepth===0?s():o();case`lineComParen`:if(r===`*`)return e.commentDepth+=1,h(`lineComment`);e.commentDepth===0&&(a.token+=`(`),a.state=`lineComment`;return;case`lineComStar`:if(r===`)`){if(--e.commentDepth,e.commentDepth<0)throw new t.o(`Failure of assertion: case LINE_COM_STAR`);return h(`lineComment`)}e.commentDepth===0&&(a.token+=`*`),a.state=`lineComment`;return;case`comment`:case`orComment`:{let n=a.state===`comment`;if(r===`*`)return h(n?`commentStar`:`orCommentStar`);if(r===`(`)return h(n?`commentParen`:`orCommentParen`);if(r===`
|
|
24
|
+
`){a.token=``,o(),l(),a.state=`orComment`;return}if(r===` `)throw new t.s(n?`Input ended in the middle of a comment`:`Input ended in the middle of a multi-line comment`);return e.commentDepth===1?s():o()}case`commentStar`:case`orCommentStar`:{let n=a.state===`commentStar`?`comment`:`orComment`;if(r!==`)`){e.commentDepth===1&&(a.token+=`*`),a.state=n;return}if(o(),--e.commentDepth,n===`orComment`&&e.commentDepth<0)throw new t.o(`Assertion failure`);if(e.commentDepth!==0){a.state=n;return}return a.token=``,c()}case`commentParen`:case`orCommentParen`:{let t=a.state===`commentParen`?`comment`:`orComment`;if(r===`*`)return e.commentDepth+=1,h(t);e.commentDepth===1&&(a.token+=`(`),a.state=t;return}}};for(;a.state!==`done`&&!a.isExprEnd;)g(a.nextChar);return a.nextChar!==`
|
|
25
|
+
`&&$e(n),Le(a.lines)},ft=(e,t,n)=>dt(e,t,!0,n),pt=(e,t)=>(dt(e,t,!1,!1),e.delimiter),mt=(e,t)=>({params:e,tokenizer:ut(),lookahead:{tokens:Array.from({length:10},()=>``),columns:Array.from({length:10},()=>0),lines:Array.from({length:10},()=>0)},lastToken:{column:0,line:0,text:``},isInMacro:!1,log:t}),ht=()=>Le([[Ne(`defaultInitValue`,0,0)]]),gt=(e,t)=>[...e,...t.filter((n,r)=>!e.includes(n)&&t.indexOf(n)===r)],_t=(e,t)=>!t.some(t=>e.includes(t)),vt=(e,t)=>{t.splice(0,t.length,...e)},yt=(e,n,r)=>{let i=e.params,a=e.lookahead,o=e.lastToken,s={lookaheadSize:0,addedLabels:[],addedLabelsLocs:[],nextLabelNum:1,allLabels:/* @__PURE__ */ new Set,hasLabel:!1,hasDefaultInitialization:!1,currentProcedure:void 0,procedures:[],cSyntax:!1,plusLabels:[],minusLabels:[],proceduresCalled:[],gotoUsed:!1,gotoDoneUsed:!1,omitPC:i.inputVersionNumber>=1500},c=e=>{throw new t.s(`${e}\n line ${o.line}, column ${o.column}`)},l=()=>{if(s.lookaheadSize===0)return et(n),o.column=n.vcolumn+1,o.line=n.line+1,o.text=pt(e.tokenizer,n),o.text;o.column=a.columns[0]+1,o.line=a.lines[0]+1;let t=a.tokens[0];for(let e=1;e<s.lookaheadSize;e++)a.tokens[e-1]=a.tokens[e],a.columns[e-1]=a.columns[e],a.lines[e-1]=a.lines[e];return--s.lookaheadSize,o.text=t,t},u=r=>{for(;s.lookaheadSize<r;){let r=s.lookaheadSize;if(et(n)===` `)throw new t.s(`Premature end of file, perhaps because of unclosed comment, near\n line ${a.lines[r]+1}, column ${a.columns[r]+1}`);a.columns[r]=n.vcolumn,a.lines[r]=n.line,a.tokens[r]=pt(e.tokenizer,n),s.lookaheadSize+=1}return a.tokens[r-1]},d=r=>{if(r<s.lookaheadSize)throw new t.o(`ParseAlgorithm.PeekPastAlgToken called to peek after a token
|
|
26
|
+
it has already peeked at`);for(;r>s.lookaheadSize;)a.tokens[s.lookaheadSize]=pt(e.tokenizer,n),s.lookaheadSize+=1;return et(n)},f=(r=!1)=>{if(s.lookaheadSize!==0)throw new t.o(`ParseAlgorithm: GetExpr called after lookahead`);let i=ft(e.tokenizer,n,r);return a.tokens[0]=e.tokenizer.delimiter,a.columns[0]=e.tokenizer.delimiterCol,a.lines[0]=e.tokenizer.delimiterLine,s.lookaheadSize=1,i},p=(e,n)=>{if(e===`;`){let e=u(1);if(`end begin else elsif or do macro procedure process fair define } {`.split(` `).includes(e))return;if(`if either while with call return goto print assert skip`.split(` `).includes(e))throw new t.s(`Missing \`;' before line ${a.lines[0]+1}, column ${a.columns[0]+1}`)}let r=l();r!==e&&r!==n&&c(`Expected "${e}" but found "${r}"`)},m=e=>{let t=l();t!==e&&c(`Expected "${e}" but found "${t}"`)},h=()=>{let e=l();return e===`=`?!0:e===`\\in`||e===`∈`?!1:c(`Expected "=" or "\\in" but found "${e}"`)},g=()=>p(u(1)===`,`?`,`:`;`),_=()=>p(s.cSyntax?`{`:`begin`),v=e=>{s.cSyntax?p(`}`):(p(`end`),p(e))},y=()=>{u(1)===`variables`?m(`variables`):p(`variable`)},b=()=>{let e={...R(),kind:`VarDecl`,var:l(),col:o.column,line:o.line,isEq:!0,val:ht()};if(![`=`,`\\in`,`∈`].includes(u(1)))return s.hasDefaultInitialization=!0,e;if(e.isEq=h(),e.val=f(),e.val.tokens.length===0)throw new t.c(`NullPointerException`);return e},x=()=>{y();let e=[],t=[`begin`,`{`,`procedure`,`process`,`fair`,`define`,`macro`];for(;!t.includes(u(1));)e.push(b()),g();return e},S=()=>{let e={...R(),kind:`PVarDecl`,var:l(),col:o.column,line:o.line,val:ht()};if(u(1)!==`=`)return s.hasDefaultInitialization=!0,e;if(p(`=`),e.val=f(),e.val.tokens.length===0)throw new t.c(`NullPointerException`);return e},C=()=>{y();let e=[];for(;u(1)!==`begin`&&u(1)!==`{`;)e.push(S()),g();return e},w=()=>{if(`while if assert print else elsif either or end with when await skip call return goto`.split(` `).includes(u(1)))return!1;let e=et(n);return e.length>0&&e[0]===`:`&&!(e.length>1&&e[1]===`=`)},T=()=>{if(!w())return``;let t=l();e.isInMacro&&c(`A label may not appear in a macro.`),t===`Done`&&c("Cannot use `Done' as a label."),t===`Error`&&c("Cannot use `Error' as a label."),p(`:`),s.hasLabel=!0,s.allLabels.add(t);let n=u(1);return n!==`+`&&n!==`-`||(p(n),(n===`+`?s.plusLabels:s.minusLabels).push(t),s.omitPC=!1),t},E=()=>{let e=[],t=e=>!s.cSyntax&&[`end`,`else`,`elsif`,`or`].includes(e)||s.cSyntax&&e===`}`;for(;!t(u(1));)e.push(...O());return s.cSyntax&&e.length===0&&c(`Empty statement list`),e},D=e=>{m(`{`);let n=E();if(p(`}`),p(`;`),e!==``){if(n[0].lbl!==``)throw new t.s(`Duplicate labeling of statement`,n[0]);n[0].lbl=e}return n},O=()=>{let e=T();if(s.cSyntax&&u(1)===`{`)return D(e);let t=ee();return t.lbl=e,[t]},ee=()=>{let e=u(1);if(e===`if`)return k(0);if(e===`either`)return A();if(e===`with`)return j(0);if(e===`when`||e===`await`){m(e);let n=o.column,r=o.line,i=f();if(i.tokens.length===0)throw new t.c(`NullPointerException`);return p(`;`),{...R(),kind:`When`,col:n,line:r,exp:i}}if(e===`print`||e===`assert`){m(e);let t=o.column,n=o.line,r=f();return r.tokens.length===0&&c(`Empty expression in ${e} statement at `),p(`;`),{...R(),kind:e===`print`?`PrintS`:`Assert`,col:t,line:n,exp:r}}if(e===`skip`){m(`skip`);let e={...R(),kind:`Skip`,col:o.column,line:o.line};return p(`;`),e}if(e===`call`)return N();if(e===`return`){m(`return`);let e={...R(),kind:`Return`,col:o.column,line:o.line,from:s.currentProcedure};return p(`;`),e}if(e===`goto`){m(`goto`);let e=o.column,t=o.line,n=l();return s.gotoUsed=!0,(n===`Done`||n===`"Done"`)&&(s.gotoDoneUsed=!0),p(`;`),{...R(),kind:`Goto`,col:e,line:t,to:n}}return e===`while`?te():d(1)[0]===`(`?ae():re()},te=()=>{m(`while`);let e=o.column,t=o.line;s.cSyntax&&p(`(`);let n=f();s.cSyntax&&p(`)`),n.tokens.length===0&&c(`Empty while test at `),s.cSyntax||p(`do`);let r=s.cSyntax?O():E();return s.cSyntax||(p(`end`),p(`while`),p(`;`)),r.length===0&&c(`Missing body of while statement at`),{...R(),kind:`While`,col:e,line:t,test:n,unlabDo:r,labDo:[]}},k=e=>{m(e===0?`if`:`elsif`);let t={...R(),kind:`LabelIf`,col:o.column,line:o.line,test:Fe(),unlabThen:[],labThen:[],unlabElse:[],labElse:[]};s.cSyntax&&p(`(`),t.test=f(),s.cSyntax&&p(`)`),t.test.tokens.length===0&&c(`Empty if test at `),s.cSyntax||p(`then`),t.unlabThen=s.cSyntax?O():E();let n=u(1);return n===`else`&&(m(`else`),t.unlabElse=s.cSyntax?O():E()),!s.cSyntax&&n===`elsif`&&(t.unlabElse=[k(e+1)]),!s.cSyntax&&![`else`,`elsif`,`end`].includes(n)&&c(`Expecting "else", "elsif", or "end"`),!s.cSyntax&&e===0&&(p(`end`),p(`if`),p(`;`)),t.unlabElse.length===0&&Me(t.unlabThen,t.unlabThen.length-1),t},A=()=>{m(`either`);let e={...R(),kind:`LabelEither`,col:o.column,line:o.line,clauses:[]};for(;;){let n={...R(),kind:`Clause`,unlabOr:s.cSyntax?O():E(),labOr:[]};if(n.unlabOr.length===0)throw new t.s("`either' statement with empty `or' clause",e);if(e.clauses.push(n),u(1)!==`or`)break;m(`or`)}if(s.cSyntax||(m(`end`),p(`either`),p(`;`)),e.clauses.length===1)throw new t.s("`either' statement has no `or'",e);return e},j=e=>{e===0&&(p(`with`),s.cSyntax&&p(`(`));let n={...R(),kind:`With`,col:o.column,line:o.line,var:l(),isEq:!0,exp:Fe(),Do:[]};n.isEq=h(),n.exp=f(),s.cSyntax&&u(1)===`)`||g(),n.exp.tokens.length===0&&c(`Empty with expression at `);let r=!s.cSyntax&&u(1)===`do`,i=s.cSyntax&&u(1)===`)`;if(r&&p(`do`),i&&m(`)`),n.Do=r?E():i?O():[j(e+1)],r&&(p(`end`),p(`with`),p(`;`)),n.Do.length===0)throw new t.s(`Missing body of with statement`,n);return n},ne=()=>{let e=a.columns[0]+1,t=a.lines[0]+1,n={...R(),kind:`Lhs`,col:e,line:t,var:l(),sub:f()};p(`:=`,`≔`);let r=f();return r.tokens.length===0&&c(`Empty right-hand side of assignment at `),{...R(),kind:`SingleAssign`,col:e,line:t,lhs:n,rhs:r}},re=()=>{let e={...R(),kind:`Assign`,col:a.columns[0]+1,line:a.lines[0]+1,ass:[ne()]};for(;u(1)===`||`||u(1)===`‖`;){l();try{e.ass.push(ne())}catch(e){if(!(e instanceof t.s))throw e;c(`Bad assignment statement at `)}}return p(`;`),e},M=()=>{let e=[];if(d(0)[0]!==`)`)for(;;){let t=f();if(e.push(t),t.tokens.length===0&&c(`Empty argument in call statement at `),u(1)===`)`)break;p(`,`)}return p(`)`),p(`;`),e},ie=()=>{m(`call`);let e={...R(),kind:`Call`,col:o.column,line:o.line,returnTo:``,to:l(),args:[]};return p(`(`),e.args=M(),s.proceduresCalled.includes(e.to)||s.proceduresCalled.push(e.to),e},N=()=>{let e=ie();if(u(1)===`return`)return m(`return`),p(`;`),{...R(),kind:`CallReturn`,col:e.col,line:e.line,to:e.to,from:s.currentProcedure,args:e.args};if(u(1)!==`goto`)return e;m(`goto`);let t={...R(),kind:`CallGoto`,col:e.col,line:e.line,to:e.to,after:l(),args:e.args};return s.gotoUsed=!0,(t.to===`Done`||t.to===`"Done"`)&&(s.gotoDoneUsed=!0),p(`;`),t},ae=()=>{let e={...R(),kind:`MacroCall`,name:l(),col:o.column,line:o.line,args:[]};return m(`(`),e.args=M(),e},oe=t=>{e.isInMacro=!0,m(`macro`);let n={...R(),kind:`Macro`,col:o.column,line:o.line,name:l(),params:[],body:[]};for(p(`(`);u(1)!==`)`;)n.params.length>0&&p(`,`),n.params.push(l());return m(`)`),_(),n.body=E(),v(`macro`),u(1)===`;`&&l(),_e(n.body,t),e.isInMacro=!1,n},se=()=>{p(`procedure`);let e={...R(),kind:`Procedure`,col:o.column,line:o.line,name:l(),minusLabels:[],plusLabels:[],proceduresCalled:[],params:[],decls:[],body:[]};for(s.currentProcedure=e.name,s.plusLabels=[],s.minusLabels=[],s.proceduresCalled=[],p(`(`);u(1)!==`)`;)e.params.length>0&&p(`,`),e.params.push(S());return m(`)`),u(1)!==`begin`&&u(1)!==`{`&&(e.decls=C()),_(),e.body=E(),v(`procedure`),u(1)===`;`&&l(),s.currentProcedure=void 0,e.plusLabels=s.plusLabels,e.minusLabels=s.minusLabels,e.proceduresCalled=s.proceduresCalled,e},ce=()=>{p(`process`);let e=o.column,t=o.line;s.cSyntax&&p(`(`);let n=l(),r=h(),i=f();s.plusLabels=[],s.minusLabels=[],s.proceduresCalled=[],s.cSyntax&&p(`)`),i.tokens.length===0&&c(`Empty process id at `);let a=u(1)===`begin`||u(1)===`{`?[]:x();_();let d=E();return v(`process`),u(1)===`;`&&l(),{...R(),kind:`Process`,col:e,line:t,name:n,fairness:0,minusLabels:s.minusLabels,plusLabels:s.plusLabels,proceduresCalled:s.proceduresCalled,isEq:r,id:i,decls:a,body:d}},le=()=>{let e=`${i.labelRoot}${s.nextLabelNum}`;return s.nextLabelNum+=1,s.allLabels.has(e)?le():e},ue=e=>{e.lbl===``&&(e.lbl=le(),s.addedLabels.push(e.lbl),s.addedLabelsLocs.push(Ae(e)))},de=(e,n,r,i,a)=>{vt(i,a);let o={isNextLabeled:n,hasLabel:!1},c=e=>{ue(e),o.hasLabel=!0,a.length=0};return e.forEach(e=>{if(e.lbl!==``&&(o.hasLabel=!0,a.length=0,r))throw new t.s("Label in `with' statement",e);if(o.isNextLabeled){if(r)throw new t.s("Statement follows `call' or `return' inside a `with' statement.",e);c(e),o.isNextLabeled=!1}switch(e.kind){case`LabelIf`:{let t=[],n=[],i=de(e.unlabThen,!1,r,a,t);o.isNextLabeled=de(e.unlabElse,!1,r,a,n)||i,vt(gt(t,n),a);return}case`LabelEither`:{let t=[];e.clauses.forEach(e=>{let n=[];o.isNextLabeled=de(e.unlabOr,!1,r,a,n)||o.isNextLabeled,vt(gt(n,t),t)}),vt(t,a);return}case`While`:if(r)throw new t.s("`while' inside a `with' statement",e);c(e),de(e.unlabDo,!1,!1,a,[]),o.isNextLabeled=!1;return;case`With`:{let t=[];o.isNextLabeled=de(e.Do,!1,!0,r?[...i]:[],t),vt(t,a),!r&&!_t(i,a)&&c(e);return}}let n=e.kind===`Call`||e.kind===`CallGoto`,l=e.kind===`Return`||e.kind===`CallReturn`,u=e.kind===`Assign`?gt([],e.ass.map(e=>e.lhs.var)):n||l?[`stack`,...l||e.to===s.currentProcedure?s.procedures.flatMap(e=>[...e.params,...e.decls].map(e=>e.var)):[]]:[];if(o.isNextLabeled=n||l||e.kind===`Goto`,_t(a,u))vt(gt(a,u),a);else{if(r)throw new t.s(e.kind===`Assign`?"Second assignment to same variable inside a `with' statement":"Call or return makes second assignment to a variable inside a `with' statement",e);c(e),vt(u,a)}}),o.hasLabel||o.isNextLabeled},fe=e=>{let t=e=>{let t=e.findIndex(e=>e.lbl!==``),n=t===-1?e:e.slice(0,t);return fe(n),{unlabeled:n,labeled:pe(t===-1?[]:e.slice(t))}};e.forEach(e=>{switch(e.kind){case`LabelIf`:{let n=t(e.unlabThen);e.unlabThen=n.unlabeled,e.labThen=n.labeled;let r=t(e.unlabElse);e.unlabElse=r.unlabeled,e.labElse=r.labeled;return}case`LabelEither`:e.clauses.forEach(e=>{let n=t(e.unlabOr);e.unlabOr=n.unlabeled,e.labOr=n.labeled});return;case`While`:{let n=t(e.unlabDo);e.unlabDo=n.unlabeled,e.labDo=n.labeled}}})},pe=e=>{let n=[];return e.forEach(e=>{if(e.lbl===``&&n.length>0)n[n.length-1].stmts.push(e);else{if(e.lbl===``)throw new t.o(`Failure of assertion: Missing Label in MakeLabeledStmtSeq`);n.push({...R(),kind:`LabeledStmt`,col:e.col,line:e.line,macroCol:e.macroCol,macroLine:e.macroLine,label:e.lbl,stmts:[e]})}}),n.forEach(e=>fe(e.stmts)),n},me=(e,n)=>{let r=e[n];switch(r.kind){case`LabelIf`:{let t=P(r.unlabThen);r.labThen.forEach(e=>P(e.stmts));let i=P(r.unlabElse);return r.labElse.forEach(e=>P(e.stmts)),r.labThen.length>0||r.labElse.length>0||t===2||i===2?2:(e[n]={...R(),kind:`If`,test:r.test,Then:r.unlabThen,Else:r.unlabElse},+(t+i>0))}case`LabelEither`:{let t=r.clauses.reduce((e,t)=>{let n=Math.max(e,P(t.unlabOr));return t.labOr.forEach(e=>P(e.stmts)),t.labOr.length>0?2:n},0);return t===2?2:(e[n]={...R(),kind:`Either`,ors:r.clauses.map(e=>e.unlabOr)},t)}case`With`:{let e=P(r.Do);if(e===2)throw new t.s(`with statement at ${Ae(r)} contains a labeled statement`);return e}case`While`:if(n!==0)throw new t.o("ParseAlgorithm.ClassifyStmtSeq encountered `while' not at beginning of StmtSeq.");return P(r.unlabDo),r.labDo.forEach(e=>P(e.stmts)),0;case`Call`:return e[n+1]?.kind===`Return`?0:1;case`Return`:case`CallReturn`:if(s.currentProcedure===void 0)throw new t.s(`return statement not in a procedure at ${Ae(r)}`);return 1;case`Goto`:case`CallGoto`:return 1;case`Assign`:case`When`:case`PrintS`:case`Assert`:case`Skip`:case`MacroCall`:return 0;default:throw new t.o(`ParseAlgorithm.ClassifyStmtSeq encountered the unexpected statement type ${r.kind}`)}},P=e=>{for(let n=0;n<e.length;n++){let r=me(e,n);if(r!==0){if(n===e.length-1)return r;throw new t.o(`Translator discovered later than it should have that\n Statement at ${Ae(e[n+1])} must have a label`)}}return 0},F=e=>{de(e,!0,!1,[],[]);let t=pe(e);return t.forEach(e=>P(e.stmts)),t},he=(e,n,r,i,a)=>{let o=e=>qe(e,n,r),s=e=>e.map(e=>he(e,n,r,i,a)),c=e=>e.map(e=>({...R(),kind:`LabeledStmt`,label:e.label,stmts:e.stmts.map(e=>he(e,n,r,-1,0))})),l={...R(),col:e.col,line:e.line,macroCol:i>0?a:e.macroCol,macroLine:i>0?i:e.macroLine};switch(e.kind){case`Assign`:return{...l,kind:`Assign`,ass:e.ass.map(e=>ge(e,n,r,i,a))};case`If`:return{...l,kind:`If`,test:o(e.test),Then:s(e.Then),Else:s(e.Else)};case`Either`:return{...l,kind:`Either`,ors:e.ors.map(s)};case`With`:return{...l,kind:`With`,var:e.var,isEq:e.isEq,exp:o(e.exp),Do:s(e.Do)};case`When`:case`Assert`:case`PrintS`:return{...l,kind:e.kind,exp:o(e.exp)};case`Skip`:return{...l,kind:`Skip`,macroCol:i>0?a:0,macroLine:i>0?i:-1};case`While`:return{...l,kind:`While`,test:o(e.test),unlabDo:s(e.unlabDo),labDo:c(e.labDo)};case`LabelIf`:return{...l,kind:`LabelIf`,test:o(e.test),unlabThen:s(e.unlabThen),labThen:c(e.labThen),unlabElse:s(e.unlabElse),labElse:c(e.labElse)};case`LabelEither`:return{...l,kind:`LabelEither`,clauses:e.clauses.map(e=>({...R(),kind:`Clause`,labOr:c(e.labOr),unlabOr:s(e.unlabOr)}))};case`Call`:return{...l,kind:`Call`,to:e.to,returnTo:e.returnTo,args:Je(e.args,n,r)};case`Return`:return{...l,kind:`Return`,from:e.from};case`CallReturn`:return{...l,kind:`CallReturn`,to:e.to,from:e.from,args:Je(e.args,n,r)};case`CallGoto`:return{...l,kind:`CallGoto`,to:e.to,after:e.after,args:Je(e.args,n,r)};case`Goto`:return{...l,kind:`Goto`,to:e.to};default:throw new t.o(`Found unexpected statement type in macro at${Ae(e)}`)}},ge=(e,n,r,i,a)=>{let o=qe(e.rhs,n,r),s={...R(),kind:`Lhs`,var:e.lhs.var,sub:e.lhs.sub.tokens.length===0?e.lhs.sub:qe(e.lhs.sub,n,r)},c={...R(),kind:`SingleAssign`,col:e.col,line:e.line,macroCol:i>0?a:e.macroCol,macroLine:i>0?i:e.macroLine,lhs:s,rhs:o},l=r.indexOf(s.var);if(l===-1)return c;let u=n[l],d=He(u,{line:0,item:0});if(d.type!==I.ident)throw new t.s(`Macro expansion substitutes \`${d.string}' for assignment variable\n at ${Ae(c)}`);if(s.var=d.string,Ue(u,{line:0,item:0},1)===void 0)return c;let f=ze(u);return f.tokens[0].splice(0,1),Ie(f),s.sub.tokens.length===0?s.sub=f:Be(s.sub,f,0),c},_e=(e,t)=>{let n=e.flatMap(e=>{switch(e.kind){case`LabelIf`:return _e(e.unlabThen,t),_e(e.unlabElse,t),[e];case`LabelEither`:return e.clauses.forEach(e=>_e(e.unlabOr,t)),[e];case`With`:return _e(e.Do,t),[e];case`While`:return _e(e.unlabDo,t),[e];case`MacroCall`:return ve(e,t);default:return[e]}});e.splice(0,e.length,...n)},ve=(e,n)=>{let r=n.findLast(t=>t.name===e.name);if(r===void 0)throw new t.s(`Macro ${e.name} undefined,\n at ${Ae(e)}`);if(r.params.length!==e.args.length)throw new t.s(`Macro ${e.name} called with wrong number of arguments at \n ${Ae(e)}`);let i=r.body.map(t=>he(t,e.args,r.params,e.line,e.col));return i.length>0&&(i[0].lbl=e.lbl),i},ye=e=>{e.forEach((n,r)=>{if(e.slice(r+1).some(e=>e.name===n.name))throw new t.s(`Multiple definitions of macro name \`${n.name}'`)})},be=e=>{if(e.length===0)return;let t=()=>{s.omitPC=!1},n=e[0];if(e.length>1||n.kind!==`LabeledStmt`)return t();if(n.stmts.length===0)return;let r=n.stmts[0];if(n.stmts.length>1||r.kind!==`While`||!Ve(r.test)||r.test.tokens[0][0].string!==`TRUE`)return t();r.labDo.length>0&&(s.omitPC=!1),r.unlabDo.some(e=>[`LabelIf`,`LabelEither`,`LabeledStmt`].includes(e.kind))&&(s.omitPC=!1)},xe=()=>{let e=s.addedLabels.length>1?`Missing labels at the following locations:`:`Missing label at the following location:`;throw new t.s([e,...s.addedLabelsLocs].join(`
|
|
27
|
+
`))},Se=e=>s.procedures.forEach(t=>{s.currentProcedure=t.name,_e(t.body,e),t.body=F(t.body)}),Ce=()=>{r&&l()!==`algorithm`&&c("`--fair' not followed by `algorithm'");let t=l();s.cSyntax=u(1)===`{`,s.cSyntax&&m(`{`);let n=u(1)===`variable`||u(1)===`variables`?x():[],a={value:Fe()};u(1)===`define`&&(m(`define`),s.cSyntax&&p(`{`),a.value=f(!0),v(`define`),p(`;`));let o=[];for(;u(1)===`macro`;)o.push(oe(o));for(;u(1)===`procedure`;)s.procedures.push(se()),s.omitPC=!1;if(u(1)===`fair`&&(u(2)===`process`||u(2)===`+`&&u(3)===`process`)||u(1)===`process`){let r=[];for(;u(1)===`fair`||u(1)===`process`;){let e=u(1)===`fair`;e&&m(`fair`);let t=e&&u(1)===`+`;t&&m(`+`);let n=t||!e&&i.fairnessOption===`sf`?2:e||i.fairnessOption===`wf`?1:0;r.push({...ce(),fairness:n})}return v(`algorithm`),ye(o),r.forEach(e=>{_e(e.body,o),e.body=F(e.body),be(e.body)}),Se(o),s.addedLabels.length>0&&(i.labelFlag||xe(),e.log(`Labels added.`)),(s.gotoDoneUsed||s.gotoUsed)&&(s.omitPC=!1),{...R(),kind:`Multiprocess`,name:t,decls:n,defs:a.value,macros:o,prcds:s.procedures,procs:r}}i.inputVersionNumber===1500&&u(1)===`fair`&&(p(`fair`),u(1)===`+`&&p(`+`),i.fairnessOption=`wf`),r&&([``,`wf`,`wfNext`].includes(i.fairnessOption)||e.log(`Warning: Option \`${i.fairnessOption}' specified for --fair algorithm.`),i.fairnessOption=`wf`),_();let d=E();ye(o),_e(d,o),Se(o),s.cSyntax&&p(`}`),v(`algorithm`);let h=F(d);return s.addedLabels.length>0&&(s.hasLabel&&!i.labelFlag&&xe(),e.log(`Labels added.`)),(s.gotoUsed||s.gotoDoneUsed)&&(s.omitPC=!1),be(h),{...R(),kind:`Uniprocess`,name:t,decls:n,defs:a.value,macros:o,prcds:s.procedures,body:h}};try{return{ast:Ce(),omitPC:s.omitPC,hasDefaultInitialization:s.hasDefaultInitialization}}catch(e){if(!(e instanceof t.c))throw e;return c(`Unknown error at or before`)}},B={global:0,label:1,procedure:2,process:3,processVar:4,procedureVar:5,parameter:6},bt=[`Global variable`,`Label`,`Procedure`,`Process`,`Process variable`,`Procedure variable`,`Parameter`],xt=/* @__PURE__ */ new Set([B.global,B.processVar,B.procedureVar,B.parameter]),St=(e,t,n,r)=>e.symbols.find(e=>e.id===n&&e.context===r&&e.type===t),Ct=(e,t,n)=>e.symbols.find(e=>e.id===t&&e.context===n),wt=(e,t)=>{let n=e.procedures.findIndex(e=>e.name===t);return n===-1?e.procedures.length:n},Tt=(e,t,n,r)=>!(t===B.procedureVar||t===B.processVar||t===B.parameter?St(e,B.global,n,``)!==void 0||Ct(e,n,r)!==void 0:St(e,t,n,r)!==void 0)&&(e.symbols.push({type:t,id:n,context:r,useThis:n}),!0),Et=(e,t,n,r)=>St(e,t,n,r)?.useThis??n,Dt=(e,t,n)=>{let r=Ct(e,t,n);return r===void 0?t:xt.has(r.type)?r.useThis:t},Ot=e=>{let n={symbols:[],procedures:[],processNames:[],errorReport:``},r=(e,t)=>{Tt(n,B.label,e.label,t)||(n.errorReport+=`\nLabel ${e.label} redefined at line ${e.line}, column ${e.col}`),e.stmts.forEach(e=>i(e,t))},i=(e,n)=>{let a=e=>e.forEach(e=>i(e,n)),o=e=>e.forEach(e=>r(e,n));switch(e.kind){case`While`:a(e.unlabDo),o(e.labDo);return;case`If`:a(e.Then),a(e.Else);return;case`With`:a(e.Do);return;case`LabelIf`:a(e.unlabThen),o(e.labThen),a(e.unlabElse),o(e.labElse);return;case`Either`:e.ors.forEach(a);return;case`LabelEither`:e.clauses.forEach(e=>{a(e.unlabOr),o(e.labOr)});return;case`Assign`:case`When`:case`PrintS`:case`Assert`:case`Skip`:case`Call`:case`Return`:case`CallReturn`:case`CallGoto`:case`Goto`:return;default:throw new t.o(`Unexpected AST type ${e.kind}`)}},a=(e,t,r=t===``?B.global:B.processVar)=>{Tt(n,r,e.var,t)||(n.errorReport+=`\n${bt[r]} ${e.var} redefined at line ${e.line}, column ${e.col}`)};if(Tt(n,B.global,`pc`,``),e.prcds.length>0&&Tt(n,B.global,`stack`,``),e.decls.forEach(e=>a(e,``)),e.prcds.forEach(e=>{let t=wt(n,e.name)<n.procedures.length;t&&(n.errorReport+=`\nProcedure ${e.name} redefined at line ${e.line}, column ${e.col}`),t||n.procedures.push({name:e.name,params:e.params,decls:e.decls,initialPC:e.body.length===0?void 0:je(e.body[0]).label}),Tt(n,B.procedure,e.name,``),e.decls.forEach(t=>a(t,e.name,B.procedureVar)),e.params.forEach(t=>a(t,e.name,B.parameter)),e.body.forEach(t=>r(je(t),e.name))}),e.kind===`Multiprocess`&&e.procs.forEach(e=>{let t=n.processNames.includes(e.name);t&&(n.errorReport+=`\nProcess ${e.name} redefined at line ${e.line}, column ${e.col}`),t||n.processNames.push(e.name),Tt(n,B.process,e.name,``),e.decls.forEach(t=>a(t,e.name)),e.body.forEach(t=>r(je(t),e.name))}),e.kind===`Uniprocess`&&e.body.forEach(e=>r(je(e),``)),n.errorReport.length>0)throw new t.s(n.errorReport);return n},kt=e=>{let t=t=>e.symbols.filter(e=>e.useThis===t).length>1,n={isAny:!1};for(let r=0;r<=7;r+=1)e.symbols.forEach(e=>{if(e.type===r){e.useThis=e.id;for(let n=1;r>0&&t(e.useThis);n+=1)e.useThis+=n===1?`_`:e.context[n-2]??String(r);e.id!==e.useThis&&(n.isAny=!0)}});return n.isAny},At=e=>{let n=e.symbols.filter(e=>e.id===`defaultInitValue`).map(e=>`${bt[e.type]} name`);if(n.length>0)throw new t.s(`Cannot use \`defaultInitValue' as ${n.join(` or `)}`)},jt=(e,n,r)=>{let i=(e,t)=>{let r=[],i=[];e.tokens.forEach(e=>e.forEach(e=>{if(e.type!==I.ident)return;let a=Dt(n,e.string,t);r.includes(e.string)||a===e.string||(r.push(e.string),i.push(Le([[Pt(a)]])))})),i.length>0&&Ke(e,i,r,!1)},a=(e,t)=>{e.var=Dt(n,e.var,t),i(e.val,t)},o=(e,t)=>e.forEach((r,i)=>{e[i]=Et(n,B.label,r,t)}),s=(e,t)=>e===void 0?void 0:Et(n,B.procedure,e,t),c=(e,t)=>{e.label=Et(n,B.label,e.label,t),e.stmts.forEach(e=>l(e,t))},l=(e,r)=>{let a=e=>e.forEach(e=>l(e,r)),o=e=>e.forEach(e=>c(e,r)),u=e=>e.forEach(e=>i(e,r));switch(e.kind){case`LabeledStmt`:c(e,r);return;case`While`:a(e.unlabDo),o(e.labDo),i(e.test,r);return;case`Assign`:e.ass.forEach(e=>{e.lhs.var=Dt(n,e.lhs.var,r),i(e.lhs.sub,r),i(e.rhs,r)});return;case`If`:a(e.Then),a(e.Else),i(e.test,r);return;case`With`:i(e.exp,r),a(e.Do);return;case`When`:case`PrintS`:case`Assert`:i(e.exp,r);return;case`Skip`:return;case`LabelIf`:i(e.test,r),a(e.unlabThen),o(e.labThen),a(e.unlabElse),o(e.labElse);return;case`Call`:e.returnTo=Et(n,B.procedure,e.returnTo,r),e.to=Et(n,B.procedure,e.to,r),u(e.args);return;case`Return`:e.from=s(e.from,r);return;case`CallReturn`:e.from=s(e.from,r),e.to=Et(n,B.procedure,e.to,r),u(e.args);return;case`CallGoto`:e.after=Et(n,B.procedure,e.after,r),e.to=Et(n,B.procedure,e.to,r),u(e.args);return;case`Goto`:if(St(n,B.label,e.to,r)===void 0&&e.to!==`Done`)throw new t.s(`goto to non-existent label \`${e.to}' at line ${e.line}, column ${e.col}`);e.to=Et(n,B.label,e.to,r);return;case`Either`:e.ors.forEach(a);return;case`LabelEither`:e.clauses.forEach(e=>{a(e.unlabOr),o(e.labOr)});return;default:throw new t.o(`Unexpected AST type${e.kind}`)}},u=e=>{e.decls.forEach(t=>a(t,e.name)),e.params.forEach(t=>a(t,e.name)),e.body.forEach(t=>c(je(t),e.name));let t=Me(n.procedures,wt(n,e.name));o(e.plusLabels,e.name),o(e.minusLabels,e.name),t.initialPC!==void 0&&(t.initialPC=Et(n,B.label,t.initialPC,e.name)),e.name=Et(n,B.procedure,e.name,``),t.name=e.name},d=e=>{e.decls.forEach(t=>a(t,e.name)),e.body.forEach(t=>c(je(t),e.name)),o(e.plusLabels,e.name),o(e.minusLabels,e.name),e.name=Et(n,B.process,e.name,``)};e.decls.forEach(e=>a(e,``)),e.kind===`Multiprocess`&&((e,t)=>{e.forEach(u);let n=e.map(e=>e.name),i=e.map(e=>n.map(t=>e.proceduresCalled.includes(t)));n.forEach((e,t)=>i.forEach(e=>e.forEach((n,r)=>{e[r]=n||e[t]&&i[t][r]}))),e.forEach((e,t)=>{e.proceduresCalled=n.filter((e,n)=>i[t][n])});for(let e of t){d(e);let t=e.proceduresCalled;for(let e=0;e<t.length;e+=1){let a=n.indexOf(t[e]);if(a===-1){r(`\nUnrecoverable error:\n -- Could not find procedure name \`${t[e]}'.\n`);return}n.forEach((e,n)=>{i[a][n]&&!t.includes(e)&&t.push(e)})}}})(e.prcds,e.procs),e.kind===`Uniprocess`&&(e.prcds.forEach(u),e.body.forEach(e=>c(je(e),``)))},Mt=e=>Ne(e,0,I.string),Nt=e=>Ne(e,0,I.added),V=e=>Ne(e,0,I.builtin),Pt=e=>Ne(e,0,I.ident),Ft=(e,t)=>{let n=[];return e.forEach(e=>{let r=n.at(-1),i=r===void 0?0:r.column+Pe(r)+t;n.push(Ne(e.string,i,e.type))}),Le([n])},It=e=>e.tokens.forEach((t,n)=>{let r={column:n===0||n===e.tokens.length-1?1:6};t.forEach(e=>{if(e.column=r.column,r.column+=Pe(e),e.type===I.builtin)switch(e.string){case`|->`:case`↦`:e.column=Math.max(16,e.column+1),r.column=e.column+5;return;case`[`:case`<<`:r.column+=1;return;case`]`:case`>>`:e.column+=1,r.column+=1;return;case`\\o`:e.column+=1,r.column+=2}})}),Lt=(e,t,n,r=0,i=0)=>({...R(),kind:`SingleAssign`,line:r,col:i,lhs:{...R(),kind:`Lhs`,var:e,sub:t},rhs:n}),Rt=(e,t=0,n=0)=>({...R(),kind:`Assign`,line:t,col:n,ass:e}),zt=(e,t,n=0,r=0)=>Rt([Lt(e,Le([]),t,n,r)],n,r),Bt=e=>{if(e.tokens.length>1)return!1;let t=Me(e.tokens,0);return t.length===1?t[0].string===`TRUE`:t.length===3&&t[0].string===`(`&&t[1].string===`TRUE`&&t[2].string===`)`},Vt=e=>({...R(),kind:`When`,exp:Ft([Nt(`pc`),V(`=`),Mt(e)],1)}),Ht=e=>zt(`pc`,Le([[Mt(e??`null`)]])),Ut=e=>[Pt(`Head`),V(`(`),Nt(`stack`),V(`)`),V(`.`),Pt(e)],Wt=()=>[Pt(`Tail`),V(`(`),Nt(`stack`),V(`)`)],Gt=e=>Le([Ut(e)]),Kt=(e,t,n,r)=>{let i=[[V(`<<`),V(`[`),Pt(`procedure`),V(`|->`),Mt(e),V(`,`)],[Pt(`pc`),V(`|->`),...t]];n.forEach(e=>{i[i.length-1].push(V(`,`)),i.push([Pt(e.var),V(`|->`),Pt(e.var)])}),i[i.length-1].push(V(`]`),V(`>>`)),i.push(r);let a=Fe(i);return It(a),Ie(a),a},qt=(e,n,r)=>{if(n.params.length!==r.args.length)throw new t.s(`Procedure ${r.to} called with wrong number of arguments`,r);return n.params.forEach((t,n)=>e.ass.push(Lt(t.var,Le([]),r.args[n],r.line,r.col))),[e,...n.decls.map(e=>zt(e.var,e.val,r.line,r.col)),Ht(n.initialPC)]},Jt=(e,n,r)=>{let i={procedure:void 0},a=(e,r)=>{let i=wt(n,e.to);if(i===n.procedures.length)throw new t.s(`Call of non-existent procedure ${e.to}`,e);let a=n.procedures[i],o=Kt(e.to,[Mt(r)],[...a.decls,...a.params],[V(`\\o`),Nt(`stack`)]);return qt(zt(`stack`,o,e.line,e.col),a,e)},o=e=>{e.from??=i.procedure;let r=e.from;if(r===void 0)throw new t.s("`return' statement not in procedure",e);let a=wt(n,r);if(a>=n.procedures.length)throw new t.s(`Error in procedure (perhaps name used elsewhere)`,e);let o=n.procedures[a],s=(t,n)=>Rt([Lt(t,Fe(),n,e.line,e.col)],e.line,e.col);return[s(`pc`,Gt(`pc`)),...o.decls.map(e=>s(e.var,Gt(e.var))),...o.params.map(e=>s(e.var,Gt(e.var))),s(`stack`,Le([Wt()]))]},s=e=>{let r=e.from;if(r===void 0)throw new t.s(`\`return' statement following \`call' at ${Ae(e)} not in a procedure`);let i=Me(n.procedures,wt(n,r)),a=wt(n,e.to);if(a===n.procedures.length)throw new t.s(`Call of non-existent procedure ${e.to}`,e);let o=n.procedures[a],s=Rt([],e.line,e.col);if(r!==e.to){i.decls.forEach(t=>s.ass.push(Lt(t.var,Fe(),Gt(t.var),e.line,e.col)));let t=Kt(e.to,Ut(`pc`),[...o.decls,...o.params],[V(`\\o`),...Wt()]);s.ass.push(Lt(`stack`,Le([]),t,e.line,e.col))}return qt(s,o,e)},c=(e,t)=>{if(e.length===0)return{stmts:[],labeledStmts:[],needsGoto:!r};let n={stmts:e,labeledStmts:[],needsGoto:!1},i=e[e.length-1];switch(i.kind){case`LabelIf`:case`LabelEither`:{let r=i.kind===`LabelIf`?p(i,t):m(i,t);e.pop(),e.push(r.stmt),n.labeledStmts=r.labeledStmts;break}case`Goto`:e.pop(),e.push(Ht(i.to));break;case`Call`:e.pop(),e.push(...a(i,t));break;case`Return`:e.pop(),e.push(...o(i));break;case`CallReturn`:e.pop(),e.push(...s(i));break;case`CallGoto`:e.pop(),e.push(...a({...R(),kind:`Call`,returnTo:``,to:i.to,args:i.args,line:i.line,col:i.col},i.after));break;case`If`:{let e=c(i.Then,t),a=c(i.Else,t);n.labeledStmts.push(...e.labeledStmts,...a.labeledStmts),i.Then=e.stmts,i.Else=a.stmts,r||(n.needsGoto=e.needsGoto&&a.needsGoto,n.needsGoto||(e.needsGoto&&i.Then.push(Ht(t)),a.needsGoto&&i.Else.push(Ht(t))));break}case`Either`:{let e=i.ors.map((e,r)=>{let a=c(e,t);return i.ors[r]=a.stmts,n.labeledStmts.push(...a.labeledStmts),a});n.needsGoto=e.every(e=>e.needsGoto),!r&&!n.needsGoto&&e.forEach((e,n)=>{e.needsGoto&&i.ors[n].push(Ht(t))});break}case`With`:{let e=c(i.Do,t);i.Do=e.stmts,n.labeledStmts.push(...e.labeledStmts),n.needsGoto=e.needsGoto;break}default:n.needsGoto=!0}return r&&(n.needsGoto=!1),n},l=(e,t)=>{let n=c(e,t);return n.needsGoto&&n.stmts.push(Ht(t)),n},u=(e,t)=>{let n=e.stmts.at(0);if(n?.kind===`While`)return f(e,n,t);let i=l([...e.stmts],t),a=[];return r||(i.stmts.unshift(Vt(e.label)),a.push({...R(),kind:`LabeledStmt`,col:e.col,line:e.line,label:e.label,stmts:i.stmts})),a.push(...i.labeledStmts),a},d=(e,t)=>e.flatMap((n,r)=>u(n,r<e.length-1?e[r+1].label:t)),f=(e,t,n)=>{let i=t.labDo.length===0?e.label:t.labDo[0].label,a=l([...t.unlabDo],i),o=l(e.stmts.slice(1),n),s=Bt(t.test),c=s?a.stmts:[{...R(),kind:`If`,test:t.test,Then:a.stmts,Else:o.stmts}];return[{...R(),kind:`LabeledStmt`,col:e.col,line:e.line,label:e.label,stmts:[...r?[]:[Vt(e.label)],...c]},...d(t.labDo,e.label),...a.labeledStmts,...s?[]:o.labeledStmts]},p=(e,t)=>{let n=l(e.unlabThen,e.labThen.length===0?t:e.labThen[0].label),r=l(e.unlabElse,e.labElse.length===0?t:e.labElse[0].label),i=d(e.labThen,t);return i.push(...d(e.labElse,t)),i.push(...n.labeledStmts,...r.labeledStmts),{stmt:{...R(),kind:`If`,col:e.col,line:e.line,test:e.test,Then:n.stmts,Else:r.stmts},labeledStmts:i}},m=(e,t)=>{let n=[],r=[];return e.clauses.forEach(e=>{let i=l(e.unlabOr,e.labOr.length>0?e.labOr[0].label:t);n.push(i.stmts),r.push(...i.labeledStmts),r.push(...d(e.labOr,t))}),{stmt:{...R(),kind:`Either`,col:e.col,line:e.line,ors:n},labeledStmts:r}},h=(e,t)=>d(e.map(je),t),g=e=>{i.procedure=e.name;let t=h(e.body,Et(n,B.label,`Error`,``));return i.procedure=void 0,{...R(),kind:`Procedure`,col:e.col,line:e.line,name:e.name,minusLabels:[],plusLabels:[],proceduresCalled:[],params:e.params,decls:e.decls,body:t}},_=e=>({...R(),kind:`Process`,col:e.col,line:e.line,name:e.name,fairness:0,minusLabels:[],plusLabels:[],proceduresCalled:[],isEq:e.isEq,id:e.id,decls:e.decls,body:h(e.body,`Done`)}),v=e.prcds.map(g);return e.kind===`Uniprocess`?{...R(),kind:`Uniprocess`,col:e.col,line:e.line,name:e.name,decls:e.decls,defs:e.defs,macros:[],prcds:v,body:h(e.body,`Done`)}:{...R(),kind:`Multiprocess`,col:e.col,line:e.line,name:e.name,decls:e.decls,defs:e.defs,macros:[],prcds:v,procs:e.procs.map(_)}},Yt=(e,n)=>{let r=n?[]:[`pc`];if(r.push(...e.decls.map(e=>e.var)),e.prcds.length>0&&r.push(`stack`),e.prcds.forEach(e=>{r.push(...e.params.map(e=>e.var)),r.push(...e.decls.map(e=>e.var))}),e.kind===`Multiprocess`&&e.procs.forEach(e=>r.push(...e.decls.map(e=>e.var))),r.length===0)throw new t.s(`The algorithm has no variables.`);let i=(e,t)=>{let n=r.indexOf(t);return n===-1?0:(e[n]+=1,e[n])},a=(e,t)=>t.forEach((t,n)=>{e[n]=Math.max(e[n],t)}),o=e=>[...e].sort((e,t)=>e.lhs.var<t.lhs.var?-1:+(e.lhs.var>t.lhs.var)),s=(e,n)=>{let s=[...n];e.ass=o(e.ass),new Set(e.ass.map(e=>e.lhs.var)).forEach(n=>{let a=e.ass.filter(e=>e.lhs.var===n);if(!r.includes(n))throw new t.s(`Assignment to undeclared variable ${n}`,a[0]);let o=a.some(e=>e.lhs.sub.tokens.length===0);if(i(s,n)>1||a.length>1&&o)throw new t.s(`Multiple assignment to ${n}`,e)}),a(n,s)},c=(e,n)=>{switch(e.kind){case`Assign`:s(e,n);return;case`If`:{let t=[...n],r=[...n];e.Then.forEach(e=>c(e,t)),e.Else.forEach(e=>c(e,r)),a(n,t),a(n,r);return}case`Either`:{let t=[...n];e.ors.forEach(e=>{let r=[...n];e.forEach(e=>c(e,r)),a(t,r)}),a(n,t);return}case`With`:e.Do.forEach(e=>c(e,n));return;case`When`:case`PrintS`:case`Assert`:case`Skip`:return;default:throw new t.o(`Unexpected AST type ${e.kind}`)}},l=e=>e.forEach(e=>{let t=r.map(()=>0);je(e).stmts.forEach(e=>c(e,t))});e.prcds.forEach(e=>l(e.body)),(e.kind===`Uniprocess`?[e.body]:e.procs.map(e=>e.body)).forEach(l)},Xt=(e,t,n,r)=>{let i=Ot(e);kt(i)&&r(`Warning: symbols were renamed.`),jt(e,i,r),Yt(Jt(e,i,t),t),n&&At(i)},Zt=`[ \\t\\n\\x0B\\f\\r]`,Qt=RegExp(`\\\\\\* BEGIN TRANSLATION${Zt}+\\(${Zt}*([cC][hH]([eE][cC])?[kK][sS][uU][mM]\\([pP]([lL][uU][sS])?[cC][aA][lL]\\))${Zt}*(=${Zt}*"(?<pcal>[0-9A-Fa-f]*)"|\\\\in${Zt}*STRING)${Zt}*\\/\\\\${Zt}*([cC][hH]([eE][cC])?[kK][sS][uU][mM]\\([tT][lL][aA]\\+?\\))${Zt}*(=${Zt}*"(?<tla>[0-9A-Fa-f]*)"|\\\\in${Zt}*STRING)${Zt}*\\)`),$t=e=>process.getBuiltinModule(`node:zlib`).crc32(Buffer.from(e,`utf8`)).toString(16),en=(e,t)=>e.log(`\nUnrecoverable error:\n -- ${t}.\n`),tn=(e,t)=>en(e,t.node===void 0||t.node.line===0?t.message:`${t.message}\n at ${Ae(t.node)}`),nn=e=>e.map(e=>`${Array.from(e).reduce((e,t)=>t===` `?e+` `.repeat(8-e.length%8):e+t,``)} `),rn=(e,t,n,r)=>{for(let i=Math.max(t,0);i<e.length;i++){let t=e[i],a=t.indexOf(n);if(a===-1)continue;let o=a+n.length,s=t.slice(o).search(/[^ ]/);if(s!==-1&&o+s===t.indexOf(r))return i}return-1},an=(e,t)=>{for(;t.line<e.length;){let n=e[t.line];for(;t.column<n.length&&n[t.column]===` `;)t.column+=1;if(t.column<n.length)return n;t.line+=1,t.column=0}return``},on=(e,t,n)=>{let r=Array.from(e.slice(t)).findIndex(e=>n.includes(e));return r===-1?e.length:t+e.slice(t,t+r).length},sn=e=>/^[\p{L}\p{Nd}_]$/u.test(e),cn=(e,t,n)=>{for(;t.line<e.length;){let r=an(e,t);if(r.slice(t.column).startsWith(n)){let e=t.column+n.length;if(e>=r.length||!/^[\p{L}_]$/u.test(r[e]))return t.column=on(r,e,` `),!0}t.column=on(r,t.column,` `)}return!1},ln=(e,t)=>en(e,`Command-line error: ${t}`),un=(e,t)=>{let n=e.params,r={isFirst:!0,isExplicitNof:!1},i=t=>(r.isFirst&&=(n.fairnessOption=``,!1),n.fairnessOption===``?(n.fairnessOption=t,!0):(ln(e,`Can only have one of -wf, -sf, -wfNext, and -nof options`),!1));for(let a=0;a<t.length;a++){let o=t[a],s=t[a+1];switch(o){case`-spec`:case`spec`:case`-myspec`:case`myspec`:{let t=o.endsWith(`myspec`);if(n[t?`myspecOption`:`specOption`]=!0,n.specOption&&n.myspecOption){ln(e,`
|
|
28
|
+
Can have at most one of the options -spec, -myspec, -spec2, -myspec2, writeAST`);return}if(s===void 0){ln(e,`Specification name must follow \`-${t?`myspec`:`spec`}' option`);return}a+=1;continue}case`-termination`:case`termination`:n.checkTermination=!0;continue;case`-noold`:case`-nocfg`:case`-noDoneDisjunct`:case`noDoneDisjunct`:continue;case`-wf`:case`wf`:case`-sf`:case`sf`:case`-wfNext`:case`wfNext`:case`-nof`:case`nof`:if(!i(o.replace(/^-/,``)))return;o.endsWith(`nof`)&&(r.isExplicitNof=!0);continue;case`-label`:case`label`:n.labelFlag=!0;continue;case`-labelRoot`:case`labelRoot`:if(s===void 0){ln(e,"Label root must follow `-labelRoot' option");return}if(!/^[a-zA-Z][a-zA-Z0-9_]*$/.test(s)){ln(e,`Label root must be a valid PlusCal identifier (must start with a letter and contain only letters, numbers, and underscores)`);return}n.labelRoot=s,a+=1;continue;case`-version`:case`version`:{if(s===void 0){ln(e,"Version number must follow `-version' option");return}let t=ke(s);if(t<0||t>1903){en(e,t<0?`Illegal version ${s} specified.`:`Specified version ${s} later than current version 1.12`),ln(e,`Bad version number`);return}n.inputVersionNumber=t,a+=1;continue}case`-lineWidth`:if(!/^[+-]?\d+$/.test(s??``)||Number(s)<60){ln(e,"Integer value at least 60 must follow `-lineWidth' option");return}a+=1;continue;default:ln(e,`Unknown or illegal option in options statement: ${o}`);return}}n.checkTermination&&n.fairnessOption===``&&!r.isExplicitNof&&(n.fairnessOption=`wf`)},dn=(e,t,n)=>{if(an(t,n),n.column+=7,!an(t,n).slice(n.column).startsWith(`(`)){en(e,"`PlusCal options' not followed by '('");return}n.column+=1;let r=[];for(;;){let e=an(t,n);if(n.line>=t.length||e[n.column]===`)`)break;if(e[n.column]===`,`){n.column+=1;continue}let i=on(e,n.column,` ,)`);r.push(e.slice(n.column,i)),n.column=i}n.line>=t.length?en(e,`No closing ')' found in options statement`):un(e,r)},fn=(e,n,r)=>{let i={depth:0,isDone:!1,isInString:!1};for(let a=n;!i.isDone&&a<e.length;a++){let o=e[a],s=a===n?r:0,c=[o.slice(0,s)];i.isInString=!1;for(let e=s;!i.isDone&&e<o.length;e++){let t=o[e],n=o.slice(e,e+2);if(n===`(*`&&!i.isInString)i.depth+=1,c.push(` `),e+=1;else if(n===`*)`&&!i.isInString&&i.depth===0)c.push(n),i.isDone=!0;else if(n===`*)`&&!i.isInString)--i.depth,c.push(` `),e+=1;else if(i.depth>0)c.push(` `);else if(i.isInString&&t===`\\`&&n.length===2)c.push(n),e+=1;else{if(!i.isInString&&n===`\\*`){c.push(` `);break}t===`"`&&(i.isInString=!i.isInString),c.push(t)}}if(i.isInString)return new t.s(`Unterminated string in line ${a+1}`);e[a]=c.join(``)}},pn=(e,n)=>{let r=10*2**Math.max(0,Math.ceil(Math.log2(n/10)));throw new t.c(`java.lang.ArrayIndexOutOfBoundsException: Index ${e} out of bounds for length ${r}`)},mn=(e,n,r)=>{if(!n.some(e=>e.indexOf(`algorithm`)>0))return/* @__PURE__ */ new Set([`NO_PLUSCAL_EXISTS`]);let i=nn(n),a={line:0,column:0};for(;cn(i,a,`PlusCal`);){let t=an(i,a).slice(a.column),n=Array.from(t).findIndex(e=>!sn(e));if(t.startsWith(`options`)&&(n===-1?t.length:n)===7){dn(e,i,a);break}}let o={line:0,column:-1,isFound:!1,isFair:!1};for(;o.line<i.length;o.line++){let e=i[o.line];if(/^=+$/.test(e))break;let t=e.indexOf(`--algorithm`),n=e.indexOf(`--fair`);if(t!==-1){o.column=t+11,o.isFound=!0;break}if(n!==-1){o.column=n+6,o.isFound=!0,o.isFair=!0;break}}let s=/* @__PURE__ */ new Set,c=rn(i,0,`BEGIN`,`TRANSLATION`);c===-1&&s.add(`NO_TRANSLATION_EXISTS`);let l=rn(i,c+1,`END`,`TRANSLATION`);if(l===-1&&s.add(`NO_TRANSLATION_EXISTS`),c===-1&&l===-1)return s;if(!o.isFound)return s.add(`NO_PLUSCAL_EXISTS`),s;let u=fn(i,o.line,o.column);if(u!==void 0)return tn(e,u),/* @__PURE__ */ new Set([`ERROR_ENCOUNTERED`]);let d={ast:void 0};try{let t=yt(e,Ze(i,o.line,o.column),o.isFair);d.ast=t.ast,Xt(t.ast,t.omitPC,t.hasDefaultInitialization,e.log)}catch(n){if(!(n instanceof t.s))throw n;tn(e,n)}c===-1&&pn(-1,i.length);let f=Qt.exec(i[c]);if(f===null)return s.add(`NO_PCAL_CHECKSUMS_EXIST`),s;let p=f.groups?.pcal,m=o.isFair&&r!==`1.7.4`?`fair`:d.ast===void 0?void 0:Xe(d.ast,e.params.inputVersionNumber,r);p!==void 0&&(m===void 0||p!==$t(m))&&s.add(`PCAL_DIVERGENCE_EXISTS`);let h=f.groups?.tla;if(h!==void 0){if(l===-1)throw new t.c(`java.lang.IllegalArgumentException: fromIndex(${c+1}) > toIndex(-1)`);let e=n.slice(c+1,l).join(``);h!==$t(e)&&s.add(`TLA_DIVERGENCE_EXISTS`)}return s.size===0?/* @__PURE__ */ new Set([`NO_DIVERGENCE`]):s},hn=[[`STRING`,0,0,[],[]],[`FALSE`,0,0,[],[]],[`TRUE`,0,0,[],[]],[`BOOLEAN`,0,0,[],[]],[`=`,2,0,[2,2],[1,1]],[`/=`,2,0,[2,2],[1,1]],[`.`,2,0,void 0,void 0],[`'`,1,2,[1],[0]],[`\\lnot`,1,0,[3],[1]],[`\\neg`,1,0,void 0,void 0],[`\\land`,2,0,[3,3],[1,1]],[`\\lor`,2,0,[3,3],[1,1]],[`\\equiv`,2,0,[3,3],[1,1]],[`=>`,2,0,[3,3],[1,1]],[`SUBSET`,1,0,[2],[1]],[`UNION`,1,0,[2],[1]],[`DOMAIN`,1,0,[2],[1]],[`\\subseteq`,2,0,[2,2],[1,1]],[`\\in`,2,0,[2,2],[1,1]],[`\\notin`,2,0,[2,2],[1,1]],[`\\`,2,0,[2,2],[1,1]],[`\\intersect`,2,0,[2,2],[1,1]],[`\\union`,2,0,[2,2],[1,1]],[`\\times`,2,0,[2,2],[1,1]],[`~>`,2,3,[3,3],[0,0]],[`[]`,1,3,[3],[0]],[`<>`,1,3,[3],[0]],[`ENABLED`,1,1,[2],[0]],[`UNCHANGED`,1,2,[1],[0]],[`\\cdot`,2,2,[2,2],[0,0]],[`-+->`,2,3,[3,3],[0,0]],[`$AngleAct`,2,2,[2,1],[0,0]],[`$BoundedChoose`,-1,0,[2],[1]],[`$BoundedExists`,-1,0,[3],[1]],[`$BoundedForall`,-1,0,[3],[1]],[`$CartesianProd`,-1,0,[2],[1]],[`$Case`,-1,0,[3],[1]],[`$ConjList`,-1,0,[3],[1]],[`$DisjList`,-1,0,[3],[1]],[`$Except`,-1,0,[2],[1]],[`$FcnApply`,2,0,[2,2],[1,1]],[`$FcnConstructor`,-1,0,[3],[1]],[`$IfThenElse`,3,0,[3,3,3],[1,1,1]],[`$NonRecursiveFcnSpec`,1,0,[3],[1]],[`$Pair`,2,0,[3,3],[1,1]],[`$RcdConstructor`,-1,0,[3],[1]],[`$RcdSelect`,2,0,[2,0],[1,1]],[`$RecursiveFcnSpec`,1,0,[3],[1]],[`$Seq`,-1,0,[2],[1]],[`$SetEnumerate`,-1,0,[2],[1]],[`$SetOfAll`,-1,0,[2],[1]],[`$SetOfFcns`,-1,0,[2],[1]],[`$SetOfRcds`,-1,0,[2],[1]],[`$SF`,2,3,[1,2],[0,0]],[`$SquareAct`,2,2,[2,1],[0,0]],[`$SubsetOf`,1,0,[2],[1]],[`$TemporalExists`,1,3,[3],[0]],[`$TemporalForall`,1,3,[3],[0]],[`$TemporalWhile`,2,3,[3,3],[0,0]],[`$Tuple`,-1,0,[2],[1]],[`$UnboundedChoose`,1,0,[2],[1]],[`$UnboundedExists`,1,0,[3],[1]],[`$UnboundedForall`,1,0,[3],[1]],[`$WF`,2,3,[1,2],[0,0]],[`$Nop`,1,0,[3],[1]],[`$Qed`,0,0,[],[]],[`$Pfcase`,1,0,[3],[1]],[`$Have`,1,0,[3],[1]],[`$Take`,1,0,[3],[1]],[`$Pick`,1,0,[3],[1]],[`$Witness`,-1,0,[2],[1]],[`$Suffices`,1,0,[3],[1]]],gn={file:`--TLA+ BUILTINS--`,beginLine:0,beginColumn:0,endLine:0,endColumn:0},H=e=>({id:e,levelChecked:0,level:0,levelParams:/* @__PURE__ */ new Set,allParams:/* @__PURE__ */ new Set,nonLeibnizParams:/* @__PURE__ */ new Set,argLevelParams:/* @__PURE__ */ new Map,levelCorrect:!0,levelConstraints:/* @__PURE__ */ new Map,argLevelConstraints:/* @__PURE__ */ new Map}),_n=e=>hn.map(([t,n,r,i,a])=>{let o=e(),s=n<0?void 0:Array.from({length:n},(t,n)=>({...H(e()),kind:`FormalParam`,name:`Formal_${n}`,arity:0,location:void 0})),c=i!==void 0&&a!==void 0,l=a?.map(e=>e>0);return{...H(o),levelChecked:c?99:0,level:r,kind:`OpDef`,defKind:`BuiltIn`,name:t,arity:n,params:s,body:void 0,isLocal:!1,location:gn,module:void 0,source:void 0,preComments:[],isDefined:!0,inRecursive:!1,inRecursiveSection:!1,recursiveSection:-1,letInLevel:0,weights:n<0?(a??[]).slice(0,1):a??[],isLeibnizArg:c?l:void 0,isLeibniz:l?.every(Boolean)??!0,opLevelCond:void 0,maxLevels:n<0?(i??[]).slice(0,1):i??[],minMaxLevel:void 0,labels:/* @__PURE__ */ new Map,step:void 0}}),vn=(e,t)=>{let n=JSON.stringify(t);e.some(e=>JSON.stringify(e)===n)||e.push(t)},yn=e=>e===void 0?`Unknown location`:typeof e==`string`?`In module ${e}`:e.beginLine===0&&e.beginColumn===0&&e.endLine===0&&e.endColumn===0?`In module ${e.file}`:`line ${e.beginLine}, col ${e.beginColumn} to line ${e.endLine}, col ${e.endColumn} of module ${e.file}`,bn=e=>e?.kind===`OpAppl`&&e.isAbsent===!0,xn=e=>{let t=0;for(let n=0;n<e.length;n++)t=Math.imul(t,31)+e.charCodeAt(n)|0;return t},Sn=()=>({buckets:Array.from({length:11},()=>[]),count:0,threshold:8}),Cn=(e,t)=>(e&2147483647)%t,wn=e=>{let t=e.buckets.length*2+1,n=Array.from({length:t},()=>[]);for(let r=e.buckets.length-1;r>=0;r--)e.buckets[r].forEach(e=>n[Cn(e.hash,t)].unshift(e));e.buckets=n,e.threshold=Math.floor(t*.75)},Tn=(e,t,n=t)=>e.buckets[Cn(xn(n),e.buckets.length)].find(e=>e.key===t)?.value,En=(e,t,n,r=t)=>{let i=xn(r),a=e.buckets[Cn(i,e.buckets.length)].find(e=>e.key===t);a?a.value=n:(e.count>=e.threshold&&wn(e),e.buckets[Cn(i,e.buckets.length)].unshift({hash:i,key:t,value:n}),e.count++)},Dn=e=>e.buckets.toReversed().flatMap(e=>e.map(e=>e.value)),On=`\0module `,U=()=>({table:Sn(),symbols:[]}),kn=e=>e.kind===`Module`?On+e.name:e.name,An=(e,t)=>{En(e.table,kn(t),t,t.name),e.symbols.push(t)},jn=e=>e.kind===`ThmOrAssumpDef`?e.params.length:e.kind===`Module`?0:e.arity,Mn=(e,t)=>Tn(e.table,t),Nn=(e,t)=>Tn(e.table,On+t,t),Pn=e=>e.context.symbols.filter(e=>e.kind===`OpDef`&&e.defKind===`UserDefined`),Fn=(e,t)=>Dn(e.context.table).filter(e=>e.kind===`OpDecl`&&e.declKind===t).toReversed(),In=e=>e.context.symbols.filter(e=>e.kind===`ThmOrAssumpDef`),Ln=/* @__PURE__ */ new Map([[`$Qed`,`QED step`],[`$Pfcase`,`CASE`],[`$Have`,`HAVE`],[`$Take`,`TAKE`],[`$Pick`,`PICK`],[`$Witness`,`WITNESS`],[`$Suffices`,`SUFFICES`]]),Rn=e=>{let t=e.split(`!`);return t.some(e=>e.length===0)?[e]:t},zn=e=>{switch(e.kind){case`Identifier`:return Rn(e.name).map(e=>({op:`Name`,name:e,args:void 0}));case`Apply`:{let t=Rn(e.operator),n=e.argumentCounts??t.map((n,r)=>r===t.length-1?e.args.length:0),r={value:0};return t.map((t,i)=>{let a=e.args.slice(r.value,r.value+n[i]);return r.value+=n[i],{op:`Name`,name:t,args:a.length>0?a:void 0}})}case`Subexpression`:return e.selectors.map(e=>{switch(e.kind){case`Name`:return{op:`Name`,name:e.name,args:e.args.length>0?e.args:void 0};case`Operand`:return{op:e.operand,name:String(e.operand),args:void 0};case`Bound`:return{op:`Null`,name:`!(...)`,args:e.args};case`At`:return{op:`@`,name:`@`,args:void 0};case`Colon`:return{op:`:`,name:`:`,args:void 0}}})}},Bn=e=>{let t=e[e.length-1];return t.op!==`Name`||t.args===void 0},Vn=e=>typeof e.op==`number`?`argument selector ${e.name}`:e.name,Hn=(e,t)=>typeof e==`number`?e>0&&e<=t?e:-1:e===`<<`?t>0?1:-1:e===`>>`&&t===2?2:-1,Un=e=>e.kind===`OpDecl`||e.kind===`FormalParam`||e.kind===`OpDef`&&(e.defKind===`BuiltIn`||e.defKind===`NumberedProofStep`),Wn=e=>e.kind===`FormalParam`||e.kind===`OpDecl`||e.kind===`OpDef`||e.kind===`ThmOrAssumpDef`||e.kind===`Module`,Gn=e=>(e.bounded?.length??0)>0?(e.bounded??[]).flat():e.unbounded??[],Kn=(e,t)=>e===void 0?t:{...e,endLine:t.endLine,endColumn:t.endColumn},qn=e=>(t,n,r,i,a)=>{let o=[],s=[],c=[],l=e=>t[e].location??a,u={name:void 0,nameLocation:void 0,node:void 0,index:0,mode:`FindingOpName`,previousMode:void 0,letInContext:void 0,definitionArityFound:0,definitionArgs:[],isInSuffices:!1},d=e=>e.args??[];for(;u.index<t.length;){let f=t[u.index];if((f.op!==`Name`&&f.op!==`Null`||n!==0)&&f.args!==void 0)return e.addError(l(u.index),`Selector \`${f.name}' should not have argument(s).`);switch(u.mode){case`FindingOpName`:{let f,p,m=[];for(;f===void 0&&u.index<t.length;){let n=t[u.index];if(p=n.op===`Name`?u.name===void 0?e.resolveSynonym(n.name):`${u.name}!${e.resolveSynonym(n.name)}`:void 0,u.name===void 0&&n.op!==`Name`)return e.addError(l(u.index),`Need name or step number here, not \`${n.name}'.`);p!==void 0&&(f=u.letInContext===void 0?e.resolveSymbol(p):Mn(u.letInContext,p)),f===void 0&&(p!==void 0&&(u.name=p,u.nameLocation=Kn(u.nameLocation,l(u.index))),m.push(...d(n)),u.index++)}if(f===void 0&&e.version===`1.7.4`){let n=t.length-1;return e.addError(l(n),`Unknown operator: \`${Vn(t[n])}'.`)}if(f===void 0)return e.addError(u.nameLocation??a,`Unknown operator: \`${u.name}'.`);if(f.kind===`Module`)return e.addError(l(u.index),`Module name (${t[u.index].name}) not allowed here.`);if(u.node=f,u.nameLocation=Kn(u.nameLocation,l(u.index)),u.name=p,Un(f)&&t.length!==1)return e.addError(l(u.index),`Cannot take subexpression of \`${u.name}'.`);let h=jn(f);if(n===0){if(m.push(...d(t[u.index])),u.definitionArityFound+m.length!==h)return e.addError(t[u.index].argsLocation??a,`The operator ${u.name} requires ${h-u.definitionArityFound} arguments.`);m.forEach((t,n)=>u.definitionArgs.push(e.generateArgument(f,n+u.definitionArityFound,t,l(u.index))))}if(u.definitionArityFound=h,f.kind===`OpDef`&&f.defKind===`ModuleInstance`){if(u.index===t.length-1&&!(i||r))return e.addError(l(u.index),`Operator name ${u.name} is incomplete.`)}else{let n=f.kind===`OpDef`&&f.defKind===`UserDefined`||f.kind===`ThmOrAssumpDef`?f:void 0;if(f.kind===`OpDef`&&f.defKind===`UserDefined`&&!f.isDefined&&t.length!==1)return e.addError(l(u.index),`Subexpression of \`${u.name}' used inside the operator's definition.`);if(u.index!==t.length-1&&n!==void 0){s.push(...n.params??[]),u.name=void 0,u.nameLocation=void 0,u.mode=t[u.index+1].op===`Name`?`FollowingLabels`:`FindingSubExpr`,c.push(...u.definitionArgs),u.definitionArityFound=0,u.definitionArgs=[];let e=n.body;for(;e?.kind===`SubstIn`;)o.push(e),e=e.body;for(;e?.kind===`APSubstIn`;)o.push(e),e=e.body;u.mode===`FindingSubExpr`&&(u.node=e)}}u.previousMode=`FindingOpName`;break}case`FollowingLabels`:{let r=u.node,i=r?.kind===`OpDef`||r?.kind===`ThmOrAssumpDef`||r?.kind===`Label`?r.labels.get(f.name):void 0;if(i===void 0)return e.addError(l(u.index),`Cannot find label \`${f.name}'.`);if(u.node=i,e.isOutOfLabelScope(i))return e.addError(l(u.index),`Accessing subexpression labeled \`${f.name}' of ASSUME/PROVE clause within the scope of a declaration\n from outside that declaration's scope.`);if(n===0){if(i.params.length!==d(f).length)return e.addError(l(u.index),`Label \`${f.name}' used with wrong number of arguments.`);c.push(...d(f).map(e.generateExpression))}s.push(...i.params),u.index<t.length-1&&t[u.index+1].op!==`Name`&&(u.mode=`FindingSubExpr`),u.mode===`FindingSubExpr`&&(u.node=i.body),u.previousMode=`FollowingLabels`;break}case`FindingSubExpr`:{let n=u.node,r=()=>e.addError(l(u.index),`Nonexistent operand specified by \`${Vn(f)}'.`);if(f.op===`:`){if(!(u.previousMode!==`FindingSubExpr`&&(u.index===t.length-1&&u.previousMode===`FindingOpName`||u.index<t.length-1&&t[u.index+1].op===`Name`)))return e.addError(l(u.index),`\`!:' can be used only after a name and either at the end after an
|
|
29
29
|
operator name or before an operator name.`)}else if(n===void 0)return e.addError(l(u.index),`Subexpression selection failed, probably due to an error in the selected expression.`);else if(n.kind===`LetIn`){if(Hn(f.op,1)!==1)return e.addError(l(u.index),`A LET/IN expression has only one operand.`);u.node=n.body}else if(n.kind===`OpAppl`){let i=n.operator,a=n.operands,o=i.kind===`FormalParam`||i.kind===`OpDecl`&&i.declKind===2||i.kind===`OpDef`&&i.defKind===`UserDefined`,p=()=>e.addError(l(u.index),`Internal error: Expecting $Pair and didn't find it.`),m=e=>e?.kind===`OpAppl`&&e.operator.name===`$Pair`,h=Hn(f.op,a.length);if(o){let e=Hn(f.op,i.arity);if(e===-1)return r();u.node=a[e-1]}else if(i.kind===`OpDef`&&i.defKind===`BuiltIn`){if(i.name===`$RcdConstructor`||i.name===`$SetOfRcds`){if(h===-1)return r();let e=a[h-1];if(!m(e))return p();u.node=e.operands[1]}else if(i.name===`$Case`){if(u.index===t.length-1)return e.addError(l(u.index),`Subexpression of CASE must have form !i!j.`);if(h===-1)return r();let n=a[h-1];if(!m(n))return p();u.index++;let i=Hn(t[u.index].op,2);if(i===-1)return e.addError(l(u.index),`Second selector for CASE subexpression must specify one of two operands.`);if(u.node=n.operands[i-1],u.node===void 0)return e.addError(l(u.index),`Selecting OTHER in a CASE statement.`)}else if(i.name===`$Except`){if(h>1)return e.addError(l(u.index),`Selecting subexpression of an EXCEPT not yet implemented.`);if(h===-1)return r();u.node=a[h-1]}else if((n.bounded?.length??0)===0&&(n.unbounded?.length??0)===0){if(h===-1)return r();u.node=a[h-1]}else if(f.op===`Null`||f.op===`@`){let t=Gn(n);if(s.push(...t),f.op===`Null`){if(d(f).length!==t.length)return e.addError(l(u.index),`Selector with ${d(f).length} argument(s) used for quantifier with ${t.length} bound identifier(s).`);c.push(...d(f).map(e.generateExpression))}u.node=a[0]}else{let e=Hn(f.op,n.ranges.length);if(e===-1)return r();u.node=n.ranges[e-1]}}else return e.addError(l(u.index),`Choosing operand \`${f.name}' of subexpression with no operands.`)}else if(n.kind===`AssumeProve`){if(n.isSuffices&&!u.isInSuffices){if(Hn(f.op,1)!==1)return e.addError(l(u.index),`Accessing non-existent subexpression of a SUFFICES`);u.isInSuffices=!0}else{u.isInSuffices=!1;let i=Hn(f.op,1+n.assumptions.length);if(i===-1)return r();if(e.isOutOfClauseScope(n,i))return e.addError(l(u.index),`Accessing ASSUME/PROVE clause within the scope of a declaration
|
|
30
|
-
from outside that declaration's scope.`);if(i<=n.assumptions.length){if(u.node=n.assumptions[i-1],u.node.kind===`NewSymb`&&u.index!==t.length-1)return e.addError(l(u.index),`Selected a subexpression of a NEW clause of an ASSUME.`)}else u.node=n.goal}}else if(n.kind===`OpArg`){let t=n.op;if(t.kind!==`OpDef`||t.name!==`LAMBDA`)return e.addError(l(u.index),`Trying to select subexpression of an operator argument.`);if(f.op!==`Null`&&f.op!==`@`)return e.addError(l(u.index),`Cannot use !${f.name} to select subexpression of a LAMBDA.`);if(f.op===`Null`){if(t.arity!==d(f).length)return e.addError(l(u.index),`Selector with ${d(f).length} arguments used for LAMBDA expression taking ${t.arity} arguments.`);c.push(...d(f).map(e.generateExpression))}s.push(...t.params??[]),u.node=t.body}else if(n.kind===`Label`)u.node=n.body,u.index--;else return e.addError(l(u.index),`Selecting subexpression of expression that has none.`);if(u.node===void 0)return e.addError(l(u.index),`An unexpected null node specified by '${f.name}'.\nThis is probably due to a previous error.`);if(u.index!==t.length-1){let n=t[u.index+1];if(n.op===`Name`){for(;u.node?.kind===`Label`;)u.node=u.node.body;if(u.node?.kind!==`LetIn`)return e.addError(l(u.index),`A name selector here must be from a LET clause.`);u.letInContext=u.node.context,u.mode=`FindingOpName`}else if(n.op===`:`)return e.addError(l(u.index),`!: should not follow an operand selector.`)}u.previousMode=`FindingSubExpr`;break}}u.index++}let f=u.node;if(f===void 0)return e.addError(a,`Subexpression selection failed, probably due to an error in the selected expression.`);if(f.kind===`AssumeProve`||f.kind===`NewSymb`)return r?f:e.addError(a,f.kind===`AssumeProve`?`Selected ASSUME/PROVE instead of expression.`:`Selected a NEW declaration as an expression or operator.`);if(n<0){let t=f.kind===`OpDef`&&(f.defKind===`UserDefined`||f.defKind===`NumberedProofStep`||f.defKind===`ModuleInstance`&&i)||f.kind===`ThmOrAssumpDef`;return u.previousMode!==`FindingOpName`||!t?e.addError(a,`DEF clause entry should describe a defined operator.`):f.kind===`OpDef`&&f.step!==void 0&&f.step.kind!==`DefStep`?e.addError(a,`DEF clause entry refers to a non-definition step.`):f}if(f.kind===`OpDef`&&f.defKind===`NumberedProofStep`)return e.addError(a,r?`Step number of non-fact used as a fact`:`Step number of non-expression step used as an expression.`);if(n>0){let t=s.length+(f.kind===`OpArg`?jn(f.op):u.previousMode===`FindingOpName`&&Wn(f)?jn(f):0);if(n!==t)return e.addError(a,`Expected arity ${n} but found operator of arity ${t}.`)}let p=f;if(u.previousMode===`FindingOpName`&&s.length+o.length>0){if(p.kind!==`OpDef`&&p.kind!==`ThmOrAssumpDef`)return e.addError(t[t.length-1].location??a,`Internal Error: Found unexpected node kind after FindingOpName`);c.push(...u.definitionArgs);let n=(p.params??[]).map(t=>{let n=e.createFormalParam(t.name,t.arity,t.location);return s.push(n),t.arity===0?e.createOpAppl(n,[],a):e.createOpArg(n,a)});p=e.createOpAppl(p,n,a)}if(p.kind===`OpArg`){if(n===0)return e.addError(a,`Selected operator argument when expression expected.`);if(s.length+o.length>0){let t=p.op;s.push(...Array.from({length:jn(t)},(t,n)=>e.createFormalParam(`NewParam${n}`,0,void 0))),p=e.createOpAppl(t,u.definitionArgs,a)}}if(!r){if(p.kind===`ThmOrAssumpDef`&&p.body.kind===`AssumeProve`||p.kind===`Label`&&p.isAssumeProve)return e.addError(a,`ASSUME/PROVE used where an expression is required.`);if(p.kind===`ThmOrAssumpDef`&&p.body.kind===`OpAppl`){let t=Ln.get(p.body.operator.name);if(t!==void 0)return e.addError(a,`${t} proof step selected instead of expression.`)}}if(p.kind===`FormalParam`||p.kind===`OpDecl`||p.kind===`ThmOrAssumpDef`||p.kind===`OpDef`&&(p.defKind===`UserDefined`||p.defKind===`BuiltIn`))return n>0?e.createOpArg(p,a):e.createOpAppl(p,u.definitionArgs,a);if(p.kind===`OpArg`)return p;if(p.kind===`OpDef`||p.kind===`Module`)return(r||i)&&p.kind===`OpDef`?p:e.addError(a,`Module instantiation selected instead of expression.`);let m=o.reduceRight((t,n)=>e.copySubstIn(n,t),p),h=s.length>0?e.createLambda(s,m,a):void 0;return n>0?h===void 0||s.length!==n?e.addError(a,`Expected operator argument with arity ${n} but found one of arity ${s.length}.`):e.createOpArg(h,a):s.length===c.length?h===void 0?e.createOpAppl(e.getBuiltin(`$Nop`),[m],a):e.createOpAppl(h,c,a):e.addError(a,`Expected ${s.length} arguments but found ${c.length}.`)},Jn=/* @__PURE__ */ new Map([[`(`,`)`],[`[`,`]`],[`{`,`}`],[`<<`,`>>`]]),Yn=(e,t)=>`${e}:${t}`,Xn=(e,t)=>{let r=n.
|
|
31
|
-
`&&i.push(e+1);return{name:e,source:t,tokens:r,lineOffsets:i,tokenIndexes:new Map(r.map((e,t)=>[Yn(e.line,e.column),t]))}},W=(e,t,n)=>e.tokens[t]!==void 0&&e.tokens[t].text===n&&e.tokens[t].kind!==`String`,Zn=(e,t,n)=>{let r=0,i=e.tokens.length;for(;r<i;){let a=r+i>>>1,o=e.tokens[a];o.line<t.line||o.line===t.line&&(n?o.column<=t.column:o.column<t.column)?r=a+1:i=a}return r},Qn=(e,t)=>e.tokenIndexes.get(Yn(t.line,t.column))??Math.min(Zn(e,t,!1),e.tokens.length-1),$n=(e,t)=>Math.max(Zn(e,t,!0)-1,0),er=(e,t)=>{let n=e.tokens[t].text,r=Jn.get(n);if(r===void 0)return t;let i=0;for(let a=t;a<e.tokens.length;a++)if(W(e,a,n))i++;else if(W(e,a,r)&&(i--,i===0))return a;return t},tr=(e,t)=>({start:Qn(e,t.start),end:$n(e,t.end)}),G=(e,t)=>{let n=t.location.range;if(n)return tr(e,n);let r=Qn(e,t.location);return{start:r,end:er(e,r)}},nr=(e,t)=>{let n=t.start-1,r=t.end+1;return W(e,n,`(`)&&W(e,r,`)`)&&er(e,n)===r?nr(e,{start:n,end:r}):t},rr=(e,t)=>{let n=t.start-1,r=t.end+1;return W(e,n,`(`)&&er(e,n)===r&&(W(e,n-1,`(`)||W(e,n-1,`,`))?rr(e,{start:n,end:r}):t},K=(e,t)=>({file:e.name,beginLine:e.tokens[t.start].line,beginColumn:e.tokens[t.start].column,endLine:e.tokens[t.end].line,endColumn:e.tokens[t.end].endColumn}),q=(e,t)=>K(e,{start:t,end:t}),ir=(e,t,r)=>{let i=0,a=e.lineOffsets[t];for(;a<e.source.length;){if(i=e.source[a]===` `?n.
|
|
32
|
-
`,s),t=e===-1?a.length:e+1;o.push(a.slice(s,t)),s=t}else if(a.startsWith(`(*`,s)){let e=1,t=s,n=s+2;for(;e>0&&n<a.length;){let r=a.startsWith(`(*`,n),i=a.startsWith(`*)`,n);r||i?(e+=r?1:-1,n+=2,o.push(a.slice(t,n)),t=n):n++}t<n&&o.push(a.slice(t,n)),s=n}else s++;return o},lr=(e,t,n,r)=>{let i=[];for(let a=t;a<n&&i.length<r.length;a++){let t=e.tokens[a];t.kind===`Identifier`&&t.text===r[i.length]&&i.push(a)}return i},ur=(e,t,n,r)=>{for(let i=t;i<=n;i++)if(W(e,i,r))return i;return-1},dr=new Map(n.K.flatMap(([e,...t])=>t.map(t=>[t,e]))),fr=e=>e.split(`!`).map(e=>dr.get(e)??(e===`~`?`\\lnot`:e)).join(`!`),pr={Constant:{declKind:24,level:0},Variable:{declKind:25,level:1},State:{declKind:26,level:1},Action:{declKind:27,level:2},Temporal:{declKind:28,level:3}},mr=e=>/^[A-Za-z0-9_]+$/.test(e),hr=e=>e!==`!!`&&e.includes(`!`),gr=e=>e.contexts[e.contexts.length-1],_r=(e,t)=>{for(let n=e.contexts.length-1;n>=0;n--){let r=Mn(e.contexts[n],t);if(r)return r}},vr=e=>e.kind===`OpDecl`?`${e.kind}${e.declKind}`:e.kind===`OpDef`?e.defKind:e.kind,yr=e=>e.kind===`OpDef`||e.kind===`FormalParam`?`definition`:`declaration`,br=(e,t)=>{if(e.kind===`OpDef`&&t.kind===`OpDef`){let n=e.source??e;return n===(t.source??t)?n.module===void 0||xr(n.module):!1}if(e.kind===`ThmOrAssumpDef`&&t.kind===`ThmOrAssumpDef`){let n=e.source??e;return n===(t.source??t)&&xr(n.module)}return!1},xr=e=>Fn(e,2).length===0&&Fn(e,3).length===0,Sr=e=>[...e.kind===`Let`?e.instances??[]:[],...n.Ut(e).flatMap(Sr)],Cr=e=>e.kind===`AssumeProve`?[...e.assumptions,e.conclusion].flatMap(e=>e.kind===`NewSymbol`?[]:Cr(e)):Sr(e),wr=(e,t)=>{let n=/* @__PURE__ */ new Set;for(let r of e.units)if(r.kind===`Module`&&n.add(r.module.name),r.kind===`Instance`&&r.instance.module===t)return n.has(t);return!1},Tr=e=>BigInt(e.startsWith(`\\`)?`0${e.slice(1).replace(/^h/i,`x`)}`:e).toString(),Er=e=>{let t=[],n=[],r=/* @__PURE__ */ new Map,i=(a,o)=>{let s=a===e,c=(e,t)=>e.forEach(e=>{t.push(e),r.has(e)||r.set(e,a.name)}),l=e=>!o.has(e);c(a.extends.filter(l),t),c(a.units.flatMap(e=>e.kind===`Instance`?[e.instance]:e.kind===`Definition`?Sr(e.definition.body):e.kind===`Theorem`&&s?Cr(e.theorem.statement):e.kind===`Assumption`&&s?Sr(e.assumption.expression):[]).map(e=>e.module).filter(e=>l(e)&&!wr(a,e)),n);let u=new Map(o);a.modules.forEach(e=>{let t=new Map(u),n=/* @__PURE__ */ new Set,r=e=>{n.has(e)||(n.add(e),e.extends.forEach(e=>{let n=t.get(e);n!==void 0&&(n.modules.forEach(e=>{t.has(e.name)||t.set(e.name,e)}),r(n))}))};r(e),i(e,t),u.set(e.name,e)})};return i(e,/* @__PURE__ */ new Map),{extendees:t,instancees:n,importers:r}},Dr=/* @__PURE__ */ new Set([`Identifier`,`Subexpression`,`OperatorReference`,`Lambda`]),Or=e=>{let t=e.kind===`Apply`?zn(e):void 0;return Dr.has(e.kind)||t!==void 0&&Bn(t)},kr=/* @__PURE__ */ new Map([[`Identifier`,`N_GeneralId`],[`Subexpression`,`N_GeneralId`],[`Number`,`N_Number`],[`Decimal`,`N_Real`],[`SetEnumeration`,`N_SetEnumerate`],[`SetFilter`,`N_SubsetOf`],[`SetMap`,`N_SetOfAll`],[`Tuple`,`N_Tuple`],[`FunctionApplication`,`N_FcnAppl`],[`FunctionConstruction`,`N_FcnConst`],[`FunctionSet`,`N_SetOfFcns`],[`Record`,`N_RcdConstructor`],[`RecordSet`,`N_SetOfRcds`],[`FieldAccess`,`N_RecordComponent`],[`Except`,`N_Except`],[`Prime`,`N_PostfixExpr`],[`Always`,`N_PrefixExpr`],[`Eventually`,`N_PrefixExpr`],[`Enabled`,`N_PrefixExpr`],[`Unchanged`,`N_PrefixExpr`],[`Forall`,`N_BoundedQuant`],[`Exists`,`N_BoundedQuant`],[`UnboundedQuantifier`,`N_UnboundedQuant`],[`Choose`,`N_UnBoundedOrBoundedChoose`],[`If`,`N_IfThenElse`],[`Case`,`N_Case`],[`Let`,`N_LetIn`],[`BoxAction`,`N_ActionExpr`],[`AngleAction`,`N_ActionExpr`],[`WeakFairness`,`N_FairnessExpr`],[`StrongFairness`,`N_FairnessExpr`]]),Ar=/* @__PURE__ */ new Set([`N_GeneralId`,`N_OpApplication`,`N_PrefixExpr`,`N_InfixExpr`,`N_PostfixExpr`,`N_FcnAppl`,`N_RecordComponent`]),jr=/* @__PURE__ */ new Set([`'`,`^+`,`^*`,`^#`]),Mr=(e,t)=>jr.has(t)?`N_GenPostfixOp`:e.kind===`Lambda`||t===`~`||t===`-.`?`N_GenNonExpPrefixOp`:`N_GenInfixOp`,Nr=(e,r,i={})=>{let a=[],o=(e,t)=>vn(a,{location:e,text:t,isWarning:!1}),s=(e,t)=>vn(a,{location:e,text:t,isWarning:!0}),c={value:i.version===`1.7.4`?-1:0},l=()=>++c.value,u={id:0},d=(e,t)=>{let n=_r(e,t.name);if(n===t)return;if(n===void 0){An(gr(e),t);return}let r=t.kind===`FormalParam`||vr(n)!==vr(t)||jn(n)!==jn(t);n.kind===`OpDef`&&n.defKind===`BuiltIn`&&!(r&&i.version===`1.7.4`)?o(t.location,`Symbol ${t.name} is a built-in operator, and cannot be redefined.`):r?o(t.location,`Multiply-defined symbol '${t.name}': this definition or declaration conflicts \nwith the one at ${yn(n.location)}.`):br(t,n)||s(t.location,`Multiple declarations or definitions for symbol ${t.name}. \nThis duplicates the one at ${yn(n.location)}.`)};i.version!==`1.7.4`&&_n(l);let f=_n(l);l();let p=new Map(f.map(e=>[e.name,e])),m=/* @__PURE__ */ new Map,h=/* @__PURE__ */ new Map,g=(e,r)=>{let a=e===i.rootFileName&&i.rootFilePath||`${e}.tla`,o=n=>new t.T(`Could not parse module ${e} from file ${a}`,e,n),s=i.version===`1.7.4`?n.Kt(r):void 0;if(s!==void 0)throw o(s);try{return n.U(sr(r))}catch(e){throw e instanceof t.D?o(n.G(r)??`***Parse Error***\n${e.message}`):e}},_=(e,n,r)=>{let a=h.get(e);if(a)return a;if(n===void 0)throw new t.x(e,r,i.version!==`1.7.4`);i.onParse?.(e);let o=g(e,n);if(o.name!==e)throw new t.T(`File name '${e}' does not match the name '${o.name}' of the top level module it contains.`,void 0);let s={file:Xn(o.name,n),module:o};return h.set(e,s),s},v=[],y=/* @__PURE__ */ new Set,b=[],x=(e,n,i)=>{let a=b.indexOf(e);if(a!==-1)throw new t.T(`Circular dependency among .tla files; dependency cycle is:\n\n ${[...b.slice(a),e].map(e=>`${e}.tla`).join(` --> `)}`,void 0);if(y.has(e))return;y.add(e),b.push(e);let o=D(e,_(e,n,i).module);[...o.extendees,...o.instancees].forEach(t=>x(t,r(t),e)),b.pop(),v.push(e)},S=/* @__PURE__ */ new Set,C=(e,t)=>S.has(`${e} ${t}`),w=(e,t,n)=>{let r=h.get(e);if(!r||n.has(e))return;n.add(e);let i=D(e,r.module),a=i[t].find(t=>!C(e,t));if(a!==void 0)return{name:a,importer:e,namingModule:i.importers.get(a)??e};for(let r of[...i.extendees,...i.instancees]){let i=C(e,r)?w(r,t,n):void 0;if(i)return i}},T=t=>{_(t,e);let n=()=>w(t,`extendees`,/* @__PURE__ */ new Set)??w(t,`instancees`,/* @__PURE__ */ new Set);for(let e=n();e!==void 0;e=n())h.has(e.name)||_(e.name,r(e.name),e.namingModule),S.add(`${e.importer} ${e.name}`)},E=i.rootFileName??g(``,e).name,D=(e,t)=>{let n=Er(t);return e!==E||i.rootExtendees===void 0||(n.extendees.splice(t.extends.length,0,...i.rootExtendees),i.rootExtendees.forEach(t=>{n.importers.has(t)||n.importers.set(t,e)})),n};T(E),x(E,e);let O=(e,n,r,a)=>{let c={curLevel:0,unresolvedCount:[0],unresolvedSum:0,recursiveSectionCount:0},f=[],h=[],g=[],_=[],v=/* @__PURE__ */ new WeakSet,y=()=>_.push({labels:/* @__PURE__ */ new Map,params:[]}),b=()=>_.pop()?.labels??/* @__PURE__ */ new Map,x={depth:0,isDeclared:[],goal:void 0,goalClause:0},S=/* @__PURE__ */ new WeakMap,C=/* @__PURE__ */ new WeakMap,w=e=>{let t=e.kind===`AssumeProve`?S.get(e):void 0;t&&(t.isInProof=!1)},T=e=>K(n,G(n,e)),E=e=>e.range?tr(n,e.range):{start:Qn(n,e),end:Qn(n,e)},D={kind:`Module`,id:l(),name:e.name,location:K(n,E(e.location)),extendees:[],context:gr(a),topLevel:[],definitions:[],opDefsInRecursiveSection:[],isLevelChecked:!1,levelCorrect:!0,argLevelParams:/* @__PURE__ */ new Map,levelConstraints:/* @__PURE__ */ new Map,argLevelConstraints:/* @__PURE__ */ new Map,records:[]};r&&r.definitions.push(D);let ee=e=>{for(let t=a.contexts.length-1;t>=0;t--){let n=Nn(a.contexts[t],e);if(n?.kind===`Module`)return n}return m.get(e)},te=e=>{let n=ee(e);if(n===void 0)throw new t.D(`Could not find module ${e}`);return n},k=(e,t)=>{a.contexts.push(e);let n=t();return a.contexts.pop(),n},A=(e,t,n,r)=>{let i={...H(l()),kind:`FormalParam`,name:e,arity:t,location:n};return r&&d(a,i),i},j=e=>({...H(l()),kind:`OpDef`,defKind:`UserDefined`,arity:e.params?.length??0,params:[],body:void 0,isLocal:!1,module:D,source:void 0,preComments:[],isDefined:!0,inRecursive:!1,inRecursiveSection:!1,recursiveSection:-1,letInLevel:0,weights:(e.params??[]).map(()=>0),isLeibnizArg:(e.params??[]).map(()=>!0),isLeibniz:!0,opLevelCond:void 0,maxLevels:(e.params??[]).map(()=>3),minMaxLevel:void 0,labels:/* @__PURE__ */ new Map,step:void 0,...e}),ne=e=>{e.letInLevel=c.curLevel,c.unresolvedSum>0&&(e.recursiveSection=c.recursiveSectionCount,e.inRecursiveSection=c.unresolvedCount[c.curLevel]>0,D.opDefsInRecursiveSection.push(e))},re=(e,t,n,r={},i=l())=>({...H(i),kind:`OpAppl`,operator:e,operands:t,unbounded:r.unbounded,bounded:r.bounded,tupleOrs:r.tupleOrs,ranges:r.ranges??[],location:n}),M=()=>({...re(ie(`$Nop`),[],gn,{},u.id),isNull:!0}),ie=e=>{let n=p.get(e);if(!n)throw new t.k(`SANY has no builtin operator ${e}`);return n},N=(e,t,n,r={})=>re(ie(e),t,n,r),ae=(e,t)=>({...H(l()),kind:`String`,value:e,location:t}),oe=(e,t)=>({...H(l()),kind:`OpArg`,op:e,location:t}),se=(e,n)=>{let r=_r(a,fr(e));if(r===void 0||r.kind===`Module`)throw new t.D(`Unknown operator: \`${e}' at line ${n.beginLine}, column ${n.beginColumn} of module ${n.file}`);return r},ce=(e,t,n)=>{if(e.kind!==`OpDef`||e.defKind!==`UserDefined`)return;let r=e.params??[];r.length===t.length?r.forEach((r,i)=>{let a=t[i];r.arity===0&&a.kind===`OpArg`&&o(n,`Operator used in argument number ${i+1} has incorrect number of arguments.`);let s=a.kind===`OpArg`&&jn(a.op)===r.arity&&!(a.op.kind===`OpDef`&&(a.op.params??[]).some(e=>e.arity>0));r.arity>0&&!s&&o(n,`Argument number ${i+1} to operator '${e.name}' \nshould be a ${r.arity}-parameter operator.`)}):o(n,`Wrong number of arguments (${t.length}) given to operator '${e.name}', \nwhich requires ${r.length} arguments.`)},le=qn({version:i.version,resolveSymbol:e=>_r(a,e),resolveSynonym:fr,generateExpression:e=>L(e),generateArgument:(e,t,n,r)=>ve(e,t,n,r),createOpAppl:(e,t,n)=>{let r=re(e,t,n);return ce(e,t,n),r},createOpArg:oe,createFormalParam:(e,t,n)=>A(e,t,n,!1),createLambda:(e,t,r)=>j({name:`LAMBDA`,params:e,body:t,location:r,preComments:cr(n,Qn(n,{line:r.beginLine,column:r.beginColumn}))}),copySubstIn:(e,t)=>Be(`SubstIn`,e.substs,t,e.instantiatedModule,e.location,e.instantiatingModule),getBuiltin:ie,addError:(e,t)=>(o(e,t),M()),isOutOfLabelScope:e=>{let t=C.get(e);return t!==void 0&&t.scope.isDeclaredBefore[t.clause]&&t.scope.isSuffices===t.scope.isInProof},isOutOfClauseScope:(e,t)=>{let n=S.get(e);return n!==void 0&&n.isDeclaredBefore[t-1]&&(!n.hasGoal||n.isSuffices===n.isInProof)}}),ue=(e,t)=>{let r={value:t.start};return e.map(e=>{let i=e.op===`Name`?e.name:e.op===`Null`?`(`:String(e.op),a=ur(n,r.value,t.end,i);if(a===-1)return e;if(e.op===`Null`){let t=er(n,a);return r.value=t+1,{...e,location:K(n,{start:a,end:t})}}r.value=a+1;let o=q(n,a);if(e.args===void 0||!W(n,a+1,`(`))return{...e,location:o};let s=er(n,a+1);return r.value=s+1,{...e,location:o,argsLocation:K(n,{start:a+1,end:s})}})},de=(e,r,i,a)=>{let o=zn(e);if(o===void 0)throw new t.D(`Expected a name, found ${e.kind}`);return le(ue(o,G(n,e)),r,i,a,T(e))},fe=e=>{let n=de(e,0,!1,!1);if(n.kind!==`OpAppl`)throw new t.D(`Expected an expression`);return n},pe=e=>{if(e.kind!==`OpAppl`)return;let t=f.find(t=>t.name===e.operator.name);t&&(t.node.operator=ie(`$RecursiveFcnSpec`))},me=e=>e.reduce((e,t)=>{let n=e[e.length-1];return n!==void 0&&n[0].set===t.set&&t.pattern.kind===`Name`&&n[0].pattern.kind===`Name`?n.push(t):e.push([t]),e},[]),P=(e,t)=>R(e,t,me(e).map(e=>L(e[0].set))),F=(e,t)=>{let n=_.at(-1);n?.params.push(e);let r=L(t);return n?.params.pop(),r},he=e=>{let t=G(n,e),r=lr(n,t.start,t.end,e.params);return k(U(),()=>{let i=e.params.map((e,t)=>A(e,0,q(n,r[t]),!0)),a=F(i,e.body);return j({name:`LAMBDA`,params:i,body:a,location:K(n,t),preComments:cr(n,t.start)})})},ge=e=>e.kind===`OperatorReference`?e.operator:e.kind===`Lambda`&&e.body.kind===`Apply`?e.body.operator:n.tokens[Qn(n,e.location)].text,_e=(e,n)=>{let r=T(e);if(e.kind===`Lambda`)return e.location.range===void 0?oe(se(ge(e),r),r):oe(he(e),r);if(!Or(e))return o(r,`Arity ${n.arity} operator (not an expression) is expected \nto substitute for CONSTANT '${n.name}'.`),M();if(e.kind===`OperatorReference`)return oe(se(e.operator,r),r);let i=de(e,n.arity,!1,!1);if(i.kind===`OpArg`||i.kind===`OpAppl`&&i.isNull===!0)return i;throw new t.D(`Expected an operator argument at line ${r.beginLine}, column ${r.beginColumn}`)},ve=(e,r,i,s)=>{let c=e.kind===`OpDef`&&(e.defKind===`UserDefined`||e.defKind===`ModuleInstance`)?e.params?.[r]?.arity??0:0;if(c===0)return L(i);let l=G(n,i),u=K(n,l),d=`${r+1} (counting from 1)`,f=rr(n,l);if(f!==l||!Or(i))return o(K(n,f),`An expression appears as argument number ${d} to operator '${e.name}', in a position an operator is required.`),M();if(i.kind===`Identifier`||i.kind===`Subexpression`||i.kind===`Apply`){let e=de(i,c,!1,!1);if(e.kind===`OpArg`||e.kind===`OpAppl`)return e;throw new t.D(`Expected an operator argument at ${yn(u)}`)}if(i.kind===`Lambda`&&i.location.range!==void 0){let t=he(i),n=jn(t);return n===c?oe(t,u):(o(s,`Lambda expression with arity ${n} used as argument ${r+1} of operator \`${e.name}', \nbut an operator of arity ${c} is required.`),M())}let p=ge(i),m=_r(a,fr(p));if(m===void 0)return o(u,`Could not find declaration or definition of symbol '${p}'.`),M();let h=jn(m);return h===c?oe(m,u):(o(s,`Operator with incorrect arity passed as argument. \nOperator '${m.name}' of arity ${h} is argument number ${d} to operator \`${yn(e.location)}', \nbut an operator of arity ${c} was expected.`),M())},ye=e=>{let t=T(e);if(e.isBulleted)return N(e.kind===`And`?`$ConjList`:`$DisjList`,e.operands.map(L),t);let r=G(n,e),i=e.kind===`And`?`\\land`:`\\lor`,[a,...o]=e.operands;return o.reduce((e,t,a)=>{let s=nr(n,G(n,t)),c=a===o.length-1?r.end:s.end;return N(i,[e,L(t)],K(n,{start:r.start,end:c}))},L(a))},be=e=>{let t=G(n,e),r=e.arms.map((r,i)=>{let a=nr(n,G(n,r.condition)),o=i===e.arms.length-1&&e.other===void 0,s=nr(n,G(n,r.body)),c=[L(r.condition),L(r.body)];return N(`$Pair`,c,K(n,{start:a.start,end:o?t.end:s.end}))}),i=e.other;if(i){let e=nr(n,G(n,i)),a=xe(e.start,`OTHER`);r.push(N(`$Pair`,[void 0,L(i)],K(n,{start:a,end:t.end})))}return N(`$Case`,r,K(n,t))},xe=(e,t)=>{for(let r=e;r>=0;r--)if(W(n,r,t))return r;return e},Se=e=>{let t=G(n,e),r=K(n,t),i=[L(e.function)],a=N(`$Except`,i,r),o=G(n,e.function),s={value:ur(n,o.end+1,t.end,`EXCEPT`)+1};return e.updates.forEach(e=>{let r=ur(n,s.value,t.end,`!`),o=nr(n,G(n,e.value)),c=K(n,{start:r,end:o.end}),l={value:r+1},u=e.path.map(e=>{if(e.kind===`Field`){let t=Ce(l.value,e.name);return l.value=t+1,ae(e.name,q(n,t))}let r=ur(n,l.value,t.end,`[`),i=er(n,r);return l.value=i+1,e.args.length===1?L(e.args[0]):N(`$Tuple`,e.args.map(L),K(n,{start:r,end:i}))}),d=N(`$Seq`,u,c),f=N(`$Pair`,[d],c);g.push(f),h.push(a),f.operands.push(L(e.value)),g.pop(),h.pop(),i.push(f),s.value=o.end+1}),a},Ce=(e,t)=>{for(let r=e;r<n.tokens.length;r++)if(n.tokens[r].text===t&&n.tokens[r].kind!==`String`)return r;return e},we=(e,t)=>{let r=G(n,t),i={value:r.start+1},a=t.fields.map((e,r)=>{let a=Ce(i.value,e.name),s=nr(n,G(n,e.value));return i.value=s.end+1,t.fields.slice(0,r).some(t=>t.name===e.name)&&o(q(n,a),`Non-unique fields in constructor.`),N(`$Pair`,[ae(e.name,q(n,a)),L(e.value)],K(n,{start:a,end:s.end}))}),s=N(e,a,K(n,r));return D.records.push(s),s},Te=e=>({line:n.tokens[e].line,column:n.tokens[e].column}),Ee=e=>{let t=[],r=e;for(;n.tokens[r]?.kind===`Identifier`;){let e=W(n,r+1,`(`)?er(n,r+1):r,i=n.tokens.slice(r+1,e).filter(e=>e.text===`_`).length;if(t.push({name:n.tokens[r].text,arity:i,location:{...Te(r),range:{module:n.name,start:Te(r),end:Te(e)}}}),!W(n,e+1,`,`))break;r=e+2}return t},De=e=>{let t=[...e.definitions.map(e=>({unit:{kind:`Definition`,definition:e},span:Me(e)})),...(e.instances??[]).map(e=>({unit:{kind:`Instance`,instance:e},span:Me(e)}))],r=G(n,e).start,i=nr(n,G(n,e.body)).start,a=[];for(let e=r+1;e<i;e++){let r=t.some(t=>t.span.start<=e&&e<=t.span.end);W(n,e,`RECURSIVE`)&&!r&&a.push({unit:{kind:`Recursive`,declarations:Ee(e+1)},span:{start:e,end:e}})}return[...t,...a].toSorted((e,t)=>e.span.start-t.span.start).map(e=>e.unit)},I=e=>{let t=U();return k(t,()=>{c.curLevel++,c.unresolvedCount[c.curLevel]=0;let n=[],r=[];De(e).forEach(e=>{e.kind===`Recursive`?Le(e.declarations):e.kind===`Instance`?Ve(e.instance,n,r):e.definition.kind===`Function`?Fe(e.definition,n):Ne(e.definition,n)}),Re(),c.curLevel=Math.max(c.curLevel-1,0);let i=L(e.body);return{...H(l()),kind:`LetIn`,opDefs:n,instances:r,body:i,context:t,location:T(e)}})},Oe=e=>{let t=G(n,e),r=K(n,t);return k(U(),()=>{let i=e.pattern,a=i.kind===`Name`?[i.name]:i.names;if(e.set===void 0){let o=lr(n,t.start,t.end,a),s=a.map((e,r)=>A(e,0,q(n,i.kind===`Name`?t.start:o[r]),!0)),c=F(s,e.body);return N(`$UnboundedChoose`,[c],r,{unbounded:s})}let o=L(e.set),s=G(n,e.set),c=lr(n,t.start,s.start,a),l=a.map((e,t)=>A(e,0,q(n,c[t]),!0)),u=F(l,e.body);return N(`$BoundedChoose`,[u],r,{bounded:[l],tupleOrs:[i.kind===`Tuple`],ranges:[o]})})},ke=e=>{if(mr(e.operator)||hr(e.operator)||e.args.length>2||_r(a,fr(e.operator))!==void 0)return;let t=G(n,e);if(n.tokens[t.start].text===e.operator&&W(n,t.start+1,`(`))return;let r=nr(n,G(n,e.args[0])),i=e.args.length===1&&r.start!==t.start,o=i?t.start:r.end+1,s=ar(n,o);return{index:o,name:i&&s===`-`?`-.`:s,fixity:i?`prefix`:e.args.length===2?`infix`:`postfix`}},L=e=>{let t=T(e);switch(e.kind){case`Number`:return{...H(l()),kind:`Numeral`,value:Tr(e.text??String(e.value)),location:t};case`Decimal`:{let[n,r]=e.text.split(`.`),i=BigInt(n+r),a=i<=9223372036854775807n;return{...H(l()),kind:`Decimal`,mantissa:i.toString(),exponent:String(a?-r.length:r.length),integralPart:n,fractionalPart:r,location:t}}case`String`:return ae(e.value,t);case`Identifier`:{let t=fe(e);return pe(t),t}case`Apply`:{let r=ke(e);if(r!==void 0)return o(q(n,r.index),`Could not find declaration or definition of symbol '${r.name}'.`),o(t,`Couldn't resolve ${r.fixity} operator symbol \`${r.name}'.`),{...M(),isAbsent:!0};let i=fe(e);return(hr(e.operator)||mr(e.operator))&&pe(i),i}case`Bracket`:return o(q(n,G(n,e).start),"Unsupported expression type `['."),{...M(),isAbsent:!0};case`OperatorReference`:case`Lambda`:{let r=n.tokens[G(n,e).start].text;return o(t,r===`LAMBDA`?`LAMBDA expression used where an expression is required.`:`Unsupported expression type \`${Mr(e,r)}'.`),{...M(),isAbsent:!0}}case`And`:case`Or`:return ye(e);case`Prime`:return N(`'`,[L(e.expression)],t);case`Unchanged`:return N(`UNCHANGED`,[L(e.expression)],t);case`Enabled`:return N(`ENABLED`,[L(e.expression)],t);case`Always`:return N(`[]`,[L(e.expression)],t);case`Eventually`:return N(`<>`,[L(e.expression)],t);case`If`:return N(`$IfThenElse`,[L(e.condition),L(e.consequent),L(e.alternative)],t);case`Case`:return be(e);case`Let`:return I(e);case`Forall`:case`Exists`:{let r=G(n,e);return k(U(),()=>{let n=P(e.bounds,r.start),i=F(n.bounded.flat(),e.body);return N(e.kind===`Forall`?`$BoundedForall`:`$BoundedExists`,[i],t,n)})}case`UnboundedQuantifier`:{let r=G(n,e),i=G(n,e.body),a=lr(n,r.start,i.start,e.names),o=e.isTemporal?e.quantifier===`Forall`?`$TemporalForall`:`$TemporalExists`:e.quantifier===`Forall`?`$UnboundedForall`:`$UnboundedExists`;return k(U(),()=>{let r=e.names.map((e,t)=>A(e,0,q(n,a[t]),!0)),i=F(r,e.body);return N(o,[i],t,{unbounded:r})})}case`Choose`:return Oe(e);case`SetEnumeration`:return N(`$SetEnumerate`,e.elements.map(L),t);case`Tuple`:return N(`$Tuple`,e.elements.map(L),t);case`SetFilter`:{let r=L(e.bound.set),i=G(n,e);return k(U(),()=>{let n=R([e.bound],i.start,[r]),a=F(n.bounded.flat(),e.predicate);return N(`$SubsetOf`,[a],t,n)})}case`SetMap`:{let r=G(n,e.expression);return k(U(),()=>{let n=P(e.bounds,r.end+1),i=F(n.bounded.flat(),e.expression);return N(`$SetOfAll`,[i],t,n)})}case`FunctionConstruction`:{let r=G(n,e);return k(U(),()=>{let n=P(e.bounds,r.start),i=F(n.bounded.flat(),e.body);return N(`$FcnConstructor`,[i],t,n)})}case`FunctionSet`:return N(`$SetOfFcns`,[L(e.domain),L(e.range)],t);case`Record`:return we(`$RcdConstructor`,e);case`RecordSet`:return we(`$SetOfRcds`,e);case`Except`:return Se(e);case`ExceptAt`:{let e=h[h.length-1],n=g[g.length-1];return e===void 0||n===void 0?(o(t,`@ used where its meaning is not defined.`),M()):{...H(l()),kind:`At`,except:e,component:n,location:n.location}}case`FunctionApplication`:{let n=L(e.function);if(bn(n))return n;pe(n);let r=e.args.length===1?L(e.args[0]):N(`$Tuple`,e.args.map(L),t);return N(`$FcnApply`,[n,r],t)}case`FieldAccess`:{let r=L(e.record),i=G(n,e);return N(`$RcdSelect`,[r,ae(e.field,q(n,i.end))],t)}case`Product`:return N(`$CartesianProd`,e.factors.map(L),t);case`BoxAction`:case`AngleAction`:return N(e.kind===`BoxAction`?`$SquareAct`:`$AngleAct`,[L(e.action),L(e.subscript)],t);case`WeakFairness`:case`StrongFairness`:return N(e.kind===`WeakFairness`?`$WF`:`$SF`,[L(e.subscript),L(e.action)],t);case`Label`:return Ae(e);case`Subexpression`:return fe(e)}},R=(e,t,r)=>{let i=me(e),a={value:t};return{bounded:i.map(e=>{let t=G(n,e[0].set),r=e.flatMap(e=>e.pattern.kind===`Name`?[e.pattern.name]:e.pattern.names),i=lr(n,a.value,t.start,r);return a.value=t.end+1,r.map((e,t)=>A(e,0,q(n,i[t]),!0))}),tupleOrs:i.map(e=>e[0].pattern.kind===`Tuple`),ranges:r}},Ae=e=>{let t=T(e),r=_.at(-1);if(r===void 0)return o(t,`Label not in definition or proof step.`),M();if(x.isDeclared.slice(2,x.depth+1).some(Boolean))return o(t,`Label not allowed within scope of declaration in nested ASSUME/PROVE.`),M();if(h.length>0&&g.length>0)return o(t,`Labels inside EXCEPT clauses are not yet implemented.`),M();y();let i=L(e.body),s=b(),c=lr(n,G(n,e).start,G(n,e.body).start,e.params),u=e.params.map((t,r)=>{let i=_r(a,t);if(i?.kind===`FormalParam`)return i;let s=q(n,c[r]);return o(s,`Illegal parameter ${t} of label \`${e.name}'.`),A(t,0,s,!1)}),d={...H(l()),kind:`Label`,name:e.name,params:u,body:i,labels:s,isAssumeProve:!1,location:t},f=/* @__PURE__ */ new Set;if(u.forEach(e=>{f.has(e)&&o(t,`Repeated formal parameter ${e.name} \nin label \`${d.name}'.`),f.add(e)}),r.params.flat().forEach(e=>{f.delete(e)||o(t,`Label ${d.name} must contain formal parameter \`${e.name}'.`)}),f.size>0){let e=[...f].map(e=>`${e.name} `).join(``);o(t,`Label ${d.name} declares extra parameter(s) ${e}`)}r.labels.has(d.name)?o(t,`Duplicate label \`${d.name}'.`):r.labels.set(d.name,d);let p=x.goal;return p&&C.set(d,{scope:p,clause:x.goalClause}),d},je=(e,t,r)=>{let i={value:t.start};return e.params.map(e=>{let t=e.location?Qn(n,e.location):Ce(i.value,e.name),a=z(t,e.arity);return i.value=a.end+1,A(fr(e.name),e.arity,K(n,a),r)})},Me=e=>{let t=E(e.location);return e.isLocal&&!W(n,t.start,`LOCAL`)&&W(n,t.start-1,`LOCAL`)?{start:t.start-1,end:t.end}:t},Ne=(e,t)=>{let r=Me(e),i=K(n,r),s=fr(e.name),l={start:e.isLocal?r.start+1:r.start,end:r.end},u=k(U(),()=>{let t=je(e,l,!0),n=_r(a,s);if(n?.kind===`OpDef`&&n.inRecursive&&!n.isDefined){let e=n.params?.length===t.length&&(t.length===0||t[t.length-1].arity===0);n.letInLevel===c.curLevel?e||o(i,`Definition of ${n.name} has different arity than its RECURSIVE declaration.`):o(i,`Recursive operator ${s} defined at wrong LET/IN level.`)}else n!==void 0&&o(i,`Operator ${s} already defined or declared.`);return y(),{params:t,body:L(e.body),existing:n}}),f=b(),p=u.existing,m=u.params,h=cr(n,r.start);if(p?.kind===`OpDef`&&p.inRecursive&&!p.isDefined&&p.letInLevel===c.curLevel){p.params=m,p.weights=m.map(()=>0),p.maxLevels=m.map(()=>3),p.isLeibnizArg=m.map(()=>!0),p.labels=f,Pe(p,u.body,i,h),D.definitions.push(p),t?.push(p);return}let g=j({name:s,params:m,body:u.body,isLocal:e.isLocal,location:i,preComments:h,labels:f});d(a,g),ne(g),D.definitions.push(g),t?.push(g)},Pe=(e,t,n,r)=>{e.isDefined=!0,e.body=t,e.location=n,e.preComments=r,e.inRecursive&&(c.unresolvedCount[c.curLevel]--,c.unresolvedSum--)},Fe=(e,t)=>{let r=Me(e),i=K(n,r),s=U(),l=e.isLocal?r.start+1:r.start,u=k(s,()=>P(e.bounds,l+1)),p=_r(a,e.name),m=k(s,()=>A(e.name,0,i,p===void 0)),h=N(`$NonRecursiveFcnSpec`,[],i,{unbounded:[m],...u}),g=p?.kind===`OpDef`&&p.inRecursive&&!p.isDefined,_=g&&p.letInLevel===c.curLevel;_?p.arity!==0&&o(i,`Function ${p.name} has operator arguments in its RECURSIVE declaration.`):g?o(i,`Recursive function ${e.name} defined at wrong LET/IN level.`):p!==void 0&&o(i,`Function name \`${e.name}' already defined or declared.`);let v=cr(n,r.start),x=p===void 0?j({name:e.name,params:[],body:h,isLocal:e.isLocal,location:i,preComments:v}):p.kind===`OpDef`&&(_||!g)?p:void 0;_?p.arity===0&&Pe(p,h,i,v):p===void 0&&x!==void 0&&(d(a,x),ne(x)),x!==void 0&&(D.definitions.push(x),t?.push(x)),f.unshift({name:e.name,node:h}),y();let S=()=>F(u.bounded.flat(),e.body),C=x===void 0?S():k(s,S),w=b();x!==void 0&&(x.labels=w),f.shift(),h.operands=[C],h.operator.name===`$NonRecursiveFcnSpec`&&(h.unbounded=void 0)},Ie=[],Le=e=>{c.unresolvedSum===0&&c.recursiveSectionCount++,c.unresolvedCount[c.curLevel]+=e.length,c.unresolvedSum+=e.length,e.forEach(e=>{let t=ut(e);l();let r=Array.from({length:e.arity},()=>A(``,0,void 0,!1)),i=j({name:fr(e.name),params:r,location:K(n,t),isDefined:!1,inRecursive:!0,inRecursiveSection:!0,recursiveSection:c.recursiveSectionCount,letInLevel:c.curLevel});d(a,i),Ie.push(i),D.opDefsInRecursiveSection.push(i)})},Re=()=>{c.unresolvedCount[c.curLevel]!==0&&(Ie.filter(e=>e.letInLevel===c.curLevel&&!e.isDefined).forEach(e=>o(e.location,`Symbol ${e.name} declared in RECURSIVE statement but not defined.`)),c.unresolvedSum-=c.unresolvedCount[c.curLevel])},ze=(e,t,r)=>{l();let s=Dn(t.table).filter(e=>e.kind===`OpDecl`),c=s.flatMap(e=>{let t=_r(a,e.name);return t===void 0?[]:[{op:e,expr:e.declKind===3||e.declKind===2&&e.arity===0?re(t,[],r):oe(t,r),isImplicit:!0}]}),u=(e,t)=>{let n=t.kind===`OpArg`?jn(t.op):0,r=e.arity>0&&t.kind===`OpAppl`&&t.isNull===!0;n!==e.arity&&!r&&o(t.location,`An operator must be substituted for symbol '${e.name}', and it must have arity ${e.arity}.`)},d=Me(e),f={value:ur(n,d.start,d.end,`WITH`)+1};return e.substitutions.forEach(e=>{let i=ur(n,f.value,d.end,e.name);i!==-1&&(f.value=G(n,e.expression).end+1);let a=Mn(t,fr(e.name));if(a?.kind!==`OpDecl`){o(i===-1?r:q(n,i),`Identifier '${i===-1?e.name:ar(n,i)}' 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 s=a.arity===0?L(e.expression):_e(e.expression,a);u(a,s);let l=c.find(e=>e.op.name===a.name);l&&!l.isImplicit?o(T(e.expression),`Multiple substitutions for symbol '${a.name}' in substitution.`):l?(l.expr=s,l.isImplicit=!1):c.push({op:a,expr:s,isImplicit:!1})}),c.filter(e=>e.isImplicit&&i.version!==`1.7.4`).forEach(e=>u(e.op,e.expr)),s.filter(e=>!c.some(t=>t.op.name===e.name)).forEach(e=>o(r,`Substitution missing for symbol ${e.name} declared at ${yn(e.location)} \nand instantiated in module ${D.name}.`)),c},Be=(e,t,n,r,i,a=D)=>(bn(n)&&o(i,e===`SubstIn`?`Substitution error, probably due to error
|
|
33
|
-
in module being instantiated.`:`Substitution error, probably due to error in module being instantiated.`),{...H(l()),kind:e,substs:t,body:n,instantiatingModule:a,instantiatedModule:r,location:i}),Ve=(e,t,r)=>{let o=Me(e),s=K(n,o),c=cr(n,o.start),u=e.name??``,f=U(),p=e.isLocal?o.start+1:o.start;e.params.length>0&&a.contexts.push(f);let m=je(e,{start:p,end:o.end},e.params.length>0),h=te(e.module),g=h.context,_=ze(e,g,s);e.params.length>0&&a.contexts.pop(),Dn(g.table).forEach(n=>{if(n.kind!==`OpDef`||n.isLocal||n.defKind!==`UserDefined`&&n.defKind!==`ModuleInstance`)return;let r=[...m,...n.params??[]],i=`${u}!${n.name}`,o=n.defKind===`UserDefined`?j({name:i,params:r,body:_.length>0&&n.body?Be(`SubstIn`,_,n.body,h,s):n.body,isLocal:e.isLocal,location:s,source:n.source??n,preComments:c,labels:n.labels}):j({defKind:`ModuleInstance`,name:i,params:r,isLocal:e.isLocal,location:s,module:n.module,source:n.source??n,preComments:c});d(a,o),n.defKind===`UserDefined`&&ne(o),(t??D.definitions).push(o)}),Dn(g.table).forEach(n=>{if(n.kind!==`ThmOrAssumpDef`||n.isLocal)return;let r=_.length>0?Be(`APSubstIn`,_,n.body,h,s):n.body,i={...H(l()),kind:`ThmOrAssumpDef`,name:`${u}!${n.name}`,isTheorem:n.isTheorem,body:r,params:[...m,...n.params],isLocal:e.isLocal,location:s,module:D,source:n.source??n,labels:n.labels,isLeibnizArg:[],isLeibniz:!1,opLevelCond:[],maxLevels:[],minMaxLevel:[]};d(a,i),(t??D.definitions).push(i)});let v={...H(l()),kind:`Instance`,name:u,isLocal:e.isLocal,params:m,module:h,substs:_,location:s};(r??D.topLevel).push(v);let y=j({defKind:`ModuleInstance`,name:u,params:m,isLocal:e.isLocal,location:s,preComments:c});d(a,y),i.version!==`1.7.4`&&t?.push(y)},He=(e,t=!0,r)=>{let i=Me(e),o=r??K(n,i),s=cr(n,i.start),c=te(e.module),u=c.context,f=ze(e,u,o),p=e.isLocal,m=xr(c);Dn(u.table).forEach(e=>{if(e.kind!==`OpDef`||e.defKind!==`UserDefined`||e.isLocal)return;let t=(t,n)=>{let r=j({name:e.name,params:e.params,body:n,isLocal:p,location:o,module:t,source:e.source??e,preComments:s,labels:e.labels});return d(a,r),r},n=()=>(d(a,e),e),r=e.module===void 0||xr(e.module),i=m||r?p?t(e.module,e.body):n():t(D,e.body&&Be(`SubstIn`,f,e.body,c,o));D.definitions.push(i),ne(i)}),Dn(u.table).forEach(e=>{if(e.kind!==`ThmOrAssumpDef`||e.isLocal)return;let n=(t,n)=>{let r={...e,...H(l()),body:n,isLocal:p,location:o,module:t,source:e.source??e};return d(a,r),r},r=m?p?n(e.module,e.body):(d(a,e),e):xr(e.module)?p?n(D,e.body):e:n(D,Be(`APSubstIn`,f,e.body,c,o));t&&D.definitions.push(r)});let h={...H(l()),kind:`Instance`,name:void 0,isLocal:p,params:[],module:c,substs:f,location:o};return t&&D.topLevel.push(h),h},Ue=e=>{let t=ee(e.name)??(e.name===D.name?D:void 0);return t===void 0?(o(q(n,Qn(n,e.location)+1),`Module \`${e.name}' used without being extended or instantiated.`),[]):[t]},We=e=>e.flatMap(e=>{if(e.kind===`ModuleFact`)return Ue(e);let n=zn(e);if(n===void 0||!Bn(n))return[L(e)];let r=de(e,0,!0,!1);if(r.kind===`ThmOrAssumpDef`)throw new t.
|
|
34
|
-
the name of a theorem, assumption, or step.`)),{...H(l()),kind:`UseOrHide`,facts:r,defs:i,isOnly:e.isOnly,isHide:e.kind===`Hide`,location:t}},tt=e=>{let t=E(e.location),r=e.set&&L(e.set),i=Ce(t.start,e.name),o=pr[e.level],s={...H(l()),levelChecked:1,level:o.level,kind:`OpDecl`,name:fr(e.name),arity:e.arity,declKind:o.declKind,location:K(n,z(i,e.arity)),module:D};return d(a,s),{...H(l()),kind:`NewSymb`,declaration:s,set:r,location:K(n,t)}},nt=(e,t,r)=>{let i=E(e.location),s=or(n,i.start-1),c=G(n,e.conclusion).start,u=n.tokens.findLastIndex((e,t)=>t<c&&e.kind===`Keyword`&&e.text===`PROVE`),d=K(n,{start:s?i.start-1:i.start,end:i.start});s!==or(n,u-1)&&o(d,s?`[]ASSUME matched by PROVE instead of []PROVE`:`ASSUME matched by []PROVE instead of PROVE`);let f=l();t>1&&a.contexts.push(U()),s&&a.contexts.some(e=>v.has(e))&&o(d,`[]ASSUME used within the scope of an ordinary ASSUME's assumptions`),s||v.add(gr(a));let p={isDeclaredBefore:[!1],hasGoal:r!==void 0,isSuffices:r?.isSuffices??!1,isInProof:!0};x.depth=t,x.isDeclared[t]=!1,t===1&&(x.goal=r&&p,x.goalClause=0);let m=e.assumptions.map((e,n)=>{let r=e.kind===`NewSymbol`,i=e.kind===`AssumeProve`?nt(e,t+1):r?tt(e):L(e);return x.depth=t,r&&(x.isDeclared[t]=!0),p.isDeclaredBefore.push(p.isDeclaredBefore[n]||r),t===1&&x.goalClause++,i}),h=L(e.conclusion);t>1&&a.contexts.pop(),x.depth=t-1,t===1&&(x.goal=void 0);let g={...H(f),kind:`AssumeProve`,assumptions:m,goal:h,isSuffices:p.isSuffices,isBoxed:s,location:K(n,{start:s?i.start-1:i.start,end:i.end})};return S.set(g,p),g},rt=(e,t,n,r,i,a=!0)=>({...H(e),kind:`ThmOrAssumpDef`,name:t,isTheorem:a,body:n,params:[],isLocal:!1,location:r,module:D,source:void 0,labels:i,isLeibnizArg:[],isLeibniz:!1,opLevelCond:[],maxLevels:[],minMaxLevel:[]}),it=e=>{let t=K(n,E(e.location));e.kind===`By`&&$e(e,t);let r=e.kind===`By`?We(e.facts):[],i=e.kind===`By`?Qe(e.defs):[];return e.kind===`By`&&l(),e.kind===`By`&&r.length+i.length===0&&o(t,`Empty BY`),{...H(l()),kind:`LeafProof`,facts:r,defs:i,isOmitted:e.kind===`Omitted`,isOnly:e.kind===`By`&&e.isOnly,location:t}},at=(e,t)=>{let r=e.body,i=K(n,t);switch(r.kind){case`Have`:return{node:N(`$Have`,[L(r.expression)],i),isPick:!1};case`Case`:return{node:N(`$Pfcase`,[L(r.expression)],i),isPick:!1};case`Witness`:return{node:N(`$Witness`,r.expressions.map(L),i),isPick:!1};case`Qed`:return{node:N(`$Qed`,[],i),isPick:!1};case`Take`:case`Pick`:{let e=r.kind===`Pick`,o=e?`$Pick`:`$Take`;e&&a.contexts.push(U());let s=e=>r.kind===`Pick`?[F(e,r.body)]:[];if(r.bounds.length>0){let n=P(r.bounds,t.start),a=s(n.bounded.flat());return{node:N(o,a,i,n),isPick:e}}let c=lr(n,t.start,t.end+1,r.names),l=r.names.map((e,t)=>A(e,0,q(n,c[t]),!0)),u=s(l);return{node:N(o,u,i,{unbounded:l}),isPick:e}}}},ot=e=>{if((e.kind===`And`||e.kind===`Or`)&&!e.isBulleted)return!0;if(e.kind!==`Apply`||e.args.length!==2)return!1;let t=nr(n,G(n,e.args[0])),r=G(n,e).start;return t.start===r&&!W(n,t.end+1,`(`)},st=e=>{if(e.kind!==`Steps`)return it(e);let r=U();a.contexts.push(r);let i=[],o=[],s={previousRight:void 0},c=(e,r,a)=>{if(e.kind===`Define`){let r=e.definitions.map(e=>{let n=[];e.kind===`Instance`?Ve(e,n,i):e.kind===`Function`?Fe(e,n):Ne(e,n);let r=n[e.kind===`Instance`?n.length-1:0];if(r?.kind!==`OpDef`)throw new t.D(`A DEFINE step defines no operator`);return r});return{...H(l()),kind:`DefStep`,defs:r,location:K(n,a)}}if(e.kind===`Use`||e.kind===`Hide`)return{...et(e),location:K(n,r)};if(e.kind===`Instance`)return He(e,!1,K(n,a))},u=e.steps.map(e=>{let r=E(e.location),i=tr(n,e.head),u={start:i.start+1,end:i.end},f=e.body;e.name!==void 0&&y();let p=e.name===void 0?void 0:l();f.kind!==`Assert`&&(s.previousRight=void 0);let m=c(f,r,u);if(m!==void 0)return e.name!==void 0&&d(a,j({defKind:`NumberedProofStep`,name:e.name,location:K(n,r),labels:b(),step:m})),m;let h=f.kind===`Assert`&&f.statement.kind===`AssumeProve`;h&&(s.previousRight=void 0);let g=f.kind===`Assert`&&f.isSuffices,_=U(),v=f.kind===`Assert`?{node:(t=>{if(t.kind===`AssumeProve`){let n=k(_,()=>nt(t,1,e.name===void 0?void 0:{isSuffices:g}));return n.isSuffices=g,n}if(g){let e=L(t);return N(`$Suffices`,[e],K(n,u))}let r=s.previousRight,i=r!==void 0&&t.kind===`Apply`&&ot(t)&&t.args[0].kind===`ExceptAt`,a=i?L(t.args[1]):void 0,o=i?re(se(t.operator,T(t)),[N(`$Nop`,[r],T(t.args[0])),a],T(t)):L(t),c=o.kind===`OpAppl`?o.operands[1]:void 0;return s.previousRight=ot(t)?c:void 0,o})(f.statement),isPick:!1}:at(e,u);if(v===void 0)throw new t.D(`Unexpected proof step ${f.kind}`);let x=v.isPick?a.contexts.pop():void 0,S=e.name===void 0||p===void 0?void 0:rt(p,e.name,v.node,q(n,Qn(n,e.location)),b());S&&d(a,S);let C=h&&!g;C&&a.contexts.push(_);let D=e.proof&&st(e.proof);return C&&a.contexts.pop(),w(v.node),h&&g&&(o.push(_),a.contexts.push(_)),x?.symbols.forEach(e=>d(a,e)),{...H(l()),kind:`Theorem`,definition:S,body:v.node,proof:D,isSuffices:g,location:K(n,r)}});return o.forEach(()=>{a.contexts.pop()?.symbols.forEach(e=>An(r,e))}),a.contexts.pop(),{...H(l()),kind:`NonLeafProof`,steps:u,instances:i,proofLevel:e.level,location:K(n,E(e.location))}},ct=e=>{let t=K(n,E(e.location)),r=e.statement,i=U();e.name!==void 0&&y();let o=e.name===void 0?void 0:l();r.kind===`AssumeProve`&&a.contexts.push(i);let s=r.kind===`AssumeProve`?nt(r,1,e.name===void 0?void 0:{isSuffices:!1}):L(r),c=e.name===void 0||o===void 0?void 0:rt(o,e.name,s,t,b());c&&(r.kind===`AssumeProve`&&a.contexts.pop(),d(a,c),D.definitions.push(c),r.kind===`AssumeProve`&&a.contexts.push(i));let u=e.proof&&st(e.proof);r.kind===`AssumeProve`&&a.contexts.pop(),w(s);let f={...H(l()),kind:`Theorem`,definition:c,body:s,proof:u,isSuffices:!1,location:t};D.topLevel.push(f)},lt=e=>{let t=E(e.location),r=K(n,t);e.name!==void 0&&y();let i=L(e.expression),o=e.name===void 0?void 0:rt(l(),e.name,i,r,b(),!1);o&&(d(a,o),D.definitions.push(o));let s={...H(l()),kind:`Assume`,definition:o,body:i,location:r};D.topLevel.push(s)},z=(e,t)=>t===0?{start:e,end:e}:W(n,e,`_`)?{start:e,end:W(n,e+2,`_`)?e+2:e+1}:W(n,e+1,`(`)?{start:e,end:er(n,e+1)}:{start:e,end:W(n,e+1,`_`)?e+1:e},ut=e=>z(E(e.location).start,e.arity),dt=(e,t)=>{let r=ut(e);e.name===`@`&&t===3&&o(K(n,r),`Attempted to declare '@' as a variable.`);let i={...H(l()),levelChecked:1,level:+(t===3),kind:`OpDecl`,name:fr(e.name),arity:e.arity,declKind:t,location:K(n,r),module:D};return t===2&&(i.levelParams.add(i),i.allParams.add(i)),d(a,i),i};e.extends.forEach(e=>{let t=te(e);D.extendees.push(t);let n=gr(a);t.context.symbols.forEach(e=>{if(e.kind!==`Module`&&e.kind!==`FormalParam`&&e.kind!==`OpDecl`&&e.isLocal)return;let t=e.kind===`Module`?Nn(n,e.name):Mn(n,e.name);t===void 0?An(n,e):t!==e&&t.kind!==e.kind?o(e.location,`The ${yr(e)} of '${e.name}' conflicts with \nits ${yr(t)} at ${yn(t.location)}.`):t!==e&&!br(t,e)&&s(e.location,`Warning: the ${yr(t)} of '${e.name}' conflicts with \nits ${yr(t)} at ${yn(t.location)}.`)}),D.topLevel.push(...t.topLevel)});let ft=(e,t)=>{c.unresolvedSum!==0&&o(K(n,E(e)),`${t} may not appear within a recursive definition section.`)};return e.units.forEach(e=>{switch(e.kind){case`Variables`:ft(e.location,`A VARIABLE declaration`),e.declarations.forEach(e=>dt(e,3));break;case`Constants`:ft(e.location,`A declaration`),e.declarations.forEach(e=>dt(e,2));break;case`Recursive`:Le(e.declarations);break;case`Definition`:e.definition.kind===`Function`?Fe(e.definition,void 0):Ne(e.definition,void 0);break;case`Instance`:e.instance.name===void 0?He(e.instance):Ve(e.instance,void 0,void 0);break;case`Assumption`:ft(e.assumption.location,`An ASSUME`),lt(e.assumption);break;case`Theorem`:ft(e.theorem.location,`A THEOREM`),ct(e.theorem);break;case`Use`:ft(e.use.location,`A USE or HIDE`),D.topLevel.push(et(e.use));break;case`Module`:{ft(e.module.location,`A MODULE `);let t={contexts:[...a.contexts,U()]},r=O(e.module,n,D,t),i=ee(r.name);i===void 0?An(gr(a),r):i!==r&&o(r.location,`Multiply-defined module '${r.name}': this definition or declaration conflicts \nwith the one at ${yn(i.location)}.`);break}}}),Re(),D},ee=v.map(e=>{i.onAnalyze?.(e),u.id=Array.from({length:4},l)[1];let t=_(e,void 0),n=U();f.toReversed().forEach(e=>An(n,e));let r=O(t.module,t.file,void 0,{contexts:[n]});return m.set(e,r),i.onModule?.(r,a),r});return{root:ee[ee.length-1],modules:ee,messages:a}},J=(e,t,n,r)=>vn(e.messages,{location:t,text:n,isWarning:!1,...r!==void 0&&!e.isTlc174&&{code:r}}),Y=(e,t)=>{for(let n of t)e.add(n)},Pr=(e,t,n)=>`${e.id}:${t}:${n.id}`,Fr=(e,t,n,r)=>{e.set(Pr(t,n,r),{op:t,index:n,param:r})},Ir=(e,t,n=()=>!0)=>{t.forEach((t,r)=>{n(t)&&e.set(r,t)})},Lr=(e,t,n)=>{e.set(t,Math.min(n,e.get(t)??3))},Rr=(e,t,n=()=>!0)=>{t.forEach((t,r)=>{n(r)&&Lr(e,r,t)})},zr=(e,t)=>`${e.id}:${t}`,Br=(e,t,n,r)=>{let i=zr(t,n),a=e.get(i)?.level??0;e.set(i,{param:t,position:n,level:Math.max(r,a)})},Vr=(e,t,n=()=>!0)=>{t.forEach(t=>{n(t)&&Br(e,t.param,t.position,t.level)})},Hr=(e,t)=>{e.levelParams=t.levelParams,e.allParams=t.allParams,e.levelConstraints=t.levelConstraints,e.argLevelConstraints=t.argLevelConstraints,e.argLevelParams=t.argLevelParams},Ur=(e,t)=>{Y(e.levelParams,t.levelParams),Y(e.allParams,t.allParams),Rr(e.levelConstraints,t.levelConstraints),Vr(e.argLevelConstraints,t.argLevelConstraints),Ir(e.argLevelParams,t.argLevelParams)},Wr=(e,t)=>t.includes(e.op)||t.includes(e.param),Gr=e=>e.kind===`OpDecl`||e.kind===`FormalParam`,Kr=e=>e.kind!==`Module`,qr=e=>e.kind===`OpDef`||e.kind===`ThmOrAssumpDef`,Jr=(e,t)=>e.kind===`OpDef`&&e.arity<0?0:t,Yr=(e,t)=>e.kind===`OpDef`?e.weights[Jr(e,t)]??0:0,Xr=(e,t)=>e.maxLevels[Jr(e,t)]??3,Zr=(e,t,n)=>e.minMaxLevel?.[t]?.[n]??0,Qr=(e,t)=>e.kind===`OpDef`?e.isLeibnizArg?.[Jr(e,t)]??!0:e.isLeibnizArg[t]??!0,$r=(e,t,n,r)=>e.opLevelCond?.[t]?.[n]?.[r]??!1,ei=e=>[...e.unbounded??[],...(e.bounded??[]).flat()],ti=(e,t)=>t.find(t=>t.op===e)?.expr,ni=(e,t,n)=>{let r=ti(e,t);return r===void 0?/* @__PURE__ */ new Set([e]):n?r.allParams:r.levelParams},ri=(e,t)=>{let n=/* @__PURE__ */ new Map;return e.forEach((e,r)=>{let i=ti(e.op,t);if(i===void 0){n.set(r,e);return}if(i.kind!==`OpArg`||!Gr(i.op))return;let a=i.op;ni(e.param,t,!1).forEach(t=>Fr(n,a,e.index,t))}),n},ii=(e,t,n,r,i)=>{let a=/* @__PURE__ */ new Map;return e.levelConstraints.forEach((e,r)=>{let i=n||r.kind!==`OpDecl`?e:r.declKind===2?0:r.declKind===3?1:e;ni(r,t,!1).forEach(e=>Lr(a,e,i))}),e.argLevelParams.forEach(e=>{let n=ti(e.op,t);if(n?.kind!==`OpArg`||n.op.kind!==`OpDef`)return;X(n.op,r,i);let o=Xr(n.op,e.index);ni(e.param,t,!1).forEach(e=>Lr(a,e,o))}),a},ai=(e,t,n,r)=>{let i=/* @__PURE__ */ new Map;return e.argLevelConstraints.forEach(e=>{let n=ti(e.param,t);n===void 0?Br(i,e.param,e.position,e.level):n.kind===`OpArg`&&Gr(n.op)&&Br(i,n.op,e.position,e.level)}),e.argLevelParams.forEach(e=>{let a=ti(e.param,t);if(a===void 0)return;let o=ti(e.op,t),s=o===void 0?e.op:o.kind===`OpArg`?o.op:void 0;s!==void 0&&Gr(s)&&(X(a,n,r),Br(i,s,e.index,a.level))}),i},oi=(e,t)=>Fn(e,3).length>0||(hi(e,t),Pn(e).some(e=>(e.body?.level??0)!==0))?!1:e.topLevel.every(e=>e.kind!==`Theorem`||e.level===0),si=(e,t,n)=>{e.minMaxLevel=t.map(e=>Array.from({length:e.arity},(t,r)=>n.argLevelConstraints.get(zr(e,r))?.level??0)),e.opLevelCond=t.map(e=>t.map(t=>Array.from({length:e.arity},(r,i)=>n.argLevelParams.has(Pr(e,i,t))))),Y(e.levelParams,n.levelParams),Y(e.allParams,n.allParams),Y(e.nonLeibnizParams,n.nonLeibnizParams),t.forEach((t,n)=>{e.levelParams.delete(t),e.allParams.delete(t),e.nonLeibnizParams.has(t)&&(e.nonLeibnizParams.delete(t),e.isLeibnizArg&&(e.isLeibnizArg[n]=!1),e.isLeibniz=!1)}),e.levelConstraints=new Map(n.levelConstraints),t.forEach(t=>e.levelConstraints.delete(t)),e.argLevelConstraints=new Map(n.argLevelConstraints),t.forEach(t=>{for(let n=0;n<t.arity;n++)e.argLevelConstraints.delete(zr(t,n))}),Ir(e.argLevelParams,n.argLevelParams,e=>!t.some(t=>t===e.op)||!t.some(t=>t===e.param))},ci=(e,t,n,r,i)=>{e.operands.forEach((a,o)=>{if(a===void 0||(a.level>Xr(t,o)&&(n&&X(a,r,i)&&J(i,e.location,`Level error in applying operator ${t.name}:\nThe level of argument ${o+1} exceeds the maximum level allowed by the operator.`),e.levelCorrect=!1),a.kind!==`OpArg`||!qr(a.op)))return;let s=a.op;X(s,r,i);let c=jn(s);for(let l=0;l<c;l++){let c=Zr(t,o,l);Xr(s,l)>=c||(n&&X(a,r,i)&&J(i,e.location,`Level error in applying operator ${t.name}:\nThe permitted level of argument ${l+1} of the operator argument ${o+1} \nmust be at least ${c}.`),e.levelCorrect=!1)}e.operands.forEach((n,l)=>{for(let u=0;u<c;u++)n===void 0||!$r(t,o,l,u)||n.level<=Xr(s,u)||(X(a,r,i)&&X(n,r,i)&&J(i,e.location,`Level error in applying operator ${t.name}:\nThe level of argument ${l+1} exceeds the maximum level allowed by the operator.`,`HIGHER_ORDER_OPERATOR_COPARAMETER_LEVEL_CONSTRAINTS_EXCEEDED`),e.levelCorrect=!1)})}),e.ranges.forEach((n,a)=>{let o=X(n,r,i);n.level<=2||(o&&J(i,e.location,`Level error in applying operator ${t.name}:\nThe level of the range for the bounded variable ${yn(e.bounded?.[a]?.[0]?.location)} \nexceeds the maximum level allowed by the operator.`),e.levelCorrect=!1)})},li=(e,t,n,r,i)=>{let a=t.params??[],o=t=>e.operands.find((e,n)=>a[n]===t);Rr(e.levelConstraints,t.levelConstraints),e.operands.forEach(t=>{t!==void 0&&Rr(e.levelConstraints,t.levelConstraints,e=>!n.has(e))}),e.ranges.forEach(t=>Rr(e.levelConstraints,t.levelConstraints)),e.operands.forEach((n,r)=>{let i=Xr(t,r);n?.levelParams.forEach(t=>Lr(e.levelConstraints,t,i))}),e.operands.forEach((n,a)=>{if(n?.kind!==`OpArg`||!qr(n.op))return;let o=n.op;X(o,r,i);let s=jn(o);e.operands.forEach((n,r)=>{for(let i=0;i<s;i++){if(!$r(t,a,r,i))continue;let s=Xr(o,i);n?.levelParams.forEach(t=>Lr(e.levelConstraints,t,s)),!o.isLeibniz&&!Qr(o,i)&&n&&Y(e.nonLeibnizParams,n.allParams)}})}),t.argLevelParams.forEach(t=>{let n=o(t.op);n?.kind===`OpArg`&&qr(n.op)&&(X(n.op,r,i),Lr(e.levelConstraints,t.param,Xr(n.op,t.index)))}),Vr(e.argLevelConstraints,t.argLevelConstraints),e.operands.forEach(t=>{t&&Vr(e.argLevelConstraints,t.argLevelConstraints)}),e.ranges.forEach(t=>Vr(e.argLevelConstraints,t.argLevelConstraints)),e.operands.forEach((n,r)=>{if(n?.kind!==`OpArg`||!Gr(n.op))return;let i=n.op;for(let n=0;n<i.arity;n++)Br(e.argLevelConstraints,i,n,Zr(t,r,n));e.operands.forEach((n,a)=>{for(let o=0;o<i.arity;o++)n!==void 0&&$r(t,r,a,o)&&Br(e.argLevelConstraints,i,o,n.level)})}),t.argLevelParams.forEach(t=>{let n=o(t.op);n!==void 0&&(X(n,r,i),Br(e.argLevelConstraints,t.op,t.index,n.level))}),e.operands.forEach(t=>{t!==void 0&&Ir(e.argLevelParams,t.argLevelParams,e=>!n.has(e.param))}),e.ranges.forEach(t=>Ir(e.argLevelParams,t.argLevelParams)),t.argLevelParams.forEach((t,n)=>{let a=o(t.op);if(a===void 0){let a=o(t.param);a===void 0?e.argLevelParams.set(n,t):(X(a,r,i),a.levelParams.forEach(n=>Fr(e.argLevelParams,t.op,t.index,n)))}else a.kind===`OpArg`&&Gr(a.op)&&Fr(e.argLevelParams,a.op,t.index,t.param)}),e.operands.forEach((n,r)=>{if(n?.kind!==`OpArg`||!Gr(n.op))return;let i=n.op;e.operands.forEach((n,a)=>{for(let o=0;o<i.arity;o++)n!==void 0&&$r(t,r,a,o)&&n.levelParams.forEach(t=>Fr(e.argLevelParams,i,o,t))})})},ui=/* @__PURE__ */ new Map([[`\\land`,`\\land`],[`\\lor`,`\\lor`],[`=>`,`=>`],[`\\equiv`,`\\equiv`],[`$ConjList`,`Conjunction list`],[`$DisjList`,`Disjunction list`]]),di=(e,t)=>{let n=(n,r)=>{J(t,n,r),t.isTlc174||(e.levelCorrect=!1)},r=e.operator.name,i=e.operands[0];if((r===`[]`||r===`<>`)&&i?.level===2&&i.kind===`OpAppl`){let t=r===`[]`;i.operator.name!==(t?`$SquareAct`:`$AngleAct`)&&n(e.location,t?`[] followed by action not of form [A]_v.`:`<> followed by action not of form <<A>>_v.`)}r!==`~>`&&r!==`-+->`||i?.level!==2&&e.operands[1]?.level!==2||n(e.location,`Action used where only temporal formula or state predicate allowed.`);let a=ui.get(r);a!==void 0&&e.operands.some(e=>e?.level===3)&&e.operands.some(e=>e?.level===2)&&n(e.location,`${a} has both temporal formula and action as arguments.`),e.level===3&&(r===`$BoundedExists`||r===`$BoundedForall`)&&e.ranges.forEach(e=>{e.level===2&&n(e.location,`Action-level bound of quantified temporal formula.`)})},fi=(e,t,n)=>{if(e.levelChecked>=t)return e.levelCorrect;e.levelChecked=t,e.levelCorrect=!0;let r=e.operands.filter(e=>e!==void 0);r.forEach(r=>{X(r,t,n)||(e.levelCorrect=!1)}),e.ranges.forEach(r=>{X(r,t,n)||(e.levelCorrect=!1)});let i=e.operator;if(qr(i)){let r=X(i,t,n);ci(e,i,r,t,n),e.level=e.operands.reduce((e,t,n)=>t!==void 0&&Yr(i,n)===1?Math.max(e,t.level):e,i.level),e.ranges.forEach(t=>{e.level=Math.max(e.level,t.level)}),Y(e.levelParams,i.levelParams),Y(e.allParams,i.allParams),Y(e.nonLeibnizParams,i.nonLeibnizParams),e.operands.forEach((t,n)=>{t!==void 0&&(Yr(i,n)===1&&Y(e.levelParams,t.levelParams),Y(e.allParams,t.allParams),Y(e.nonLeibnizParams,t.nonLeibnizParams),Qr(i,n)||Y(e.nonLeibnizParams,t.allParams))}),e.ranges.forEach(t=>{Y(e.levelParams,t.levelParams),Y(e.allParams,t.allParams),Y(e.nonLeibnizParams,t.nonLeibnizParams)});let a=new Set(ei(e));a.forEach(t=>{e.levelParams.delete(t),e.allParams.delete(t),e.nonLeibnizParams.delete(t)}),li(e,i,a,t,n)}else X(i,t,n),e.level=r.reduce((e,t)=>Math.max(e,t.level),i.kind===`Module`?0:i.level),e.levelParams=/* @__PURE__ */ new Set([i]),e.allParams.add(i),r.forEach((t,n)=>{Y(e.levelParams,t.levelParams),Y(e.allParams,t.allParams),Y(e.nonLeibnizParams,t.nonLeibnizParams),Rr(e.levelConstraints,t.levelConstraints),Br(e.argLevelConstraints,i,n,t.level),Vr(e.argLevelConstraints,t.argLevelConstraints),t.levelParams.forEach(t=>Fr(e.argLevelParams,i,n,t)),Ir(e.argLevelParams,t.argLevelParams)});return di(e,n),e.levelCorrect},pi=(e,t,n)=>{if(e.levelChecked>=t||!e.inRecursiveSection&&e.levelChecked>0)return e.levelCorrect;e.levelChecked=t;let r=e.body;if(r===void 0)return e.levelCorrect=e.step===void 0||X(e.step,t,n),e.levelCorrect;e.levelCorrect=X(r,t,n),e.level=Math.max(e.level,r.level);let i=e.params??[];return i.forEach((t,n)=>{let i=r.levelConstraints.get(t);i!==void 0&&(e.maxLevels[n]=Math.min(e.maxLevels[n],i)),r.levelParams.has(t)&&(e.weights[n]=Math.max(e.weights[n],1))}),si(e,i,r),e.levelCorrect},mi=(e,t,n)=>(e.levelChecked>=t||(e.levelChecked=t,e.maxLevels=e.params.map(()=>3),e.isLeibnizArg=e.params.map((t,n)=>n===e.params.length-1),e.params.length>0&&(e.isLeibniz=!0),e.levelCorrect=X(e.body,t,n),e.level=e.body.level,e.params.forEach((t,n)=>{let r=e.body.levelConstraints.get(t);r!==void 0&&(e.maxLevels[n]=r)}),si(e,e.params,e.body)),e.levelCorrect),hi=(e,t)=>{if(e.isLevelChecked)return e.levelCorrect;e.isLevelChecked=!0;let n=e.opDefsInRecursiveSection,r=0;for(;r<n.length;){let e=n[r].recursiveSection,i=r;for(;i<n.length&&n[i].recursiveSection===e;){let e=n[i];e.inRecursive?(e.levelChecked=1,e.maxLevels=e.maxLevels.map(()=>2),e.weights=e.weights.map(()=>1)):e.levelChecked=0,i++}let a=n.slice(r,i),o=/* @__PURE__ */ new Set,s=/* @__PURE__ */ new Set,c=0;a.forEach(e=>{e.inRecursive&&(e.levelChecked=0),pi(e,1,t),e.inRecursive&&(e.maxLevels.forEach((n,r)=>{n>=2||J(t,e.location,`Argument ${r+1} of recursive operator ${e.name} is primed`)}),c=Math.max(c,e.level),Y(o,e.levelParams),Y(s,e.allParams))}),a.forEach(e=>{e.inRecursive&&(e.levelChecked=2),e.level=Math.max(e.level,c),Y(e.levelParams,o),Y(e.allParams,s)}),a.forEach(e=>{e.inRecursive&&(e.levelChecked=1),pi(e,2,t)}),r=i}e.levelCorrect=!0;let i=t=>{t||(e.levelCorrect=!1)};e.definitions.filter(e=>e.kind===`Module`).forEach(e=>i(hi(e,t)));let a=Pn(e);return a.forEach(e=>i(pi(e,1,t))),In(e).forEach(e=>i(mi(e,1,t))),e.topLevel.forEach(e=>i(X(e,1,t))),oi(e,t)||Fn(e,2).forEach(t=>Lr(e.levelConstraints,t,0)),a.forEach(t=>{Rr(e.levelConstraints,t.levelConstraints),Vr(e.argLevelConstraints,t.argLevelConstraints),Ir(e.argLevelParams,t.argLevelParams,e=>!Wr(e,t.params??[]))}),e.topLevel.forEach(t=>{Rr(e.levelConstraints,t.levelConstraints),Vr(e.argLevelConstraints,t.argLevelConstraints),Ir(e.argLevelParams,t.argLevelParams)}),e.levelCorrect},gi=(e,t,n,r)=>(e.levelChecked>=n||(e.levelChecked=n,t.forEach(t=>{Kr(t)&&(t.kind!==`OpDef`||t.defKind!==`ModuleInstance`)&&(e.levelCorrect=X(t,n,r)&&e.levelCorrect,e.level=Math.max(e.level,t.level),Ur(e,t),Y(e.nonLeibnizParams,t.nonLeibnizParams))})),e.levelCorrect),_i=(e,t)=>{e?.kind===`NonLeafProof`&&e.steps.forEach(e=>{if(e.kind!==`Theorem`||e.body.kind!==`OpAppl`)return;let n=e.body.operator.name;n===`$Take`||n===`$Witness`||n===`$Have`?e.body.level!==0&&J(t,e.body.location,`Non-constant TAKE, WITNESS, or HAVE for temporal goal.`):n===`$Pfcase`?(e.body.level!==0&&J(t,e.body.location,`Non-constant CASE for temporal goal.`),_i(e.proof,t)):n===`$Qed`&&_i(e.proof,t)})},vi=(e,t,n)=>{if(e.levelChecked>=t)return e.levelCorrect;e.levelChecked=t,e.levelParams=/* @__PURE__ */ new Set,e.levelCorrect=!0;let r=e.module;hi(r,n)||(e.levelCorrect=!1),e.substs.forEach(r=>{X(r.expr,t,n)||(e.levelCorrect=!1)});let i=oi(r,n);e.substs.forEach(a=>{!i&&a.expr.level>a.op.level&&(X(a.expr,t,n)&&J(n,e.location,`Level error in instantiating module '${r.name}':\nThe level of the expression or operator substituted for '${a.op.name}' \nmust be at most ${a.op.level}.`),e.levelCorrect=!1),a.expr.kind!==`OpArg`||a.expr.op.kind!==`OpDef`||a.expr.op.defKind!==`UserDefined`&&a.expr.op.defKind!==`BuiltIn`||a.expr.op.isLeibniz||J(n,e.location,`Error in instantiating module '${r.name}':\n A non-Leibniz operator substituted for '${a.op.name}'.`)}),e.substs.forEach(i=>{let a=r.levelConstraints.get(i.op);if(a!==void 0&&i.expr.level>a&&(X(i.expr,t,n)&&J(n,e.location,`Level error in instantiating module '${r.name}':\nThe level of the expression or operator substituted for '${i.op.name}' \nmust be at most ${a}.`),e.levelCorrect=!1),i.op.arity<=0||i.expr.kind!==`OpArg`||i.expr.op.kind!==`OpDef`)return;let o=i.expr.op,s=X(o,t,n);for(let t=0;t<i.op.arity;t++){let a=r.argLevelConstraints.get(zr(i.op,t))?.level;a===void 0||Xr(o,t)>=a||(s&&J(n,e.location,`Level error in instantiating module '${r.name}':\nThe level of the argument ${t+1} of the operator ${o.name} \nmust be at least ${a}.`),e.levelCorrect=!1)}}),r.argLevelParams.forEach(i=>{e.substs.forEach(a=>{e.substs.forEach(o=>{if(i.op!==a.op||i.param!==o.op||a.expr.kind!==`OpArg`)return;let s=a.expr.op,c=X(s,t,n);if(s.kind!==`OpDef`)return;let l=Xr(s,i.index);o.expr.level<=l||(c&&X(o.expr,t,n)&&J(n,e.location,`Level error when instantiating module '${r.name}':\nThe level of the argument ${i.index} of the operator ${a.op.name}' \nmust be at most ${l}.`),e.levelCorrect=!1)})})});let a=t=>!e.params.some(e=>e===t);return Rr(e.levelConstraints,ii(r,e.substs,i,t,n),a),e.substs.forEach(t=>Rr(e.levelConstraints,t.expr.levelConstraints,a)),Vr(e.argLevelConstraints,ai(r,e.substs,t,n),e=>a(e.param)),e.substs.forEach(t=>Vr(e.argLevelConstraints,t.expr.argLevelConstraints,e=>a(e.param))),Ir(e.argLevelParams,ri(r.argLevelParams,e.substs),t=>!Wr(t,e.params)),e.substs.forEach(t=>Ir(e.argLevelParams,t.expr.argLevelParams,t=>!Wr(t,e.params))),e.levelCorrect},X=(e,t,n)=>{if(!Kr(e))return hi(e,n);switch(e.kind){case`OpAppl`:return fi(e,t,n);case`OpDef`:return pi(e,t,n);case`ThmOrAssumpDef`:return mi(e,t,n);case`FormalParam`:return e.levelChecked===0&&(e.levelChecked=t,e.levelParams.add(e),e.allParams.add(e)),!0;case`OpDecl`:return!0;case`Numeral`:case`String`:case`Decimal`:return e.levelChecked<t&&(e.levelChecked=t),!0;case`OpArg`:{if(e.levelChecked>=t)return e.levelCorrect;e.levelChecked=t;let r=e.op;return e.levelCorrect=X(r,t,n),r.kind===`Module`||(e.level=r.level,Hr(e,r)),e.levelCorrect}case`LetIn`:{if(e.levelChecked>=t)return e.levelCorrect;e.levelChecked=t,e.levelCorrect=!0;let r=e.opDefs.filter(e=>e.kind!==`OpDef`||e.defKind!==`ModuleInstance`);return r.forEach(r=>{X(r,t,n)||(e.levelCorrect=!1)}),X(e.body,t,n)||(e.levelCorrect=!1),e.instances.forEach(r=>{X(r,t,n)||(e.levelCorrect=!1)}),e.level=e.body.level,e.levelParams=new Set(e.body.levelParams),e.allParams=new Set(e.body.allParams),Rr(e.levelConstraints,e.body.levelConstraints),r.forEach(t=>Rr(e.levelConstraints,t.levelConstraints)),Vr(e.argLevelConstraints,e.body.argLevelConstraints),r.forEach(t=>Vr(e.argLevelConstraints,t.argLevelConstraints)),Ir(e.argLevelParams,e.body.argLevelParams),r.forEach(t=>{let n=t.kind===`OpDef`?t.params??[]:[];Ir(e.argLevelParams,t.argLevelParams,e=>!Wr(e,n))}),e.instances.forEach(t=>Ir(e.argLevelParams,t.argLevelParams)),e.levelCorrect}case`Label`:{if(e.levelChecked>=t)return!0;e.levelChecked=t,e.params.forEach(e=>X(e,t,n));let r=X(e.body,t,n);return e.level=e.body.level,Hr(e,e.body),r}case`At`:{if(e.levelChecked>=t)return!0;e.levelChecked=t;let r=e.except.operands,i=r[0];if(i===void 0)return!0;X(i,t,n),e.level=i.level;let a=[i];for(let i of r.slice(1))if(i!==void 0){if(X(i,t,n),i===e.component)break;e.level=Math.max(e.level,i.level),a.push(i)}return a.forEach(t=>Ur(e,t)),!0}case`SubstIn`:case`APSubstIn`:{if(e.levelChecked>=t)return e.levelCorrect;e.levelChecked=t,e.levelCorrect=!0;let r=e.body;X(r,t,n)||(e.levelCorrect=!1),e.substs.forEach(r=>{X(r.expr,t,n)||(e.levelCorrect=!1)}),e.level=e.substs.reduce((e,t)=>r.levelParams.has(t.op)?Math.max(e,t.expr.level):e,r.level),r.levelParams.forEach(t=>Y(e.levelParams,ni(t,e.substs,!1))),e.kind===`APSubstIn`?r.allParams.forEach(t=>Y(e.allParams,ni(t,e.substs,!0))):(e.allParams=new Set(r.allParams),e.nonLeibnizParams=new Set(r.nonLeibnizParams),e.substs.forEach(t=>{e.allParams.has(t.op)&&(e.allParams.delete(t.op),Y(e.allParams,t.expr.allParams),Y(e.nonLeibnizParams,t.expr.nonLeibnizParams),e.nonLeibnizParams.has(t.op)&&(e.nonLeibnizParams.delete(t.op),Y(e.nonLeibnizParams,t.expr.allParams)))}));let i=oi(e.instantiatedModule,n);return e.levelConstraints=ii(r,e.substs,i,t,n),e.argLevelConstraints=ai(r,e.substs,t,n),e.argLevelParams=ri(r.argLevelParams,e.substs),e.levelCorrect}case`Instance`:return vi(e,t,n);case`Assume`:{if(e.levelChecked>=t)return!0;e.levelChecked=t;let r=X(e.body,t,n),i=!e.definition||X(e.definition,t,n);return e.level=e.body.level,Hr(e,e.body),e.level!==0&&J(n,e.location,`Level error: assumptions must be level 0 (Constant), \nbut this one has level ${e.level}.`),r&&i}case`Theorem`:{if(e.levelChecked>=t)return!0;let r=gi(e,[e.definition??e.body,...e.proof?[e.proof]:[]],t,n),i=e.body;return i.kind===`OpAppl`&&i.operator.name===`$Pick`&&i.level===3&&i.ranges.forEach(e=>{e.level!==0&&J(n,e.location,`Non-constant bound of temporal PICK.`)}),i.level===3&&_i(e.proof,n),r}case`LeafProof`:case`UseOrHide`:return gi(e,e.facts,t,n);case`NonLeafProof`:return gi(e,[...e.steps,...e.instances],t,n);case`DefStep`:return gi(e,e.defs,t,n);case`NewSymb`:return e.levelChecked>=t||(e.levelChecked=t,e.level=e.declaration.level,e.set===void 0)||(e.levelCorrect=X(e.set,t,n),e.level=Math.max(e.level,e.set.level),e.level===3&&(e.levelCorrect=!1,J(n,e.location,`Level error:
|
|
35
|
-
Temporal formula used as set.`)),Hr(e,e.set)),e.levelCorrect;case`AssumeProve`:return e.levelChecked>=t||(e.levelChecked=t,e.levelCorrect=!0,e.assumptions.forEach(r=>{X(r,t,n)||(e.levelCorrect=!1)}),X(e.goal,t,n),e.level=e.assumptions.reduce((e,t)=>Math.max(e,t.level),e.goal.level),[e.goal,...e.assumptions].forEach(t=>Ur(e,t)),e.levelCorrect&&e.levelParams.forEach(t=>{t.kind===`OpDecl`&&t.declKind===2&&Lr(e.levelConstraints,t,2)})),e.levelCorrect}},yi=e=>{switch(e.kind){case`OpAppl`:return[...e.ranges,...e.operands];case`OpDef`:case`ThmOrAssumpDef`:case`Label`:return[e.body];case`LetIn`:return[...e.opDefs,...e.instances,e.body];case`SubstIn`:case`APSubstIn`:return[e.body,...e.substs.map(e=>e.expr)];case`Instance`:return e.substs.map(e=>e.expr);case`AssumeProve`:return[...e.assumptions,e.goal];case`NewSymb`:return[e.set];default:return[]}},bi=/* @__PURE__ */ new Map([[`Integers`,`Int`],[`Naturals`,`Nat`],[`Reals`,`Reals`]]),xi=e=>{let t=/* @__PURE__ */ new Set,n=e=>{if(e===void 0||t.has(e))return!1;if(t.add(e),e.kind===`OpAppl`){let t=e.operator;if(t.kind===`OpDecl`||t.kind===`FormalParam`)return!0;if(t.kind===`OpDef`){if(t.name===`BOOLEAN`)return!0;let e=t.module?.name;if(e!==void 0&&bi.get(e)===t.name||n(t))return!0}}return yi(e).some(n)};return n(e)},Si=e=>e.operands.filter(e=>e?.kind===`OpAppl`),Ci=e=>{let t=e.operands[0];return t?.kind===`String`?t:void 0},wi=(e,t)=>{if(e===t)return!0;if(e.operands.length!==t.operands.length)return!1;let n=new Set(Si(t).map(e=>Ci(e)?.value));return Si(e).every(e=>n.has(Ci(e)?.value))},Ti=(e,t=/* @__PURE__ */ new Set)=>(e.extendees.forEach(e=>{t.has(e)||(t.add(e),Ti(e,t))}),t),Ei=e=>{let t=[...[...Ti(e)].flatMap(e=>e.records),...e.records];return e.records.flatMap(n=>t.filter(e=>wi(e,n)).flatMap(Si).some(xi)?[]:Si(n).flatMap(t=>{let n=Ci(t),r=n&&Mn(e.context,n.value);return n===void 0||r===void 0?[]:[{location:n.location,text:`The field name "${n.value}" in the record constructor is identical to the existing definition or declaration\nnamed ${n.value}, located at ${yn(r.location)}.\nThe field in the record will not take the value of the ${n.value} definition or declaration.\nIn TLA+, field names in records are strings, regardless of any similarly named declarations or definitions.\nTherefore, DOMAIN [${n.value} |-> ...] = {"${n.value}"} holds true.`,isWarning:!0}]}))},Di=e=>`${yn(e.location)}\n\n${e.text}`,Oi=e=>{let t=e.filter(e=>!e.isWarning),n=e.filter(e=>e.isWarning);return[t.length>0?`*** Errors: ${t.length}\n\n`:``,...t.map(e=>`${Di(e)}\n\n\n`),n.length>0?`*** Warnings: ${n.length}\n\n`:``,...n.map(e=>`${Di(e)}\n\n\n`)].join(``)},ki=/* @__PURE__ */ new Set([`FiniteSets`,`Sequences`,`Bags`,`Naturals`,`Integers`,`Reals`,`RealTime`,`Randomization`,`TLC`]),Ai=e=>{let t=/* @__PURE__ */ new Set,n=[],r=e=>{t.add(e.name),n.push(...e.extends),e.modules.forEach(r)};return r(e),n.filter(e=>!t.has(e))},ji=e=>{try{return n.
|
|
30
|
+
from outside that declaration's scope.`);if(i<=n.assumptions.length){if(u.node=n.assumptions[i-1],u.node.kind===`NewSymb`&&u.index!==t.length-1)return e.addError(l(u.index),`Selected a subexpression of a NEW clause of an ASSUME.`)}else u.node=n.goal}}else if(n.kind===`OpArg`){let t=n.op;if(t.kind!==`OpDef`||t.name!==`LAMBDA`)return e.addError(l(u.index),`Trying to select subexpression of an operator argument.`);if(f.op!==`Null`&&f.op!==`@`)return e.addError(l(u.index),`Cannot use !${f.name} to select subexpression of a LAMBDA.`);if(f.op===`Null`){if(t.arity!==d(f).length)return e.addError(l(u.index),`Selector with ${d(f).length} arguments used for LAMBDA expression taking ${t.arity} arguments.`);c.push(...d(f).map(e.generateExpression))}s.push(...t.params??[]),u.node=t.body}else if(n.kind===`Label`)u.node=n.body,u.index--;else return e.addError(l(u.index),`Selecting subexpression of expression that has none.`);if(u.node===void 0)return e.addError(l(u.index),`An unexpected null node specified by '${f.name}'.\nThis is probably due to a previous error.`);if(u.index!==t.length-1){let n=t[u.index+1];if(n.op===`Name`){for(;u.node?.kind===`Label`;)u.node=u.node.body;if(u.node?.kind!==`LetIn`)return e.addError(l(u.index),`A name selector here must be from a LET clause.`);u.letInContext=u.node.context,u.mode=`FindingOpName`}else if(n.op===`:`)return e.addError(l(u.index),`!: should not follow an operand selector.`)}u.previousMode=`FindingSubExpr`;break}}u.index++}let f=u.node;if(f===void 0)return e.addError(a,`Subexpression selection failed, probably due to an error in the selected expression.`);if(f.kind===`AssumeProve`||f.kind===`NewSymb`)return r?f:e.addError(a,f.kind===`AssumeProve`?`Selected ASSUME/PROVE instead of expression.`:`Selected a NEW declaration as an expression or operator.`);if(n<0){let t=f.kind===`OpDef`&&(f.defKind===`UserDefined`||f.defKind===`NumberedProofStep`||f.defKind===`ModuleInstance`&&i)||f.kind===`ThmOrAssumpDef`;return u.previousMode!==`FindingOpName`||!t?e.addError(a,`DEF clause entry should describe a defined operator.`):f.kind===`OpDef`&&f.step!==void 0&&f.step.kind!==`DefStep`?e.addError(a,`DEF clause entry refers to a non-definition step.`):f}if(f.kind===`OpDef`&&f.defKind===`NumberedProofStep`)return e.addError(a,r?`Step number of non-fact used as a fact`:`Step number of non-expression step used as an expression.`);if(n>0){let t=s.length+(f.kind===`OpArg`?jn(f.op):u.previousMode===`FindingOpName`&&Wn(f)?jn(f):0);if(n!==t)return e.addError(a,`Expected arity ${n} but found operator of arity ${t}.`)}let p=f;if(u.previousMode===`FindingOpName`&&s.length+o.length>0){if(p.kind!==`OpDef`&&p.kind!==`ThmOrAssumpDef`)return e.addError(t[t.length-1].location??a,`Internal Error: Found unexpected node kind after FindingOpName`);c.push(...u.definitionArgs);let n=(p.params??[]).map(t=>{let n=e.createFormalParam(t.name,t.arity,t.location);return s.push(n),t.arity===0?e.createOpAppl(n,[],a):e.createOpArg(n,a)});p=e.createOpAppl(p,n,a)}if(p.kind===`OpArg`){if(n===0)return e.addError(a,`Selected operator argument when expression expected.`);if(s.length+o.length>0){let t=p.op;s.push(...Array.from({length:jn(t)},(t,n)=>e.createFormalParam(`NewParam${n}`,0,void 0))),p=e.createOpAppl(t,u.definitionArgs,a)}}if(!r){if(p.kind===`ThmOrAssumpDef`&&p.body.kind===`AssumeProve`||p.kind===`Label`&&p.isAssumeProve)return e.addError(a,`ASSUME/PROVE used where an expression is required.`);if(p.kind===`ThmOrAssumpDef`&&p.body.kind===`OpAppl`){let t=Ln.get(p.body.operator.name);if(t!==void 0)return e.addError(a,`${t} proof step selected instead of expression.`)}}if(p.kind===`FormalParam`||p.kind===`OpDecl`||p.kind===`ThmOrAssumpDef`||p.kind===`OpDef`&&(p.defKind===`UserDefined`||p.defKind===`BuiltIn`))return n>0?e.createOpArg(p,a):e.createOpAppl(p,u.definitionArgs,a);if(p.kind===`OpArg`)return p;if(p.kind===`OpDef`||p.kind===`Module`)return(r||i)&&p.kind===`OpDef`?p:e.addError(a,`Module instantiation selected instead of expression.`);let m=o.reduceRight((t,n)=>e.copySubstIn(n,t),p),h=s.length>0?e.createLambda(s,m,a):void 0;return n>0?h===void 0||s.length!==n?e.addError(a,`Expected operator argument with arity ${n} but found one of arity ${s.length}.`):e.createOpArg(h,a):s.length===c.length?h===void 0?e.createOpAppl(e.getBuiltin(`$Nop`),[m],a):e.createOpAppl(h,c,a):e.addError(a,`Expected ${s.length} arguments but found ${c.length}.`)},Jn=/* @__PURE__ */ new Map([[`(`,`)`],[`[`,`]`],[`{`,`}`],[`<<`,`>>`]]),Yn=(e,t)=>`${e}:${t}`,Xn=(e,t)=>{let r=n.Xt(t).filter(e=>e.kind!==`End`).map(n.Yt),i=[0,0];for(let e=0;e<t.length;e++)t[e]===`
|
|
31
|
+
`&&i.push(e+1);return{name:e,source:t,tokens:r,lineOffsets:i,tokenIndexes:new Map(r.map((e,t)=>[Yn(e.line,e.column),t]))}},W=(e,t,n)=>e.tokens[t]!==void 0&&e.tokens[t].text===n&&e.tokens[t].kind!==`String`,Zn=(e,t,n)=>{let r=0,i=e.tokens.length;for(;r<i;){let a=r+i>>>1,o=e.tokens[a];o.line<t.line||o.line===t.line&&(n?o.column<=t.column:o.column<t.column)?r=a+1:i=a}return r},Qn=(e,t)=>e.tokenIndexes.get(Yn(t.line,t.column))??Math.min(Zn(e,t,!1),e.tokens.length-1),$n=(e,t)=>Math.max(Zn(e,t,!0)-1,0),er=(e,t)=>{let n=e.tokens[t].text,r=Jn.get(n);if(r===void 0)return t;let i=0;for(let a=t;a<e.tokens.length;a++)if(W(e,a,n))i++;else if(W(e,a,r)&&(i--,i===0))return a;return t},tr=(e,t)=>({start:Qn(e,t.start),end:$n(e,t.end)}),G=(e,t)=>{let n=t.location.range;if(n)return tr(e,n);let r=Qn(e,t.location);return{start:r,end:er(e,r)}},nr=(e,t)=>{let n=t.start-1,r=t.end+1;return W(e,n,`(`)&&W(e,r,`)`)&&er(e,n)===r?nr(e,{start:n,end:r}):t},rr=(e,t)=>{let n=t.start-1,r=t.end+1;return W(e,n,`(`)&&er(e,n)===r&&(W(e,n-1,`(`)||W(e,n-1,`,`))?rr(e,{start:n,end:r}):t},K=(e,t)=>({file:e.name,beginLine:e.tokens[t.start].line,beginColumn:e.tokens[t.start].column,endLine:e.tokens[t.end].line,endColumn:e.tokens[t.end].endColumn}),q=(e,t)=>K(e,{start:t,end:t}),ir=(e,t,r)=>{let i=0,a=e.lineOffsets[t];for(;a<e.source.length;){if(i=e.source[a]===` `?n.Kt(i):i+1,i>=r)return a;a++}return a},ar=(e,t)=>{let n=e.tokens[t],r=ir(e,n.line,n.column);return e.source.slice(r,ir(e,n.line,n.endColumn)+1)},or=(e,t)=>{let n=e.tokens[t],r=e.tokens[t+1];return n?.kind===`Operator`&&n.text===`[]`&&r?.kind===`Keyword`&&(r.text===`ASSUME`||r.text===`PROVE`)&&r.line===n.line&&r.column===n.endColumn+1},sr=e=>{let r=Xn(``,e),i=r.tokens.reduce((e,t,n)=>{if(!or(r,n))return e;let i=ir(r,t.line,t.column);return`${e.slice(0,i)} ${e.slice(i+2)}`},e);if(i!==e&&n.W(e)!==void 0)throw new t.O(`SANY rejects a []ASSUME or []PROVE outside an ASSUME/PROVE`);return i},cr=(e,t)=>{let n=e.tokens[t-1],r=e.tokens[t],i=n===void 0?0:ir(e,n.line,n.endColumn)+1,a=e.source.slice(i,ir(e,r.line,r.column)),o=[],s=0;for(;s<a.length;)if(a.startsWith(`\\*`,s)){let e=a.indexOf(`
|
|
32
|
+
`,s),t=e===-1?a.length:e+1;o.push(a.slice(s,t)),s=t}else if(a.startsWith(`(*`,s)){let e=1,t=s,n=s+2;for(;e>0&&n<a.length;){let r=a.startsWith(`(*`,n),i=a.startsWith(`*)`,n);r||i?(e+=r?1:-1,n+=2,o.push(a.slice(t,n)),t=n):n++}t<n&&o.push(a.slice(t,n)),s=n}else s++;return o},lr=(e,t,n,r)=>{let i=[];for(let a=t;a<n&&i.length<r.length;a++){let t=e.tokens[a];t.kind===`Identifier`&&t.text===r[i.length]&&i.push(a)}return i},ur=(e,t,n,r)=>{for(let i=t;i<=n;i++)if(W(e,i,r))return i;return-1},dr=new Map(n.G.flatMap(([e,...t])=>t.map(t=>[t,e]))),fr=e=>e.split(`!`).map(e=>dr.get(e)??(e===`~`?`\\lnot`:e)).join(`!`),pr={Constant:{declKind:24,level:0},Variable:{declKind:25,level:1},State:{declKind:26,level:1},Action:{declKind:27,level:2},Temporal:{declKind:28,level:3}},mr=e=>/^[A-Za-z0-9_]+$/.test(e),hr=e=>e!==`!!`&&e.includes(`!`),gr=e=>e.contexts[e.contexts.length-1],_r=(e,t)=>{for(let n=e.contexts.length-1;n>=0;n--){let r=Mn(e.contexts[n],t);if(r)return r}},vr=e=>e.kind===`OpDecl`?`${e.kind}${e.declKind}`:e.kind===`OpDef`?e.defKind:e.kind,yr=e=>e.kind===`OpDef`||e.kind===`FormalParam`?`definition`:`declaration`,br=(e,t)=>{if(e.kind===`OpDef`&&t.kind===`OpDef`){let n=e.source??e;return n===(t.source??t)?n.module===void 0||xr(n.module):!1}if(e.kind===`ThmOrAssumpDef`&&t.kind===`ThmOrAssumpDef`){let n=e.source??e;return n===(t.source??t)&&xr(n.module)}return!1},xr=e=>Fn(e,2).length===0&&Fn(e,3).length===0,Sr=e=>[...e.kind===`Let`?e.instances??[]:[],...n.Ht(e).flatMap(Sr)],Cr=e=>e.kind===`AssumeProve`?[...e.assumptions,e.conclusion].flatMap(e=>e.kind===`NewSymbol`?[]:Cr(e)):Sr(e),wr=(e,t)=>{let n=/* @__PURE__ */ new Set;for(let r of e.units)if(r.kind===`Module`&&n.add(r.module.name),r.kind===`Instance`&&r.instance.module===t)return n.has(t);return!1},Tr=e=>BigInt(e.startsWith(`\\`)?`0${e.slice(1).replace(/^h/i,`x`)}`:e).toString(),Er=e=>{let t=[],n=[],r=/* @__PURE__ */ new Map,i=(a,o)=>{let s=a===e,c=(e,t)=>e.forEach(e=>{t.push(e),r.has(e)||r.set(e,a.name)}),l=e=>!o.has(e);c(a.extends.filter(l),t),c(a.units.flatMap(e=>e.kind===`Instance`?[e.instance]:e.kind===`Definition`?Sr(e.definition.body):e.kind===`Theorem`&&s?Cr(e.theorem.statement):e.kind===`Assumption`&&s?Sr(e.assumption.expression):[]).map(e=>e.module).filter(e=>l(e)&&!wr(a,e)),n);let u=new Map(o);a.modules.forEach(e=>{let t=new Map(u),n=/* @__PURE__ */ new Set,r=e=>{n.has(e)||(n.add(e),e.extends.forEach(e=>{let n=t.get(e);n!==void 0&&(n.modules.forEach(e=>{t.has(e.name)||t.set(e.name,e)}),r(n))}))};r(e),i(e,t),u.set(e.name,e)})};return i(e,/* @__PURE__ */ new Map),{extendees:t,instancees:n,importers:r}},Dr=/* @__PURE__ */ new Set([`Identifier`,`Subexpression`,`OperatorReference`,`Lambda`]),Or=e=>{let t=e.kind===`Apply`?zn(e):void 0;return Dr.has(e.kind)||t!==void 0&&Bn(t)},kr=/* @__PURE__ */ new Map([[`Identifier`,`N_GeneralId`],[`Subexpression`,`N_GeneralId`],[`Number`,`N_Number`],[`Decimal`,`N_Real`],[`SetEnumeration`,`N_SetEnumerate`],[`SetFilter`,`N_SubsetOf`],[`SetMap`,`N_SetOfAll`],[`Tuple`,`N_Tuple`],[`FunctionApplication`,`N_FcnAppl`],[`FunctionConstruction`,`N_FcnConst`],[`FunctionSet`,`N_SetOfFcns`],[`Record`,`N_RcdConstructor`],[`RecordSet`,`N_SetOfRcds`],[`FieldAccess`,`N_RecordComponent`],[`Except`,`N_Except`],[`Prime`,`N_PostfixExpr`],[`Always`,`N_PrefixExpr`],[`Eventually`,`N_PrefixExpr`],[`Enabled`,`N_PrefixExpr`],[`Unchanged`,`N_PrefixExpr`],[`Forall`,`N_BoundedQuant`],[`Exists`,`N_BoundedQuant`],[`UnboundedQuantifier`,`N_UnboundedQuant`],[`Choose`,`N_UnBoundedOrBoundedChoose`],[`If`,`N_IfThenElse`],[`Case`,`N_Case`],[`Let`,`N_LetIn`],[`BoxAction`,`N_ActionExpr`],[`AngleAction`,`N_ActionExpr`],[`WeakFairness`,`N_FairnessExpr`],[`StrongFairness`,`N_FairnessExpr`]]),Ar=/* @__PURE__ */ new Set([`N_GeneralId`,`N_OpApplication`,`N_PrefixExpr`,`N_InfixExpr`,`N_PostfixExpr`,`N_FcnAppl`,`N_RecordComponent`]),jr=/* @__PURE__ */ new Set([`'`,`^+`,`^*`,`^#`]),Mr=(e,t)=>jr.has(t)?`N_GenPostfixOp`:e.kind===`Lambda`||t===`~`||t===`-.`?`N_GenNonExpPrefixOp`:`N_GenInfixOp`,Nr=(e,r,i={})=>{let a=[],o=(e,t)=>vn(a,{location:e,text:t,isWarning:!1}),s=(e,t)=>vn(a,{location:e,text:t,isWarning:!0}),c={value:i.version===`1.7.4`?-1:0},l=()=>++c.value,u={id:0},d=(e,t)=>{let n=_r(e,t.name);if(n===t)return;if(n===void 0){An(gr(e),t);return}let r=t.kind===`FormalParam`||vr(n)!==vr(t)||jn(n)!==jn(t);n.kind===`OpDef`&&n.defKind===`BuiltIn`&&!(r&&i.version===`1.7.4`)?o(t.location,`Symbol ${t.name} is a built-in operator, and cannot be redefined.`):r?o(t.location,`Multiply-defined symbol '${t.name}': this definition or declaration conflicts \nwith the one at ${yn(n.location)}.`):br(t,n)||s(t.location,`Multiple declarations or definitions for symbol ${t.name}. \nThis duplicates the one at ${yn(n.location)}.`)};i.version!==`1.7.4`&&_n(l);let f=_n(l);l();let p=new Map(f.map(e=>[e.name,e])),m=/* @__PURE__ */ new Map,h=/* @__PURE__ */ new Map,g=(e,r)=>{let a=e===i.rootFileName&&i.rootFilePath||`${e}.tla`,o=n=>new t.E(`Could not parse module ${e} from file ${a}`,e,n),s=i.version===`1.7.4`?n.Gt(r):void 0;if(s!==void 0)throw o(s);try{return n.H(sr(r))}catch(e){throw e instanceof t.O?o(n.W(r)??`***Parse Error***\n${e.message}`):e}},_=(e,n,r)=>{let a=h.get(e);if(a)return a;if(n===void 0)throw new t.S(e,r,i.version!==`1.7.4`);i.onParse?.(e);let o=g(e,n);if(o.name!==e)throw new t.E(`File name '${e}' does not match the name '${o.name}' of the top level module it contains.`,void 0);let s={file:Xn(o.name,n),module:o};return h.set(e,s),s},v=[],y=/* @__PURE__ */ new Set,b=[],x=(e,n,i)=>{let a=b.indexOf(e);if(a!==-1)throw new t.E(`Circular dependency among .tla files; dependency cycle is:\n\n ${[...b.slice(a),e].map(e=>`${e}.tla`).join(` --> `)}`,void 0);if(y.has(e))return;y.add(e),b.push(e);let o=D(e,_(e,n,i).module);[...o.extendees,...o.instancees].forEach(t=>x(t,r(t),e)),b.pop(),v.push(e)},S=/* @__PURE__ */ new Set,C=(e,t)=>S.has(`${e} ${t}`),w=(e,t,n)=>{let r=h.get(e);if(!r||n.has(e))return;n.add(e);let i=D(e,r.module),a=i[t].find(t=>!C(e,t));if(a!==void 0)return{name:a,importer:e,namingModule:i.importers.get(a)??e};for(let r of[...i.extendees,...i.instancees]){let i=C(e,r)?w(r,t,n):void 0;if(i)return i}},T=t=>{_(t,e);let n=()=>w(t,`extendees`,/* @__PURE__ */ new Set)??w(t,`instancees`,/* @__PURE__ */ new Set);for(let e=n();e!==void 0;e=n())h.has(e.name)||_(e.name,r(e.name),e.namingModule),S.add(`${e.importer} ${e.name}`)},E=i.rootFileName??g(``,e).name,D=(e,t)=>{let n=Er(t);return e!==E||i.rootExtendees===void 0||(n.extendees.splice(t.extends.length,0,...i.rootExtendees),i.rootExtendees.forEach(t=>{n.importers.has(t)||n.importers.set(t,e)})),n};T(E),x(E,e);let O=(e,n,r,a)=>{let c={curLevel:0,unresolvedCount:[0],unresolvedSum:0,recursiveSectionCount:0},f=[],h=[],g=[],_=[],v=/* @__PURE__ */ new WeakSet,y=()=>_.push({labels:/* @__PURE__ */ new Map,params:[]}),b=()=>_.pop()?.labels??/* @__PURE__ */ new Map,x={depth:0,isDeclared:[],goal:void 0,goalClause:0},S=/* @__PURE__ */ new WeakMap,C=/* @__PURE__ */ new WeakMap,w=e=>{let t=e.kind===`AssumeProve`?S.get(e):void 0;t&&(t.isInProof=!1)},T=e=>K(n,G(n,e)),E=e=>e.range?tr(n,e.range):{start:Qn(n,e),end:Qn(n,e)},D={kind:`Module`,id:l(),name:e.name,location:K(n,E(e.location)),extendees:[],context:gr(a),topLevel:[],definitions:[],opDefsInRecursiveSection:[],isLevelChecked:!1,levelCorrect:!0,argLevelParams:/* @__PURE__ */ new Map,levelConstraints:/* @__PURE__ */ new Map,argLevelConstraints:/* @__PURE__ */ new Map,records:[]};r&&r.definitions.push(D);let ee=e=>{for(let t=a.contexts.length-1;t>=0;t--){let n=Nn(a.contexts[t],e);if(n?.kind===`Module`)return n}return m.get(e)},te=e=>{let n=ee(e);if(n===void 0)throw new t.O(`Could not find module ${e}`);return n},k=(e,t)=>{a.contexts.push(e);let n=t();return a.contexts.pop(),n},A=(e,t,n,r)=>{let i={...H(l()),kind:`FormalParam`,name:e,arity:t,location:n};return r&&d(a,i),i},j=e=>({...H(l()),kind:`OpDef`,defKind:`UserDefined`,arity:e.params?.length??0,params:[],body:void 0,isLocal:!1,module:D,source:void 0,preComments:[],isDefined:!0,inRecursive:!1,inRecursiveSection:!1,recursiveSection:-1,letInLevel:0,weights:(e.params??[]).map(()=>0),isLeibnizArg:(e.params??[]).map(()=>!0),isLeibniz:!0,opLevelCond:void 0,maxLevels:(e.params??[]).map(()=>3),minMaxLevel:void 0,labels:/* @__PURE__ */ new Map,step:void 0,...e}),ne=e=>{e.letInLevel=c.curLevel,c.unresolvedSum>0&&(e.recursiveSection=c.recursiveSectionCount,e.inRecursiveSection=c.unresolvedCount[c.curLevel]>0,D.opDefsInRecursiveSection.push(e))},re=(e,t,n,r={},i=l())=>({...H(i),kind:`OpAppl`,operator:e,operands:t,unbounded:r.unbounded,bounded:r.bounded,tupleOrs:r.tupleOrs,ranges:r.ranges??[],location:n}),M=()=>({...re(ie(`$Nop`),[],gn,{},u.id),isNull:!0}),ie=e=>{let n=p.get(e);if(!n)throw new t.A(`SANY has no builtin operator ${e}`);return n},N=(e,t,n,r={})=>re(ie(e),t,n,r),ae=(e,t)=>({...H(l()),kind:`String`,value:e,location:t}),oe=(e,t)=>({...H(l()),kind:`OpArg`,op:e,location:t}),se=(e,n)=>{let r=_r(a,fr(e));if(r===void 0||r.kind===`Module`)throw new t.O(`Unknown operator: \`${e}' at line ${n.beginLine}, column ${n.beginColumn} of module ${n.file}`);return r},ce=(e,t,n)=>{if(e.kind!==`OpDef`||e.defKind!==`UserDefined`)return;let r=e.params??[];r.length===t.length?r.forEach((r,i)=>{let a=t[i];r.arity===0&&a.kind===`OpArg`&&o(n,`Operator used in argument number ${i+1} has incorrect number of arguments.`);let s=a.kind===`OpArg`&&jn(a.op)===r.arity&&!(a.op.kind===`OpDef`&&(a.op.params??[]).some(e=>e.arity>0));r.arity>0&&!s&&o(n,`Argument number ${i+1} to operator '${e.name}' \nshould be a ${r.arity}-parameter operator.`)}):o(n,`Wrong number of arguments (${t.length}) given to operator '${e.name}', \nwhich requires ${r.length} arguments.`)},le=qn({version:i.version,resolveSymbol:e=>_r(a,e),resolveSynonym:fr,generateExpression:e=>L(e),generateArgument:(e,t,n,r)=>ve(e,t,n,r),createOpAppl:(e,t,n)=>{let r=re(e,t,n);return ce(e,t,n),r},createOpArg:oe,createFormalParam:(e,t,n)=>A(e,t,n,!1),createLambda:(e,t,r)=>j({name:`LAMBDA`,params:e,body:t,location:r,preComments:cr(n,Qn(n,{line:r.beginLine,column:r.beginColumn}))}),copySubstIn:(e,t)=>Be(`SubstIn`,e.substs,t,e.instantiatedModule,e.location,e.instantiatingModule),getBuiltin:ie,addError:(e,t)=>(o(e,t),M()),isOutOfLabelScope:e=>{let t=C.get(e);return t!==void 0&&t.scope.isDeclaredBefore[t.clause]&&t.scope.isSuffices===t.scope.isInProof},isOutOfClauseScope:(e,t)=>{let n=S.get(e);return n!==void 0&&n.isDeclaredBefore[t-1]&&(!n.hasGoal||n.isSuffices===n.isInProof)}}),ue=(e,t)=>{let r={value:t.start};return e.map(e=>{let i=e.op===`Name`?e.name:e.op===`Null`?`(`:String(e.op),a=ur(n,r.value,t.end,i);if(a===-1)return e;if(e.op===`Null`){let t=er(n,a);return r.value=t+1,{...e,location:K(n,{start:a,end:t})}}r.value=a+1;let o=q(n,a);if(e.args===void 0||!W(n,a+1,`(`))return{...e,location:o};let s=er(n,a+1);return r.value=s+1,{...e,location:o,argsLocation:K(n,{start:a+1,end:s})}})},de=(e,r,i,a)=>{let o=zn(e);if(o===void 0)throw new t.O(`Expected a name, found ${e.kind}`);return le(ue(o,G(n,e)),r,i,a,T(e))},fe=e=>{let n=de(e,0,!1,!1);if(n.kind!==`OpAppl`)throw new t.O(`Expected an expression`);return n},pe=e=>{if(e.kind!==`OpAppl`)return;let t=f.find(t=>t.name===e.operator.name);t&&(t.node.operator=ie(`$RecursiveFcnSpec`))},me=e=>e.reduce((e,t)=>{let n=e[e.length-1];return n!==void 0&&n[0].set===t.set&&t.pattern.kind===`Name`&&n[0].pattern.kind===`Name`?n.push(t):e.push([t]),e},[]),P=(e,t)=>R(e,t,me(e).map(e=>L(e[0].set))),F=(e,t)=>{let n=_.at(-1);n?.params.push(e);let r=L(t);return n?.params.pop(),r},he=e=>{let t=G(n,e),r=lr(n,t.start,t.end,e.params);return k(U(),()=>{let i=e.params.map((e,t)=>A(e,0,q(n,r[t]),!0)),a=F(i,e.body);return j({name:`LAMBDA`,params:i,body:a,location:K(n,t),preComments:cr(n,t.start)})})},ge=e=>e.kind===`OperatorReference`?e.operator:e.kind===`Lambda`&&e.body.kind===`Apply`?e.body.operator:n.tokens[Qn(n,e.location)].text,_e=(e,n)=>{let r=T(e);if(e.kind===`Lambda`)return e.location.range===void 0?oe(se(ge(e),r),r):oe(he(e),r);if(!Or(e))return o(r,`Arity ${n.arity} operator (not an expression) is expected \nto substitute for CONSTANT '${n.name}'.`),M();if(e.kind===`OperatorReference`)return oe(se(e.operator,r),r);let i=de(e,n.arity,!1,!1);if(i.kind===`OpArg`||i.kind===`OpAppl`&&i.isNull===!0)return i;throw new t.O(`Expected an operator argument at line ${r.beginLine}, column ${r.beginColumn}`)},ve=(e,r,i,s)=>{let c=e.kind===`OpDef`&&(e.defKind===`UserDefined`||e.defKind===`ModuleInstance`)?e.params?.[r]?.arity??0:0;if(c===0)return L(i);let l=G(n,i),u=K(n,l),d=`${r+1} (counting from 1)`,f=rr(n,l);if(f!==l||!Or(i))return o(K(n,f),`An expression appears as argument number ${d} to operator '${e.name}', in a position an operator is required.`),M();if(i.kind===`Identifier`||i.kind===`Subexpression`||i.kind===`Apply`){let e=de(i,c,!1,!1);if(e.kind===`OpArg`||e.kind===`OpAppl`)return e;throw new t.O(`Expected an operator argument at ${yn(u)}`)}if(i.kind===`Lambda`&&i.location.range!==void 0){let t=he(i),n=jn(t);return n===c?oe(t,u):(o(s,`Lambda expression with arity ${n} used as argument ${r+1} of operator \`${e.name}', \nbut an operator of arity ${c} is required.`),M())}let p=ge(i),m=_r(a,fr(p));if(m===void 0)return o(u,`Could not find declaration or definition of symbol '${p}'.`),M();let h=jn(m);return h===c?oe(m,u):(o(s,`Operator with incorrect arity passed as argument. \nOperator '${m.name}' of arity ${h} is argument number ${d} to operator \`${yn(e.location)}', \nbut an operator of arity ${c} was expected.`),M())},ye=e=>{let t=T(e);if(e.isBulleted)return N(e.kind===`And`?`$ConjList`:`$DisjList`,e.operands.map(L),t);let r=G(n,e),i=e.kind===`And`?`\\land`:`\\lor`,[a,...o]=e.operands;return o.reduce((e,t,a)=>{let s=nr(n,G(n,t)),c=a===o.length-1?r.end:s.end;return N(i,[e,L(t)],K(n,{start:r.start,end:c}))},L(a))},be=e=>{let t=G(n,e),r=e.arms.map((r,i)=>{let a=nr(n,G(n,r.condition)),o=i===e.arms.length-1&&e.other===void 0,s=nr(n,G(n,r.body)),c=[L(r.condition),L(r.body)];return N(`$Pair`,c,K(n,{start:a.start,end:o?t.end:s.end}))}),i=e.other;if(i){let e=nr(n,G(n,i)),a=xe(e.start,`OTHER`);r.push(N(`$Pair`,[void 0,L(i)],K(n,{start:a,end:t.end})))}return N(`$Case`,r,K(n,t))},xe=(e,t)=>{for(let r=e;r>=0;r--)if(W(n,r,t))return r;return e},Se=e=>{let t=G(n,e),r=K(n,t),i=[L(e.function)],a=N(`$Except`,i,r),o=G(n,e.function),s={value:ur(n,o.end+1,t.end,`EXCEPT`)+1};return e.updates.forEach(e=>{let r=ur(n,s.value,t.end,`!`),o=nr(n,G(n,e.value)),c=K(n,{start:r,end:o.end}),l={value:r+1},u=e.path.map(e=>{if(e.kind===`Field`){let t=Ce(l.value,e.name);return l.value=t+1,ae(e.name,q(n,t))}let r=ur(n,l.value,t.end,`[`),i=er(n,r);return l.value=i+1,e.args.length===1?L(e.args[0]):N(`$Tuple`,e.args.map(L),K(n,{start:r,end:i}))}),d=N(`$Seq`,u,c),f=N(`$Pair`,[d],c);g.push(f),h.push(a),f.operands.push(L(e.value)),g.pop(),h.pop(),i.push(f),s.value=o.end+1}),a},Ce=(e,t)=>{for(let r=e;r<n.tokens.length;r++)if(n.tokens[r].text===t&&n.tokens[r].kind!==`String`)return r;return e},we=(e,t)=>{let r=G(n,t),i={value:r.start+1},a=t.fields.map((e,r)=>{let a=Ce(i.value,e.name),s=nr(n,G(n,e.value));return i.value=s.end+1,t.fields.slice(0,r).some(t=>t.name===e.name)&&o(q(n,a),`Non-unique fields in constructor.`),N(`$Pair`,[ae(e.name,q(n,a)),L(e.value)],K(n,{start:a,end:s.end}))}),s=N(e,a,K(n,r));return D.records.push(s),s},Te=e=>({line:n.tokens[e].line,column:n.tokens[e].column}),Ee=e=>{let t=[],r=e;for(;n.tokens[r]?.kind===`Identifier`;){let e=W(n,r+1,`(`)?er(n,r+1):r,i=n.tokens.slice(r+1,e).filter(e=>e.text===`_`).length;if(t.push({name:n.tokens[r].text,arity:i,location:{...Te(r),range:{module:n.name,start:Te(r),end:Te(e)}}}),!W(n,e+1,`,`))break;r=e+2}return t},De=e=>{let t=[...e.definitions.map(e=>({unit:{kind:`Definition`,definition:e},span:Me(e)})),...(e.instances??[]).map(e=>({unit:{kind:`Instance`,instance:e},span:Me(e)}))],r=G(n,e).start,i=nr(n,G(n,e.body)).start,a=[];for(let e=r+1;e<i;e++){let r=t.some(t=>t.span.start<=e&&e<=t.span.end);W(n,e,`RECURSIVE`)&&!r&&a.push({unit:{kind:`Recursive`,declarations:Ee(e+1)},span:{start:e,end:e}})}return[...t,...a].toSorted((e,t)=>e.span.start-t.span.start).map(e=>e.unit)},I=e=>{let t=U();return k(t,()=>{c.curLevel++,c.unresolvedCount[c.curLevel]=0;let n=[],r=[];De(e).forEach(e=>{e.kind===`Recursive`?Le(e.declarations):e.kind===`Instance`?Ve(e.instance,n,r):e.definition.kind===`Function`?Fe(e.definition,n):Ne(e.definition,n)}),Re(),c.curLevel=Math.max(c.curLevel-1,0);let i=L(e.body);return{...H(l()),kind:`LetIn`,opDefs:n,instances:r,body:i,context:t,location:T(e)}})},Oe=e=>{let t=G(n,e),r=K(n,t);return k(U(),()=>{let i=e.pattern,a=i.kind===`Name`?[i.name]:i.names;if(e.set===void 0){let o=lr(n,t.start,t.end,a),s=a.map((e,r)=>A(e,0,q(n,i.kind===`Name`?t.start:o[r]),!0)),c=F(s,e.body);return N(`$UnboundedChoose`,[c],r,{unbounded:s})}let o=L(e.set),s=G(n,e.set),c=lr(n,t.start,s.start,a),l=a.map((e,t)=>A(e,0,q(n,c[t]),!0)),u=F(l,e.body);return N(`$BoundedChoose`,[u],r,{bounded:[l],tupleOrs:[i.kind===`Tuple`],ranges:[o]})})},ke=e=>{if(mr(e.operator)||hr(e.operator)||e.args.length>2||_r(a,fr(e.operator))!==void 0)return;let t=G(n,e);if(n.tokens[t.start].text===e.operator&&W(n,t.start+1,`(`))return;let r=nr(n,G(n,e.args[0])),i=e.args.length===1&&r.start!==t.start,o=i?t.start:r.end+1,s=ar(n,o);return{index:o,name:i&&s===`-`?`-.`:s,fixity:i?`prefix`:e.args.length===2?`infix`:`postfix`}},L=e=>{let t=T(e);switch(e.kind){case`Number`:return{...H(l()),kind:`Numeral`,value:Tr(e.text??String(e.value)),location:t};case`Decimal`:{let[n,r]=e.text.split(`.`),i=BigInt(n+r),a=i<=9223372036854775807n;return{...H(l()),kind:`Decimal`,mantissa:i.toString(),exponent:String(a?-r.length:r.length),integralPart:n,fractionalPart:r,location:t}}case`String`:return ae(e.value,t);case`Identifier`:{let t=fe(e);return pe(t),t}case`Apply`:{let r=ke(e);if(r!==void 0)return o(q(n,r.index),`Could not find declaration or definition of symbol '${r.name}'.`),o(t,`Couldn't resolve ${r.fixity} operator symbol \`${r.name}'.`),{...M(),isAbsent:!0};let i=fe(e);return(hr(e.operator)||mr(e.operator))&&pe(i),i}case`Bracket`:return o(q(n,G(n,e).start),"Unsupported expression type `['."),{...M(),isAbsent:!0};case`OperatorReference`:case`Lambda`:{let r=n.tokens[G(n,e).start].text;return o(t,r===`LAMBDA`?`LAMBDA expression used where an expression is required.`:`Unsupported expression type \`${Mr(e,r)}'.`),{...M(),isAbsent:!0}}case`And`:case`Or`:return ye(e);case`Prime`:return N(`'`,[L(e.expression)],t);case`Unchanged`:return N(`UNCHANGED`,[L(e.expression)],t);case`Enabled`:return N(`ENABLED`,[L(e.expression)],t);case`Always`:return N(`[]`,[L(e.expression)],t);case`Eventually`:return N(`<>`,[L(e.expression)],t);case`If`:return N(`$IfThenElse`,[L(e.condition),L(e.consequent),L(e.alternative)],t);case`Case`:return be(e);case`Let`:return I(e);case`Forall`:case`Exists`:{let r=G(n,e);return k(U(),()=>{let n=P(e.bounds,r.start),i=F(n.bounded.flat(),e.body);return N(e.kind===`Forall`?`$BoundedForall`:`$BoundedExists`,[i],t,n)})}case`UnboundedQuantifier`:{let r=G(n,e),i=G(n,e.body),a=lr(n,r.start,i.start,e.names),o=e.isTemporal?e.quantifier===`Forall`?`$TemporalForall`:`$TemporalExists`:e.quantifier===`Forall`?`$UnboundedForall`:`$UnboundedExists`;return k(U(),()=>{let r=e.names.map((e,t)=>A(e,0,q(n,a[t]),!0)),i=F(r,e.body);return N(o,[i],t,{unbounded:r})})}case`Choose`:return Oe(e);case`SetEnumeration`:return N(`$SetEnumerate`,e.elements.map(L),t);case`Tuple`:return N(`$Tuple`,e.elements.map(L),t);case`SetFilter`:{let r=L(e.bound.set),i=G(n,e);return k(U(),()=>{let n=R([e.bound],i.start,[r]),a=F(n.bounded.flat(),e.predicate);return N(`$SubsetOf`,[a],t,n)})}case`SetMap`:{let r=G(n,e.expression);return k(U(),()=>{let n=P(e.bounds,r.end+1),i=F(n.bounded.flat(),e.expression);return N(`$SetOfAll`,[i],t,n)})}case`FunctionConstruction`:{let r=G(n,e);return k(U(),()=>{let n=P(e.bounds,r.start),i=F(n.bounded.flat(),e.body);return N(`$FcnConstructor`,[i],t,n)})}case`FunctionSet`:return N(`$SetOfFcns`,[L(e.domain),L(e.range)],t);case`Record`:return we(`$RcdConstructor`,e);case`RecordSet`:return we(`$SetOfRcds`,e);case`Except`:return Se(e);case`ExceptAt`:{let e=h[h.length-1],n=g[g.length-1];return e===void 0||n===void 0?(o(t,`@ used where its meaning is not defined.`),M()):{...H(l()),kind:`At`,except:e,component:n,location:n.location}}case`FunctionApplication`:{let n=L(e.function);if(bn(n))return n;pe(n);let r=e.args.length===1?L(e.args[0]):N(`$Tuple`,e.args.map(L),t);return N(`$FcnApply`,[n,r],t)}case`FieldAccess`:{let r=L(e.record),i=G(n,e);return N(`$RcdSelect`,[r,ae(e.field,q(n,i.end))],t)}case`Product`:return N(`$CartesianProd`,e.factors.map(L),t);case`BoxAction`:case`AngleAction`:return N(e.kind===`BoxAction`?`$SquareAct`:`$AngleAct`,[L(e.action),L(e.subscript)],t);case`WeakFairness`:case`StrongFairness`:return N(e.kind===`WeakFairness`?`$WF`:`$SF`,[L(e.subscript),L(e.action)],t);case`Label`:return Ae(e);case`Subexpression`:return fe(e)}},R=(e,t,r)=>{let i=me(e),a={value:t};return{bounded:i.map(e=>{let t=G(n,e[0].set),r=e.flatMap(e=>e.pattern.kind===`Name`?[e.pattern.name]:e.pattern.names),i=lr(n,a.value,t.start,r);return a.value=t.end+1,r.map((e,t)=>A(e,0,q(n,i[t]),!0))}),tupleOrs:i.map(e=>e[0].pattern.kind===`Tuple`),ranges:r}},Ae=e=>{let t=T(e),r=_.at(-1);if(r===void 0)return o(t,`Label not in definition or proof step.`),M();if(x.isDeclared.slice(2,x.depth+1).some(Boolean))return o(t,`Label not allowed within scope of declaration in nested ASSUME/PROVE.`),M();if(h.length>0&&g.length>0)return o(t,`Labels inside EXCEPT clauses are not yet implemented.`),M();y();let i=L(e.body),s=b(),c=lr(n,G(n,e).start,G(n,e.body).start,e.params),u=e.params.map((t,r)=>{let i=_r(a,t);if(i?.kind===`FormalParam`)return i;let s=q(n,c[r]);return o(s,`Illegal parameter ${t} of label \`${e.name}'.`),A(t,0,s,!1)}),d={...H(l()),kind:`Label`,name:e.name,params:u,body:i,labels:s,isAssumeProve:!1,location:t},f=/* @__PURE__ */ new Set;if(u.forEach(e=>{f.has(e)&&o(t,`Repeated formal parameter ${e.name} \nin label \`${d.name}'.`),f.add(e)}),r.params.flat().forEach(e=>{f.delete(e)||o(t,`Label ${d.name} must contain formal parameter \`${e.name}'.`)}),f.size>0){let e=[...f].map(e=>`${e.name} `).join(``);o(t,`Label ${d.name} declares extra parameter(s) ${e}`)}r.labels.has(d.name)?o(t,`Duplicate label \`${d.name}'.`):r.labels.set(d.name,d);let p=x.goal;return p&&C.set(d,{scope:p,clause:x.goalClause}),d},je=(e,t,r)=>{let i={value:t.start};return e.params.map(e=>{let t=e.location?Qn(n,e.location):Ce(i.value,e.name),a=z(t,e.arity);return i.value=a.end+1,A(fr(e.name),e.arity,K(n,a),r)})},Me=e=>{let t=E(e.location);return e.isLocal&&!W(n,t.start,`LOCAL`)&&W(n,t.start-1,`LOCAL`)?{start:t.start-1,end:t.end}:t},Ne=(e,t)=>{let r=Me(e),i=K(n,r),s=fr(e.name),l={start:e.isLocal?r.start+1:r.start,end:r.end},u=k(U(),()=>{let t=je(e,l,!0),n=_r(a,s);if(n?.kind===`OpDef`&&n.inRecursive&&!n.isDefined){let e=n.params?.length===t.length&&(t.length===0||t[t.length-1].arity===0);n.letInLevel===c.curLevel?e||o(i,`Definition of ${n.name} has different arity than its RECURSIVE declaration.`):o(i,`Recursive operator ${s} defined at wrong LET/IN level.`)}else n!==void 0&&o(i,`Operator ${s} already defined or declared.`);return y(),{params:t,body:L(e.body),existing:n}}),f=b(),p=u.existing,m=u.params,h=cr(n,r.start);if(p?.kind===`OpDef`&&p.inRecursive&&!p.isDefined&&p.letInLevel===c.curLevel){p.params=m,p.weights=m.map(()=>0),p.maxLevels=m.map(()=>3),p.isLeibnizArg=m.map(()=>!0),p.labels=f,Pe(p,u.body,i,h),D.definitions.push(p),t?.push(p);return}let g=j({name:s,params:m,body:u.body,isLocal:e.isLocal,location:i,preComments:h,labels:f});d(a,g),ne(g),D.definitions.push(g),t?.push(g)},Pe=(e,t,n,r)=>{e.isDefined=!0,e.body=t,e.location=n,e.preComments=r,e.inRecursive&&(c.unresolvedCount[c.curLevel]--,c.unresolvedSum--)},Fe=(e,t)=>{let r=Me(e),i=K(n,r),s=U(),l=e.isLocal?r.start+1:r.start,u=k(s,()=>P(e.bounds,l+1)),p=_r(a,e.name),m=k(s,()=>A(e.name,0,i,p===void 0)),h=N(`$NonRecursiveFcnSpec`,[],i,{unbounded:[m],...u}),g=p?.kind===`OpDef`&&p.inRecursive&&!p.isDefined,_=g&&p.letInLevel===c.curLevel;_?p.arity!==0&&o(i,`Function ${p.name} has operator arguments in its RECURSIVE declaration.`):g?o(i,`Recursive function ${e.name} defined at wrong LET/IN level.`):p!==void 0&&o(i,`Function name \`${e.name}' already defined or declared.`);let v=cr(n,r.start),x=p===void 0?j({name:e.name,params:[],body:h,isLocal:e.isLocal,location:i,preComments:v}):p.kind===`OpDef`&&(_||!g)?p:void 0;_?p.arity===0&&Pe(p,h,i,v):p===void 0&&x!==void 0&&(d(a,x),ne(x)),x!==void 0&&(D.definitions.push(x),t?.push(x)),f.unshift({name:e.name,node:h}),y();let S=()=>F(u.bounded.flat(),e.body),C=x===void 0?S():k(s,S),w=b();x!==void 0&&(x.labels=w),f.shift(),h.operands=[C],h.operator.name===`$NonRecursiveFcnSpec`&&(h.unbounded=void 0)},Ie=[],Le=e=>{c.unresolvedSum===0&&c.recursiveSectionCount++,c.unresolvedCount[c.curLevel]+=e.length,c.unresolvedSum+=e.length,e.forEach(e=>{let t=ut(e);l();let r=Array.from({length:e.arity},()=>A(``,0,void 0,!1)),i=j({name:fr(e.name),params:r,location:K(n,t),isDefined:!1,inRecursive:!0,inRecursiveSection:!0,recursiveSection:c.recursiveSectionCount,letInLevel:c.curLevel});d(a,i),Ie.push(i),D.opDefsInRecursiveSection.push(i)})},Re=()=>{c.unresolvedCount[c.curLevel]!==0&&(Ie.filter(e=>e.letInLevel===c.curLevel&&!e.isDefined).forEach(e=>o(e.location,`Symbol ${e.name} declared in RECURSIVE statement but not defined.`)),c.unresolvedSum-=c.unresolvedCount[c.curLevel])},ze=(e,t,r)=>{l();let s=Dn(t.table).filter(e=>e.kind===`OpDecl`),c=s.flatMap(e=>{let t=_r(a,e.name);return t===void 0?[]:[{op:e,expr:e.declKind===3||e.declKind===2&&e.arity===0?re(t,[],r):oe(t,r),isImplicit:!0}]}),u=(e,t)=>{let n=t.kind===`OpArg`?jn(t.op):0,r=e.arity>0&&t.kind===`OpAppl`&&t.isNull===!0;n!==e.arity&&!r&&o(t.location,`An operator must be substituted for symbol '${e.name}', and it must have arity ${e.arity}.`)},d=Me(e),f={value:ur(n,d.start,d.end,`WITH`)+1};return e.substitutions.forEach(e=>{let i=ur(n,f.value,d.end,e.name);i!==-1&&(f.value=G(n,e.expression).end+1);let a=Mn(t,fr(e.name));if(a?.kind!==`OpDecl`){o(i===-1?r:q(n,i),`Identifier '${i===-1?e.name:ar(n,i)}' 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 s=a.arity===0?L(e.expression):_e(e.expression,a);u(a,s);let l=c.find(e=>e.op.name===a.name);l&&!l.isImplicit?o(T(e.expression),`Multiple substitutions for symbol '${a.name}' in substitution.`):l?(l.expr=s,l.isImplicit=!1):c.push({op:a,expr:s,isImplicit:!1})}),c.filter(e=>e.isImplicit&&i.version!==`1.7.4`).forEach(e=>u(e.op,e.expr)),s.filter(e=>!c.some(t=>t.op.name===e.name)).forEach(e=>o(r,`Substitution missing for symbol ${e.name} declared at ${yn(e.location)} \nand instantiated in module ${D.name}.`)),c},Be=(e,t,n,r,i,a=D)=>(bn(n)&&o(i,e===`SubstIn`?`Substitution error, probably due to error
|
|
33
|
+
in module being instantiated.`:`Substitution error, probably due to error in module being instantiated.`),{...H(l()),kind:e,substs:t,body:n,instantiatingModule:a,instantiatedModule:r,location:i}),Ve=(e,t,r)=>{let o=Me(e),s=K(n,o),c=cr(n,o.start),u=e.name??``,f=U(),p=e.isLocal?o.start+1:o.start;e.params.length>0&&a.contexts.push(f);let m=je(e,{start:p,end:o.end},e.params.length>0),h=te(e.module),g=h.context,_=ze(e,g,s);e.params.length>0&&a.contexts.pop(),Dn(g.table).forEach(n=>{if(n.kind!==`OpDef`||n.isLocal||n.defKind!==`UserDefined`&&n.defKind!==`ModuleInstance`)return;let r=[...m,...n.params??[]],i=`${u}!${n.name}`,o=n.defKind===`UserDefined`?j({name:i,params:r,body:_.length>0&&n.body?Be(`SubstIn`,_,n.body,h,s):n.body,isLocal:e.isLocal,location:s,source:n.source??n,preComments:c,labels:n.labels}):j({defKind:`ModuleInstance`,name:i,params:r,isLocal:e.isLocal,location:s,module:n.module,source:n.source??n,preComments:c});d(a,o),n.defKind===`UserDefined`&&ne(o),(t??D.definitions).push(o)}),Dn(g.table).forEach(n=>{if(n.kind!==`ThmOrAssumpDef`||n.isLocal)return;let r=_.length>0?Be(`APSubstIn`,_,n.body,h,s):n.body,i={...H(l()),kind:`ThmOrAssumpDef`,name:`${u}!${n.name}`,isTheorem:n.isTheorem,body:r,params:[...m,...n.params],isLocal:e.isLocal,location:s,module:D,source:n.source??n,labels:n.labels,isLeibnizArg:[],isLeibniz:!1,opLevelCond:[],maxLevels:[],minMaxLevel:[]};d(a,i),(t??D.definitions).push(i)});let v={...H(l()),kind:`Instance`,name:u,isLocal:e.isLocal,params:m,module:h,substs:_,location:s};(r??D.topLevel).push(v);let y=j({defKind:`ModuleInstance`,name:u,params:m,isLocal:e.isLocal,location:s,preComments:c});d(a,y),i.version!==`1.7.4`&&t?.push(y)},He=(e,t=!0,r)=>{let i=Me(e),o=r??K(n,i),s=cr(n,i.start),c=te(e.module),u=c.context,f=ze(e,u,o),p=e.isLocal,m=xr(c);Dn(u.table).forEach(e=>{if(e.kind!==`OpDef`||e.defKind!==`UserDefined`||e.isLocal)return;let t=(t,n)=>{let r=j({name:e.name,params:e.params,body:n,isLocal:p,location:o,module:t,source:e.source??e,preComments:s,labels:e.labels});return d(a,r),r},n=()=>(d(a,e),e),r=e.module===void 0||xr(e.module),i=m||r?p?t(e.module,e.body):n():t(D,e.body&&Be(`SubstIn`,f,e.body,c,o));D.definitions.push(i),ne(i)}),Dn(u.table).forEach(e=>{if(e.kind!==`ThmOrAssumpDef`||e.isLocal)return;let n=(t,n)=>{let r={...e,...H(l()),body:n,isLocal:p,location:o,module:t,source:e.source??e};return d(a,r),r},r=m?p?n(e.module,e.body):(d(a,e),e):xr(e.module)?p?n(D,e.body):e:n(D,Be(`APSubstIn`,f,e.body,c,o));t&&D.definitions.push(r)});let h={...H(l()),kind:`Instance`,name:void 0,isLocal:p,params:[],module:c,substs:f,location:o};return t&&D.topLevel.push(h),h},Ue=e=>{let t=ee(e.name)??(e.name===D.name?D:void 0);return t===void 0?(o(q(n,Qn(n,e.location)+1),`Module \`${e.name}' used without being extended or instantiated.`),[]):[t]},We=e=>e.flatMap(e=>{if(e.kind===`ModuleFact`)return Ue(e);let n=zn(e);if(n===void 0||!Bn(n))return[L(e)];let r=de(e,0,!0,!1);if(r.kind===`ThmOrAssumpDef`)throw new t.O(`Expected a fact`);return[r]}),Ge=e=>W(n,e.start,`(`)&&er(n,e.start)===e.end,Ke=e=>nr(n,G(n,e)),qe=(e,t)=>Ke(e.args[0]).start===t.start?e.args.length===2?`N_InfixExpr`:`N_PostfixExpr`:n.tokens[t.start].kind===`Identifier`?`N_OpApplication`:`N_PrefixExpr`,Je=(e,t)=>Ge(t)?`N_ParenExpr`:e.kind===`String`?ar(n,t.start):e.kind===`Apply`?qe(e,t):kr.get(e.kind),Ye=(e,t)=>{if(e.kind===`String`&&!Ge(t))return!1;if(e.kind===`Identifier`&&!e.name.includes(`!`))return!0;let n=Je(e,t);return n===void 0||Ar.has(n)?void 0:!0},Xe=(e,t)=>{let r=(e,t=Ke(e))=>({last:t,lastKind:Je(e,t)});if(Ge(t))return{hasChildlessFirstChild:!1,...r(e,{start:t.start+1,end:t.end-1})};switch(e.kind){case`If`:case`BoxAction`:case`AngleAction`:return{hasChildlessFirstChild:!1,...r(e.kind===`If`?e.condition:e.action)};case`Tuple`:case`SetEnumeration`:{let i=e.elements[0];return i===void 0?{hasChildlessFirstChild:!1,last:{start:t.end,end:t.end},lastKind:n.tokens[t.end].text}:{hasChildlessFirstChild:!1,...r(i)}}case`Always`:case`Eventually`:case`Enabled`:case`Unchanged`:return{hasChildlessFirstChild:!0,...r(e.expression,{start:t.start+1,end:t.end})};case`Prime`:return{hasChildlessFirstChild:Ye(e.expression,Ke(e.expression)),last:{start:t.end,end:t.end},lastKind:`N_GenPostfixOp`};case`FunctionApplication`:case`FieldAccess`:{let t=e.kind===`FunctionApplication`?e.function:e.record,r=Ke(t),i=r.end+1;return{hasChildlessFirstChild:Ye(t,r),last:{start:i,end:i},lastKind:n.tokens[i].text}}case`Apply`:{let n=qe(e,t);if(n===`N_OpApplication`)return e.operator.includes(`!`)?void 0:{hasChildlessFirstChild:!0,last:{start:t.start+1,end:t.end},lastKind:`N_OpArgs`};if(n===`N_PrefixExpr`)return{hasChildlessFirstChild:!0,...r(e.args[0],{start:t.start+1,end:t.end})};let i=Ke(e.args[0]),a=i.end+1;return{hasChildlessFirstChild:Ye(e.args[0],i),last:{start:a,end:a},lastKind:n===`N_InfixExpr`?`N_GenInfixOp`:`N_GenPostfixOp`}}}},Ze=e=>{let t=nr(n,G(n,e));if((e.kind===`Identifier`||e.kind===`Subexpression`||e.kind===`OperatorReference`)&&!Ge(t))return!1;let r=Xe(e,t);if(r?.hasChildlessFirstChild===void 0||r.lastKind===void 0)return!1;let i=K(n,r.last);return r.hasChildlessFirstChild&&o(K(n,t),`Was expecting a GeneralId.`),r.lastKind===`N_OpArgs`?o(i,"Selector `!(...)' should not have argument(s)."):(o(i,`Unexpected token found.`),o(i,`Need name or step number here, not \`${r.lastKind}'.`)),o(K(n,t),`DEF clause entry should describe a defined operator.`),!0},Qe=e=>e.flatMap(e=>{if(e.kind===`ModuleFact`)return Ue(e);if(Ze(e))return[];let t=de(e.kind===`OperatorReference`?{kind:`Identifier`,name:e.operator,location:e.location}:e,-1,!1,!0);return t.kind===`OpDef`||t.kind===`ThmOrAssumpDef`&&!t.name.startsWith(`<`)?[t]:(o(T(e),`DEF clause entry should describe a defined operator.`),[])}),$e=(e,t)=>{e.isOnly||e.facts.length+e.defs.length>0||o(t,`Empty BY, USE, or HIDE`)},et=e=>{let t=K(n,E(e.location));$e(e,t);let r=We(e.facts),i=Qe(e.defs);return r.length+i.length===0&&o(t,`Empty USE or HIDE statement.`),e.kind===`Hide`&&r.filter(e=>e.kind===`OpAppl`&&e.operator.kind!==`ThmOrAssumpDef`).forEach(e=>o(e.location,`The only expression allowed as a fact in a HIDE is
|
|
34
|
+
the name of a theorem, assumption, or step.`)),{...H(l()),kind:`UseOrHide`,facts:r,defs:i,isOnly:e.isOnly,isHide:e.kind===`Hide`,location:t}},tt=e=>{let t=E(e.location),r=e.set&&L(e.set),i=Ce(t.start,e.name),o=pr[e.level],s={...H(l()),levelChecked:1,level:o.level,kind:`OpDecl`,name:fr(e.name),arity:e.arity,declKind:o.declKind,location:K(n,z(i,e.arity)),module:D};return d(a,s),{...H(l()),kind:`NewSymb`,declaration:s,set:r,location:K(n,t)}},nt=(e,t,r)=>{let i=E(e.location),s=or(n,i.start-1),c=G(n,e.conclusion).start,u=n.tokens.findLastIndex((e,t)=>t<c&&e.kind===`Keyword`&&e.text===`PROVE`),d=K(n,{start:s?i.start-1:i.start,end:i.start});s!==or(n,u-1)&&o(d,s?`[]ASSUME matched by PROVE instead of []PROVE`:`ASSUME matched by []PROVE instead of PROVE`);let f=l();t>1&&a.contexts.push(U()),s&&a.contexts.some(e=>v.has(e))&&o(d,`[]ASSUME used within the scope of an ordinary ASSUME's assumptions`),s||v.add(gr(a));let p={isDeclaredBefore:[!1],hasGoal:r!==void 0,isSuffices:r?.isSuffices??!1,isInProof:!0};x.depth=t,x.isDeclared[t]=!1,t===1&&(x.goal=r&&p,x.goalClause=0);let m=e.assumptions.map((e,n)=>{let r=e.kind===`NewSymbol`,i=e.kind===`AssumeProve`?nt(e,t+1):r?tt(e):L(e);return x.depth=t,r&&(x.isDeclared[t]=!0),p.isDeclaredBefore.push(p.isDeclaredBefore[n]||r),t===1&&x.goalClause++,i}),h=L(e.conclusion);t>1&&a.contexts.pop(),x.depth=t-1,t===1&&(x.goal=void 0);let g={...H(f),kind:`AssumeProve`,assumptions:m,goal:h,isSuffices:p.isSuffices,isBoxed:s,location:K(n,{start:s?i.start-1:i.start,end:i.end})};return S.set(g,p),g},rt=(e,t,n,r,i,a=!0)=>({...H(e),kind:`ThmOrAssumpDef`,name:t,isTheorem:a,body:n,params:[],isLocal:!1,location:r,module:D,source:void 0,labels:i,isLeibnizArg:[],isLeibniz:!1,opLevelCond:[],maxLevels:[],minMaxLevel:[]}),it=e=>{let t=K(n,E(e.location));e.kind===`By`&&$e(e,t);let r=e.kind===`By`?We(e.facts):[],i=e.kind===`By`?Qe(e.defs):[];return e.kind===`By`&&l(),e.kind===`By`&&r.length+i.length===0&&o(t,`Empty BY`),{...H(l()),kind:`LeafProof`,facts:r,defs:i,isOmitted:e.kind===`Omitted`,isOnly:e.kind===`By`&&e.isOnly,location:t}},at=(e,t)=>{let r=e.body,i=K(n,t);switch(r.kind){case`Have`:return{node:N(`$Have`,[L(r.expression)],i),isPick:!1};case`Case`:return{node:N(`$Pfcase`,[L(r.expression)],i),isPick:!1};case`Witness`:return{node:N(`$Witness`,r.expressions.map(L),i),isPick:!1};case`Qed`:return{node:N(`$Qed`,[],i),isPick:!1};case`Take`:case`Pick`:{let e=r.kind===`Pick`,o=e?`$Pick`:`$Take`;e&&a.contexts.push(U());let s=e=>r.kind===`Pick`?[F(e,r.body)]:[];if(r.bounds.length>0){let n=P(r.bounds,t.start),a=s(n.bounded.flat());return{node:N(o,a,i,n),isPick:e}}let c=lr(n,t.start,t.end+1,r.names),l=r.names.map((e,t)=>A(e,0,q(n,c[t]),!0)),u=s(l);return{node:N(o,u,i,{unbounded:l}),isPick:e}}}},ot=e=>{if((e.kind===`And`||e.kind===`Or`)&&!e.isBulleted)return!0;if(e.kind!==`Apply`||e.args.length!==2)return!1;let t=nr(n,G(n,e.args[0])),r=G(n,e).start;return t.start===r&&!W(n,t.end+1,`(`)},st=e=>{if(e.kind!==`Steps`)return it(e);let r=U();a.contexts.push(r);let i=[],o=[],s={previousRight:void 0},c=(e,r,a)=>{if(e.kind===`Define`){let r=e.definitions.map(e=>{let n=[];e.kind===`Instance`?Ve(e,n,i):e.kind===`Function`?Fe(e,n):Ne(e,n);let r=n[e.kind===`Instance`?n.length-1:0];if(r?.kind!==`OpDef`)throw new t.O(`A DEFINE step defines no operator`);return r});return{...H(l()),kind:`DefStep`,defs:r,location:K(n,a)}}if(e.kind===`Use`||e.kind===`Hide`)return{...et(e),location:K(n,r)};if(e.kind===`Instance`)return He(e,!1,K(n,a))},u=e.steps.map(e=>{let r=E(e.location),i=tr(n,e.head),u={start:i.start+1,end:i.end},f=e.body;e.name!==void 0&&y();let p=e.name===void 0?void 0:l();f.kind!==`Assert`&&(s.previousRight=void 0);let m=c(f,r,u);if(m!==void 0)return e.name!==void 0&&d(a,j({defKind:`NumberedProofStep`,name:e.name,location:K(n,r),labels:b(),step:m})),m;let h=f.kind===`Assert`&&f.statement.kind===`AssumeProve`;h&&(s.previousRight=void 0);let g=f.kind===`Assert`&&f.isSuffices,_=U(),v=f.kind===`Assert`?{node:(t=>{if(t.kind===`AssumeProve`){let n=k(_,()=>nt(t,1,e.name===void 0?void 0:{isSuffices:g}));return n.isSuffices=g,n}if(g){let e=L(t);return N(`$Suffices`,[e],K(n,u))}let r=s.previousRight,i=r!==void 0&&t.kind===`Apply`&&ot(t)&&t.args[0].kind===`ExceptAt`,a=i?L(t.args[1]):void 0,o=i?re(se(t.operator,T(t)),[N(`$Nop`,[r],T(t.args[0])),a],T(t)):L(t),c=o.kind===`OpAppl`?o.operands[1]:void 0;return s.previousRight=ot(t)?c:void 0,o})(f.statement),isPick:!1}:at(e,u);if(v===void 0)throw new t.O(`Unexpected proof step ${f.kind}`);let x=v.isPick?a.contexts.pop():void 0,S=e.name===void 0||p===void 0?void 0:rt(p,e.name,v.node,q(n,Qn(n,e.location)),b());S&&d(a,S);let C=h&&!g;C&&a.contexts.push(_);let D=e.proof&&st(e.proof);return C&&a.contexts.pop(),w(v.node),h&&g&&(o.push(_),a.contexts.push(_)),x?.symbols.forEach(e=>d(a,e)),{...H(l()),kind:`Theorem`,definition:S,body:v.node,proof:D,isSuffices:g,location:K(n,r)}});return o.forEach(()=>{a.contexts.pop()?.symbols.forEach(e=>An(r,e))}),a.contexts.pop(),{...H(l()),kind:`NonLeafProof`,steps:u,instances:i,proofLevel:e.level,location:K(n,E(e.location))}},ct=e=>{let t=K(n,E(e.location)),r=e.statement,i=U();e.name!==void 0&&y();let o=e.name===void 0?void 0:l();r.kind===`AssumeProve`&&a.contexts.push(i);let s=r.kind===`AssumeProve`?nt(r,1,e.name===void 0?void 0:{isSuffices:!1}):L(r),c=e.name===void 0||o===void 0?void 0:rt(o,e.name,s,t,b());c&&(r.kind===`AssumeProve`&&a.contexts.pop(),d(a,c),D.definitions.push(c),r.kind===`AssumeProve`&&a.contexts.push(i));let u=e.proof&&st(e.proof);r.kind===`AssumeProve`&&a.contexts.pop(),w(s);let f={...H(l()),kind:`Theorem`,definition:c,body:s,proof:u,isSuffices:!1,location:t};D.topLevel.push(f)},lt=e=>{let t=E(e.location),r=K(n,t);e.name!==void 0&&y();let i=L(e.expression),o=e.name===void 0?void 0:rt(l(),e.name,i,r,b(),!1);o&&(d(a,o),D.definitions.push(o));let s={...H(l()),kind:`Assume`,definition:o,body:i,location:r};D.topLevel.push(s)},z=(e,t)=>t===0?{start:e,end:e}:W(n,e,`_`)?{start:e,end:W(n,e+2,`_`)?e+2:e+1}:W(n,e+1,`(`)?{start:e,end:er(n,e+1)}:{start:e,end:W(n,e+1,`_`)?e+1:e},ut=e=>z(E(e.location).start,e.arity),dt=(e,t)=>{let r=ut(e);e.name===`@`&&t===3&&o(K(n,r),`Attempted to declare '@' as a variable.`);let i={...H(l()),levelChecked:1,level:+(t===3),kind:`OpDecl`,name:fr(e.name),arity:e.arity,declKind:t,location:K(n,r),module:D};return t===2&&(i.levelParams.add(i),i.allParams.add(i)),d(a,i),i};e.extends.forEach(e=>{let t=te(e);D.extendees.push(t);let n=gr(a);t.context.symbols.forEach(e=>{if(e.kind!==`Module`&&e.kind!==`FormalParam`&&e.kind!==`OpDecl`&&e.isLocal)return;let t=e.kind===`Module`?Nn(n,e.name):Mn(n,e.name);t===void 0?An(n,e):t!==e&&t.kind!==e.kind?o(e.location,`The ${yr(e)} of '${e.name}' conflicts with \nits ${yr(t)} at ${yn(t.location)}.`):t!==e&&!br(t,e)&&s(e.location,`Warning: the ${yr(t)} of '${e.name}' conflicts with \nits ${yr(t)} at ${yn(t.location)}.`)}),D.topLevel.push(...t.topLevel)});let ft=(e,t)=>{c.unresolvedSum!==0&&o(K(n,E(e)),`${t} may not appear within a recursive definition section.`)};return e.units.forEach(e=>{switch(e.kind){case`Variables`:ft(e.location,`A VARIABLE declaration`),e.declarations.forEach(e=>dt(e,3));break;case`Constants`:ft(e.location,`A declaration`),e.declarations.forEach(e=>dt(e,2));break;case`Recursive`:Le(e.declarations);break;case`Definition`:e.definition.kind===`Function`?Fe(e.definition,void 0):Ne(e.definition,void 0);break;case`Instance`:e.instance.name===void 0?He(e.instance):Ve(e.instance,void 0,void 0);break;case`Assumption`:ft(e.assumption.location,`An ASSUME`),lt(e.assumption);break;case`Theorem`:ft(e.theorem.location,`A THEOREM`),ct(e.theorem);break;case`Use`:ft(e.use.location,`A USE or HIDE`),D.topLevel.push(et(e.use));break;case`Module`:{ft(e.module.location,`A MODULE `);let t={contexts:[...a.contexts,U()]},r=O(e.module,n,D,t),i=ee(r.name);i===void 0?An(gr(a),r):i!==r&&o(r.location,`Multiply-defined module '${r.name}': this definition or declaration conflicts \nwith the one at ${yn(i.location)}.`);break}}}),Re(),D},ee=v.map(e=>{i.onAnalyze?.(e),u.id=Array.from({length:4},l)[1];let t=_(e,void 0),n=U();f.toReversed().forEach(e=>An(n,e));let r=O(t.module,t.file,void 0,{contexts:[n]});return m.set(e,r),i.onModule?.(r,a),r});return{root:ee[ee.length-1],modules:ee,messages:a}},J=(e,t,n,r)=>vn(e.messages,{location:t,text:n,isWarning:!1,...r!==void 0&&!e.isTlc174&&{code:r}}),Y=(e,t)=>{for(let n of t)e.add(n)},Pr=(e,t,n)=>`${e.id}:${t}:${n.id}`,Fr=(e,t,n,r)=>{e.set(Pr(t,n,r),{op:t,index:n,param:r})},Ir=(e,t,n=()=>!0)=>{t.forEach((t,r)=>{n(t)&&e.set(r,t)})},Lr=(e,t,n)=>{e.set(t,Math.min(n,e.get(t)??3))},Rr=(e,t,n=()=>!0)=>{t.forEach((t,r)=>{n(r)&&Lr(e,r,t)})},zr=(e,t)=>`${e.id}:${t}`,Br=(e,t,n,r)=>{let i=zr(t,n),a=e.get(i)?.level??0;e.set(i,{param:t,position:n,level:Math.max(r,a)})},Vr=(e,t,n=()=>!0)=>{t.forEach(t=>{n(t)&&Br(e,t.param,t.position,t.level)})},Hr=(e,t)=>{e.levelParams=t.levelParams,e.allParams=t.allParams,e.levelConstraints=t.levelConstraints,e.argLevelConstraints=t.argLevelConstraints,e.argLevelParams=t.argLevelParams},Ur=(e,t)=>{Y(e.levelParams,t.levelParams),Y(e.allParams,t.allParams),Rr(e.levelConstraints,t.levelConstraints),Vr(e.argLevelConstraints,t.argLevelConstraints),Ir(e.argLevelParams,t.argLevelParams)},Wr=(e,t)=>t.includes(e.op)||t.includes(e.param),Gr=e=>e.kind===`OpDecl`||e.kind===`FormalParam`,Kr=e=>e.kind!==`Module`,qr=e=>e.kind===`OpDef`||e.kind===`ThmOrAssumpDef`,Jr=(e,t)=>e.kind===`OpDef`&&e.arity<0?0:t,Yr=(e,t)=>e.kind===`OpDef`?e.weights[Jr(e,t)]??0:0,Xr=(e,t)=>e.maxLevels[Jr(e,t)]??3,Zr=(e,t,n)=>e.minMaxLevel?.[t]?.[n]??0,Qr=(e,t)=>e.kind===`OpDef`?e.isLeibnizArg?.[Jr(e,t)]??!0:e.isLeibnizArg[t]??!0,$r=(e,t,n,r)=>e.opLevelCond?.[t]?.[n]?.[r]??!1,ei=e=>[...e.unbounded??[],...(e.bounded??[]).flat()],ti=(e,t)=>t.find(t=>t.op===e)?.expr,ni=(e,t,n)=>{let r=ti(e,t);return r===void 0?/* @__PURE__ */ new Set([e]):n?r.allParams:r.levelParams},ri=(e,t)=>{let n=/* @__PURE__ */ new Map;return e.forEach((e,r)=>{let i=ti(e.op,t);if(i===void 0){n.set(r,e);return}if(i.kind!==`OpArg`||!Gr(i.op))return;let a=i.op;ni(e.param,t,!1).forEach(t=>Fr(n,a,e.index,t))}),n},ii=(e,t,n,r,i)=>{let a=/* @__PURE__ */ new Map;return e.levelConstraints.forEach((e,r)=>{let i=n||r.kind!==`OpDecl`?e:r.declKind===2?0:r.declKind===3?1:e;ni(r,t,!1).forEach(e=>Lr(a,e,i))}),e.argLevelParams.forEach(e=>{let n=ti(e.op,t);if(n?.kind!==`OpArg`||n.op.kind!==`OpDef`)return;X(n.op,r,i);let o=Xr(n.op,e.index);ni(e.param,t,!1).forEach(e=>Lr(a,e,o))}),a},ai=(e,t,n,r)=>{let i=/* @__PURE__ */ new Map;return e.argLevelConstraints.forEach(e=>{let n=ti(e.param,t);n===void 0?Br(i,e.param,e.position,e.level):n.kind===`OpArg`&&Gr(n.op)&&Br(i,n.op,e.position,e.level)}),e.argLevelParams.forEach(e=>{let a=ti(e.param,t);if(a===void 0)return;let o=ti(e.op,t),s=o===void 0?e.op:o.kind===`OpArg`?o.op:void 0;s!==void 0&&Gr(s)&&(X(a,n,r),Br(i,s,e.index,a.level))}),i},oi=(e,t)=>Fn(e,3).length>0||(hi(e,t),Pn(e).some(e=>(e.body?.level??0)!==0))?!1:e.topLevel.every(e=>e.kind!==`Theorem`||e.level===0),si=(e,t,n)=>{e.minMaxLevel=t.map(e=>Array.from({length:e.arity},(t,r)=>n.argLevelConstraints.get(zr(e,r))?.level??0)),e.opLevelCond=t.map(e=>t.map(t=>Array.from({length:e.arity},(r,i)=>n.argLevelParams.has(Pr(e,i,t))))),Y(e.levelParams,n.levelParams),Y(e.allParams,n.allParams),Y(e.nonLeibnizParams,n.nonLeibnizParams),t.forEach((t,n)=>{e.levelParams.delete(t),e.allParams.delete(t),e.nonLeibnizParams.has(t)&&(e.nonLeibnizParams.delete(t),e.isLeibnizArg&&(e.isLeibnizArg[n]=!1),e.isLeibniz=!1)}),e.levelConstraints=new Map(n.levelConstraints),t.forEach(t=>e.levelConstraints.delete(t)),e.argLevelConstraints=new Map(n.argLevelConstraints),t.forEach(t=>{for(let n=0;n<t.arity;n++)e.argLevelConstraints.delete(zr(t,n))}),Ir(e.argLevelParams,n.argLevelParams,e=>!t.some(t=>t===e.op)||!t.some(t=>t===e.param))},ci=(e,t,n,r,i)=>{e.operands.forEach((a,o)=>{if(a===void 0||(a.level>Xr(t,o)&&(n&&X(a,r,i)&&J(i,e.location,`Level error in applying operator ${t.name}:\nThe level of argument ${o+1} exceeds the maximum level allowed by the operator.`),e.levelCorrect=!1),a.kind!==`OpArg`||!qr(a.op)))return;let s=a.op;X(s,r,i);let c=jn(s);for(let l=0;l<c;l++){let c=Zr(t,o,l);Xr(s,l)>=c||(n&&X(a,r,i)&&J(i,e.location,`Level error in applying operator ${t.name}:\nThe permitted level of argument ${l+1} of the operator argument ${o+1} \nmust be at least ${c}.`),e.levelCorrect=!1)}e.operands.forEach((n,l)=>{for(let u=0;u<c;u++)n===void 0||!$r(t,o,l,u)||n.level<=Xr(s,u)||(X(a,r,i)&&X(n,r,i)&&J(i,e.location,`Level error in applying operator ${t.name}:\nThe level of argument ${l+1} exceeds the maximum level allowed by the operator.`,`HIGHER_ORDER_OPERATOR_COPARAMETER_LEVEL_CONSTRAINTS_EXCEEDED`),e.levelCorrect=!1)})}),e.ranges.forEach((n,a)=>{let o=X(n,r,i);n.level<=2||(o&&J(i,e.location,`Level error in applying operator ${t.name}:\nThe level of the range for the bounded variable ${yn(e.bounded?.[a]?.[0]?.location)} \nexceeds the maximum level allowed by the operator.`),e.levelCorrect=!1)})},li=(e,t,n,r,i)=>{let a=t.params??[],o=t=>e.operands.find((e,n)=>a[n]===t);Rr(e.levelConstraints,t.levelConstraints),e.operands.forEach(t=>{t!==void 0&&Rr(e.levelConstraints,t.levelConstraints,e=>!n.has(e))}),e.ranges.forEach(t=>Rr(e.levelConstraints,t.levelConstraints)),e.operands.forEach((n,r)=>{let i=Xr(t,r);n?.levelParams.forEach(t=>Lr(e.levelConstraints,t,i))}),e.operands.forEach((n,a)=>{if(n?.kind!==`OpArg`||!qr(n.op))return;let o=n.op;X(o,r,i);let s=jn(o);e.operands.forEach((n,r)=>{for(let i=0;i<s;i++){if(!$r(t,a,r,i))continue;let s=Xr(o,i);n?.levelParams.forEach(t=>Lr(e.levelConstraints,t,s)),!o.isLeibniz&&!Qr(o,i)&&n&&Y(e.nonLeibnizParams,n.allParams)}})}),t.argLevelParams.forEach(t=>{let n=o(t.op);n?.kind===`OpArg`&&qr(n.op)&&(X(n.op,r,i),Lr(e.levelConstraints,t.param,Xr(n.op,t.index)))}),Vr(e.argLevelConstraints,t.argLevelConstraints),e.operands.forEach(t=>{t&&Vr(e.argLevelConstraints,t.argLevelConstraints)}),e.ranges.forEach(t=>Vr(e.argLevelConstraints,t.argLevelConstraints)),e.operands.forEach((n,r)=>{if(n?.kind!==`OpArg`||!Gr(n.op))return;let i=n.op;for(let n=0;n<i.arity;n++)Br(e.argLevelConstraints,i,n,Zr(t,r,n));e.operands.forEach((n,a)=>{for(let o=0;o<i.arity;o++)n!==void 0&&$r(t,r,a,o)&&Br(e.argLevelConstraints,i,o,n.level)})}),t.argLevelParams.forEach(t=>{let n=o(t.op);n!==void 0&&(X(n,r,i),Br(e.argLevelConstraints,t.op,t.index,n.level))}),e.operands.forEach(t=>{t!==void 0&&Ir(e.argLevelParams,t.argLevelParams,e=>!n.has(e.param))}),e.ranges.forEach(t=>Ir(e.argLevelParams,t.argLevelParams)),t.argLevelParams.forEach((t,n)=>{let a=o(t.op);if(a===void 0){let a=o(t.param);a===void 0?e.argLevelParams.set(n,t):(X(a,r,i),a.levelParams.forEach(n=>Fr(e.argLevelParams,t.op,t.index,n)))}else a.kind===`OpArg`&&Gr(a.op)&&Fr(e.argLevelParams,a.op,t.index,t.param)}),e.operands.forEach((n,r)=>{if(n?.kind!==`OpArg`||!Gr(n.op))return;let i=n.op;e.operands.forEach((n,a)=>{for(let o=0;o<i.arity;o++)n!==void 0&&$r(t,r,a,o)&&n.levelParams.forEach(t=>Fr(e.argLevelParams,i,o,t))})})},ui=/* @__PURE__ */ new Map([[`\\land`,`\\land`],[`\\lor`,`\\lor`],[`=>`,`=>`],[`\\equiv`,`\\equiv`],[`$ConjList`,`Conjunction list`],[`$DisjList`,`Disjunction list`]]),di=(e,t)=>{let n=(n,r)=>{J(t,n,r),t.isTlc174||(e.levelCorrect=!1)},r=e.operator.name,i=e.operands[0];if((r===`[]`||r===`<>`)&&i?.level===2&&i.kind===`OpAppl`){let t=r===`[]`;i.operator.name!==(t?`$SquareAct`:`$AngleAct`)&&n(e.location,t?`[] followed by action not of form [A]_v.`:`<> followed by action not of form <<A>>_v.`)}r!==`~>`&&r!==`-+->`||i?.level!==2&&e.operands[1]?.level!==2||n(e.location,`Action used where only temporal formula or state predicate allowed.`);let a=ui.get(r);a!==void 0&&e.operands.some(e=>e?.level===3)&&e.operands.some(e=>e?.level===2)&&n(e.location,`${a} has both temporal formula and action as arguments.`),e.level===3&&(r===`$BoundedExists`||r===`$BoundedForall`)&&e.ranges.forEach(e=>{e.level===2&&n(e.location,`Action-level bound of quantified temporal formula.`)})},fi=(e,t,n)=>{if(e.levelChecked>=t)return e.levelCorrect;e.levelChecked=t,e.levelCorrect=!0;let r=e.operands.filter(e=>e!==void 0);r.forEach(r=>{X(r,t,n)||(e.levelCorrect=!1)}),e.ranges.forEach(r=>{X(r,t,n)||(e.levelCorrect=!1)});let i=e.operator;if(qr(i)){let r=X(i,t,n);ci(e,i,r,t,n),e.level=e.operands.reduce((e,t,n)=>t!==void 0&&Yr(i,n)===1?Math.max(e,t.level):e,i.level),e.ranges.forEach(t=>{e.level=Math.max(e.level,t.level)}),Y(e.levelParams,i.levelParams),Y(e.allParams,i.allParams),Y(e.nonLeibnizParams,i.nonLeibnizParams),e.operands.forEach((t,n)=>{t!==void 0&&(Yr(i,n)===1&&Y(e.levelParams,t.levelParams),Y(e.allParams,t.allParams),Y(e.nonLeibnizParams,t.nonLeibnizParams),Qr(i,n)||Y(e.nonLeibnizParams,t.allParams))}),e.ranges.forEach(t=>{Y(e.levelParams,t.levelParams),Y(e.allParams,t.allParams),Y(e.nonLeibnizParams,t.nonLeibnizParams)});let a=new Set(ei(e));a.forEach(t=>{e.levelParams.delete(t),e.allParams.delete(t),e.nonLeibnizParams.delete(t)}),li(e,i,a,t,n)}else X(i,t,n),e.level=r.reduce((e,t)=>Math.max(e,t.level),i.kind===`Module`?0:i.level),e.levelParams=/* @__PURE__ */ new Set([i]),e.allParams.add(i),r.forEach((t,n)=>{Y(e.levelParams,t.levelParams),Y(e.allParams,t.allParams),Y(e.nonLeibnizParams,t.nonLeibnizParams),Rr(e.levelConstraints,t.levelConstraints),Br(e.argLevelConstraints,i,n,t.level),Vr(e.argLevelConstraints,t.argLevelConstraints),t.levelParams.forEach(t=>Fr(e.argLevelParams,i,n,t)),Ir(e.argLevelParams,t.argLevelParams)});return di(e,n),e.levelCorrect},pi=(e,t,n)=>{if(e.levelChecked>=t||!e.inRecursiveSection&&e.levelChecked>0)return e.levelCorrect;e.levelChecked=t;let r=e.body;if(r===void 0)return e.levelCorrect=e.step===void 0||X(e.step,t,n),e.levelCorrect;e.levelCorrect=X(r,t,n),e.level=Math.max(e.level,r.level);let i=e.params??[];return i.forEach((t,n)=>{let i=r.levelConstraints.get(t);i!==void 0&&(e.maxLevels[n]=Math.min(e.maxLevels[n],i)),r.levelParams.has(t)&&(e.weights[n]=Math.max(e.weights[n],1))}),si(e,i,r),e.levelCorrect},mi=(e,t,n)=>(e.levelChecked>=t||(e.levelChecked=t,e.maxLevels=e.params.map(()=>3),e.isLeibnizArg=e.params.map((t,n)=>n===e.params.length-1),e.params.length>0&&(e.isLeibniz=!0),e.levelCorrect=X(e.body,t,n),e.level=e.body.level,e.params.forEach((t,n)=>{let r=e.body.levelConstraints.get(t);r!==void 0&&(e.maxLevels[n]=r)}),si(e,e.params,e.body)),e.levelCorrect),hi=(e,t)=>{if(e.isLevelChecked)return e.levelCorrect;e.isLevelChecked=!0;let n=e.opDefsInRecursiveSection,r=0;for(;r<n.length;){let e=n[r].recursiveSection,i=r;for(;i<n.length&&n[i].recursiveSection===e;){let e=n[i];e.inRecursive?(e.levelChecked=1,e.maxLevels=e.maxLevels.map(()=>2),e.weights=e.weights.map(()=>1)):e.levelChecked=0,i++}let a=n.slice(r,i),o=/* @__PURE__ */ new Set,s=/* @__PURE__ */ new Set,c=0;a.forEach(e=>{e.inRecursive&&(e.levelChecked=0),pi(e,1,t),e.inRecursive&&(e.maxLevels.forEach((n,r)=>{n>=2||J(t,e.location,`Argument ${r+1} of recursive operator ${e.name} is primed`)}),c=Math.max(c,e.level),Y(o,e.levelParams),Y(s,e.allParams))}),a.forEach(e=>{e.inRecursive&&(e.levelChecked=2),e.level=Math.max(e.level,c),Y(e.levelParams,o),Y(e.allParams,s)}),a.forEach(e=>{e.inRecursive&&(e.levelChecked=1),pi(e,2,t)}),r=i}e.levelCorrect=!0;let i=t=>{t||(e.levelCorrect=!1)};e.definitions.filter(e=>e.kind===`Module`).forEach(e=>i(hi(e,t)));let a=Pn(e);return a.forEach(e=>i(pi(e,1,t))),In(e).forEach(e=>i(mi(e,1,t))),e.topLevel.forEach(e=>i(X(e,1,t))),oi(e,t)||Fn(e,2).forEach(t=>Lr(e.levelConstraints,t,0)),a.forEach(t=>{Rr(e.levelConstraints,t.levelConstraints),Vr(e.argLevelConstraints,t.argLevelConstraints),Ir(e.argLevelParams,t.argLevelParams,e=>!Wr(e,t.params??[]))}),e.topLevel.forEach(t=>{Rr(e.levelConstraints,t.levelConstraints),Vr(e.argLevelConstraints,t.argLevelConstraints),Ir(e.argLevelParams,t.argLevelParams)}),e.levelCorrect},gi=(e,t,n,r)=>(e.levelChecked>=n||(e.levelChecked=n,t.forEach(t=>{Kr(t)&&(t.kind!==`OpDef`||t.defKind!==`ModuleInstance`)&&(e.levelCorrect=X(t,n,r)&&e.levelCorrect,e.level=Math.max(e.level,t.level),Ur(e,t),Y(e.nonLeibnizParams,t.nonLeibnizParams))})),e.levelCorrect),_i=(e,t)=>{e?.kind===`NonLeafProof`&&e.steps.forEach(e=>{if(e.kind!==`Theorem`||e.body.kind!==`OpAppl`)return;let n=e.body.operator.name;n===`$Take`||n===`$Witness`||n===`$Have`?e.body.level!==0&&J(t,e.body.location,`Non-constant TAKE, WITNESS, or HAVE for temporal goal.`):n===`$Pfcase`?(e.body.level!==0&&J(t,e.body.location,`Non-constant CASE for temporal goal.`),_i(e.proof,t)):n===`$Qed`&&_i(e.proof,t)})},vi=(e,t,n)=>{if(e.levelChecked>=t)return e.levelCorrect;e.levelChecked=t,e.levelParams=/* @__PURE__ */ new Set,e.levelCorrect=!0;let r=e.module;hi(r,n)||(e.levelCorrect=!1),e.substs.forEach(r=>{X(r.expr,t,n)||(e.levelCorrect=!1)});let i=oi(r,n);e.substs.forEach(a=>{!i&&a.expr.level>a.op.level&&(X(a.expr,t,n)&&J(n,e.location,`Level error in instantiating module '${r.name}':\nThe level of the expression or operator substituted for '${a.op.name}' \nmust be at most ${a.op.level}.`),e.levelCorrect=!1),a.expr.kind!==`OpArg`||a.expr.op.kind!==`OpDef`||a.expr.op.defKind!==`UserDefined`&&a.expr.op.defKind!==`BuiltIn`||a.expr.op.isLeibniz||J(n,e.location,`Error in instantiating module '${r.name}':\n A non-Leibniz operator substituted for '${a.op.name}'.`)}),e.substs.forEach(i=>{let a=r.levelConstraints.get(i.op);if(a!==void 0&&i.expr.level>a&&(X(i.expr,t,n)&&J(n,e.location,`Level error in instantiating module '${r.name}':\nThe level of the expression or operator substituted for '${i.op.name}' \nmust be at most ${a}.`),e.levelCorrect=!1),i.op.arity<=0||i.expr.kind!==`OpArg`||i.expr.op.kind!==`OpDef`)return;let o=i.expr.op,s=X(o,t,n);for(let t=0;t<i.op.arity;t++){let a=r.argLevelConstraints.get(zr(i.op,t))?.level;a===void 0||Xr(o,t)>=a||(s&&J(n,e.location,`Level error in instantiating module '${r.name}':\nThe level of the argument ${t+1} of the operator ${o.name} \nmust be at least ${a}.`),e.levelCorrect=!1)}}),r.argLevelParams.forEach(i=>{e.substs.forEach(a=>{e.substs.forEach(o=>{if(i.op!==a.op||i.param!==o.op||a.expr.kind!==`OpArg`)return;let s=a.expr.op,c=X(s,t,n);if(s.kind!==`OpDef`)return;let l=Xr(s,i.index);o.expr.level<=l||(c&&X(o.expr,t,n)&&J(n,e.location,`Level error when instantiating module '${r.name}':\nThe level of the argument ${i.index} of the operator ${a.op.name}' \nmust be at most ${l}.`),e.levelCorrect=!1)})})});let a=t=>!e.params.some(e=>e===t);return Rr(e.levelConstraints,ii(r,e.substs,i,t,n),a),e.substs.forEach(t=>Rr(e.levelConstraints,t.expr.levelConstraints,a)),Vr(e.argLevelConstraints,ai(r,e.substs,t,n),e=>a(e.param)),e.substs.forEach(t=>Vr(e.argLevelConstraints,t.expr.argLevelConstraints,e=>a(e.param))),Ir(e.argLevelParams,ri(r.argLevelParams,e.substs),t=>!Wr(t,e.params)),e.substs.forEach(t=>Ir(e.argLevelParams,t.expr.argLevelParams,t=>!Wr(t,e.params))),e.levelCorrect},X=(e,t,n)=>{if(!Kr(e))return hi(e,n);switch(e.kind){case`OpAppl`:return fi(e,t,n);case`OpDef`:return pi(e,t,n);case`ThmOrAssumpDef`:return mi(e,t,n);case`FormalParam`:return e.levelChecked===0&&(e.levelChecked=t,e.levelParams.add(e),e.allParams.add(e)),!0;case`OpDecl`:return!0;case`Numeral`:case`String`:case`Decimal`:return e.levelChecked<t&&(e.levelChecked=t),!0;case`OpArg`:{if(e.levelChecked>=t)return e.levelCorrect;e.levelChecked=t;let r=e.op;return e.levelCorrect=X(r,t,n),r.kind===`Module`||(e.level=r.level,Hr(e,r)),e.levelCorrect}case`LetIn`:{if(e.levelChecked>=t)return e.levelCorrect;e.levelChecked=t,e.levelCorrect=!0;let r=e.opDefs.filter(e=>e.kind!==`OpDef`||e.defKind!==`ModuleInstance`);return r.forEach(r=>{X(r,t,n)||(e.levelCorrect=!1)}),X(e.body,t,n)||(e.levelCorrect=!1),e.instances.forEach(r=>{X(r,t,n)||(e.levelCorrect=!1)}),e.level=e.body.level,e.levelParams=new Set(e.body.levelParams),e.allParams=new Set(e.body.allParams),Rr(e.levelConstraints,e.body.levelConstraints),r.forEach(t=>Rr(e.levelConstraints,t.levelConstraints)),Vr(e.argLevelConstraints,e.body.argLevelConstraints),r.forEach(t=>Vr(e.argLevelConstraints,t.argLevelConstraints)),Ir(e.argLevelParams,e.body.argLevelParams),r.forEach(t=>{let n=t.kind===`OpDef`?t.params??[]:[];Ir(e.argLevelParams,t.argLevelParams,e=>!Wr(e,n))}),e.instances.forEach(t=>Ir(e.argLevelParams,t.argLevelParams)),e.levelCorrect}case`Label`:{if(e.levelChecked>=t)return!0;e.levelChecked=t,e.params.forEach(e=>X(e,t,n));let r=X(e.body,t,n);return e.level=e.body.level,Hr(e,e.body),r}case`At`:{if(e.levelChecked>=t)return!0;e.levelChecked=t;let r=e.except.operands,i=r[0];if(i===void 0)return!0;X(i,t,n),e.level=i.level;let a=[i];for(let i of r.slice(1))if(i!==void 0){if(X(i,t,n),i===e.component)break;e.level=Math.max(e.level,i.level),a.push(i)}return a.forEach(t=>Ur(e,t)),!0}case`SubstIn`:case`APSubstIn`:{if(e.levelChecked>=t)return e.levelCorrect;e.levelChecked=t,e.levelCorrect=!0;let r=e.body;X(r,t,n)||(e.levelCorrect=!1),e.substs.forEach(r=>{X(r.expr,t,n)||(e.levelCorrect=!1)}),e.level=e.substs.reduce((e,t)=>r.levelParams.has(t.op)?Math.max(e,t.expr.level):e,r.level),r.levelParams.forEach(t=>Y(e.levelParams,ni(t,e.substs,!1))),e.kind===`APSubstIn`?r.allParams.forEach(t=>Y(e.allParams,ni(t,e.substs,!0))):(e.allParams=new Set(r.allParams),e.nonLeibnizParams=new Set(r.nonLeibnizParams),e.substs.forEach(t=>{e.allParams.has(t.op)&&(e.allParams.delete(t.op),Y(e.allParams,t.expr.allParams),Y(e.nonLeibnizParams,t.expr.nonLeibnizParams),e.nonLeibnizParams.has(t.op)&&(e.nonLeibnizParams.delete(t.op),Y(e.nonLeibnizParams,t.expr.allParams)))}));let i=oi(e.instantiatedModule,n);return e.levelConstraints=ii(r,e.substs,i,t,n),e.argLevelConstraints=ai(r,e.substs,t,n),e.argLevelParams=ri(r.argLevelParams,e.substs),e.levelCorrect}case`Instance`:return vi(e,t,n);case`Assume`:{if(e.levelChecked>=t)return!0;e.levelChecked=t;let r=X(e.body,t,n),i=!e.definition||X(e.definition,t,n);return e.level=e.body.level,Hr(e,e.body),e.level!==0&&J(n,e.location,`Level error: assumptions must be level 0 (Constant), \nbut this one has level ${e.level}.`),r&&i}case`Theorem`:{if(e.levelChecked>=t)return!0;let r=gi(e,[e.definition??e.body,...e.proof?[e.proof]:[]],t,n),i=e.body;return i.kind===`OpAppl`&&i.operator.name===`$Pick`&&i.level===3&&i.ranges.forEach(e=>{e.level!==0&&J(n,e.location,`Non-constant bound of temporal PICK.`)}),i.level===3&&_i(e.proof,n),r}case`LeafProof`:case`UseOrHide`:return gi(e,e.facts,t,n);case`NonLeafProof`:return gi(e,[...e.steps,...e.instances],t,n);case`DefStep`:return gi(e,e.defs,t,n);case`NewSymb`:return e.levelChecked>=t||(e.levelChecked=t,e.level=e.declaration.level,e.set===void 0)||(e.levelCorrect=X(e.set,t,n),e.level=Math.max(e.level,e.set.level),e.level===3&&(e.levelCorrect=!1,J(n,e.location,`Level error:
|
|
35
|
+
Temporal formula used as set.`)),Hr(e,e.set)),e.levelCorrect;case`AssumeProve`:return e.levelChecked>=t||(e.levelChecked=t,e.levelCorrect=!0,e.assumptions.forEach(r=>{X(r,t,n)||(e.levelCorrect=!1)}),X(e.goal,t,n),e.level=e.assumptions.reduce((e,t)=>Math.max(e,t.level),e.goal.level),[e.goal,...e.assumptions].forEach(t=>Ur(e,t)),e.levelCorrect&&e.levelParams.forEach(t=>{t.kind===`OpDecl`&&t.declKind===2&&Lr(e.levelConstraints,t,2)})),e.levelCorrect}},yi=e=>{switch(e.kind){case`OpAppl`:return[...e.ranges,...e.operands];case`OpDef`:case`ThmOrAssumpDef`:case`Label`:return[e.body];case`LetIn`:return[...e.opDefs,...e.instances,e.body];case`SubstIn`:case`APSubstIn`:return[e.body,...e.substs.map(e=>e.expr)];case`Instance`:return e.substs.map(e=>e.expr);case`AssumeProve`:return[...e.assumptions,e.goal];case`NewSymb`:return[e.set];default:return[]}},bi=/* @__PURE__ */ new Map([[`Integers`,`Int`],[`Naturals`,`Nat`],[`Reals`,`Reals`]]),xi=e=>{let t=/* @__PURE__ */ new Set,n=e=>{if(e===void 0||t.has(e))return!1;if(t.add(e),e.kind===`OpAppl`){let t=e.operator;if(t.kind===`OpDecl`||t.kind===`FormalParam`)return!0;if(t.kind===`OpDef`){if(t.name===`BOOLEAN`)return!0;let e=t.module?.name;if(e!==void 0&&bi.get(e)===t.name||n(t))return!0}}return yi(e).some(n)};return n(e)},Si=e=>e.operands.filter(e=>e?.kind===`OpAppl`),Ci=e=>{let t=e.operands[0];return t?.kind===`String`?t:void 0},wi=(e,t)=>{if(e===t)return!0;if(e.operands.length!==t.operands.length)return!1;let n=new Set(Si(t).map(e=>Ci(e)?.value));return Si(e).every(e=>n.has(Ci(e)?.value))},Ti=(e,t=/* @__PURE__ */ new Set)=>(e.extendees.forEach(e=>{t.has(e)||(t.add(e),Ti(e,t))}),t),Ei=e=>{let t=[...[...Ti(e)].flatMap(e=>e.records),...e.records];return e.records.flatMap(n=>t.filter(e=>wi(e,n)).flatMap(Si).some(xi)?[]:Si(n).flatMap(t=>{let n=Ci(t),r=n&&Mn(e.context,n.value);return n===void 0||r===void 0?[]:[{location:n.location,text:`The field name "${n.value}" in the record constructor is identical to the existing definition or declaration\nnamed ${n.value}, located at ${yn(r.location)}.\nThe field in the record will not take the value of the ${n.value} definition or declaration.\nIn TLA+, field names in records are strings, regardless of any similarly named declarations or definitions.\nTherefore, DOMAIN [${n.value} |-> ...] = {"${n.value}"} holds true.`,isWarning:!0}]}))},Di=e=>`${yn(e.location)}\n\n${e.text}`,Oi=e=>{let t=e.filter(e=>!e.isWarning),n=e.filter(e=>e.isWarning);return[t.length>0?`*** Errors: ${t.length}\n\n`:``,...t.map(e=>`${Di(e)}\n\n\n`),n.length>0?`*** Warnings: ${n.length}\n\n`:``,...n.map(e=>`${Di(e)}\n\n\n`)].join(``)},ki=/* @__PURE__ */ new Set([`FiniteSets`,`Sequences`,`Bags`,`Naturals`,`Integers`,`Reals`,`RealTime`,`Randomization`,`TLC`]),Ai=e=>{let t=/* @__PURE__ */ new Set,n=[],r=e=>{t.add(e.name),n.push(...e.extends),e.modules.forEach(r)};return r(e),n.filter(e=>!t.has(e))},ji=e=>{try{return n.H(sr(e))}catch(e){if(e instanceof t.O)return;throw e}},Mi=(e,t)=>t===`1.7.4`&&n.Gt(e)!==void 0?void 0:ji(e)?.name,Ni=(e,r,o={})=>{let s=(0,i.basename)(e,`.tla`),c=n.R(o.version),l=o.fileName??s,u=(0,a.existsSync)(e)?(0,a.readFileSync)(e,`utf8`):c.get(s),d=[],f=e=>{d.push(e),o.onPrint?.(e)},p=e=>f(`${e}\n`),m=o.version===`1.7.4`,h=m&&o.isXmlExport,g=e=>{o.isXmlExport||p(e)},_=o.describeFile,v=/* @__PURE__ */ new Map([[s,(0,a.existsSync)(e)?`file`:`standard`]]),y={value:!1},b=[],x={isReported:!1,isAborted:!1},S=mt(Oe(),p),C=/* @__PURE__ */ new Map,w=[],T=()=>w.splice(0).forEach(e=>e.isError?o.onPrintError?.(`${e.text}\n`):p(e.text)),E=e=>{let t=C.get(e),n=t?.module.location.range;if(t===void 0||n===void 0)return;let r=t.text.split(/\r\n|\r|\n/),i=mn(S,r.slice(n.start.line-1,n.end.line),o.version),a=i.has(`TLA_DIVERGENCE_EXISTS`),s=i.has(`PCAL_DIVERGENCE_EXISTS`),c=a===s?void 0:`The ${a?`TLA+ translation`:`PlusCal algorithm`} in module ${e} has changed since its last translation.`;if(m){let t=a&&s?`The PlusCal algorithm and its TLA+ translation in module ${e} filename since the last translation.`:c;t===void 0?i.has(`ERROR_ENCOUNTERED`)&&w.push({text:`A unexpected problem was encountered attempting to validate the specification for ${e}`,isError:!0}):w.push({text:`!! WARNING: ${t}`,isError:!1});return}let l=a&&s?`Both the PlusCal algorithm and its TLA+ translation in module ${e} have changed since the last translation.`:c??(i.has(`ERROR_ENCOUNTERED`)?`An unexpected problem was encountered attempting to validate the specification for ${e}`:void 0);if(l===void 0)return;let u=!i.has(`ERROR_ENCOUNTERED`)||a||s;b.some(e=>e.text===l)||b.push({location:e,text:l,isWarning:u})},D=(e,t)=>{if(o.isXmlExport||C.has(e))return;let n=ji(t);if(n===void 0||n.name!==e)return;let r=[...C.values()].filter(t=>Ai(t.module).includes(e));C.set(e,{text:t,module:n}),r.forEach(()=>E(e)),Ai(n).filter(t=>t!==e&&C.has(t)).forEach(E)},O=()=>{if(T(),x.isReported)return;x.isReported=!0;let e=b.filter(e=>e.isWarning);e.length>0&&(g(`Warnings (${e.length}) during syntax parsing of ${l}:\n\n`),e.forEach(e=>g(`${Di(e)}\n\n\n`))),e.length!==b.length&&(p(Oi(b)),y.value=!0,x.isAborted=!0)},ee=e=>{let t=c.get(e),i=r(e),a=i===void 0&&t===void 0&&u!==void 0&&!m?n.B(u,e):void 0,o=i??a;return v.set(e,i===void 0?a===void 0?`standard`:`root file`:`file`),o!==void 0&&D(e,o),o??t},te=(()=>{try{if(u===void 0)throw new t.E(`Cannot find source file for module ${l}`,void 0);return D(s,u),Nr(u,ee,{rootFileName:s,rootFilePath:o.isXmlExport?`${l.replace(/\.tla$/,``)}.tla`:void 0,version:o.version,rootExtendees:o.rootExtendees,onParse:e=>{_&&p(`Parsing file ${_(e,v.get(e)??`file`)}`),e===s&&E(s),T()},onAnalyze:e=>{O(),(_||h)&&!x.isAborted&&p(`Semantic processing of module ${e}`)},onModule:(e,t)=>{if(x.isAborted||(t.every(e=>e.isWarning)&&hi(e,{messages:t,isTlc174:m}),t.length===0))return;if(t.some(e=>!e.isWarning)&&(y.value=!0),m)return p(`Semantic errors:\n\n${Oi(t)}`);let n=t.filter(e=>e.isWarning);n.length>0&&(g(`*** Warnings: ${n.length}\n`),n.forEach(e=>g(`${Di(e)}\n\n\n`)));let r=t.filter(e=>!e.isWarning);r.length!==0&&(p(`Semantic errors:\n\n*** Errors: ${r.length}\n`),r.forEach(e=>p(`${Di(e)}\n\n`)))}})}catch(e){if(y.value=!0,e instanceof t.c){p(`\nFatal errors while parsing TLA+ spec in file ${l}\n`),p(e.message),p(Oi(b));return}if(!(e instanceof t.E))throw e;let n={location:e.location,text:e.message,isWarning:!1},r=m&&e.parseError?.includes(` and token "" `);if(e.parseError!==void 0&&!r&&!h&&p(e.parseError),p(`\nFatal errors while parsing TLA+ spec in file ${l}\n`),r){p(`java.lang.NullPointerException: Cannot invoke "String.length()" because "str" is null`);return}if(m){p(`tla2sany.semantic.AbortException`),f(`*** Abort messages: 1\n\n${Di(n)}\n\n\n`);return}p(Di(n)),p(Oi(x.isReported?[n]:[...b,n]))}})();if(te!==void 0&&O(),te!==void 0&&!y.value&&!o.isXmlExport&&!m){let e=te.modules.filter(e=>!ki.has(e.name));_&&e.forEach(e=>p(`Linting of module ${e.name}`)),e.flatMap(Ei).forEach(e=>p(`${Di(e)}\n\n\n`))}return{text:d.join(``),isFailed:y.value,specification:x.isAborted?void 0:te}},Pi={success:t.W.success,"assumption-violation":t.W.assumptionViolation,deadlock:t.W.deadlock,"invariant-violation":t.W.safetyViolation,"property-violation":t.W.safetyViolation,"liveness-violation":t.W.livenessViolation,"postcondition-violation":t.W.assumptionViolation,error:t.W.error},Fi=e=>/^[+-]?\d+$/.test(e)&&BigInt.asIntN(64,BigInt(e))===BigInt(e),Ii=e=>e?e[0]===`auto`?(0,s.availableParallelism)():Math.max(1,Number.parseInt(e[0],10)||1):1,Li=[`constrained`,`stuttering`,`strict`],Ri=(e,t)=>e.endsWith(t)?e:`${e}${t}`,zi=e=>{if(e.length===1)return{path:Ri(e[0],`.dump`)};let t=e[0].toLowerCase();return{path:Ri(e[1],`.dot`),dot:!0,colorize:t.includes(`colorize`),actionLabels:t.includes(`actionlabels`),snapshot:t.includes(`snapshot`)}},Bi=(e,t)=>e.print(n.dt.computingInitProgress,n.ft.none,`Computed ${t} initial states...`),Vi=(e,t)=>e===`invariant-violation`?{code:n.dt.invariantViolatedInitial,text:`Invariant ${t} is violated by the initial state:`}:{code:n.dt.propertyViolatedInitial,text:`Property ${t} is violated by the initial state:`},Hi=(e,t)=>t?.forEach(t=>{if(typeof t==`string`)return console.log(t);if(t.kind===`initial-states-progress`)return Bi(e,t.count);let r=Vi(t.status,t.name);e.print(r.code,n.ft.error,`${r.text}\n${n.At(t.state)}`)}),Ui=(e,t,r={code:n.dt.behaviorUpToThisPoint,text:`The behavior up to this point is:`},i=!1)=>{t.length>0&&e.print(r.code,n.ft.error,r.text),t.forEach((t,r)=>{(r>0||i)&&Hi(e,t.output),e.print(n.dt.statePrint2,n.ft.state,`${r+1}: <${t.label??t.action??`Initial predicate`}>\n${n.At(t.state)}`)})},Wi={code:n.dt.counterExample,text:`The following behavior constitutes a counter-example:
|
|
36
36
|
`},Gi=(e,t)=>t===`1.7.4`||e.length===0?`Temporal properties were violated.
|
|
37
|
-
`:e.length===1?`Temporal property ${e[0]} was violated.\n`:`Temporal properties ${e.slice(0,-1).join(`, `)}${e.length>2?`,`:``} and ${e[e.length-1]} were violated.\n`,Ki=e=>e.filter((t,n)=>t!==e[n-1]).map((e,t)=>`${t}) ${n.
|
|
38
|
-
`;let t=[];return e.forEach((n,r)=>{let i=n.location.range;n!==e[r-1]&&i&&t.push(`${t.length}. Line ${i.start.line}, column ${i.start.column} to line ${i.end.line}, column ${i.end.column} in ${i.module}\n`)}),`${t.join(``)}\n`},Ji=(e,t)=>{let r=t.generated,i=t.distinct,a=n.
|
|
39
|
-
`))}if(e.failure?.isWithoutStatistics)return;e.status!==`success`&&Qi(r,i),r.isTool&&Yi(r,e,i.startTime),a(n.ft.stats,n.pt.none,`${e.generatedStates} states generated, ${e.distinctStates} distinct states found, ${e.queuedStates} states left on queue.`);let o=r.version===`1.7.4`,s=o?e.outDegrees??e.violationOutDegrees:e.outDegrees;(!o||s)&&a(n.ft.searchDepth,n.pt.none,`The depth of the complete state graph search is ${o?Math.max(e.depth,1):e.depth}.`);let c=s&&n.p(s);c&&a(n.ft.stateGraphOutdegree,n.pt.none,c)},na=e=>n.B([e]).toString(),ra=(e,t,n,r,o)=>{let c=n.temporaryDirectory??(0,s.tmpdir)(),l=(0,a.existsSync)(c)?(0,a.realpathSync)(c):(0,i.resolve)(c),u=(0,i.join)(l,`tlc-${na((0,i.resolve)(e))}`),d=S(n);return(n,s)=>{let c=`${n}.tla`;if(s===`file`)return(0,a.realpathSync)(p(t,n)??e);if(o===`1.7.4`)return(0,i.join)(l,c);if(s===`root file`){let t=r===void 0?l:(0,i.resolve)(r),o=(0,a.realpathSync)(e);return`${(0,i.join)(t,na(`${o} ${n}`),c)} (${o})`}let f=(0,i.join)(u,c);return d===void 0?f:`${f} (${g(d)}${c})`}},ia=e=>e.print(n.ft.version,n.pt.none,`TLC2 Version ${C} (rev: tla-ts)`),aa=(e,t)=>(ia(e),e.print(n.ft.commandLineError,n.pt.error,`${t}\nUsage: java tlc2.TLC [-help] [-option] inputfile`),1),oa=(e,t,r)=>e.print(n.ft.modelChecking,n.pt.none,`Running breadth-first search Model-Checking with fp 0 and seed ${BigInt(t)} with ${r} worker${r===1?``:`s`} on ${(0,s.availableParallelism)()} cores with ${Math.floor((0,c.getHeapStatistics)().heap_size_limit/1024/1024)}MB heap and 0MB offheap memory [pid: ${process.pid}] (${(0,s.type)()} ${(0,s.release)()} ${(0,s.arch)()}, Node.js ${process.versions.node} ${process.arch.endsWith(`64`)?64:32}bit, MemFPSet, MemStateQueue).`),sa=(e,t)=>{let n=[...e.unknown,...e.options.map(e=>e.name)],r=(e,t=e)=>n.some(n=>n===e||n.toLowerCase()===t.toLowerCase()),i=r(`-generateSpecTE`)||!r(`-noGenerateSpecTE`,`-noTE`)&&!r(`-tool`)&&!r(`-continue`);return t!==`1.7.4`&&i&&!r(`-noGenerateSpecTEBin`,`-noTEBin`)},ca=async(e,o,s,c)=>{let l=o.has(`-seed`)?o.get(`-seed`)?.[0]:`0`;if(l===void 0)return aa(c,`Error: seed required.`);if(!Fi(l))return aa(c,`Error: An integer for seed required. But encountered ${l}`);let u=o.has(`-lncheck`)?o.get(`-lncheck`)?.[0]?.toLowerCase():`default`;if(u===void 0)return aa(c,`Error: expect a strategy such as final for -lncheck option.`);let d=o.get(`-dump`);if(d?.length===0)return aa(c,`Error: A file name for dumping states required.`);let f=d?.length===2&&Li.find(e=>d[0].toLowerCase().includes(e));if(f)return console.error(`Error: tla-ts does not support the -dump format ${f}.`),1;let p=o.get(`-fp`)?.[0];if(p!==void 0&&Number(p)!==0)return console.error(`Error: tla-ts fingerprints states as TLC does with -fp 0, not -fp ${p}.`),1;let g=Ii(o.get(`-workers`)),v=c.version;ia(c),oa(c,l,g);let y=o.get(`-config`)?.[0]??(o.has(`-config`)?void 0:e.replace(/\.tla$/,`.cfg`));if(!y||!(0,a.existsSync)(y))return c.print(n.ft.configFileError,n.pt.error,`TLC encountered the following error when trying to read the configuration file ${y??``}:\nFile not found.`),t.U.configParseError;let b=(0,i.basename)(e,`.tla`),C={startTime:Date.now(),livenessStartTime:void 0,isParsed:!1},w=()=>{let e=Date.now()-C.startTime;c.print(n.ft.finished,n.pt.none,`Finished in ${c.isTool?`${e}ms`:n.vt(e)} at (${n._t(/* @__PURE__ */ new Date)})`)},T=()=>c.print(n.ft.parsingFailed,n.pt.error,`Parsing or semantic analysis failed.`),E=e=>(e instanceof t.D?T():_(e,c),w(),t.B(e)),D=(()=>{try{return r.h((0,a.readFileSync)(y,`utf8`),v)}catch(e){if(!(e instanceof t.m))throw e;return e}})();if(D instanceof t.m&&v===`1.7.4`)return c.print(n.ft.general,n.pt.error,`${t.V(`tlc2.tool.ConfigFileException`)}${n.gt(D.message,c.isTool)}`),w(),t.U.error;if(D instanceof t.m)return E(D);o.has(`-deadlock`)&&(D.checkDeadlock=!1);let O=(0,i.dirname)(e),ee=[O,...s.libraries],te=m(ee),k=sa(o,v);c.isTool&&c.print(n.ft.startingSany,n.pt.none,`Starting SANY...`);let A=(0,i.isAbsolute)(e),j=A?b:e.replace(/\.tla$/,``),ne=S(s),re=v===`1.7.4`?da(e,s,ne):void 0;if(re?!(0,a.existsSync)(e)&&!n.L.has(b)&&re(`${b}.tla`):!(0,a.existsSync)(e)&&!n.R.has(b)&&h(A?O:process.cwd(),A?`${b}.tla`:`./${j}.tla`,[...A||O===`.`?[]:[O],...s.libraries]),Ni(e,re?x(te,re):te,{fileName:j,describeFile:ra(e,ee,s,o.get(`-metadir`)?.[0],v),version:v,rootExtendees:k?[`_TLCTrace`]:void 0,onPrint:e=>process.stdout.write(e),onPrintError:e=>process.stderr.write(e)}).isFailed)return Zi(c,{kind:`parsed`},C,O),T(),w(),t.U.specParseError;try{let s=(0,a.readFileSync)(e,`utf8`),f=n.H(s).name;if(f!==b)throw new t.T(`File name '${b}' does not match the name '${f}' of the top level module it contains.`,void 0);let p=await r.m({workers:g,livenessCheck:[`final`,`seqfinal`,`off`].includes(u)?`final`:`default`,seed:BigInt(l),dump:d&&zi(d),isTool:c.isTool,isTraceRecorded:k,isSanyReported:!0,isWarningEnabled:!o.has(`-nowarning`),version:v,onProgress:e=>Zi(c,e,C,O),source:s,config:D,onPause:()=>(0,a.readSync)(0,Buffer.alloc(1)),loadModule:te,loadClass:e=>{let t=Xi(O,e);return(0,a.existsSync)(t)?(0,a.readFileSync)(t):void 0},readFile:e=>(0,a.existsSync)(e)?(0,a.readFileSync)(e,`utf8`):void 0,writeFile:(e,t)=>{(0,a.mkdirSync)((0,i.dirname)((0,i.resolve)(e)),{recursive:!0}),(0,a.writeFileSync)(e,t)}});return ta(p,c,C),w(),p.failure?.exitCode??Pi[p.status]}catch(e){if(!(e instanceof t.h))throw e;return e instanceof t.D&&console.log(la(e,b)),C.isParsed||Zi(c,{kind:`parsed`},C,O),E(e)}},la=(e,n)=>{let r=e instanceof t.T;if(!r&&!e.failure)return`Semantic errors:\n\n*** Errors: 1\n\n${e.message}\n\n`;let i=r?e.location===void 0?`Unknown location\n\n${e.message}`:`In module ${e.location}\n\n${e.message}`:`In module ${n}\n\nCould not parse module ${n} from file ${n}.tla`;return`${e.failure?`***Parse Error***\n${e.message}\n\n`:``}\nFatal errors while parsing TLA+ spec in file ${n}\n\n${i}\n*** Errors: 1\n\n${i}\n\n\n`},ua=async(e,r)=>{let o=me.parse(e),s=f(o.positionals),c=o.has(`-config`),l=s.map(e=>({...e,path:e.isGlobbed||/\.(tla|cfg)$/.test(e.path)?e.path.replace(/\.cfg$/,`.tla`):`${e.path}.tla`})).filter(e=>e.path.endsWith(`.tla`)&&(!e.isGlobbed||c||(0,a.existsSync)(e.path.replace(/\.tla$/,`.cfg`)))).map(e=>e.path);if(l.length===0)return console.error(F),1;if(c&&l.length>1)return console.error(`Error: -config applies to one specification, but several were given.`),1;let u=[...new Set(l.map(e=>(0,a.existsSync)(e)||(0,i.isAbsolute)(e)?e:r.libraries.map(t=>(0,i.join)(t,e)).find(a.existsSync)??e))],d=[];for(let[e,t]of u.entries()){e>0&&console.log(``),u.length>1&&console.log(`Checking ${(0,i.basename)(t)} with ${(0,i.basename)(t,`.tla`)}.cfg`);let a=n.mt(o.has(`-tool`),!o.has(`-nowarning`),r.tlcVersion??`master`);d.push(await v(()=>ca(t,o,r,a),a))}return d.find(e=>e!==t.U.success)??t.U.success},da=(e,t,n)=>{let r=e.slice(0,e.lastIndexOf(`/`)+1),a=(!(0,i.isAbsolute)(e)&&r!==``?[r]:t.libraries).map(b),o=a.length>0?a[a.length-1]:(0,i.isAbsolute)(e)?r:``;return e=>y(`${o}${e}`,a,n)},fa={uncaughtException:1,argsParsingFailure:1,specParsingFailure:2,unrepresentableCharacter:7},pa=e=>`java.lang.IllegalArgumentException: unsupported kind: ${e} in xml export`,Z=(e,t=[])=>({tag:e,children:t}),Q=(e,t)=>({tag:e,text:String(t),children:[]}),ma={"&":`&`,"<":`<`,">":`>`,"\r":` `},ha=e=>e.replace(/[&<>\r]|[\u{10000}-\u{10FFFF}]/gu,e=>e.length===2?`&#${e.codePointAt(0)};`:ma[e]),ga=/[^\t\n\r\u0020-\uD7FF\uE000-\uFFFD\u{10000}-\u{10FFFF}]/u,_a=e=>{let t=(e.cdata??e.text)?.match(ga)?.[0];if(t!==void 0)return{tag:e.tag,character:t};for(let t of e.children){let e=_a(t);if(e)return e}},va=(e,t,n,r)=>{let i=` `.repeat(t*n);if(e.cdata){let t=e.cdata.replaceAll(`]]>`,`]]]]><![CDATA[>`);r.push(`${i}<${e.tag}><![CDATA[${t}]]></${e.tag}>`)}else if(e.text)r.push(`${i}<${e.tag}>${ha(e.text)}</${e.tag}>`);else if(e.children.length===0)r.push(`${i}<${e.tag}/>`);else{r.push(`${i}<${e.tag}>`);for(let i of e.children)va(i,t+1,n,r);r.push(`${i}</${e.tag}>`)}},ya=e=>Z(`location`,[Z(`column`,[Q(`begin`,e.beginColumn),Q(`end`,e.endColumn)]),Z(`line`,[Q(`begin`,e.beginLine),Q(`end`,e.endLine)]),Q(`filename`,e.file)]),ba=e=>{switch(e.kind){case`FormalParam`:return`FormalParamNodeRef`;case`OpDecl`:return`OpDeclNodeRef`;case`Module`:return`ModuleNodeRef`;case`Theorem`:return`TheoremNodeRef`;case`Assume`:return`AssumeNodeRef`;case`ThmOrAssumpDef`:return e.isTheorem?`TheoremDefRef`:`AssumeDefRef`;case`OpDef`:return e.defKind===`UserDefined`?`UserDefinedOpKindRef`:e.defKind===`BuiltIn`?`BuiltInKindRef`:`ModuleInstanceKindRef`}},$={main:{at:`xml.XMLExporter.main(XMLExporter.java:145)`},constant:{at:`semantic.ModuleNode.getSymbolElement(ModuleNode.java:1228)`},variable:{at:`semantic.ModuleNode.getSymbolElement(ModuleNode.java:1236)`},definition:{at:`semantic.ModuleNode.getSymbolElement(ModuleNode.java:1244)`},topLevel:{at:`semantic.ModuleNode.getSymbolElement(ModuleNode.java:1268)`},body:{at:`semantic.OpDefNode.getSymbolElement(OpDefNode.java:1392)`,nullType:`ExprNode`,nullValue:`"this.body"`},param:{at:`semantic.OpDefNode.getSymbolElement(OpDefNode.java:1397)`},builtInParam:{at:`semantic.OpDefNode.getSymbolElement(OpDefNode.java:1413)`},theoremDefinitionBody:{at:`semantic.ThmOrAssumpDefNode.getSymbolElement(ThmOrAssumpDefNode.java:663)`,nullType:`LevelNode`,nullValue:`"this.body"`},theoremDefinition:{at:`semantic.TheoremNode.getLevelElement(TheoremNode.java:439)`},theorem:{at:`semantic.TheoremNode.getLevelElement(TheoremNode.java:444)`,nullType:`LevelNode`,nullValue:`the return value of "tla2sany.semantic.TheoremNode.getTheorem()"`},proof:{at:`semantic.TheoremNode.getLevelElement(TheoremNode.java:447)`},assumeDefinition:{at:`semantic.AssumeNode.getLevelElement(AssumeNode.java:249)`},assume:{at:`semantic.AssumeNode.getLevelElement(AssumeNode.java:254)`,nullType:`ExprNode`,nullValue:`the return value of "tla2sany.semantic.AssumeNode.getAssume()"`},operator:{at:`semantic.OpApplNode.getLevelElement(OpApplNode.java:1315)`},operand:{at:`semantic.OpApplNode.getLevelElement(OpApplNode.java:1326)`,nullType:`ExprOrOpArgNode`,nullValue:`"this.operands[i]"`},unbound:{at:`semantic.OpApplNode.getLevelElement(OpApplNode.java:1337)`},bound:{at:`semantic.OpApplNode.getLevelElement(OpApplNode.java:1347)`},range:{at:`semantic.OpApplNode.getLevelElement(OpApplNode.java:1349)`,nullType:`ExprNode`,nullValue:`"this.ranges[i]"`},letBody:{at:`semantic.LetInNode.getLevelElement(LetInNode.java:301)`,nullType:`ExprNode`,nullValue:`"this.body"`},letDefinition:{at:`semantic.LetInNode.getLevelElement(LetInNode.java:303)`},labelBody:{at:`semantic.LabelNode.getLevelElement(LabelNode.java:341)`,nullType:`LevelNode`,nullValue:`"this.body"`},labelParam:{at:`semantic.LabelNode.getLevelElement(LabelNode.java:343)`},argument:{at:`semantic.OpArgNode.getLevelElement(OpArgNode.java:150)`},exceptObject:{at:`semantic.AtNode.getLevelElement(AtNode.java:180)`},exceptComponents:{at:`semantic.AtNode.getLevelElement(AtNode.java:181)`},substOperator:{at:`semantic.Subst.export(Subst.java:258)`},substExpression:{at:`semantic.Subst.export(Subst.java:259)`,nullType:`ExprOrOpArgNode`,nullValue:`"this.expr"`},instanceSubst:{at:`semantic.InstanceNode.getLevelElement(InstanceNode.java:447)`},instanceParam:{at:`semantic.InstanceNode.getLevelElement(InstanceNode.java:452)`},useFact:{at:`semantic.UseOrHideNode.getLevelElement(UseOrHideNode.java:175)`,nullType:`LevelNode`,nullValue:`"this.facts[i]"`},useDefinition:{at:`semantic.UseOrHideNode.getLevelElement(UseOrHideNode.java:176)`},newDeclaration:{at:`semantic.NewSymbNode.getLevelElement(NewSymbNode.java:202)`},newSet:{at:`semantic.NewSymbNode.getLevelElement(NewSymbNode.java:204)`},assumption:{at:`semantic.AssumeProveNode.getLevelElement(AssumeProveNode.java:404)`,nullType:`SemanticNode`,nullValue:`"assumes[i]"`},goal:{at:`semantic.AssumeProveNode.getLevelElement(AssumeProveNode.java:406)`,nullType:`ExprNode`,nullValue:`the return value of "tla2sany.semantic.AssumeProveNode.getProve()"`},byFact:{at:`semantic.LeafProofNode.getLevelElement(LeafProofNode.java:154)`,nullType:`LevelNode`,nullValue:`"this.facts[i]"`},byDefinition:{at:`semantic.LeafProofNode.getLevelElement(LeafProofNode.java:155)`},step:{at:`semantic.NonLeafProofNode.getLevelElement(NonLeafProofNode.java:228)`,nullType:`LevelNode`,nullValue:`"this.steps[i]"`},defStep:{at:`semantic.DefStepNode.getLevelElement(DefStepNode.java:99)`}},xa={SubstIn:{subst:{at:`semantic.SubstInNode.getLevelElement(SubstInNode.java:530)`},body:{at:`semantic.SubstInNode.getLevelElement(SubstInNode.java:533)`,nullType:`ExprNode`,nullValue:`"this.body"`},from:{at:`semantic.SubstInNode.getLevelElement(SubstInNode.java:536)`},to:{at:`semantic.SubstInNode.getLevelElement(SubstInNode.java:540)`}},APSubstIn:{subst:{at:`semantic.APSubstInNode.getLevelElement(APSubstInNode.java:460)`},body:{at:`semantic.APSubstInNode.getLevelElement(APSubstInNode.java:463)`,nullType:`LevelNode`,nullValue:`"this.body"`},from:{at:`semantic.APSubstInNode.getLevelElement(APSubstInNode.java:466)`},to:{at:`semantic.APSubstInNode.getLevelElement(APSubstInNode.java:470)`}}},Sa={at:`semantic.OpDefNode.getSymbolElement(OpDefNode.java:1424)`},Ca=yn(`--TLA+ BUILTINS--`),wa=(e,t)=>{let[n,r,i]=e===`Theorem`?[`TheoremNode.export(TheoremNode.java:456)`,70,`TheoremNode.exportDefinition(TheoremNode.java:404)`]:e===`Assume`?[`AssumeNode.export(AssumeNode.java:263)`,80,`AssumeNode.exportDefinition(AssumeNode.java:207)`]:[e===`ThmOrAssumpDef`?`ThmOrAssumpDefNode.export(ThmOrAssumpDefNode.java:671)`:`SymbolNode.export(SymbolNode.java:177)`,60,`SymbolNode.exportDefinition(SymbolNode.java:138)`];return[{at:`semantic.${n}`},{at:`xml.SymbolContext.put(SymbolContext.java:${r})`},{at:`semantic.${i}`,failedFor:t}]},Ta=(e,t=16)=>e>t*.75?Ta(e,t*2):t,Ea=(e,t)=>(e^e>>>16)&t-1,Da=e=>{let t=e.split(/\r?\n/);for(;t.at(-1)===``;)t.pop();return t},Oa=e=>e.replace(/^[\0-\x20]+|[\0-\x20]+$/g,``),ka=/[\t-\r\x1C-\x20\u1680\u2000-\u2006\u2008-\u200A\u2028\u2029\u205F\u3000]+$/,Aa=e=>{let t=e.indexOf(`(**`),n=e.lastIndexOf(`**)`);if(t<0||n<=t)return e;let r=Da(e),i=r.findIndex(e=>e.includes(`(**`)),a=r.findLastIndex(e=>e.includes(`**)`));return i<0||i>=a?e:r.slice(i+1,a).map(e=>{let t=e.indexOf(`(*`),n=e.indexOf(`*)`);return t<0||n<=t?e:e.slice(t+3,Math.max(t+3,n)).replace(ka,``)}).join(`
|
|
37
|
+
`:e.length===1?`Temporal property ${e[0]} was violated.\n`:`Temporal properties ${e.slice(0,-1).join(`, `)}${e.length>2?`,`:``} and ${e[e.length-1]} were violated.\n`,Ki=e=>e.filter((t,n)=>t!==e[n-1]).map((e,t)=>`${t}) ${n.Y(e)}\n`).toReversed().join(``),qi=e=>{if(e.length===0)return` The error call stack is empty.
|
|
38
|
+
`;let t=[];return e.forEach((n,r)=>{let i=n.location.range;n!==e[r-1]&&i&&t.push(`${t.length}. Line ${i.start.line}, column ${i.start.column} to line ${i.end.line}, column ${i.end.column} in ${i.module}\n`)}),`${t.join(``)}\n`},Ji=(e,t)=>{let r=t.generated,i=t.distinct,a=n.gt(/* @__PURE__ */ new Date);r===i?e.print(n.dt.initGenerated1,n.ft.none,`Finished computing initial states: ${i} distinct state${i===1?``:`s`} generated at ${a}.`):e.print(n.dt.initGenerated2,n.ft.none,`Finished computing initial states: ${r} state${r===1?``:`s`} generated, with ${i} of them distinct at ${a}.`)},Yi=(e,t,r)=>{let i=Math.max(Date.now()-(r??0),1)/6e4,a=e=>e.toLocaleString(`en-US`),o=(e,t)=>r===void 0?``:` (${a(Math.floor(e/i))} ${t}/min)`;e.print(n.dt.progress,n.ft.none,`Progress(${Math.max(t.depth,1)}) at ${n.gt(/* @__PURE__ */ new Date)}: ${a(t.generatedStates)} states generated${o(t.generatedStates,`s`)}, ${a(t.distinctStates)} distinct states found${o(t.distinctStates,`ds`)}, ${a(t.queuedStates)} states left on queue.`)},Xi=(e,t)=>(0,i.join)(e,`${t}.class`),Zi=(e,t,r,a)=>{let s=e.print;switch(t.kind){case`parsed`:r.isParsed=!0,e.isTool&&s(n.dt.sanyFinished,n.ft.none,`SANY finished.`),s(n.dt.starting,n.ft.none,`Starting... (${n.gt(/* @__PURE__ */ new Date)})`);return;case`constant-level-invariant`:if(e.version===`1.7.4`)return;s(n.dt.constantLevelInvariant,n.ft.warning,`The invariant ${t.name} is a constant-level formula (i.e., it contains no variables, primes, or temporal operators) and evaluates to TRUE. To assert constant-level formulas in your spec, use ASSUME ConstInv. If you optionally want to give the assumption a name, write ASSUME YourAssumption == ConstInv instead. See https://explain.tlapl.us/assumptions-and-invariants for additional details.`);return;case`state-level-property`:if(e.version===`1.7.4`)return;s(n.dt.stateLevelProperty,n.ft.warning,`The formula ${t.name} is a state-level formula, but it was used as a PROPERTY (or PROPERTIES), where a temporal formula is typically expected. State-level formulas used as PROPERTY or PROPERTIES are only checked in the initial state. To verify that the formula ${t.name} holds in all states of every behavior, use INVARIANT ${t.name} instead. Alternatively, applying the "always" temporal operator ([]) to the state-level formula ${t.name} changes it into a temporal formula, asserting that ${t.name} holds in all states of every behavior. See https://explain.tlapl.us/invariants-and-properties for additional details.`);return;case`liveness-initializing`:t.isSymmetric&&s(n.dt.livenessSymmetry,n.ft.warning,`Declaring symmetry during liveness checking is dangerous. It might cause TLC to miss violations of the stated liveness properties. Please check liveness without symmetry defined.`),t.isConstrained&&e.version===`1.7.4`&&s(n.dt.livenessConstraints,n.ft.warning,`Declaring state or action constraints during liveness checking is dangerous: Please read section 14.3.5 on page 247 of Specifying Systems (https://lamport.azurewebsites.net/tla/book.html) and optionally the discussion at https://discuss.tlapl.us/msg00994.html for more details.`);return;case`liveness-prepared`:s(n.dt.temporalBranches,n.ft.none,`Implied-temporal checking--satisfiability problem has ${t.branches} branches.`);return;case`java-override`:{let e=(0,o.pathToFileURL)((0,i.resolve)(Xi(a,t.module))).href;s(t.isMatched?n.dt.javaOverrideLoaded:n.dt.javaOverrideMismatch,t.isMatched?n.ft.none:n.ft.warning,`${t.isMatched?`Loading`:`Failed to match`} ${t.operator} operator override from ${e.replace(`file:///`,`file:/`)} with signature: <Java Method: ${t.signature}>.`);return}case`initial-states-started`:s(n.dt.computingInit,n.ft.none,`Computing initial states...`);return;case`initial-states-progress`:Bi(e,t.count);return;case`initial-states-computed`:Ji(e,t.initialStates);return;case`progress`:Yi(e,t.statistics,r.startTime);return;case`liveness-started`:{r.livenessStartTime=Date.now(),t.isComplete&&Yi(e,t.statistics);let i=t.branches>1?`${t.branches} branches of `:``,a=t.branches*t.states;s(n.dt.checkingTemporal,n.ft.none,`Checking ${i}temporal properties for the ${t.isComplete?`complete`:`current`} state space with ${a} total distinct states at (${n.gt(/* @__PURE__ */ new Date)})`);return}case`liveness-finished`:Qi(e,r);return;case`warning`:s(t.code,n.ft.warning,t.text)}},Qi=(e,t)=>{t.livenessStartTime!==void 0&&(e.print(n.dt.checkingTemporalEnd,n.ft.none,`Finished checking temporal properties in ${n._t(Date.now()-t.livenessStartTime)} at ${n.gt(/* @__PURE__ */ new Date)}`),t.livenessStartTime=void 0)},$i=(e,t,r)=>{let i=r.print,a=t.name,o=t.loopStart,s=o===void 0&&t.trace.length===1&&(e===`invariant-violation`||e===`liveness-violation`),c={code:n.dt.temporalPropertyViolated,text:Gi(t.properties??[a],r.version)},l={success:void 0,error:void 0,"assumption-violation":t.message?{code:n.dt.assumptionEvaluationError,text:n.mt(n.dt.assumptionEvaluationError,`Evaluating assumption ${a} failed.\n${t.message}`,r.isTool)}:{code:n.dt.assumptionFalse,text:`Assumption ${a} is false.`},deadlock:{code:n.dt.deadlockReached,text:`Deadlock reached.`},"invariant-violation":s?Vi(`invariant-violation`,a):{code:n.dt.invariantViolatedBehavior,text:`Invariant ${a} is violated.`},"property-violation":c,"liveness-violation":o===void 0?s?Vi(`liveness-violation`,a):{code:n.dt.actionPropertyViolatedBehavior,text:`Action property ${a} is violated.`}:c,"postcondition-violation":{code:t.postcondition?.code??n.dt.general,text:t.message??`Postcondition ${a} is false.`}}[e],u=e===`property-violation`,d=o!==void 0&&!u,f=u||d,p=f&&r.version!==`1.7.4`;if(p&&Hi(r,t.trace[0]?.output),t.counts&&console.log(t.counts),l){let e=s?`${l.text}\n${n.At(t.trace[0].state)}`:l.text;i(l.code,n.ft.error,e)}if(s||(f||Hi(r,t.trace[0]?.output),Ui(r,t.trace,f?Wi:void 0,f&&!p),Hi(r,t.traceOutput)),d){let e=t.loopLabel;o===t.trace.length-1?i(n.dt.statePrint3,n.ft.state,`${o+2}: Stuttering`):r.isTool?i(n.dt.backToState,n.ft.state,`${o+1}: Back to state${e?`: <${e}>\n`:``}`):console.log(`Back to state ${o+1}${e?`: <${e}>\n`:``}`)}t.warning&&r.version!==`1.7.4`&&i(t.warning.code,n.ft.warning,t.warning.text);let m=t.unwitnessed??(e===`postcondition-violation`?void 0:t.postcondition);return m?.counts&&console.log(m.counts),m&&i(m.code,n.ft.error,m.message),!s&&e!==`assumption-violation`},ea=(e,t)=>e.print(n.dt.nestedExpression,n.ft.error,`The error occurred when TLC was evaluating the nested\nexpressions at the following positions:\n${qi(t)}`),ta=(e,r,i)=>{let a=r.print;if(e.failure){let i=e.failure,o=r.isTool?i.toolMessage:i.message,s=()=>{let e=i.fingerprint;if(e){let t=i.callStack?.length&&r.version!==`1.7.4`?qi(i.callStack):Ki(e.sources);a(n.dt.fingerprintFailed,n.ft.error,`TLC was unable to fingerprint.\n\nFingerprint Stack Trace:\n${t}\nReason:\n${n.ht(e.reason,r.isTool)}`)}else i.callStack&&ea(r,i.callStack)};i.isCallStackFirst&&s();let c=i.initialState&&(()=>{try{return`While working on the initial state:\n${n.At(i.initialState)}`}catch(e){throw e instanceof t._?t.K(new t._(`${t.P}${e.message}`),t.W.error):e}})();a(c?n.dt.initialState:i.code,n.ft.error,c?`${o}\n${c}`:o),Hi(r,i.trace[0]?.output),Ui(r,i.trace);let l=i.traceFailure;l&&a(l.code,n.ft.error,r.isTool?l.toolMessage:l.message),Hi(r,i.traceOutput);let u=i.postcondition;u?.counts&&console.log(u.counts),u&&a(u.code,n.ft.error,u.message),i.isCallStackFirst||s()}else if(e.violation){if(!$i(e.status,e.violation,r))return;let t=e.additionalViolation;t&&$i(`property-violation`,t,r),e.liveCallStack&&ea(r,e.liveCallStack)}else{Qi(r,i);let t=n.f(e.distinctStates,e.generatedStates),o=e.fingerprintDistance===void 0?[]:[` based on the actual fingerprints: val = ${n.l(n.u(e.fingerprintDistance))}`];a(n.dt.success,n.ft.none,[`Model checking completed. No error has been found.`,` Estimates of the probability that TLC did not check all reachable states`,` because two distinct states had the same fingerprint:`,` calculated (optimistic): val = ${n.l(t)}`,...o].join(`
|
|
39
|
+
`))}if(e.failure?.isWithoutStatistics)return;e.status!==`success`&&Qi(r,i),r.isTool&&Yi(r,e,i.startTime),a(n.dt.stats,n.ft.none,`${e.generatedStates} states generated, ${e.distinctStates} distinct states found, ${e.queuedStates} states left on queue.`);let o=r.version===`1.7.4`,s=o?e.outDegrees??e.violationOutDegrees:e.outDegrees;(!o||s)&&a(n.dt.searchDepth,n.ft.none,`The depth of the complete state graph search is ${o?Math.max(e.depth,1):e.depth}.`);let c=s&&n.p(s);c&&a(n.dt.stateGraphOutdegree,n.ft.none,c)},na=e=>n.z([e]).toString(),ra=(e,t,n,r,o)=>{let c=n.temporaryDirectory??(0,s.tmpdir)(),l=(0,a.existsSync)(c)?(0,a.realpathSync)(c):(0,i.resolve)(c),u=(0,i.join)(l,`tlc-${na((0,i.resolve)(e))}`),d=S(n);return(n,s)=>{let c=`${n}.tla`;if(s===`file`)return(0,a.realpathSync)(p(t,n)??e);if(o===`1.7.4`)return(0,i.join)(l,c);if(s===`root file`){let t=r===void 0?l:(0,i.resolve)(r),o=(0,a.realpathSync)(e);return`${(0,i.join)(t,na(`${o} ${n}`),c)} (${o})`}let f=(0,i.join)(u,c);return d===void 0?f:`${f} (${g(d)}${c})`}},ia=e=>e.print(n.dt.version,n.ft.none,`TLC2 Version ${C} (rev: tla-ts)`),aa=(e,t)=>(ia(e),e.print(n.dt.commandLineError,n.ft.error,`${t}\nUsage: java tlc2.TLC [-help] [-option] inputfile`),1),oa=(e,t,r)=>e.print(n.dt.modelChecking,n.ft.none,`Running breadth-first search Model-Checking with fp 0 and seed ${BigInt(t)} with ${r} worker${r===1?``:`s`} on ${(0,s.availableParallelism)()} cores with ${Math.floor((0,c.getHeapStatistics)().heap_size_limit/1024/1024)}MB heap and 0MB offheap memory [pid: ${process.pid}] (${(0,s.type)()} ${(0,s.release)()} ${(0,s.arch)()}, Node.js ${process.versions.node} ${process.arch.endsWith(`64`)?64:32}bit, MemFPSet, MemStateQueue).`),sa=(e,t)=>{let n=[...e.unknown,...e.options.map(e=>e.name)],r=(e,t=e)=>n.some(n=>n===e||n.toLowerCase()===t.toLowerCase()),i=r(`-generateSpecTE`)||!r(`-noGenerateSpecTE`,`-noTE`)&&!r(`-tool`)&&!r(`-continue`);return t!==`1.7.4`&&i&&!r(`-noGenerateSpecTEBin`,`-noTEBin`)},ca=async(e,o,s,c)=>{let l=o.has(`-seed`)?o.get(`-seed`)?.[0]:`0`;if(l===void 0)return aa(c,`Error: seed required.`);if(!Fi(l))return aa(c,`Error: An integer for seed required. But encountered ${l}`);let u=o.has(`-lncheck`)?o.get(`-lncheck`)?.[0]?.toLowerCase():`default`;if(u===void 0)return aa(c,`Error: expect a strategy such as final for -lncheck option.`);let d=o.get(`-dump`);if(d?.length===0)return aa(c,`Error: A file name for dumping states required.`);let f=d?.length===2&&Li.find(e=>d[0].toLowerCase().includes(e));if(f)return console.error(`Error: tla-ts does not support the -dump format ${f}.`),1;let p=o.get(`-fp`)?.[0];if(p!==void 0&&Number(p)!==0)return console.error(`Error: tla-ts fingerprints states as TLC does with -fp 0, not -fp ${p}.`),1;let g=Ii(o.get(`-workers`)),v=c.version;ia(c),oa(c,l,g);let y=o.get(`-config`)?.[0]??(o.has(`-config`)?void 0:e.replace(/\.tla$/,`.cfg`));if(!y||!(0,a.existsSync)(y))return c.print(n.dt.configFileError,n.ft.error,`TLC encountered the following error when trying to read the configuration file ${y??``}:\nFile not found.`),t.W.configParseError;let b=(0,i.basename)(e,`.tla`),C={startTime:Date.now(),livenessStartTime:void 0,isParsed:!1},w=()=>{let e=Date.now()-C.startTime;c.print(n.dt.finished,n.ft.none,`Finished in ${c.isTool?`${e}ms`:n._t(e)} at (${n.gt(/* @__PURE__ */ new Date)})`)},T=()=>c.print(n.dt.parsingFailed,n.ft.error,`Parsing or semantic analysis failed.`),E=e=>(e instanceof t.O?T():_(e,c),w(),t.V(e)),D=(()=>{try{return r.h((0,a.readFileSync)(y,`utf8`),v)}catch(e){if(!(e instanceof t.h))throw e;return e}})();if(D instanceof t.h&&v===`1.7.4`)return c.print(n.dt.general,n.ft.error,`${t.H(`tlc2.tool.ConfigFileException`)}${n.ht(D.message,c.isTool)}`),w(),t.W.error;if(D instanceof t.h)return E(D);o.has(`-deadlock`)&&(D.checkDeadlock=!1);let O=(0,i.dirname)(e),ee=[O,...s.libraries],te=m(ee),k=sa(o,v);c.isTool&&c.print(n.dt.startingSany,n.ft.none,`Starting SANY...`);let A=(0,i.isAbsolute)(e),j=A?b:e.replace(/\.tla$/,``),ne=S(s),re=v===`1.7.4`?da(e,s,ne):void 0;if(re?!(0,a.existsSync)(e)&&!n.I.has(b)&&re(`${b}.tla`):!(0,a.existsSync)(e)&&!n.L.has(b)&&h(A?O:process.cwd(),A?`${b}.tla`:`./${j}.tla`,[...A||O===`.`?[]:[O],...s.libraries]),Ni(e,re?x(te,re):te,{fileName:j,describeFile:ra(e,ee,s,o.get(`-metadir`)?.[0],v),version:v,rootExtendees:k?[`_TLCTrace`]:void 0,onPrint:e=>process.stdout.write(e),onPrintError:e=>process.stderr.write(e)}).isFailed)return Zi(c,{kind:`parsed`},C,O),T(),w(),t.W.specParseError;try{let s=(0,a.readFileSync)(e,`utf8`),f=n.V(s).name;if(f!==b)throw new t.E(`File name '${b}' does not match the name '${f}' of the top level module it contains.`,void 0);let p=await r.m({workers:g,livenessCheck:[`final`,`seqfinal`,`off`].includes(u)?`final`:`default`,seed:BigInt(l),dump:d&&zi(d),isTool:c.isTool,isTraceRecorded:k,isSanyReported:!0,isWarningEnabled:!o.has(`-nowarning`),version:v,onProgress:e=>Zi(c,e,C,O),source:s,config:D,onPause:()=>(0,a.readSync)(0,Buffer.alloc(1)),loadModule:te,loadClass:e=>{let t=Xi(O,e);return(0,a.existsSync)(t)?(0,a.readFileSync)(t):void 0},readFile:e=>(0,a.existsSync)(e)?(0,a.readFileSync)(e,`utf8`):void 0,writeFile:(e,t)=>{(0,a.mkdirSync)((0,i.dirname)((0,i.resolve)(e)),{recursive:!0}),(0,a.writeFileSync)(e,t)}});return ta(p,c,C),w(),p.failure?.exitCode??Pi[p.status]}catch(e){if(!(e instanceof t.g))throw e;return e instanceof t.O&&console.log(la(e,b)),C.isParsed||Zi(c,{kind:`parsed`},C,O),E(e)}},la=(e,n)=>{let r=e instanceof t.E;if(!r&&!e.failure)return`Semantic errors:\n\n*** Errors: 1\n\n${e.message}\n\n`;let i=r?e.location===void 0?`Unknown location\n\n${e.message}`:`In module ${e.location}\n\n${e.message}`:`In module ${n}\n\nCould not parse module ${n} from file ${n}.tla`;return`${e.failure?`***Parse Error***\n${e.message}\n\n`:``}\nFatal errors while parsing TLA+ spec in file ${n}\n\n${i}\n*** Errors: 1\n\n${i}\n\n\n`},ua=async(e,r)=>{let o=me.parse(e),s=f(o.positionals),c=o.has(`-config`),l=s.map(e=>({...e,path:e.isGlobbed||/\.(tla|cfg)$/.test(e.path)?e.path.replace(/\.cfg$/,`.tla`):`${e.path}.tla`})).filter(e=>e.path.endsWith(`.tla`)&&(!e.isGlobbed||c||(0,a.existsSync)(e.path.replace(/\.tla$/,`.cfg`)))).map(e=>e.path);if(l.length===0)return console.error(F),1;if(c&&l.length>1)return console.error(`Error: -config applies to one specification, but several were given.`),1;let u=[...new Set(l.map(e=>(0,a.existsSync)(e)||(0,i.isAbsolute)(e)?e:r.libraries.map(t=>(0,i.join)(t,e)).find(a.existsSync)??e))],d=[];for(let[e,t]of u.entries()){e>0&&console.log(``),u.length>1&&console.log(`Checking ${(0,i.basename)(t)} with ${(0,i.basename)(t,`.tla`)}.cfg`);let a=n.pt(o.has(`-tool`),!o.has(`-nowarning`),r.tlcVersion??`master`);d.push(await v(()=>ca(t,o,r,a),a))}return d.find(e=>e!==t.W.success)??t.W.success},da=(e,t,n)=>{let r=e.slice(0,e.lastIndexOf(`/`)+1),a=(!(0,i.isAbsolute)(e)&&r!==``?[r]:t.libraries).map(b),o=a.length>0?a[a.length-1]:(0,i.isAbsolute)(e)?r:``;return e=>y(`${o}${e}`,a,n)},fa={uncaughtException:1,argsParsingFailure:1,specParsingFailure:2,unrepresentableCharacter:7},pa=e=>`java.lang.IllegalArgumentException: unsupported kind: ${e} in xml export`,Z=(e,t=[])=>({tag:e,children:t}),Q=(e,t)=>({tag:e,text:String(t),children:[]}),ma={"&":`&`,"<":`<`,">":`>`,"\r":` `},ha=e=>e.replace(/[&<>\r]|[\u{10000}-\u{10FFFF}]/gu,e=>e.length===2?`&#${e.codePointAt(0)};`:ma[e]),ga=/[^\t\n\r\u0020-\uD7FF\uE000-\uFFFD\u{10000}-\u{10FFFF}]/u,_a=e=>{let t=(e.cdata??e.text)?.match(ga)?.[0];if(t!==void 0)return{tag:e.tag,character:t};for(let t of e.children){let e=_a(t);if(e)return e}},va=(e,t,n,r)=>{let i=` `.repeat(t*n);if(e.cdata){let t=e.cdata.replaceAll(`]]>`,`]]]]><![CDATA[>`);r.push(`${i}<${e.tag}><![CDATA[${t}]]></${e.tag}>`)}else if(e.text)r.push(`${i}<${e.tag}>${ha(e.text)}</${e.tag}>`);else if(e.children.length===0)r.push(`${i}<${e.tag}/>`);else{r.push(`${i}<${e.tag}>`);for(let i of e.children)va(i,t+1,n,r);r.push(`${i}</${e.tag}>`)}},ya=e=>Z(`location`,[Z(`column`,[Q(`begin`,e.beginColumn),Q(`end`,e.endColumn)]),Z(`line`,[Q(`begin`,e.beginLine),Q(`end`,e.endLine)]),Q(`filename`,e.file)]),ba=e=>{switch(e.kind){case`FormalParam`:return`FormalParamNodeRef`;case`OpDecl`:return`OpDeclNodeRef`;case`Module`:return`ModuleNodeRef`;case`Theorem`:return`TheoremNodeRef`;case`Assume`:return`AssumeNodeRef`;case`ThmOrAssumpDef`:return e.isTheorem?`TheoremDefRef`:`AssumeDefRef`;case`OpDef`:return e.defKind===`UserDefined`?`UserDefinedOpKindRef`:e.defKind===`BuiltIn`?`BuiltInKindRef`:`ModuleInstanceKindRef`}},$={main:{at:`xml.XMLExporter.main(XMLExporter.java:145)`},constant:{at:`semantic.ModuleNode.getSymbolElement(ModuleNode.java:1228)`},variable:{at:`semantic.ModuleNode.getSymbolElement(ModuleNode.java:1236)`},definition:{at:`semantic.ModuleNode.getSymbolElement(ModuleNode.java:1244)`},topLevel:{at:`semantic.ModuleNode.getSymbolElement(ModuleNode.java:1268)`},body:{at:`semantic.OpDefNode.getSymbolElement(OpDefNode.java:1392)`,nullType:`ExprNode`,nullValue:`"this.body"`},param:{at:`semantic.OpDefNode.getSymbolElement(OpDefNode.java:1397)`},builtInParam:{at:`semantic.OpDefNode.getSymbolElement(OpDefNode.java:1413)`},theoremDefinitionBody:{at:`semantic.ThmOrAssumpDefNode.getSymbolElement(ThmOrAssumpDefNode.java:663)`,nullType:`LevelNode`,nullValue:`"this.body"`},theoremDefinition:{at:`semantic.TheoremNode.getLevelElement(TheoremNode.java:439)`},theorem:{at:`semantic.TheoremNode.getLevelElement(TheoremNode.java:444)`,nullType:`LevelNode`,nullValue:`the return value of "tla2sany.semantic.TheoremNode.getTheorem()"`},proof:{at:`semantic.TheoremNode.getLevelElement(TheoremNode.java:447)`},assumeDefinition:{at:`semantic.AssumeNode.getLevelElement(AssumeNode.java:249)`},assume:{at:`semantic.AssumeNode.getLevelElement(AssumeNode.java:254)`,nullType:`ExprNode`,nullValue:`the return value of "tla2sany.semantic.AssumeNode.getAssume()"`},operator:{at:`semantic.OpApplNode.getLevelElement(OpApplNode.java:1315)`},operand:{at:`semantic.OpApplNode.getLevelElement(OpApplNode.java:1326)`,nullType:`ExprOrOpArgNode`,nullValue:`"this.operands[i]"`},unbound:{at:`semantic.OpApplNode.getLevelElement(OpApplNode.java:1337)`},bound:{at:`semantic.OpApplNode.getLevelElement(OpApplNode.java:1347)`},range:{at:`semantic.OpApplNode.getLevelElement(OpApplNode.java:1349)`,nullType:`ExprNode`,nullValue:`"this.ranges[i]"`},letBody:{at:`semantic.LetInNode.getLevelElement(LetInNode.java:301)`,nullType:`ExprNode`,nullValue:`"this.body"`},letDefinition:{at:`semantic.LetInNode.getLevelElement(LetInNode.java:303)`},labelBody:{at:`semantic.LabelNode.getLevelElement(LabelNode.java:341)`,nullType:`LevelNode`,nullValue:`"this.body"`},labelParam:{at:`semantic.LabelNode.getLevelElement(LabelNode.java:343)`},argument:{at:`semantic.OpArgNode.getLevelElement(OpArgNode.java:150)`},exceptObject:{at:`semantic.AtNode.getLevelElement(AtNode.java:180)`},exceptComponents:{at:`semantic.AtNode.getLevelElement(AtNode.java:181)`},substOperator:{at:`semantic.Subst.export(Subst.java:258)`},substExpression:{at:`semantic.Subst.export(Subst.java:259)`,nullType:`ExprOrOpArgNode`,nullValue:`"this.expr"`},instanceSubst:{at:`semantic.InstanceNode.getLevelElement(InstanceNode.java:447)`},instanceParam:{at:`semantic.InstanceNode.getLevelElement(InstanceNode.java:452)`},useFact:{at:`semantic.UseOrHideNode.getLevelElement(UseOrHideNode.java:175)`,nullType:`LevelNode`,nullValue:`"this.facts[i]"`},useDefinition:{at:`semantic.UseOrHideNode.getLevelElement(UseOrHideNode.java:176)`},newDeclaration:{at:`semantic.NewSymbNode.getLevelElement(NewSymbNode.java:202)`},newSet:{at:`semantic.NewSymbNode.getLevelElement(NewSymbNode.java:204)`},assumption:{at:`semantic.AssumeProveNode.getLevelElement(AssumeProveNode.java:404)`,nullType:`SemanticNode`,nullValue:`"assumes[i]"`},goal:{at:`semantic.AssumeProveNode.getLevelElement(AssumeProveNode.java:406)`,nullType:`ExprNode`,nullValue:`the return value of "tla2sany.semantic.AssumeProveNode.getProve()"`},byFact:{at:`semantic.LeafProofNode.getLevelElement(LeafProofNode.java:154)`,nullType:`LevelNode`,nullValue:`"this.facts[i]"`},byDefinition:{at:`semantic.LeafProofNode.getLevelElement(LeafProofNode.java:155)`},step:{at:`semantic.NonLeafProofNode.getLevelElement(NonLeafProofNode.java:228)`,nullType:`LevelNode`,nullValue:`"this.steps[i]"`},defStep:{at:`semantic.DefStepNode.getLevelElement(DefStepNode.java:99)`}},xa={SubstIn:{subst:{at:`semantic.SubstInNode.getLevelElement(SubstInNode.java:530)`},body:{at:`semantic.SubstInNode.getLevelElement(SubstInNode.java:533)`,nullType:`ExprNode`,nullValue:`"this.body"`},from:{at:`semantic.SubstInNode.getLevelElement(SubstInNode.java:536)`},to:{at:`semantic.SubstInNode.getLevelElement(SubstInNode.java:540)`}},APSubstIn:{subst:{at:`semantic.APSubstInNode.getLevelElement(APSubstInNode.java:460)`},body:{at:`semantic.APSubstInNode.getLevelElement(APSubstInNode.java:463)`,nullType:`LevelNode`,nullValue:`"this.body"`},from:{at:`semantic.APSubstInNode.getLevelElement(APSubstInNode.java:466)`},to:{at:`semantic.APSubstInNode.getLevelElement(APSubstInNode.java:470)`}}},Sa={at:`semantic.OpDefNode.getSymbolElement(OpDefNode.java:1424)`},Ca=yn(`--TLA+ BUILTINS--`),wa=(e,t)=>{let[n,r,i]=e===`Theorem`?[`TheoremNode.export(TheoremNode.java:456)`,70,`TheoremNode.exportDefinition(TheoremNode.java:404)`]:e===`Assume`?[`AssumeNode.export(AssumeNode.java:263)`,80,`AssumeNode.exportDefinition(AssumeNode.java:207)`]:[e===`ThmOrAssumpDef`?`ThmOrAssumpDefNode.export(ThmOrAssumpDefNode.java:671)`:`SymbolNode.export(SymbolNode.java:177)`,60,`SymbolNode.exportDefinition(SymbolNode.java:138)`];return[{at:`semantic.${n}`},{at:`xml.SymbolContext.put(SymbolContext.java:${r})`},{at:`semantic.${i}`,failedFor:t}]},Ta=(e,t=16)=>e>t*.75?Ta(e,t*2):t,Ea=(e,t)=>(e^e>>>16)&t-1,Da=e=>{let t=e.split(/\r?\n/);for(;t.at(-1)===``;)t.pop();return t},Oa=e=>e.replace(/^[\0-\x20]+|[\0-\x20]+$/g,``),ka=/[\t-\r\x1C-\x20\u1680\u2000-\u2006\u2008-\u200A\u2028\u2029\u205F\u3000]+$/,Aa=e=>{let t=e.indexOf(`(**`),n=e.lastIndexOf(`**)`);if(t<0||n<=t)return e;let r=Da(e),i=r.findIndex(e=>e.includes(`(**`)),a=r.findLastIndex(e=>e.includes(`**)`));return i<0||i>=a?e:r.slice(i+1,a).map(e=>{let t=e.indexOf(`(*`),n=e.indexOf(`*)`);return t<0||n<=t?e:e.slice(t+3,Math.max(t+3,n)).replace(ka,``)}).join(`
|
|
40
40
|
`)},ja=e=>{let t=Da(e),n=e=>Oa(e).startsWith(`\\*`);return t.filter(n).length<Math.floor(t.length/2)?e:t.map(e=>{if(!n(e))return e;let t=e.indexOf(`\\*`)+2;return e.slice(e[t]===` `?t+1:t)}).join(`
|
|
41
41
|
`)},Ma=(e,n,r)=>{let i=r.version===`1.7.4`,a=/* @__PURE__ */ new Set,o=/* @__PURE__ */ new Map,s={isSet:!1},c=[],l=(e,t)=>{if(!i)return t();c.push(...e);let n=t();return c.length-=e.length,n},u=(e,n)=>{let r=[...c,...n].reverse(),i=[e,...r.map(e=>`\tat tla2sany.${e.at}`)].join(`
|
|
42
|
-
`),a=r.filter(e=>e.failedFor!==void 0).map(e=>`failed for node.toString(): ${e.failedFor}\n with error \n${i}\n`).join(``);return t.
|
|
43
|
-
`),n=r.isUncommented?ja(Aa(t)):t;return e.length>0?[{tag:`pre-comments`,cdata:n,children:[]}]:[]},g=e=>{switch(e.kind){case`FormalParam`:return p(Z(`FormalParamNode`,[Q(`uniquename`,e.name),Q(`arity`,e.arity)]),e,e.location);case`OpDecl`:return p(Z(`OpDeclNode`,[Q(`uniquename`,e.name),Q(`arity`,e.arity),Q(`kind`,e.declKind)]),e,e.location);case`OpDef`:{if(e.defKind===`NumberedProofStep`)throw i?u(pa(37),[Sa]):t.
|
|
42
|
+
`),a=r.filter(e=>e.failedFor!==void 0).map(e=>`failed for node.toString(): ${e.failedFor}\n with error \n${i}\n`).join(``);return t.K(new t.x(i,a),fa.uncaughtException)},d=e=>u(`java.lang.NullPointerException: Cannot invoke "tla2sany.semantic.${e.nullType}.export(org.w3c.dom.Document, tla2sany.xml.SymbolContext)" because ${e.nullValue} is null`,[e]),f=(e,t)=>(a.has(e.id)||(a.add(e.id),o.set(e.id,l([...t?[t]:[],...wa(e.kind,yn(e.location))],()=>g(e)))),Z(ba(e),[Q(`UID`,e.id)])),p=(e,t,n)=>{let r=t.levelChecked===0?[]:[Q(`level`,t.level)],i=n?[ya(n),...r]:r;return{...e,children:[...i,...e.children]}},m=(e,t,n)=>Z(`params`,e.map((e,r)=>Z(`leibnizparam`,[f(e,n),...t?.[r]?[Z(`leibniz`)]:[]]))),h=e=>{let t=e.map(e=>e.trimEnd()).filter(e=>e.length>0).join(`
|
|
43
|
+
`),n=r.isUncommented?ja(Aa(t)):t;return e.length>0?[{tag:`pre-comments`,cdata:n,children:[]}]:[]},g=e=>{switch(e.kind){case`FormalParam`:return p(Z(`FormalParamNode`,[Q(`uniquename`,e.name),Q(`arity`,e.arity)]),e,e.location);case`OpDecl`:return p(Z(`OpDeclNode`,[Q(`uniquename`,e.name),Q(`arity`,e.arity),Q(`kind`,e.declKind)]),e,e.location);case`OpDef`:{if(e.defKind===`NumberedProofStep`)throw i?u(pa(37),[Sa]):t.K(new t.A(pa(37)),fa.uncaughtException);if(e.defKind===`ModuleInstance`)return p(Z(`ModuleInstanceKind`,[Q(`uniquename`,e.name),...e.isLocal&&!i?[Z(`local`)]:[]]),e,e.location);let n=e.params??[];if(e.defKind===`BuiltIn`)return p(Z(`BuiltInKind`,[Q(`uniquename`,e.name),Q(`arity`,e.arity),...e.params?[m(n,e.isLeibnizArg,$.builtInParam)]:[]]),e,e.location);let r=e.body,a=e.module;if(r===void 0&&i)throw d($.body);if(r===void 0||a===void 0)throw Error(`The definition of ${e.name} has no body`);return p(i?Z(`UserDefinedOpKind`,[Q(`uniquename`,e.name),Q(`arity`,e.arity),Z(`body`,[x(r,$.body)]),...e.params?[m(n,e.isLeibnizArg,$.param)]:[],...e.inRecursive?[Z(`recursive`)]:[]]):Z(`UserDefinedOpKind`,[Q(`uniquename`,e.name),Q(`arity`,e.arity),Z(`originalOperator`,[f(e.source??e)]),Z(`originallyDefinedInModule`,[f(a)]),Z(`body`,[x(r,$.body)]),m(n,e.isLeibnizArg,$.param),...h(e.preComments),...e.inRecursive?[Z(`recursive`)]:[],...e.recursiveSection>=0?[Q(`recursiveSection`,e.recursiveSection)]:[],...e.isLocal?[Z(`local`)]:[]]),e,e.location)}case`ThmOrAssumpDef`:return p(Z(e.isTheorem?`TheoremDefNode`:`AssumeDef`,[Q(`uniquename`,e.name),x(e.body,$.theoremDefinitionBody)]),e,e.location);case`Module`:return Z(`ModuleNode`,[ya(e.location),..._(e)]);case`Theorem`:return p(Z(`TheoremNode`,[...e.definition?[Z(`definition`,[f(e.definition,$.theoremDefinition)])]:[],Z(`body`,[x(e.body,$.theorem)]),...e.proof?[x(e.proof,$.proof)]:[],...e.isSuffices?[Z(`suffices`)]:[]]),e,e.location);case`Assume`:return Z(`AssumeNode`,[ya(e.location),...e.body.levelChecked===0?[]:[Q(`level`,e.body.level)],...e.definition?[Z(`definition`,[f(e.definition,$.assumeDefinition)])]:[],Z(`body`,[x(e.body,$.assume)])])}},_=e=>{let t=t=>!r.isRestricted||t.module===e;return[Q(`uniquename`,e.name),...i?[]:[Z(`extends`,[...new Set(e.extendees.map(e=>e.name))].toSorted().map(e=>Q(`uniquename`,e)))],...Fn(e,2).filter(t).map(e=>f(e,$.constant)),...Fn(e,3).filter(t).map(e=>f(e,$.variable)),...Pn(e).filter(t).map(e=>f(e,$.definition)),...e.topLevel.map(e=>e.kind===`Instance`||e.kind===`UseOrHide`?x(e,$.topLevel):f(e,$.topLevel)),...e.definitions.filter(e=>!i&&e.kind===`Module`).map(e=>f(e))]},v=(e,t)=>l([t],()=>Z(`Subst`,[f(e.op,$.substOperator),x(e.expr,$.substExpression)])),y=e=>{if(e.isNull&&i)throw u(pa(0),[$.operator,...wa(`OpDef`,Ca),Sa]);let t=e.operands[e.operands.length-1];e.operator.name===`$Case`&&e.operands.length>1&&t?.kind===`OpAppl`&&t.operator.name===`$Pair`&&t.operands[0]===void 0&&(s.isSet=!0);let n=f(e.operator,$.operator),r=e.operands.map((e,t)=>e===void 0||t===0&&s.isSet&&bn(e)?i?Q(`StringNode`,`$Other`):Z(`StringNode`,[Q(`StringValue`,`$Other`)]):x(e,$.operand)),a=e.tupleOrs,o=e.unbounded===void 0&&e.bounded===void 0?[]:[Z(`boundSymbols`,[...(e.unbounded??[]).map((e,t)=>Z(`unbound`,[f(e,$.unbound),...a?.[t]?[Z(`tuple`)]:[]])),...(e.bounded??[]).map((t,n)=>Z(`bound`,[...t.map(e=>f(e,$.bound)),...a?.[n]?[Z(`tuple`)]:[],x(e.ranges[n],$.range)]))])];return Z(`OpApplNode`,[Z(`operator`,[n]),Z(`operands`,r),...o])},b=(e,t)=>e.kind===`Module`||e.kind===`OpDef`?f(e,t):x(e,t),x=(e,t)=>{if(!i)return S(e);if(e.kind===`OpAppl`&&e.isAbsent&&`nullType`in t)throw d(t);let n=[t,{at:`semantic.SemanticNode.export(SemanticNode.java:379)`,failedFor:yn(e.location)},{at:`semantic.LevelNode.getSemanticElement(LevelNode.java:333)`}];return l(n,()=>S(e))},S=e=>{switch(e.kind){case`OpAppl`:return p(y(e),e,e.location);case`Numeral`:return p(Z(`NumeralNode`,[Q(`IntValue`,e.value)]),e,e.location);case`String`:return p(Z(`StringNode`,[Q(`StringValue`,e.value)]),e,e.location);case`Decimal`:return p(Z(`DecimalNode`,[Q(`mantissa`,e.mantissa),Q(`exponent`,e.exponent),...i?[]:[Q(`integralPart`,e.integralPart),Q(`fractionalPart`,e.fractionalPart)]]),e,e.location);case`LetIn`:{let t=x(e.body,$.letBody);return p(Z(`LetInNode`,[Z(`body`,[t]),Z(`opDefs`,e.opDefs.map(e=>f(e,$.letDefinition)))]),e,e.location)}case`Label`:return p(Z(`LabelNode`,[Q(`uniquename`,e.name),Q(`arity`,e.params.length),Z(`body`,[x(e.body,$.labelBody)]),Z(`params`,e.params.map(e=>f(e,$.labelParam)))]),e,e.location);case`OpArg`:return p(Z(`OpArgNode`,[Z(`argument`,[f(e.op,$.argument)])]),e,e.location);case`At`:{let t=e.except.operands[0],n=e.component.operands[0];if(t===void 0||n===void 0)throw Error(`An @ refers to an incomplete EXCEPT`);return p(Z(`AtNode`,[x(t,$.exceptObject),x(n,$.exceptComponents)]),e,e.location)}case`SubstIn`:case`APSubstIn`:{let t=xa[e.kind],n=e.substs.map(e=>v(e,t.subst)),r=x(e.body,t.body);return p(Z(e.kind===`SubstIn`?`SubstInNode`:`APSubstInNode`,[Z(`substs`,n),Z(`body`,[r]),Z(`instFrom`,[f(e.instantiatingModule,t.from)]),Z(`instTo`,[f(e.instantiatedModule,t.to)])]),e,e.location)}case`Instance`:{let t=e.substs.map(e=>v(e,$.instanceSubst)),n=e.params.map(e=>f(e,$.instanceParam));return Z(`InstanceNode`,[ya(e.location),Q(`level`,0),...e.name===void 0?[]:[Q(`uniquename`,e.name)],Q(`module`,e.module.name),Z(`substs`,t),Z(`params`,n),...e.isLocal&&!i?[Z(`local`)]:[]])}case`UseOrHide`:return p(Z(`UseOrHideNode`,[Z(`facts`,e.facts.map(e=>b(e,$.useFact))),Z(`defs`,e.defs.map(e=>f(e,$.useDefinition))),...e.isOnly?[Z(`only`)]:[],...e.isHide?[Z(`hide`)]:[]]),e,e.location);case`NewSymb`:return p(Z(`NewSymbNode`,[f(e.declaration,$.newDeclaration),...e.set&&!(i&&bn(e.set))?[x(e.set,$.newSet)]:[]]),e,e.location);case`AssumeProve`:return p(Z(`AssumeProveNode`,[Z(`assumes`,e.assumptions.map(e=>x(e,$.assumption))),Z(`prove`,[x(e.goal,$.goal)]),...e.isSuffices?[Z(`suffices`)]:[],...e.isBoxed?[Z(`boxed`)]:[]]),e,e.location);case`LeafProof`:{let t=e.facts.length===0&&e.defs.length===0,n=e.isOmitted?Z(`omitted`):t?Z(`obvious`):Z(`by`,[Z(`facts`,e.facts.map(e=>b(e,$.byFact))),Z(`defs`,e.defs.map(e=>f(e,$.byDefinition))),...e.isOnly?[Z(`only`)]:[]]);return p(n,e,e.location)}case`NonLeafProof`:return p(Z(`steps`,[...i?[]:[Q(`proofLevel`,e.proofLevel)],...e.steps.map(e=>e.kind===`Theorem`?f(e,$.step):x(e,$.step))]),e,e.location);case`DefStep`:return p(Z(`DefStepNode`,e.defs.map(e=>f(e,$.defStep))),e,e.location)}},C=(r.isRestricted?[n]:e).map(e=>f(e,$.main)),w=Ta(o.size),T=Z(`context`,[...o.entries()].toSorted(([e],[t])=>Ea(e,w)-Ea(t,w)).map(([e,t])=>Z(`entry`,[Q(`UID`,e),t])));return Z(`modules`,[Q(`RootModule`,n.name),T,...C])},Na=(e,n={version:`master`,isRestricted:!1,isUncommented:!1,isTerse:!1})=>{let r=Ma(e.modules,e.root,n),i=_a(r);if(i){let e=i.character.codePointAt(0)??0;throw t.K(new t.A(`The spec contains the character U+${e.toString(16).toUpperCase().padStart(4,`0`)} in the ${i.tag} element. XML 1.0 cannot represent that character in character data, not even as a numeric character reference, so the spec cannot be exported until the character is removed from it.`),fa.unrepresentableCharacter)}let a=[`<?xml version="1.0" encoding="UTF-8" standalone="no"?>`];return va(r,0,n.isTerse?0:2,a),n.isTerse?a.join(``):`${a.join(`
|
|
44
44
|
`)}\n`},Pa=(()=>{let e=e=>`\x1b[1m${e}\x1b[0m`,t=[[`-I`,`Include; use given directory path to resolve module dependencies.`],[`-help`,`Print this usage information.`],[`-o`,`Offline mode; skip XML schema validation step.`],[`-r`,`Restrict mode; include only declarations and definitions of the specified module, excluding extended or instantiated modules.`],[`-t`,`Terse; format XML output without tabs or newlines.`],[`-u`,`Uncomment; process boxed comments and single-line comments (\\*) in pre-comments to extract their content.`]],n=[`Only one root TLA+ file can be parsed per run.`,`Multiple directory search paths can be given by providing multiple -I arguments.`,`XML schema validation does not require network access.`];return[``,e(`NAME`),``,` tla2sany.xml.XMLExporter - Emit SANY's parse tree as XML - Version 2.2 created 08 July 2020`,``,``,e(`SYNOPSIS`),``,`\t${e(`tla2sany.xml.XMLExporter`)} [${e(`-Iortu`)}] [${e(`-help`)}] FILE`,``,e(`DESCRIPTION`),``,` Given a TLA+ file, parse that file with SANY then translate the module's semantic parse tree to XML, including all the modules depended on. The XML is printed to stdout and its output format is given by an XML Schema file (.xsd) found at https://proofs.tlapl.us/doc/web/sany.xsd.`,``,e(`OPTIONS`),``,...t.map(([t,n])=>`\t${e(t)}\n\t\t${n}`),``,e(`TIPS`),``,...n.flatMap(e=>[`\t${e}`,``]),``].join(`
|
|
45
|
-
`)})(),Fa=e=>(process.stderr.write(`ERROR: ${e}\n${Pa}`),fa.argsParsingFailure),Ia=(e,n)=>{try{return process.stdout.write(Na(e,n)),t.
|
|
45
|
+
`)})(),Fa=e=>(process.stderr.write(`ERROR: ${e}\n${Pa}`),fa.argsParsingFailure),Ia=(e,n)=>{try{return process.stdout.write(Na(e,n)),t.W.success}catch(e){if(!(e instanceof t.A))throw e;let n=t.V(e),r=e instanceof t.x?e.unwound:``;return console.error(n===fa.uncaughtException?`${r}Exception in thread "main" ${e.message}`:`ERROR: ${e.message}`),n}},La=(e,t)=>{let n={flags:/* @__PURE__ */ new Set,includes:[],error:void 0},r={index:-1};for(let i=0;i<e.length-1;i++)if(t.has(e[i]))n.flags.add(e[i]),r.index=i;else if(e[i]===`-I`){if(i++,i>e.length-2)return{...n,error:`missing-include`};n.includes.push(e[i]),r.index=i}return r.index===e.length-2?n:{...n,error:`several-files`}},Ra=e=>{if(e.length===0)return Fa(`at least one .tla file must be given`);let r=La(e,/* @__PURE__ */ new Set([`-o`,`-t`,`-r`,`-u`]));if(r.error===`missing-include`)return Fa(`the -I flag must be followed by a directory and at least one .tla file`);if(r.error===`several-files`)return Fa(`Only one TLA file to check allowed!`);let o=e[e.length-1];if(o===`-help`)return process.stdout.write(Pa),t.W.success;let s=o.endsWith(`.tla`)?o:`${o}.tla`,c=[`.`,...r.includes],l=c.map(e=>(0,i.resolve)(e,s)).find(a.existsSync);l===void 0&&!n.L.has(s.slice(0,-4))&&h(process.cwd(),`./${s}`,r.includes);let u=Ni(l??s,m(c),{fileName:o,isXmlExport:!0});return process.stderr.write(u.text),u.isFailed||u.specification===void 0?(console.error(`ERROR: Failed to parse module.`),fa.specParsingFailure):Ia(u.specification,{version:`master`,isRestricted:r.flags.has(`-r`),isUncommented:r.flags.has(`-u`),isTerse:r.flags.has(`-t`)})},za=(e,t)=>(console.error(`Exception in thread "main" ${e}\n\tat tla2sany.xml.XMLExporter.main(XMLExporter.java:${t})`),fa.uncaughtException),Ba=(e,r)=>{if(e.length===0)return za(`java.lang.IllegalArgumentException: at least one .tla file must be given`,59);let o=La(e,/* @__PURE__ */ new Set([`-o`]));if(o.error===`missing-include`)return za(`java.lang.IllegalArgumentException: the -I flag must be followed by a directory and at least one .tla file`,71);if(o.error===`several-files`)return za(`java.lang.IllegalArgumentException: Only one TLA file to check allowed!`,83);let s=e[e.length-1],c=`${s.replace(/\.tla$/i,``)}.tla`,l=(o.includes.length===0?[`/`]:o.includes).map(b),u=[`.`,...l],d=e=>y(`${l[l.length-1]}${e}`,l,r),f=u.map(e=>(0,i.resolve)(e,c)).find(a.existsSync);if(f===void 0&&!n.I.has((0,i.basename)(c,`.tla`)))return d(c),t.W.success;let p=Ni(f??c,x(m(u),d),{fileName:s,isXmlExport:!0,version:`1.7.4`});return process.stderr.write(p.text),p.specification===void 0?za(`tla2sany.xml.XMLExportingException: spec ${(f&&Mi((0,a.readFileSync)(f,`utf8`),`1.7.4`))??`null`} is malformed - does not have a root module`,110):Ia(p.specification,{version:`1.7.4`,isRestricted:!1,isUncommented:!1,isTerse:!0})},Va=[`tlc2.TLC`,`tla2sany.xml.XMLExporter`],Ha=e=>{let t={libraries:[]};for(let n=0;n<e.length;n++){let r=e[n];if(r===`-cp`||r===`-classpath`||r===`--class-path`)n++,t.classPath=e[n];else if(r===`-jar`)return t.classPath=e[n+1],{mainClass:`tlc2.TLC`,args:e.slice(n+2),java:t};else if(r.startsWith(`-DTLA-Library=`))t.libraries.push(...r.slice(14).split(i.delimiter));else if(r.startsWith(`-Djava.io.tmpdir=`))t.temporaryDirectory=r.slice(17);else if(r.startsWith(`-Dtla-ts.tlc=`))t.tlcVersion=r.slice(13)===`1.7.4`?`1.7.4`:`master`;else if(!r.startsWith(`-D`)&&!r.startsWith(`-X`))return n>0||Va.includes(r)?{mainClass:r,args:e.slice(n+1),java:t}:void 0}},Ua=async e=>{if(e[0]===`tlapm`)return v(()=>De(e.slice(1)));let t=Ha(e);return t===void 0?ua(e,{libraries:[]}):(t.java.tlcVersion??=await u(S(t.java)),t.mainClass===`tlc2.TLC`?ua(t.args,t.java):t.mainClass===`tla2sany.xml.XMLExporter`?v(()=>t.java.tlcVersion===`1.7.4`?Ba(t.args,S(t.java)):Ra(t.args)):(console.error(`Error: tla-ts runs the Java classes ${Va.join(` and `)}, not ${t.mainClass}.`),1))},Wa=async()=>{process.exitCode=await Ua(process.argv.slice(2))};exports.runCli=Wa;
|