About the Execution of ITS-Tools for MultiCrashLeafsetExtension-PT-S16C03
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 0.000 | 667234.00 | 0.00 | 0.00 | FFFTFFFTTTFFFFFF | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r128-smll-174876524300292.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 MultiCrashLeafsetExtension-PT-S16C03, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r128-smll-174876524300292
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.0M
-rw-r--r-- 1 mcc users 13K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.6K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 5.9K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.6K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 18K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 104K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 17K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 78K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.4K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.4K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 7 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 3.5M May 29 14:32 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 MultiCrashLeafsetExtension-PT-S16C03-LTLFireability-00
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C03-LTLFireability-01
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C03-LTLFireability-02
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C03-LTLFireability-03
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C03-LTLFireability-04
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C03-LTLFireability-05
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C03-LTLFireability-06
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C03-LTLFireability-07
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C03-LTLFireability-08
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C03-LTLFireability-09
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C03-LTLFireability-10
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C03-LTLFireability-11
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C03-LTLFireability-12
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C03-LTLFireability-13
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C03-LTLFireability-14
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C03-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1748911821044
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MultiCrashLeafsetExtension-PT-S16C03
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202505121319
[2025-06-03 00:50:22] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-03 00:50:22] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-03 00:50:23] [INFO ] Load time of PNML (sax parser for PT used): 471 ms
[2025-06-03 00:50:23] [INFO ] Transformed 3606 places.
[2025-06-03 00:50:23] [INFO ] Transformed 5141 transitions.
[2025-06-03 00:50:23] [INFO ] Parsed PT model containing 3606 places and 5141 transitions and 20838 arcs in 681 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 17 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA MultiCrashLeafsetExtension-PT-S16C03-LTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiCrashLeafsetExtension-PT-S16C03-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiCrashLeafsetExtension-PT-S16C03-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 66 out of 3606 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3606/3606 places, 5141/5141 transitions.
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 0 with 26 rules applied. Total rules applied 26 place count 3580 transition count 5141
Discarding 804 places :
Symmetric choice reduction at 1 with 804 rule applications. Total rules 830 place count 2776 transition count 4337
Iterating global reduction 1 with 804 rules applied. Total rules applied 1634 place count 2776 transition count 4337
Discarding 702 places :
Symmetric choice reduction at 1 with 702 rule applications. Total rules 2336 place count 2074 transition count 3635
Iterating global reduction 1 with 702 rules applied. Total rules applied 3038 place count 2074 transition count 3635
Discarding 222 places :
Symmetric choice reduction at 1 with 222 rule applications. Total rules 3260 place count 1852 transition count 2969
Iterating global reduction 1 with 222 rules applied. Total rules applied 3482 place count 1852 transition count 2969
Applied a total of 3482 rules in 1378 ms. Remains 1852 /3606 variables (removed 1754) and now considering 2969/5141 (removed 2172) transitions.
[2025-06-03 00:50:25] [INFO ] Flow matrix only has 2697 transitions (discarded 272 similar events)
// Phase 1: matrix 2697 rows 1852 cols
[2025-06-03 00:50:25] [INFO ] Computed 433 invariants in 179 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 00:50:31] [INFO ] Implicit Places using invariants in 5623 ms returned [4, 8, 12, 14, 18, 23, 30, 39, 50, 63, 78, 97, 113, 115, 117, 119, 133, 144, 153, 160, 165, 168, 183, 190, 193, 194, 195, 196, 199, 204, 211, 220, 231, 244, 258, 272, 273, 274, 275, 286, 295, 302, 307, 310, 312, 327, 334, 337, 338, 339, 340, 342, 345, 350, 357, 366, 377, 389, 401, 403, 404, 413, 423, 431, 433, 435, 450, 457, 460, 461, 462, 463, 465, 467, 470, 475, 482, 491, 501, 511, 512, 513, 514, 521, 526, 529, 531, 533, 535, 550, 557, 560, 561, 562, 563, 565, 567, 569, 572, 577, 584, 592, 600, 601, 602, 603, 608, 611, 613, 615, 619, 634, 641, 645, 646, 647, 649, 651, 656, 658, 661, 666, 673, 679, 680, 681, 682, 685, 687, 689, 691, 693, 695, 717, 720, 721, 723, 728, 730, 732, 734, 736, 739, 743, 747, 748, 749, 750, 752, 754, 756, 758, 760, 762, 777, 784, 788, 789, 790, 792, 794, 796, 798, 800, 805, 807, 810, 811, 812, 813, 815, 817, 819, 821, 823, 826, 841, 843, 847, 850, 851, 853, 855, 857, 861, 863, 865, 867, 869, 872, 873, 874, 875, 877, 879, 881, 883, 885, 887, 902, 909, 912, 913, 914, 915, 917, 919, 921, 923, 925, 927, 929, 933, 935, 937, 939, 941, 946, 948, 950, 967, 974, 977, 979, 980, 982, 984, 986, 988, 992, 994, 997, 1002, 1003, 1004, 1005, 1008, 1010, 1012, 1014, 1016, 1018, 1033, 1040, 1043, 1044, 1045, 1046, 1048, 1050, 1052, 1054, 1056, 1059, 1064, 1071, 1072, 1073, 1074, 1079, 1082, 1084, 1086, 1088, 1090, 1105, 1112, 1115, 1116, 1117, 1118, 1120, 1122, 1124, 1126, 1129, 1134, 1141, 1150, 1151, 1152, 1153, 1160, 1165, 1168, 1170, 1172, 1174, 1189, 1196, 1199, 1200, 1201, 1202, 1204, 1206, 1208, 1211, 1216, 1223, 1232, 1243, 1244, 1245, 1246, 1255, 1262, 1267, 1270, 1272, 1274, 1296, 1299, 1300, 1301, 1302, 1304, 1306, 1309, 1321, 1330, 1341, 1355, 1356, 1357, 1370, 1379, 1386, 1391, 1394, 1396, 1411, 1418, 1421, 1423, 1424, 1428, 1431, 1436, 1443, 1452, 1463, 1476, 1491, 1492, 1493, 1494, 1507, 1518, 1527, 1534, 1539, 1542, 1559, 1563, 1567, 1568, 1569, 1574, 1579, 1586, 1596, 1607, 1620, 1635, 1652, 1653, 1654, 1655, 1670, 1683, 1694, 1703, 1710, 1715, 1731]
[2025-06-03 00:50:31] [INFO ] Actually due to overlaps returned [183, 327, 450, 550, 634, 777, 841, 902, 967, 1033, 1105, 1189, 1411, 1731, 4, 12, 14, 39, 113, 115, 117, 153, 165, 193, 194, 195, 211, 272, 273, 274, 302, 310, 337, 338, 339, 350, 401, 403, 433, 460, 461, 462, 470, 511, 512, 513, 529, 533, 560, 561, 562, 569, 600, 601, 602, 613, 645, 646, 679, 680, 681, 689, 693, 720, 721, 734, 747, 748, 749, 756, 760, 788, 789, 798, 810, 811, 812, 819, 823, 843, 850, 851, 863, 872, 873, 874, 881, 885, 912, 913, 914, 923, 933, 941, 948, 977, 979, 988, 1002, 1003, 1004, 1012, 1016, 1043, 1044, 1045, 1054, 1071, 1072, 1073, 1084, 1088, 1115, 1116, 1117, 1126, 1150, 1151, 1152, 1168, 1172, 1199, 1200, 1201, 1211, 1243, 1244, 1245, 1272, 1299, 1300, 1301, 1355, 1356, 1391, 1394, 1421, 1423, 1443, 1491, 1492, 1493, 1534, 1559, 1567, 1568, 1596, 1652, 1653, 1654, 1703, 1715]
Discarding 152 places :
Implicit Place search using SMT only with invariants took 5698 ms to find 152 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1700/3606 places, 2969/5141 transitions.
Discarding 84 places :
Symmetric choice reduction at 0 with 84 rule applications. Total rules 84 place count 1616 transition count 2885
Iterating global reduction 0 with 84 rules applied. Total rules applied 168 place count 1616 transition count 2885
Discarding 84 places :
Symmetric choice reduction at 0 with 84 rule applications. Total rules 252 place count 1532 transition count 2801
Iterating global reduction 0 with 84 rules applied. Total rules applied 336 place count 1532 transition count 2801
Discarding 84 places :
Symmetric choice reduction at 0 with 84 rule applications. Total rules 420 place count 1448 transition count 2717
Iterating global reduction 0 with 84 rules applied. Total rules applied 504 place count 1448 transition count 2717
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 525 place count 1427 transition count 2654
Iterating global reduction 0 with 21 rules applied. Total rules applied 546 place count 1427 transition count 2654
Applied a total of 546 rules in 553 ms. Remains 1427 /1700 variables (removed 273) and now considering 2654/2969 (removed 315) transitions.
[2025-06-03 00:50:31] [INFO ] Flow matrix only has 2382 transitions (discarded 272 similar events)
// Phase 1: matrix 2382 rows 1427 cols
[2025-06-03 00:50:31] [INFO ] Computed 281 invariants in 74 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 00:50:35] [INFO ] Implicit Places using invariants in 3525 ms returned [7, 15, 20, 27, 46, 59, 74, 93, 112, 126, 137, 152, 159, 180, 183, 186, 191, 206, 217, 230, 244, 257, 268, 277, 288, 292, 303, 305, 307, 310, 321, 330, 341, 353, 366, 375, 385, 393, 396, 407, 409, 411, 413, 420, 427, 436, 446, 455, 462, 467, 471, 474, 483, 485, 487, 489, 493, 498, 505, 513, 520, 525, 528, 531, 535, 544, 548, 550, 552, 557, 559, 562, 567, 574, 579, 582, 584, 587, 590, 602, 606, 611, 613, 615, 618, 621, 625, 628, 630, 632, 635, 638, 649, 653, 655, 657, 659, 662, 667, 669, 671, 673, 675, 678, 682, 691, 695, 697, 699, 703, 706, 708, 710, 712, 714, 716, 719, 722, 733, 735, 737, 739, 741, 744, 746, 748, 753, 755, 757, 763, 766, 781, 785, 787, 789, 791, 796, 798, 801, 805, 808, 810, 813, 816, 827, 829, 831, 833, 835, 838, 841, 846, 852, 857, 860, 863, 866, 875, 877, 879, 881, 883, 887, 892, 899, 907, 914, 919, 923, 926, 935, 937, 939, 941, 943, 950, 957, 966, 976, 985, 992, 997, 1000, 1003, 1013, 1015, 1017, 1019, 1022, 1034, 1043, 1054, 1068, 1081, 1090, 1097, 1105, 1116, 1120, 1124, 1127, 1132, 1147, 1158, 1171, 1185, 1198, 1209, 1218, 1229, 1232, 1242, 1246, 1251, 1256, 1263, 1283, 1296, 1311, 1327, 1342, 1355, 1366, 1381]
Discarding 224 places :
Implicit Place search using SMT only with invariants took 3533 ms to find 224 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1203/3606 places, 2654/5141 transitions.
Applied a total of 0 rules in 112 ms. Remains 1203 /1203 variables (removed 0) and now considering 2654/2654 (removed 0) transitions.
Finished structural reductions in LTL mode , in 3 iterations and 11307 ms. Remains : 1203/3606 places, 2654/5141 transitions.
Support contains 66 out of 1203 places after structural reductions.
[2025-06-03 00:50:36] [INFO ] Flatten gal took : 416 ms
[2025-06-03 00:50:36] [INFO ] Flatten gal took : 284 ms
[2025-06-03 00:50:36] [INFO ] Input system was already deterministic with 2654 transitions.
Support contains 64 out of 1203 places (down from 66) after GAL structural reductions.
RANDOM walk for 40000 steps (1265 resets) in 3458 ms. (11 steps per ms) remains 13/29 properties
BEST_FIRST walk for 40003 steps (320 resets) in 321 ms. (124 steps per ms) remains 12/13 properties
BEST_FIRST walk for 40002 steps (320 resets) in 247 ms. (161 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (320 resets) in 248 ms. (160 steps per ms) remains 11/12 properties
BEST_FIRST walk for 40003 steps (320 resets) in 303 ms. (131 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (320 resets) in 306 ms. (130 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40001 steps (320 resets) in 310 ms. (128 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (320 resets) in 286 ms. (139 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (320 resets) in 273 ms. (145 steps per ms) remains 10/11 properties
BEST_FIRST walk for 40003 steps (320 resets) in 239 ms. (166 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (320 resets) in 227 ms. (175 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (320 resets) in 227 ms. (175 steps per ms) remains 10/10 properties
[2025-06-03 00:50:38] [INFO ] Flow matrix only has 2382 transitions (discarded 272 similar events)
// Phase 1: matrix 2382 rows 1203 cols
[2025-06-03 00:50:38] [INFO ] Computed 57 invariants in 51 ms
[2025-06-03 00:50:39] [INFO ] State equation strengthened by 876 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Problem AtomicPropp24 is UNSAT
At refinement iteration 1 (OVERLAPS) 1066/1090 variables, 15/15 constraints. Problems are: Problem set: 1 solved, 9 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:50:41] [INFO ] Deduced a trap composed of 257 places in 1868 ms of which 533 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:50:42] [INFO ] Deduced a trap composed of 334 places in 1359 ms of which 415 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:50:44] [INFO ] Deduced a trap composed of 490 places in 1598 ms of which 614 ms to minimize.
SMT process timed out in 5629ms, After SMT, problems are : Problem set: 1 solved, 9 unsolved
Fused 9 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 21 out of 1203 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1203/1203 places, 2654/2654 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 1203 transition count 2642
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 24 place count 1191 transition count 2642
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 24 place count 1191 transition count 2629
Deduced a syphon composed of 13 places in 2 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 50 place count 1178 transition count 2629
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 59 place count 1169 transition count 2612
Iterating global reduction 2 with 9 rules applied. Total rules applied 68 place count 1169 transition count 2612
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 68 place count 1169 transition count 2611
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 70 place count 1168 transition count 2611
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 75 place count 1163 transition count 2596
Iterating global reduction 2 with 5 rules applied. Total rules applied 80 place count 1163 transition count 2596
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 2 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 2 with 48 rules applied. Total rules applied 128 place count 1139 transition count 2572
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 134 place count 1133 transition count 2566
Iterating global reduction 2 with 6 rules applied. Total rules applied 140 place count 1133 transition count 2566
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 146 place count 1127 transition count 2548
Iterating global reduction 2 with 6 rules applied. Total rules applied 152 place count 1127 transition count 2548
Free-agglomeration rule (complex) applied 132 times.
Iterating global reduction 2 with 132 rules applied. Total rules applied 284 place count 1127 transition count 2710
Reduce places removed 132 places and 0 transitions.
Iterating post reduction 2 with 132 rules applied. Total rules applied 416 place count 995 transition count 2710
Partial Free-agglomeration rule applied 9 times.
Drop transitions (Partial Free agglomeration) removed 9 transitions
Iterating global reduction 3 with 9 rules applied. Total rules applied 425 place count 995 transition count 2710
Applied a total of 425 rules in 1068 ms. Remains 995 /1203 variables (removed 208) and now considering 2710/2654 (removed -56) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1069 ms. Remains : 995/1203 places, 2710/2654 transitions.
RANDOM walk for 40000 steps (2120 resets) in 1212 ms. (32 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (231 resets) in 178 ms. (223 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (228 resets) in 126 ms. (314 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (225 resets) in 217 ms. (183 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (225 resets) in 153 ms. (259 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (192 resets) in 133 ms. (298 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (223 resets) in 145 ms. (274 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (192 resets) in 159 ms. (250 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (229 resets) in 135 ms. (294 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (260 resets) in 132 ms. (300 steps per ms) remains 9/9 properties
Interrupted probabilistic random walk after 44866 steps, run timeout after 3001 ms. (steps per millisecond=14 ) properties seen :0 out of 9
Probabilistic random walk after 44866 steps, saw 18944 distinct states, run finished after 3012 ms. (steps per millisecond=14 ) properties seen :0
[2025-06-03 00:50:49] [INFO ] Flow matrix only has 2322 transitions (discarded 388 similar events)
// Phase 1: matrix 2322 rows 995 cols
[2025-06-03 00:50:49] [INFO ] Computed 57 invariants in 47 ms
[2025-06-03 00:50:49] [INFO ] State equation strengthened by 1140 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Problem AtomicPropp28 is UNSAT
At refinement iteration 1 (OVERLAPS) 903/924 variables, 15/15 constraints. Problems are: Problem set: 1 solved, 8 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:50:51] [INFO ] Deduced a trap composed of 71 places in 1068 ms of which 63 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:50:52] [INFO ] Deduced a trap composed of 139 places in 1231 ms of which 208 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:50:53] [INFO ] Deduced a trap composed of 71 places in 822 ms of which 119 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:50:54] [INFO ] Deduced a trap composed of 71 places in 871 ms of which 118 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:50:55] [INFO ] Deduced a trap composed of 71 places in 1265 ms of which 115 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:50:56] [INFO ] Deduced a trap composed of 216 places in 1120 ms of which 304 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:50:57] [INFO ] Deduced a trap composed of 172 places in 1074 ms of which 239 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:50:59] [INFO ] Deduced a trap composed of 176 places in 1354 ms of which 417 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:51:00] [INFO ] Deduced a trap composed of 249 places in 1737 ms of which 540 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:51:02] [INFO ] Deduced a trap composed of 253 places in 1492 ms of which 417 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:51:03] [INFO ] Deduced a trap composed of 187 places in 1265 ms of which 278 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:51:04] [INFO ] Deduced a trap composed of 172 places in 1274 ms of which 326 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:51:06] [INFO ] Deduced a trap composed of 176 places in 1269 ms of which 251 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:51:07] [INFO ] Deduced a trap composed of 333 places in 949 ms of which 218 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:51:08] [INFO ] Deduced a trap composed of 341 places in 938 ms of which 220 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:51:09] [INFO ] Deduced a trap composed of 289 places in 1232 ms of which 195 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:51:10] [INFO ] Deduced a trap composed of 274 places in 1033 ms of which 219 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/924 variables, 17/32 constraints. Problems are: Problem set: 1 solved, 8 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:51:11] [INFO ] Deduced a trap composed of 291 places in 922 ms of which 200 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:51:12] [INFO ] Deduced a trap composed of 276 places in 1010 ms of which 225 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/924 variables, 2/34 constraints. Problems are: Problem set: 1 solved, 8 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:51:14] [INFO ] Deduced a trap composed of 220 places in 1358 ms of which 394 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:51:15] [INFO ] Deduced a trap composed of 228 places in 1337 ms of which 312 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:51:17] [INFO ] Deduced a trap composed of 249 places in 1311 ms of which 314 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:51:18] [INFO ] Deduced a trap composed of 253 places in 1137 ms of which 348 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:51:19] [INFO ] Deduced a trap composed of 297 places in 1238 ms of which 402 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:51:20] [INFO ] Deduced a trap composed of 305 places in 1244 ms of which 427 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:51:21] [INFO ] Deduced a trap composed of 226 places in 1119 ms of which 299 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:51:23] [INFO ] Deduced a trap composed of 230 places in 1153 ms of which 321 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:51:24] [INFO ] Deduced a trap composed of 372 places in 1328 ms of which 502 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:51:25] [INFO ] Deduced a trap composed of 423 places in 1271 ms of which 446 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:51:27] [INFO ] Deduced a trap composed of 427 places in 1378 ms of which 564 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:51:28] [INFO ] Deduced a trap composed of 226 places in 1138 ms of which 298 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:51:29] [INFO ] Deduced a trap composed of 300 places in 1215 ms of which 386 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:51:30] [INFO ] Deduced a trap composed of 230 places in 1126 ms of which 319 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:51:32] [INFO ] Deduced a trap composed of 310 places in 1225 ms of which 414 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:51:33] [INFO ] Deduced a trap composed of 423 places in 1323 ms of which 496 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/924 variables, 16/50 constraints. Problems are: Problem set: 1 solved, 8 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:51:34] [INFO ] Deduced a trap composed of 338 places in 954 ms of which 223 ms to minimize.
SMT process timed out in 45164ms, After SMT, problems are : Problem set: 1 solved, 8 unsolved
Fused 8 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 16 out of 995 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 995/995 places, 2710/2710 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 995 transition count 2709
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 994 transition count 2709
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 993 transition count 2708
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 993 transition count 2708
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 992 transition count 2707
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 992 transition count 2701
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 18 place count 986 transition count 2701
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 986 transition count 2701
Applied a total of 19 rules in 611 ms. Remains 986 /995 variables (removed 9) and now considering 2701/2710 (removed 9) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 611 ms. Remains : 986/995 places, 2701/2710 transitions.
RANDOM walk for 40000 steps (2124 resets) in 1009 ms. (39 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (227 resets) in 192 ms. (207 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (226 resets) in 158 ms. (251 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (226 resets) in 113 ms. (350 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (224 resets) in 113 ms. (350 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (193 resets) in 138 ms. (287 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (223 resets) in 152 ms. (261 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (193 resets) in 189 ms. (210 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (229 resets) in 202 ms. (197 steps per ms) remains 8/8 properties
Interrupted probabilistic random walk after 48988 steps, run timeout after 3001 ms. (steps per millisecond=16 ) properties seen :0 out of 8
Probabilistic random walk after 48988 steps, saw 20650 distinct states, run finished after 3001 ms. (steps per millisecond=16 ) properties seen :0
[2025-06-03 00:51:38] [INFO ] Flow matrix only has 2307 transitions (discarded 394 similar events)
// Phase 1: matrix 2307 rows 986 cols
[2025-06-03 00:51:39] [INFO ] Computed 57 invariants in 42 ms
[2025-06-03 00:51:39] [INFO ] State equation strengthened by 1140 read => feed constraints.
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 878/894 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:51:40] [INFO ] Deduced a trap composed of 165 places in 970 ms of which 199 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:51:41] [INFO ] Deduced a trap composed of 213 places in 1198 ms of which 243 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:51:42] [INFO ] Deduced a trap composed of 169 places in 947 ms of which 200 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:51:43] [INFO ] Deduced a trap composed of 221 places in 1009 ms of which 249 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:51:44] [INFO ] Deduced a trap composed of 169 places in 1055 ms of which 204 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:51:45] [INFO ] Deduced a trap composed of 242 places in 1165 ms of which 260 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:51:47] [INFO ] Deduced a trap composed of 219 places in 1121 ms of which 243 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:51:48] [INFO ] Deduced a trap composed of 354 places in 947 ms of which 227 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:51:49] [INFO ] Deduced a trap composed of 367 places in 1001 ms of which 242 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:51:50] [INFO ] Deduced a trap composed of 223 places in 978 ms of which 239 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/894 variables, 10/23 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/894 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (OVERLAPS) 24/918 variables, 6/29 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:51:51] [INFO ] Deduced a trap composed of 81 places in 895 ms of which 69 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:51:52] [INFO ] Deduced a trap composed of 80 places in 1039 ms of which 69 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:51:53] [INFO ] Deduced a trap composed of 82 places in 970 ms of which 73 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:51:54] [INFO ] Deduced a trap composed of 81 places in 1026 ms of which 72 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:51:55] [INFO ] Deduced a trap composed of 83 places in 948 ms of which 72 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:51:56] [INFO ] Deduced a trap composed of 70 places in 913 ms of which 64 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:51:57] [INFO ] Deduced a trap composed of 103 places in 920 ms of which 86 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:51:58] [INFO ] Deduced a trap composed of 81 places in 909 ms of which 72 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:51:59] [INFO ] Deduced a trap composed of 70 places in 1142 ms of which 91 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:52:00] [INFO ] Deduced a trap composed of 81 places in 933 ms of which 73 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:52:01] [INFO ] Deduced a trap composed of 93 places in 954 ms of which 80 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:52:02] [INFO ] Deduced a trap composed of 104 places in 959 ms of which 88 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:52:03] [INFO ] Deduced a trap composed of 110 places in 998 ms of which 152 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:52:04] [INFO ] Deduced a trap composed of 290 places in 1179 ms of which 366 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:52:05] [INFO ] Deduced a trap composed of 70 places in 971 ms of which 111 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:52:06] [INFO ] Deduced a trap composed of 81 places in 976 ms of which 117 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:52:07] [INFO ] Deduced a trap composed of 109 places in 1148 ms of which 155 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:52:09] [INFO ] Deduced a trap composed of 92 places in 1144 ms of which 128 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:52:10] [INFO ] Deduced a trap composed of 115 places in 1263 ms of which 153 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:52:11] [INFO ] Deduced a trap composed of 293 places in 1315 ms of which 365 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/918 variables, 20/49 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:52:12] [INFO ] Deduced a trap composed of 87 places in 919 ms of which 75 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:52:13] [INFO ] Deduced a trap composed of 88 places in 1182 ms of which 122 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:52:14] [INFO ] Deduced a trap composed of 83 places in 1036 ms of which 119 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:52:15] [INFO ] Deduced a trap composed of 70 places in 948 ms of which 104 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:52:16] [INFO ] Deduced a trap composed of 87 places in 985 ms of which 126 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:52:18] [INFO ] Deduced a trap composed of 171 places in 1040 ms of which 242 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:52:19] [INFO ] Deduced a trap composed of 416 places in 1324 ms of which 508 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:52:20] [INFO ] Deduced a trap composed of 246 places in 1136 ms of which 344 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:52:21] [INFO ] Deduced a trap composed of 84 places in 991 ms of which 129 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:52:22] [INFO ] Deduced a trap composed of 223 places in 1099 ms of which 295 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:52:24] [INFO ] Deduced a trap composed of 420 places in 1359 ms of which 556 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:52:25] [INFO ] Deduced a trap composed of 84 places in 959 ms of which 117 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:52:26] [INFO ] Deduced a trap composed of 225 places in 1107 ms of which 298 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:52:27] [INFO ] Deduced a trap composed of 420 places in 1438 ms of which 634 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:52:29] [INFO ] Deduced a trap composed of 422 places in 1408 ms of which 601 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/918 variables, 15/64 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/918 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (OVERLAPS) 48/966 variables, 18/82 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:52:30] [INFO ] Deduced a trap composed of 5 places in 907 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:52:31] [INFO ] Deduced a trap composed of 27 places in 941 ms of which 64 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:52:32] [INFO ] Deduced a trap composed of 75 places in 1013 ms of which 130 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:52:33] [INFO ] Deduced a trap composed of 90 places in 1028 ms of which 148 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:52:34] [INFO ] Deduced a trap composed of 97 places in 981 ms of which 162 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:52:35] [INFO ] Deduced a trap composed of 102 places in 1082 ms of which 167 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:52:36] [INFO ] Deduced a trap composed of 118 places in 1046 ms of which 194 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:52:38] [INFO ] Deduced a trap composed of 123 places in 1029 ms of which 184 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:52:39] [INFO ] Deduced a trap composed of 103 places in 1038 ms of which 169 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:52:40] [INFO ] Deduced a trap composed of 125 places in 1075 ms of which 199 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:52:41] [INFO ] Deduced a trap composed of 130 places in 1082 ms of which 198 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:52:42] [INFO ] Deduced a trap composed of 138 places in 1054 ms of which 211 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:52:43] [INFO ] Deduced a trap composed of 172 places in 1276 ms of which 260 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:52:44] [INFO ] Deduced a trap composed of 177 places in 1109 ms of which 271 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:52:45] [INFO ] Deduced a trap composed of 27 places in 1025 ms of which 62 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:52:46] [INFO ] Deduced a trap composed of 75 places in 971 ms of which 130 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:52:48] [INFO ] Deduced a trap composed of 150 places in 1168 ms of which 166 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:52:49] [INFO ] Deduced a trap composed of 161 places in 955 ms of which 159 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:52:50] [INFO ] Deduced a trap composed of 160 places in 1063 ms of which 210 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:52:51] [INFO ] Deduced a trap composed of 171 places in 1082 ms of which 177 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/966 variables, 20/102 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:52:52] [INFO ] Deduced a trap composed of 153 places in 1108 ms of which 165 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:52:53] [INFO ] Deduced a trap composed of 151 places in 925 ms of which 159 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:52:54] [INFO ] Deduced a trap composed of 152 places in 911 ms of which 162 ms to minimize.
SMT process timed out in 75496ms, After SMT, problems are : Problem set: 0 solved, 8 unsolved
Fused 8 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 16 out of 986 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 986/986 places, 2701/2701 transitions.
Applied a total of 0 rules in 87 ms. Remains 986 /986 variables (removed 0) and now considering 2701/2701 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 87 ms. Remains : 986/986 places, 2701/2701 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 986/986 places, 2701/2701 transitions.
Applied a total of 0 rules in 86 ms. Remains 986 /986 variables (removed 0) and now considering 2701/2701 (removed 0) transitions.
[2025-06-03 00:52:54] [INFO ] Flow matrix only has 2307 transitions (discarded 394 similar events)
[2025-06-03 00:52:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 00:52:57] [INFO ] Implicit Places using invariants in 2365 ms returned [7, 275, 291, 387, 397, 422, 429, 454, 476, 507, 508, 525, 665, 679, 711, 747, 837, 842]
[2025-06-03 00:52:57] [INFO ] Actually due to overlaps returned [422, 665, 837, 7, 275, 397, 429, 454, 476, 507, 508, 525, 711, 747, 842]
Discarding 15 places :
Implicit Place search using SMT only with invariants took 2371 ms to find 15 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 971/986 places, 2701/2701 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 963 transition count 2693
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 963 transition count 2693
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 24 place count 955 transition count 2685
Iterating global reduction 0 with 8 rules applied. Total rules applied 32 place count 955 transition count 2685
Applied a total of 32 rules in 243 ms. Remains 955 /971 variables (removed 16) and now considering 2685/2701 (removed 16) transitions.
[2025-06-03 00:52:57] [INFO ] Flow matrix only has 2291 transitions (discarded 394 similar events)
// Phase 1: matrix 2291 rows 955 cols
[2025-06-03 00:52:57] [INFO ] Computed 42 invariants in 41 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 00:52:59] [INFO ] Implicit Places using invariants in 2497 ms returned [289, 385, 663]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 2503 ms to find 3 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 952/986 places, 2685/2701 transitions.
Applied a total of 0 rules in 142 ms. Remains 952 /952 variables (removed 0) and now considering 2685/2685 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 5347 ms. Remains : 952/986 places, 2685/2701 transitions.
Successfully simplified 2 atomic propositions for a total of 13 simplifications.
FORMULA MultiCrashLeafsetExtension-PT-S16C03-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 371 stabilizing places and 1021 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 1203 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1203/1203 places, 2654/2654 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 1187 transition count 2630
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 1187 transition count 2630
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 44 place count 1175 transition count 2606
Iterating global reduction 0 with 12 rules applied. Total rules applied 56 place count 1175 transition count 2606
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 62 place count 1169 transition count 2588
Iterating global reduction 0 with 6 rules applied. Total rules applied 68 place count 1169 transition count 2588
Applied a total of 68 rules in 324 ms. Remains 1169 /1203 variables (removed 34) and now considering 2588/2654 (removed 66) transitions.
[2025-06-03 00:53:00] [INFO ] Flow matrix only has 2316 transitions (discarded 272 similar events)
// Phase 1: matrix 2316 rows 1169 cols
[2025-06-03 00:53:00] [INFO ] Computed 57 invariants in 46 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 00:53:03] [INFO ] Implicit Places using invariants in 2636 ms returned [12, 327, 346, 462, 474, 505, 514, 545, 570, 605, 606, 627, 795, 811, 848, 892, 995, 1002]
[2025-06-03 00:53:03] [INFO ] Actually due to overlaps returned [505, 795, 995, 12, 327, 474, 514, 545, 570, 605, 606, 627, 848, 892, 1002]
Discarding 15 places :
Implicit Place search using SMT only with invariants took 2645 ms to find 15 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1154/1203 places, 2588/2654 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 1142 transition count 2576
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 1142 transition count 2576
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 36 place count 1130 transition count 2564
Iterating global reduction 0 with 12 rules applied. Total rules applied 48 place count 1130 transition count 2564
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 60 place count 1118 transition count 2552
Iterating global reduction 0 with 12 rules applied. Total rules applied 72 place count 1118 transition count 2552
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 83 place count 1107 transition count 2519
Iterating global reduction 0 with 11 rules applied. Total rules applied 94 place count 1107 transition count 2519
Applied a total of 94 rules in 369 ms. Remains 1107 /1154 variables (removed 47) and now considering 2519/2588 (removed 69) transitions.
[2025-06-03 00:53:03] [INFO ] Flow matrix only has 2247 transitions (discarded 272 similar events)
// Phase 1: matrix 2247 rows 1107 cols
[2025-06-03 00:53:03] [INFO ] Computed 42 invariants in 28 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 00:53:05] [INFO ] Implicit Places using invariants in 1935 ms returned [340, 454, 774]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 1937 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1104/1203 places, 2519/2654 transitions.
Applied a total of 0 rules in 72 ms. Remains 1104 /1104 variables (removed 0) and now considering 2519/2519 (removed 0) transitions.
Finished structural reductions in LTL mode , in 3 iterations and 5356 ms. Remains : 1104/1203 places, 2519/2654 transitions.
Stuttering acceptance computed with spot in 357 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C03-LTLFireability-00
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 2 ms.
FORMULA MultiCrashLeafsetExtension-PT-S16C03-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S16C03-LTLFireability-00 finished in 5863 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 1203 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1203/1203 places, 2654/2654 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 1203 transition count 2642
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 24 place count 1191 transition count 2642
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 14 Pre rules applied. Total rules applied 24 place count 1191 transition count 2628
Deduced a syphon composed of 14 places in 2 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 52 place count 1177 transition count 2628
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 62 place count 1167 transition count 2610
Iterating global reduction 2 with 10 rules applied. Total rules applied 72 place count 1167 transition count 2610
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 72 place count 1167 transition count 2608
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 76 place count 1165 transition count 2608
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 82 place count 1159 transition count 2590
Iterating global reduction 2 with 6 rules applied. Total rules applied 88 place count 1159 transition count 2590
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 2 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 50 rules applied. Total rules applied 138 place count 1134 transition count 2565
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 144 place count 1128 transition count 2559
Iterating global reduction 2 with 6 rules applied. Total rules applied 150 place count 1128 transition count 2559
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 156 place count 1122 transition count 2541
Iterating global reduction 2 with 6 rules applied. Total rules applied 162 place count 1122 transition count 2541
Applied a total of 162 rules in 668 ms. Remains 1122 /1203 variables (removed 81) and now considering 2541/2654 (removed 113) transitions.
[2025-06-03 00:53:06] [INFO ] Flow matrix only has 2269 transitions (discarded 272 similar events)
// Phase 1: matrix 2269 rows 1122 cols
[2025-06-03 00:53:06] [INFO ] Computed 57 invariants in 36 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 00:53:09] [INFO ] Implicit Places using invariants in 2340 ms returned [9, 311, 330, 443, 454, 484, 492, 521, 544, 577, 578, 596, 760, 775, 812, 854, 956, 962]
[2025-06-03 00:53:09] [INFO ] Actually due to overlaps returned [484, 760, 956, 9, 311, 454, 492, 521, 544, 577, 578, 596, 812, 854, 962]
Discarding 15 places :
Implicit Place search using SMT only with invariants took 2345 ms to find 15 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1107/1203 places, 2541/2654 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 1099 transition count 2533
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 1099 transition count 2533
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 24 place count 1091 transition count 2525
Iterating global reduction 0 with 8 rules applied. Total rules applied 32 place count 1091 transition count 2525
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 39 place count 1084 transition count 2504
Iterating global reduction 0 with 7 rules applied. Total rules applied 46 place count 1084 transition count 2504
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 2 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 54 place count 1080 transition count 2500
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 58 place count 1076 transition count 2496
Iterating global reduction 0 with 4 rules applied. Total rules applied 62 place count 1076 transition count 2496
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 66 place count 1072 transition count 2484
Iterating global reduction 0 with 4 rules applied. Total rules applied 70 place count 1072 transition count 2484
Applied a total of 70 rules in 923 ms. Remains 1072 /1107 variables (removed 35) and now considering 2484/2541 (removed 57) transitions.
[2025-06-03 00:53:10] [INFO ] Flow matrix only has 2212 transitions (discarded 272 similar events)
// Phase 1: matrix 2212 rows 1072 cols
[2025-06-03 00:53:10] [INFO ] Computed 42 invariants in 30 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 00:53:12] [INFO ] Implicit Places using invariants in 1967 ms returned [325, 437, 747]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 1973 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 1069/1203 places, 2484/2654 transitions.
Applied a total of 0 rules in 113 ms. Remains 1069 /1069 variables (removed 0) and now considering 2484/2484 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 6027 ms. Remains : 1069/1203 places, 2484/2654 transitions.
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C03-LTLFireability-01
Stuttering criterion allowed to conclude after 21 steps with 0 reset in 4 ms.
FORMULA MultiCrashLeafsetExtension-PT-S16C03-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S16C03-LTLFireability-01 finished in 6100 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F((X((p1||F(p2)))&&p0)) U (p2||(p3 U p1))))'
Support contains 7 out of 1203 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1203/1203 places, 2654/2654 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 1191 transition count 2636
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 1191 transition count 2636
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 33 place count 1182 transition count 2619
Iterating global reduction 0 with 9 rules applied. Total rules applied 42 place count 1182 transition count 2619
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 47 place count 1177 transition count 2604
Iterating global reduction 0 with 5 rules applied. Total rules applied 52 place count 1177 transition count 2604
Applied a total of 52 rules in 289 ms. Remains 1177 /1203 variables (removed 26) and now considering 2604/2654 (removed 50) transitions.
[2025-06-03 00:53:12] [INFO ] Flow matrix only has 2332 transitions (discarded 272 similar events)
// Phase 1: matrix 2332 rows 1177 cols
[2025-06-03 00:53:12] [INFO ] Computed 57 invariants in 49 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 00:53:15] [INFO ] Implicit Places using invariants in 2603 ms returned [330, 349, 465, 477, 509, 518, 549, 574, 609, 610, 801, 817, 900, 1003, 1010]
[2025-06-03 00:53:15] [INFO ] Actually due to overlaps returned [509, 801, 1003, 330, 477, 518, 549, 574, 609, 610, 900, 1010]
Discarding 12 places :
Implicit Place search using SMT only with invariants took 2606 ms to find 12 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1165/1203 places, 2604/2654 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 1156 transition count 2595
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 1156 transition count 2595
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 27 place count 1147 transition count 2586
Iterating global reduction 0 with 9 rules applied. Total rules applied 36 place count 1147 transition count 2586
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 45 place count 1138 transition count 2577
Iterating global reduction 0 with 9 rules applied. Total rules applied 54 place count 1138 transition count 2577
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 62 place count 1130 transition count 2553
Iterating global reduction 0 with 8 rules applied. Total rules applied 70 place count 1130 transition count 2553
Applied a total of 70 rules in 357 ms. Remains 1130 /1165 variables (removed 35) and now considering 2553/2604 (removed 51) transitions.
[2025-06-03 00:53:15] [INFO ] Flow matrix only has 2281 transitions (discarded 272 similar events)
// Phase 1: matrix 2281 rows 1130 cols
[2025-06-03 00:53:15] [INFO ] Computed 45 invariants in 31 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 00:53:18] [INFO ] Implicit Places using invariants in 2877 ms returned [347, 461, 788]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 2880 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1127/1203 places, 2553/2654 transitions.
Applied a total of 0 rules in 109 ms. Remains 1127 /1127 variables (removed 0) and now considering 2553/2553 (removed 0) transitions.
Finished structural reductions in LTL mode , in 3 iterations and 6245 ms. Remains : 1127/1203 places, 2553/2654 transitions.
Stuttering acceptance computed with spot in 388 ms :[(AND (NOT p1) (NOT p2)), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C03-LTLFireability-02
Stuttering criterion allowed to conclude after 30 steps with 0 reset in 2 ms.
FORMULA MultiCrashLeafsetExtension-PT-S16C03-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S16C03-LTLFireability-02 finished in 6688 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(((X(X(p1))||(p1 U p2))&&p0))))'
Support contains 7 out of 1203 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1203/1203 places, 2654/2654 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 1188 transition count 2631
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 1188 transition count 2631
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 41 place count 1177 transition count 2610
Iterating global reduction 0 with 11 rules applied. Total rules applied 52 place count 1177 transition count 2610
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 58 place count 1171 transition count 2592
Iterating global reduction 0 with 6 rules applied. Total rules applied 64 place count 1171 transition count 2592
Applied a total of 64 rules in 473 ms. Remains 1171 /1203 variables (removed 32) and now considering 2592/2654 (removed 62) transitions.
[2025-06-03 00:53:19] [INFO ] Flow matrix only has 2320 transitions (discarded 272 similar events)
// Phase 1: matrix 2320 rows 1171 cols
[2025-06-03 00:53:19] [INFO ] Computed 57 invariants in 45 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 00:53:22] [INFO ] Implicit Places using invariants in 2968 ms returned [12, 327, 346, 462, 474, 505, 514, 545, 570, 605, 606, 627, 795, 811, 848, 892, 995]
[2025-06-03 00:53:22] [INFO ] Actually due to overlaps returned [505, 795, 995, 12, 327, 474, 514, 545, 570, 605, 606, 627, 848, 892]
Discarding 14 places :
Implicit Place search using SMT only with invariants took 2971 ms to find 14 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1157/1203 places, 2592/2654 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 1146 transition count 2581
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 1146 transition count 2581
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 33 place count 1135 transition count 2570
Iterating global reduction 0 with 11 rules applied. Total rules applied 44 place count 1135 transition count 2570
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 55 place count 1124 transition count 2559
Iterating global reduction 0 with 11 rules applied. Total rules applied 66 place count 1124 transition count 2559
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 76 place count 1114 transition count 2529
Iterating global reduction 0 with 10 rules applied. Total rules applied 86 place count 1114 transition count 2529
Applied a total of 86 rules in 497 ms. Remains 1114 /1157 variables (removed 43) and now considering 2529/2592 (removed 63) transitions.
[2025-06-03 00:53:23] [INFO ] Flow matrix only has 2257 transitions (discarded 272 similar events)
// Phase 1: matrix 2257 rows 1114 cols
[2025-06-03 00:53:23] [INFO ] Computed 43 invariants in 39 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 00:53:25] [INFO ] Implicit Places using invariants in 2201 ms returned [340, 454, 774]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 2205 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1111/1203 places, 2529/2654 transitions.
Applied a total of 0 rules in 106 ms. Remains 1111 /1111 variables (removed 0) and now considering 2529/2529 (removed 0) transitions.
Finished structural reductions in LTL mode , in 3 iterations and 6255 ms. Remains : 1111/1203 places, 2529/2654 transitions.
Stuttering acceptance computed with spot in 299 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), true, (NOT p1), (AND (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C03-LTLFireability-04
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA MultiCrashLeafsetExtension-PT-S16C03-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S16C03-LTLFireability-04 finished in 6597 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||(G(p2)&&p1)))))'
Support contains 7 out of 1203 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1203/1203 places, 2654/2654 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 1203 transition count 2643
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 22 place count 1192 transition count 2643
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 22 place count 1192 transition count 2630
Deduced a syphon composed of 13 places in 2 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 48 place count 1179 transition count 2630
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 57 place count 1170 transition count 2613
Iterating global reduction 2 with 9 rules applied. Total rules applied 66 place count 1170 transition count 2613
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 66 place count 1170 transition count 2612
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 68 place count 1169 transition count 2612
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 73 place count 1164 transition count 2597
Iterating global reduction 2 with 5 rules applied. Total rules applied 78 place count 1164 transition count 2597
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 26
Deduced a syphon composed of 26 places in 1 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 2 with 52 rules applied. Total rules applied 130 place count 1138 transition count 2571
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 135 place count 1133 transition count 2566
Iterating global reduction 2 with 5 rules applied. Total rules applied 140 place count 1133 transition count 2566
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 145 place count 1128 transition count 2551
Iterating global reduction 2 with 5 rules applied. Total rules applied 150 place count 1128 transition count 2551
Applied a total of 150 rules in 551 ms. Remains 1128 /1203 variables (removed 75) and now considering 2551/2654 (removed 103) transitions.
[2025-06-03 00:53:26] [INFO ] Flow matrix only has 2279 transitions (discarded 272 similar events)
// Phase 1: matrix 2279 rows 1128 cols
[2025-06-03 00:53:26] [INFO ] Computed 57 invariants in 28 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 00:53:28] [INFO ] Implicit Places using invariants in 2276 ms returned [10, 312, 331, 444, 455, 525, 548, 581, 582, 600, 764, 816, 963, 969]
[2025-06-03 00:53:28] [INFO ] Actually due to overlaps returned [764, 963, 10, 312, 455, 525, 548, 581, 582, 600, 816, 969]
Discarding 12 places :
Implicit Place search using SMT only with invariants took 2280 ms to find 12 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1116/1203 places, 2551/2654 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 1111 transition count 2546
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 1111 transition count 2546
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 15 place count 1106 transition count 2541
Iterating global reduction 0 with 5 rules applied. Total rules applied 20 place count 1106 transition count 2541
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 24 place count 1102 transition count 2529
Iterating global reduction 0 with 4 rules applied. Total rules applied 28 place count 1102 transition count 2529
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 38 place count 1097 transition count 2524
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 43 place count 1092 transition count 2519
Iterating global reduction 0 with 5 rules applied. Total rules applied 48 place count 1092 transition count 2519
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 53 place count 1087 transition count 2504
Iterating global reduction 0 with 5 rules applied. Total rules applied 58 place count 1087 transition count 2504
Applied a total of 58 rules in 592 ms. Remains 1087 /1116 variables (removed 29) and now considering 2504/2551 (removed 47) transitions.
[2025-06-03 00:53:29] [INFO ] Flow matrix only has 2232 transitions (discarded 272 similar events)
// Phase 1: matrix 2232 rows 1087 cols
[2025-06-03 00:53:29] [INFO ] Computed 45 invariants in 27 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 00:53:30] [INFO ] Implicit Places using invariants in 1914 ms returned [326, 438]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 1916 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 1085/1203 places, 2504/2654 transitions.
Applied a total of 0 rules in 112 ms. Remains 1085 /1085 variables (removed 0) and now considering 2504/2504 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 5454 ms. Remains : 1085/1203 places, 2504/2654 transitions.
Stuttering acceptance computed with spot in 130 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C03-LTLFireability-06
Stuttering criterion allowed to conclude after 21 steps with 0 reset in 0 ms.
FORMULA MultiCrashLeafsetExtension-PT-S16C03-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S16C03-LTLFireability-06 finished in 5608 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(F((!p0 U (p1||G(!p0)))))||(F((!p0 U (p1||G(!p0))))&&X(X(X(G(p0))))))))'
Support contains 6 out of 1203 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1203/1203 places, 2654/2654 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 1188 transition count 2633
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 1188 transition count 2633
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 42 place count 1176 transition count 2609
Iterating global reduction 0 with 12 rules applied. Total rules applied 54 place count 1176 transition count 2609
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 60 place count 1170 transition count 2591
Iterating global reduction 0 with 6 rules applied. Total rules applied 66 place count 1170 transition count 2591
Applied a total of 66 rules in 286 ms. Remains 1170 /1203 variables (removed 33) and now considering 2591/2654 (removed 63) transitions.
[2025-06-03 00:53:31] [INFO ] Flow matrix only has 2319 transitions (discarded 272 similar events)
// Phase 1: matrix 2319 rows 1170 cols
[2025-06-03 00:53:31] [INFO ] Computed 57 invariants in 27 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 00:53:33] [INFO ] Implicit Places using invariants in 2411 ms returned [12, 327, 346, 474, 505, 514, 545, 571, 606, 607, 628, 796, 812, 849, 893, 1003]
[2025-06-03 00:53:33] [INFO ] Actually due to overlaps returned [505, 796, 12, 327, 474, 514, 545, 571, 606, 607, 628, 849, 893, 1003]
Discarding 14 places :
Implicit Place search using SMT only with invariants took 2414 ms to find 14 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1156/1203 places, 2591/2654 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 1144 transition count 2579
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 1144 transition count 2579
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 36 place count 1132 transition count 2567
Iterating global reduction 0 with 12 rules applied. Total rules applied 48 place count 1132 transition count 2567
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 60 place count 1120 transition count 2555
Iterating global reduction 0 with 12 rules applied. Total rules applied 72 place count 1120 transition count 2555
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 83 place count 1109 transition count 2522
Iterating global reduction 0 with 11 rules applied. Total rules applied 94 place count 1109 transition count 2522
Applied a total of 94 rules in 354 ms. Remains 1109 /1156 variables (removed 47) and now considering 2522/2591 (removed 69) transitions.
[2025-06-03 00:53:34] [INFO ] Flow matrix only has 2250 transitions (discarded 272 similar events)
// Phase 1: matrix 2250 rows 1109 cols
[2025-06-03 00:53:34] [INFO ] Computed 43 invariants in 45 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 00:53:36] [INFO ] Implicit Places using invariants in 2006 ms returned [340, 775]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 2009 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1107/1203 places, 2522/2654 transitions.
Applied a total of 0 rules in 67 ms. Remains 1107 /1107 variables (removed 0) and now considering 2522/2522 (removed 0) transitions.
Finished structural reductions in LTL mode , in 3 iterations and 5133 ms. Remains : 1107/1203 places, 2522/2654 transitions.
Stuttering acceptance computed with spot in 191 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0), false, false, false]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C03-LTLFireability-07
Product exploration explored 100000 steps with 3179 reset in 656 ms.
Product exploration explored 100000 steps with 3181 reset in 608 ms.
Computed a total of 275 stabilizing places and 889 stable transitions
Computed a total of 275 stabilizing places and 889 stable transitions
Detected a total of 275/1107 stabilizing places and 889/2522 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p0))), (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 342 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 194 ms :[false, (AND p0 (NOT p1)), false, false, false]
RANDOM walk for 32728 steps (1033 resets) in 696 ms. (46 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p0))), (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR p0 p1))), (F p0), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 11 factoid took 730 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 5 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 235 ms :[false, (AND p0 (NOT p1)), false, false, false]
Stuttering acceptance computed with spot in 231 ms :[false, (AND p0 (NOT p1)), false, false, false]
Support contains 6 out of 1107 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1107/1107 places, 2522/2522 transitions.
Applied a total of 0 rules in 109 ms. Remains 1107 /1107 variables (removed 0) and now considering 2522/2522 (removed 0) transitions.
[2025-06-03 00:53:40] [INFO ] Flow matrix only has 2250 transitions (discarded 272 similar events)
// Phase 1: matrix 2250 rows 1107 cols
[2025-06-03 00:53:40] [INFO ] Computed 41 invariants in 38 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 00:53:42] [INFO ] Implicit Places using invariants in 2528 ms returned []
[2025-06-03 00:53:42] [INFO ] Flow matrix only has 2250 transitions (discarded 272 similar events)
[2025-06-03 00:53:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 00:53:44] [INFO ] State equation strengthened by 824 read => feed constraints.
[2025-06-03 00:54:10] [INFO ] Implicit Places using invariants and state equation in 27631 ms returned [1089]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 30165 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1106/1107 places, 2522/2522 transitions.
Applied a total of 0 rules in 66 ms. Remains 1106 /1106 variables (removed 0) and now considering 2522/2522 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 30342 ms. Remains : 1106/1107 places, 2522/2522 transitions.
Computed a total of 274 stabilizing places and 889 stable transitions
Computed a total of 274 stabilizing places and 889 stable transitions
Detected a total of 274/1106 stabilizing places and 889/2522 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p1), (X p1), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 143 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 5 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 180 ms :[false, (AND p0 (NOT p1)), false, false, false]
RANDOM walk for 23545 steps (745 resets) in 269 ms. (87 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p0) p1), (X p1), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR p0 p1))), (F p0), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 5 factoid took 334 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 5 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 222 ms :[false, (AND p0 (NOT p1)), false, false, false]
Stuttering acceptance computed with spot in 226 ms :[false, (AND p0 (NOT p1)), false, false, false]
Stuttering acceptance computed with spot in 244 ms :[false, (AND p0 (NOT p1)), false, false, false]
Product exploration explored 100000 steps with 3182 reset in 757 ms.
Product exploration explored 100000 steps with 3181 reset in 812 ms.
Applying partial POR strategy [false, true, false, false, true]
Stuttering acceptance computed with spot in 245 ms :[false, (AND p0 (NOT p1)), false, false, false]
Support contains 6 out of 1106 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1106/1106 places, 2522/2522 transitions.
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 13 rules applied. Total rules applied 13 place count 1106 transition count 2522
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 6 Pre rules applied. Total rules applied 13 place count 1106 transition count 2522
Deduced a syphon composed of 19 places in 2 ms
Iterating global reduction 1 with 6 rules applied. Total rules applied 19 place count 1106 transition count 2522
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 26 place count 1099 transition count 2515
Deduced a syphon composed of 12 places in 2 ms
Iterating global reduction 1 with 7 rules applied. Total rules applied 33 place count 1099 transition count 2515
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 29 places in 2 ms
Iterating global reduction 1 with 17 rules applied. Total rules applied 50 place count 1099 transition count 2515
Deduced a syphon composed of 29 places in 6 ms
Applied a total of 50 rules in 774 ms. Remains 1099 /1106 variables (removed 7) and now considering 2515/2522 (removed 7) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 00:54:15] [INFO ] Redundant transitions in 303 ms returned []
Running 2498 sub problems to find dead transitions.
[2025-06-03 00:54:15] [INFO ] Flow matrix only has 2243 transitions (discarded 272 similar events)
// Phase 1: matrix 2243 rows 1099 cols
[2025-06-03 00:54:15] [INFO ] Computed 40 invariants in 42 ms
[2025-06-03 00:54:15] [INFO ] State equation strengthened by 824 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1097 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 2498 unsolved
SMT process timed out in 32534ms, After SMT, problems are : Problem set: 0 solved, 2498 unsolved
Search for dead transitions found 0 dead transitions in 32566ms
Starting structural reductions in SI_LTL mode, iteration 1 : 1099/1106 places, 2515/2522 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 33667 ms. Remains : 1099/1106 places, 2515/2522 transitions.
Built C files in :
/tmp/ltsmin3615528890980348512
[2025-06-03 00:54:47] [INFO ] Built C files in 131ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3615528890980348512
Running compilation step : cd /tmp/ltsmin3615528890980348512;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin3615528890980348512;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin3615528890980348512;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:1583)
Support contains 6 out of 1106 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1106/1106 places, 2522/2522 transitions.
Applied a total of 0 rules in 54 ms. Remains 1106 /1106 variables (removed 0) and now considering 2522/2522 (removed 0) transitions.
[2025-06-03 00:54:51] [INFO ] Flow matrix only has 2250 transitions (discarded 272 similar events)
// Phase 1: matrix 2250 rows 1106 cols
[2025-06-03 00:54:51] [INFO ] Computed 40 invariants in 23 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 00:54:53] [INFO ] Implicit Places using invariants in 1896 ms returned []
[2025-06-03 00:54:53] [INFO ] Flow matrix only has 2250 transitions (discarded 272 similar events)
[2025-06-03 00:54:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 00:54:54] [INFO ] State equation strengthened by 824 read => feed constraints.
[2025-06-03 00:55:23] [INFO ] Implicit Places using invariants and state equation in 30856 ms returned []
Implicit Place search using SMT with State Equation took 32757 ms to find 0 implicit places.
Running 2505 sub problems to find dead transitions.
[2025-06-03 00:55:23] [INFO ] Flow matrix only has 2250 transitions (discarded 272 similar events)
[2025-06-03 00:55:23] [INFO ] Invariant cache hit.
[2025-06-03 00:55:23] [INFO ] State equation strengthened by 824 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1104 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 2505 unsolved
SMT process timed out in 31450ms, After SMT, problems are : Problem set: 0 solved, 2505 unsolved
Search for dead transitions found 0 dead transitions in 31463ms
Finished structural reductions in LTL mode , in 1 iterations and 64281 ms. Remains : 1106/1106 places, 2522/2522 transitions.
Built C files in :
/tmp/ltsmin10449164383467646814
[2025-06-03 00:55:55] [INFO ] Built C files in 57ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10449164383467646814
Running compilation step : cd /tmp/ltsmin10449164383467646814;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin10449164383467646814;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin10449164383467646814;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:1583)
[2025-06-03 00:55:58] [INFO ] Flatten gal took : 111 ms
[2025-06-03 00:55:58] [INFO ] Flatten gal took : 104 ms
[2025-06-03 00:55:58] [INFO ] Time to serialize gal into /tmp/LTL8224413518705547818.gal : 35 ms
[2025-06-03 00:55:58] [INFO ] Time to serialize properties into /tmp/LTL2172859688293936218.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-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8224413518705547818.gal' '-t' 'CGAL' '-hoa' '/tmp/aut13231013986528984684.hoa' '-atoms' '/tmp/LTL2172859688293936218.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL2172859688293936218.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut13231013986528984684.hoa
Detected timeout of ITS tools.
[2025-06-03 00:56:14] [INFO ] Flatten gal took : 92 ms
[2025-06-03 00:56:14] [INFO ] Flatten gal took : 86 ms
[2025-06-03 00:56:14] [INFO ] Time to serialize gal into /tmp/LTL1631135092272048712.gal : 24 ms
[2025-06-03 00:56:14] [INFO ] Time to serialize properties into /tmp/LTL6859623541241698281.ltl : 4 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-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1631135092272048712.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6859623541241698281.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((F((G(F((!("((Node7ManageTheCrashOfNode15>=1)&&(Rx1IsAtTheRightExtremityOfTheLeafSet>=1))"))U(("((!((Node7ManageTheCrashOfNode15>=1)...973
Formula 0 simplified : G(FG("((Node7ManageTheCrashOfNode15>=1)&&(Rx1IsAtTheRightExtremityOfTheLeafSet>=1))" M !"((!((Node7ManageTheCrashOfNode15>=1)&&(Rx1I...767
Detected timeout of ITS tools.
[2025-06-03 00:56:29] [INFO ] Flatten gal took : 81 ms
[2025-06-03 00:56:29] [INFO ] Applying decomposition
[2025-06-03 00:56:29] [INFO ] Flatten gal took : 83 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/graph1505118176594167178.txt' '-o' '/tmp/graph1505118176594167178.bin' '-w' '/tmp/graph1505118176594167178.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph1505118176594167178.bin' '-l' '-1' '-v' '-w' '/tmp/graph1505118176594167178.weights' '-q' '0' '-e' '0.001'
[2025-06-03 00:56:29] [INFO ] Decomposing Gal with order
[2025-06-03 00:56:29] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 00:56:30] [INFO ] Removed a total of 2861 redundant transitions.
[2025-06-03 00:56:30] [INFO ] Flatten gal took : 583 ms
[2025-06-03 00:56:30] [INFO ] Fuse similar labels procedure discarded/fused a total of 1805 labels/synchronizations in 239 ms.
[2025-06-03 00:56:30] [INFO ] Time to serialize gal into /tmp/LTL9849900333512075056.gal : 35 ms
[2025-06-03 00:56:30] [INFO ] Time to serialize properties into /tmp/LTL11885355270024807506.ltl : 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-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9849900333512075056.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11885355270024807506.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((F((G(F((!("((i2.i1.u166.Node7ManageTheCrashOfNode15>=1)&&(i2.i1.u24.Rx1IsAtTheRightExtremityOfTheLeafSet>=1))"))U(("((!((i2.i1.u166...1178
Formula 0 simplified : G(FG("((i2.i1.u166.Node7ManageTheCrashOfNode15>=1)&&(i2.i1.u24.Rx1IsAtTheRightExtremityOfTheLeafSet>=1))" M !"((!((i2.i1.u166.Node7M...930
Detected timeout of ITS tools.
Treatment of property MultiCrashLeafsetExtension-PT-S16C03-LTLFireability-07 finished in 194798 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 1203 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1203/1203 places, 2654/2654 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 1203 transition count 2642
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 24 place count 1191 transition count 2642
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 14 Pre rules applied. Total rules applied 24 place count 1191 transition count 2628
Deduced a syphon composed of 14 places in 2 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 52 place count 1177 transition count 2628
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 62 place count 1167 transition count 2610
Iterating global reduction 2 with 10 rules applied. Total rules applied 72 place count 1167 transition count 2610
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 72 place count 1167 transition count 2608
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 76 place count 1165 transition count 2608
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 82 place count 1159 transition count 2590
Iterating global reduction 2 with 6 rules applied. Total rules applied 88 place count 1159 transition count 2590
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 1 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 50 rules applied. Total rules applied 138 place count 1134 transition count 2565
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 144 place count 1128 transition count 2559
Iterating global reduction 2 with 6 rules applied. Total rules applied 150 place count 1128 transition count 2559
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 156 place count 1122 transition count 2541
Iterating global reduction 2 with 6 rules applied. Total rules applied 162 place count 1122 transition count 2541
Applied a total of 162 rules in 547 ms. Remains 1122 /1203 variables (removed 81) and now considering 2541/2654 (removed 113) transitions.
[2025-06-03 00:56:46] [INFO ] Flow matrix only has 2269 transitions (discarded 272 similar events)
// Phase 1: matrix 2269 rows 1122 cols
[2025-06-03 00:56:46] [INFO ] Computed 57 invariants in 45 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 00:56:48] [INFO ] Implicit Places using invariants in 2273 ms returned [9, 311, 330, 443, 454, 484, 492, 521, 544, 577, 578, 596, 760, 775, 812, 854, 956, 962]
[2025-06-03 00:56:48] [INFO ] Actually due to overlaps returned [484, 760, 956, 9, 311, 454, 492, 521, 544, 577, 578, 596, 812, 854, 962]
Discarding 15 places :
Implicit Place search using SMT only with invariants took 2277 ms to find 15 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1107/1203 places, 2541/2654 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 1099 transition count 2533
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 1099 transition count 2533
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 24 place count 1091 transition count 2525
Iterating global reduction 0 with 8 rules applied. Total rules applied 32 place count 1091 transition count 2525
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 39 place count 1084 transition count 2504
Iterating global reduction 0 with 7 rules applied. Total rules applied 46 place count 1084 transition count 2504
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 54 place count 1080 transition count 2500
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 58 place count 1076 transition count 2496
Iterating global reduction 0 with 4 rules applied. Total rules applied 62 place count 1076 transition count 2496
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 66 place count 1072 transition count 2484
Iterating global reduction 0 with 4 rules applied. Total rules applied 70 place count 1072 transition count 2484
Applied a total of 70 rules in 641 ms. Remains 1072 /1107 variables (removed 35) and now considering 2484/2541 (removed 57) transitions.
[2025-06-03 00:56:49] [INFO ] Flow matrix only has 2212 transitions (discarded 272 similar events)
// Phase 1: matrix 2212 rows 1072 cols
[2025-06-03 00:56:49] [INFO ] Computed 42 invariants in 25 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 00:56:51] [INFO ] Implicit Places using invariants in 2012 ms returned [325, 437, 747]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 2014 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 1069/1203 places, 2484/2654 transitions.
Applied a total of 0 rules in 112 ms. Remains 1069 /1069 variables (removed 0) and now considering 2484/2484 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 5591 ms. Remains : 1069/1203 places, 2484/2654 transitions.
Stuttering acceptance computed with spot in 105 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C03-LTLFireability-08
Product exploration explored 100000 steps with 4468 reset in 877 ms.
Product exploration explored 100000 steps with 4475 reset in 643 ms.
Computed a total of 254 stabilizing places and 868 stable transitions
Computed a total of 254 stabilizing places and 868 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 100 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 83 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (1789 resets) in 385 ms. (103 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (344 resets) in 227 ms. (175 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 57316 steps, run timeout after 3001 ms. (steps per millisecond=19 ) properties seen :0 out of 1
Probabilistic random walk after 57316 steps, saw 23984 distinct states, run finished after 3001 ms. (steps per millisecond=19 ) properties seen :0
[2025-06-03 00:56:56] [INFO ] Flow matrix only has 2212 transitions (discarded 272 similar events)
// Phase 1: matrix 2212 rows 1069 cols
[2025-06-03 00:56:56] [INFO ] Computed 39 invariants in 25 ms
[2025-06-03 00:56:56] [INFO ] State equation strengthened by 822 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 993/995 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/995 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 19/1014 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:56:58] [INFO ] Deduced a trap composed of 64 places in 1034 ms of which 93 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:56:59] [INFO ] Deduced a trap composed of 124 places in 1137 ms of which 210 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:57:00] [INFO ] Deduced a trap composed of 148 places in 1031 ms of which 174 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:57:01] [INFO ] Deduced a trap composed of 104 places in 952 ms of which 132 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1014 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1014 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 23/1037 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1037 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 26/1063 variables, 26/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1063 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 6/1069 variables, 6/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1069 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
SMT process timed out in 5048ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 2 out of 1069 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1069/1069 places, 2484/2484 transitions.
Free-agglomeration rule (complex) applied 131 times.
Iterating global reduction 0 with 131 rules applied. Total rules applied 131 place count 1069 transition count 2893
Reduce places removed 131 places and 0 transitions.
Iterating post reduction 0 with 131 rules applied. Total rules applied 262 place count 938 transition count 2893
Applied a total of 262 rules in 228 ms. Remains 938 /1069 variables (removed 131) and now considering 2893/2484 (removed -409) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 228 ms. Remains : 938/1069 places, 2893/2484 transitions.
RANDOM walk for 40000 steps (2264 resets) in 894 ms. (44 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (228 resets) in 152 ms. (261 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 64896 steps, run timeout after 3001 ms. (steps per millisecond=21 ) properties seen :0 out of 1
Probabilistic random walk after 64896 steps, saw 26902 distinct states, run finished after 3001 ms. (steps per millisecond=21 ) properties seen :0
[2025-06-03 00:57:05] [INFO ] Flow matrix only has 2495 transitions (discarded 398 similar events)
// Phase 1: matrix 2495 rows 938 cols
[2025-06-03 00:57:05] [INFO ] Computed 39 invariants in 21 ms
[2025-06-03 00:57:05] [INFO ] State equation strengthened by 1362 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 862/864 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/864 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 19/883 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:57:06] [INFO ] Deduced a trap composed of 90 places in 1156 ms of which 106 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:57:07] [INFO ] Deduced a trap composed of 108 places in 1003 ms of which 123 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:57:08] [INFO ] Deduced a trap composed of 60 places in 955 ms of which 72 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:57:09] [INFO ] Deduced a trap composed of 76 places in 971 ms of which 96 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:57:10] [INFO ] Deduced a trap composed of 156 places in 1171 ms of which 115 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:57:11] [INFO ] Deduced a trap composed of 66 places in 951 ms of which 86 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/883 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/883 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 23/906 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:57:12] [INFO ] Deduced a trap composed of 5 places in 875 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:57:13] [INFO ] Deduced a trap composed of 27 places in 1051 ms of which 58 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:57:14] [INFO ] Deduced a trap composed of 27 places in 868 ms of which 55 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:57:15] [INFO ] Deduced a trap composed of 57 places in 966 ms of which 95 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:57:16] [INFO ] Deduced a trap composed of 46 places in 1096 ms of which 81 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:57:18] [INFO ] Deduced a trap composed of 46 places in 1107 ms of which 80 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/906 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/906 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 26/932 variables, 26/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/932 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 6/938 variables, 6/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/938 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 2495/3433 variables, 938/989 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf0 is UNSAT
After SMT solving in domain Real declared 3433/3433 variables, and 2351 constraints, problems are : Problem set: 1 solved, 0 unsolved in 14250 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 938/938 constraints, ReadFeed: 1362/1362 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 14293ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [p0, (X p0), (X (X p0)), (G p0)]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 14 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA MultiCrashLeafsetExtension-PT-S16C03-LTLFireability-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property MultiCrashLeafsetExtension-PT-S16C03-LTLFireability-08 finished in 33597 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0) U X((G((G(!p1)||(!p1&&F(!p2))))||((G(!p1)||(!p1&&F(!p2)))&&F(!p3))))))'
Support contains 8 out of 1203 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1203/1203 places, 2654/2654 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 1189 transition count 2636
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 1189 transition count 2636
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 40 place count 1177 transition count 2612
Iterating global reduction 0 with 12 rules applied. Total rules applied 52 place count 1177 transition count 2612
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 58 place count 1171 transition count 2594
Iterating global reduction 0 with 6 rules applied. Total rules applied 64 place count 1171 transition count 2594
Applied a total of 64 rules in 302 ms. Remains 1171 /1203 variables (removed 32) and now considering 2594/2654 (removed 60) transitions.
[2025-06-03 00:57:19] [INFO ] Flow matrix only has 2322 transitions (discarded 272 similar events)
// Phase 1: matrix 2322 rows 1171 cols
[2025-06-03 00:57:20] [INFO ] Computed 57 invariants in 31 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 00:57:22] [INFO ] Implicit Places using invariants in 2306 ms returned [12, 328, 347, 463, 475, 506, 515, 546, 571, 606, 607, 628, 796, 812, 849, 893, 996, 1003]
[2025-06-03 00:57:22] [INFO ] Actually due to overlaps returned [506, 796, 996, 12, 328, 475, 515, 546, 571, 606, 607, 628, 849, 893, 1003]
Discarding 15 places :
Implicit Place search using SMT only with invariants took 2309 ms to find 15 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1156/1203 places, 2594/2654 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 1144 transition count 2582
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 1144 transition count 2582
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 36 place count 1132 transition count 2570
Iterating global reduction 0 with 12 rules applied. Total rules applied 48 place count 1132 transition count 2570
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 60 place count 1120 transition count 2558
Iterating global reduction 0 with 12 rules applied. Total rules applied 72 place count 1120 transition count 2558
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 83 place count 1109 transition count 2525
Iterating global reduction 0 with 11 rules applied. Total rules applied 94 place count 1109 transition count 2525
Applied a total of 94 rules in 368 ms. Remains 1109 /1156 variables (removed 47) and now considering 2525/2594 (removed 69) transitions.
[2025-06-03 00:57:22] [INFO ] Flow matrix only has 2253 transitions (discarded 272 similar events)
// Phase 1: matrix 2253 rows 1109 cols
[2025-06-03 00:57:22] [INFO ] Computed 42 invariants in 24 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 00:57:24] [INFO ] Implicit Places using invariants in 1886 ms returned [341, 455, 775]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 1888 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1106/1203 places, 2525/2654 transitions.
Applied a total of 0 rules in 69 ms. Remains 1106 /1106 variables (removed 0) and now considering 2525/2525 (removed 0) transitions.
Finished structural reductions in LTL mode , in 3 iterations and 4938 ms. Remains : 1106/1203 places, 2525/2654 transitions.
Stuttering acceptance computed with spot in 831 ms :[p1, p1, p1, true, (AND p3 p1), (AND p2 p1), (NOT p0), (AND p2 p1 (NOT p0)), (AND p1 p3), (AND p1 p2), p3, (AND p3 p2 p1), p2, (AND p3 p2 p1 (NOT p0)), (AND p3 (NOT p0) (NOT p1)), (AND p2 (NOT p0)), (AND p1 p2 p3), (AND p1 p2), (AND p3 p2), (AND p3 p2 (NOT p0)), (AND p1 p2 p3)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C03-LTLFireability-09
Product exploration explored 100000 steps with 50000 reset in 787 ms.
Product exploration explored 100000 steps with 50000 reset in 870 ms.
Computed a total of 274 stabilizing places and 892 stable transitions
Computed a total of 274 stabilizing places and 892 stable transitions
Detected a total of 274/1106 stabilizing places and 892/2525 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/4 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p3) (NOT p2)), (X (NOT p2)), (X (NOT p3)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 (NOT p1) p2))), (X (NOT (AND p0 (NOT p1) p3))), (X (NOT (AND (NOT p1) p3))), (X (NOT (AND (NOT p0) (NOT p1) p3))), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT p3))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND p0 (NOT p1) p3)))), (X (X (NOT (AND (NOT p1) p3)))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) p1 p3)))), (X (X (NOT (AND p0 p1 p3)))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND p0 p1 p2)))), (X (X (NOT (AND p0 (NOT p1) p2 p3)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) p3)))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p1 p3)))), (X (X (NOT (AND p0 p2)))), (X (X (NOT p0))), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 36 factoid took 28 ms. Reduced automaton from 21 states, 63 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA MultiCrashLeafsetExtension-PT-S16C03-LTLFireability-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property MultiCrashLeafsetExtension-PT-S16C03-LTLFireability-09 finished in 7537 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(((p0 U p1)||G(p2))) U X(p3)))'
Support contains 6 out of 1203 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1203/1203 places, 2654/2654 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 1190 transition count 2633
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 1190 transition count 2633
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 35 place count 1181 transition count 2614
Iterating global reduction 0 with 9 rules applied. Total rules applied 44 place count 1181 transition count 2614
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 48 place count 1177 transition count 2602
Iterating global reduction 0 with 4 rules applied. Total rules applied 52 place count 1177 transition count 2602
Applied a total of 52 rules in 287 ms. Remains 1177 /1203 variables (removed 26) and now considering 2602/2654 (removed 52) transitions.
[2025-06-03 00:57:27] [INFO ] Flow matrix only has 2330 transitions (discarded 272 similar events)
// Phase 1: matrix 2330 rows 1177 cols
[2025-06-03 00:57:27] [INFO ] Computed 57 invariants in 26 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 00:57:29] [INFO ] Implicit Places using invariants in 2303 ms returned [12, 349, 465, 477, 508, 517, 613, 614, 635, 803, 819, 856, 900, 1003, 1010]
[2025-06-03 00:57:29] [INFO ] Actually due to overlaps returned [508, 803, 1003, 12, 477, 517, 613, 614, 635, 856, 900, 1010]
Discarding 12 places :
Implicit Place search using SMT only with invariants took 2306 ms to find 12 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1165/1203 places, 2602/2654 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 1156 transition count 2593
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 1156 transition count 2593
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 27 place count 1147 transition count 2584
Iterating global reduction 0 with 9 rules applied. Total rules applied 36 place count 1147 transition count 2584
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 45 place count 1138 transition count 2575
Iterating global reduction 0 with 9 rules applied. Total rules applied 54 place count 1138 transition count 2575
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 62 place count 1130 transition count 2551
Iterating global reduction 0 with 8 rules applied. Total rules applied 70 place count 1130 transition count 2551
Applied a total of 70 rules in 438 ms. Remains 1130 /1165 variables (removed 35) and now considering 2551/2602 (removed 51) transitions.
[2025-06-03 00:57:30] [INFO ] Flow matrix only has 2279 transitions (discarded 272 similar events)
// Phase 1: matrix 2279 rows 1130 cols
[2025-06-03 00:57:30] [INFO ] Computed 45 invariants in 54 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 00:57:32] [INFO ] Implicit Places using invariants in 2216 ms returned [345, 461, 794]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 2237 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1127/1203 places, 2551/2654 transitions.
Applied a total of 0 rules in 76 ms. Remains 1127 /1127 variables (removed 0) and now considering 2551/2551 (removed 0) transitions.
Finished structural reductions in LTL mode , in 3 iterations and 5347 ms. Remains : 1127/1203 places, 2551/2654 transitions.
Stuttering acceptance computed with spot in 416 ms :[(NOT p3), (NOT p3), (AND (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (NOT p3), (AND (NOT p1) p2 (NOT p3)), true, (NOT p2), (NOT p1), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C03-LTLFireability-10
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA MultiCrashLeafsetExtension-PT-S16C03-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S16C03-LTLFireability-10 finished in 5795 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 1203 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1203/1203 places, 2654/2654 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 1203 transition count 2642
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 24 place count 1191 transition count 2642
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 14 Pre rules applied. Total rules applied 24 place count 1191 transition count 2628
Deduced a syphon composed of 14 places in 2 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 52 place count 1177 transition count 2628
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 62 place count 1167 transition count 2610
Iterating global reduction 2 with 10 rules applied. Total rules applied 72 place count 1167 transition count 2610
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 72 place count 1167 transition count 2608
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 76 place count 1165 transition count 2608
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 82 place count 1159 transition count 2590
Iterating global reduction 2 with 6 rules applied. Total rules applied 88 place count 1159 transition count 2590
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 2 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 50 rules applied. Total rules applied 138 place count 1134 transition count 2565
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 144 place count 1128 transition count 2559
Iterating global reduction 2 with 6 rules applied. Total rules applied 150 place count 1128 transition count 2559
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 156 place count 1122 transition count 2541
Iterating global reduction 2 with 6 rules applied. Total rules applied 162 place count 1122 transition count 2541
Applied a total of 162 rules in 556 ms. Remains 1122 /1203 variables (removed 81) and now considering 2541/2654 (removed 113) transitions.
[2025-06-03 00:57:33] [INFO ] Flow matrix only has 2269 transitions (discarded 272 similar events)
// Phase 1: matrix 2269 rows 1122 cols
[2025-06-03 00:57:33] [INFO ] Computed 57 invariants in 44 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 00:57:35] [INFO ] Implicit Places using invariants in 2214 ms returned [9, 311, 330, 443, 454, 484, 492, 521, 544, 577, 578, 596, 760, 775, 812, 854, 956, 962]
[2025-06-03 00:57:35] [INFO ] Actually due to overlaps returned [484, 760, 956, 9, 311, 454, 492, 521, 544, 577, 578, 596, 812, 854, 962]
Discarding 15 places :
Implicit Place search using SMT only with invariants took 2217 ms to find 15 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1107/1203 places, 2541/2654 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 1099 transition count 2533
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 1099 transition count 2533
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 24 place count 1091 transition count 2525
Iterating global reduction 0 with 8 rules applied. Total rules applied 32 place count 1091 transition count 2525
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 39 place count 1084 transition count 2504
Iterating global reduction 0 with 7 rules applied. Total rules applied 46 place count 1084 transition count 2504
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 54 place count 1080 transition count 2500
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 58 place count 1076 transition count 2496
Iterating global reduction 0 with 4 rules applied. Total rules applied 62 place count 1076 transition count 2496
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 66 place count 1072 transition count 2484
Iterating global reduction 0 with 4 rules applied. Total rules applied 70 place count 1072 transition count 2484
Applied a total of 70 rules in 623 ms. Remains 1072 /1107 variables (removed 35) and now considering 2484/2541 (removed 57) transitions.
[2025-06-03 00:57:36] [INFO ] Flow matrix only has 2212 transitions (discarded 272 similar events)
// Phase 1: matrix 2212 rows 1072 cols
[2025-06-03 00:57:36] [INFO ] Computed 42 invariants in 42 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 00:57:38] [INFO ] Implicit Places using invariants in 1854 ms returned [325, 437, 747]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 1857 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 1069/1203 places, 2484/2654 transitions.
Applied a total of 0 rules in 109 ms. Remains 1069 /1069 variables (removed 0) and now considering 2484/2484 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 5364 ms. Remains : 1069/1203 places, 2484/2654 transitions.
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C03-LTLFireability-11
Stuttering criterion allowed to conclude after 21 steps with 0 reset in 0 ms.
FORMULA MultiCrashLeafsetExtension-PT-S16C03-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S16C03-LTLFireability-11 finished in 5418 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 6 out of 1203 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1203/1203 places, 2654/2654 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 1187 transition count 2630
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 1187 transition count 2630
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 44 place count 1175 transition count 2606
Iterating global reduction 0 with 12 rules applied. Total rules applied 56 place count 1175 transition count 2606
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 62 place count 1169 transition count 2588
Iterating global reduction 0 with 6 rules applied. Total rules applied 68 place count 1169 transition count 2588
Applied a total of 68 rules in 284 ms. Remains 1169 /1203 variables (removed 34) and now considering 2588/2654 (removed 66) transitions.
[2025-06-03 00:57:38] [INFO ] Flow matrix only has 2316 transitions (discarded 272 similar events)
// Phase 1: matrix 2316 rows 1169 cols
[2025-06-03 00:57:38] [INFO ] Computed 57 invariants in 28 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 00:57:40] [INFO ] Implicit Places using invariants in 2245 ms returned [12, 327, 462, 474, 505, 514, 545, 570, 605, 606, 627, 811, 848, 892, 995, 1002]
[2025-06-03 00:57:40] [INFO ] Actually due to overlaps returned [505, 995, 12, 327, 474, 514, 545, 570, 605, 606, 627, 848, 892, 1002]
Discarding 14 places :
Implicit Place search using SMT only with invariants took 2248 ms to find 14 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1155/1203 places, 2588/2654 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 1143 transition count 2576
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 1143 transition count 2576
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 36 place count 1131 transition count 2564
Iterating global reduction 0 with 12 rules applied. Total rules applied 48 place count 1131 transition count 2564
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 60 place count 1119 transition count 2552
Iterating global reduction 0 with 12 rules applied. Total rules applied 72 place count 1119 transition count 2552
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 83 place count 1108 transition count 2519
Iterating global reduction 0 with 11 rules applied. Total rules applied 94 place count 1108 transition count 2519
Applied a total of 94 rules in 355 ms. Remains 1108 /1155 variables (removed 47) and now considering 2519/2588 (removed 69) transitions.
[2025-06-03 00:57:41] [INFO ] Flow matrix only has 2247 transitions (discarded 272 similar events)
// Phase 1: matrix 2247 rows 1108 cols
[2025-06-03 00:57:41] [INFO ] Computed 43 invariants in 24 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 00:57:43] [INFO ] Implicit Places using invariants in 1870 ms returned [454, 775]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 1873 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1106/1203 places, 2519/2654 transitions.
Applied a total of 0 rules in 67 ms. Remains 1106 /1106 variables (removed 0) and now considering 2519/2519 (removed 0) transitions.
Finished structural reductions in LTL mode , in 3 iterations and 4829 ms. Remains : 1106/1203 places, 2519/2654 transitions.
Stuttering acceptance computed with spot in 90 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C03-LTLFireability-13
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA MultiCrashLeafsetExtension-PT-S16C03-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S16C03-LTLFireability-13 finished in 4937 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((p0||F(p1)) U p1)))'
Support contains 1 out of 1203 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 1203/1203 places, 2654/2654 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 1188 transition count 2631
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 1188 transition count 2631
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 41 place count 1177 transition count 2608
Iterating global reduction 0 with 11 rules applied. Total rules applied 52 place count 1177 transition count 2608
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 57 place count 1172 transition count 2593
Iterating global reduction 0 with 5 rules applied. Total rules applied 62 place count 1172 transition count 2593
Applied a total of 62 rules in 294 ms. Remains 1172 /1203 variables (removed 31) and now considering 2593/2654 (removed 61) transitions.
[2025-06-03 00:57:43] [INFO ] Flow matrix only has 2321 transitions (discarded 272 similar events)
// Phase 1: matrix 2321 rows 1172 cols
[2025-06-03 00:57:43] [INFO ] Computed 57 invariants in 43 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 00:57:46] [INFO ] Implicit Places using invariants in 2385 ms returned [12, 327, 346, 462, 508, 517, 548, 573, 608, 609, 630, 798, 814, 851, 895, 998, 1005]
[2025-06-03 00:57:46] [INFO ] Actually due to overlaps returned [508, 798, 998, 12, 327, 517, 548, 573, 608, 609, 630, 851, 895, 1005]
Discarding 14 places :
Implicit Place search using SMT only with invariants took 2388 ms to find 14 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1158/1203 places, 2593/2654 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 1147 transition count 2582
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 1147 transition count 2582
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 33 place count 1136 transition count 2571
Iterating global reduction 0 with 11 rules applied. Total rules applied 44 place count 1136 transition count 2571
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 55 place count 1125 transition count 2560
Iterating global reduction 0 with 11 rules applied. Total rules applied 66 place count 1125 transition count 2560
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 76 place count 1115 transition count 2530
Iterating global reduction 0 with 10 rules applied. Total rules applied 86 place count 1115 transition count 2530
Applied a total of 86 rules in 361 ms. Remains 1115 /1158 variables (removed 43) and now considering 2530/2593 (removed 63) transitions.
[2025-06-03 00:57:46] [INFO ] Flow matrix only has 2258 transitions (discarded 272 similar events)
// Phase 1: matrix 2258 rows 1115 cols
[2025-06-03 00:57:46] [INFO ] Computed 43 invariants in 40 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 00:57:48] [INFO ] Implicit Places using invariants in 1988 ms returned [340, 454, 781]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 1991 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1112/1203 places, 2530/2654 transitions.
Applied a total of 0 rules in 66 ms. Remains 1112 /1112 variables (removed 0) and now considering 2530/2530 (removed 0) transitions.
Finished structural reductions in LTL mode , in 3 iterations and 5102 ms. Remains : 1112/1203 places, 2530/2654 transitions.
Stuttering acceptance computed with spot in 87 ms :[(NOT p1), (NOT p1)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C03-LTLFireability-14
Stuttering criterion allowed to conclude after 32 steps with 0 reset in 0 ms.
FORMULA MultiCrashLeafsetExtension-PT-S16C03-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S16C03-LTLFireability-14 finished in 5213 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(F((!p0 U (p1||G(!p0)))))||(F((!p0 U (p1||G(!p0))))&&X(X(X(G(p0))))))))'
Found a Lengthening insensitive property : MultiCrashLeafsetExtension-PT-S16C03-LTLFireability-07
Stuttering acceptance computed with spot in 208 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0), false, false, false]
Support contains 6 out of 1203 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1203/1203 places, 2654/2654 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 1203 transition count 2642
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 24 place count 1191 transition count 2642
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 14 Pre rules applied. Total rules applied 24 place count 1191 transition count 2628
Deduced a syphon composed of 14 places in 2 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 52 place count 1177 transition count 2628
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 61 place count 1168 transition count 2613
Iterating global reduction 2 with 9 rules applied. Total rules applied 70 place count 1168 transition count 2613
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 70 place count 1168 transition count 2611
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 74 place count 1166 transition count 2611
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 80 place count 1160 transition count 2593
Iterating global reduction 2 with 6 rules applied. Total rules applied 86 place count 1160 transition count 2593
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 2 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 50 rules applied. Total rules applied 136 place count 1135 transition count 2568
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 142 place count 1129 transition count 2562
Iterating global reduction 2 with 6 rules applied. Total rules applied 148 place count 1129 transition count 2562
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 154 place count 1123 transition count 2544
Iterating global reduction 2 with 6 rules applied. Total rules applied 160 place count 1123 transition count 2544
Applied a total of 160 rules in 523 ms. Remains 1123 /1203 variables (removed 80) and now considering 2544/2654 (removed 110) transitions.
[2025-06-03 00:57:49] [INFO ] Flow matrix only has 2272 transitions (discarded 272 similar events)
// Phase 1: matrix 2272 rows 1123 cols
[2025-06-03 00:57:49] [INFO ] Computed 57 invariants in 47 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 00:57:51] [INFO ] Implicit Places using invariants in 2152 ms returned [9, 311, 330, 454, 484, 492, 521, 545, 578, 579, 597, 761, 776, 813, 855, 963]
[2025-06-03 00:57:51] [INFO ] Actually due to overlaps returned [484, 761, 9, 311, 454, 492, 521, 545, 578, 579, 597, 813, 855, 963]
Discarding 14 places :
Implicit Place search using SMT only with invariants took 2157 ms to find 14 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 1109/1203 places, 2544/2654 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 1101 transition count 2536
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 1101 transition count 2536
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 24 place count 1093 transition count 2528
Iterating global reduction 0 with 8 rules applied. Total rules applied 32 place count 1093 transition count 2528
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 39 place count 1086 transition count 2507
Iterating global reduction 0 with 7 rules applied. Total rules applied 46 place count 1086 transition count 2507
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 54 place count 1082 transition count 2503
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 58 place count 1078 transition count 2499
Iterating global reduction 0 with 4 rules applied. Total rules applied 62 place count 1078 transition count 2499
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 66 place count 1074 transition count 2487
Iterating global reduction 0 with 4 rules applied. Total rules applied 70 place count 1074 transition count 2487
Applied a total of 70 rules in 565 ms. Remains 1074 /1109 variables (removed 35) and now considering 2487/2544 (removed 57) transitions.
[2025-06-03 00:57:52] [INFO ] Flow matrix only has 2215 transitions (discarded 272 similar events)
// Phase 1: matrix 2215 rows 1074 cols
[2025-06-03 00:57:52] [INFO ] Computed 43 invariants in 28 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 00:57:54] [INFO ] Implicit Places using invariants in 1948 ms returned [325, 748]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 1950 ms to find 2 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 1072/1203 places, 2487/2654 transitions.
Applied a total of 0 rules in 81 ms. Remains 1072 /1072 variables (removed 0) and now considering 2487/2487 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 3 iterations and 5278 ms. Remains : 1072/1203 places, 2487/2654 transitions.
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C03-LTLFireability-07
Product exploration explored 100000 steps with 4482 reset in 663 ms.
Product exploration explored 100000 steps with 4484 reset in 656 ms.
Computed a total of 257 stabilizing places and 871 stable transitions
Computed a total of 257 stabilizing places and 871 stable transitions
Detected a total of 257/1072 stabilizing places and 871/2487 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p0))), (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 347 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 212 ms :[false, (AND p0 (NOT p1)), false, false, false]
RANDOM walk for 15405 steps (684 resets) in 175 ms. (87 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p0))), (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR p0 p1))), (F p0), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 11 factoid took 768 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 5 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 200 ms :[false, (AND p0 (NOT p1)), false, false, false]
Stuttering acceptance computed with spot in 201 ms :[false, (AND p0 (NOT p1)), false, false, false]
Support contains 6 out of 1072 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1072/1072 places, 2487/2487 transitions.
Applied a total of 0 rules in 70 ms. Remains 1072 /1072 variables (removed 0) and now considering 2487/2487 (removed 0) transitions.
[2025-06-03 00:57:57] [INFO ] Flow matrix only has 2215 transitions (discarded 272 similar events)
// Phase 1: matrix 2215 rows 1072 cols
[2025-06-03 00:57:57] [INFO ] Computed 41 invariants in 25 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 00:57:59] [INFO ] Implicit Places using invariants in 1844 ms returned []
[2025-06-03 00:57:59] [INFO ] Flow matrix only has 2215 transitions (discarded 272 similar events)
[2025-06-03 00:57:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 00:58:00] [INFO ] State equation strengthened by 824 read => feed constraints.
[2025-06-03 00:58:24] [INFO ] Implicit Places using invariants and state equation in 25464 ms returned [1059]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 27312 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1071/1072 places, 2487/2487 transitions.
Applied a total of 0 rules in 70 ms. Remains 1071 /1071 variables (removed 0) and now considering 2487/2487 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 27455 ms. Remains : 1071/1072 places, 2487/2487 transitions.
Computed a total of 256 stabilizing places and 871 stable transitions
Computed a total of 256 stabilizing places and 871 stable transitions
Detected a total of 256/1071 stabilizing places and 871/2487 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p1), (X p1), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 158 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 5 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 172 ms :[false, (AND p0 (NOT p1)), false, false, false]
RANDOM walk for 23636 steps (1056 resets) in 242 ms. (97 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p0) p1), (X p1), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR p0 p1))), (F p0), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 5 factoid took 291 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 5 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 196 ms :[false, (AND p0 (NOT p1)), false, false, false]
Stuttering acceptance computed with spot in 178 ms :[false, (AND p0 (NOT p1)), false, false, false]
Stuttering acceptance computed with spot in 164 ms :[false, (AND p0 (NOT p1)), false, false, false]
Product exploration explored 100000 steps with 4486 reset in 580 ms.
Product exploration explored 100000 steps with 4481 reset in 953 ms.
Applying partial POR strategy [false, true, false, false, true]
Stuttering acceptance computed with spot in 166 ms :[false, (AND p0 (NOT p1)), false, false, false]
Support contains 6 out of 1071 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1071/1071 places, 2487/2487 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 1071 transition count 2487
Deduced a syphon composed of 1 places in 2 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 1071 transition count 2487
Deduced a syphon composed of 1 places in 2 ms
Applied a total of 1 rules in 128 ms. Remains 1071 /1071 variables (removed 0) and now considering 2487/2487 (removed 0) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 00:58:28] [INFO ] Redundant transitions in 321 ms returned []
Running 2470 sub problems to find dead transitions.
[2025-06-03 00:58:28] [INFO ] Flow matrix only has 2215 transitions (discarded 272 similar events)
// Phase 1: matrix 2215 rows 1071 cols
[2025-06-03 00:58:28] [INFO ] Computed 40 invariants in 25 ms
[2025-06-03 00:58:28] [INFO ] State equation strengthened by 824 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1069 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 2470 unsolved
SMT process timed out in 31924ms, After SMT, problems are : Problem set: 0 solved, 2470 unsolved
Search for dead transitions found 0 dead transitions in 31946ms
Starting structural reductions in SI_LTL mode, iteration 1 : 1071/1071 places, 2487/2487 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 32412 ms. Remains : 1071/1071 places, 2487/2487 transitions.
Built C files in :
/tmp/ltsmin16237344401078579203
[2025-06-03 00:59:00] [INFO ] Built C files in 54ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16237344401078579203
Running compilation step : cd /tmp/ltsmin16237344401078579203;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin16237344401078579203;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin16237344401078579203;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:1583)
Support contains 6 out of 1071 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1071/1071 places, 2487/2487 transitions.
Applied a total of 0 rules in 115 ms. Remains 1071 /1071 variables (removed 0) and now considering 2487/2487 (removed 0) transitions.
[2025-06-03 00:59:03] [INFO ] Flow matrix only has 2215 transitions (discarded 272 similar events)
// Phase 1: matrix 2215 rows 1071 cols
[2025-06-03 00:59:03] [INFO ] Computed 40 invariants in 25 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 00:59:05] [INFO ] Implicit Places using invariants in 1996 ms returned []
[2025-06-03 00:59:05] [INFO ] Flow matrix only has 2215 transitions (discarded 272 similar events)
[2025-06-03 00:59:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 00:59:06] [INFO ] State equation strengthened by 824 read => feed constraints.
[2025-06-03 00:59:33] [INFO ] Implicit Places using invariants and state equation in 28241 ms returned []
Implicit Place search using SMT with State Equation took 30240 ms to find 0 implicit places.
Running 2470 sub problems to find dead transitions.
[2025-06-03 00:59:33] [INFO ] Flow matrix only has 2215 transitions (discarded 272 similar events)
[2025-06-03 00:59:33] [INFO ] Invariant cache hit.
[2025-06-03 00:59:33] [INFO ] State equation strengthened by 824 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/1069 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 2470 unsolved
SMT process timed out in 31900ms, After SMT, problems are : Problem set: 0 solved, 2470 unsolved
Search for dead transitions found 0 dead transitions in 31910ms
Finished structural reductions in LTL mode , in 1 iterations and 62273 ms. Remains : 1071/1071 places, 2487/2487 transitions.
Built C files in :
/tmp/ltsmin10145626277911815664
[2025-06-03 01:00:05] [INFO ] Built C files in 50ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10145626277911815664
Running compilation step : cd /tmp/ltsmin10145626277911815664;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin10145626277911815664;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin10145626277911815664;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:1583)
[2025-06-03 01:00:09] [INFO ] Flatten gal took : 69 ms
[2025-06-03 01:00:09] [INFO ] Flatten gal took : 106 ms
[2025-06-03 01:00:09] [INFO ] Time to serialize gal into /tmp/LTL1475687646397360357.gal : 14 ms
[2025-06-03 01:00:09] [INFO ] Time to serialize properties into /tmp/LTL8740523387726355057.prop : 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-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1475687646397360357.gal' '-t' 'CGAL' '-hoa' '/tmp/aut8814680691876664445.hoa' '-atoms' '/tmp/LTL8740523387726355057.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL8740523387726355057.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut8814680691876664445.hoa
Detected timeout of ITS tools.
[2025-06-03 01:00:24] [INFO ] Flatten gal took : 64 ms
[2025-06-03 01:00:24] [INFO ] Flatten gal took : 70 ms
[2025-06-03 01:00:24] [INFO ] Time to serialize gal into /tmp/LTL12946764976477288544.gal : 13 ms
[2025-06-03 01:00:24] [INFO ] Time to serialize properties into /tmp/LTL10510491362772632109.ltl : 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-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12946764976477288544.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10510491362772632109.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((F((G(F((!("((Node7ManageTheCrashOfNode15>=1)&&(Rx1IsAtTheRightExtremityOfTheLeafSet>=1))"))U(("((!((Node7ManageTheCrashOfNode15>=1)...973
Formula 0 simplified : G(FG("((Node7ManageTheCrashOfNode15>=1)&&(Rx1IsAtTheRightExtremityOfTheLeafSet>=1))" M !"((!((Node7ManageTheCrashOfNode15>=1)&&(Rx1I...767
Detected timeout of ITS tools.
[2025-06-03 01:00:39] [INFO ] Flatten gal took : 62 ms
[2025-06-03 01:00:39] [INFO ] Applying decomposition
[2025-06-03 01:00:39] [INFO ] Flatten gal took : 66 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/graph4464572454717730128.txt' '-o' '/tmp/graph4464572454717730128.bin' '-w' '/tmp/graph4464572454717730128.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph4464572454717730128.bin' '-l' '-1' '-v' '-w' '/tmp/graph4464572454717730128.weights' '-q' '0' '-e' '0.001'
[2025-06-03 01:00:39] [INFO ] Decomposing Gal with order
[2025-06-03 01:00:39] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 01:00:40] [INFO ] Removed a total of 2217 redundant transitions.
[2025-06-03 01:00:40] [INFO ] Flatten gal took : 567 ms
[2025-06-03 01:00:40] [INFO ] Fuse similar labels procedure discarded/fused a total of 1335 labels/synchronizations in 140 ms.
[2025-06-03 01:00:40] [INFO ] Time to serialize gal into /tmp/LTL3596222907534177253.gal : 24 ms
[2025-06-03 01:00:40] [INFO ] Time to serialize properties into /tmp/LTL10261387177791017976.ltl : 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-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3596222907534177253.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10261387177791017976.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((F((G(F((!("((i17.i0.u148.Node7ManageTheCrashOfNode15>=1)&&(i17.i0.u150.Rx1IsAtTheRightExtremityOfTheLeafSet>=1))"))U(("((!((i17.i0....1179
Formula 0 simplified : G(FG("((i17.i0.u148.Node7ManageTheCrashOfNode15>=1)&&(i17.i0.u150.Rx1IsAtTheRightExtremityOfTheLeafSet>=1))" M !"((!((i17.i0.u148.No...925
Detected timeout of ITS tools.
Treatment of property MultiCrashLeafsetExtension-PT-S16C03-LTLFireability-07 finished in 187268 ms.
[2025-06-03 01:00:55] [INFO ] Flatten gal took : 76 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin977682050597400012
[2025-06-03 01:00:55] [INFO ] Too many transitions (2654) to apply POR reductions. Disabling POR matrices.
[2025-06-03 01:00:55] [INFO ] Built C files in 37ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin977682050597400012
Running compilation step : cd /tmp/ltsmin977682050597400012;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2025-06-03 01:00:55] [INFO ] Applying decomposition
[2025-06-03 01:00:56] [INFO ] Flatten gal took : 81 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/graph7599793798466941140.txt' '-o' '/tmp/graph7599793798466941140.bin' '-w' '/tmp/graph7599793798466941140.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph7599793798466941140.bin' '-l' '-1' '-v' '-w' '/tmp/graph7599793798466941140.weights' '-q' '0' '-e' '0.001'
[2025-06-03 01:00:56] [INFO ] Decomposing Gal with order
[2025-06-03 01:00:56] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 01:00:56] [INFO ] Removed a total of 3110 redundant transitions.
[2025-06-03 01:00:56] [INFO ] Flatten gal took : 218 ms
[2025-06-03 01:00:56] [INFO ] Fuse similar labels procedure discarded/fused a total of 1696 labels/synchronizations in 119 ms.
[2025-06-03 01:00:56] [INFO ] Time to serialize gal into /tmp/LTLFireability2332596918552284002.gal : 28 ms
[2025-06-03 01:00:56] [INFO ] Time to serialize properties into /tmp/LTLFireability8603464731284555817.ltl : 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-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability2332596918552284002.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability8603464731284555817.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F((G(F((!("((i1.i1.u192.Node7ManageTheCrashOfNode15>=1)&&(i1.i1.u195.Rx1IsAtTheRightExtremityOfTheLeafSet>=1))"))U(("((!((i1.i1.u19...1185
Formula 0 simplified : G(FG("((i1.i1.u192.Node7ManageTheCrashOfNode15>=1)&&(i1.i1.u195.Rx1IsAtTheRightExtremityOfTheLeafSet>=1))" M !"((!((i1.i1.u192.Node7...935
Compilation finished in 10261 ms.
Running link step : cd /tmp/ltsmin977682050597400012;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 75 ms.
Running LTSmin : cd /tmp/ltsmin977682050597400012;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>(([](<>((!(LTLAPp0==true) U ((LTLAPp1==true)||[](!(LTLAPp0==true))))))||(<>((!(LTLAPp0==true) U ((LTLAPp1==true)||[](!(LTLAPp0==true)))))&&X(X(X([]((LTLAPp0==true))))))))' '--buchi-type=spotba'
LTSmin run took 21839 ms.
FORMULA MultiCrashLeafsetExtension-PT-S16C03-LTLFireability-07 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
ITS tools runner thread asked to quit. Dying gracefully.
Total runtime 665338 ms.
BK_STOP 1748912488278
--------------------
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
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -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 LTLFireability -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="MultiCrashLeafsetExtension-PT-S16C03"
export BK_EXAMINATION="LTLFireability"
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 MultiCrashLeafsetExtension-PT-S16C03, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r128-smll-174876524300292"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/MultiCrashLeafsetExtension-PT-S16C03.tgz
mv MultiCrashLeafsetExtension-PT-S16C03 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "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 [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "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 "LTLFireability.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 [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
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 ;