tla-ts 0.0.2 → 0.0.3-dev.14337b3

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 (65) hide show
  1. package/README.md +78 -12
  2. package/dist/index.cjs +1 -1
  3. package/dist/index.d.cts +85 -15
  4. package/dist/index.d.ts +85 -15
  5. package/dist/index.js +1 -1
  6. package/dist/parallel-worker.cjs +2 -2
  7. package/dist/parallel-worker.js +2 -2
  8. package/dist/parallel.cjs +1 -1
  9. package/dist/parallel.js +2 -2
  10. package/dist/run-cli.cjs +22 -2
  11. package/dist/run-cli.js +22 -2
  12. package/dist/transfer.cjs +37 -16
  13. package/dist/transfer.js +37 -16
  14. package/package.json +3 -1
  15. package/src/ast.ts +137 -4
  16. package/src/check.ts +378 -100
  17. package/src/cli-options.ts +64 -0
  18. package/src/codegen.ts +15 -22
  19. package/src/config.ts +224 -170
  20. package/src/dependencies.ts +2 -2
  21. package/src/environment.ts +116 -28
  22. package/src/errors.ts +101 -3
  23. package/src/evaluate.ts +129 -153
  24. package/src/exit-codes.ts +39 -42
  25. package/src/fingerprints.ts +46 -11
  26. package/src/instances.ts +16 -15
  27. package/src/levels.ts +62 -34
  28. package/src/lexer.ts +11 -2
  29. package/src/live-check.ts +772 -0
  30. package/src/liveness.ts +116 -543
  31. package/src/obligation-action.ts +384 -0
  32. package/src/obligation-anon.ts +575 -0
  33. package/src/obligation-deref.ts +637 -0
  34. package/src/obligation-expression.ts +1060 -0
  35. package/src/obligation-format.ts +406 -0
  36. package/src/obligation-generate.ts +1074 -0
  37. package/src/obligation-levels.ts +329 -0
  38. package/src/obligation-module.ts +1042 -0
  39. package/src/obligation-printer.ts +889 -0
  40. package/src/obligation-proof.ts +76 -0
  41. package/src/obligation-source.ts +1084 -0
  42. package/src/obligation-tuples.ts +184 -0
  43. package/src/obligations.ts +316 -0
  44. package/src/parallel-worker.ts +168 -212
  45. package/src/parallel.ts +78 -37
  46. package/src/parser.ts +315 -60
  47. package/src/resolve.ts +122 -44
  48. package/src/run-cli.ts +376 -44
  49. package/src/runtime.ts +3 -1
  50. package/src/spec-description.ts +19 -8
  51. package/src/standard-levels.ts +3 -3
  52. package/src/standard-modules.ts +2 -7
  53. package/src/state-graph.ts +157 -0
  54. package/src/subexpressions.ts +10 -10
  55. package/src/successors.ts +99 -25
  56. package/src/symmetry.ts +30 -8
  57. package/src/tableau.ts +51 -24
  58. package/src/tlc-ext.ts +29 -12
  59. package/src/tlc-module.ts +14 -33
  60. package/src/tlc-modules.ts +4 -0
  61. package/src/tlc-order.ts +25 -7
  62. package/src/tlc-random.ts +9 -6
  63. package/src/tlc-summary.ts +20 -5
  64. package/src/transfer.ts +22 -1
  65. package/src/values.ts +179 -42
