tla-ts 0.0.8 → 0.0.9-dev.4ce0657

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.
Files changed (63) hide show
  1. package/README.md +23 -0
  2. package/dist/compile.cjs +23 -0
  3. package/dist/compile.js +23 -0
  4. package/dist/deciders.cjs +15 -15
  5. package/dist/deciders.js +48 -48
  6. package/dist/index.cjs +1 -1
  7. package/dist/index.d.cts +27 -9
  8. package/dist/index.d.ts +27 -9
  9. package/dist/index.js +1 -1
  10. package/dist/parallel-worker.cjs +1 -1
  11. package/dist/parallel-worker.js +1 -1
  12. package/dist/prove.cjs +17 -17
  13. package/dist/prove.js +32 -32
  14. package/dist/run.cjs +28 -28
  15. package/dist/run.js +31 -31
  16. package/dist/tlapm.cjs +2 -2
  17. package/dist/tlapm.js +1 -1
  18. package/dist/transfer.cjs +30 -33
  19. package/dist/transfer.js +30 -33
  20. package/dist/worker.cjs +4 -4
  21. package/dist/worker.js +4 -4
  22. package/package.json +3 -1
  23. package/src/check.ts +77 -46
  24. package/src/cli/options.ts +2 -1
  25. package/src/cli/tlc.ts +26 -8
  26. package/src/cli/typescript.ts +26 -0
  27. package/src/codegen.ts +0 -5
  28. package/src/dependencies.ts +348 -24
  29. package/src/environment.ts +27 -11
  30. package/src/errors.ts +15 -0
  31. package/src/evaluate.ts +188 -712
  32. package/src/instances.ts +67 -6
  33. package/src/lexer.ts +140 -51
  34. package/src/liveness-checker.ts +6 -3
  35. package/src/liveness.ts +8 -18
  36. package/src/parallel-worker.ts +6 -3
  37. package/src/parallel.ts +15 -7
  38. package/src/prover/smt/solver/solver.ts +31 -27
  39. package/src/sany/generator.ts +9 -7
  40. package/src/sany/linter.ts +30 -21
  41. package/src/search.ts +48 -32
  42. package/src/spec-description.ts +1 -1
  43. package/src/successors.ts +6 -12
  44. package/src/symmetry.ts +32 -143
  45. package/src/tlc/fingerprint.ts +69 -116
  46. package/src/tlc/order.ts +27 -48
  47. package/src/tlc/replay.ts +1 -1
  48. package/src/typescript/actions.ts +494 -0
  49. package/src/typescript/collections.ts +615 -0
  50. package/src/typescript/compile.ts +70 -0
  51. package/src/typescript/context.ts +106 -0
  52. package/src/typescript/emit.ts +122 -0
  53. package/src/typescript/expressions.ts +508 -0
  54. package/src/typescript/formula.ts +160 -0
  55. package/src/typescript/functions.ts +295 -0
  56. package/src/typescript/model.ts +164 -0
  57. package/src/typescript/names.ts +116 -0
  58. package/src/typescript/program.ts +51 -0
  59. package/src/typescript/properties.ts +141 -0
  60. package/src/typescript/scope.ts +117 -0
  61. package/src/typescript/steps.ts +175 -0
  62. package/src/typescript/types.ts +178 -0
  63. package/src/values.ts +126 -82
package/dist/index.cjs CHANGED
@@ -6,4 +6,4 @@
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
- Object.defineProperty(exports,Symbol.toStringTag,{value:`Module`});const e=require("./worker.cjs"),t=require("./transfer.cjs"),n=require("./prove.cjs");exports.TlaConfigError=e.h,exports.TlaError=e.g,exports.TlaEvaluationError=e._,exports.TlaSyntaxError=e.O,exports.TlaUnsupportedError=e.A,exports.check=n.m,exports.formatValue=t.jt,exports.parseConfig=n.h,exports.parseModule=t.V,exports.prove=n.r;
9
+ Object.defineProperty(exports,Symbol.toStringTag,{value:`Module`});const e=require("./worker.cjs"),t=require("./transfer.cjs"),n=require("./prove.cjs");exports.TlaConfigError=e.h,exports.TlaError=e.g,exports.TlaEvaluationError=e._,exports.TlaSyntaxError=e.O,exports.TlaUnsupportedError=e.j,exports.check=n.m,exports.formatValue=t.jt,exports.parseConfig=n.h,exports.parseModule=t.V,exports.prove=n.r;
package/dist/index.d.cts CHANGED
@@ -6,6 +6,7 @@
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
+ import "@typescript/typescript6";
9
10
  interface LocalResolution {
10
11
  kind: "Local";
11
12
  }
