About the Execution of ITS-Tools for StigmergyElection-PT-08a
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 0.000 | 807270.00 | 0.00 | 0.00 | TFTTFFFFTFTTFTTT | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r226-smll-174903491000258.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5832
Executing tool itstools
Input is StigmergyElection-PT-08a, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r226-smll-174903491000258
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 5.7M
-rw-r--r-- 1 mcc users 6.4K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 65K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 137K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.8K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 62K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:33 equiv_col
-rw-r--r-- 1 mcc users 4 May 29 14:33 instance
-rw-r--r-- 1 mcc users 6 May 29 14:33 iscolored
-rw-r--r-- 1 mcc users 5.3M May 29 14:33 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
echo here is the order used to build the result vector(from xml file)
FORMULA_NAME StigmergyElection-PT-08a-CTLFireability-2023-12
FORMULA_NAME StigmergyElection-PT-08a-CTLFireability-2023-13
FORMULA_NAME StigmergyElection-PT-08a-CTLFireability-2023-14
FORMULA_NAME StigmergyElection-PT-08a-CTLFireability-2023-15
FORMULA_NAME StigmergyElection-PT-08a-CTLFireability-2025-00
FORMULA_NAME StigmergyElection-PT-08a-CTLFireability-2025-01
FORMULA_NAME StigmergyElection-PT-08a-CTLFireability-2025-02
FORMULA_NAME StigmergyElection-PT-08a-CTLFireability-2025-03
FORMULA_NAME StigmergyElection-PT-08a-CTLFireability-2025-04
FORMULA_NAME StigmergyElection-PT-08a-CTLFireability-2025-05
FORMULA_NAME StigmergyElection-PT-08a-CTLFireability-2025-06
FORMULA_NAME StigmergyElection-PT-08a-CTLFireability-2025-07
FORMULA_NAME StigmergyElection-PT-08a-CTLFireability-2025-08
FORMULA_NAME StigmergyElection-PT-08a-CTLFireability-2025-09
FORMULA_NAME StigmergyElection-PT-08a-CTLFireability-2025-10
FORMULA_NAME StigmergyElection-PT-08a-CTLFireability-2025-11
=== Now, execution of the tool begins
BK_START 1749164555789
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=StigmergyElection-PT-08a
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202505121319
[2025-06-05 23:02:38] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-05 23:02:38] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-05 23:02:40] [INFO ] Load time of PNML (sax parser for PT used): 959 ms
[2025-06-05 23:02:40] [INFO ] Transformed 114 places.
[2025-06-05 23:02:40] [INFO ] Transformed 6882 transitions.
[2025-06-05 23:02:40] [INFO ] Found NUPN structural information;
[2025-06-05 23:02:40] [INFO ] Parsed PT model containing 114 places and 6882 transitions and 107626 arcs in 1262 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 22 ms.
Ensure Unique test removed 6218 transitions
Reduce redundant transitions removed 6218 transitions.
Support contains 12 out of 114 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 114/114 places, 664/664 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 99 transition count 641
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 99 transition count 641
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 37 place count 92 transition count 627
Iterating global reduction 0 with 7 rules applied. Total rules applied 44 place count 92 transition count 627
Applied a total of 44 rules in 85 ms. Remains 92 /114 variables (removed 22) and now considering 627/664 (removed 37) transitions.
[2025-06-05 23:02:40] [INFO ] Flow matrix only has 618 transitions (discarded 9 similar events)
// Phase 1: matrix 618 rows 92 cols
[2025-06-05 23:02:40] [INFO ] Computed 2 invariants in 45 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 23:02:41] [INFO ] Implicit Places using invariants in 465 ms returned []
[2025-06-05 23:02:41] [INFO ] Flow matrix only has 618 transitions (discarded 9 similar events)
[2025-06-05 23:02:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 23:02:41] [INFO ] State equation strengthened by 549 read => feed constraints.
[2025-06-05 23:02:43] [INFO ] Implicit Places using invariants and state equation in 2164 ms returned []
Implicit Place search using SMT with State Equation took 2704 ms to find 0 implicit places.
Running 626 sub problems to find dead transitions.
[2025-06-05 23:02:43] [INFO ] Flow matrix only has 618 transitions (discarded 9 similar events)
[2025-06-05 23:02:43] [INFO ] Invariant cache hit.
[2025-06-05 23:02:43] [INFO ] State equation strengthened by 549 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 626 unsolved
At refinement iteration 1 (OVERLAPS) 1/92 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 626 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:02:55] [INFO ] Deduced a trap composed of 10 places in 426 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:02:56] [INFO ] Deduced a trap composed of 10 places in 383 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:02:56] [INFO ] Deduced a trap composed of 10 places in 385 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:02:56] [INFO ] Deduced a trap composed of 10 places in 331 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:02:57] [INFO ] Deduced a trap composed of 11 places in 324 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:02:57] [INFO ] Deduced a trap composed of 10 places in 392 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:02:57] [INFO ] Deduced a trap composed of 10 places in 341 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:02:58] [INFO ] Deduced a trap composed of 10 places in 335 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:02:58] [INFO ] Deduced a trap composed of 10 places in 279 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:02:58] [INFO ] Deduced a trap composed of 10 places in 267 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:02:59] [INFO ] Deduced a trap composed of 10 places in 286 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:02:59] [INFO ] Deduced a trap composed of 10 places in 322 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:02:59] [INFO ] Deduced a trap composed of 10 places in 270 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:03:00] [INFO ] Deduced a trap composed of 10 places in 322 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:03:00] [INFO ] Deduced a trap composed of 10 places in 232 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:03:00] [INFO ] Deduced a trap composed of 10 places in 180 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:03:00] [INFO ] Deduced a trap composed of 10 places in 168 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:03:00] [INFO ] Deduced a trap composed of 10 places in 194 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:03:01] [INFO ] Deduced a trap composed of 10 places in 192 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:03:01] [INFO ] Deduced a trap composed of 10 places in 182 ms of which 10 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 626 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:03:02] [INFO ] Deduced a trap composed of 10 places in 150 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:03:02] [INFO ] Deduced a trap composed of 10 places in 143 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:03:02] [INFO ] Deduced a trap composed of 10 places in 106 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:03:02] [INFO ] Deduced a trap composed of 10 places in 190 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:03:02] [INFO ] Deduced a trap composed of 10 places in 187 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:03:03] [INFO ] Deduced a trap composed of 11 places in 182 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:03:03] [INFO ] Deduced a trap composed of 12 places in 220 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:03:03] [INFO ] Deduced a trap composed of 10 places in 105 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:03:03] [INFO ] Deduced a trap composed of 10 places in 158 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:03:03] [INFO ] Deduced a trap composed of 10 places in 113 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:03:04] [INFO ] Deduced a trap composed of 10 places in 207 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:03:04] [INFO ] Deduced a trap composed of 10 places in 151 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:03:04] [INFO ] Deduced a trap composed of 12 places in 346 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:03:05] [INFO ] Deduced a trap composed of 12 places in 317 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:03:05] [INFO ] Deduced a trap composed of 12 places in 310 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:03:05] [INFO ] Deduced a trap composed of 12 places in 337 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:03:05] [INFO ] Deduced a trap composed of 10 places in 154 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:03:06] [INFO ] Deduced a trap composed of 10 places in 147 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:03:06] [INFO ] Deduced a trap composed of 12 places in 347 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:03:06] [INFO ] Deduced a trap composed of 12 places in 344 ms of which 22 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/92 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 626 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:03:10] [INFO ] Deduced a trap composed of 10 places in 174 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:03:10] [INFO ] Deduced a trap composed of 10 places in 175 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:03:11] [INFO ] Deduced a trap composed of 10 places in 172 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:03:11] [INFO ] Deduced a trap composed of 10 places in 199 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:03:11] [INFO ] Deduced a trap composed of 10 places in 148 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:03:11] [INFO ] Deduced a trap composed of 10 places in 199 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:03:11] [INFO ] Deduced a trap composed of 10 places in 189 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:03:11] [INFO ] Deduced a trap composed of 10 places in 156 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:03:12] [INFO ] Deduced a trap composed of 10 places in 149 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:03:12] [INFO ] Deduced a trap composed of 10 places in 117 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:03:12] [INFO ] Deduced a trap composed of 10 places in 248 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:03:12] [INFO ] Deduced a trap composed of 12 places in 286 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:03:13] [INFO ] Deduced a trap composed of 12 places in 286 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:03:13] [INFO ] Deduced a trap composed of 12 places in 266 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:03:13] [INFO ] Deduced a trap composed of 12 places in 270 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:03:13] [INFO ] Deduced a trap composed of 11 places in 272 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:03:14] [INFO ] Deduced a trap composed of 10 places in 143 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:03:14] [INFO ] Deduced a trap composed of 13 places in 66 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:03:14] [INFO ] Deduced a trap composed of 12 places in 396 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:03:15] [INFO ] Deduced a trap composed of 12 places in 372 ms of which 31 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/92 variables, 20/62 constraints. Problems are: Problem set: 0 solved, 626 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:03:15] [INFO ] Deduced a trap composed of 10 places in 148 ms of which 6 ms to minimize.
SMT process timed out in 32398ms, After SMT, problems are : Problem set: 0 solved, 626 unsolved
Search for dead transitions found 0 dead transitions in 32458ms
Starting structural reductions in LTL mode, iteration 1 : 92/114 places, 627/664 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 35295 ms. Remains : 92/114 places, 627/664 transitions.
Support contains 12 out of 92 places after structural reductions.
[2025-06-05 23:03:16] [INFO ] Flatten gal took : 225 ms
[2025-06-05 23:03:16] [INFO ] Flatten gal took : 156 ms
[2025-06-05 23:03:17] [INFO ] Input system was already deterministic with 627 transitions.
Reduction of identical properties reduced properties to check from 14 to 7
RANDOM walk for 40000 steps (19 resets) in 3783 ms. (10 steps per ms) remains 2/7 properties
BEST_FIRST walk for 40004 steps (13 resets) in 329 ms. (121 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (17 resets) in 137 ms. (289 steps per ms) remains 2/2 properties
[2025-06-05 23:03:18] [INFO ] Flow matrix only has 618 transitions (discarded 9 similar events)
[2025-06-05 23:03:18] [INFO ] Invariant cache hit.
[2025-06-05 23:03:18] [INFO ] State equation strengthened by 549 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
Problem AtomicPropp2 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 83/91 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/91 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1/92 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/92 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 617/709 variables, 92/94 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/709 variables, 548/642 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/709 variables, 0/642 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/710 variables, 1/643 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/710 variables, 0/643 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/710 variables, 0/643 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 710/710 variables, and 643 constraints, problems are : Problem set: 1 solved, 1 unsolved in 496 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 92/92 constraints, ReadFeed: 549/549 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
Problem AtomicPropp13 is UNSAT
After SMT solving in domain Int declared 91/710 variables, and 1 constraints, problems are : Problem set: 2 solved, 0 unsolved in 50 ms.
Refiners :[Positive P Invariants (semi-flows): 1/2 constraints, State Equation: 0/92 constraints, ReadFeed: 0/549 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 678ms problems are : Problem set: 2 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 3 atomic propositions for a total of 16 simplifications.
FORMULA StigmergyElection-PT-08a-CTLFireability-2023-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-06-05 23:03:19] [INFO ] Flatten gal took : 89 ms
[2025-06-05 23:03:19] [INFO ] Flatten gal took : 92 ms
[2025-06-05 23:03:19] [INFO ] Input system was already deterministic with 627 transitions.
Computed a total of 18 stabilizing places and 17 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 92/92 places, 627/627 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 91 transition count 625
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 91 transition count 625
Applied a total of 2 rules in 13 ms. Remains 91 /92 variables (removed 1) and now considering 625/627 (removed 2) transitions.
[2025-06-05 23:03:19] [INFO ] Flow matrix only has 616 transitions (discarded 9 similar events)
// Phase 1: matrix 616 rows 91 cols
[2025-06-05 23:03:19] [INFO ] Computed 2 invariants in 9 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 23:03:19] [INFO ] Implicit Places using invariants in 96 ms returned []
[2025-06-05 23:03:19] [INFO ] Flow matrix only has 616 transitions (discarded 9 similar events)
[2025-06-05 23:03:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 23:03:20] [INFO ] State equation strengthened by 549 read => feed constraints.
[2025-06-05 23:03:22] [INFO ] Implicit Places using invariants and state equation in 3079 ms returned [90]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 3179 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 90/92 places, 625/627 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 74 transition count 609
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 74 transition count 609
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 40 place count 66 transition count 601
Iterating global reduction 0 with 8 rules applied. Total rules applied 48 place count 66 transition count 601
Applied a total of 48 rules in 16 ms. Remains 66 /90 variables (removed 24) and now considering 601/625 (removed 24) transitions.
[2025-06-05 23:03:22] [INFO ] Flow matrix only has 592 transitions (discarded 9 similar events)
// Phase 1: matrix 592 rows 66 cols
[2025-06-05 23:03:22] [INFO ] Computed 1 invariants in 6 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 23:03:22] [INFO ] Implicit Places using invariants in 50 ms returned []
[2025-06-05 23:03:22] [INFO ] Flow matrix only has 592 transitions (discarded 9 similar events)
[2025-06-05 23:03:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 23:03:23] [INFO ] State equation strengthened by 517 read => feed constraints.
[2025-06-05 23:03:23] [INFO ] Implicit Places using invariants and state equation in 406 ms returned []
Implicit Place search using SMT with State Equation took 471 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 66/92 places, 601/627 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 3680 ms. Remains : 66/92 places, 601/627 transitions.
[2025-06-05 23:03:23] [INFO ] Flatten gal took : 77 ms
[2025-06-05 23:03:23] [INFO ] Flatten gal took : 72 ms
[2025-06-05 23:03:23] [INFO ] Input system was already deterministic with 601 transitions.
[2025-06-05 23:03:23] [INFO ] Flatten gal took : 71 ms
[2025-06-05 23:03:23] [INFO ] Flatten gal took : 64 ms
[2025-06-05 23:03:23] [INFO ] Time to serialize gal into /tmp/CTLFireability2712841636133888306.gal : 64 ms
[2025-06-05 23:03:23] [INFO ] Time to serialize properties into /tmp/CTLFireability1747921768449905846.ctl : 6 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability2712841636133888306.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1747921768449905846.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,397202,3.45569,67872,2,4225,5,68299,6,0,856,43711,0
Converting to forward existential form...Done !
original formula: AG((AG(((((p12==1)&&(p26==1))&&((p40==1)&&(p54==1)))&&(((p68==1)&&(p82==1))&&((p96==1)&&(p110==1))))) + AX(((((p12==0)||(p26==0))||((p40=...221
=> equivalent forward existential formula: [(EY((FwdU(Init,TRUE) * !(!(E(TRUE U !(((((p12==1)&&(p26==1))&&((p40==1)&&(p54==1)))&&(((p68==1)&&(p82==1))&&((p...290
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t4, t6, t8, t9, t11, t13, t14, t16, t18, t19, t21, t23, t24, t26, t28, t29, t31, t33,...364
(forward)formula 0,0,10.2288,164384,1,0,693,236315,1216,88,21706,148488,1204
FORMULA StigmergyElection-PT-08a-CTLFireability-2025-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 92/92 places, 627/627 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 91 transition count 625
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 91 transition count 625
Applied a total of 2 rules in 11 ms. Remains 91 /92 variables (removed 1) and now considering 625/627 (removed 2) transitions.
[2025-06-05 23:03:34] [INFO ] Flow matrix only has 616 transitions (discarded 9 similar events)
// Phase 1: matrix 616 rows 91 cols
[2025-06-05 23:03:34] [INFO ] Computed 2 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 23:03:34] [INFO ] Implicit Places using invariants in 91 ms returned []
[2025-06-05 23:03:34] [INFO ] Flow matrix only has 616 transitions (discarded 9 similar events)
[2025-06-05 23:03:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 23:03:34] [INFO ] State equation strengthened by 549 read => feed constraints.
[2025-06-05 23:03:37] [INFO ] Implicit Places using invariants and state equation in 2748 ms returned [90]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 2854 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 90/92 places, 625/627 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 74 transition count 609
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 74 transition count 609
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 40 place count 66 transition count 601
Iterating global reduction 0 with 8 rules applied. Total rules applied 48 place count 66 transition count 601
Applied a total of 48 rules in 12 ms. Remains 66 /90 variables (removed 24) and now considering 601/625 (removed 24) transitions.
[2025-06-05 23:03:37] [INFO ] Flow matrix only has 592 transitions (discarded 9 similar events)
// Phase 1: matrix 592 rows 66 cols
[2025-06-05 23:03:37] [INFO ] Computed 1 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 23:03:37] [INFO ] Implicit Places using invariants in 39 ms returned []
[2025-06-05 23:03:37] [INFO ] Flow matrix only has 592 transitions (discarded 9 similar events)
[2025-06-05 23:03:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 23:03:37] [INFO ] State equation strengthened by 517 read => feed constraints.
[2025-06-05 23:03:37] [INFO ] Implicit Places using invariants and state equation in 259 ms returned []
Implicit Place search using SMT with State Equation took 302 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 66/92 places, 601/627 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 3179 ms. Remains : 66/92 places, 601/627 transitions.
[2025-06-05 23:03:37] [INFO ] Flatten gal took : 35 ms
[2025-06-05 23:03:37] [INFO ] Flatten gal took : 35 ms
[2025-06-05 23:03:37] [INFO ] Input system was already deterministic with 601 transitions.
[2025-06-05 23:03:37] [INFO ] Flatten gal took : 43 ms
[2025-06-05 23:03:37] [INFO ] Flatten gal took : 43 ms
[2025-06-05 23:03:37] [INFO ] Time to serialize gal into /tmp/CTLFireability16228816453405369430.gal : 17 ms
[2025-06-05 23:03:37] [INFO ] Time to serialize properties into /tmp/CTLFireability6370357063795684735.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability16228816453405369430.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6370357063795684735.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,397202,3.34453,67920,2,4225,5,68299,6,0,856,43711,0
Converting to forward existential form...Done !
original formula: AG(((AX(EF(((((p12==1)&&(p26==1))&&((p40==1)&&(p54==1)))&&(((p68==1)&&(p82==1))&&((p96==1)&&(p110==1)))))) * !(A(!(AF(((((p12==1)&&(p26==...631
=> equivalent forward existential formula: (([(EY(FwdU(Init,TRUE)) * !(E(TRUE U ((((p12==1)&&(p26==1))&&((p40==1)&&(p54==1)))&&(((p68==1)&&(p82==1))&&((p96...1252
(forward)formula 0,0,3.35406,67920,1,0,7,68299,9,2,903,43711,1
FORMULA StigmergyElection-PT-08a-CTLFireability-2025-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 92/92 places, 627/627 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 91 transition count 625
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 91 transition count 625
Applied a total of 2 rules in 9 ms. Remains 91 /92 variables (removed 1) and now considering 625/627 (removed 2) transitions.
[2025-06-05 23:03:41] [INFO ] Flow matrix only has 616 transitions (discarded 9 similar events)
// Phase 1: matrix 616 rows 91 cols
[2025-06-05 23:03:41] [INFO ] Computed 2 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 23:03:41] [INFO ] Implicit Places using invariants in 80 ms returned []
[2025-06-05 23:03:41] [INFO ] Flow matrix only has 616 transitions (discarded 9 similar events)
[2025-06-05 23:03:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 23:03:41] [INFO ] State equation strengthened by 549 read => feed constraints.
[2025-06-05 23:03:44] [INFO ] Implicit Places using invariants and state equation in 2871 ms returned [90]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 2962 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 90/92 places, 625/627 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 74 transition count 609
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 74 transition count 609
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 40 place count 66 transition count 601
Iterating global reduction 0 with 8 rules applied. Total rules applied 48 place count 66 transition count 601
Applied a total of 48 rules in 18 ms. Remains 66 /90 variables (removed 24) and now considering 601/625 (removed 24) transitions.
[2025-06-05 23:03:44] [INFO ] Flow matrix only has 592 transitions (discarded 9 similar events)
// Phase 1: matrix 592 rows 66 cols
[2025-06-05 23:03:44] [INFO ] Computed 1 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 23:03:44] [INFO ] Implicit Places using invariants in 44 ms returned []
[2025-06-05 23:03:44] [INFO ] Flow matrix only has 592 transitions (discarded 9 similar events)
[2025-06-05 23:03:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 23:03:44] [INFO ] State equation strengthened by 517 read => feed constraints.
[2025-06-05 23:03:44] [INFO ] Implicit Places using invariants and state equation in 324 ms returned []
Implicit Place search using SMT with State Equation took 371 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 66/92 places, 601/627 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 3362 ms. Remains : 66/92 places, 601/627 transitions.
[2025-06-05 23:03:44] [INFO ] Flatten gal took : 51 ms
[2025-06-05 23:03:44] [INFO ] Flatten gal took : 59 ms
[2025-06-05 23:03:44] [INFO ] Input system was already deterministic with 601 transitions.
[2025-06-05 23:03:44] [INFO ] Flatten gal took : 58 ms
[2025-06-05 23:03:44] [INFO ] Flatten gal took : 55 ms
[2025-06-05 23:03:44] [INFO ] Time to serialize gal into /tmp/CTLFireability2989665713374152663.gal : 11 ms
[2025-06-05 23:03:44] [INFO ] Time to serialize properties into /tmp/CTLFireability372671658296260709.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability2989665713374152663.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability372671658296260709.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...282
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,397202,3.57608,67924,2,4225,5,68299,6,0,856,43711,0
Converting to forward existential form...Done !
original formula: A(!(EG((EG(((((p12==1)&&(p26==1))&&((p40==1)&&(p54==1)))&&(((p68==1)&&(p82==1))&&((p96==1)&&(p110==1))))) + AF(((((p12==1)&&(p26==1))&&((...433
=> equivalent forward existential formula: [((Init * !(EG(!(!(EX(!(EG(!(E(((((p12==1)&&(p26==1))&&((p40==1)&&(p54==1)))&&(((p68==1)&&(p82==1))&&((p96==1)&&...940
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t4, t6, t8, t9, t11, t13, t14, t16, t18, t19, t21, t23, t24, t26, t28, t29, t31, t33,...364
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,0,11.4877,194368,1,0,802,360909,1231,151,21348,237057,1364
FORMULA StigmergyElection-PT-08a-CTLFireability-2025-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 92/92 places, 627/627 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 91 transition count 625
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 91 transition count 625
Applied a total of 2 rules in 7 ms. Remains 91 /92 variables (removed 1) and now considering 625/627 (removed 2) transitions.
[2025-06-05 23:03:56] [INFO ] Flow matrix only has 616 transitions (discarded 9 similar events)
// Phase 1: matrix 616 rows 91 cols
[2025-06-05 23:03:56] [INFO ] Computed 2 invariants in 6 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 23:03:56] [INFO ] Implicit Places using invariants in 113 ms returned []
[2025-06-05 23:03:56] [INFO ] Flow matrix only has 616 transitions (discarded 9 similar events)
[2025-06-05 23:03:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 23:03:56] [INFO ] State equation strengthened by 549 read => feed constraints.
[2025-06-05 23:03:59] [INFO ] Implicit Places using invariants and state equation in 3257 ms returned [90]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 3378 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 90/92 places, 625/627 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 74 transition count 609
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 74 transition count 609
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 40 place count 66 transition count 601
Iterating global reduction 0 with 8 rules applied. Total rules applied 48 place count 66 transition count 601
Applied a total of 48 rules in 13 ms. Remains 66 /90 variables (removed 24) and now considering 601/625 (removed 24) transitions.
[2025-06-05 23:03:59] [INFO ] Flow matrix only has 592 transitions (discarded 9 similar events)
// Phase 1: matrix 592 rows 66 cols
[2025-06-05 23:03:59] [INFO ] Computed 1 invariants in 10 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 23:03:59] [INFO ] Implicit Places using invariants in 50 ms returned []
[2025-06-05 23:03:59] [INFO ] Flow matrix only has 592 transitions (discarded 9 similar events)
[2025-06-05 23:03:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 23:04:00] [INFO ] State equation strengthened by 517 read => feed constraints.
[2025-06-05 23:04:00] [INFO ] Implicit Places using invariants and state equation in 386 ms returned []
Implicit Place search using SMT with State Equation took 440 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 66/92 places, 601/627 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 3840 ms. Remains : 66/92 places, 601/627 transitions.
[2025-06-05 23:04:00] [INFO ] Flatten gal took : 65 ms
[2025-06-05 23:04:00] [INFO ] Flatten gal took : 48 ms
[2025-06-05 23:04:00] [INFO ] Input system was already deterministic with 601 transitions.
[2025-06-05 23:04:00] [INFO ] Flatten gal took : 48 ms
[2025-06-05 23:04:00] [INFO ] Flatten gal took : 50 ms
[2025-06-05 23:04:00] [INFO ] Time to serialize gal into /tmp/CTLFireability557101605199459408.gal : 11 ms
[2025-06-05 23:04:00] [INFO ] Time to serialize properties into /tmp/CTLFireability13146681231468823038.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability557101605199459408.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13146681231468823038.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,397202,3.84796,68048,2,4225,5,68299,6,0,856,43711,0
Converting to forward existential form...Done !
original formula: E(AX(E((EF(((((p12==1)&&(p26==1))&&((p40==1)&&(p54==1)))&&(((p68==1)&&(p82==1))&&((p96==1)&&(p110==1))))) + !(AG(((((p12==1)&&(p26==1))&&...637
=> equivalent forward existential formula: [FwdG(EY((FwdU(Init,!(EX(!(E((E(TRUE U ((((p12==1)&&(p26==1))&&((p40==1)&&(p54==1)))&&(((p68==1)&&(p82==1))&&((p...714
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t4, t6, t8, t9, t11, t13, t14, t16, t18, t19, t21, t23, t24, t26, t28, t29, t31, t33,...364
(forward)formula 0,0,11.9324,187676,1,0,708,257508,1222,87,21459,165165,1220
FORMULA StigmergyElection-PT-08a-CTLFireability-2025-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 92/92 places, 627/627 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 91 transition count 625
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 91 transition count 625
Applied a total of 2 rules in 7 ms. Remains 91 /92 variables (removed 1) and now considering 625/627 (removed 2) transitions.
[2025-06-05 23:04:12] [INFO ] Flow matrix only has 616 transitions (discarded 9 similar events)
// Phase 1: matrix 616 rows 91 cols
[2025-06-05 23:04:12] [INFO ] Computed 2 invariants in 18 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 23:04:12] [INFO ] Implicit Places using invariants in 125 ms returned []
[2025-06-05 23:04:12] [INFO ] Flow matrix only has 616 transitions (discarded 9 similar events)
[2025-06-05 23:04:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 23:04:13] [INFO ] State equation strengthened by 549 read => feed constraints.
[2025-06-05 23:04:16] [INFO ] Implicit Places using invariants and state equation in 3487 ms returned [90]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 3628 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 90/92 places, 625/627 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 74 transition count 609
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 74 transition count 609
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 40 place count 66 transition count 601
Iterating global reduction 0 with 8 rules applied. Total rules applied 48 place count 66 transition count 601
Applied a total of 48 rules in 16 ms. Remains 66 /90 variables (removed 24) and now considering 601/625 (removed 24) transitions.
[2025-06-05 23:04:16] [INFO ] Flow matrix only has 592 transitions (discarded 9 similar events)
// Phase 1: matrix 592 rows 66 cols
[2025-06-05 23:04:16] [INFO ] Computed 1 invariants in 6 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 23:04:16] [INFO ] Implicit Places using invariants in 47 ms returned []
[2025-06-05 23:04:16] [INFO ] Flow matrix only has 592 transitions (discarded 9 similar events)
[2025-06-05 23:04:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 23:04:16] [INFO ] State equation strengthened by 517 read => feed constraints.
[2025-06-05 23:04:16] [INFO ] Implicit Places using invariants and state equation in 320 ms returned []
Implicit Place search using SMT with State Equation took 371 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 66/92 places, 601/627 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 4022 ms. Remains : 66/92 places, 601/627 transitions.
[2025-06-05 23:04:16] [INFO ] Flatten gal took : 42 ms
[2025-06-05 23:04:16] [INFO ] Flatten gal took : 50 ms
[2025-06-05 23:04:16] [INFO ] Input system was already deterministic with 601 transitions.
[2025-06-05 23:04:16] [INFO ] Flatten gal took : 47 ms
[2025-06-05 23:04:16] [INFO ] Flatten gal took : 49 ms
[2025-06-05 23:04:16] [INFO ] Time to serialize gal into /tmp/CTLFireability14205175425441202797.gal : 11 ms
[2025-06-05 23:04:16] [INFO ] Time to serialize properties into /tmp/CTLFireability7532047789543206414.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability14205175425441202797.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7532047789543206414.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,397202,3.76713,68056,2,4225,5,68299,6,0,856,43711,0
Converting to forward existential form...Done !
original formula: EX((((((p12==0)||(p26==0))||((p40==0)||(p54==0)))||(((p68==0)||(p82==0))||((p96==0)||(p110==0)))) * ((A(((((p12==1)&&(p26==1))&&((p40==1)...512
=> equivalent forward existential formula: (([(((EY(Init) * ((((p12==0)||(p26==0))||((p40==0)||(p54==0)))||(((p68==0)||(p82==0))||((p96==0)||(p110==0))))) ...1025
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t4, t6, t8, t9, t11, t13, t14, t16, t18, t19, t21, t23, t24, t26, t28, t29, t31, t33,...364
(forward)formula 0,1,11.9431,191908,1,0,789,354535,1218,125,22044,227786,1325
FORMULA StigmergyElection-PT-08a-CTLFireability-2025-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 92/92 places, 627/627 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 91 transition count 625
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 91 transition count 625
Applied a total of 2 rules in 5 ms. Remains 91 /92 variables (removed 1) and now considering 625/627 (removed 2) transitions.
[2025-06-05 23:04:29] [INFO ] Flow matrix only has 616 transitions (discarded 9 similar events)
// Phase 1: matrix 616 rows 91 cols
[2025-06-05 23:04:29] [INFO ] Computed 2 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 23:04:29] [INFO ] Implicit Places using invariants in 133 ms returned []
[2025-06-05 23:04:29] [INFO ] Flow matrix only has 616 transitions (discarded 9 similar events)
[2025-06-05 23:04:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 23:04:29] [INFO ] State equation strengthened by 549 read => feed constraints.
[2025-06-05 23:04:32] [INFO ] Implicit Places using invariants and state equation in 3060 ms returned [90]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 3196 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 90/92 places, 625/627 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 74 transition count 609
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 74 transition count 609
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 40 place count 66 transition count 601
Iterating global reduction 0 with 8 rules applied. Total rules applied 48 place count 66 transition count 601
Applied a total of 48 rules in 7 ms. Remains 66 /90 variables (removed 24) and now considering 601/625 (removed 24) transitions.
[2025-06-05 23:04:32] [INFO ] Flow matrix only has 592 transitions (discarded 9 similar events)
// Phase 1: matrix 592 rows 66 cols
[2025-06-05 23:04:32] [INFO ] Computed 1 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 23:04:32] [INFO ] Implicit Places using invariants in 42 ms returned []
[2025-06-05 23:04:32] [INFO ] Flow matrix only has 592 transitions (discarded 9 similar events)
[2025-06-05 23:04:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 23:04:32] [INFO ] State equation strengthened by 517 read => feed constraints.
[2025-06-05 23:04:32] [INFO ] Implicit Places using invariants and state equation in 275 ms returned []
Implicit Place search using SMT with State Equation took 318 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 66/92 places, 601/627 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 3529 ms. Remains : 66/92 places, 601/627 transitions.
[2025-06-05 23:04:32] [INFO ] Flatten gal took : 40 ms
[2025-06-05 23:04:32] [INFO ] Flatten gal took : 45 ms
[2025-06-05 23:04:32] [INFO ] Input system was already deterministic with 601 transitions.
[2025-06-05 23:04:32] [INFO ] Flatten gal took : 45 ms
[2025-06-05 23:04:32] [INFO ] Flatten gal took : 46 ms
[2025-06-05 23:04:32] [INFO ] Time to serialize gal into /tmp/CTLFireability13871689004593594417.gal : 9 ms
[2025-06-05 23:04:32] [INFO ] Time to serialize properties into /tmp/CTLFireability5206492188899676526.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability13871689004593594417.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5206492188899676526.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,397202,3.78663,67928,2,4225,5,68299,6,0,856,43711,0
Converting to forward existential form...Done !
original formula: EF(((EG(!(E(EF(((((p12==1)&&(p26==1))&&((p40==1)&&(p54==1)))&&(((p68==1)&&(p82==1))&&((p96==1)&&(p110==1))))) U ((((p12==1)&&(p26==1))&&(...530
=> equivalent forward existential formula: (((([((FwdU(Init,TRUE) * (EG(!(E(E(TRUE U ((((p12==1)&&(p26==1))&&((p40==1)&&(p54==1)))&&(((p68==1)&&(p82==1))&&...2012
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t4, t6, t8, t9, t11, t13, t14, t16, t18, t19, t21, t23, t24, t26, t28, t29, t31, t33,...364
Detected timeout of ITS tools.
[2025-06-05 23:05:02] [INFO ] Flatten gal took : 27 ms
[2025-06-05 23:05:02] [INFO ] Applying decomposition
[2025-06-05 23:05:02] [INFO ] Flatten gal took : 28 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph15632247507958289113.txt' '-o' '/tmp/graph15632247507958289113.bin' '-w' '/tmp/graph15632247507958289113.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph15632247507958289113.bin' '-l' '-1' '-v' '-w' '/tmp/graph15632247507958289113.weights' '-q' '0' '-e' '0.001'
[2025-06-05 23:05:03] [INFO ] Decomposing Gal with order
[2025-06-05 23:05:03] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-05 23:05:03] [INFO ] Removed a total of 4126 redundant transitions.
[2025-06-05 23:05:03] [INFO ] Flatten gal took : 368 ms
[2025-06-05 23:05:03] [INFO ] Fuse similar labels procedure discarded/fused a total of 12 labels/synchronizations in 87 ms.
[2025-06-05 23:05:03] [INFO ] Time to serialize gal into /tmp/CTLFireability13866028332942184091.gal : 15 ms
[2025-06-05 23:05:03] [INFO ] Time to serialize properties into /tmp/CTLFireability12968786695072503.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability13866028332942184091.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12968786695072503.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...261
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,397202,0.139393,7448,694,27,3984,176,852,5994,49,432,0
Converting to forward existential form...Done !
original formula: EF(((EG(!(E(EF(((((i0.i0.u3.p12==1)&&(i0.i1.u1.p26==1))&&((i2.i1.u9.p40==1)&&(u11.p54==1)))&&(((i2.i2.u14.p68==1)&&(i0.i2.u17.p82==1))&&(...850
=> equivalent forward existential formula: (((([((FwdU(Init,TRUE) * (EG(!(E(E(TRUE U ((((i0.i0.u3.p12==1)&&(i0.i1.u1.p26==1))&&((i2.i1.u9.p40==1)&&(u11.p54...3100
Reverse transition relation is NOT exact ! Due to transitions t585, t587, t589, t591, t593, t595, t597, t599, u11.t23, u11.t24, u20.t3, u20.t4, i0.i0.t38, ...467
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
(forward)formula 0,0,2.25698,88216,1,0,133022,315,7938,641387,228,858,166452
FORMULA StigmergyElection-PT-08a-CTLFireability-2025-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 92/92 places, 627/627 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 91 transition count 625
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 91 transition count 625
Applied a total of 2 rules in 5 ms. Remains 91 /92 variables (removed 1) and now considering 625/627 (removed 2) transitions.
[2025-06-05 23:05:06] [INFO ] Flow matrix only has 616 transitions (discarded 9 similar events)
// Phase 1: matrix 616 rows 91 cols
[2025-06-05 23:05:06] [INFO ] Computed 2 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 23:05:06] [INFO ] Implicit Places using invariants in 238 ms returned []
[2025-06-05 23:05:06] [INFO ] Flow matrix only has 616 transitions (discarded 9 similar events)
[2025-06-05 23:05:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 23:05:06] [INFO ] State equation strengthened by 549 read => feed constraints.
[2025-06-05 23:05:09] [INFO ] Implicit Places using invariants and state equation in 2841 ms returned [90]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 3083 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 90/92 places, 625/627 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 74 transition count 609
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 74 transition count 609
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 40 place count 66 transition count 601
Iterating global reduction 0 with 8 rules applied. Total rules applied 48 place count 66 transition count 601
Applied a total of 48 rules in 9 ms. Remains 66 /90 variables (removed 24) and now considering 601/625 (removed 24) transitions.
[2025-06-05 23:05:09] [INFO ] Flow matrix only has 592 transitions (discarded 9 similar events)
// Phase 1: matrix 592 rows 66 cols
[2025-06-05 23:05:09] [INFO ] Computed 1 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 23:05:09] [INFO ] Implicit Places using invariants in 54 ms returned []
[2025-06-05 23:05:09] [INFO ] Flow matrix only has 592 transitions (discarded 9 similar events)
[2025-06-05 23:05:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 23:05:09] [INFO ] State equation strengthened by 517 read => feed constraints.
[2025-06-05 23:05:09] [INFO ] Implicit Places using invariants and state equation in 385 ms returned []
Implicit Place search using SMT with State Equation took 442 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 66/92 places, 601/627 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 3540 ms. Remains : 66/92 places, 601/627 transitions.
[2025-06-05 23:05:09] [INFO ] Flatten gal took : 53 ms
[2025-06-05 23:05:09] [INFO ] Flatten gal took : 59 ms
[2025-06-05 23:05:10] [INFO ] Input system was already deterministic with 601 transitions.
[2025-06-05 23:05:10] [INFO ] Flatten gal took : 50 ms
[2025-06-05 23:05:10] [INFO ] Flatten gal took : 50 ms
[2025-06-05 23:05:10] [INFO ] Time to serialize gal into /tmp/CTLFireability7837695214234882616.gal : 11 ms
[2025-06-05 23:05:10] [INFO ] Time to serialize properties into /tmp/CTLFireability12526887739633527240.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability7837695214234882616.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12526887739633527240.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,397202,3.58563,67916,2,4225,5,68299,6,0,856,43711,0
Converting to forward existential form...Done !
original formula: (AG(((((((EF(((((p12==0)||(p26==0))||((p40==0)||(p54==0)))||(((p68==0)||(p82==0))||((p96==0)||(p110==0))))) * (AG(((((p12==1)&&(p26==1))&...1424
=> equivalent forward existential formula: [(((EY((Init * !(!(E(TRUE U !(((((((E(TRUE U ((((p12==0)||(p26==0))||((p40==0)||(p54==0)))||(((p68==0)||(p82==0)...2563
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t4, t6, t8, t9, t11, t13, t14, t16, t18, t19, t21, t23, t24, t26, t28, t29, t31, t33,...364
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,1,24.2159,452796,1,0,905,617178,1237,209,21023,367387,1481
FORMULA StigmergyElection-PT-08a-CTLFireability-2025-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 92/92 places, 627/627 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 17 rules applied. Total rules applied 17 place count 90 transition count 610
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 33 place count 74 transition count 610
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 33 place count 74 transition count 600
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 53 place count 64 transition count 600
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 69 place count 48 transition count 583
Iterating global reduction 2 with 16 rules applied. Total rules applied 85 place count 48 transition count 583
Ensure Unique test removed 255 transitions
Reduce isomorphic transitions removed 255 transitions.
Iterating post reduction 2 with 255 rules applied. Total rules applied 340 place count 48 transition count 328
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 340 place count 48 transition count 321
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 354 place count 41 transition count 321
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 3 with 8 rules applied. Total rules applied 362 place count 41 transition count 313
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 378 place count 33 transition count 305
Applied a total of 378 rules in 197 ms. Remains 33 /92 variables (removed 59) and now considering 305/627 (removed 322) transitions.
[2025-06-05 23:05:34] [INFO ] Flow matrix only has 296 transitions (discarded 9 similar events)
// Phase 1: matrix 296 rows 33 cols
[2025-06-05 23:05:34] [INFO ] Computed 1 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 23:05:34] [INFO ] Implicit Places using invariants in 54 ms returned []
[2025-06-05 23:05:34] [INFO ] Flow matrix only has 296 transitions (discarded 9 similar events)
[2025-06-05 23:05:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 23:05:35] [INFO ] State equation strengthened by 263 read => feed constraints.
[2025-06-05 23:05:35] [INFO ] Implicit Places using invariants and state equation in 276 ms returned []
Implicit Place search using SMT with State Equation took 351 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 23:05:35] [INFO ] Redundant transitions in 31 ms returned []
Running 297 sub problems to find dead transitions.
[2025-06-05 23:05:35] [INFO ] Flow matrix only has 296 transitions (discarded 9 similar events)
[2025-06-05 23:05:35] [INFO ] Invariant cache hit.
[2025-06-05 23:05:35] [INFO ] State equation strengthened by 263 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 1 (OVERLAPS) 8/33 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 297 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:05:38] [INFO ] Deduced a trap composed of 5 places in 64 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:05:38] [INFO ] Deduced a trap composed of 5 places in 59 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:05:38] [INFO ] Deduced a trap composed of 5 places in 58 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:05:38] [INFO ] Deduced a trap composed of 4 places in 55 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:05:38] [INFO ] Deduced a trap composed of 4 places in 54 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:05:38] [INFO ] Deduced a trap composed of 4 places in 55 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:05:38] [INFO ] Deduced a trap composed of 4 places in 57 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:05:38] [INFO ] Deduced a trap composed of 5 places in 42 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:05:38] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:05:38] [INFO ] Deduced a trap composed of 4 places in 90 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:05:39] [INFO ] Deduced a trap composed of 4 places in 139 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:05:39] [INFO ] Deduced a trap composed of 4 places in 120 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:05:39] [INFO ] Deduced a trap composed of 4 places in 112 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:05:39] [INFO ] Deduced a trap composed of 4 places in 142 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:05:39] [INFO ] Deduced a trap composed of 4 places in 145 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:05:39] [INFO ] Deduced a trap composed of 4 places in 182 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:05:39] [INFO ] Deduced a trap composed of 4 places in 152 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:05:40] [INFO ] Deduced a trap composed of 4 places in 112 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:05:40] [INFO ] Deduced a trap composed of 4 places in 110 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:05:40] [INFO ] Deduced a trap composed of 4 places in 96 ms of which 6 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/33 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 297 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:05:40] [INFO ] Deduced a trap composed of 5 places in 31 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:05:40] [INFO ] Deduced a trap composed of 5 places in 40 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:05:40] [INFO ] Deduced a trap composed of 5 places in 41 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:05:40] [INFO ] Deduced a trap composed of 5 places in 34 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:05:40] [INFO ] Deduced a trap composed of 4 places in 51 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:05:40] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:05:40] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:05:40] [INFO ] Deduced a trap composed of 4 places in 101 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:05:40] [INFO ] Deduced a trap composed of 4 places in 72 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:05:41] [INFO ] Deduced a trap composed of 4 places in 54 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:05:41] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:05:41] [INFO ] Deduced a trap composed of 4 places in 87 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:05:41] [INFO ] Deduced a trap composed of 4 places in 66 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:05:41] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:05:41] [INFO ] Deduced a trap composed of 4 places in 46 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:05:41] [INFO ] Deduced a trap composed of 4 places in 123 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:05:41] [INFO ] Deduced a trap composed of 4 places in 96 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:05:41] [INFO ] Deduced a trap composed of 4 places in 96 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:05:41] [INFO ] Deduced a trap composed of 4 places in 81 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:05:41] [INFO ] Deduced a trap composed of 4 places in 47 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/33 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 297 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:05:42] [INFO ] Deduced a trap composed of 4 places in 50 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:05:42] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:05:42] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:05:42] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:05:42] [INFO ] Deduced a trap composed of 4 places in 50 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:05:43] [INFO ] Deduced a trap composed of 4 places in 142 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:05:43] [INFO ] Deduced a trap composed of 4 places in 126 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:05:43] [INFO ] Deduced a trap composed of 4 places in 111 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:05:43] [INFO ] Deduced a trap composed of 4 places in 85 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:05:43] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:05:43] [INFO ] Deduced a trap composed of 4 places in 85 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:05:43] [INFO ] Deduced a trap composed of 4 places in 65 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 12/53 constraints. Problems are: Problem set: 0 solved, 297 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:05:44] [INFO ] Deduced a trap composed of 4 places in 76 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:05:44] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:05:44] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/33 variables, 3/56 constraints. Problems are: Problem set: 0 solved, 297 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:05:46] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:05:46] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:05:46] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:05:46] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:05:46] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:05:46] [INFO ] Deduced a trap composed of 4 places in 93 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/33 variables, 6/62 constraints. Problems are: Problem set: 0 solved, 297 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:05:48] [INFO ] Deduced a trap composed of 4 places in 64 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:05:48] [INFO ] Deduced a trap composed of 4 places in 65 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:05:48] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/33 variables, 3/65 constraints. Problems are: Problem set: 0 solved, 297 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:05:49] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:05:49] [INFO ] Deduced a trap composed of 4 places in 64 ms of which 4 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/33 variables, 2/67 constraints. Problems are: Problem set: 0 solved, 297 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:05:50] [INFO ] Deduced a trap composed of 4 places in 103 ms of which 6 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/33 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/33 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 11 (OVERLAPS) 295/328 variables, 33/101 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/328 variables, 262/363 constraints. Problems are: Problem set: 0 solved, 297 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:05:57] [INFO ] Deduced a trap composed of 4 places in 68 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:05:57] [INFO ] Deduced a trap composed of 4 places in 106 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:05:58] [INFO ] Deduced a trap composed of 4 places in 105 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:05:58] [INFO ] Deduced a trap composed of 4 places in 100 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:05:58] [INFO ] Deduced a trap composed of 4 places in 102 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:05:58] [INFO ] Deduced a trap composed of 4 places in 89 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:05:58] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:05:58] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:05:58] [INFO ] Deduced a trap composed of 4 places in 78 ms of which 5 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/328 variables, 9/372 constraints. Problems are: Problem set: 0 solved, 297 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:06:03] [INFO ] Deduced a trap composed of 4 places in 52 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 328/329 variables, and 373 constraints, problems are : Problem set: 0 solved, 297 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 33/33 constraints, ReadFeed: 262/263 constraints, PredecessorRefiner: 297/33 constraints, Known Traps: 77/77 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 297 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 1 (OVERLAPS) 8/33 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/33 variables, 77/78 constraints. Problems are: Problem set: 0 solved, 297 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:06:08] [INFO ] Deduced a trap composed of 4 places in 70 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:06:08] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:06:08] [INFO ] Deduced a trap composed of 4 places in 55 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:06:08] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:06:08] [INFO ] Deduced a trap composed of 4 places in 64 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:06:08] [INFO ] Deduced a trap composed of 4 places in 69 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/33 variables, 6/84 constraints. Problems are: Problem set: 0 solved, 297 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:06:10] [INFO ] Deduced a trap composed of 4 places in 84 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:06:10] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:06:10] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 3/87 constraints. Problems are: Problem set: 0 solved, 297 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:06:12] [INFO ] Deduced a trap composed of 4 places in 67 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/33 variables, 1/88 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/33 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 7 (OVERLAPS) 295/328 variables, 33/121 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/328 variables, 262/383 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/328 variables, 33/416 constraints. Problems are: Problem set: 0 solved, 297 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 328/329 variables, and 416 constraints, problems are : Problem set: 0 solved, 297 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 33/33 constraints, ReadFeed: 262/263 constraints, PredecessorRefiner: 297/33 constraints, Known Traps: 87/87 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60833ms problems are : Problem set: 0 solved, 297 unsolved
Search for dead transitions found 0 dead transitions in 60836ms
Starting structural reductions in SI_CTL mode, iteration 1 : 33/92 places, 305/627 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 61425 ms. Remains : 33/92 places, 305/627 transitions.
[2025-06-05 23:06:35] [INFO ] Flatten gal took : 25 ms
[2025-06-05 23:06:36] [INFO ] Flatten gal took : 39 ms
[2025-06-05 23:06:36] [INFO ] Input system was already deterministic with 305 transitions.
RANDOM walk for 32 steps (0 resets) in 5 ms. (5 steps per ms) remains 0/1 properties
FORMULA StigmergyElection-PT-08a-CTLFireability-2025-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2025-06-05 23:06:36] [INFO ] Flatten gal took : 28 ms
[2025-06-05 23:06:36] [INFO ] Flatten gal took : 29 ms
[2025-06-05 23:06:36] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9090408650635085304.gal : 7 ms
[2025-06-05 23:06:36] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7581031561763480005.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality9090408650635085304.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality7581031561763480005.prop' '--nowitness' '--gen-order' 'FOLLOW'
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 92/92 places, 627/627 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 17 rules applied. Total rules applied 17 place count 90 transition count 610
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 33 place count 74 transition count 610
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 33 place count 74 transition count 601
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 51 place count 65 transition count 601
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 66 place count 50 transition count 586
Iterating global reduction 2 with 15 rules applied. Total rules applied 81 place count 50 transition count 586
Ensure Unique test removed 127 transitions
Reduce isomorphic transitions removed 127 transitions.
Iterating post reduction 2 with 127 rules applied. Total rules applied 208 place count 50 transition count 459
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 208 place count 50 transition count 452
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 222 place count 43 transition count 452
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 3 with 8 rules applied. Total rules applied 230 place count 43 transition count 444
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 246 place count 35 transition count 436
Applied a total of 246 rules in 282 ms. Remains 35 /92 variables (removed 57) and now considering 436/627 (removed 191) transitions.
[2025-06-05 23:06:36] [INFO ] Flow matrix only has 427 transitions (discarded 9 similar events)
// Phase 1: matrix 427 rows 35 cols
[2025-06-05 23:06:36] [INFO ] Computed 1 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 23:06:36] [INFO ] Implicit Places using invariants in 52 ms returned []
[2025-06-05 23:06:36] [INFO ] Flow matrix only has 427 transitions (discarded 9 similar events)
[2025-06-05 23:06:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 23:06:36] [INFO ] State equation strengthened by 390 read => feed constraints.
[2025-06-05 23:06:36] [INFO ] Implicit Places using invariants and state equation in 313 ms returned []
Implicit Place search using SMT with State Equation took 370 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 23:06:37] [INFO ] Redundant transitions in 21 ms returned []
Running 428 sub problems to find dead transitions.
[2025-06-05 23:06:37] [INFO ] Flow matrix only has 427 transitions (discarded 9 similar events)
[2025-06-05 23:06:37] [INFO ] Invariant cache hit.
[2025-06-05 23:06:37] [INFO ] State equation strengthened by 390 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 428 unsolved
At refinement iteration 1 (OVERLAPS) 8/35 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 428 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:06:41] [INFO ] Deduced a trap composed of 5 places in 60 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:06:42] [INFO ] Deduced a trap composed of 5 places in 55 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:06:42] [INFO ] Deduced a trap composed of 4 places in 95 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:06:42] [INFO ] Deduced a trap composed of 4 places in 96 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:06:42] [INFO ] Deduced a trap composed of 4 places in 91 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:06:42] [INFO ] Deduced a trap composed of 4 places in 85 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:06:42] [INFO ] Deduced a trap composed of 4 places in 86 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:06:42] [INFO ] Deduced a trap composed of 6 places in 91 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:06:42] [INFO ] Deduced a trap composed of 4 places in 138 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:06:42] [INFO ] Deduced a trap composed of 4 places in 123 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:06:42] [INFO ] Deduced a trap composed of 6 places in 91 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:06:43] [INFO ] Deduced a trap composed of 6 places in 90 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:06:43] [INFO ] Deduced a trap composed of 6 places in 95 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:06:43] [INFO ] Deduced a trap composed of 4 places in 243 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:06:43] [INFO ] Deduced a trap composed of 4 places in 249 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:06:43] [INFO ] Deduced a trap composed of 4 places in 210 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:06:44] [INFO ] Deduced a trap composed of 4 places in 248 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:06:44] [INFO ] Deduced a trap composed of 4 places in 238 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:06:44] [INFO ] Deduced a trap composed of 4 places in 202 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:06:44] [INFO ] Deduced a trap composed of 4 places in 196 ms of which 10 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 428 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:06:45] [INFO ] Deduced a trap composed of 5 places in 49 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:06:45] [INFO ] Deduced a trap composed of 5 places in 52 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:06:45] [INFO ] Deduced a trap composed of 5 places in 51 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:06:45] [INFO ] Deduced a trap composed of 5 places in 53 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:06:45] [INFO ] Deduced a trap composed of 5 places in 52 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:06:45] [INFO ] Deduced a trap composed of 4 places in 77 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:06:45] [INFO ] Deduced a trap composed of 4 places in 112 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:06:45] [INFO ] Deduced a trap composed of 4 places in 143 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:06:46] [INFO ] Deduced a trap composed of 4 places in 134 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:06:46] [INFO ] Deduced a trap composed of 4 places in 105 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:06:46] [INFO ] Deduced a trap composed of 4 places in 76 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:06:46] [INFO ] Deduced a trap composed of 4 places in 168 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:06:46] [INFO ] Deduced a trap composed of 4 places in 136 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:06:46] [INFO ] Deduced a trap composed of 4 places in 138 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:06:46] [INFO ] Deduced a trap composed of 4 places in 189 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:06:47] [INFO ] Deduced a trap composed of 4 places in 159 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:06:47] [INFO ] Deduced a trap composed of 4 places in 113 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:06:47] [INFO ] Deduced a trap composed of 6 places in 91 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:06:47] [INFO ] Deduced a trap composed of 4 places in 103 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:06:47] [INFO ] Deduced a trap composed of 4 places in 136 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/35 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 428 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:06:49] [INFO ] Deduced a trap composed of 4 places in 77 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:06:49] [INFO ] Deduced a trap composed of 4 places in 80 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:06:49] [INFO ] Deduced a trap composed of 4 places in 115 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:06:49] [INFO ] Deduced a trap composed of 4 places in 77 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:06:49] [INFO ] Deduced a trap composed of 4 places in 86 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/35 variables, 5/46 constraints. Problems are: Problem set: 0 solved, 428 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:06:51] [INFO ] Deduced a trap composed of 4 places in 75 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:06:51] [INFO ] Deduced a trap composed of 4 places in 124 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:06:51] [INFO ] Deduced a trap composed of 6 places in 89 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:06:51] [INFO ] Deduced a trap composed of 4 places in 108 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:06:51] [INFO ] Deduced a trap composed of 4 places in 77 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:06:51] [INFO ] Deduced a trap composed of 4 places in 116 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:06:51] [INFO ] Deduced a trap composed of 6 places in 89 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:06:51] [INFO ] Deduced a trap composed of 4 places in 82 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:06:52] [INFO ] Deduced a trap composed of 4 places in 83 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/35 variables, 9/55 constraints. Problems are: Problem set: 0 solved, 428 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:06:53] [INFO ] Deduced a trap composed of 4 places in 72 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:06:53] [INFO ] Deduced a trap composed of 4 places in 108 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/35 variables, 2/57 constraints. Problems are: Problem set: 0 solved, 428 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:06:56] [INFO ] Deduced a trap composed of 4 places in 80 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/35 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 428 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:06:58] [INFO ] Deduced a trap composed of 4 places in 89 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:06:58] [INFO ] Deduced a trap composed of 4 places in 51 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/35 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 428 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:07:00] [INFO ] Deduced a trap composed of 4 places in 82 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:07:00] [INFO ] Deduced a trap composed of 4 places in 85 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:07:00] [INFO ] Deduced a trap composed of 4 places in 184 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:07:01] [INFO ] Deduced a trap composed of 4 places in 118 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:07:01] [INFO ] Deduced a trap composed of 4 places in 108 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:07:01] [INFO ] Deduced a trap composed of 4 places in 84 ms of which 5 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/35 variables, 6/66 constraints. Problems are: Problem set: 0 solved, 428 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/35 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 428 unsolved
At refinement iteration 11 (OVERLAPS) 426/461 variables, 35/101 constraints. Problems are: Problem set: 0 solved, 428 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/461 variables, 389/490 constraints. Problems are: Problem set: 0 solved, 428 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 461/462 variables, and 490 constraints, problems are : Problem set: 0 solved, 428 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 35/35 constraints, ReadFeed: 389/390 constraints, PredecessorRefiner: 428/36 constraints, Known Traps: 65/65 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 428 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 428 unsolved
At refinement iteration 1 (OVERLAPS) 8/35 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 428 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 65/66 constraints. Problems are: Problem set: 0 solved, 428 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:07:11] [INFO ] Deduced a trap composed of 4 places in 83 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/35 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 428 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:07:13] [INFO ] Deduced a trap composed of 4 places in 118 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:07:13] [INFO ] Deduced a trap composed of 4 places in 90 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/35 variables, 2/69 constraints. Problems are: Problem set: 0 solved, 428 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/35 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 428 unsolved
At refinement iteration 6 (OVERLAPS) 426/461 variables, 35/104 constraints. Problems are: Problem set: 0 solved, 428 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/461 variables, 389/493 constraints. Problems are: Problem set: 0 solved, 428 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/461 variables, 36/529 constraints. Problems are: Problem set: 0 solved, 428 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 461/462 variables, and 529 constraints, problems are : Problem set: 0 solved, 428 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 35/35 constraints, ReadFeed: 389/390 constraints, PredecessorRefiner: 428/36 constraints, Known Traps: 68/68 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61453ms problems are : Problem set: 0 solved, 428 unsolved
Search for dead transitions found 0 dead transitions in 61455ms
Starting structural reductions in SI_CTL mode, iteration 1 : 35/92 places, 436/627 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 62141 ms. Remains : 35/92 places, 436/627 transitions.
[2025-06-05 23:07:38] [INFO ] Flatten gal took : 33 ms
[2025-06-05 23:07:38] [INFO ] Flatten gal took : 20 ms
[2025-06-05 23:07:38] [INFO ] Input system was already deterministic with 436 transitions.
[2025-06-05 23:07:38] [INFO ] Flatten gal took : 20 ms
[2025-06-05 23:07:38] [INFO ] Flatten gal took : 20 ms
[2025-06-05 23:07:38] [INFO ] Time to serialize gal into /tmp/CTLFireability3176860660920451101.gal : 5 ms
[2025-06-05 23:07:38] [INFO ] Time to serialize properties into /tmp/CTLFireability4690198842880620836.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability3176860660920451101.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4690198842880620836.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,783,0.48164,13980,2,567,5,6236,6,0,568,3390,0
Converting to forward existential form...Done !
original formula: E(!(((((p12==1)&&(p26==1))&&((p40==1)&&(p54==1)))&&(((p68==1)&&(p82==1))&&((p96==1)&&(p110==1))))) U EG(((!(((((p12==1)&&(p26==1))&&((p40...543
=> equivalent forward existential formula: [FwdG(FwdU(Init,!(((((p12==1)&&(p26==1))&&((p40==1)&&(p54==1)))&&(((p68==1)&&(p82==1))&&((p96==1)&&(p110==1)))))...846
Hit Full ! (commute/partial/dont) 27/0/409
Reverse transition relation is NOT exact ! Due to transitions t0, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t19, t20, t21, t2...318
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,0,2.11659,34588,1,0,601,48595,908,105,13818,35480,1027
FORMULA StigmergyElection-PT-08a-CTLFireability-2025-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 92/92 places, 627/627 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 91 transition count 625
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 91 transition count 625
Applied a total of 2 rules in 6 ms. Remains 91 /92 variables (removed 1) and now considering 625/627 (removed 2) transitions.
[2025-06-05 23:07:40] [INFO ] Flow matrix only has 616 transitions (discarded 9 similar events)
// Phase 1: matrix 616 rows 91 cols
[2025-06-05 23:07:40] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 23:07:40] [INFO ] Implicit Places using invariants in 82 ms returned []
[2025-06-05 23:07:40] [INFO ] Flow matrix only has 616 transitions (discarded 9 similar events)
[2025-06-05 23:07:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 23:07:41] [INFO ] State equation strengthened by 549 read => feed constraints.
[2025-06-05 23:07:43] [INFO ] Implicit Places using invariants and state equation in 2855 ms returned [90]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 2939 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 90/92 places, 625/627 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 74 transition count 609
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 74 transition count 609
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 40 place count 66 transition count 601
Iterating global reduction 0 with 8 rules applied. Total rules applied 48 place count 66 transition count 601
Applied a total of 48 rules in 9 ms. Remains 66 /90 variables (removed 24) and now considering 601/625 (removed 24) transitions.
[2025-06-05 23:07:43] [INFO ] Flow matrix only has 592 transitions (discarded 9 similar events)
// Phase 1: matrix 592 rows 66 cols
[2025-06-05 23:07:43] [INFO ] Computed 1 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 23:07:43] [INFO ] Implicit Places using invariants in 36 ms returned []
[2025-06-05 23:07:43] [INFO ] Flow matrix only has 592 transitions (discarded 9 similar events)
[2025-06-05 23:07:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 23:07:43] [INFO ] State equation strengthened by 517 read => feed constraints.
[2025-06-05 23:07:44] [INFO ] Implicit Places using invariants and state equation in 279 ms returned []
Implicit Place search using SMT with State Equation took 318 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 66/92 places, 601/627 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 3273 ms. Remains : 66/92 places, 601/627 transitions.
[2025-06-05 23:07:44] [INFO ] Flatten gal took : 40 ms
[2025-06-05 23:07:44] [INFO ] Flatten gal took : 46 ms
[2025-06-05 23:07:44] [INFO ] Input system was already deterministic with 601 transitions.
[2025-06-05 23:07:44] [INFO ] Flatten gal took : 52 ms
[2025-06-05 23:07:44] [INFO ] Flatten gal took : 45 ms
[2025-06-05 23:07:44] [INFO ] Time to serialize gal into /tmp/CTLFireability3940223949877942535.gal : 10 ms
[2025-06-05 23:07:44] [INFO ] Time to serialize properties into /tmp/CTLFireability15701614732603736080.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability3940223949877942535.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15701614732603736080.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,397202,3.79859,67928,2,4225,5,68299,6,0,856,43711,0
Converting to forward existential form...Done !
original formula: (AG(EF(EG(((((p12==0)||(p26==0))||((p40==0)||(p54==0)))||(((p68==0)||(p82==0))||((p96==0)||(p110==0))))))) * EG(EF(((((EX(((((p12==1)&&(p...334
=> equivalent forward existential formula: ([(FwdU(Init,TRUE) * !(E(TRUE U EG(((((p12==0)||(p26==0))||((p40==0)||(p54==0)))||(((p68==0)||(p82==0))||((p96==...422
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t4, t6, t8, t9, t11, t13, t14, t16, t18, t19, t21, t23, t24, t26, t28, t29, t31, t33,...364
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,1,27.5486,435496,1,0,851,593269,1230,162,21909,338549,1421
FORMULA StigmergyElection-PT-08a-CTLFireability-2025-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 92/92 places, 627/627 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 91 transition count 625
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 91 transition count 625
Applied a total of 2 rules in 5 ms. Remains 91 /92 variables (removed 1) and now considering 625/627 (removed 2) transitions.
[2025-06-05 23:08:12] [INFO ] Flow matrix only has 616 transitions (discarded 9 similar events)
// Phase 1: matrix 616 rows 91 cols
[2025-06-05 23:08:12] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 23:08:12] [INFO ] Implicit Places using invariants in 70 ms returned []
[2025-06-05 23:08:12] [INFO ] Flow matrix only has 616 transitions (discarded 9 similar events)
[2025-06-05 23:08:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 23:08:12] [INFO ] State equation strengthened by 549 read => feed constraints.
[2025-06-05 23:08:14] [INFO ] Implicit Places using invariants and state equation in 2485 ms returned [90]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 2564 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 90/92 places, 625/627 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 74 transition count 609
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 74 transition count 609
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 40 place count 66 transition count 601
Iterating global reduction 0 with 8 rules applied. Total rules applied 48 place count 66 transition count 601
Applied a total of 48 rules in 10 ms. Remains 66 /90 variables (removed 24) and now considering 601/625 (removed 24) transitions.
[2025-06-05 23:08:14] [INFO ] Flow matrix only has 592 transitions (discarded 9 similar events)
// Phase 1: matrix 592 rows 66 cols
[2025-06-05 23:08:14] [INFO ] Computed 1 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 23:08:14] [INFO ] Implicit Places using invariants in 38 ms returned []
[2025-06-05 23:08:14] [INFO ] Flow matrix only has 592 transitions (discarded 9 similar events)
[2025-06-05 23:08:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 23:08:14] [INFO ] State equation strengthened by 517 read => feed constraints.
[2025-06-05 23:08:15] [INFO ] Implicit Places using invariants and state equation in 353 ms returned []
Implicit Place search using SMT with State Equation took 393 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 66/92 places, 601/627 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2973 ms. Remains : 66/92 places, 601/627 transitions.
[2025-06-05 23:08:15] [INFO ] Flatten gal took : 41 ms
[2025-06-05 23:08:15] [INFO ] Flatten gal took : 48 ms
[2025-06-05 23:08:15] [INFO ] Input system was already deterministic with 601 transitions.
[2025-06-05 23:08:15] [INFO ] Flatten gal took : 47 ms
[2025-06-05 23:08:15] [INFO ] Flatten gal took : 47 ms
[2025-06-05 23:08:15] [INFO ] Time to serialize gal into /tmp/CTLFireability6944737018523972434.gal : 10 ms
[2025-06-05 23:08:15] [INFO ] Time to serialize properties into /tmp/CTLFireability2537018119201217430.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability6944737018523972434.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2537018119201217430.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,397202,3.68124,67920,2,4225,5,68299,6,0,856,43711,0
Converting to forward existential form...Done !
original formula: EX((A(AX(((((p12==1)&&(p26==1))&&((p40==1)&&(p54==1)))&&(((p68==1)&&(p82==1))&&((p96==1)&&(p110==1))))) U ((A(((((p12==1)&&(p26==1))&&((p...723
=> equivalent forward existential formula: [(FwdU((EY(Init) * !((E(!(((!((E(!(((((p12==1)&&(p26==1))&&((p40==1)&&(p54==1)))&&(((p68==1)&&(p82==1))&&((p96==...2447
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t4, t6, t8, t9, t11, t13, t14, t16, t18, t19, t21, t23, t24, t26, t28, t29, t31, t33,...364
(forward)formula 0,1,14.2967,237660,1,0,794,366373,1231,132,22423,243886,1338
FORMULA StigmergyElection-PT-08a-CTLFireability-2025-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 92/92 places, 627/627 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 91 transition count 625
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 91 transition count 625
Applied a total of 2 rules in 5 ms. Remains 91 /92 variables (removed 1) and now considering 625/627 (removed 2) transitions.
[2025-06-05 23:08:29] [INFO ] Flow matrix only has 616 transitions (discarded 9 similar events)
// Phase 1: matrix 616 rows 91 cols
[2025-06-05 23:08:29] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 23:08:29] [INFO ] Implicit Places using invariants in 69 ms returned []
[2025-06-05 23:08:29] [INFO ] Flow matrix only has 616 transitions (discarded 9 similar events)
[2025-06-05 23:08:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 23:08:30] [INFO ] State equation strengthened by 549 read => feed constraints.
[2025-06-05 23:08:30] [INFO ] Implicit Places using invariants and state equation in 843 ms returned []
Implicit Place search using SMT with State Equation took 916 ms to find 0 implicit places.
Running 624 sub problems to find dead transitions.
[2025-06-05 23:08:30] [INFO ] Flow matrix only has 616 transitions (discarded 9 similar events)
[2025-06-05 23:08:30] [INFO ] Invariant cache hit.
[2025-06-05 23:08:30] [INFO ] State equation strengthened by 549 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 624 unsolved
At refinement iteration 1 (OVERLAPS) 1/91 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 624 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:08:40] [INFO ] Deduced a trap composed of 10 places in 351 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:08:40] [INFO ] Deduced a trap composed of 10 places in 333 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:08:41] [INFO ] Deduced a trap composed of 10 places in 289 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:08:41] [INFO ] Deduced a trap composed of 10 places in 314 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:08:41] [INFO ] Deduced a trap composed of 10 places in 254 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:08:41] [INFO ] Deduced a trap composed of 10 places in 234 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:08:42] [INFO ] Deduced a trap composed of 10 places in 246 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:08:42] [INFO ] Deduced a trap composed of 10 places in 232 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:08:42] [INFO ] Deduced a trap composed of 10 places in 202 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:08:42] [INFO ] Deduced a trap composed of 10 places in 275 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:08:43] [INFO ] Deduced a trap composed of 10 places in 238 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:08:43] [INFO ] Deduced a trap composed of 10 places in 279 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:08:43] [INFO ] Deduced a trap composed of 10 places in 278 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:08:43] [INFO ] Deduced a trap composed of 10 places in 248 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:08:44] [INFO ] Deduced a trap composed of 10 places in 281 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:08:44] [INFO ] Deduced a trap composed of 10 places in 275 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:08:44] [INFO ] Deduced a trap composed of 10 places in 415 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:08:45] [INFO ] Deduced a trap composed of 10 places in 391 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:08:45] [INFO ] Deduced a trap composed of 10 places in 324 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:08:46] [INFO ] Deduced a trap composed of 10 places in 329 ms of which 20 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/91 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 624 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:08:46] [INFO ] Deduced a trap composed of 10 places in 149 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:08:46] [INFO ] Deduced a trap composed of 10 places in 151 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:08:47] [INFO ] Deduced a trap composed of 10 places in 205 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:08:47] [INFO ] Deduced a trap composed of 10 places in 150 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:08:47] [INFO ] Deduced a trap composed of 10 places in 190 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:08:47] [INFO ] Deduced a trap composed of 10 places in 184 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:08:47] [INFO ] Deduced a trap composed of 10 places in 144 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:08:48] [INFO ] Deduced a trap composed of 10 places in 138 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:08:48] [INFO ] Deduced a trap composed of 10 places in 186 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:08:48] [INFO ] Deduced a trap composed of 10 places in 143 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:08:48] [INFO ] Deduced a trap composed of 10 places in 99 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:08:48] [INFO ] Deduced a trap composed of 12 places in 224 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:08:48] [INFO ] Deduced a trap composed of 10 places in 193 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:08:49] [INFO ] Deduced a trap composed of 10 places in 230 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:08:49] [INFO ] Deduced a trap composed of 10 places in 190 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:08:49] [INFO ] Deduced a trap composed of 10 places in 231 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:08:49] [INFO ] Deduced a trap composed of 10 places in 197 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:08:50] [INFO ] Deduced a trap composed of 10 places in 145 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:08:50] [INFO ] Deduced a trap composed of 10 places in 159 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:08:50] [INFO ] Deduced a trap composed of 10 places in 153 ms of which 14 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/91 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 624 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:08:53] [INFO ] Deduced a trap composed of 10 places in 118 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:08:53] [INFO ] Deduced a trap composed of 10 places in 111 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:08:53] [INFO ] Deduced a trap composed of 13 places in 72 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:08:53] [INFO ] Deduced a trap composed of 10 places in 103 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:08:53] [INFO ] Deduced a trap composed of 10 places in 116 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:08:54] [INFO ] Deduced a trap composed of 12 places in 180 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:08:54] [INFO ] Deduced a trap composed of 12 places in 263 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:08:54] [INFO ] Deduced a trap composed of 10 places in 175 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:08:54] [INFO ] Deduced a trap composed of 10 places in 160 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:08:54] [INFO ] Deduced a trap composed of 10 places in 101 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:08:55] [INFO ] Deduced a trap composed of 13 places in 63 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:08:55] [INFO ] Deduced a trap composed of 12 places in 328 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:08:55] [INFO ] Deduced a trap composed of 10 places in 118 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:08:55] [INFO ] Deduced a trap composed of 12 places in 287 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:08:56] [INFO ] Deduced a trap composed of 12 places in 323 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:08:56] [INFO ] Deduced a trap composed of 12 places in 328 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:08:56] [INFO ] Deduced a trap composed of 12 places in 308 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:08:57] [INFO ] Deduced a trap composed of 12 places in 310 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:08:57] [INFO ] Deduced a trap composed of 12 places in 404 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:08:57] [INFO ] Deduced a trap composed of 12 places in 382 ms of which 35 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/91 variables, 20/62 constraints. Problems are: Problem set: 0 solved, 624 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:08:58] [INFO ] Deduced a trap composed of 10 places in 144 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:08:58] [INFO ] Deduced a trap composed of 10 places in 104 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:08:59] [INFO ] Deduced a trap composed of 12 places in 309 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:08:59] [INFO ] Deduced a trap composed of 10 places in 177 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:08:59] [INFO ] Deduced a trap composed of 10 places in 141 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:08:59] [INFO ] Deduced a trap composed of 10 places in 99 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:08:59] [INFO ] Deduced a trap composed of 10 places in 266 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:09:00] [INFO ] Deduced a trap composed of 10 places in 216 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:09:00] [INFO ] Deduced a trap composed of 10 places in 179 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:09:00] [INFO ] Deduced a trap composed of 10 places in 142 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:09:00] [INFO ] Deduced a trap composed of 12 places in 393 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:09:01] [INFO ] Deduced a trap composed of 12 places in 394 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:09:01] [INFO ] Deduced a trap composed of 12 places in 316 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:09:02] [INFO ] Deduced a trap composed of 12 places in 346 ms of which 24 ms to minimize.
SMT process timed out in 31531ms, After SMT, problems are : Problem set: 0 solved, 624 unsolved
Search for dead transitions found 0 dead transitions in 31535ms
Starting structural reductions in LTL mode, iteration 1 : 91/92 places, 625/627 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32467 ms. Remains : 91/92 places, 625/627 transitions.
[2025-06-05 23:09:02] [INFO ] Flatten gal took : 41 ms
[2025-06-05 23:09:02] [INFO ] Flatten gal took : 47 ms
[2025-06-05 23:09:02] [INFO ] Input system was already deterministic with 625 transitions.
[2025-06-05 23:09:02] [INFO ] Flatten gal took : 47 ms
[2025-06-05 23:09:02] [INFO ] Flatten gal took : 48 ms
[2025-06-05 23:09:02] [INFO ] Time to serialize gal into /tmp/CTLFireability9225639559537899523.gal : 10 ms
[2025-06-05 23:09:02] [INFO ] Time to serialize properties into /tmp/CTLFireability14402330417530905111.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability9225639559537899523.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14402330417530905111.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,456193,4.11355,73252,2,4543,5,96869,6,0,978,44855,0
Converting to forward existential form...Done !
original formula: E((((AX(AF(((((p12==1)&&(p26==1))&&((p40==1)&&(p54==1)))&&(((p68==1)&&(p82==1))&&((p96==1)&&(p110==1)))))) + EF(EX(((((p12==1)&&(p26==1))...554
=> equivalent forward existential formula: [(FwdU(Init,(((!(EX(!(!(EG(!(((((p12==1)&&(p26==1))&&((p40==1)&&(p54==1)))&&(((p68==1)&&(p82==1))&&((p96==1)&&(p...630
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t4, t5, t6, t8, t9, t10, t11, t13, t14, t15, t16, t18, t19, t20, t21, t23, t24, t25, ...443
Detected timeout of ITS tools.
[2025-06-05 23:09:32] [INFO ] Flatten gal took : 29 ms
[2025-06-05 23:09:32] [INFO ] Applying decomposition
[2025-06-05 23:09:32] [INFO ] Flatten gal took : 30 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph18254715976015476579.txt' '-o' '/tmp/graph18254715976015476579.bin' '-w' '/tmp/graph18254715976015476579.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph18254715976015476579.bin' '-l' '-1' '-v' '-w' '/tmp/graph18254715976015476579.weights' '-q' '0' '-e' '0.001'
[2025-06-05 23:09:32] [INFO ] Decomposing Gal with order
[2025-06-05 23:09:32] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-05 23:09:32] [INFO ] Removed a total of 4150 redundant transitions.
[2025-06-05 23:09:32] [INFO ] Flatten gal took : 103 ms
[2025-06-05 23:09:33] [INFO ] Fuse similar labels procedure discarded/fused a total of 36 labels/synchronizations in 46 ms.
[2025-06-05 23:09:33] [INFO ] Time to serialize gal into /tmp/CTLFireability2243154334135536802.gal : 6 ms
[2025-06-05 23:09:33] [INFO ] Time to serialize properties into /tmp/CTLFireability6523925309247798749.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability2243154334135536802.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6523925309247798749.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 92/92 places, 627/627 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 17 rules applied. Total rules applied 17 place count 90 transition count 610
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 33 place count 74 transition count 610
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 33 place count 74 transition count 600
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 53 place count 64 transition count 600
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 69 place count 48 transition count 583
Iterating global reduction 2 with 16 rules applied. Total rules applied 85 place count 48 transition count 583
Ensure Unique test removed 255 transitions
Reduce isomorphic transitions removed 255 transitions.
Iterating post reduction 2 with 255 rules applied. Total rules applied 340 place count 48 transition count 328
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 340 place count 48 transition count 321
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 354 place count 41 transition count 321
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 3 with 8 rules applied. Total rules applied 362 place count 41 transition count 313
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 378 place count 33 transition count 305
Applied a total of 378 rules in 147 ms. Remains 33 /92 variables (removed 59) and now considering 305/627 (removed 322) transitions.
[2025-06-05 23:10:03] [INFO ] Flow matrix only has 296 transitions (discarded 9 similar events)
// Phase 1: matrix 296 rows 33 cols
[2025-06-05 23:10:03] [INFO ] Computed 1 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 23:10:03] [INFO ] Implicit Places using invariants in 47 ms returned []
[2025-06-05 23:10:03] [INFO ] Flow matrix only has 296 transitions (discarded 9 similar events)
[2025-06-05 23:10:03] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 23:10:03] [INFO ] State equation strengthened by 263 read => feed constraints.
[2025-06-05 23:10:03] [INFO ] Implicit Places using invariants and state equation in 201 ms returned []
Implicit Place search using SMT with State Equation took 269 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 23:10:03] [INFO ] Redundant transitions in 15 ms returned []
Running 297 sub problems to find dead transitions.
[2025-06-05 23:10:03] [INFO ] Flow matrix only has 296 transitions (discarded 9 similar events)
[2025-06-05 23:10:03] [INFO ] Invariant cache hit.
[2025-06-05 23:10:03] [INFO ] State equation strengthened by 263 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 1 (OVERLAPS) 8/33 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 297 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:10:06] [INFO ] Deduced a trap composed of 5 places in 46 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:10:06] [INFO ] Deduced a trap composed of 5 places in 42 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:10:06] [INFO ] Deduced a trap composed of 5 places in 42 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:10:06] [INFO ] Deduced a trap composed of 4 places in 66 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:10:06] [INFO ] Deduced a trap composed of 4 places in 55 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:10:07] [INFO ] Deduced a trap composed of 4 places in 46 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:10:07] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:10:07] [INFO ] Deduced a trap composed of 5 places in 44 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:10:07] [INFO ] Deduced a trap composed of 4 places in 46 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:10:07] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:10:07] [INFO ] Deduced a trap composed of 4 places in 90 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:10:07] [INFO ] Deduced a trap composed of 4 places in 82 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:10:07] [INFO ] Deduced a trap composed of 4 places in 92 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:10:07] [INFO ] Deduced a trap composed of 4 places in 122 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:10:07] [INFO ] Deduced a trap composed of 4 places in 123 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:10:07] [INFO ] Deduced a trap composed of 4 places in 142 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:10:08] [INFO ] Deduced a trap composed of 4 places in 171 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:10:08] [INFO ] Deduced a trap composed of 4 places in 179 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:10:08] [INFO ] Deduced a trap composed of 4 places in 153 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:10:08] [INFO ] Deduced a trap composed of 4 places in 157 ms of which 9 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/33 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 297 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:10:08] [INFO ] Deduced a trap composed of 5 places in 44 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:10:08] [INFO ] Deduced a trap composed of 5 places in 40 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:10:08] [INFO ] Deduced a trap composed of 5 places in 52 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:10:09] [INFO ] Deduced a trap composed of 5 places in 43 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:10:09] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:10:09] [INFO ] Deduced a trap composed of 4 places in 90 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:10:09] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:10:09] [INFO ] Deduced a trap composed of 4 places in 94 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:10:09] [INFO ] Deduced a trap composed of 4 places in 109 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:10:09] [INFO ] Deduced a trap composed of 4 places in 92 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:10:09] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:10:09] [INFO ] Deduced a trap composed of 4 places in 127 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:10:09] [INFO ] Deduced a trap composed of 4 places in 107 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:10:09] [INFO ] Deduced a trap composed of 4 places in 79 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:10:10] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:10:10] [INFO ] Deduced a trap composed of 4 places in 181 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:10:10] [INFO ] Deduced a trap composed of 4 places in 141 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:10:10] [INFO ] Deduced a trap composed of 4 places in 144 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:10:10] [INFO ] Deduced a trap composed of 4 places in 126 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:10:10] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/33 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 297 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:10:11] [INFO ] Deduced a trap composed of 4 places in 81 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:10:11] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:10:11] [INFO ] Deduced a trap composed of 4 places in 77 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:10:11] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:10:12] [INFO ] Deduced a trap composed of 4 places in 85 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:10:12] [INFO ] Deduced a trap composed of 4 places in 143 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:10:12] [INFO ] Deduced a trap composed of 4 places in 120 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:10:12] [INFO ] Deduced a trap composed of 4 places in 114 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:10:12] [INFO ] Deduced a trap composed of 4 places in 86 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:10:12] [INFO ] Deduced a trap composed of 4 places in 72 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:10:12] [INFO ] Deduced a trap composed of 4 places in 67 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:10:12] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 12/53 constraints. Problems are: Problem set: 0 solved, 297 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:10:13] [INFO ] Deduced a trap composed of 4 places in 86 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:10:14] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:10:14] [INFO ] Deduced a trap composed of 4 places in 55 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/33 variables, 3/56 constraints. Problems are: Problem set: 0 solved, 297 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:10:15] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:10:15] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:10:15] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:10:15] [INFO ] Deduced a trap composed of 4 places in 53 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:10:15] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:10:15] [INFO ] Deduced a trap composed of 4 places in 99 ms of which 5 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/33 variables, 6/62 constraints. Problems are: Problem set: 0 solved, 297 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:10:17] [INFO ] Deduced a trap composed of 4 places in 65 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:10:17] [INFO ] Deduced a trap composed of 4 places in 64 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:10:17] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/33 variables, 3/65 constraints. Problems are: Problem set: 0 solved, 297 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:10:18] [INFO ] Deduced a trap composed of 4 places in 69 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:10:18] [INFO ] Deduced a trap composed of 4 places in 65 ms of which 4 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/33 variables, 2/67 constraints. Problems are: Problem set: 0 solved, 297 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:10:19] [INFO ] Deduced a trap composed of 4 places in 117 ms of which 7 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/33 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/33 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 11 (OVERLAPS) 295/328 variables, 33/101 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/328 variables, 262/363 constraints. Problems are: Problem set: 0 solved, 297 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:10:26] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:10:27] [INFO ] Deduced a trap composed of 4 places in 96 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:10:27] [INFO ] Deduced a trap composed of 4 places in 93 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:10:27] [INFO ] Deduced a trap composed of 4 places in 91 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:10:27] [INFO ] Deduced a trap composed of 4 places in 97 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:10:27] [INFO ] Deduced a trap composed of 4 places in 77 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:10:27] [INFO ] Deduced a trap composed of 4 places in 68 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:10:27] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:10:27] [INFO ] Deduced a trap composed of 4 places in 84 ms of which 4 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/328 variables, 9/372 constraints. Problems are: Problem set: 0 solved, 297 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:10:32] [INFO ] Deduced a trap composed of 4 places in 75 ms of which 3 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 328/329 variables, and 373 constraints, problems are : Problem set: 0 solved, 297 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 33/33 constraints, ReadFeed: 262/263 constraints, PredecessorRefiner: 297/33 constraints, Known Traps: 77/77 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 297 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 1 (OVERLAPS) 8/33 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/33 variables, 77/78 constraints. Problems are: Problem set: 0 solved, 297 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:10:36] [INFO ] Deduced a trap composed of 4 places in 72 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:10:36] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:10:36] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:10:36] [INFO ] Deduced a trap composed of 4 places in 55 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:10:36] [INFO ] Deduced a trap composed of 4 places in 57 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:10:36] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/33 variables, 6/84 constraints. Problems are: Problem set: 0 solved, 297 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:10:38] [INFO ] Deduced a trap composed of 4 places in 78 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:10:38] [INFO ] Deduced a trap composed of 4 places in 70 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:10:38] [INFO ] Deduced a trap composed of 4 places in 64 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 3/87 constraints. Problems are: Problem set: 0 solved, 297 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:10:40] [INFO ] Deduced a trap composed of 4 places in 55 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/33 variables, 1/88 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/33 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 7 (OVERLAPS) 295/328 variables, 33/121 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/328 variables, 262/383 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/328 variables, 33/416 constraints. Problems are: Problem set: 0 solved, 297 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 328/329 variables, and 416 constraints, problems are : Problem set: 0 solved, 297 unsolved in 30038 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 33/33 constraints, ReadFeed: 262/263 constraints, PredecessorRefiner: 297/33 constraints, Known Traps: 87/87 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60935ms problems are : Problem set: 0 solved, 297 unsolved
Search for dead transitions found 0 dead transitions in 60938ms
Starting structural reductions in SI_CTL mode, iteration 1 : 33/92 places, 305/627 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 61380 ms. Remains : 33/92 places, 305/627 transitions.
[2025-06-05 23:11:04] [INFO ] Flatten gal took : 19 ms
[2025-06-05 23:11:04] [INFO ] Flatten gal took : 21 ms
[2025-06-05 23:11:04] [INFO ] Input system was already deterministic with 305 transitions.
[2025-06-05 23:11:04] [INFO ] Flatten gal took : 22 ms
[2025-06-05 23:11:04] [INFO ] Flatten gal took : 21 ms
[2025-06-05 23:11:04] [INFO ] Time to serialize gal into /tmp/CTLFireability11030781423382795262.gal : 4 ms
[2025-06-05 23:11:04] [INFO ] Time to serialize properties into /tmp/CTLFireability14263990743000787257.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability11030781423382795262.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14263990743000787257.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,527,0.328355,10604,2,508,5,5032,6,0,429,2833,0
Converting to forward existential form...Done !
original formula: AF((E(!(AF(((((p12==1)&&(p26==1))&&((p40==1)&&(p54==1)))&&(((p68==1)&&(p82==1))&&((p96==1)&&(p110==1)))))) U EF(((((p12==1)&&(p26==1))&&(...323
=> equivalent forward existential formula: [FwdG(Init,!((E(!(!(EG(!(((((p12==1)&&(p26==1))&&((p40==1)&&(p54==1)))&&(((p68==1)&&(p82==1))&&((p96==1)&&(p110=...380
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t19, t21...312
(forward)formula 0,1,1.49015,26604,1,0,444,36312,635,84,10208,27012,716
FORMULA StigmergyElection-PT-08a-CTLFireability-2023-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 92/92 places, 627/627 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 91 transition count 625
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 91 transition count 625
Applied a total of 2 rules in 5 ms. Remains 91 /92 variables (removed 1) and now considering 625/627 (removed 2) transitions.
[2025-06-05 23:11:06] [INFO ] Flow matrix only has 616 transitions (discarded 9 similar events)
// Phase 1: matrix 616 rows 91 cols
[2025-06-05 23:11:06] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 23:11:06] [INFO ] Implicit Places using invariants in 103 ms returned []
[2025-06-05 23:11:06] [INFO ] Flow matrix only has 616 transitions (discarded 9 similar events)
[2025-06-05 23:11:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 23:11:06] [INFO ] State equation strengthened by 549 read => feed constraints.
[2025-06-05 23:11:08] [INFO ] Implicit Places using invariants and state equation in 2465 ms returned [90]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 2582 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 90/92 places, 625/627 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 74 transition count 609
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 74 transition count 609
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 40 place count 66 transition count 601
Iterating global reduction 0 with 8 rules applied. Total rules applied 48 place count 66 transition count 601
Applied a total of 48 rules in 7 ms. Remains 66 /90 variables (removed 24) and now considering 601/625 (removed 24) transitions.
[2025-06-05 23:11:08] [INFO ] Flow matrix only has 592 transitions (discarded 9 similar events)
// Phase 1: matrix 592 rows 66 cols
[2025-06-05 23:11:08] [INFO ] Computed 1 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 23:11:08] [INFO ] Implicit Places using invariants in 35 ms returned []
[2025-06-05 23:11:08] [INFO ] Flow matrix only has 592 transitions (discarded 9 similar events)
[2025-06-05 23:11:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 23:11:08] [INFO ] State equation strengthened by 517 read => feed constraints.
[2025-06-05 23:11:09] [INFO ] Implicit Places using invariants and state equation in 277 ms returned []
Implicit Place search using SMT with State Equation took 313 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 66/92 places, 601/627 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2907 ms. Remains : 66/92 places, 601/627 transitions.
[2025-06-05 23:11:09] [INFO ] Flatten gal took : 38 ms
[2025-06-05 23:11:09] [INFO ] Flatten gal took : 48 ms
[2025-06-05 23:11:09] [INFO ] Input system was already deterministic with 601 transitions.
[2025-06-05 23:11:09] [INFO ] Flatten gal took : 48 ms
[2025-06-05 23:11:09] [INFO ] Flatten gal took : 46 ms
[2025-06-05 23:11:09] [INFO ] Time to serialize gal into /tmp/CTLFireability15342618940352702008.gal : 10 ms
[2025-06-05 23:11:09] [INFO ] Time to serialize properties into /tmp/CTLFireability2550056067413922369.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability15342618940352702008.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2550056067413922369.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,397202,4.31214,67916,2,4225,5,68299,6,0,856,43711,0
Converting to forward existential form...Done !
original formula: EG(AX(A((!(EG(((((p12==1)&&(p26==1))&&((p40==1)&&(p54==1)))&&(((p68==1)&&(p82==1))&&((p96==1)&&(p110==1)))))) + ((((p12==1)&&(p26==1))&&(...339
=> equivalent forward existential formula: [FwdG(Init,!(EX(!(!((E(!(!(E(TRUE U !(((p67==1)||((((p12==1)&&(p26==1))&&((p40==1)&&(p54==1)))&&(((p68==1)&&(p82...671
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t4, t6, t8, t9, t11, t13, t14, t16, t18, t19, t21, t23, t24, t26, t28, t29, t31, t33,...364
(forward)formula 0,0,13.9346,191908,1,0,714,263564,1226,94,21791,179668,1234
FORMULA StigmergyElection-PT-08a-CTLFireability-2023-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in SI_CTL mode, iteration 0 : 92/92 places, 627/627 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 17 rules applied. Total rules applied 17 place count 90 transition count 610
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 33 place count 74 transition count 610
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 33 place count 74 transition count 600
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 53 place count 64 transition count 600
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 69 place count 48 transition count 583
Iterating global reduction 2 with 16 rules applied. Total rules applied 85 place count 48 transition count 583
Ensure Unique test removed 255 transitions
Reduce isomorphic transitions removed 255 transitions.
Iterating post reduction 2 with 255 rules applied. Total rules applied 340 place count 48 transition count 328
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 340 place count 48 transition count 321
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 354 place count 41 transition count 321
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 3 with 8 rules applied. Total rules applied 362 place count 41 transition count 313
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 378 place count 33 transition count 305
Applied a total of 378 rules in 75 ms. Remains 33 /92 variables (removed 59) and now considering 305/627 (removed 322) transitions.
[2025-06-05 23:11:23] [INFO ] Flow matrix only has 296 transitions (discarded 9 similar events)
// Phase 1: matrix 296 rows 33 cols
[2025-06-05 23:11:23] [INFO ] Computed 1 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 23:11:23] [INFO ] Implicit Places using invariants in 33 ms returned []
[2025-06-05 23:11:23] [INFO ] Flow matrix only has 296 transitions (discarded 9 similar events)
[2025-06-05 23:11:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 23:11:23] [INFO ] State equation strengthened by 263 read => feed constraints.
[2025-06-05 23:11:23] [INFO ] Implicit Places using invariants and state equation in 188 ms returned []
Implicit Place search using SMT with State Equation took 222 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 23:11:23] [INFO ] Redundant transitions in 7 ms returned []
Running 297 sub problems to find dead transitions.
[2025-06-05 23:11:23] [INFO ] Flow matrix only has 296 transitions (discarded 9 similar events)
[2025-06-05 23:11:23] [INFO ] Invariant cache hit.
[2025-06-05 23:11:23] [INFO ] State equation strengthened by 263 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 1 (OVERLAPS) 8/33 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 297 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:11:26] [INFO ] Deduced a trap composed of 5 places in 46 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:11:26] [INFO ] Deduced a trap composed of 5 places in 43 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:11:26] [INFO ] Deduced a trap composed of 5 places in 43 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:11:26] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:11:26] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:11:27] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:11:27] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:11:27] [INFO ] Deduced a trap composed of 5 places in 43 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:11:27] [INFO ] Deduced a trap composed of 4 places in 65 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:11:27] [INFO ] Deduced a trap composed of 4 places in 101 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:11:27] [INFO ] Deduced a trap composed of 4 places in 151 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:11:27] [INFO ] Deduced a trap composed of 4 places in 128 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:11:27] [INFO ] Deduced a trap composed of 4 places in 108 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:11:27] [INFO ] Deduced a trap composed of 4 places in 147 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:11:28] [INFO ] Deduced a trap composed of 4 places in 154 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:11:28] [INFO ] Deduced a trap composed of 4 places in 179 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:11:28] [INFO ] Deduced a trap composed of 4 places in 172 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:11:28] [INFO ] Deduced a trap composed of 4 places in 175 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:11:28] [INFO ] Deduced a trap composed of 4 places in 146 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:11:28] [INFO ] Deduced a trap composed of 4 places in 145 ms of which 8 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/33 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 297 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:11:29] [INFO ] Deduced a trap composed of 5 places in 44 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:11:29] [INFO ] Deduced a trap composed of 5 places in 41 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:11:29] [INFO ] Deduced a trap composed of 5 places in 51 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:11:29] [INFO ] Deduced a trap composed of 5 places in 43 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:11:29] [INFO ] Deduced a trap composed of 4 places in 65 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:11:29] [INFO ] Deduced a trap composed of 4 places in 80 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:11:29] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:11:29] [INFO ] Deduced a trap composed of 4 places in 106 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:11:29] [INFO ] Deduced a trap composed of 4 places in 104 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:11:29] [INFO ] Deduced a trap composed of 4 places in 84 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:11:29] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:11:30] [INFO ] Deduced a trap composed of 4 places in 121 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:11:30] [INFO ] Deduced a trap composed of 4 places in 99 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:11:30] [INFO ] Deduced a trap composed of 4 places in 77 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:11:30] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:11:30] [INFO ] Deduced a trap composed of 4 places in 170 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:11:30] [INFO ] Deduced a trap composed of 4 places in 145 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:11:30] [INFO ] Deduced a trap composed of 4 places in 143 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:11:30] [INFO ] Deduced a trap composed of 4 places in 126 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:11:31] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/33 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 297 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:11:31] [INFO ] Deduced a trap composed of 4 places in 90 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:11:31] [INFO ] Deduced a trap composed of 4 places in 65 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:11:32] [INFO ] Deduced a trap composed of 4 places in 82 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:11:32] [INFO ] Deduced a trap composed of 4 places in 70 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:11:32] [INFO ] Deduced a trap composed of 4 places in 84 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:11:32] [INFO ] Deduced a trap composed of 4 places in 147 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:11:32] [INFO ] Deduced a trap composed of 4 places in 122 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:11:32] [INFO ] Deduced a trap composed of 4 places in 112 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:11:32] [INFO ] Deduced a trap composed of 4 places in 91 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:11:32] [INFO ] Deduced a trap composed of 4 places in 69 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:11:32] [INFO ] Deduced a trap composed of 4 places in 79 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:11:32] [INFO ] Deduced a trap composed of 4 places in 64 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 12/53 constraints. Problems are: Problem set: 0 solved, 297 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:11:34] [INFO ] Deduced a trap composed of 4 places in 77 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:11:34] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:11:34] [INFO ] Deduced a trap composed of 4 places in 72 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/33 variables, 3/56 constraints. Problems are: Problem set: 0 solved, 297 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:11:35] [INFO ] Deduced a trap composed of 4 places in 79 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:11:35] [INFO ] Deduced a trap composed of 4 places in 96 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:11:35] [INFO ] Deduced a trap composed of 4 places in 95 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:11:35] [INFO ] Deduced a trap composed of 4 places in 72 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:11:35] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:11:35] [INFO ] Deduced a trap composed of 4 places in 97 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/33 variables, 6/62 constraints. Problems are: Problem set: 0 solved, 297 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:11:37] [INFO ] Deduced a trap composed of 4 places in 78 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:11:37] [INFO ] Deduced a trap composed of 4 places in 70 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:11:37] [INFO ] Deduced a trap composed of 4 places in 79 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/33 variables, 3/65 constraints. Problems are: Problem set: 0 solved, 297 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:11:38] [INFO ] Deduced a trap composed of 4 places in 84 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:11:39] [INFO ] Deduced a trap composed of 4 places in 77 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/33 variables, 2/67 constraints. Problems are: Problem set: 0 solved, 297 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:11:40] [INFO ] Deduced a trap composed of 4 places in 137 ms of which 7 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/33 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/33 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 11 (OVERLAPS) 295/328 variables, 33/101 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/328 variables, 262/363 constraints. Problems are: Problem set: 0 solved, 297 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:11:47] [INFO ] Deduced a trap composed of 4 places in 77 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:11:48] [INFO ] Deduced a trap composed of 4 places in 92 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:11:48] [INFO ] Deduced a trap composed of 4 places in 95 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:11:48] [INFO ] Deduced a trap composed of 4 places in 114 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:11:48] [INFO ] Deduced a trap composed of 4 places in 108 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:11:48] [INFO ] Deduced a trap composed of 4 places in 90 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:11:48] [INFO ] Deduced a trap composed of 4 places in 79 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:11:48] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:11:48] [INFO ] Deduced a trap composed of 4 places in 71 ms of which 6 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/328 variables, 9/372 constraints. Problems are: Problem set: 0 solved, 297 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:11:53] [INFO ] Deduced a trap composed of 4 places in 52 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 328/329 variables, and 373 constraints, problems are : Problem set: 0 solved, 297 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 33/33 constraints, ReadFeed: 262/263 constraints, PredecessorRefiner: 297/33 constraints, Known Traps: 77/77 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 297 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 1 (OVERLAPS) 8/33 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/33 variables, 77/78 constraints. Problems are: Problem set: 0 solved, 297 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:11:56] [INFO ] Deduced a trap composed of 4 places in 45 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:11:56] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:11:56] [INFO ] Deduced a trap composed of 4 places in 51 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:11:56] [INFO ] Deduced a trap composed of 4 places in 52 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:11:56] [INFO ] Deduced a trap composed of 4 places in 50 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:11:56] [INFO ] Deduced a trap composed of 4 places in 52 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/33 variables, 6/84 constraints. Problems are: Problem set: 0 solved, 297 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:11:58] [INFO ] Deduced a trap composed of 4 places in 79 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:11:58] [INFO ] Deduced a trap composed of 4 places in 68 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:11:58] [INFO ] Deduced a trap composed of 4 places in 57 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 3/87 constraints. Problems are: Problem set: 0 solved, 297 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:12:00] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/33 variables, 1/88 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/33 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 7 (OVERLAPS) 295/328 variables, 33/121 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/328 variables, 262/383 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/328 variables, 33/416 constraints. Problems are: Problem set: 0 solved, 297 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 328/329 variables, and 416 constraints, problems are : Problem set: 0 solved, 297 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 33/33 constraints, ReadFeed: 262/263 constraints, PredecessorRefiner: 297/33 constraints, Known Traps: 87/87 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60797ms problems are : Problem set: 0 solved, 297 unsolved
Search for dead transitions found 0 dead transitions in 60799ms
Starting structural reductions in SI_CTL mode, iteration 1 : 33/92 places, 305/627 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 61113 ms. Remains : 33/92 places, 305/627 transitions.
[2025-06-05 23:12:24] [INFO ] Flatten gal took : 20 ms
[2025-06-05 23:12:24] [INFO ] Flatten gal took : 24 ms
[2025-06-05 23:12:24] [INFO ] Input system was already deterministic with 305 transitions.
[2025-06-05 23:12:24] [INFO ] Flatten gal took : 23 ms
[2025-06-05 23:12:24] [INFO ] Flatten gal took : 16 ms
[2025-06-05 23:12:24] [INFO ] Time to serialize gal into /tmp/CTLFireability6762081557286378592.gal : 4 ms
[2025-06-05 23:12:24] [INFO ] Time to serialize properties into /tmp/CTLFireability39520214457440010.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability6762081557286378592.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability39520214457440010.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...281
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,527,0.372859,10608,2,508,5,5032,6,0,429,2833,0
Converting to forward existential form...Done !
original formula: EF(EG(((AG(((((p12==1)&&(p26==1))&&((p40==1)&&(p54==1)))&&(((p68==1)&&(p82==1))&&((p96==1)&&(p110==1))))) + E(((((p12==1)&&(p26==1))&&((p...418
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),((!(E(TRUE U !(((((p12==1)&&(p26==1))&&((p40==1)&&(p54==1)))&&(((p68==1)&&(p82==1))&&((p96...480
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t19, t21...312
(forward)formula 0,1,1.18435,15984,1,0,390,19601,631,50,10010,13837,631
FORMULA StigmergyElection-PT-08a-CTLFireability-2023-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
[2025-06-05 23:12:25] [INFO ] Flatten gal took : 29 ms
[2025-06-05 23:12:25] [INFO ] Flatten gal took : 29 ms
[2025-06-05 23:12:25] [INFO ] Applying decomposition
[2025-06-05 23:12:25] [INFO ] Flatten gal took : 28 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph4735303469565551151.txt' '-o' '/tmp/graph4735303469565551151.bin' '-w' '/tmp/graph4735303469565551151.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph4735303469565551151.bin' '-l' '-1' '-v' '-w' '/tmp/graph4735303469565551151.weights' '-q' '0' '-e' '0.001'
[2025-06-05 23:12:26] [INFO ] Decomposing Gal with order
[2025-06-05 23:12:26] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-05 23:12:26] [INFO ] Removed a total of 4154 redundant transitions.
[2025-06-05 23:12:26] [INFO ] Flatten gal took : 99 ms
[2025-06-05 23:12:26] [INFO ] Fuse similar labels procedure discarded/fused a total of 34 labels/synchronizations in 31 ms.
[2025-06-05 23:12:26] [INFO ] Time to serialize gal into /tmp/CTLFireability16769714696862544702.gal : 6 ms
[2025-06-05 23:12:26] [INFO ] Time to serialize properties into /tmp/CTLFireability6131326475938854474.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability16769714696862544702.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6131326475938854474.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,458380,3.72214,100608,3760,72,68063,380,797,997401,72,1352,0
Converting to forward existential form...Done !
original formula: E((((AX(AF(((((i0.u1.p12==1)&&(i0.u6.p26==1))&&((i0.u11.p40==1)&&(i0.u16.p54==1)))&&(((i0.u10.p68==1)&&(i0.u2.p82==1))&&((i0.u7.p96==1)&&...828
=> equivalent forward existential formula: [(FwdU(Init,(((!(EX(!(!(EG(!(((((i0.u1.p12==1)&&(i0.u6.p26==1))&&((i0.u11.p40==1)&&(i0.u16.p54==1)))&&(((i0.u10....904
Reverse transition relation is NOT exact ! Due to transitions t5, t10, t15, t21, t25, t35, t41, t46, t48, t50, t52, t53, t55, t57, t60, t62, t64, t66, t68,...564
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
(forward)formula 0,1,215.664,2608472,1,0,705387,1245,2914,3.42582e+07,167,5272,422457
FORMULA StigmergyElection-PT-08a-CTLFireability-2025-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
Total runtime 804123 ms.
BK_STOP 1749165363059
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ CTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution CTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="StigmergyElection-PT-08a"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5832"
echo " Executing tool itstools"
echo " Input is StigmergyElection-PT-08a, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r226-smll-174903491000258"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/StigmergyElection-PT-08a.tgz
mv StigmergyElection-PT-08a execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "CTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;