About the Execution of ITS-Tools for HirschbergSinclair-PT-25
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 972.688 | 792111.00 | 908792.00 | 1600.20 | FFFTFFFFFFFFFFTT | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2026-input.r146-tall-177961074400764.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2026-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-5973
Executing tool itstools
Input is HirschbergSinclair-PT-25, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r146-tall-177961074400764
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 780K
-rw-r--r-- 1 mcc users 11K Mar 7 17:02 CTLCardinality.txt
-rw-r--r-- 1 mcc users 83K Mar 7 17:02 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.7K Mar 7 17:02 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K Mar 7 17:02 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.9K Mar 15 10:49 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 15 10:49 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.7K Mar 15 10:50 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Mar 15 10:50 LTLFireability.xml
-rw-r--r-- 1 mcc users 19K Mar 7 17:02 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 137K Mar 7 17:02 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.3K Mar 7 17:02 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 49K Mar 7 17:02 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K Mar 15 10:50 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.1K Mar 15 10:50 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 321K Mar 3 18:30 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 HirschbergSinclair-PT-25-LTLFireability-00
FORMULA_NAME HirschbergSinclair-PT-25-LTLFireability-01
FORMULA_NAME HirschbergSinclair-PT-25-LTLFireability-02
FORMULA_NAME HirschbergSinclair-PT-25-LTLFireability-03
FORMULA_NAME HirschbergSinclair-PT-25-LTLFireability-04
FORMULA_NAME HirschbergSinclair-PT-25-LTLFireability-05
FORMULA_NAME HirschbergSinclair-PT-25-LTLFireability-06
FORMULA_NAME HirschbergSinclair-PT-25-LTLFireability-07
FORMULA_NAME HirschbergSinclair-PT-25-LTLFireability-08
FORMULA_NAME HirschbergSinclair-PT-25-LTLFireability-09
FORMULA_NAME HirschbergSinclair-PT-25-LTLFireability-10
FORMULA_NAME HirschbergSinclair-PT-25-LTLFireability-11
FORMULA_NAME HirschbergSinclair-PT-25-LTLFireability-12
FORMULA_NAME HirschbergSinclair-PT-25-LTLFireability-13
FORMULA_NAME HirschbergSinclair-PT-25-LTLFireability-14
FORMULA_NAME HirschbergSinclair-PT-25-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1779754310065
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=HirschbergSinclair-PT-25
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202604301425
[2026-05-26 00:11:51] [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]
[2026-05-26 00:11:51] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-26 00:11:51] [INFO ] Load time of PNML (sax parser for PT used): 88 ms
[2026-05-26 00:11:51] [INFO ] Transformed 600 places.
[2026-05-26 00:11:51] [INFO ] Transformed 545 transitions.
[2026-05-26 00:11:51] [INFO ] Parsed PT model containing 600 places and 545 transitions and 1664 arcs in 179 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA HirschbergSinclair-PT-25-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HirschbergSinclair-PT-25-LTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HirschbergSinclair-PT-25-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 42 out of 600 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 600/600 places, 545/545 transitions.
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 0 with 25 rules applied. Total rules applied 25 place count 575 transition count 545
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 46 place count 554 transition count 524
Iterating global reduction 1 with 21 rules applied. Total rules applied 67 place count 554 transition count 524
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 86 place count 535 transition count 505
Iterating global reduction 1 with 19 rules applied. Total rules applied 105 place count 535 transition count 505
Applied a total of 105 rules in 154 ms. Remains 535 /600 variables (removed 65) and now considering 505/545 (removed 40) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9697989712288986548.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3258324842246215711.kers'
[2026-05-26 00:11:51] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9697989712288986548.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3258324842246215711.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 505 rows 535 cols 1517 entries
Finished phase 1 with 500 SingleSign rule and 5 generalized
[2026-05-26 00:11:51] [INFO ] Computed 30 invariants in 2 ms
Computed 30 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-3258324842246215711.kers
Total runtime 3 ms.
[2026-05-26 00:11:52] [INFO ] Implicit Places using invariants in 469 ms returned []
[2026-05-26 00:11:52] [INFO ] Invariant cache hit.
[2026-05-26 00:11:57] [INFO ] Implicit Places using invariants and state equation in 5013 ms returned []
Implicit Place search using SMT with State Equation took 5519 ms to find 0 implicit places.
Running 480 sub problems to find dead transitions.
[2026-05-26 00:11:57] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/510 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 480 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/510 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 480 unsolved
At refinement iteration 2 (OVERLAPS) 25/535 variables, 26/30 constraints. Problems are: Problem set: 0 solved, 480 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/535 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 480 unsolved
At refinement iteration 4 (OVERLAPS) 505/1040 variables, 535/565 constraints. Problems are: Problem set: 0 solved, 480 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1040/1040 variables, and 565 constraints, problems are : Problem set: 0 solved, 480 unsolved in 30026 ms.
Refiners :[Generalized P Invariants (flows): 30/30 constraints, State Equation: 535/535 constraints, PredecessorRefiner: 480/480 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 480 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/510 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 480 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/510 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 480 unsolved
At refinement iteration 2 (OVERLAPS) 25/535 variables, 26/30 constraints. Problems are: Problem set: 0 solved, 480 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/535 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 480 unsolved
At refinement iteration 4 (OVERLAPS) 505/1040 variables, 535/565 constraints. Problems are: Problem set: 0 solved, 480 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1040 variables, 480/1045 constraints. Problems are: Problem set: 0 solved, 480 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1040/1040 variables, and 1045 constraints, problems are : Problem set: 0 solved, 480 unsolved in 30025 ms.
Refiners :[Generalized P Invariants (flows): 30/30 constraints, State Equation: 535/535 constraints, PredecessorRefiner: 480/480 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60237ms problems are : Problem set: 0 solved, 480 unsolved
Search for dead transitions found 0 dead transitions in 60260ms
Starting structural reductions in LTL mode, iteration 1 : 535/600 places, 505/545 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 65976 ms. Remains : 535/600 places, 505/545 transitions.
Starting structural reductions in LTL mode, iteration 0 : 535/535 places, 505/505 transitions.
Applied a total of 0 rules in 34 ms. Remains 535 /535 variables (removed 0) and now considering 505/505 (removed 0) transitions.
[2026-05-26 00:12:57] [INFO ] Invariant cache hit.
[2026-05-26 00:12:57] [INFO ] Implicit Places using invariants in 201 ms returned []
[2026-05-26 00:12:57] [INFO ] Invariant cache hit.
[2026-05-26 00:13:02] [INFO ] Implicit Places using invariants and state equation in 4768 ms returned []
Implicit Place search using SMT with State Equation took 4980 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 5023 ms. Remains : 535/535 places, 505/505 transitions.
Support contains 42 out of 535 places after structural reductions.
[2026-05-26 00:13:02] [INFO ] Flatten gal took : 58 ms
[2026-05-26 00:13:02] [INFO ] Flatten gal took : 33 ms
[2026-05-26 00:13:02] [INFO ] Input system was already deterministic with 505 transitions.
RANDOM walk for 40000 steps (72 resets) in 1119 ms. (35 steps per ms) remains 1/29 properties
BEST_FIRST walk for 40004 steps (8 resets) in 414 ms. (96 steps per ms) remains 1/1 properties
[2026-05-26 00:13:03] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 455/459 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/459 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 25/484 variables, 3/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/484 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 505/989 variables, 484/514 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/989 variables, 0/514 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 51/1040 variables, 51/565 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1040 variables, 0/565 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/1040 variables, 0/565 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1040/1040 variables, and 565 constraints, problems are : Problem set: 0 solved, 1 unsolved in 435 ms.
Refiners :[Generalized P Invariants (flows): 30/30 constraints, State Equation: 535/535 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 455/459 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/459 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 25/484 variables, 3/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/484 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 505/989 variables, 484/514 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/989 variables, 0/514 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 51/1040 variables, 51/565 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1040 variables, 1/566 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1040 variables, 0/566 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/1040 variables, 0/566 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1040/1040 variables, and 566 constraints, problems are : Problem set: 0 solved, 1 unsolved in 963 ms.
Refiners :[Generalized P Invariants (flows): 30/30 constraints, State Equation: 535/535 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1406ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 60 ms.
Support contains 4 out of 535 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 535/535 places, 505/505 transitions.
Graph (complete) has 1014 edges and 535 vertex of which 534 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 200 transitions
Trivial Post-agglo rules discarded 200 transitions
Performed 200 trivial Post agglomeration. Transition count delta: 200
Iterating post reduction 0 with 201 rules applied. Total rules applied 202 place count 534 transition count 304
Reduce places removed 200 places and 0 transitions.
Graph (complete) has 586 edges and 334 vertex of which 290 are kept as prefixes of interest. Removing 44 places using SCC suffix rule.1 ms
Discarding 44 places :
Also discarding 0 output transitions
Iterating post reduction 1 with 201 rules applied. Total rules applied 403 place count 290 transition count 304
Drop transitions (Empty/Sink Transition effects.) removed 44 transitions
Reduce isomorphic transitions removed 44 transitions.
Iterating post reduction 2 with 44 rules applied. Total rules applied 447 place count 290 transition count 260
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 451 place count 286 transition count 256
Iterating global reduction 3 with 4 rules applied. Total rules applied 455 place count 286 transition count 256
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 1 rules applied. Total rules applied 456 place count 286 transition count 255
Reduce places removed 1 places and 0 transitions.
Graph (complete) has 496 edges and 285 vertex of which 283 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Iterating post reduction 4 with 2 rules applied. Total rules applied 458 place count 283 transition count 255
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 460 place count 283 transition count 253
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 461 place count 282 transition count 252
Iterating global reduction 6 with 1 rules applied. Total rules applied 462 place count 282 transition count 252
Free-agglomeration rule (complex) applied 23 times.
Iterating global reduction 6 with 23 rules applied. Total rules applied 485 place count 282 transition count 229
Reduce places removed 23 places and 0 transitions.
Iterating post reduction 6 with 23 rules applied. Total rules applied 508 place count 259 transition count 229
Reduce places removed 22 places and 22 transitions.
Iterating global reduction 7 with 22 rules applied. Total rules applied 530 place count 237 transition count 207
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 531 place count 236 transition count 207
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 11 Pre rules applied. Total rules applied 531 place count 236 transition count 196
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 8 with 22 rules applied. Total rules applied 553 place count 225 transition count 196
Applied a total of 553 rules in 94 ms. Remains 225 /535 variables (removed 310) and now considering 196/505 (removed 309) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 94 ms. Remains : 225/535 places, 196/505 transitions.
RANDOM walk for 36505 steps (183 resets) in 306 ms. (118 steps per ms) remains 0/1 properties
FORMULA HirschbergSinclair-PT-25-LTLFireability-04 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 535 stabilizing places and 505 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 535 transition count 505
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 535 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 535/535 places, 505/505 transitions.
Reduce places removed 24 places and 24 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 212 transitions
Trivial Post-agglo rules discarded 212 transitions
Performed 212 trivial Post agglomeration. Transition count delta: 212
Iterating post reduction 0 with 212 rules applied. Total rules applied 212 place count 511 transition count 269
Reduce places removed 212 places and 0 transitions.
Iterating post reduction 1 with 212 rules applied. Total rules applied 424 place count 299 transition count 269
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 430 place count 293 transition count 263
Iterating global reduction 2 with 6 rules applied. Total rules applied 436 place count 293 transition count 263
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 2 rules applied. Total rules applied 438 place count 293 transition count 261
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 440 place count 291 transition count 261
Applied a total of 440 rules in 56 ms. Remains 291 /535 variables (removed 244) and now considering 261/505 (removed 244) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16167210348072616712.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12841967051648816356.kers'
[2026-05-26 00:13:05] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16167210348072616712.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12841967051648816356.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 261 rows 291 cols 554 entries
Finished phase 1 with 256 SingleSign rule and 5 generalized
[2026-05-26 00:13:05] [INFO ] Computed 30 invariants in 1 ms
Computed 30 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-12841967051648816356.kers
Total runtime 1 ms.
[2026-05-26 00:13:05] [INFO ] Implicit Places using invariants in 267 ms returned []
[2026-05-26 00:13:05] [INFO ] Invariant cache hit.
[2026-05-26 00:13:08] [INFO ] Implicit Places using invariants and state equation in 2941 ms returned []
Implicit Place search using SMT with State Equation took 3210 ms to find 0 implicit places.
[2026-05-26 00:13:08] [INFO ] Redundant transitions in 12 ms returned []
Running 215 sub problems to find dead transitions.
[2026-05-26 00:13:08] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/245 variables, 26/26 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/245 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 2 (OVERLAPS) 3/248 variables, 4/30 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/248 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 4 (OVERLAPS) 218/466 variables, 248/278 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/466 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 6 (OVERLAPS) 0/466 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 215 unsolved
No progress, stopping.
After SMT solving in domain Real declared 466/552 variables, and 278 constraints, problems are : Problem set: 0 solved, 215 unsolved in 19966 ms.
Refiners :[Generalized P Invariants (flows): 30/30 constraints, State Equation: 248/291 constraints, PredecessorRefiner: 215/215 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 215 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/245 variables, 26/26 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/245 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 2 (OVERLAPS) 3/248 variables, 4/30 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/248 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 4 (OVERLAPS) 218/466 variables, 248/278 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/466 variables, 215/493 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/466 variables, 0/493 constraints. Problems are: Problem set: 0 solved, 215 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 466/552 variables, and 493 constraints, problems are : Problem set: 0 solved, 215 unsolved in 30019 ms.
Refiners :[Generalized P Invariants (flows): 30/30 constraints, State Equation: 248/291 constraints, PredecessorRefiner: 215/215 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 50006ms problems are : Problem set: 0 solved, 215 unsolved
Search for dead transitions found 0 dead transitions in 50008ms
Starting structural reductions in SI_LTL mode, iteration 1 : 291/535 places, 261/505 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 53299 ms. Remains : 291/535 places, 261/505 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Stuttering acceptance computed with spot in 227 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : HirschbergSinclair-PT-25-LTLFireability-00
Product exploration explored 100000 steps with 751 reset in 353 ms.
Product exploration explored 100000 steps with 751 reset in 346 ms.
Computed a total of 291 stabilizing places and 261 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 291 transition count 261
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Property proved to be false by K+ with min(phi)
Knowledge based reduction with 4 factoid took 24 ms. Proved property starting from automaton with 2 states, 3 edges and 1 AP (stutter insensitive
Knowledge-based reduction took 121 ms.
FORMULA HirschbergSinclair-PT-25-LTLFireability-00 FALSE TECHNIQUES KNOWLEDGE
Treatment of property HirschbergSinclair-PT-25-LTLFireability-00 finished in 54432 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(((F(p0) U p1)||X(X(F((p1&&(p0 U p2)))))))))'
Support contains 4 out of 535 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 535/535 places, 505/505 transitions.
Reduce places removed 24 places and 24 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 211 transitions
Trivial Post-agglo rules discarded 211 transitions
Performed 211 trivial Post agglomeration. Transition count delta: 211
Iterating post reduction 0 with 211 rules applied. Total rules applied 211 place count 511 transition count 270
Reduce places removed 211 places and 0 transitions.
Iterating post reduction 1 with 211 rules applied. Total rules applied 422 place count 300 transition count 270
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 427 place count 295 transition count 265
Iterating global reduction 2 with 5 rules applied. Total rules applied 432 place count 295 transition count 265
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 2 rules applied. Total rules applied 434 place count 295 transition count 263
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 436 place count 293 transition count 263
Applied a total of 436 rules in 38 ms. Remains 293 /535 variables (removed 242) and now considering 263/505 (removed 242) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1193247124053254414.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13361749280851429195.kers'
[2026-05-26 00:14:00] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1193247124053254414.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13361749280851429195.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 263 rows 293 cols 559 entries
Finished phase 1 with 258 SingleSign rule and 5 generalized
[2026-05-26 00:14:00] [INFO ] Computed 30 invariants in 1 ms
Computed 30 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-13361749280851429195.kers
Total runtime 2 ms.
[2026-05-26 00:14:00] [INFO ] Implicit Places using invariants in 203 ms returned []
[2026-05-26 00:14:00] [INFO ] Invariant cache hit.
[2026-05-26 00:14:02] [INFO ] Implicit Places using invariants and state equation in 2592 ms returned []
Implicit Place search using SMT with State Equation took 2797 ms to find 0 implicit places.
[2026-05-26 00:14:02] [INFO ] Redundant transitions in 3 ms returned []
Running 217 sub problems to find dead transitions.
[2026-05-26 00:14:02] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/247 variables, 26/26 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/247 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 2 (OVERLAPS) 3/250 variables, 4/30 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/250 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 4 (OVERLAPS) 222/472 variables, 250/280 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/472 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 6 (OVERLAPS) 2/474 variables, 2/282 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/474 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 8 (OVERLAPS) 0/474 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 217 unsolved
No progress, stopping.
After SMT solving in domain Real declared 474/556 variables, and 282 constraints, problems are : Problem set: 0 solved, 217 unsolved in 27456 ms.
Refiners :[Generalized P Invariants (flows): 30/30 constraints, State Equation: 252/293 constraints, PredecessorRefiner: 217/217 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 217 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/247 variables, 26/26 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/247 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 2 (OVERLAPS) 3/250 variables, 4/30 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/250 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 4 (OVERLAPS) 222/472 variables, 250/280 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/472 variables, 217/497 constraints. Problems are: Problem set: 0 solved, 217 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 472/556 variables, and 497 constraints, problems are : Problem set: 0 solved, 217 unsolved in 30013 ms.
Refiners :[Generalized P Invariants (flows): 30/30 constraints, State Equation: 250/293 constraints, PredecessorRefiner: 217/217 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 57483ms problems are : Problem set: 0 solved, 217 unsolved
Search for dead transitions found 0 dead transitions in 57485ms
Starting structural reductions in SI_LTL mode, iteration 1 : 293/535 places, 263/505 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 60337 ms. Remains : 293/535 places, 263/505 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(((F(p0) U p1)||X(X(F((p1&&(p0 U p2)))))))))'
Stuttering acceptance computed with spot in 153 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : HirschbergSinclair-PT-25-LTLFireability-02
Product exploration explored 100000 steps with 552 reset in 258 ms.
Product exploration explored 100000 steps with 549 reset in 257 ms.
Computed a total of 293 stabilizing places and 263 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 293 transition count 263
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Property proved to be false by K+ with min(phi)
Knowledge based reduction with 12 factoid took 29 ms. Proved property starting from automaton with 3 states, 7 edges and 3 AP (stutter insensitive
Knowledge-based reduction took 105 ms.
FORMULA HirschbergSinclair-PT-25-LTLFireability-02 FALSE TECHNIQUES KNOWLEDGE
Treatment of property HirschbergSinclair-PT-25-LTLFireability-02 finished in 61151 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(p0))&&((F(p1)&&F(p0)) U p2)))'
Support contains 6 out of 535 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 535/535 places, 505/505 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 530 transition count 500
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 530 transition count 500
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 14 place count 526 transition count 496
Iterating global reduction 0 with 4 rules applied. Total rules applied 18 place count 526 transition count 496
Applied a total of 18 rules in 29 ms. Remains 526 /535 variables (removed 9) and now considering 496/505 (removed 9) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13110198673556211728.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5460122266291303400.kers'
[2026-05-26 00:15:01] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13110198673556211728.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5460122266291303400.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 496 rows 526 cols 1493 entries
Finished phase 1 with 491 SingleSign rule and 5 generalized
[2026-05-26 00:15:01] [INFO ] Computed 30 invariants in 6 ms
Computed 30 P flows in 7 ms.
Exported basis to /tmp/petrispot-output-5460122266291303400.kers
Total runtime 8 ms.
[2026-05-26 00:15:01] [INFO ] Implicit Places using invariants in 192 ms returned []
[2026-05-26 00:15:01] [INFO ] Invariant cache hit.
[2026-05-26 00:15:08] [INFO ] Implicit Places using invariants and state equation in 7046 ms returned []
Implicit Place search using SMT with State Equation took 7241 ms to find 0 implicit places.
Running 471 sub problems to find dead transitions.
[2026-05-26 00:15:08] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/501 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 471 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/501 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 471 unsolved
At refinement iteration 2 (OVERLAPS) 25/526 variables, 26/30 constraints. Problems are: Problem set: 0 solved, 471 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/526 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 471 unsolved
At refinement iteration 4 (OVERLAPS) 496/1022 variables, 526/556 constraints. Problems are: Problem set: 0 solved, 471 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1022/1022 variables, and 556 constraints, problems are : Problem set: 0 solved, 471 unsolved in 30026 ms.
Refiners :[Generalized P Invariants (flows): 30/30 constraints, State Equation: 526/526 constraints, PredecessorRefiner: 471/471 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 471 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/501 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 471 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/501 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 471 unsolved
At refinement iteration 2 (OVERLAPS) 25/526 variables, 26/30 constraints. Problems are: Problem set: 0 solved, 471 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/526 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 471 unsolved
At refinement iteration 4 (OVERLAPS) 496/1022 variables, 526/556 constraints. Problems are: Problem set: 0 solved, 471 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1022 variables, 471/1027 constraints. Problems are: Problem set: 0 solved, 471 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1022/1022 variables, and 1027 constraints, problems are : Problem set: 0 solved, 471 unsolved in 30034 ms.
Refiners :[Generalized P Invariants (flows): 30/30 constraints, State Equation: 526/526 constraints, PredecessorRefiner: 471/471 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60128ms problems are : Problem set: 0 solved, 471 unsolved
Search for dead transitions found 0 dead transitions in 60133ms
Starting structural reductions in LTL mode, iteration 1 : 526/535 places, 496/505 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 67409 ms. Remains : 526/535 places, 496/505 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(p0))&&((F(p1)&&F(p0)) U p2)))'
Stuttering acceptance computed with spot in 247 ms :[(OR (NOT p2) (NOT p0)), (NOT p0), (NOT p1), (NOT p0), (NOT p2), (NOT p0), true]
Running random walk in product with property : HirschbergSinclair-PT-25-LTLFireability-05
Entered a terminal (fully accepting) state of product in 468 steps with 1 reset in 2 ms.
FORMULA HirschbergSinclair-PT-25-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-25-LTLFireability-05 finished in 67694 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F((p0||G(p1)))))))'
Support contains 3 out of 535 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 535/535 places, 505/505 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 530 transition count 500
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 530 transition count 500
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 14 place count 526 transition count 496
Iterating global reduction 0 with 4 rules applied. Total rules applied 18 place count 526 transition count 496
Applied a total of 18 rules in 25 ms. Remains 526 /535 variables (removed 9) and now considering 496/505 (removed 9) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6932523089143969332.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16840660731965891163.kers'
[2026-05-26 00:16:08] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6932523089143969332.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16840660731965891163.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 496 rows 526 cols 1493 entries
Finished phase 1 with 491 SingleSign rule and 5 generalized
[2026-05-26 00:16:08] [INFO ] Computed 30 invariants in 6 ms
Computed 30 P flows in 7 ms.
Exported basis to /tmp/petrispot-output-16840660731965891163.kers
Total runtime 7 ms.
[2026-05-26 00:16:09] [INFO ] Implicit Places using invariants in 201 ms returned []
[2026-05-26 00:16:09] [INFO ] Invariant cache hit.
[2026-05-26 00:16:16] [INFO ] Implicit Places using invariants and state equation in 7493 ms returned []
Implicit Place search using SMT with State Equation took 7696 ms to find 0 implicit places.
Skipped dead transition search.
Starting structural reductions in LTL mode, iteration 1 : 526/535 places, 496/505 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7723 ms. Remains : 526/535 places, 496/505 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F((G(p0)||p1))))))'
Stuttering acceptance computed with spot in 145 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : HirschbergSinclair-PT-25-LTLFireability-06
Product exploration explored 100000 steps with 2600 reset in 397 ms.
Stuttering criterion allowed to conclude after 64133 steps with 1650 reset in 264 ms.
FORMULA HirschbergSinclair-PT-25-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-25-LTLFireability-06 finished in 8561 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((((p0 U X(p1))||F(G(!p0))) U X(p2)))'
Support contains 4 out of 535 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 535/535 places, 505/505 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 530 transition count 500
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 530 transition count 500
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 13 place count 527 transition count 497
Iterating global reduction 0 with 3 rules applied. Total rules applied 16 place count 527 transition count 497
Applied a total of 16 rules in 29 ms. Remains 527 /535 variables (removed 8) and now considering 497/505 (removed 8) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2143895612523455505.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11536281033224075637.kers'
[2026-05-26 00:16:17] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2143895612523455505.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11536281033224075637.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 497 rows 527 cols 1495 entries
Finished phase 1 with 492 SingleSign rule and 5 generalized
[2026-05-26 00:16:17] [INFO ] Computed 30 invariants in 6 ms
Computed 30 P flows in 7 ms.
Exported basis to /tmp/petrispot-output-11536281033224075637.kers
Total runtime 8 ms.
[2026-05-26 00:16:17] [INFO ] Implicit Places using invariants in 198 ms returned []
[2026-05-26 00:16:17] [INFO ] Invariant cache hit.
[2026-05-26 00:16:24] [INFO ] Implicit Places using invariants and state equation in 7383 ms returned []
Implicit Place search using SMT with State Equation took 7585 ms to find 0 implicit places.
Running 472 sub problems to find dead transitions.
[2026-05-26 00:16:24] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/502 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 472 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/502 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 472 unsolved
At refinement iteration 2 (OVERLAPS) 25/527 variables, 26/30 constraints. Problems are: Problem set: 0 solved, 472 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/527 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 472 unsolved
At refinement iteration 4 (OVERLAPS) 497/1024 variables, 527/557 constraints. Problems are: Problem set: 0 solved, 472 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1024/1024 variables, and 557 constraints, problems are : Problem set: 0 solved, 472 unsolved in 30018 ms.
Refiners :[Generalized P Invariants (flows): 30/30 constraints, State Equation: 527/527 constraints, PredecessorRefiner: 472/472 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 472 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/502 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 472 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/502 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 472 unsolved
At refinement iteration 2 (OVERLAPS) 25/527 variables, 26/30 constraints. Problems are: Problem set: 0 solved, 472 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/527 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 472 unsolved
At refinement iteration 4 (OVERLAPS) 497/1024 variables, 527/557 constraints. Problems are: Problem set: 0 solved, 472 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1024 variables, 472/1029 constraints. Problems are: Problem set: 0 solved, 472 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1024/1024 variables, and 1029 constraints, problems are : Problem set: 0 solved, 472 unsolved in 30028 ms.
Refiners :[Generalized P Invariants (flows): 30/30 constraints, State Equation: 527/527 constraints, PredecessorRefiner: 472/472 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60105ms problems are : Problem set: 0 solved, 472 unsolved
Search for dead transitions found 0 dead transitions in 60108ms
Starting structural reductions in LTL mode, iteration 1 : 527/535 places, 497/505 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 67726 ms. Remains : 527/535 places, 497/505 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((((p0 U X(p1))||F(G(!p0))) U X(p2)))'
Stuttering acceptance computed with spot in 313 ms :[(NOT p2), (AND (NOT p1) (NOT p2) p0), (NOT p2), (AND p0 (NOT p1) (NOT p2)), p0, (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Running random walk in product with property : HirschbergSinclair-PT-25-LTLFireability-07
Product exploration explored 100000 steps with 183 reset in 254 ms.
Product exploration explored 100000 steps with 183 reset in 278 ms.
Computed a total of 527 stabilizing places and 497 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 527 transition count 497
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge based reduction with 22 factoid took 86 ms. Reduced automaton from 7 states, 14 edges and 3 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
RANDOM walk for 214 steps (0 resets) in 7 ms. (26 steps per ms) remains 0/1 properties
Knowledge based reduction with 22 factoid took 82 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 87 ms :[(NOT p2), (NOT p2)]
[2026-05-26 00:17:26] [INFO ] Invariant cache hit.
[2026-05-26 00:17:26] [INFO ] [Real]Absence check using 0 positive and 30 generalized place invariants in 21 ms returned unsat
Proved EG (NOT p2) asserting that LTL formula F !(NOT p2) is false.
Negative knowledge disproves property using: (F p2)
Knowledge-based reduction took 649 ms.
FORMULA HirschbergSinclair-PT-25-LTLFireability-07 FALSE TECHNIQUES NEGATIVE_KNOWLEDGE
Treatment of property HirschbergSinclair-PT-25-LTLFireability-07 finished in 69269 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X((p0||G(p1))) U ((X((p0||G(p1)))&&G((p2||F(p3))))||X(G((p0||G(p1)))))))'
Support contains 6 out of 535 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 535/535 places, 505/505 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 529 transition count 499
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 529 transition count 499
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 16 place count 525 transition count 495
Iterating global reduction 0 with 4 rules applied. Total rules applied 20 place count 525 transition count 495
Applied a total of 20 rules in 30 ms. Remains 525 /535 variables (removed 10) and now considering 495/505 (removed 10) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5418636324690368267.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7462440967367098573.kers'
[2026-05-26 00:17:26] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5418636324690368267.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7462440967367098573.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 495 rows 525 cols 1490 entries
Finished phase 1 with 490 SingleSign rule and 5 generalized
[2026-05-26 00:17:26] [INFO ] Computed 30 invariants in 5 ms
Computed 30 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-7462440967367098573.kers
Total runtime 6 ms.
[2026-05-26 00:17:26] [INFO ] Implicit Places using invariants in 185 ms returned []
[2026-05-26 00:17:26] [INFO ] Invariant cache hit.
[2026-05-26 00:17:33] [INFO ] Implicit Places using invariants and state equation in 6495 ms returned []
Implicit Place search using SMT with State Equation took 6683 ms to find 0 implicit places.
Running 470 sub problems to find dead transitions.
[2026-05-26 00:17:33] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/500 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 470 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/500 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 470 unsolved
At refinement iteration 2 (OVERLAPS) 25/525 variables, 26/30 constraints. Problems are: Problem set: 0 solved, 470 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/525 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 470 unsolved
At refinement iteration 4 (OVERLAPS) 495/1020 variables, 525/555 constraints. Problems are: Problem set: 0 solved, 470 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1020/1020 variables, and 555 constraints, problems are : Problem set: 0 solved, 470 unsolved in 30018 ms.
Refiners :[Generalized P Invariants (flows): 30/30 constraints, State Equation: 525/525 constraints, PredecessorRefiner: 470/470 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 470 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/500 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 470 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/500 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 470 unsolved
At refinement iteration 2 (OVERLAPS) 25/525 variables, 26/30 constraints. Problems are: Problem set: 0 solved, 470 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/525 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 470 unsolved
At refinement iteration 4 (OVERLAPS) 495/1020 variables, 525/555 constraints. Problems are: Problem set: 0 solved, 470 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1020 variables, 470/1025 constraints. Problems are: Problem set: 0 solved, 470 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1020/1020 variables, and 1025 constraints, problems are : Problem set: 0 solved, 470 unsolved in 30022 ms.
Refiners :[Generalized P Invariants (flows): 30/30 constraints, State Equation: 525/525 constraints, PredecessorRefiner: 470/470 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60089ms problems are : Problem set: 0 solved, 470 unsolved
Search for dead transitions found 0 dead transitions in 60093ms
Starting structural reductions in LTL mode, iteration 1 : 525/535 places, 495/505 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 66809 ms. Remains : 525/535 places, 495/505 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X((p0||G(p1))) U (X(G((p0||G(p1))))||(X((p0||G(p1)))&&G((p2||F(p3)))))))'
Stuttering acceptance computed with spot in 804 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p2) (NOT p3) (NOT p0) (NOT p1)), true, (NOT p1), (AND (NOT p3) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p2) (NOT p3) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p3) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p3) (NOT p0) (NOT p1)), (NOT p3), (AND (NOT p3) (NOT p1)), (AND (NOT p3) (NOT p1) (NOT p2) (NOT p0)), (OR (AND p0 (NOT p2) (NOT p3)) (AND p1 (NOT p2) (NOT p3))), (AND (NOT p3) (NOT p1) (NOT p2) p0), (AND (NOT p3) (NOT p2)), (AND (NOT p3) (NOT p1) (NOT p2))]
Running random walk in product with property : HirschbergSinclair-PT-25-LTLFireability-08
Product exploration explored 100000 steps with 30035 reset in 331 ms.
Product exploration explored 100000 steps with 29933 reset in 348 ms.
Computed a total of 525 stabilizing places and 495 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 525 transition count 495
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge based reduction with 31 factoid took 556 ms. Reduced automaton from 18 states, 72 edges and 4 AP (stutter sensitive) to 15 states, 65 edges and 4 AP (stutter sensitive).
Reduction of identical properties reduced properties to check from 29 to 28
RANDOM walk for 40000 steps (72 resets) in 464 ms. (86 steps per ms) remains 7/28 properties
BEST_FIRST walk for 40004 steps (8 resets) in 209 ms. (190 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (8 resets) in 125 ms. (317 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (8 resets) in 108 ms. (366 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 103 ms. (384 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (8 resets) in 102 ms. (388 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (8 resets) in 78 ms. (506 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 111 ms. (357 steps per ms) remains 7/7 properties
[2026-05-26 00:18:36] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 441/447 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/447 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 31/478 variables, 3/30 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/478 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Problem apf3 is UNSAT
Problem apf7 is UNSAT
Problem apf9 is UNSAT
Problem apf11 is UNSAT
Problem apf13 is UNSAT
Problem apf16 is UNSAT
Problem apf23 is UNSAT
After SMT solving in domain Real declared 973/1020 variables, and 508 constraints, problems are : Problem set: 7 solved, 0 unsolved in 504 ms.
Refiners :[Generalized P Invariants (flows): 30/30 constraints, State Equation: 478/525 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 517ms problems are : Problem set: 7 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 8 invariant AP formulas.
Knowledge based reduction with 39 factoid took 979 ms. Reduced automaton from 15 states, 65 edges and 4 AP (stutter sensitive) to 10 states, 24 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 463 ms :[(AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p3) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p3) (NOT p0) (NOT p1)), (AND (NOT p3) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p3)), (NOT p3), (AND (NOT p3) (NOT p1)), (AND (NOT p3) (NOT p2)), (AND (NOT p1) (NOT p3))]
Knowledge-based reduction took 3102 ms.
Stuttering acceptance computed with spot in 447 ms :[(AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p3) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p3) (NOT p0) (NOT p1)), (AND (NOT p3) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p3)), (NOT p3), (AND (NOT p3) (NOT p1)), (AND (NOT p3) (NOT p2)), (AND (NOT p1) (NOT p3))]
Support contains 6 out of 525 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 525/525 places, 495/495 transitions.
Applied a total of 0 rules in 14 ms. Remains 525 /525 variables (removed 0) and now considering 495/495 (removed 0) transitions.
[2026-05-26 00:18:38] [INFO ] Invariant cache hit.
[2026-05-26 00:18:38] [INFO ] Implicit Places using invariants in 187 ms returned []
[2026-05-26 00:18:38] [INFO ] Invariant cache hit.
[2026-05-26 00:18:45] [INFO ] Implicit Places using invariants and state equation in 6388 ms returned []
Implicit Place search using SMT with State Equation took 6578 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 6598 ms. Remains : 525/525 places, 495/495 transitions.
Computed a total of 525 stabilizing places and 495 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 525 transition count 495
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge based reduction with 16 factoid took 214 ms. Reduced automaton from 10 states, 24 edges and 4 AP (stutter sensitive) to 10 states, 24 edges and 4 AP (stutter sensitive).
RANDOM walk for 1554 steps (0 resets) in 25 ms. (59 steps per ms) remains 0/11 properties
Knowledge based reduction with 16 factoid took 391 ms. Reduced automaton from 10 states, 24 edges and 4 AP (stutter sensitive) to 10 states, 24 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 437 ms :[(AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p3) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p3) (NOT p0) (NOT p1)), (AND (NOT p3) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p3)), (NOT p3), (AND (NOT p3) (NOT p1)), (AND (NOT p3) (NOT p2)), (AND (NOT p1) (NOT p3))]
Knowledge-based reduction took 1202 ms.
Stuttering acceptance computed with spot in 452 ms :[(AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p3) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p3) (NOT p0) (NOT p1)), (AND (NOT p3) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p3)), (NOT p3), (AND (NOT p3) (NOT p1)), (AND (NOT p3) (NOT p2)), (AND (NOT p1) (NOT p3))]
Stuttering acceptance computed with spot in 512 ms :[(AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p3) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p3) (NOT p0) (NOT p1)), (AND (NOT p3) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p3)), (NOT p3), (AND (NOT p3) (NOT p1)), (AND (NOT p3) (NOT p2)), (AND (NOT p1) (NOT p3))]
Product exploration explored 100000 steps with 23550 reset in 307 ms.
Product exploration explored 100000 steps with 23481 reset in 314 ms.
Spot run failed in 81 ms. Status :1
Traceback (most recent call last):
File "/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/autstates.py", line 2, in
import spot
ModuleNotFoundError: No module named 'spot'
java.io.IOException
at fr.lip6.move.gal.application.runner.spot.SpotRunner.computeForwardClosedSI(SpotRunner.java:551)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.treatPartialPOR(LTLPropertySolver.java:419)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:280)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:217)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:66)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:849)
at fr.lip6.move.gal.application.Application.start(Application.java:195)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:219)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:615)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:563)
at org.eclipse.equinox.launcher.Main.run(Main.java:1415)
at org.eclipse.equinox.launcher.Main.main(Main.java:1387)
Built C files in :
/tmp/ltsmin15581491625506281884
[2026-05-26 00:18:48] [INFO ] Built C files in 21ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15581491625506281884
Running compilation step : cd /tmp/ltsmin15581491625506281884;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 923 ms.
Running link step : cd /tmp/ltsmin15581491625506281884;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 49 ms.
Running LTSmin : cd /tmp/ltsmin15581491625506281884;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--hoa' '/tmp/stateBased2331572449555798692.hoa' '--buchi-type=spotba'
LTSmin run took 219 ms.
FORMULA HirschbergSinclair-PT-25-LTLFireability-08 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property HirschbergSinclair-PT-25-LTLFireability-08 finished in 82696 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)||G(p1)))'
Support contains 2 out of 535 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 535/535 places, 505/505 transitions.
Reduce places removed 25 places and 25 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 220 transitions
Trivial Post-agglo rules discarded 220 transitions
Performed 220 trivial Post agglomeration. Transition count delta: 220
Iterating post reduction 0 with 220 rules applied. Total rules applied 220 place count 510 transition count 260
Reduce places removed 220 places and 0 transitions.
Iterating post reduction 1 with 220 rules applied. Total rules applied 440 place count 290 transition count 260
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 445 place count 285 transition count 255
Iterating global reduction 2 with 5 rules applied. Total rules applied 450 place count 285 transition count 255
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 2 rules applied. Total rules applied 452 place count 285 transition count 253
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 454 place count 283 transition count 253
Applied a total of 454 rules in 31 ms. Remains 283 /535 variables (removed 252) and now considering 253/505 (removed 252) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16444784817971239335.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15994057898779822877.kers'
[2026-05-26 00:18:49] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16444784817971239335.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15994057898779822877.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 253 rows 283 cols 520 entries
Finished phase 1 with 248 SingleSign rule and 5 generalized
[2026-05-26 00:18:49] [INFO ] Computed 30 invariants in 2 ms
Computed 30 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-15994057898779822877.kers
Total runtime 4 ms.
[2026-05-26 00:18:49] [INFO ] Implicit Places using invariants in 240 ms returned []
[2026-05-26 00:18:49] [INFO ] Invariant cache hit.
[2026-05-26 00:18:51] [INFO ] Implicit Places using invariants and state equation in 2108 ms returned []
Implicit Place search using SMT with State Equation took 2350 ms to find 0 implicit places.
[2026-05-26 00:18:51] [INFO ] Redundant transitions in 2 ms returned []
Running 204 sub problems to find dead transitions.
[2026-05-26 00:18:51] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/234 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/234 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 2 (OVERLAPS) 2/236 variables, 3/30 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/236 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 4 (OVERLAPS) 206/442 variables, 236/266 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/442 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 6 (OVERLAPS) 0/442 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 204 unsolved
No progress, stopping.
After SMT solving in domain Real declared 442/536 variables, and 266 constraints, problems are : Problem set: 0 solved, 204 unsolved in 19818 ms.
Refiners :[Generalized P Invariants (flows): 30/30 constraints, State Equation: 236/283 constraints, PredecessorRefiner: 204/204 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 204 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/234 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/234 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 2 (OVERLAPS) 2/236 variables, 3/30 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/236 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 4 (OVERLAPS) 206/442 variables, 236/266 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/442 variables, 204/470 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/442 variables, 0/470 constraints. Problems are: Problem set: 0 solved, 204 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 442/536 variables, and 470 constraints, problems are : Problem set: 0 solved, 204 unsolved in 30020 ms.
Refiners :[Generalized P Invariants (flows): 30/30 constraints, State Equation: 236/283 constraints, PredecessorRefiner: 204/204 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 49852ms problems are : Problem set: 0 solved, 204 unsolved
Search for dead transitions found 0 dead transitions in 49853ms
Starting structural reductions in SI_LTL mode, iteration 1 : 283/535 places, 253/505 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 52241 ms. Remains : 283/535 places, 253/505 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)||G(p1)))'
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : HirschbergSinclair-PT-25-LTLFireability-09
Stuttering criterion allowed to conclude after 2225 steps with 8 reset in 11 ms.
FORMULA HirschbergSinclair-PT-25-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-25-LTLFireability-09 finished in 52362 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||G(p1)||(p2&&X((G(p3)||G(p0)))))))'
Support contains 5 out of 535 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 535/535 places, 505/505 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 530 transition count 500
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 530 transition count 500
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 13 place count 527 transition count 497
Iterating global reduction 0 with 3 rules applied. Total rules applied 16 place count 527 transition count 497
Applied a total of 16 rules in 33 ms. Remains 527 /535 variables (removed 8) and now considering 497/505 (removed 8) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8811367573230838097.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17478479831681624945.kers'
[2026-05-26 00:19:41] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8811367573230838097.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17478479831681624945.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 497 rows 527 cols 1495 entries
Finished phase 1 with 492 SingleSign rule and 5 generalized
[2026-05-26 00:19:41] [INFO ] Computed 30 invariants in 8 ms
Computed 30 P flows in 9 ms.
Exported basis to /tmp/petrispot-output-17478479831681624945.kers
Total runtime 10 ms.
[2026-05-26 00:19:41] [INFO ] Implicit Places using invariants in 196 ms returned []
[2026-05-26 00:19:41] [INFO ] Invariant cache hit.
[2026-05-26 00:19:49] [INFO ] Implicit Places using invariants and state equation in 7573 ms returned []
Implicit Place search using SMT with State Equation took 7771 ms to find 0 implicit places.
Running 472 sub problems to find dead transitions.
[2026-05-26 00:19:49] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/502 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 472 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/502 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 472 unsolved
At refinement iteration 2 (OVERLAPS) 25/527 variables, 26/30 constraints. Problems are: Problem set: 0 solved, 472 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/527 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 472 unsolved
At refinement iteration 4 (OVERLAPS) 497/1024 variables, 527/557 constraints. Problems are: Problem set: 0 solved, 472 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1024/1024 variables, and 557 constraints, problems are : Problem set: 0 solved, 472 unsolved in 30020 ms.
Refiners :[Generalized P Invariants (flows): 30/30 constraints, State Equation: 527/527 constraints, PredecessorRefiner: 472/472 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 472 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/502 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 472 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/502 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 472 unsolved
At refinement iteration 2 (OVERLAPS) 25/527 variables, 26/30 constraints. Problems are: Problem set: 0 solved, 472 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/527 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 472 unsolved
At refinement iteration 4 (OVERLAPS) 497/1024 variables, 527/557 constraints. Problems are: Problem set: 0 solved, 472 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1024 variables, 472/1029 constraints. Problems are: Problem set: 0 solved, 472 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1024/1024 variables, and 1029 constraints, problems are : Problem set: 0 solved, 472 unsolved in 30022 ms.
Refiners :[Generalized P Invariants (flows): 30/30 constraints, State Equation: 527/527 constraints, PredecessorRefiner: 472/472 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60097ms problems are : Problem set: 0 solved, 472 unsolved
Search for dead transitions found 0 dead transitions in 60101ms
Starting structural reductions in LTL mode, iteration 1 : 527/535 places, 497/505 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 67909 ms. Remains : 527/535 places, 497/505 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||G(p1)||(p2&&X((G(p3)||G(p0)))))))'
Stuttering acceptance computed with spot in 372 ms :[true, (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (NOT p1), (NOT p3), (AND (NOT p3) (NOT p0)), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : HirschbergSinclair-PT-25-LTLFireability-10
Entered a terminal (fully accepting) state of product in 182 steps with 90 reset in 0 ms.
FORMULA HirschbergSinclair-PT-25-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-25-LTLFireability-10 finished in 68330 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 535 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 535/535 places, 505/505 transitions.
Reduce places removed 25 places and 25 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 221 transitions
Trivial Post-agglo rules discarded 221 transitions
Performed 221 trivial Post agglomeration. Transition count delta: 221
Iterating post reduction 0 with 221 rules applied. Total rules applied 221 place count 510 transition count 259
Reduce places removed 221 places and 0 transitions.
Iterating post reduction 1 with 221 rules applied. Total rules applied 442 place count 289 transition count 259
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 448 place count 283 transition count 253
Iterating global reduction 2 with 6 rules applied. Total rules applied 454 place count 283 transition count 253
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 2 rules applied. Total rules applied 456 place count 283 transition count 251
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 458 place count 281 transition count 251
Applied a total of 458 rules in 29 ms. Remains 281 /535 variables (removed 254) and now considering 251/505 (removed 254) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-18255120100972468713.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14822161595711401810.kers'
[2026-05-26 00:20:50] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-18255120100972468713.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14822161595711401810.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 251 rows 281 cols 514 entries
Finished phase 1 with 246 SingleSign rule and 5 generalized
[2026-05-26 00:20:50] [INFO ] Computed 30 invariants in 1 ms
Computed 30 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-14822161595711401810.kers
Total runtime 2 ms.
[2026-05-26 00:20:50] [INFO ] Implicit Places using invariants in 220 ms returned []
[2026-05-26 00:20:50] [INFO ] Invariant cache hit.
[2026-05-26 00:20:52] [INFO ] Implicit Places using invariants and state equation in 2388 ms returned []
Implicit Place search using SMT with State Equation took 2610 ms to find 0 implicit places.
[2026-05-26 00:20:52] [INFO ] Redundant transitions in 1 ms returned []
Running 202 sub problems to find dead transitions.
[2026-05-26 00:20:52] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/232 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/232 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 2 (OVERLAPS) 2/234 variables, 3/30 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/234 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 4 (OVERLAPS) 204/438 variables, 234/264 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/438 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 6 (OVERLAPS) 0/438 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 202 unsolved
No progress, stopping.
After SMT solving in domain Real declared 438/532 variables, and 264 constraints, problems are : Problem set: 0 solved, 202 unsolved in 18194 ms.
Refiners :[Generalized P Invariants (flows): 30/30 constraints, State Equation: 234/281 constraints, PredecessorRefiner: 202/202 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 202 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/232 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/232 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 2 (OVERLAPS) 2/234 variables, 3/30 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/234 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 4 (OVERLAPS) 204/438 variables, 234/264 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/438 variables, 202/466 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/438 variables, 0/466 constraints. Problems are: Problem set: 0 solved, 202 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 438/532 variables, and 466 constraints, problems are : Problem set: 0 solved, 202 unsolved in 30017 ms.
Refiners :[Generalized P Invariants (flows): 30/30 constraints, State Equation: 234/281 constraints, PredecessorRefiner: 202/202 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 48231ms problems are : Problem set: 0 solved, 202 unsolved
Search for dead transitions found 0 dead transitions in 48231ms
Starting structural reductions in SI_LTL mode, iteration 1 : 281/535 places, 251/505 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 50880 ms. Remains : 281/535 places, 251/505 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Running random walk in product with property : HirschbergSinclair-PT-25-LTLFireability-12
Product exploration explored 100000 steps with 469 reset in 202 ms.
Product exploration explored 100000 steps with 469 reset in 214 ms.
Computed a total of 281 stabilizing places and 251 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 281 transition count 251
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge based reduction with 4 factoid took 44 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
RANDOM walk for 890 steps (0 resets) in 7 ms. (111 steps per ms) remains 0/1 properties
Knowledge based reduction with 4 factoid took 62 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
[2026-05-26 00:21:41] [INFO ] Invariant cache hit.
[2026-05-26 00:21:41] [INFO ] [Real]Absence check using 0 positive and 30 generalized place invariants in 10 ms returned sat
[2026-05-26 00:21:41] [INFO ] [Real]Absence check using state equation in 77 ms returned unsat
Proved EG (NOT p0) asserting that LTL formula F !(NOT p0) is false.
Negative knowledge disproves property using: (F p0)
Knowledge-based reduction took 442 ms.
FORMULA HirschbergSinclair-PT-25-LTLFireability-12 FALSE TECHNIQUES NEGATIVE_KNOWLEDGE
Treatment of property HirschbergSinclair-PT-25-LTLFireability-12 finished in 51809 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 2 out of 535 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 535/535 places, 505/505 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 529 transition count 499
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 529 transition count 499
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 16 place count 525 transition count 495
Iterating global reduction 0 with 4 rules applied. Total rules applied 20 place count 525 transition count 495
Applied a total of 20 rules in 31 ms. Remains 525 /535 variables (removed 10) and now considering 495/505 (removed 10) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3869029949581745404.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9614023587174973348.kers'
[2026-05-26 00:21:41] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3869029949581745404.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9614023587174973348.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 495 rows 525 cols 1490 entries
Finished phase 1 with 490 SingleSign rule and 5 generalized
[2026-05-26 00:21:41] [INFO ] Computed 30 invariants in 2 ms
Computed 30 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-9614023587174973348.kers
Total runtime 3 ms.
[2026-05-26 00:21:42] [INFO ] Implicit Places using invariants in 225 ms returned []
[2026-05-26 00:21:42] [INFO ] Invariant cache hit.
[2026-05-26 00:21:48] [INFO ] Implicit Places using invariants and state equation in 6593 ms returned []
Implicit Place search using SMT with State Equation took 6846 ms to find 0 implicit places.
Running 470 sub problems to find dead transitions.
[2026-05-26 00:21:48] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/500 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 470 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/500 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 470 unsolved
At refinement iteration 2 (OVERLAPS) 25/525 variables, 26/30 constraints. Problems are: Problem set: 0 solved, 470 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/525 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 470 unsolved
At refinement iteration 4 (OVERLAPS) 495/1020 variables, 525/555 constraints. Problems are: Problem set: 0 solved, 470 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1020/1020 variables, and 555 constraints, problems are : Problem set: 0 solved, 470 unsolved in 30018 ms.
Refiners :[Generalized P Invariants (flows): 30/30 constraints, State Equation: 525/525 constraints, PredecessorRefiner: 470/470 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 470 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/500 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 470 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/500 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 470 unsolved
At refinement iteration 2 (OVERLAPS) 25/525 variables, 26/30 constraints. Problems are: Problem set: 0 solved, 470 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/525 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 470 unsolved
At refinement iteration 4 (OVERLAPS) 495/1020 variables, 525/555 constraints. Problems are: Problem set: 0 solved, 470 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1020 variables, 470/1025 constraints. Problems are: Problem set: 0 solved, 470 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1020/1020 variables, and 1025 constraints, problems are : Problem set: 0 solved, 470 unsolved in 30021 ms.
Refiners :[Generalized P Invariants (flows): 30/30 constraints, State Equation: 525/525 constraints, PredecessorRefiner: 470/470 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60084ms problems are : Problem set: 0 solved, 470 unsolved
Search for dead transitions found 0 dead transitions in 60085ms
Starting structural reductions in LTL mode, iteration 1 : 525/535 places, 495/505 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 66965 ms. Remains : 525/535 places, 495/505 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Stuttering acceptance computed with spot in 150 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : HirschbergSinclair-PT-25-LTLFireability-13
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA HirschbergSinclair-PT-25-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-25-LTLFireability-13 finished in 67151 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(!p0) U X(p1)))'
Support contains 3 out of 535 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 535/535 places, 505/505 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 529 transition count 499
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 529 transition count 499
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 15 place count 526 transition count 496
Iterating global reduction 0 with 3 rules applied. Total rules applied 18 place count 526 transition count 496
Applied a total of 18 rules in 38 ms. Remains 526 /535 variables (removed 9) and now considering 496/505 (removed 9) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17000348171168657630.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4822454237368817771.kers'
[2026-05-26 00:22:49] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17000348171168657630.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4822454237368817771.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 496 rows 526 cols 1493 entries
Finished phase 1 with 491 SingleSign rule and 5 generalized
[2026-05-26 00:22:49] [INFO ] Computed 30 invariants in 5 ms
Computed 30 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-4822454237368817771.kers
Total runtime 6 ms.
[2026-05-26 00:22:49] [INFO ] Implicit Places using invariants in 195 ms returned []
[2026-05-26 00:22:49] [INFO ] Invariant cache hit.
[2026-05-26 00:22:56] [INFO ] Implicit Places using invariants and state equation in 7445 ms returned []
Implicit Place search using SMT with State Equation took 7642 ms to find 0 implicit places.
Running 471 sub problems to find dead transitions.
[2026-05-26 00:22:56] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/501 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 471 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/501 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 471 unsolved
At refinement iteration 2 (OVERLAPS) 25/526 variables, 26/30 constraints. Problems are: Problem set: 0 solved, 471 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/526 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 471 unsolved
At refinement iteration 4 (OVERLAPS) 496/1022 variables, 526/556 constraints. Problems are: Problem set: 0 solved, 471 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1022/1022 variables, and 556 constraints, problems are : Problem set: 0 solved, 471 unsolved in 30018 ms.
Refiners :[Generalized P Invariants (flows): 30/30 constraints, State Equation: 526/526 constraints, PredecessorRefiner: 471/471 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 471 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/501 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 471 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/501 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 471 unsolved
At refinement iteration 2 (OVERLAPS) 25/526 variables, 26/30 constraints. Problems are: Problem set: 0 solved, 471 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/526 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 471 unsolved
At refinement iteration 4 (OVERLAPS) 496/1022 variables, 526/556 constraints. Problems are: Problem set: 0 solved, 471 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1022 variables, 471/1027 constraints. Problems are: Problem set: 0 solved, 471 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1022/1022 variables, and 1027 constraints, problems are : Problem set: 0 solved, 471 unsolved in 30031 ms.
Refiners :[Generalized P Invariants (flows): 30/30 constraints, State Equation: 526/526 constraints, PredecessorRefiner: 471/471 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60092ms problems are : Problem set: 0 solved, 471 unsolved
Search for dead transitions found 0 dead transitions in 60094ms
Starting structural reductions in LTL mode, iteration 1 : 526/535 places, 496/505 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 67777 ms. Remains : 526/535 places, 496/505 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(!p0) U X(p1)))'
Stuttering acceptance computed with spot in 196 ms :[(NOT p1), (NOT p1), (AND p0 (NOT p1)), p0]
Running random walk in product with property : HirschbergSinclair-PT-25-LTLFireability-14
Product exploration explored 100000 steps with 50000 reset in 277 ms.
Product exploration explored 100000 steps with 50000 reset in 271 ms.
Computed a total of 526 stabilizing places and 496 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 526 transition count 496
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 9 factoid took 18 ms. Proved property starting from automaton with 4 states, 6 edges and 2 AP (stutter sensitive
Knowledge-based reduction took 143 ms.
FORMULA HirschbergSinclair-PT-25-LTLFireability-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HirschbergSinclair-PT-25-LTLFireability-14 finished in 68701 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G(p1)||p0))))'
Support contains 4 out of 535 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 535/535 places, 505/505 transitions.
Reduce places removed 23 places and 23 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 212 transitions
Trivial Post-agglo rules discarded 212 transitions
Performed 212 trivial Post agglomeration. Transition count delta: 212
Iterating post reduction 0 with 212 rules applied. Total rules applied 212 place count 512 transition count 270
Reduce places removed 212 places and 0 transitions.
Iterating post reduction 1 with 212 rules applied. Total rules applied 424 place count 300 transition count 270
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 430 place count 294 transition count 264
Iterating global reduction 2 with 6 rules applied. Total rules applied 436 place count 294 transition count 264
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 2 rules applied. Total rules applied 438 place count 294 transition count 262
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 440 place count 292 transition count 262
Applied a total of 440 rules in 28 ms. Remains 292 /535 variables (removed 243) and now considering 262/505 (removed 243) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10693382654545849039.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11660922084480387376.kers'
[2026-05-26 00:23:57] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10693382654545849039.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11660922084480387376.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 262 rows 292 cols 558 entries
Finished phase 1 with 257 SingleSign rule and 5 generalized
[2026-05-26 00:23:57] [INFO ] Computed 30 invariants in 3 ms
Computed 30 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-11660922084480387376.kers
Total runtime 4 ms.
[2026-05-26 00:23:57] [INFO ] Implicit Places using invariants in 235 ms returned []
[2026-05-26 00:23:57] [INFO ] Invariant cache hit.
[2026-05-26 00:23:58] [INFO ] State equation strengthened by 7 read => feed constraints.
[2026-05-26 00:24:01] [INFO ] Implicit Places using invariants and state equation in 3076 ms returned []
Implicit Place search using SMT with State Equation took 3313 ms to find 0 implicit places.
[2026-05-26 00:24:01] [INFO ] Redundant transitions in 1 ms returned []
Running 219 sub problems to find dead transitions.
[2026-05-26 00:24:01] [INFO ] Invariant cache hit.
[2026-05-26 00:24:01] [INFO ] State equation strengthened by 7 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/249 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/249 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 2 (OVERLAPS) 4/253 variables, 5/30 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/253 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 4 (OVERLAPS) 223/476 variables, 253/283 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/476 variables, 7/290 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/476 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 7 (OVERLAPS) 0/476 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 219 unsolved
No progress, stopping.
After SMT solving in domain Real declared 476/554 variables, and 290 constraints, problems are : Problem set: 0 solved, 219 unsolved in 30014 ms.
Refiners :[Generalized P Invariants (flows): 30/30 constraints, State Equation: 253/292 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 219/219 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 219 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/249 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/249 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 2 (OVERLAPS) 4/253 variables, 5/30 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/253 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 4 (OVERLAPS) 223/476 variables, 253/283 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/476 variables, 7/290 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/476 variables, 219/509 constraints. Problems are: Problem set: 0 solved, 219 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 476/554 variables, and 509 constraints, problems are : Problem set: 0 solved, 219 unsolved in 30012 ms.
Refiners :[Generalized P Invariants (flows): 30/30 constraints, State Equation: 253/292 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 219/219 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60040ms problems are : Problem set: 0 solved, 219 unsolved
Search for dead transitions found 0 dead transitions in 60040ms
Starting structural reductions in SI_LTL mode, iteration 1 : 292/535 places, 262/505 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 63393 ms. Remains : 292/535 places, 262/505 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G(p1)||p0))))'
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : HirschbergSinclair-PT-25-LTLFireability-15
Product exploration explored 100000 steps with 348 reset in 203 ms.
Product exploration explored 100000 steps with 348 reset in 196 ms.
Computed a total of 292 stabilizing places and 262 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 292 transition count 262
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 10 factoid took 10 ms. Proved property starting from automaton with 2 states, 4 edges and 2 AP (stutter insensitive
Knowledge-based reduction took 175 ms.
FORMULA HirschbergSinclair-PT-25-LTLFireability-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HirschbergSinclair-PT-25-LTLFireability-15 finished in 64070 ms.
All properties solved by simple procedures.
Total runtime 790520 ms.
BK_STOP 1779755102176
--------------------
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.202604301425.jar
+ VERSION=202604301425
+ echo 'Running Version 202604301425'
+ /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="HirschbergSinclair-PT-25"
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-5973"
echo " Executing tool itstools"
echo " Input is HirschbergSinclair-PT-25, 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 r146-tall-177961074400764"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/HirschbergSinclair-PT-25.tgz
mv HirschbergSinclair-PT-25 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 ;