@@ -559,6 +560,13 @@ interface ModelValue {
559
560
  name: string;
560
561
  type: string | undefined;
561
562
  rank: number;
563
+ hash: number;
564
+ fingerprint: number;
565
+ }
566
+ interface LazySet {
567
+ enumerated?: SetValue;
568
+ isCached?: boolean;
569
+ isFingerprinted?: boolean;
562
570
  }
563
571
  interface SetValue {
564
572
  kind: "Set";
@@ -567,7 +575,7 @@ interface SetValue {
567
575
  fingerprint: number;
568
576
  isFingerprinted: boolean;
569
577
  }
570
- interface MixedSetValue {
578
+ interface MixedSetValue extends LazySet {
571
579
  kind: "MixedSet";
572
580
  elements: Value[];
573
581
  }
@@ -590,29 +598,29 @@ interface InfiniteSetValue {
590
598
  kind: "InfiniteSet";
591
599
  name: "Nat" | "Int" | "STRING" | "Any";
592
600
  }
593
- interface SubsetValue {
601
+ interface SubsetValue extends LazySet {
594
602
  kind: "Subset";
595
603
  base: Value;
596
604
  }
597
- interface FunctionSetValue {
605
+ interface FunctionSetValue extends LazySet {
598
606
  kind: "FunctionSet";
599
607
  domain: Value;
600
608
  range: Value;
601
609
  }
602
- interface RecordSetValue {
610
+ interface RecordSetValue extends LazySet {
603
611
  kind: "RecordSet";
604
612
  names: string[];
605
613
  sets: Value[];
606
614
  }
607
- interface ProductSetValue {
615
+ interface ProductSetValue extends LazySet {
608
616
  kind: "ProductSet";
609
617
  factors: Value[];
610
618
  }
611
- interface SequenceSetValue {
619
+ interface SequenceSetValue extends LazySet {
612
620
  kind: "SequenceSet";
613
621
  base: Value;
614
622
  }
615
- interface SetOperationValue {
623
+ interface SetOperationValue extends LazySet {
616
624
  kind: "SetOperation";
617
625
  operator: "\\cup" | "\\cap" | "\\";
618
626
  left: Value;
@@ -622,13 +630,13 @@ interface FilteredSetSource {
622
630
  names: string;
623
631
  predicate: string;
624
632
  }
625
- interface FilteredSetValue {
633
+ interface FilteredSetValue extends LazySet {
626
634
  kind: "FilteredSet";
627
635
  base: Value;
628
636
  test: (element: Value) => boolean;
629
637
  source?: FilteredSetSource;
630
638
  }
631
- interface UnionValue {
639
+ interface UnionValue extends LazySet {
632
640
  kind: "Union";
633
641
  base: Value;
634
642
  }
@@ -646,6 +654,8 @@ interface LazyFunctionValue {
646
654
  apply: (argument: Value) => Value;
647
655
  source?: LazyFunctionSource;
648
656
  functionClass?: FunctionClass;
657
+ enumerated?: FunctionValue;
658
+ isFingerprinted?: boolean;
649
659
  }
650
660
  type Value = boolean | number | string | ModelValue | SetValue | MixedSetValue | FunctionValue | IntervalValue | InfiniteSetValue | SubsetValue | FunctionSetValue | RecordSetValue | ProductSetValue | SequenceSetValue | SetOperationValue | FilteredSetValue | UnionValue | LazyFunctionValue;
651
661
  type FunctionClass = "lambda" | "tuple" | "record";
@@ -686,6 +696,7 @@ interface CheckOptions {
686
696
  livenessCheck?: "default" | "final";
687
697
  dump?: StateDump;
688
698
  isTool?: boolean;
699
+ isContinued?: boolean;
689
700
  isTraceRecorded?: boolean;
690
701
  isSanyReported?: boolean;
691
702
  isWarningEnabled?: boolean;
@@ -734,10 +745,17 @@ type CheckProgress = {
734
745
  statistics: SearchStatistics;
735
746
  } | {
736
747
  kind: "liveness-finished";
748
+ } | {
749
+ kind: "sequential-fallback";
750
+ string: string;
737
751
  } | {
738
752
  kind: "warning";
739
753
  code: number;
740
754
  text: string;
755
+ } | {
756
+ kind: "violation";
757
+ status: CheckStatus;
758
+ violation: Violation;
741
759
  } | ({
742
760
  kind: "java-override";
743
761
  } & JavaOverride);
package/dist/index.d.ts CHANGED
@@ -6,6 +6,7 @@
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
+ import ts from "@typescript/typescript6";
9
10
  interface LocalResolution {
10
11
  kind: "Local";
11
12
  }
@@ -559,6 +560,13 @@ interface ModelValue {
559
560
  name: string;
560
561
  type: string | undefined;
561
562
  rank: number;
563
+ hash: number;
564
+ fingerprint: number;
565
+ }
566
+ interface LazySet {
567
+ enumerated?: SetValue;
568
+ isCached?: boolean;
569
+ isFingerprinted?: boolean;
562
570
  }
563
571
  interface SetValue {
564
572
  kind: "Set";
@@ -567,7 +575,7 @@ interface SetValue {
567
575
  fingerprint: number;
568
576
  isFingerprinted: boolean;
569
577
  }
570
- interface MixedSetValue {
578
+ interface MixedSetValue extends LazySet {
571
579
  kind: "MixedSet";
572
580
  elements: Value[];
573
581
  }
@@ -590,29 +598,29 @@ interface InfiniteSetValue {
590
598
  kind: "InfiniteSet";
591
599
  name: "Nat" | "Int" | "STRING" | "Any";
592
600
  }
593
- interface SubsetValue {
601
+ interface SubsetValue extends LazySet {
594
602
  kind: "Subset";
595
603
  base: Value;
596
604
  }
597
- interface FunctionSetValue {
605
+ interface FunctionSetValue extends LazySet {
598
606
  kind: "FunctionSet";
599
607
  domain: Value;
600
608
  range: Value;
601
609
  }
602
- interface RecordSetValue {
610
+ interface RecordSetValue extends LazySet {
603
611
  kind: "RecordSet";
604
612
  names: string[];
605
613
  sets: Value[];
606
614
  }
607
- interface ProductSetValue {
615
+ interface ProductSetValue extends LazySet {
608
616
  kind: "ProductSet";
609
617
  factors: Value[];
610
618
  }
611
- interface SequenceSetValue {
619
+ interface SequenceSetValue extends LazySet {
612
620
  kind: "SequenceSet";
613
621
  base: Value;
614
622
  }
615
- interface SetOperationValue {
623
+ interface SetOperationValue extends LazySet {
616
624
  kind: "SetOperation";
617
625
  operator: "\\cup" | "\\cap" | "\\";
618
626
  left: Value;
@@ -622,13 +630,13 @@ interface FilteredSetSource {
622
630
  names: string;
623
631
  predicate: string;
624
632
  }
625
- interface FilteredSetValue {
633
+ interface FilteredSetValue extends LazySet {
626
634
  kind: "FilteredSet";
627
635
  base: Value;
628
636
  test: (element: Value) => boolean;
629
637
  source?: FilteredSetSource;
630
638
  }
631
- interface UnionValue {
639
+ interface UnionValue extends LazySet {
632
640
  kind: "Union";
633
641
  base: Value;
634
642
  }
@@ -646,6 +654,8 @@ interface LazyFunctionValue {
646
654
  apply: (argument: Value) => Value;
647
655
  source?: LazyFunctionSource;
648
656
  functionClass?: FunctionClass;
657
+ enumerated?: FunctionValue;
658
+ isFingerprinted?: boolean;
649
659
  }
650
660
  type Value = boolean | number | string | ModelValue | SetValue | MixedSetValue | FunctionValue | IntervalValue | InfiniteSetValue | SubsetValue | FunctionSetValue | RecordSetValue | ProductSetValue | SequenceSetValue | SetOperationValue | FilteredSetValue | UnionValue | LazyFunctionValue;
651
661
  type FunctionClass = "lambda" | "tuple" | "record";
@@ -686,6 +696,7 @@ interface CheckOptions {
686
696
  livenessCheck?: "default" | "final";
687
697
  dump?: StateDump;
688
698
  isTool?: boolean;
699
+ isContinued?: boolean;
689
700
  isTraceRecorded?: boolean;
690
701
  isSanyReported?: boolean;
691
702
  isWarningEnabled?: boolean;
@@ -734,10 +745,17 @@ type CheckProgress = {
734
745
  statistics: SearchStatistics;
735
746
  } | {
736
747
  kind: "liveness-finished";
748
+ } | {
749
+ kind: "sequential-fallback";
750
+ string: string;
737
751
  } | {
738
752
  kind: "warning";
739
753
  code: number;
740
754
  text: string;
755
+ } | {
756
+ kind: "violation";
757
+ status: CheckStatus;
758
+ violation: Violation;
741
759
  } | ({
742
760
  kind: "java-override";
743
761
  } & JavaOverride);
package/dist/index.js CHANGED
@@ -6,4 +6,4 @@
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
- import{A as e,O as t,_ as n,g as r,h as i}from"./worker.js";import{V as a,jt as o}from"./transfer.js";import{h as s,m as c,r as l}from"./prove.js";export{i as TlaConfigError,r as TlaError,n as TlaEvaluationError,t as TlaSyntaxError,e as TlaUnsupportedError,c as check,o as formatValue,s as parseConfig,a as parseModule,l as prove};
9
+ import{O as e,_ as t,g as n,h as r,j as i}from"./worker.js";import{V as a,jt as o}from"./transfer.js";import{h as s,m as c,r as l}from"./prove.js";export{r as TlaConfigError,n as TlaError,t as TlaEvaluationError,e as TlaSyntaxError,i as TlaUnsupportedError,c as check,o as formatValue,s as parseConfig,a as parseModule,l as prove};
@@ -6,4 +6,4 @@
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("./worker.cjs"),t=require("./transfer.cjs"),n=(n,r)=>{let i=new Map(n.modules),a=e=>i.get(e),o=new Map(n.classes),s=t.N(n.source,a);t.zt(s.getStringOrder(n.config)),t.Bt(n.version);let c=t.Pt(),l=t.M(n.config,{source:n.source,loadModule:a,order:s,loadClass:e=>o.get(e),print:()=>{},files:{readFile:void 0,writeFile:void 0},isTool:n.isTool,isTraceRecorded:n.isTraceRecorded,isWarningEnabled:n.isWarningEnabled,version:n.version}).environment,u=t.h(n.config,l,()=>s.getDeclarationOrder(`variable`)),d=u?.spec.next;if(!u||d===void 0)return r.postMessage({type:`abort`});let f=n.index,p=t.Tt(),m=t.t(l.variables.length),h={fingerprints:n.fingerprints},g=n.requests,_=n.remaining,v=u.isSymmetric?t.r():void 0,y=/* @__PURE__ */ new Int32Array(2),b={resume:()=>{},loot:e=>{}};n.ports.forEach(e=>{e?.addEventListener(`message`,e=>b.loot(e.data)),e?.start?.()});let x={states:m(n.seed).map(p)},S=e.t(),C=(e,r)=>{let i=Atomics.load(g,f)-1,a=Math.floor((e.end-e.origin-1)/2),o=t.n(),s=e.states.slice(e.end-a,e.end),c=a>0&&s.every(o.encode);c&&(e.end-=a);let l=c?o.finish():t.n().finish();n.ports[i]?.postMessage(l,[l.words.buffer]),Atomics.store(g,f,r),Atomics.notify(g,f)},w=e=>{Atomics.store(_,f,0),Atomics.compareExchange(g,f,0,-1)!==0&&C(e,-1)},T=e=>{Atomics.store(_,f,e.end-e.origin),Atomics.store(g,f,0)},E=e=>{for(;e.origin<e.end;e.origin++){let r=e.states[e.origin];if(!e.successors){if(performance.now()>=e.breakAt)return`break`;if(Atomics.load(g,f)>0&&C(e,0),Atomics.store(_,f,e.end-e.origin-1),e.successors=t.ct(d,r,l,u.spec.scope),e.generated+=e.successors.length,e.successors.length===0&&n.config.checkDeadlock)return}let i=e.successors;for(;e.index<i.length;e.index++){if(t.s(h.fingerprints))return`paused`;let n=i[e.index];if(u.findViolatedActionProperty(r,n.state))return;if(!u.satisfiesActionConstraints(r,n.state)){if(u.findViolatedInvariant(n.state,r))return;continue}if(v&&(t.c(n.state,y),!v.insert(y[0],y[1])))continue;p(n.state);let a=u.getFingerprintState(n.state);if(t.c(a,y),t.o(h.fingerprints,y[0],y[1])){if(u.findViolatedInvariant(n.state,r))return;u.satisfiesConstraints(n.state,r)&&(e.next.push(n.state),e.fingerprintStates.push(a),e.added++)}}e.outDegrees[Math.min(e.added,31)]++,e.successors=void 0,e.index=0,e.added=0}return`done`},D=async e=>{let t=/* @__PURE__ */ new Set;for(;;){let r=n.ports.reduce((e,n,r)=>!n||t.has(r)||Atomics.load(_,r)<2?e:e===void 0||Atomics.load(_,r)>Atomics.load(_,e)?r:e,void 0);if(r===void 0)return!1;let i=Atomics.compareExchange(g,r,0,f+1);if(i===-1&&t.add(r),i>0&&Atomics.wait(g,r,i),i!==0)continue;let a=await new Promise(e=>b.loot=e);if(a.count===0)t.add(r);else return e.states=m(a).map(p),e.origin=0,e.end=e.states.length,T(e),!0}},O=e=>r.postMessage(e,e.type===`level`?[e.fingerprints.buffer]:[]),k=async()=>{let e={states:x.states,origin:0,end:x.states.length,successors:void 0,index:0,added:0,generated:0,outDegrees:Array.from({length:32},()=>0),next:[],fingerprintStates:[],breakAt:performance.now()+100};for(;;){let t=E(e);if(t===void 0)return;if(t===`break`)await S(),e.breakAt=performance.now()+100;else if(w(e),t===`paused`){let t=new Promise(e=>b.resume=e);O({type:`paused`}),await t,T(e)}else if(!await D(e))break}if(t.Pt()===c)return x.states=e.next,Atomics.store(_,f,x.states.length),{type:`level`,generated:e.generated,added:e.next.length,outDegrees:e.outDegrees,fingerprints:u.getStoredFingerprints(e.next,e.fingerprintStates)}},A=()=>{k().then(e=>O(e??{type:`abort`}),()=>O({type:`abort`}))};r.addEventListener(`message`,e=>{let t=e.data;t.type===`level`&&A(),t.type===`resize`&&(h.fingerprints=t.fingerprints,b.resume())}),Atomics.store(_,f,x.states.length),O({type:`ready`})};e.n().then(e=>{let t=r=>{let i=r.data;if(i.type===`start`){e.removeEventListener?.(`message`,t);try{n(i,e)}catch{e.postMessage({type:`abort`})}}};e.addEventListener(`message`,t),e.start?.()});
9
+ const e=require("./worker.cjs"),t=require("./transfer.cjs"),n=(n,r)=>{let i=new Map(n.modules),a=e=>i.get(e),o=new Map(n.classes),s=t.N(n.source,a);t.Bt(s.getStringOrder(n.config)),t.Vt(n.version);let c=t.Ft(),l=t.M(n.config,{source:n.source,loadModule:a,order:s,loadClass:e=>o.get(e),print:()=>{},files:{readFile:void 0,writeFile:void 0},isTool:n.isTool,isTraceRecorded:n.isTraceRecorded,isWarningEnabled:n.isWarningEnabled,version:n.version}).environment,u=t.h(n.config,l,()=>s.getDeclarationOrder(`variable`)),d=u?.spec.next;if(!u||d===void 0)return r.postMessage({type:`abort`});let f=n.index,p=t.Tt(),m=t.t(l.variables.length),h={fingerprints:n.fingerprints},g=n.requests,_=n.remaining,v=u.isSymmetric?t.r():void 0,y=/* @__PURE__ */ new Int32Array(2),b={resume:()=>{},loot:e=>{}};n.ports.forEach(e=>{e?.addEventListener(`message`,e=>b.loot(e.data)),e?.start?.()});let x={states:m(n.seed).map(p)},S=e.t(),C=(e,r)=>{let i=Atomics.load(g,f)-1,a=Math.floor((e.end-e.origin-1)/2),o=t.n(),s=e.states.slice(e.end-a,e.end),c=a>0&&s.every(o.encode);c&&(e.end-=a);let l=c?o.finish():t.n().finish();n.ports[i]?.postMessage(l,[l.words.buffer]),Atomics.store(g,f,r),Atomics.notify(g,f)},w=e=>{Atomics.store(_,f,0),Atomics.compareExchange(g,f,0,-1)!==0&&C(e,-1)},T=e=>{Atomics.store(_,f,e.end-e.origin),Atomics.store(g,f,0)},E=e=>{for(;e.origin<e.end;e.origin++){let r=e.states[e.origin];if(!e.successors){if(performance.now()>=e.breakAt)return`break`;if(Atomics.load(g,f)>0&&C(e,0),Atomics.store(_,f,e.end-e.origin-1),e.successors=t.st(d,r,l,u.spec.scope),e.generated+=e.successors.length,e.successors.length===0&&n.config.checkDeadlock)return}let i=e.successors;for(;e.index<i.length;e.index++){if(t.s(h.fingerprints))return`paused`;let n=i[e.index];if(u.findViolatedActionProperty(r,n.state))return;if(!u.satisfiesActionConstraints(r,n.state)){if(u.findViolatedInvariant(n.state,r))return;continue}if(v&&(t.c(n.state,y),!v.insert(y[0],y[1])))continue;p(n.state);let a=u.getFingerprintState(n.state);if(t.c(a,y),t.o(h.fingerprints,y[0],y[1])){if(u.findViolatedInvariant(n.state,r))return;u.satisfiesConstraints(n.state,r)&&(e.next.push(n.state),e.fingerprintStates.push(a),e.added++)}}e.outDegrees[Math.min(e.added,31)]++,e.successors=void 0,e.index=0,e.added=0}return`done`},D=async e=>{let t=/* @__PURE__ */ new Set;for(;;){let r=n.ports.reduce((e,n,r)=>!n||t.has(r)||Atomics.load(_,r)<2?e:e===void 0||Atomics.load(_,r)>Atomics.load(_,e)?r:e,void 0);if(r===void 0)return!1;let i=Atomics.compareExchange(g,r,0,f+1);if(i===-1&&t.add(r),i>0&&Atomics.wait(g,r,i),i!==0)continue;let a=await new Promise(e=>b.loot=e);if(a.count===0)t.add(r);else return e.states=m(a).map(p),e.origin=0,e.end=e.states.length,T(e),!0}},O=e=>r.postMessage(e,e.type===`level`?[e.fingerprints.buffer]:[]),k=async()=>{let e={states:x.states,origin:0,end:x.states.length,successors:void 0,index:0,added:0,generated:0,outDegrees:Array.from({length:32},()=>0),next:[],fingerprintStates:[],breakAt:performance.now()+100};for(;;){let t=E(e);if(t===void 0)return;if(t===`break`)await S(),e.breakAt=performance.now()+100;else if(w(e),t===`paused`){let t=new Promise(e=>b.resume=e);O({type:`paused`}),await t,T(e)}else if(!await D(e))break}return t.Ft()===c?(x.states=e.next,Atomics.store(_,f,x.states.length),{type:`level`,generated:e.generated,added:e.next.length,outDegrees:e.outDegrees,fingerprints:u.getStoredFingerprints(e.next,e.fingerprintStates)}):{type:`abort`,string:t.Pt(c)}},A=()=>{k().then(e=>O(e??{type:`abort`}),()=>O({type:`abort`}))};r.addEventListener(`message`,e=>{let t=e.data;t.type===`level`&&A(),t.type===`resize`&&(h.fingerprints=t.fingerprints,b.resume())}),Atomics.store(_,f,x.states.length),O({type:`ready`})};e.n().then(e=>{let t=r=>{let i=r.data;if(i.type===`start`){e.removeEventListener?.(`message`,t);try{n(i,e)}catch{e.postMessage({type:`abort`})}}};e.addEventListener(`message`,t),e.start?.()});
@@ -6,4 +6,4 @@
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
- import{n as e,t}from"./worker.js";import{Bt as n,M as r,N as i,Pt as a,Tt as o,c as s,ct as c,h as l,n as u,o as d,r as f,s as p,t as m,zt as h}from"./transfer.js";const g=(e,g)=>{let _=new Map(e.modules),v=e=>_.get(e),y=new Map(e.classes),b=i(e.source,v);h(b.getStringOrder(e.config)),n(e.version);let x=a(),S=r(e.config,{source:e.source,loadModule:v,order:b,loadClass:e=>y.get(e),print:()=>{},files:{readFile:void 0,writeFile:void 0},isTool:e.isTool,isTraceRecorded:e.isTraceRecorded,isWarningEnabled:e.isWarningEnabled,version:e.version}).environment,C=l(e.config,S,()=>b.getDeclarationOrder(`variable`)),w=C?.spec.next;if(!C||w===void 0)return g.postMessage({type:`abort`});let T=e.index,E=o(),D=m(S.variables.length),O={fingerprints:e.fingerprints},k=e.requests,A=e.remaining,j=C.isSymmetric?f():void 0,M=/* @__PURE__ */ new Int32Array(2),N={resume:()=>{},loot:e=>{}};e.ports.forEach(e=>{e?.addEventListener(`message`,e=>N.loot(e.data)),e?.start?.()});let P={states:D(e.seed).map(E)},F=t(),I=(t,n)=>{let r=Atomics.load(k,T)-1,i=Math.floor((t.end-t.origin-1)/2),a=u(),o=t.states.slice(t.end-i,t.end),s=i>0&&o.every(a.encode);s&&(t.end-=i);let c=s?a.finish():u().finish();e.ports[r]?.postMessage(c,[c.words.buffer]),Atomics.store(k,T,n),Atomics.notify(k,T)},L=e=>{Atomics.store(A,T,0),Atomics.compareExchange(k,T,0,-1)!==0&&I(e,-1)},R=e=>{Atomics.store(A,T,e.end-e.origin),Atomics.store(k,T,0)},z=t=>{for(;t.origin<t.end;t.origin++){let n=t.states[t.origin];if(!t.successors){if(performance.now()>=t.breakAt)return`break`;if(Atomics.load(k,T)>0&&I(t,0),Atomics.store(A,T,t.end-t.origin-1),t.successors=c(w,n,S,C.spec.scope),t.generated+=t.successors.length,t.successors.length===0&&e.config.checkDeadlock)return}let r=t.successors;for(;t.index<r.length;t.index++){if(p(O.fingerprints))return`paused`;let e=r[t.index];if(C.findViolatedActionProperty(n,e.state))return;if(!C.satisfiesActionConstraints(n,e.state)){if(C.findViolatedInvariant(e.state,n))return;continue}if(j&&(s(e.state,M),!j.insert(M[0],M[1])))continue;E(e.state);let i=C.getFingerprintState(e.state);if(s(i,M),d(O.fingerprints,M[0],M[1])){if(C.findViolatedInvariant(e.state,n))return;C.satisfiesConstraints(e.state,n)&&(t.next.push(e.state),t.fingerprintStates.push(i),t.added++)}}t.outDegrees[Math.min(t.added,31)]++,t.successors=void 0,t.index=0,t.added=0}return`done`},B=async t=>{let n=/* @__PURE__ */ new Set;for(;;){let r=e.ports.reduce((e,t,r)=>!t||n.has(r)||Atomics.load(A,r)<2?e:e===void 0||Atomics.load(A,r)>Atomics.load(A,e)?r:e,void 0);if(r===void 0)return!1;let i=Atomics.compareExchange(k,r,0,T+1);if(i===-1&&n.add(r),i>0&&Atomics.wait(k,r,i),i!==0)continue;let a=await new Promise(e=>N.loot=e);if(a.count===0)n.add(r);else return t.states=D(a).map(E),t.origin=0,t.end=t.states.length,R(t),!0}},V=e=>g.postMessage(e,e.type===`level`?[e.fingerprints.buffer]:[]),H=async()=>{let e={states:P.states,origin:0,end:P.states.length,successors:void 0,index:0,added:0,generated:0,outDegrees:Array.from({length:32},()=>0),next:[],fingerprintStates:[],breakAt:performance.now()+100};for(;;){let t=z(e);if(t===void 0)return;if(t===`break`)await F(),e.breakAt=performance.now()+100;else if(L(e),t===`paused`){let t=new Promise(e=>N.resume=e);V({type:`paused`}),await t,R(e)}else if(!await B(e))break}if(a()===x)return P.states=e.next,Atomics.store(A,T,P.states.length),{type:`level`,generated:e.generated,added:e.next.length,outDegrees:e.outDegrees,fingerprints:C.getStoredFingerprints(e.next,e.fingerprintStates)}},U=()=>{H().then(e=>V(e??{type:`abort`}),()=>V({type:`abort`}))};g.addEventListener(`message`,e=>{let t=e.data;t.type===`level`&&U(),t.type===`resize`&&(O.fingerprints=t.fingerprints,N.resume())}),Atomics.store(A,T,P.states.length),V({type:`ready`})};e().then(e=>{let t=n=>{let r=n.data;if(r.type===`start`){e.removeEventListener?.(`message`,t);try{g(r,e)}catch{e.postMessage({type:`abort`})}}};e.addEventListener(`message`,t),e.start?.()});
9
+ import{n as e,t}from"./worker.js";import{Bt as n,Ft as r,M as i,N as a,Pt as o,Tt as s,Vt as c,c as l,h as u,n as d,o as f,r as p,s as m,st as h,t as g}from"./transfer.js";const _=(e,_)=>{let v=new Map(e.modules),y=e=>v.get(e),b=new Map(e.classes),x=a(e.source,y);n(x.getStringOrder(e.config)),c(e.version);let S=r(),C=i(e.config,{source:e.source,loadModule:y,order:x,loadClass:e=>b.get(e),print:()=>{},files:{readFile:void 0,writeFile:void 0},isTool:e.isTool,isTraceRecorded:e.isTraceRecorded,isWarningEnabled:e.isWarningEnabled,version:e.version}).environment,w=u(e.config,C,()=>x.getDeclarationOrder(`variable`)),T=w?.spec.next;if(!w||T===void 0)return _.postMessage({type:`abort`});let E=e.index,D=s(),O=g(C.variables.length),k={fingerprints:e.fingerprints},A=e.requests,j=e.remaining,M=w.isSymmetric?p():void 0,N=/* @__PURE__ */ new Int32Array(2),P={resume:()=>{},loot:e=>{}};e.ports.forEach(e=>{e?.addEventListener(`message`,e=>P.loot(e.data)),e?.start?.()});let F={states:O(e.seed).map(D)},I=t(),L=(t,n)=>{let r=Atomics.load(A,E)-1,i=Math.floor((t.end-t.origin-1)/2),a=d(),o=t.states.slice(t.end-i,t.end),s=i>0&&o.every(a.encode);s&&(t.end-=i);let c=s?a.finish():d().finish();e.ports[r]?.postMessage(c,[c.words.buffer]),Atomics.store(A,E,n),Atomics.notify(A,E)},R=e=>{Atomics.store(j,E,0),Atomics.compareExchange(A,E,0,-1)!==0&&L(e,-1)},z=e=>{Atomics.store(j,E,e.end-e.origin),Atomics.store(A,E,0)},B=t=>{for(;t.origin<t.end;t.origin++){let n=t.states[t.origin];if(!t.successors){if(performance.now()>=t.breakAt)return`break`;if(Atomics.load(A,E)>0&&L(t,0),Atomics.store(j,E,t.end-t.origin-1),t.successors=h(T,n,C,w.spec.scope),t.generated+=t.successors.length,t.successors.length===0&&e.config.checkDeadlock)return}let r=t.successors;for(;t.index<r.length;t.index++){if(m(k.fingerprints))return`paused`;let e=r[t.index];if(w.findViolatedActionProperty(n,e.state))return;if(!w.satisfiesActionConstraints(n,e.state)){if(w.findViolatedInvariant(e.state,n))return;continue}if(M&&(l(e.state,N),!M.insert(N[0],N[1])))continue;D(e.state);let i=w.getFingerprintState(e.state);if(l(i,N),f(k.fingerprints,N[0],N[1])){if(w.findViolatedInvariant(e.state,n))return;w.satisfiesConstraints(e.state,n)&&(t.next.push(e.state),t.fingerprintStates.push(i),t.added++)}}t.outDegrees[Math.min(t.added,31)]++,t.successors=void 0,t.index=0,t.added=0}return`done`},V=async t=>{let n=/* @__PURE__ */ new Set;for(;;){let r=e.ports.reduce((e,t,r)=>!t||n.has(r)||Atomics.load(j,r)<2?e:e===void 0||Atomics.load(j,r)>Atomics.load(j,e)?r:e,void 0);if(r===void 0)return!1;let i=Atomics.compareExchange(A,r,0,E+1);if(i===-1&&n.add(r),i>0&&Atomics.wait(A,r,i),i!==0)continue;let a=await new Promise(e=>P.loot=e);if(a.count===0)n.add(r);else return t.states=O(a).map(D),t.origin=0,t.end=t.states.length,z(t),!0}},H=e=>_.postMessage(e,e.type===`level`?[e.fingerprints.buffer]:[]),U=async()=>{let e={states:F.states,origin:0,end:F.states.length,successors:void 0,index:0,added:0,generated:0,outDegrees:Array.from({length:32},()=>0),next:[],fingerprintStates:[],breakAt:performance.now()+100};for(;;){let t=B(e);if(t===void 0)return;if(t===`break`)await I(),e.breakAt=performance.now()+100;else if(R(e),t===`paused`){let t=new Promise(e=>P.resume=e);H({type:`paused`}),await t,z(e)}else if(!await V(e))break}return r()===S?(F.states=e.next,Atomics.store(j,E,F.states.length),{type:`level`,generated:e.generated,added:e.next.length,outDegrees:e.outDegrees,fingerprints:w.getStoredFingerprints(e.next,e.fingerprintStates)}):{type:`abort`,string:o(S)}},W=()=>{U().then(e=>H(e??{type:`abort`}),()=>H({type:`abort`}))};_.addEventListener(`message`,e=>{let t=e.data;t.type===`level`&&W(),t.type===`resize`&&(k.fingerprints=t.fingerprints,P.resume())}),Atomics.store(j,E,F.states.length),H({type:`ready`})};e().then(e=>{let t=n=>{let r=n.data;if(r.type===`start`){e.removeEventListener?.(`message`,t);try{_(r,e)}catch{e.postMessage({type:`abort`})}}};e.addEventListener(`message`,t),e.start?.()});