package/README.md CHANGED
@@ -3,9 +3,9 @@
3
3
  [![version](https://img.shields.io/npm/v/tla-ts?style=flat&colorA=000000&colorB=000000)](https://npmjs.com/package/tla-ts)
4
4
  [![downloads](https://img.shields.io/npm/dt/tla-ts.svg?style=flat&colorA=000000&colorB=000000)](https://npmjs.com/package/tla-ts)
5
5
 
6
- A TLA+ model checker in TypeScript, **2× faster than TLC**.
6
+ tla-ts is a drop-in replacement for [TLC](https://github.com/tlaplus/tlaplus) that's **2× faster**.
7
7
 
8
- tla-ts checks TLA+ specs with the same verdicts, error traces, and state counts as TLC. It runs in Node and in the browser without a JVM. Try it in the [playground](https://tla-ts.aidenybai.com).
8
+ TLA+ lets you write formal models of a system, and TLC model checks them. But TLC is written in Java and needs the JVM. tla-ts runs anywhere JavaScript runs, such as the browser, Node, and Bun. Try it in the [playground](https://tla-ts.aidenybai.com).
9
9
 
10
10
  ```ts
11
11
  import { check } from "tla-ts";
@@ -30,19 +30,66 @@ result.status; // "invariant-violation"
30
30
  npm install tla-ts
31
31
  ```
32
32
 
33
- ## Usage
33
+ ## Command line
34
+
35
+ The `tla-ts` command takes TLC's options and prints TLC's output. `tla-ts prove` takes tlapm's options and prints tlapm's output.
36
+
37
+ ### Check a spec
38
+
39
+ To check a spec, pass its path:
40
+
41
+ ```shell
42
+ npx tla-ts Spec.tla
43
+ ```
44
+
45
+ tla-ts reads the configuration from `Spec.cfg` next to the spec. It exits with the exit code TLC uses for the same result.
46
+
47
+ You can pass several paths, or a glob such as `"specs/*.tla"`. tla-ts checks each spec in turn and exits with the exit code of the first spec that fails. A glob skips each module that has no `.cfg` next to it, so it doesn't check helper modules that other specs import. tla-ts never skips a path that you pass by name. If you pass a `.cfg` path, tla-ts checks the `.tla` file with the same name.
48
+
49
+ The options are:
50
+
51
+ - `-config <Spec.cfg>`: read the configuration from this file. You can use it only when you check one spec.
52
+ - `-deadlock`: don't report deadlocks.
53
+ - `-dump [dot[,colorize][,actionlabels][,snapshot]] <file>`: write every reachable state to `<file>.dump`, or with `dot`, the state graph to `<file>.dot`. The output matches TLC run with `-fp 0`. tla-ts doesn't support the `constrained`, `stuttering`, or `strict` formats.
54
+ - `-lncheck final`: check liveness once, after the search ends.
55
+ - `-seed <num>`: seed `RandomElement` and the `Randomization` module. The default is 0.
56
+ - `-workers <count|auto>`: search with this number of worker threads. `auto` uses one thread per core. The default is 1.
57
+
58
+ TLC can replace a module's operators with Java methods, and tla-ts reads the same files. If the spec's directory has `Module.class`, tla-ts replaces each operator in `Module` with the public static method that has the same name and arity.
59
+
60
+ ### Generate proof obligations
61
+
62
+ A proof obligation is one claim that a backend prover must prove. `tla-ts prove -N` prints the obligations of a module, as `tlapm -N` does. It doesn't run a prover. For example, this command prints every obligation in `Module.tla` with its text:
34
63
 
35
64
  ```shell
36
- npx tla-ts Spec.tla [-config Spec.cfg] [-deadlock] [-lncheck final] [-seed 0] [-workers auto]
65
+ npx tla-ts prove -N --toolbox 0 0 --printallobs Module.tla
37
66
  ```
38
67
 
39
- - `-config`: the TLC configuration. Defaults to `Spec.cfg` next to the spec.
40
- - `-deadlock`: turns off deadlock checking.
41
- - `-lncheck final`: checks liveness once, after the search.
42
- - `-seed`: seeds `RandomElement` and the Randomization module. Defaults to 0.
43
- - `-workers`: the number of worker threads, or `auto` for one per core. Defaults to 1.
68
+ With `--toolbox` or `--line`, tla-ts writes the messages of the TLA+ Toolbox protocol to stderr, as tlapm does. If you pass a tlapm option that isn't in this list, tla-ts prints an error:
44
69
 
45
- Output and exit codes match TLC's. The CLI loads a compiled Java class such as `Module.class` from the spec's directory as an override for that module.
70
+ - `--toolbox <start> <end>`: print Toolbox messages for the proofs from line `start` to line `end`. `0 0` selects the whole module.
71
+ - `--line <num>`: print Toolbox messages for the proof at this line.
72
+ - `--printallobs`: print the text of each obligation.
73
+ - `--summary`: print the number of obligations in each module, and list its missing and omitted proofs. You don't need `-N` with `--summary`.
74
+ - `--strict`: report missing proofs, omitted proofs and a selected range with no obligations as errors.
75
+ - `-I <directory>`: search this directory for modules.
76
+
77
+ tla-ts searches for modules in the same order as tlapm:
78
+
79
+ 1. The directory of each module you pass, the last one first.
80
+ 2. The current directory.
81
+ 3. The standard library of tlapm, which has the `TLAPS` module. tla-ts searches it only if `tlapm` is on your `PATH`.
82
+ 4. The `-I` directories, the last one first.
83
+
84
+ ### Prove with tlapm
85
+
86
+ tla-ts doesn't include a prover. Without `-N` or `--summary`, `tla-ts prove` runs [tlapm](https://github.com/tlaplus/tlapm) from your `PATH`:
87
+
88
+ ```shell
89
+ npx tla-ts prove Module.tla
90
+ ```
91
+
92
+ tla-ts expands the globs and passes every argument to tlapm, so all of tlapm's options work. tlapm sends the obligations to its provers, and tla-ts exits with the exit code of tlapm. If `tlapm` isn't on your `PATH`, tla-ts prints an error and exits with code 1.
46
93
 
47
94
  ## API reference
48
95
 
@@ -69,9 +116,12 @@ const result = await check({
69
116
  | `loadClass` | Returns a compiled Java class that overrides a module's operators with constants |
70
117
  | `onPrint` | Receives the output of `Print` and `PrintT`. Defaults to `console.log` |
71
118
  | `onPause` | Runs when `TLCSet("pause", TRUE)` pauses checking, which resumes when it returns |
72
- | `readFile`, `writeFile` | Read and write files for the Json module |
119
+ | `readFile`, `writeFile` | Read and write files for the Json module and `dump` |
73
120
  | `seed` | A `bigint` seed. Defaults to `0n`, and matches TLC run with the same `-seed` and `-fp 0` |
74
121
  | `workers` | The number of worker threads. Defaults to 1 |
122
+ | `dump` | Writes the reachable states or the state graph, as TLC's `-dump` does |
123
+
124
+ `dump` takes the `path` that `check` passes to `writeFile` before it returns. Set `dot` to write the state graph in the DOT language of Graphviz, and `colorize`, `actionLabels`, or `snapshot` for TLC's formats of the same names. A dump checks the spec on the calling thread, as one TLC worker does.
75
125
 
76
126
  The result has these fields:
77
127
 
@@ -80,7 +130,14 @@ The result has these fields:
80
130
  - `failure`: the message and trace when `status` is `"error"`.
81
131
  - `generatedStates`, `distinctStates`, and `depth`: TLC's state counts.
82
132
 
83
- Workers run in Node, Bun, Deno, and the browser, and deduplicate states by 64-bit fingerprint as TLC does. `check` runs on the calling thread for specs with liveness properties or impure operators such as `Print`. After a violation, it reruns there to return the exact trace.
133
+ Workers run in Node, Bun, Deno, and cross-origin isolated pages in the browser. Like TLC's workers, they share one table of 64-bit fingerprints. `check` runs on the calling thread in these cases:
134
+
135
+ - `SharedArrayBuffer` is unavailable, as on a page without cross-origin isolation.
136
+ - The spec has liveness properties.
137
+ - The spec uses impure operators such as `Print`.
138
+ - The configuration has `VIEW`, `POSTCONDITION`, or `_POSSIBLE`.
139
+
140
+ After a violation or an error, `check` reruns on the calling thread to return TLC's exact trace.
84
141
 
85
142
  `check` supports:
86
143
 
@@ -144,6 +201,15 @@ Wall time on one worker, including JVM and Node startup. Both checkers report th
144
201
  | [Bounded queue](packages/tla-ts/benchmarks/queue) | 44,044 | 0.37 s | 0.17 s | 2.2× |
145
202
  | 542 conformance models | | 986.6 s | 403.3 s | 2.4× |
146
203
 
204
+ Wall time on 8 workers, also including startup. Each time is the median of 3 runs on an Apple M4 Pro.
205
+
206
+ | Spec | Distinct states | TLC | tla-ts | Speedup |
207
+ | --------------------------------------------------------------------------------------------------------------------- | --------------: | ------: | -----: | ------: |
208
+ | [Raft with reconfiguration](https://github.com/will62794/tla-web/blob/8193eb0/specs/RaftWithReconfigSingleServer.tla) | 298,493 | 10.50 s | 8.96 s | 1.2× |
209
+ | [Sailfish](https://github.com/tlaplus/Examples/tree/0cab2b3/specifications/dag-consensus) | 109,604 | 4.34 s | 4.07 s | 1.1× |
210
+ | [Fast Paxos](https://github.com/tlaplus/Examples/tree/0cab2b3/specifications/SimplifiedFastPaxos) | 25,617 | 3.91 s | 2.57 s | 1.5× |
211
+ | [Buffered random access file](https://github.com/tlaplus/Examples/tree/0cab2b3/specifications/braf) | 3,316 | 4.70 s | 3.61 s | 1.3× |
212
+
147
213
  ## Development
148
214
 
149
215
  ```shell
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("./transfer.cjs"),t=require("./parallel.cjs");exports.TlaConfigError=e.D,exports.TlaError=e.O,exports.TlaEvaluationError=e.k,exports.TlaSyntaxError=e.A,exports.TlaUnsupportedError=e.j,exports.check=t.t,exports.formatValue=e.S,exports.parseConfig=e.E,exports.parseModule=e._;
9
+ Object.defineProperty(exports,Symbol.toStringTag,{value:`Module`});const e=require("./transfer.cjs"),t=require("./parallel.cjs");exports.TlaConfigError=e.M,exports.TlaError=e.N,exports.TlaEvaluationError=e.P,exports.TlaSyntaxError=e.I,exports.TlaUnsupportedError=e.L,exports.check=t.t,exports.formatValue=e.D,exports.parseConfig=e.A,exports.parseModule=e.b;
package/dist/index.d.cts CHANGED
@@ -45,6 +45,8 @@ interface ApplyExpression {
45
45
  kind: "Apply";
46
46
  operator: string;
47
47
  args: Expression[];
48
+ argumentCounts?: number[];
49
+ argumentsRange?: SourceRange;
48
50
  location: SourceLocation;
49
51
  resolution?: LocalResolution;
50
52
  }
@@ -62,6 +64,7 @@ interface LambdaExpression {
62
64
  interface JunctionExpression {
63
65
  kind: "And" | "Or";
64
66
  operands: Expression[];
67
+ isBulleted?: boolean;
65
68
  location: SourceLocation;
66
69
  }
67
70
  interface PrimeExpression {
@@ -122,6 +125,7 @@ interface QuantifierExpression {
122
125
  }
123
126
  interface UnboundedQuantifierExpression {
124
127
  kind: "UnboundedQuantifier";
128
+ quantifier: "Forall" | "Exists";
125
129
  names: string[];
126
130
  isTemporal?: boolean;
127
131
  body: Expression;
@@ -172,6 +176,7 @@ interface FunctionSetExpression {
172
176
  interface RecordField {
173
177
  name: string;
174
178
  value: Expression;
179
+ location: SourceLocation;
175
180
  }
176
181
  interface RecordExpression {
177
182
  kind: "Record" | "RecordSet";
@@ -265,6 +270,7 @@ type Expression = NumberExpression | DecimalExpression | StringExpression | Iden
265
270
  interface OperatorParam {
266
271
  name: string;
267
272
  arity: number;
273
+ location?: SourceLocation;
268
274
  }
269
275
  interface OperatorDefinition {
270
276
  kind: "Operator";
@@ -309,6 +315,8 @@ interface Instance {
309
315
  substitutions: InstanceSubstitution[];
310
316
  isLocal: boolean;
311
317
  location: SourceLocation;
318
+ instanceRange: SourceRange;
319
+ definitionRange?: SourceRange;
312
320
  }
313
321
  interface NewSymbol {
314
322
  kind: "NewSymbol";
@@ -334,16 +342,19 @@ interface UseOrHide {
334
342
  isOnly: boolean;
335
343
  facts: Fact[];
336
344
  defs: Fact[];
345
+ keyword: SourceRange;
337
346
  location: SourceLocation;
338
347
  }
339
348
  type Proof = {
340
349
  kind: "Obvious" | "Omitted";
350
+ keyword: SourceRange;
341
351
  location: SourceLocation;
342
352
  } | {
343
353
  kind: "By";
344
354
  isOnly: boolean;
345
355
  facts: Fact[];
346
356
  defs: Fact[];
357
+ keyword: SourceRange;
347
358
  location: SourceLocation;
348
359
  } | {
349
360
  kind: "Steps";
@@ -383,7 +394,9 @@ type StepBody = UseOrHide | Instance | DefineStep | {
383
394
  };
384
395
  interface ProofStep {
385
396
  name: string | undefined;
397
+ token: string;
386
398
  body: StepBody;
399
+ head: SourceRange;
387
400
  proof: Proof | undefined;
388
401
  location: SourceLocation;
389
402
  }
@@ -393,10 +406,39 @@ interface Theorem {
393
406
  proof: Proof | undefined;
394
407
  location: SourceLocation;
395
408
  }
409
+ type ModuleUnit = {
410
+ kind: "Constants";
411
+ declarations: Declaration[];
412
+ } | {
413
+ kind: "Variables";
414
+ declarations: Declaration[];
415
+ } | {
416
+ kind: "Recursive";
417
+ declarations: Declaration[];
418
+ } | {
419
+ kind: "Definition";
420
+ definition: Definition;
421
+ } | {
422
+ kind: "Instance";
423
+ instance: Instance;
424
+ } | {
425
+ kind: "Assumption";
426
+ assumption: Assumption;
427
+ } | {
428
+ kind: "Theorem";
429
+ theorem: Theorem;
430
+ } | {
431
+ kind: "Use";
432
+ use: UseOrHide;
433
+ } | {
434
+ kind: "Module";
435
+ module: Module;
436
+ };
396
437
  interface Module {
397
438
  name: string;
398
439
  modules: Module[];
399
440
  extends: string[];
441
+ extendsRanges: SourceRange[];
400
442
  constants: Declaration[];
401
443
  variables: Declaration[];
402
444
  definitions: Definition[];
@@ -405,6 +447,7 @@ interface Module {
405
447
  location: SourceLocation;
406
448
  theorems: Theorem[];
407
449
  uses: UseOrHide[];
450
+ units: ModuleUnit[];
408
451
  }
409
452
  type ConfigValue = {
410
453
  kind: "Number";
@@ -453,24 +496,11 @@ interface ModelConfig {
453
496
  rlReward: string | undefined;
454
497
  }
455
498
  export declare const parseConfig: (source: string) => ModelConfig;
456
- export declare class TlaError extends Error {
457
- constructor(message: string, cause?: unknown);
458
- }
459
- export declare class TlaSyntaxError extends TlaError {
460
- constructor(message: string, cause?: unknown);
461
- }
462
- export declare class TlaConfigError extends TlaError {
463
- constructor(message: string, cause?: unknown);
464
- }
465
- export declare class TlaEvaluationError extends TlaError {
466
- constructor(message: string, cause?: unknown);
467
- }
468
- export declare class TlaUnsupportedError extends TlaError {
469
- constructor(message: string, cause?: unknown);
470
- }
471
499
  interface ModelValue {
472
500
  kind: "ModelValue";
473
501
  name: string;
502
+ type: string | undefined;
503
+ rank: number;
474
504
  }
475
505
  interface SetValue {
476
506
  kind: "Set";
@@ -552,6 +582,44 @@ interface LazyFunctionValue {
552
582
  }
553
583
  type Value = boolean | number | string | ModelValue | SetValue | MixedSetValue | FunctionValue | IntervalValue | InfiniteSetValue | SubsetValue | FunctionSetValue | RecordSetValue | ProductSetValue | SequenceSetValue | SetOperationValue | FilteredSetValue | UnionValue | LazyFunctionValue;
554
584
  export declare const formatValue: (value: Value, isStrict?: boolean, isNormalized?: boolean) => string;
585
+ export declare class TlaError extends Error {
586
+ constructor(message: string, cause?: unknown);
587
+ }
588
+ interface SyntaxFailure {
589
+ reason: string;
590
+ line: number;
591
+ column: number;
592
+ isEnd: boolean;
593
+ }
594
+ interface SanyError {
595
+ location: string;
596
+ message: string;
597
+ }
598
+ interface SanyReport {
599
+ errors: SanyError[];
600
+ isFatal: boolean;
601
+ }
602
+ export declare class TlaSyntaxError extends TlaError {
603
+ failure: SyntaxFailure | undefined;
604
+ sany: SanyReport | undefined;
605
+ constructor(message: string, cause?: unknown, failure?: SyntaxFailure, sany?: SanyReport);
606
+ }
607
+ export declare class TlaConfigError extends TlaError {
608
+ constructor(message: string, cause?: unknown);
609
+ }
610
+ export declare class TlaEvaluationError extends TlaError {
611
+ constructor(message: string, cause?: unknown);
612
+ }
613
+ export declare class TlaUnsupportedError extends TlaError {
614
+ constructor(message: string, cause?: unknown);
615
+ }
616
+ interface StateDump {
617
+ path: string;
618
+ dot?: boolean;
619
+ colorize?: boolean;
620
+ actionLabels?: boolean;
621
+ snapshot?: boolean;
622
+ }
555
623
  interface CheckOptions {
556
624
  source: string;
557
625
  config: string | ModelConfig;
@@ -564,6 +632,7 @@ interface CheckOptions {
564
632
  seed?: bigint;
565
633
  workers?: number;
566
634
  livenessCheck?: "default" | "final";
635
+ dump?: StateDump;
567
636
  }
568
637
  type CheckStatus = "success" | "assumption-violation" | "invariant-violation" | "property-violation" | "liveness-violation" | "postcondition-violation" | "deadlock" | "error";
569
638
  interface TraceStep {
@@ -573,6 +642,7 @@ interface TraceStep {
573
642
  }
574
643
  interface Violation {
575
644
  name: string;
645
+ properties?: string[];
576
646
  trace: TraceStep[];
577
647
  loopStart: number | undefined;
578
648
  loopLabel?: string;
package/dist/index.d.ts CHANGED
@@ -45,6 +45,8 @@ interface ApplyExpression {
45
45
  kind: "Apply";
46
46
  operator: string;
47
47
  args: Expression[];
48
+ argumentCounts?: number[];
49
+ argumentsRange?: SourceRange;
48
50
  location: SourceLocation;
49
51
  resolution?: LocalResolution;
50
52
  }
@@ -62,6 +64,7 @@ interface LambdaExpression {
62
64
  interface JunctionExpression {
63
65
  kind: "And" | "Or";
64
66
  operands: Expression[];
67
+ isBulleted?: boolean;
65
68
  location: SourceLocation;
66
69
  }
67
70
  interface PrimeExpression {
@@ -122,6 +125,7 @@ interface QuantifierExpression {
122
125
  }
123
126
  interface UnboundedQuantifierExpression {
124
127
  kind: "UnboundedQuantifier";
128
+ quantifier: "Forall" | "Exists";
125
129
  names: string[];
126
130
  isTemporal?: boolean;
127
131
  body: Expression;
@@ -172,6 +176,7 @@ interface FunctionSetExpression {
172
176
  interface RecordField {
173
177
  name: string;
174
178
  value: Expression;
179
+ location: SourceLocation;
175
180
  }
176
181
  interface RecordExpression {
177
182
  kind: "Record" | "RecordSet";
@@ -265,6 +270,7 @@ type Expression = NumberExpression | DecimalExpression | StringExpression | Iden
265
270
  interface OperatorParam {
266
271
  name: string;
267
272
  arity: number;
273
+ location?: SourceLocation;
268
274
  }
269
275
  interface OperatorDefinition {
270
276
  kind: "Operator";
@@ -309,6 +315,8 @@ interface Instance {
309
315
  substitutions: InstanceSubstitution[];
310
316
  isLocal: boolean;
311
317
  location: SourceLocation;
318
+ instanceRange: SourceRange;
319
+ definitionRange?: SourceRange;
312
320
  }
313
321
  interface NewSymbol {
314
322
  kind: "NewSymbol";
@@ -334,16 +342,19 @@ interface UseOrHide {
334
342
  isOnly: boolean;
335
343
  facts: Fact[];
336
344
  defs: Fact[];
345
+ keyword: SourceRange;
337
346
  location: SourceLocation;
338
347
  }
339
348
  type Proof = {
340
349
  kind: "Obvious" | "Omitted";
350
+ keyword: SourceRange;
341
351
  location: SourceLocation;
342
352
  } | {
343
353
  kind: "By";
344
354
  isOnly: boolean;
345
355
  facts: Fact[];
346
356
  defs: Fact[];
357
+ keyword: SourceRange;
347
358
  location: SourceLocation;
348
359
  } | {
349
360
  kind: "Steps";
@@ -383,7 +394,9 @@ type StepBody = UseOrHide | Instance | DefineStep | {
383
394
  };
384
395
  interface ProofStep {
385
396
  name: string | undefined;
397
+ token: string;
386
398
  body: StepBody;
399
+ head: SourceRange;
387
400
  proof: Proof | undefined;
388
401
  location: SourceLocation;
389
402
  }
@@ -393,10 +406,39 @@ interface Theorem {
393
406
  proof: Proof | undefined;
394
407
  location: SourceLocation;
395
408
  }
409
+ type ModuleUnit = {
410
+ kind: "Constants";
411
+ declarations: Declaration[];
412
+ } | {
413
+ kind: "Variables";
414
+ declarations: Declaration[];
415
+ } | {
416
+ kind: "Recursive";
417
+ declarations: Declaration[];
418
+ } | {
419
+ kind: "Definition";
420
+ definition: Definition;
421
+ } | {
422
+ kind: "Instance";
423
+ instance: Instance;
424
+ } | {
425
+ kind: "Assumption";
426
+ assumption: Assumption;
427
+ } | {
428
+ kind: "Theorem";
429
+ theorem: Theorem;
430
+ } | {
431
+ kind: "Use";
432
+ use: UseOrHide;
433
+ } | {
434
+ kind: "Module";
435
+ module: Module;
436
+ };
396
437
  interface Module {
397
438
  name: string;
398
439
  modules: Module[];
399
440
  extends: string[];
441
+ extendsRanges: SourceRange[];
400
442
  constants: Declaration[];
401
443
  variables: Declaration[];
402
444
  definitions: Definition[];
@@ -405,6 +447,7 @@ interface Module {
405
447
  location: SourceLocation;
406
448
  theorems: Theorem[];
407
449
  uses: UseOrHide[];
450
+ units: ModuleUnit[];
408
451
  }
409
452
  type ConfigValue = {
410
453
  kind: "Number";
@@ -453,24 +496,11 @@ interface ModelConfig {
453
496
  rlReward: string | undefined;
454
497
  }
455
498
  export declare const parseConfig: (source: string) => ModelConfig;
456
- export declare class TlaError extends Error {
457
- constructor(message: string, cause?: unknown);
458
- }
459
- export declare class TlaSyntaxError extends TlaError {
460
- constructor(message: string, cause?: unknown);
461
- }
462
- export declare class TlaConfigError extends TlaError {
463
- constructor(message: string, cause?: unknown);
464
- }
465
- export declare class TlaEvaluationError extends TlaError {
466
- constructor(message: string, cause?: unknown);
467
- }
468
- export declare class TlaUnsupportedError extends TlaError {
469
- constructor(message: string, cause?: unknown);
470
- }
471
499
  interface ModelValue {
472
500
  kind: "ModelValue";
473
501
  name: string;
502
+ type: string | undefined;
503
+ rank: number;
474
504
  }
475
505
  interface SetValue {
476
506
  kind: "Set";
@@ -552,6 +582,44 @@ interface LazyFunctionValue {
552
582
  }
553
583
  type Value = boolean | number | string | ModelValue | SetValue | MixedSetValue | FunctionValue | IntervalValue | InfiniteSetValue | SubsetValue | FunctionSetValue | RecordSetValue | ProductSetValue | SequenceSetValue | SetOperationValue | FilteredSetValue | UnionValue | LazyFunctionValue;
554
584
  export declare const formatValue: (value: Value, isStrict?: boolean, isNormalized?: boolean) => string;
585
+ export declare class TlaError extends Error {
586
+ constructor(message: string, cause?: unknown);
587
+ }
588
+ interface SyntaxFailure {
589
+ reason: string;
590
+ line: number;
591
+ column: number;
592
+ isEnd: boolean;
593
+ }
594
+ interface SanyError {
595
+ location: string;
596
+ message: string;
597
+ }
598
+ interface SanyReport {
599
+ errors: SanyError[];
600
+ isFatal: boolean;
601
+ }
602
+ export declare class TlaSyntaxError extends TlaError {
603
+ failure: SyntaxFailure | undefined;
604
+ sany: SanyReport | undefined;
605
+ constructor(message: string, cause?: unknown, failure?: SyntaxFailure, sany?: SanyReport);
606
+ }
607
+ export declare class TlaConfigError extends TlaError {
608
+ constructor(message: string, cause?: unknown);
609
+ }
610
+ export declare class TlaEvaluationError extends TlaError {
611
+ constructor(message: string, cause?: unknown);
612
+ }
613
+ export declare class TlaUnsupportedError extends TlaError {
614
+ constructor(message: string, cause?: unknown);
615
+ }
616
+ interface StateDump {
617
+ path: string;
618
+ dot?: boolean;
619
+ colorize?: boolean;
620
+ actionLabels?: boolean;
621
+ snapshot?: boolean;
622
+ }
555
623
  interface CheckOptions {
556
624
  source: string;
557
625
  config: string | ModelConfig;
@@ -564,6 +632,7 @@ interface CheckOptions {
564
632
  seed?: bigint;
565
633
  workers?: number;
566
634
  livenessCheck?: "default" | "final";
635
+ dump?: StateDump;
567
636
  }
568
637
  type CheckStatus = "success" | "assumption-violation" | "invariant-violation" | "property-violation" | "liveness-violation" | "postcondition-violation" | "deadlock" | "error";
569
638
  interface TraceStep {
@@ -573,6 +642,7 @@ interface TraceStep {
573
642
  }
574
643
  interface Violation {
575
644
  name: string;
645
+ properties?: string[];
576
646
  trace: TraceStep[];
577
647
  loopStart: number | undefined;
578
648
  loopLabel?: string;
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,D as t,E as n,O as r,S as i,_ as a,j as o,k as s}from"./transfer.js";import{t as c}from"./parallel.js";export{t as TlaConfigError,r as TlaError,s as TlaEvaluationError,e as TlaSyntaxError,o as TlaUnsupportedError,c as check,i as formatValue,n as parseConfig,a as parseModule};
9
+ import{A as e,D as t,I as n,L as r,M as i,N as a,P as o,b as s}from"./transfer.js";import{t as c}from"./parallel.js";export{i as TlaConfigError,a as TlaError,o as TlaEvaluationError,n as TlaSyntaxError,r as TlaUnsupportedError,c as check,t as formatValue,e as parseConfig,s as parseModule};
@@ -6,7 +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
- const e=require("./transfer.cjs"),t=e=>{let t=e.reduce((e,t)=>e+t,0),n=t/e.length;if(Math.max(...e)-Math.min(...e)<=Math.max(64,n/4))return[];let r=e.map((r,i)=>Math.floor(n)+ +(i<t%e.length)),i=e.flatMap((e,t)=>e>r[t]?[{index:t,amount:e-r[t]}]:[]),a=e.flatMap((e,t)=>e<r[t]?[{index:t,amount:r[t]-e}]:[]),o=[];for(let e of i)for(let t of a){let n=Math.min(e.amount,t.amount);n!==0&&(o.push({from:e.index,to:t.index,count:n}),e.amount-=n,t.amount-=n)}return o},n=async()=>typeof globalThis.postMessage==`function`?globalThis:(await import(
9
+ const e=require("./transfer.cjs"),t=async()=>typeof globalThis.postMessage==`function`?globalThis:(await import(
10
10
  /* @vite-ignore */
11
11
  /* webpackIgnore: true */
12
- `node:worker_threads`)).parentPort,r=()=>{let e=/* @__PURE__ */ new Map,t=/* @__PURE__ */ new Map,n=(e,t)=>`${e}:${t}`,r=n=>{let r=t.get(n),i=e.get(n)??[];!r||i.length<r.count||(t.delete(n),e.delete(n),r.resolve(i))};return{deliver:t=>{let i=n(t.phase,t.level);e.set(i,[...e.get(i)??[],t]),r(i)},receive:(e,i,a)=>new Promise(o=>{let s=n(e,i);t.set(s,{count:a,resolve:o}),r(s)})}},i=(n,i)=>{let a=new Map(n.modules),o=e=>a.get(e),s=new Map(n.classes);e.w(e.m(n.source,n.config,o));let c=e.C(),l=e.g(n.config,{source:n.source,loadModule:o,loadClass:e=>s.get(e),print:()=>{},files:{readFile:void 0,writeFile:void 0}}).environment,u=e.s(n.config,l,()=>e.h(n.source,o)),d=u?.spec.next;if(!u||d===void 0)return i.postMessage({type:`abort`});let f=n.count,p=n.index,m=e.x(),h=e.t(l.variables.length),g=e.r(),_=e.r(),v=/* @__PURE__ */ new Int32Array(2),y=r(),b=n.ports.flatMap((e,t)=>e?[{port:e,index:t}]:[]);b.forEach(e=>{e.port.addEventListener(`message`,e=>y.deliver(e.data)),e.port.start?.()});for(let e=0;e<n.seedFingerprints.length;e+=2)g.insert(n.seedFingerprints[e],n.seedFingerprints[e+1]);let x={states:h(n.seed).map(m)},S=(e,t,r)=>n.ports[e]?.postMessage(t,r),C=(t,r)=>{let i=Array.from({length:f},()=>({states:[],origins:[],fingerprints:[]})),a={generated:0},o=new Int32Array(t.length);for(let s=0;s<t.length;s++){let c=t[s],h=e.b(d,c,l,u.spec.scope);if(a.generated+=h.length,h.length===0&&n.config.checkDeadlock)return;for(let t of h){if(u.findViolatedActionProperty(c,t.state))return;if(!u.satisfiesActionConstraints(c,t.state))continue;m(t.state),e.a(u.getFingerprintState(t.state),v);let n=e.i(v[1],f);if(n===p){if(!g.insert(v[0],v[1]))continue;if(u.findViolatedInvariant(t.state,c))return;if(!u.satisfiesConstraints(t.state,c)){g.remove(v[0],v[1]);continue}r.push(t.state),o[s]++}else _.insert(v[0],v[1])&&(i[n].states.push(t.state),i[n].origins.push(s),i[n].fingerprints.push(v[0],v[1]))}}return{pending:i,generated:a.generated,newStates:o}},w=e=>{let t=new Uint8Array(e.length/2);for(let n=0;n<t.length;n++)t[n]=+!!g.insert(e[n*2],e[n*2+1]);return t},T=(e,t,n,r)=>{let i=[];for(let a=0;a<t.length;a++){if(t[a]===0)continue;let o=e.states[a],s=x.states[e.origins[a]];if(u.findViolatedInvariant(o,s))return;u.satisfiesConstraints(o,s)?(n.push(o),r[e.origins[a]]++):(_.remove(e.fingerprints[a*2],e.fingerprints[a*2+1]),i.push(e.fingerprints[a*2],e.fingerprints[a*2+1]))}return Int32Array.from(i)},E=e=>{for(let t=0;t<e.length;t+=2)g.remove(e[t],e[t+1])},D=async(n,r,i)=>{let a=t(i);if(a.length===0)return!0;let o=new Map(b.map(t=>[t.index,e.n()]));for(let e of a.filter(e=>e.from===p)){let t=o.get(e.to),n=r.splice(r.length-e.count,e.count);if(!t||!n.every(t.encode))return!1}return o.forEach((e,t)=>{let r=e.finish();S(t,{phase:`balance`,level:n,from:p,states:r},[r.words.buffer])}),(await y.receive(`balance`,n,b.length)).forEach(e=>{e.states&&r.push(...h(e.states).map(m))}),!0},O=async t=>{let n=[],r=C(x.states,n);if(!r||e.C()!==c)return;b.forEach(e=>{let n=Int32Array.from(r.pending[e.index].fingerprints);S(e.index,{phase:`query`,level:t,from:p,fingerprints:n},[n.buffer])}),(await y.receive(`query`,t,b.length)).forEach(e=>{let n=w(e.fingerprints??[]);S(e.from,{phase:`answer`,level:t,from:p,bits:n},[n.buffer])});let i=await y.receive(`answer`,t,b.length);for(let e of i){let i=T(r.pending[e.from],e.bits??/* @__PURE__ */ new Uint8Array,n,r.newStates);if(!i)return;S(e.from,{phase:`sizes`,level:t,from:p,unmarks:i},[i.buffer])}let a=n.length,o=Array.from({length:32},()=>0);r.newStates.forEach(e=>o[Math.min(e,31)]++);let s=BigInt64Array.from(n,e=>l.runtime.getFingerprint(e)),u=Array.from({length:f},()=>0);if(u[p]=a,b.forEach(e=>S(e.index,{phase:`sizes`,level:t,from:p,size:a},[])),(await y.receive(`sizes`,t,b.length*2)).forEach(e=>{e.unmarks?E(e.unmarks):u[e.from]=e.size??0}),e.C()===c&&await D(t,n,u))return x.states=n,{type:`level`,level:t,generated:r.generated,added:a,outDegrees:o,fingerprints:s}},k=e=>i.postMessage(e,e.type===`level`?[e.fingerprints.buffer]:[]),A=e=>{O(e).then(e=>k(e??{type:`abort`}),()=>k({type:`abort`}))};i.addEventListener(`message`,e=>{let t=e.data;t.type===`level`&&A(t.level)}),k({type:`ready`})};n().then(e=>{let t=n=>{let r=n.data;if(r.type===`start`){e.removeEventListener?.(`message`,t);try{i(r,e)}catch{e.postMessage({type:`abort`})}}};e.addEventListener(`message`,t),e.start?.()});
12
+ `node:worker_threads`)).parentPort,n=(t,n)=>{let r=new Map(t.modules),i=e=>r.get(e),a=new Map(t.classes);e.k(e.y(t.source,t.config,i));let o=e.O(),s=e._(t.config,{source:t.source,loadModule:i,loadClass:e=>a.get(e),print:()=>{},files:{readFile:void 0,writeFile:void 0}}).environment,c=e.u(t.config,s,()=>e.v(t.source,i,`variable`)),l=c?.spec.next;if(!c||l===void 0)return n.postMessage({type:`abort`});let u=t.index,d=e.T(),f=e.t(s.variables.length),p={fingerprints:t.fingerprints},m=t.requests,h=t.remaining,g=c.isSymmetric?e.r():void 0,_=/* @__PURE__ */ new Int32Array(2),v={resume:()=>{},loot:e=>{}};t.ports.forEach(e=>{e?.addEventListener(`message`,e=>v.loot(e.data)),e?.start?.()});let y={states:f(t.seed).map(d)},b=(n,r)=>{let i=Atomics.load(m,u)-1,a=Math.floor((n.end-n.origin-1)/2),o=e.n(),s=n.states.slice(n.end-a,n.end),c=a>0&&s.every(o.encode);c&&(n.end-=a);let l=c?o.finish():e.n().finish();t.ports[i]?.postMessage(l,[l.words.buffer]),Atomics.store(m,u,r),Atomics.notify(m,u)},x=e=>{Atomics.store(h,u,0),Atomics.compareExchange(m,u,0,-1)!==0&&b(e,-1)},S=e=>{Atomics.store(h,u,e.end-e.origin),Atomics.store(m,u,0)},C=n=>{for(;n.origin<n.end;n.origin++){let r=n.states[n.origin];if(!n.successors&&(Atomics.load(m,u)>0&&b(n,0),Atomics.store(h,u,n.end-n.origin-1),n.successors=e.w(l,r,s,c.spec.scope),n.generated+=n.successors.length,n.successors.length===0&&t.config.checkDeadlock))return;let i=n.successors;for(;n.index<i.length;n.index++){if(e.s(p.fingerprints))return`paused`;let t=i[n.index];if(c.findViolatedActionProperty(r,t.state))return;if(!c.satisfiesActionConstraints(r,t.state)){if(c.findViolatedInvariant(t.state,r))return;continue}if(g&&(e.c(t.state,_),!g.insert(_[0],_[1])))continue;d(t.state);let a=c.getFingerprintState(t.state);if(e.c(a,_),e.o(p.fingerprints,_[0],_[1])){if(c.findViolatedInvariant(t.state,r))return;c.satisfiesConstraints(t.state,r)&&(n.next.push(t.state),n.fingerprintStates.push(a),n.added++)}}n.outDegrees[Math.min(n.added,31)]++,n.successors=void 0,n.index=0,n.added=0}return`done`},w=async e=>{let n=/* @__PURE__ */ new Set;for(;;){let r=t.ports.reduce((e,t,r)=>!t||n.has(r)||Atomics.load(h,r)<2?e:e===void 0||Atomics.load(h,r)>Atomics.load(h,e)?r:e,void 0);if(r===void 0)return!1;let i=Atomics.compareExchange(m,r,0,u+1);if(i===-1&&n.add(r),i>0&&Atomics.wait(m,r,i),i!==0)continue;let a=await new Promise(e=>v.loot=e);if(a.count===0)n.add(r);else return e.states=f(a).map(d),e.origin=0,e.end=e.states.length,S(e),!0}},T=e=>n.postMessage(e,e.type===`level`?[e.fingerprints.buffer]:[]),E=async t=>{let n={states:y.states,origin:0,end:y.states.length,successors:void 0,index:0,added:0,generated:0,outDegrees:Array.from({length:32},()=>0),next:[],fingerprintStates:[]};for(;;){let e=C(n);if(e===void 0)return;if(x(n),e===`paused`){let e=new Promise(e=>v.resume=e);T({type:`paused`}),await e,S(n)}else if(!await w(n))break}if(e.O()===o)return y.states=n.next,Atomics.store(h,u,y.states.length),{type:`level`,level:t,generated:n.generated,added:n.next.length,outDegrees:n.outDegrees,fingerprints:c.getStoredFingerprints(n.next,n.fingerprintStates)}},D=e=>{E(e).then(e=>T(e??{type:`abort`}),()=>T({type:`abort`}))};n.addEventListener(`message`,e=>{let t=e.data;t.type===`level`&&D(t.level),t.type===`resize`&&(p.fingerprints=t.fingerprints,v.resume())}),Atomics.store(h,u,y.states.length),T({type:`ready`})};t().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,7 +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{C as e,a as t,b as n,g as r,h as i,i as a,m as o,n as s,r as c,s as l,t as u,w as d,x as f}from"./transfer.js";const p=e=>{let t=e.reduce((e,t)=>e+t,0),n=t/e.length;if(Math.max(...e)-Math.min(...e)<=Math.max(64,n/4))return[];let r=e.map((r,i)=>Math.floor(n)+ +(i<t%e.length)),i=e.flatMap((e,t)=>e>r[t]?[{index:t,amount:e-r[t]}]:[]),a=e.flatMap((e,t)=>e<r[t]?[{index:t,amount:r[t]-e}]:[]),o=[];for(let e of i)for(let t of a){let n=Math.min(e.amount,t.amount);n!==0&&(o.push({from:e.index,to:t.index,count:n}),e.amount-=n,t.amount-=n)}return o},m=async()=>typeof globalThis.postMessage==`function`?globalThis:(await import(
9
+ import{O as e,T as t,_ as n,c as r,k as i,n as a,o,r as s,s as c,t as l,u,v as d,w as f,y as p}from"./transfer.js";const m=async()=>typeof globalThis.postMessage==`function`?globalThis:(await import(
10
10
  /* @vite-ignore */
11
11
  /* webpackIgnore: true */
12
- `node:worker_threads`)).parentPort,h=()=>{let e=/* @__PURE__ */ new Map,t=/* @__PURE__ */ new Map,n=(e,t)=>`${e}:${t}`,r=n=>{let r=t.get(n),i=e.get(n)??[];!r||i.length<r.count||(t.delete(n),e.delete(n),r.resolve(i))};return{deliver:t=>{let i=n(t.phase,t.level);e.set(i,[...e.get(i)??[],t]),r(i)},receive:(e,i,a)=>new Promise(o=>{let s=n(e,i);t.set(s,{count:a,resolve:o}),r(s)})}},g=(m,g)=>{let _=new Map(m.modules),v=e=>_.get(e),y=new Map(m.classes);d(o(m.source,m.config,v));let b=e(),x=r(m.config,{source:m.source,loadModule:v,loadClass:e=>y.get(e),print:()=>{},files:{readFile:void 0,writeFile:void 0}}).environment,S=l(m.config,x,()=>i(m.source,v)),C=S?.spec.next;if(!S||C===void 0)return g.postMessage({type:`abort`});let w=m.count,T=m.index,E=f(),D=u(x.variables.length),O=c(),k=c(),A=/* @__PURE__ */ new Int32Array(2),j=h(),M=m.ports.flatMap((e,t)=>e?[{port:e,index:t}]:[]);M.forEach(e=>{e.port.addEventListener(`message`,e=>j.deliver(e.data)),e.port.start?.()});for(let e=0;e<m.seedFingerprints.length;e+=2)O.insert(m.seedFingerprints[e],m.seedFingerprints[e+1]);let N={states:D(m.seed).map(E)},P=(e,t,n)=>m.ports[e]?.postMessage(t,n),F=(e,r)=>{let i=Array.from({length:w},()=>({states:[],origins:[],fingerprints:[]})),o={generated:0},s=new Int32Array(e.length);for(let c=0;c<e.length;c++){let l=e[c],u=n(C,l,x,S.spec.scope);if(o.generated+=u.length,u.length===0&&m.config.checkDeadlock)return;for(let e of u){if(S.findViolatedActionProperty(l,e.state))return;if(!S.satisfiesActionConstraints(l,e.state))continue;E(e.state),t(S.getFingerprintState(e.state),A);let n=a(A[1],w);if(n===T){if(!O.insert(A[0],A[1]))continue;if(S.findViolatedInvariant(e.state,l))return;if(!S.satisfiesConstraints(e.state,l)){O.remove(A[0],A[1]);continue}r.push(e.state),s[c]++}else k.insert(A[0],A[1])&&(i[n].states.push(e.state),i[n].origins.push(c),i[n].fingerprints.push(A[0],A[1]))}}return{pending:i,generated:o.generated,newStates:s}},I=e=>{let t=new Uint8Array(e.length/2);for(let n=0;n<t.length;n++)t[n]=+!!O.insert(e[n*2],e[n*2+1]);return t},L=(e,t,n,r)=>{let i=[];for(let a=0;a<t.length;a++){if(t[a]===0)continue;let o=e.states[a],s=N.states[e.origins[a]];if(S.findViolatedInvariant(o,s))return;S.satisfiesConstraints(o,s)?(n.push(o),r[e.origins[a]]++):(k.remove(e.fingerprints[a*2],e.fingerprints[a*2+1]),i.push(e.fingerprints[a*2],e.fingerprints[a*2+1]))}return Int32Array.from(i)},R=e=>{for(let t=0;t<e.length;t+=2)O.remove(e[t],e[t+1])},z=async(e,t,n)=>{let r=p(n);if(r.length===0)return!0;let i=new Map(M.map(e=>[e.index,s()]));for(let e of r.filter(e=>e.from===T)){let n=i.get(e.to),r=t.splice(t.length-e.count,e.count);if(!n||!r.every(n.encode))return!1}return i.forEach((t,n)=>{let r=t.finish();P(n,{phase:`balance`,level:e,from:T,states:r},[r.words.buffer])}),(await j.receive(`balance`,e,M.length)).forEach(e=>{e.states&&t.push(...D(e.states).map(E))}),!0},B=async t=>{let n=[],r=F(N.states,n);if(!r||e()!==b)return;M.forEach(e=>{let n=Int32Array.from(r.pending[e.index].fingerprints);P(e.index,{phase:`query`,level:t,from:T,fingerprints:n},[n.buffer])}),(await j.receive(`query`,t,M.length)).forEach(e=>{let n=I(e.fingerprints??[]);P(e.from,{phase:`answer`,level:t,from:T,bits:n},[n.buffer])});let i=await j.receive(`answer`,t,M.length);for(let e of i){let i=L(r.pending[e.from],e.bits??/* @__PURE__ */ new Uint8Array,n,r.newStates);if(!i)return;P(e.from,{phase:`sizes`,level:t,from:T,unmarks:i},[i.buffer])}let a=n.length,o=Array.from({length:32},()=>0);r.newStates.forEach(e=>o[Math.min(e,31)]++);let s=BigInt64Array.from(n,e=>x.runtime.getFingerprint(e)),c=Array.from({length:w},()=>0);if(c[T]=a,M.forEach(e=>P(e.index,{phase:`sizes`,level:t,from:T,size:a},[])),(await j.receive(`sizes`,t,M.length*2)).forEach(e=>{e.unmarks?R(e.unmarks):c[e.from]=e.size??0}),e()===b&&await z(t,n,c))return N.states=n,{type:`level`,level:t,generated:r.generated,added:a,outDegrees:o,fingerprints:s}},V=e=>g.postMessage(e,e.type===`level`?[e.fingerprints.buffer]:[]),H=e=>{B(e).then(e=>V(e??{type:`abort`}),()=>V({type:`abort`}))};g.addEventListener(`message`,e=>{let t=e.data;t.type===`level`&&H(t.level)}),V({type:`ready`})};m().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?.()});
12
+ `node:worker_threads`)).parentPort,h=(m,h)=>{let g=new Map(m.modules),_=e=>g.get(e),v=new Map(m.classes);i(p(m.source,m.config,_));let y=e(),b=n(m.config,{source:m.source,loadModule:_,loadClass:e=>v.get(e),print:()=>{},files:{readFile:void 0,writeFile:void 0}}).environment,x=u(m.config,b,()=>d(m.source,_,`variable`)),S=x?.spec.next;if(!x||S===void 0)return h.postMessage({type:`abort`});let C=m.index,w=t(),T=l(b.variables.length),E={fingerprints:m.fingerprints},D=m.requests,O=m.remaining,k=x.isSymmetric?s():void 0,A=/* @__PURE__ */ new Int32Array(2),j={resume:()=>{},loot:e=>{}};m.ports.forEach(e=>{e?.addEventListener(`message`,e=>j.loot(e.data)),e?.start?.()});let M={states:T(m.seed).map(w)},N=(e,t)=>{let n=Atomics.load(D,C)-1,r=Math.floor((e.end-e.origin-1)/2),i=a(),o=e.states.slice(e.end-r,e.end),s=r>0&&o.every(i.encode);s&&(e.end-=r);let c=s?i.finish():a().finish();m.ports[n]?.postMessage(c,[c.words.buffer]),Atomics.store(D,C,t),Atomics.notify(D,C)},P=e=>{Atomics.store(O,C,0),Atomics.compareExchange(D,C,0,-1)!==0&&N(e,-1)},F=e=>{Atomics.store(O,C,e.end-e.origin),Atomics.store(D,C,0)},I=e=>{for(;e.origin<e.end;e.origin++){let t=e.states[e.origin];if(!e.successors&&(Atomics.load(D,C)>0&&N(e,0),Atomics.store(O,C,e.end-e.origin-1),e.successors=f(S,t,b,x.spec.scope),e.generated+=e.successors.length,e.successors.length===0&&m.config.checkDeadlock))return;let n=e.successors;for(;e.index<n.length;e.index++){if(c(E.fingerprints))return`paused`;let i=n[e.index];if(x.findViolatedActionProperty(t,i.state))return;if(!x.satisfiesActionConstraints(t,i.state)){if(x.findViolatedInvariant(i.state,t))return;continue}if(k&&(r(i.state,A),!k.insert(A[0],A[1])))continue;w(i.state);let a=x.getFingerprintState(i.state);if(r(a,A),o(E.fingerprints,A[0],A[1])){if(x.findViolatedInvariant(i.state,t))return;x.satisfiesConstraints(i.state,t)&&(e.next.push(i.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`},L=async e=>{let t=/* @__PURE__ */ new Set;for(;;){let n=m.ports.reduce((e,n,r)=>!n||t.has(r)||Atomics.load(O,r)<2?e:e===void 0||Atomics.load(O,r)>Atomics.load(O,e)?r:e,void 0);if(n===void 0)return!1;let r=Atomics.compareExchange(D,n,0,C+1);if(r===-1&&t.add(n),r>0&&Atomics.wait(D,n,r),r!==0)continue;let i=await new Promise(e=>j.loot=e);if(i.count===0)t.add(n);else return e.states=T(i).map(w),e.origin=0,e.end=e.states.length,F(e),!0}},R=e=>h.postMessage(e,e.type===`level`?[e.fingerprints.buffer]:[]),z=async t=>{let n={states:M.states,origin:0,end:M.states.length,successors:void 0,index:0,added:0,generated:0,outDegrees:Array.from({length:32},()=>0),next:[],fingerprintStates:[]};for(;;){let e=I(n);if(e===void 0)return;if(P(n),e===`paused`){let e=new Promise(e=>j.resume=e);R({type:`paused`}),await e,F(n)}else if(!await L(n))break}if(e()===y)return M.states=n.next,Atomics.store(O,C,M.states.length),{type:`level`,level:t,generated:n.generated,added:n.next.length,outDegrees:n.outDegrees,fingerprints:x.getStoredFingerprints(n.next,n.fingerprintStates)}},B=e=>{z(e).then(e=>R(e??{type:`abort`}),()=>R({type:`abort`}))};h.addEventListener(`message`,e=>{let t=e.data;t.type===`level`&&B(t.level),t.type===`resize`&&(E.fingerprints=t.fingerprints,j.resume())}),Atomics.store(O,C,M.states.length),R({type:`ready`})};m().then(e=>{let t=n=>{let r=n.data;if(r.type===`start`){e.removeEventListener?.(`message`,t);try{h(r,e)}catch{e.postMessage({type:`abort`})}}};e.addEventListener(`message`,t),e.start?.()});