About the Execution of ITS-Tools for HirschbergSinclair-PT-40
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 12805.140 | 3600000.00 | 6228979.00 | 77840.20 | FTTTTT?FFFFFFFFF | 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-177961074400788.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-40, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r146-tall-177961074400788
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1008K
-rw-r--r-- 1 mcc users 9.8K Mar 7 17:02 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K Mar 7 17:02 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.8K Mar 7 17:01 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K Mar 7 17:01 CTLFireability.xml
-rw-r--r-- 1 mcc users 5.0K Mar 15 10:50 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Mar 15 10:50 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.5K Mar 15 10:51 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 15 10:51 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Mar 7 17:02 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 97K Mar 7 17:02 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K Mar 7 17:02 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 71K Mar 7 17:02 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K Mar 15 10:51 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.1K Mar 15 10:51 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 580K 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-40-LTLFireability-00
FORMULA_NAME HirschbergSinclair-PT-40-LTLFireability-01
FORMULA_NAME HirschbergSinclair-PT-40-LTLFireability-02
FORMULA_NAME HirschbergSinclair-PT-40-LTLFireability-03
FORMULA_NAME HirschbergSinclair-PT-40-LTLFireability-04
FORMULA_NAME HirschbergSinclair-PT-40-LTLFireability-05
FORMULA_NAME HirschbergSinclair-PT-40-LTLFireability-06
FORMULA_NAME HirschbergSinclair-PT-40-LTLFireability-07
FORMULA_NAME HirschbergSinclair-PT-40-LTLFireability-08
FORMULA_NAME HirschbergSinclair-PT-40-LTLFireability-09
FORMULA_NAME HirschbergSinclair-PT-40-LTLFireability-10
FORMULA_NAME HirschbergSinclair-PT-40-LTLFireability-11
FORMULA_NAME HirschbergSinclair-PT-40-LTLFireability-12
FORMULA_NAME HirschbergSinclair-PT-40-LTLFireability-13
FORMULA_NAME HirschbergSinclair-PT-40-LTLFireability-14
FORMULA_NAME HirschbergSinclair-PT-40-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1779759277134
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-40
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202604301425
[2026-05-26 01:34:38] [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 01:34:38] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-26 01:34:38] [INFO ] Load time of PNML (sax parser for PT used): 106 ms
[2026-05-26 01:34:38] [INFO ] Transformed 1068 places.
[2026-05-26 01:34:38] [INFO ] Transformed 982 transitions.
[2026-05-26 01:34:38] [INFO ] Parsed PT model containing 1068 places and 982 transitions and 2991 arcs in 203 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-40-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HirschbergSinclair-PT-40-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HirschbergSinclair-PT-40-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 48 out of 1068 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1068/1068 places, 982/982 transitions.
Reduce places removed 40 places and 0 transitions.
Iterating post reduction 0 with 40 rules applied. Total rules applied 40 place count 1028 transition count 982
Discarding 38 places :
Symmetric choice reduction at 1 with 38 rule applications. Total rules 78 place count 990 transition count 944
Iterating global reduction 1 with 38 rules applied. Total rules applied 116 place count 990 transition count 944
Discarding 36 places :
Symmetric choice reduction at 1 with 36 rule applications. Total rules 152 place count 954 transition count 908
Iterating global reduction 1 with 36 rules applied. Total rules applied 188 place count 954 transition count 908
Applied a total of 188 rules in 318 ms. Remains 954 /1068 variables (removed 114) and now considering 908/982 (removed 74) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17197982956704345545.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14199668343492825872.kers'
[2026-05-26 01:34:39] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17197982956704345545.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14199668343492825872.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 908 rows 954 cols 2728 entries
Finished phase 1 with 902 SingleSign rule and 6 generalized
[2026-05-26 01:34:39] [INFO ] Computed 46 invariants in 6 ms
Computed 46 P flows in 6 ms.
Exported basis to /tmp/petrispot-output-14199668343492825872.kers
Total runtime 8 ms.
[2026-05-26 01:34:39] [INFO ] Implicit Places using invariants in 631 ms returned []
[2026-05-26 01:34:39] [INFO ] Invariant cache hit.
[2026-05-26 01:34:48] [INFO ] Implicit Places using invariants and state equation in 8796 ms returned []
Implicit Place search using SMT with State Equation took 9461 ms to find 0 implicit places.
Running 868 sub problems to find dead transitions.
[2026-05-26 01:34:48] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/914 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 868 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 914/1862 variables, and 5 constraints, problems are : Problem set: 0 solved, 868 unsolved in 30031 ms.
Refiners :[Generalized P Invariants (flows): 5/46 constraints, State Equation: 0/954 constraints, PredecessorRefiner: 868/868 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 868 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/914 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 868 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/914 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 868 unsolved
At refinement iteration 2 (OVERLAPS) 40/954 variables, 41/46 constraints. Problems are: Problem set: 0 solved, 868 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 954/1862 variables, and 46 constraints, problems are : Problem set: 0 solved, 868 unsolved in 30022 ms.
Refiners :[Generalized P Invariants (flows): 46/46 constraints, State Equation: 0/954 constraints, PredecessorRefiner: 0/868 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60344ms problems are : Problem set: 0 solved, 868 unsolved
Search for dead transitions found 0 dead transitions in 60359ms
Starting structural reductions in LTL mode, iteration 1 : 954/1068 places, 908/982 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 70177 ms. Remains : 954/1068 places, 908/982 transitions.
Starting structural reductions in LTL mode, iteration 0 : 954/954 places, 908/908 transitions.
Applied a total of 0 rules in 24 ms. Remains 954 /954 variables (removed 0) and now considering 908/908 (removed 0) transitions.
[2026-05-26 01:35:48] [INFO ] Invariant cache hit.
[2026-05-26 01:35:49] [INFO ] Implicit Places using invariants in 285 ms returned []
[2026-05-26 01:35:49] [INFO ] Invariant cache hit.
[2026-05-26 01:35:57] [INFO ] Implicit Places using invariants and state equation in 8771 ms returned []
Implicit Place search using SMT with State Equation took 9059 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 9084 ms. Remains : 954/954 places, 908/908 transitions.
Support contains 48 out of 954 places after structural reductions.
[2026-05-26 01:35:58] [INFO ] Flatten gal took : 89 ms
[2026-05-26 01:35:58] [INFO ] Flatten gal took : 53 ms
[2026-05-26 01:35:58] [INFO ] Input system was already deterministic with 908 transitions.
Support contains 46 out of 954 places (down from 48) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 35 to 34
RANDOM walk for 3756 steps (0 resets) in 371 ms. (10 steps per ms) remains 0/34 properties
FORMULA HirschbergSinclair-PT-40-LTLFireability-15 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 954 stabilizing places and 908 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 954 transition count 908
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' '!(F((G(p1)||p0)))'
Support contains 2 out of 954 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 954/954 places, 908/908 transitions.
Reduce places removed 40 places and 40 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 406 transitions
Trivial Post-agglo rules discarded 406 transitions
Performed 406 trivial Post agglomeration. Transition count delta: 406
Iterating post reduction 0 with 406 rules applied. Total rules applied 406 place count 914 transition count 462
Reduce places removed 406 places and 0 transitions.
Iterating post reduction 1 with 406 rules applied. Total rules applied 812 place count 508 transition count 462
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 816 place count 504 transition count 458
Iterating global reduction 2 with 4 rules applied. Total rules applied 820 place count 504 transition count 458
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 822 place count 504 transition count 456
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 824 place count 502 transition count 456
Applied a total of 824 rules in 83 ms. Remains 502 /954 variables (removed 452) and now considering 456/908 (removed 452) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13388802917698934438.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1453451312283462347.kers'
[2026-05-26 01:35:59] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13388802917698934438.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1453451312283462347.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 456 rows 502 cols 928 entries
Finished phase 1 with 450 SingleSign rule and 6 generalized
[2026-05-26 01:35:59] [INFO ] Computed 46 invariants in 4 ms
Computed 46 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-1453451312283462347.kers
Total runtime 5 ms.
[2026-05-26 01:35:59] [INFO ] Implicit Places using invariants in 616 ms returned []
[2026-05-26 01:35:59] [INFO ] Invariant cache hit.
[2026-05-26 01:36:12] [INFO ] Implicit Places using invariants and state equation in 12660 ms returned []
Implicit Place search using SMT with State Equation took 13279 ms to find 0 implicit places.
[2026-05-26 01:36:12] [INFO ] Redundant transitions in 34 ms returned []
Running 377 sub problems to find dead transitions.
[2026-05-26 01:36:12] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/423 variables, 43/43 constraints. Problems are: Problem set: 0 solved, 377 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/423 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 377 unsolved
At refinement iteration 2 (OVERLAPS) 2/425 variables, 3/46 constraints. Problems are: Problem set: 0 solved, 377 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/425 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 377 unsolved
At refinement iteration 4 (OVERLAPS) 379/804 variables, 425/471 constraints. Problems are: Problem set: 0 solved, 377 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 804/958 variables, and 471 constraints, problems are : Problem set: 0 solved, 377 unsolved in 30018 ms.
Refiners :[Generalized P Invariants (flows): 46/46 constraints, State Equation: 425/502 constraints, PredecessorRefiner: 377/377 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 377 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/423 variables, 43/43 constraints. Problems are: Problem set: 0 solved, 377 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/423 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 377 unsolved
At refinement iteration 2 (OVERLAPS) 2/425 variables, 3/46 constraints. Problems are: Problem set: 0 solved, 377 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/425 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 377 unsolved
At refinement iteration 4 (OVERLAPS) 379/804 variables, 425/471 constraints. Problems are: Problem set: 0 solved, 377 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/804 variables, 377/848 constraints. Problems are: Problem set: 0 solved, 377 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 804/958 variables, and 848 constraints, problems are : Problem set: 0 solved, 377 unsolved in 30017 ms.
Refiners :[Generalized P Invariants (flows): 46/46 constraints, State Equation: 425/502 constraints, PredecessorRefiner: 377/377 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60066ms problems are : Problem set: 0 solved, 377 unsolved
Search for dead transitions found 0 dead transitions in 60069ms
Starting structural reductions in SI_LTL mode, iteration 1 : 502/954 places, 456/908 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 73481 ms. Remains : 502/954 places, 456/908 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(p1)||p0)))'
Stuttering acceptance computed with spot in 149 ms :[(AND (NOT p1) (NOT p0))]
Running random walk in product with property : HirschbergSinclair-PT-40-LTLFireability-01
Product exploration explored 100000 steps with 291 reset in 445 ms.
Product exploration explored 100000 steps with 291 reset in 380 ms.
Computed a total of 502 stabilizing places and 456 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 502 transition count 456
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 11 factoid took 48 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Reduction of identical properties reduced properties to check from 4 to 3
RANDOM walk for 40000 steps (76 resets) in 481 ms. (82 steps per ms) remains 1/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 232 ms. (171 steps per ms) remains 1/1 properties
[2026-05-26 01:37:13] [INFO ] Invariant cache hit.
Problem apf0 is UNSAT
After SMT solving in domain Real declared 2/958 variables, and 0 constraints, problems are : Problem set: 1 solved, 0 unsolved in 23 ms.
Refiners :[Generalized P Invariants (flows): 0/46 constraints, State Equation: 0/502 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 44ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge based reduction with 12 factoid took 86 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
[2026-05-26 01:37:14] [INFO ] Invariant cache hit.
[2026-05-26 01:37:14] [INFO ] [Real]Absence check using 0 positive and 46 generalized place invariants in 38 ms returned sat
[2026-05-26 01:37:29] [INFO ] [Real]Absence check using state equation in 14725 ms returned unknown
Could not prove EG (NOT p0)
Knowledge-based reduction took 15623 ms.
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Support contains 2 out of 502 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 502/502 places, 456/456 transitions.
Applied a total of 0 rules in 31 ms. Remains 502 /502 variables (removed 0) and now considering 456/456 (removed 0) transitions.
[2026-05-26 01:37:29] [INFO ] Invariant cache hit.
[2026-05-26 01:37:29] [INFO ] Implicit Places using invariants in 608 ms returned []
[2026-05-26 01:37:29] [INFO ] Invariant cache hit.
[2026-05-26 01:37:42] [INFO ] Implicit Places using invariants and state equation in 12708 ms returned []
Implicit Place search using SMT with State Equation took 13318 ms to find 0 implicit places.
[2026-05-26 01:37:42] [INFO ] Redundant transitions in 10 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 13365 ms. Remains : 502/502 places, 456/456 transitions.
Computed a total of 502 stabilizing places and 456 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 502 transition count 456
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 45 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 1459 steps (0 resets) in 15 ms. (91 steps per ms) remains 0/1 properties
Knowledge based reduction with 4 factoid took 54 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 39 ms :[(NOT p0)]
[2026-05-26 01:37:42] [INFO ] Invariant cache hit.
[2026-05-26 01:37:43] [INFO ] [Real]Absence check using 0 positive and 46 generalized place invariants in 34 ms returned sat
[2026-05-26 01:37:57] [INFO ] [Real]Absence check using state equation in 14741 ms returned unknown
Could not prove EG (NOT p0)
Knowledge-based reduction took 15277 ms.
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Product exploration explored 100000 steps with 291 reset in 292 ms.
Product exploration explored 100000 steps with 291 reset in 313 ms.
Built C files in :
/tmp/ltsmin12547023070877908688
[2026-05-26 01:37:59] [INFO ] Computing symmetric may disable matrix : 456 transitions.
[2026-05-26 01:37:59] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-26 01:37:59] [INFO ] Computing symmetric may enable matrix : 456 transitions.
[2026-05-26 01:37:59] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-26 01:37:59] [INFO ] Computing Do-Not-Accords matrix : 456 transitions.
[2026-05-26 01:37:59] [INFO ] Computation of Completed DNA matrix. took 11 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-26 01:37:59] [INFO ] Built C files in 88ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12547023070877908688
Running compilation step : cd /tmp/ltsmin12547023070877908688;'/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 1103 ms.
Running link step : cd /tmp/ltsmin12547023070877908688;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 48 ms.
Running LTSmin : cd /tmp/ltsmin12547023070877908688;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased12872763266409338734.hoa' '--buchi-type=spotba'
LTSmin run took 3546 ms.
FORMULA HirschbergSinclair-PT-40-LTLFireability-01 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property HirschbergSinclair-PT-40-LTLFireability-01 finished in 124966 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 p1)&&(p1||F(p2))) U (p3||X(X(!p1)))))'
Support contains 6 out of 954 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 954/954 places, 908/908 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 951 transition count 905
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 951 transition count 905
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 950 transition count 904
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 950 transition count 904
Applied a total of 8 rules in 94 ms. Remains 950 /954 variables (removed 4) and now considering 904/908 (removed 4) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9636254588625943138.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16751072841373831647.kers'
[2026-05-26 01:38:04] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9636254588625943138.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16751072841373831647.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 904 rows 950 cols 2717 entries
Finished phase 1 with 898 SingleSign rule and 6 generalized
[2026-05-26 01:38:04] [INFO ] Computed 46 invariants in 4 ms
Computed 46 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-16751072841373831647.kers
Total runtime 5 ms.
[2026-05-26 01:38:04] [INFO ] Implicit Places using invariants in 288 ms returned []
[2026-05-26 01:38:04] [INFO ] Invariant cache hit.
[2026-05-26 01:38:14] [INFO ] Implicit Places using invariants and state equation in 10379 ms returned []
Implicit Place search using SMT with State Equation took 10669 ms to find 0 implicit places.
Running 864 sub problems to find dead transitions.
[2026-05-26 01:38:14] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/910 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 864 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 910/1854 variables, and 5 constraints, problems are : Problem set: 0 solved, 864 unsolved in 30029 ms.
Refiners :[Generalized P Invariants (flows): 5/46 constraints, State Equation: 0/950 constraints, PredecessorRefiner: 864/864 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 864 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/910 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 864 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/910 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 864 unsolved
At refinement iteration 2 (OVERLAPS) 40/950 variables, 41/46 constraints. Problems are: Problem set: 0 solved, 864 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 950/1854 variables, and 46 constraints, problems are : Problem set: 0 solved, 864 unsolved in 30027 ms.
Refiners :[Generalized P Invariants (flows): 46/46 constraints, State Equation: 0/950 constraints, PredecessorRefiner: 0/864 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60200ms problems are : Problem set: 0 solved, 864 unsolved
Search for dead transitions found 0 dead transitions in 60203ms
Starting structural reductions in LTL mode, iteration 1 : 950/954 places, 904/908 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 70970 ms. Remains : 950/954 places, 904/908 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 p1)&&(p1||F(p2))) U (X(X(!p1))||p3)))'
Stuttering acceptance computed with spot in 413 ms :[(AND p1 (NOT p3)), p1, false, (AND p1 (NOT p2)), (AND p1 (NOT p3)), p1, true, (AND (NOT p2) p1), p1, (AND (NOT p2) p1), (AND (NOT p3) p1), (NOT p2)]
Running random walk in product with property : HirschbergSinclair-PT-40-LTLFireability-02
Product exploration explored 100000 steps with 33333 reset in 417 ms.
Product exploration explored 100000 steps with 33333 reset in 435 ms.
Computed a total of 950 stabilizing places and 904 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 950 transition count 904
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 18 factoid took 10 ms. Proved property starting from automaton with 12 states, 17 edges and 4 AP (stutter sensitive
Knowledge-based reduction took 250 ms.
FORMULA HirschbergSinclair-PT-40-LTLFireability-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HirschbergSinclair-PT-40-LTLFireability-02 finished in 72533 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(G((X(F(!p0)) U (G(p1)||X(X(F(p2))))))))'
Support contains 5 out of 954 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 954/954 places, 908/908 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 950 transition count 904
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 950 transition count 904
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 948 transition count 902
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 948 transition count 902
Applied a total of 12 rules in 87 ms. Remains 948 /954 variables (removed 6) and now considering 902/908 (removed 6) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2429900766824295449.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2419355417370333562.kers'
[2026-05-26 01:39:16] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2429900766824295449.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2419355417370333562.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 902 rows 948 cols 2712 entries
Finished phase 1 with 896 SingleSign rule and 6 generalized
[2026-05-26 01:39:16] [INFO ] Computed 46 invariants in 11 ms
Computed 46 P flows in 12 ms.
Exported basis to /tmp/petrispot-output-2419355417370333562.kers
Total runtime 13 ms.
[2026-05-26 01:39:16] [INFO ] Implicit Places using invariants in 332 ms returned []
[2026-05-26 01:39:16] [INFO ] Invariant cache hit.
[2026-05-26 01:39:26] [INFO ] Implicit Places using invariants and state equation in 9870 ms returned []
Implicit Place search using SMT with State Equation took 10204 ms to find 0 implicit places.
Running 862 sub problems to find dead transitions.
[2026-05-26 01:39:26] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/908 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 862 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 908/1850 variables, and 5 constraints, problems are : Problem set: 0 solved, 862 unsolved in 30020 ms.
Refiners :[Generalized P Invariants (flows): 5/46 constraints, State Equation: 0/948 constraints, PredecessorRefiner: 862/862 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 862 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/908 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 862 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/908 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 862 unsolved
At refinement iteration 2 (OVERLAPS) 40/948 variables, 41/46 constraints. Problems are: Problem set: 0 solved, 862 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 948/1850 variables, and 46 constraints, problems are : Problem set: 0 solved, 862 unsolved in 30023 ms.
Refiners :[Generalized P Invariants (flows): 46/46 constraints, State Equation: 0/948 constraints, PredecessorRefiner: 0/862 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60161ms problems are : Problem set: 0 solved, 862 unsolved
Search for dead transitions found 0 dead transitions in 60164ms
Starting structural reductions in LTL mode, iteration 1 : 948/954 places, 902/908 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 70461 ms. Remains : 948/954 places, 902/908 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(G((X(F(!p0)) U (G(p1)||X(X(F(p2))))))))'
Stuttering acceptance computed with spot in 310 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND p1 p0 (NOT p2)), (AND (NOT p1) (NOT p2)), (AND p0 (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : HirschbergSinclair-PT-40-LTLFireability-03
Product exploration explored 100000 steps with 1855 reset in 341 ms.
Product exploration explored 100000 steps with 2112 reset in 354 ms.
Computed a total of 948 stabilizing places and 902 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 948 transition count 902
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 6 factoid took 18 ms. Proved property starting from automaton with 6 states, 11 edges and 3 AP (stutter sensitive
Knowledge-based reduction took 228 ms.
FORMULA HirschbergSinclair-PT-40-LTLFireability-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HirschbergSinclair-PT-40-LTLFireability-03 finished in 71758 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(p1) U p2)&&X(p1)) U (G(((G(p1) U p2)&&X(p1)))||(p3&&(G(p1) U p2)&&X(p1)))))||p0)))'
Support contains 4 out of 954 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 954/954 places, 908/908 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 951 transition count 905
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 951 transition count 905
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 950 transition count 904
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 950 transition count 904
Applied a total of 8 rules in 98 ms. Remains 950 /954 variables (removed 4) and now considering 904/908 (removed 4) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8694494571979274162.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1772821960363465714.kers'
[2026-05-26 01:40:28] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8694494571979274162.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1772821960363465714.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 904 rows 950 cols 2717 entries
Finished phase 1 with 898 SingleSign rule and 6 generalized
[2026-05-26 01:40:28] [INFO ] Computed 46 invariants in 8 ms
Computed 46 P flows in 9 ms.
Exported basis to /tmp/petrispot-output-1772821960363465714.kers
Total runtime 11 ms.
[2026-05-26 01:40:28] [INFO ] Implicit Places using invariants in 300 ms returned []
[2026-05-26 01:40:28] [INFO ] Invariant cache hit.
[2026-05-26 01:40:39] [INFO ] Implicit Places using invariants and state equation in 11055 ms returned []
Implicit Place search using SMT with State Equation took 11357 ms to find 0 implicit places.
Running 864 sub problems to find dead transitions.
[2026-05-26 01:40:39] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/910 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 864 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 910/1854 variables, and 5 constraints, problems are : Problem set: 0 solved, 864 unsolved in 30019 ms.
Refiners :[Generalized P Invariants (flows): 5/46 constraints, State Equation: 0/950 constraints, PredecessorRefiner: 864/864 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 864 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/910 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 864 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/910 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 864 unsolved
At refinement iteration 2 (OVERLAPS) 40/950 variables, 41/46 constraints. Problems are: Problem set: 0 solved, 864 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 950/1854 variables, and 46 constraints, problems are : Problem set: 0 solved, 864 unsolved in 30023 ms.
Refiners :[Generalized P Invariants (flows): 46/46 constraints, State Equation: 0/950 constraints, PredecessorRefiner: 0/864 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60155ms problems are : Problem set: 0 solved, 864 unsolved
Search for dead transitions found 0 dead transitions in 60159ms
Starting structural reductions in LTL mode, iteration 1 : 950/954 places, 904/908 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 71621 ms. Remains : 950/954 places, 904/908 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(p1) U p2)&&X(p1)) U (G(((G(p1) U p2)&&X(p1)))||(p3&&(G(p1) U p2)&&X(p1)))))||p0)))'
Stuttering acceptance computed with spot in 261 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (NOT p1)), true, (NOT p1), (NOT p1), (NOT p2)]
Running random walk in product with property : HirschbergSinclair-PT-40-LTLFireability-04
Product exploration explored 100000 steps with 50000 reset in 386 ms.
Product exploration explored 100000 steps with 50000 reset in 404 ms.
Computed a total of 950 stabilizing places and 904 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 950 transition count 904
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 12 factoid took 51 ms. Proved property starting from automaton with 7 states, 14 edges and 4 AP (stutter sensitive
Knowledge-based reduction took 265 ms.
FORMULA HirschbergSinclair-PT-40-LTLFireability-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HirschbergSinclair-PT-40-LTLFireability-04 finished in 72992 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((!p0&&(F(!p1)||G(!p0))))))'
Support contains 2 out of 954 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 954/954 places, 908/908 transitions.
Reduce places removed 38 places and 38 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 386 transitions
Trivial Post-agglo rules discarded 386 transitions
Performed 386 trivial Post agglomeration. Transition count delta: 386
Iterating post reduction 0 with 386 rules applied. Total rules applied 386 place count 916 transition count 484
Reduce places removed 386 places and 0 transitions.
Iterating post reduction 1 with 386 rules applied. Total rules applied 772 place count 530 transition count 484
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 776 place count 526 transition count 480
Iterating global reduction 2 with 4 rules applied. Total rules applied 780 place count 526 transition count 480
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 782 place count 526 transition count 478
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 784 place count 524 transition count 478
Applied a total of 784 rules in 60 ms. Remains 524 /954 variables (removed 430) and now considering 478/908 (removed 430) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7104600691157973627.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11577225036156082271.kers'
[2026-05-26 01:41:41] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7104600691157973627.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11577225036156082271.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 478 rows 524 cols 1016 entries
Finished phase 1 with 472 SingleSign rule and 6 generalized
[2026-05-26 01:41:41] [INFO ] Computed 46 invariants in 4 ms
Computed 46 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-11577225036156082271.kers
Total runtime 5 ms.
[2026-05-26 01:41:42] [INFO ] Implicit Places using invariants in 656 ms returned []
[2026-05-26 01:41:42] [INFO ] Invariant cache hit.
[2026-05-26 01:41:54] [INFO ] Implicit Places using invariants and state equation in 12442 ms returned []
Implicit Place search using SMT with State Equation took 13103 ms to find 0 implicit places.
[2026-05-26 01:41:54] [INFO ] Redundant transitions in 7 ms returned []
Running 405 sub problems to find dead transitions.
[2026-05-26 01:41:54] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/451 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 405 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/451 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 405 unsolved
At refinement iteration 2 (OVERLAPS) 4/455 variables, 5/46 constraints. Problems are: Problem set: 0 solved, 405 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/455 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 405 unsolved
At refinement iteration 4 (OVERLAPS) 409/864 variables, 455/501 constraints. Problems are: Problem set: 0 solved, 405 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 864/1002 variables, and 501 constraints, problems are : Problem set: 0 solved, 405 unsolved in 30019 ms.
Refiners :[Generalized P Invariants (flows): 46/46 constraints, State Equation: 455/524 constraints, PredecessorRefiner: 405/405 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 405 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/451 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 405 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/451 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 405 unsolved
At refinement iteration 2 (OVERLAPS) 4/455 variables, 5/46 constraints. Problems are: Problem set: 0 solved, 405 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/455 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 405 unsolved
At refinement iteration 4 (OVERLAPS) 409/864 variables, 455/501 constraints. Problems are: Problem set: 0 solved, 405 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/864 variables, 405/906 constraints. Problems are: Problem set: 0 solved, 405 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 864/1002 variables, and 906 constraints, problems are : Problem set: 0 solved, 405 unsolved in 30015 ms.
Refiners :[Generalized P Invariants (flows): 46/46 constraints, State Equation: 455/524 constraints, PredecessorRefiner: 405/405 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60060ms problems are : Problem set: 0 solved, 405 unsolved
Search for dead transitions found 0 dead transitions in 60061ms
Starting structural reductions in SI_LTL mode, iteration 1 : 524/954 places, 478/908 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 73242 ms. Remains : 524/954 places, 478/908 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((p0&&(F(p1)||G(p0))))))'
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Running random walk in product with property : HirschbergSinclair-PT-40-LTLFireability-05
Product exploration explored 100000 steps with 192 reset in 271 ms.
Product exploration explored 100000 steps with 192 reset in 267 ms.
Computed a total of 524 stabilizing places and 478 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 524 transition count 478
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 4 factoid took 16 ms. Proved property starting from automaton with 1 states, 2 edges and 1 AP (stutter insensitive
Knowledge-based reduction took 136 ms.
FORMULA HirschbergSinclair-PT-40-LTLFireability-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HirschbergSinclair-PT-40-LTLFireability-05 finished in 73992 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(((!p1 U (p2||G(!p1)))&&p0))))'
Support contains 5 out of 954 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 954/954 places, 908/908 transitions.
Reduce places removed 38 places and 38 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 386 transitions
Trivial Post-agglo rules discarded 386 transitions
Performed 386 trivial Post agglomeration. Transition count delta: 386
Iterating post reduction 0 with 386 rules applied. Total rules applied 386 place count 916 transition count 484
Reduce places removed 386 places and 0 transitions.
Iterating post reduction 1 with 386 rules applied. Total rules applied 772 place count 530 transition count 484
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 776 place count 526 transition count 480
Iterating global reduction 2 with 4 rules applied. Total rules applied 780 place count 526 transition count 480
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 782 place count 526 transition count 478
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 784 place count 524 transition count 478
Applied a total of 784 rules in 48 ms. Remains 524 /954 variables (removed 430) and now considering 478/908 (removed 430) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17355334291157316722.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6414211485127969186.kers'
[2026-05-26 01:42:55] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17355334291157316722.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6414211485127969186.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 478 rows 524 cols 1016 entries
Finished phase 1 with 472 SingleSign rule and 6 generalized
[2026-05-26 01:42:55] [INFO ] Computed 46 invariants in 6 ms
Computed 46 P flows in 7 ms.
Exported basis to /tmp/petrispot-output-6414211485127969186.kers
Total runtime 8 ms.
[2026-05-26 01:42:55] [INFO ] Implicit Places using invariants in 615 ms returned []
[2026-05-26 01:42:55] [INFO ] Invariant cache hit.
[2026-05-26 01:43:08] [INFO ] Implicit Places using invariants and state equation in 12341 ms returned []
Implicit Place search using SMT with State Equation took 12959 ms to find 0 implicit places.
[2026-05-26 01:43:08] [INFO ] Redundant transitions in 3 ms returned []
Skipped dead transition search.
Starting structural reductions in SI_LTL mode, iteration 1 : 524/954 places, 478/908 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 13023 ms. Remains : 524/954 places, 478/908 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(((!p1 U (p2||G(!p1)))&&p0))))'
Stuttering acceptance computed with spot in 130 ms :[(OR (NOT p0) (AND p1 (NOT p2))), (OR (NOT p0) (AND p1 (NOT p2))), (AND p1 (NOT p2))]
Running random walk in product with property : HirschbergSinclair-PT-40-LTLFireability-06
Product exploration explored 100000 steps with 478 reset in 374 ms.
Product exploration explored 100000 steps with 477 reset in 391 ms.
Computed a total of 524 stabilizing places and 478 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 524 transition count 478
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 65 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
RANDOM walk for 1172 steps (0 resets) in 37 ms. (30 steps per ms) remains 0/7 properties
Knowledge based reduction with 16 factoid took 128 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 137 ms :[(OR (NOT p0) (AND p1 (NOT p2))), (OR (NOT p0) (AND p1 (NOT p2))), (AND p1 (NOT p2))]
[2026-05-26 01:43:09] [INFO ] Invariant cache hit.
[2026-05-26 01:43:10] [INFO ] [Real]Absence check using 0 positive and 46 generalized place invariants in 58 ms returned sat
[2026-05-26 01:43:24] [INFO ] [Real]Absence check using state equation in 14707 ms returned unknown
Could not prove EG (NOT p0)
Knowledge-based reduction took 15516 ms.
Stuttering acceptance computed with spot in 140 ms :[(OR (NOT p0) (AND p1 (NOT p2))), (OR (NOT p0) (AND p1 (NOT p2))), (AND p1 (NOT p2))]
Support contains 5 out of 524 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 524/524 places, 478/478 transitions.
Applied a total of 0 rules in 27 ms. Remains 524 /524 variables (removed 0) and now considering 478/478 (removed 0) transitions.
[2026-05-26 01:43:24] [INFO ] Invariant cache hit.
[2026-05-26 01:43:25] [INFO ] Implicit Places using invariants in 643 ms returned []
[2026-05-26 01:43:25] [INFO ] Invariant cache hit.
[2026-05-26 01:43:37] [INFO ] Implicit Places using invariants and state equation in 12312 ms returned []
Implicit Place search using SMT with State Equation took 12957 ms to find 0 implicit places.
[2026-05-26 01:43:37] [INFO ] Redundant transitions in 4 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 12999 ms. Remains : 524/524 places, 478/478 transitions.
Computed a total of 524 stabilizing places and 478 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 524 transition count 478
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 60 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
RANDOM walk for 1180 steps (0 resets) in 34 ms. (33 steps per ms) remains 0/7 properties
Knowledge based reduction with 16 factoid took 142 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 129 ms :[(OR (NOT p0) (AND p1 (NOT p2))), (OR (NOT p0) (AND p1 (NOT p2))), (AND p1 (NOT p2))]
[2026-05-26 01:43:38] [INFO ] Invariant cache hit.
[2026-05-26 01:43:38] [INFO ] [Real]Absence check using 0 positive and 46 generalized place invariants in 59 ms returned sat
[2026-05-26 01:43:53] [INFO ] [Real]Absence check using state equation in 14691 ms returned unknown
Could not prove EG (NOT p0)
Knowledge-based reduction took 15523 ms.
Stuttering acceptance computed with spot in 121 ms :[(OR (NOT p0) (AND p1 (NOT p2))), (OR (NOT p0) (AND p1 (NOT p2))), (AND p1 (NOT p2))]
Stuttering acceptance computed with spot in 131 ms :[(OR (NOT p0) (AND p1 (NOT p2))), (OR (NOT p0) (AND p1 (NOT p2))), (AND p1 (NOT p2))]
Product exploration explored 100000 steps with 478 reset in 365 ms.
Product exploration explored 100000 steps with 477 reset in 400 ms.
Built C files in :
/tmp/ltsmin7496618969823201139
[2026-05-26 01:43:54] [INFO ] Computing symmetric may disable matrix : 478 transitions.
[2026-05-26 01:43:54] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-26 01:43:54] [INFO ] Computing symmetric may enable matrix : 478 transitions.
[2026-05-26 01:43:54] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-26 01:43:54] [INFO ] Computing Do-Not-Accords matrix : 478 transitions.
[2026-05-26 01:43:54] [INFO ] Computation of Completed DNA matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-26 01:43:54] [INFO ] Built C files in 58ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7496618969823201139
Running compilation step : cd /tmp/ltsmin7496618969823201139;'/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 1068 ms.
Running link step : cd /tmp/ltsmin7496618969823201139;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 45 ms.
Running LTSmin : cd /tmp/ltsmin7496618969823201139;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased4393305432177645782.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 5 out of 524 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 524/524 places, 478/478 transitions.
Applied a total of 0 rules in 24 ms. Remains 524 /524 variables (removed 0) and now considering 478/478 (removed 0) transitions.
[2026-05-26 01:44:09] [INFO ] Invariant cache hit.
[2026-05-26 01:44:10] [INFO ] Implicit Places using invariants in 597 ms returned []
[2026-05-26 01:44:10] [INFO ] Invariant cache hit.
[2026-05-26 01:44:22] [INFO ] Implicit Places using invariants and state equation in 12422 ms returned []
Implicit Place search using SMT with State Equation took 13020 ms to find 0 implicit places.
[2026-05-26 01:44:22] [INFO ] Redundant transitions in 2 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 13053 ms. Remains : 524/524 places, 478/478 transitions.
Built C files in :
/tmp/ltsmin1638337069333483791
[2026-05-26 01:44:22] [INFO ] Computing symmetric may disable matrix : 478 transitions.
[2026-05-26 01:44:22] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-26 01:44:22] [INFO ] Computing symmetric may enable matrix : 478 transitions.
[2026-05-26 01:44:22] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-26 01:44:22] [INFO ] Computing Do-Not-Accords matrix : 478 transitions.
[2026-05-26 01:44:22] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-26 01:44:22] [INFO ] Built C files in 48ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1638337069333483791
Running compilation step : cd /tmp/ltsmin1638337069333483791;'/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 1069 ms.
Running link step : cd /tmp/ltsmin1638337069333483791;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin1638337069333483791;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased9701371769021361972.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2026-05-26 01:44:37] [INFO ] Flatten gal took : 16 ms
[2026-05-26 01:44:37] [INFO ] Flatten gal took : 16 ms
[2026-05-26 01:44:37] [INFO ] Time to serialize gal into /tmp/LTL10754129465989755139.gal : 5 ms
[2026-05-26 01:44:37] [INFO ] Time to serialize properties into /tmp/LTL7435721682669084901.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10754129465989755139.gal' '-t' 'CGAL' '-hoa' '/tmp/aut4429106743198017958.hoa' '-atoms' '/tmp/LTL7435721682669084901.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL7435721682669084901.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut4429106743198017958.hoa
Reverse transition relation is NOT exact ! Due to transitions t8, t9, t42.t43, t46.t47, t50.t51, t54.t55, t59.t60, t63.t64, t67.t68, t72, t73.t74, t76, t78...592
Computing Next relation with stutter on 8.73115e+28 deadlock states
Detected timeout of ITS tools.
[2026-05-26 01:44:52] [INFO ] Flatten gal took : 35 ms
[2026-05-26 01:44:52] [INFO ] Flatten gal took : 18 ms
[2026-05-26 01:44:52] [INFO ] Time to serialize gal into /tmp/LTL5277907516948397621.gal : 3 ms
[2026-05-26 01:44:52] [INFO ] Time to serialize properties into /tmp/LTL9953430494730412003.ltl : 5 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5277907516948397621.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9953430494730412003.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((G(F(("((newmsg9>=1)&&(election_40_4_9_to_right_8>=1))")&&((!("(((newmsg10>=1)&&(election_40_5_10_to_right_9>=1))||(rcv_left_electio...428
Formula 0 simplified : FG(!"((newmsg9>=1)&&(election_40_4_9_to_right_8>=1))" | ("(((newmsg10>=1)&&(election_40_5_10_to_right_9>=1))||(rcv_left_election_40_...319
Reverse transition relation is NOT exact ! Due to transitions t8, t9, t42.t43, t46.t47, t50.t51, t54.t55, t59.t60, t63.t64, t67.t68, t72, t73.t74, t76, t78...592
Computing Next relation with stutter on 8.73115e+28 deadlock states
Detected timeout of ITS tools.
[2026-05-26 01:45:07] [INFO ] Flatten gal took : 14 ms
[2026-05-26 01:45:07] [INFO ] Applying decomposition
[2026-05-26 01:45:07] [INFO ] Flatten gal took : 13 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph17484705429234027117.txt' '-o' '/tmp/graph17484705429234027117.bin' '-w' '/tmp/graph17484705429234027117.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph17484705429234027117.bin' '-l' '-1' '-v' '-w' '/tmp/graph17484705429234027117.weights' '-q' '0' '-e' '0.001'
[2026-05-26 01:45:08] [INFO ] Decomposing Gal with order
[2026-05-26 01:45:08] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-26 01:45:08] [INFO ] Removed a total of 315 redundant transitions.
[2026-05-26 01:45:08] [INFO ] Flatten gal took : 73 ms
[2026-05-26 01:45:08] [INFO ] Fuse similar labels procedure discarded/fused a total of 33 labels/synchronizations in 16 ms.
[2026-05-26 01:45:08] [INFO ] Time to serialize gal into /tmp/LTL3125840943870060712.gal : 8 ms
[2026-05-26 01:45:08] [INFO ] Time to serialize properties into /tmp/LTL11184827552221020703.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3125840943870060712.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11184827552221020703.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((G(F(("((i0.u0.newmsg9>=1)&&(i0.u88.election_40_4_9_to_right_8>=1))")&&((!("(((i0.u1.newmsg10>=1)&&(i0.u1.election_40_5_10_to_right_...508
Formula 0 simplified : FG(!"((i0.u0.newmsg9>=1)&&(i0.u88.election_40_4_9_to_right_8>=1))" | ("(((i0.u1.newmsg10>=1)&&(i0.u1.election_40_5_10_to_right_9>=1)...381
Reverse transition relation is NOT exact ! Due to transitions t50_t51, t79_t80, t132_t133, t156_t157, t400_t401, t675_t676, t786_t787, t860_t861, i0.t82, i...745
Computing Next relation with stutter on 8.73115e+28 deadlock states
Detected timeout of ITS tools.
Treatment of property HirschbergSinclair-PT-40-LTLFireability-06 finished in 148004 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(X(G((p0||G(p1))))))))'
Support contains 2 out of 954 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 954/954 places, 908/908 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 950 transition count 904
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 950 transition count 904
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 948 transition count 902
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 948 transition count 902
Applied a total of 12 rules in 92 ms. Remains 948 /954 variables (removed 6) and now considering 902/908 (removed 6) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14542993820444570487.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10374828784802736955.kers'
[2026-05-26 01:45:23] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14542993820444570487.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10374828784802736955.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 902 rows 948 cols 2712 entries
Finished phase 1 with 896 SingleSign rule and 6 generalized
[2026-05-26 01:45:23] [INFO ] Computed 46 invariants in 8 ms
Computed 46 P flows in 9 ms.
Exported basis to /tmp/petrispot-output-10374828784802736955.kers
Total runtime 10 ms.
[2026-05-26 01:45:23] [INFO ] Implicit Places using invariants in 337 ms returned []
[2026-05-26 01:45:23] [INFO ] Invariant cache hit.
[2026-05-26 01:45:34] [INFO ] Implicit Places using invariants and state equation in 10382 ms returned []
Implicit Place search using SMT with State Equation took 10723 ms to find 0 implicit places.
Running 862 sub problems to find dead transitions.
[2026-05-26 01:45:34] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/908 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 862 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 908/1850 variables, and 5 constraints, problems are : Problem set: 0 solved, 862 unsolved in 30019 ms.
Refiners :[Generalized P Invariants (flows): 5/46 constraints, State Equation: 0/948 constraints, PredecessorRefiner: 862/862 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 862 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/908 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 862 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/908 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 862 unsolved
At refinement iteration 2 (OVERLAPS) 40/948 variables, 41/46 constraints. Problems are: Problem set: 0 solved, 862 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 948/1850 variables, and 46 constraints, problems are : Problem set: 0 solved, 862 unsolved in 30023 ms.
Refiners :[Generalized P Invariants (flows): 46/46 constraints, State Equation: 0/948 constraints, PredecessorRefiner: 0/862 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60145ms problems are : Problem set: 0 solved, 862 unsolved
Search for dead transitions found 0 dead transitions in 60147ms
Starting structural reductions in LTL mode, iteration 1 : 948/954 places, 902/908 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 70966 ms. Remains : 948/954 places, 902/908 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(X(G((p0||G(p1))))))))'
Stuttering acceptance computed with spot in 212 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : HirschbergSinclair-PT-40-LTLFireability-07
Entered a terminal (fully accepting) state of product in 711 steps with 0 reset in 4 ms.
FORMULA HirschbergSinclair-PT-40-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-40-LTLFireability-07 finished in 71230 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(p0)))'
Support contains 2 out of 954 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 954/954 places, 908/908 transitions.
Reduce places removed 39 places and 39 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 398 transitions
Trivial Post-agglo rules discarded 398 transitions
Performed 398 trivial Post agglomeration. Transition count delta: 398
Iterating post reduction 0 with 398 rules applied. Total rules applied 398 place count 915 transition count 471
Reduce places removed 398 places and 0 transitions.
Iterating post reduction 1 with 398 rules applied. Total rules applied 796 place count 517 transition count 471
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 799 place count 514 transition count 468
Iterating global reduction 2 with 3 rules applied. Total rules applied 802 place count 514 transition count 468
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 2 with 1 rules applied. Total rules applied 803 place count 514 transition count 467
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 804 place count 513 transition count 467
Applied a total of 804 rules in 38 ms. Remains 513 /954 variables (removed 441) and now considering 467/908 (removed 441) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1959789449979104305.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12805433483771602700.kers'
[2026-05-26 01:46:34] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1959789449979104305.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12805433483771602700.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 467 rows 513 cols 971 entries
Finished phase 1 with 461 SingleSign rule and 6 generalized
[2026-05-26 01:46:34] [INFO ] Computed 46 invariants in 1 ms
Computed 46 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-12805433483771602700.kers
Total runtime 3 ms.
[2026-05-26 01:46:35] [INFO ] Implicit Places using invariants in 601 ms returned []
[2026-05-26 01:46:35] [INFO ] Invariant cache hit.
[2026-05-26 01:46:47] [INFO ] Implicit Places using invariants and state equation in 12504 ms returned []
Implicit Place search using SMT with State Equation took 13107 ms to find 0 implicit places.
[2026-05-26 01:46:47] [INFO ] Redundant transitions in 2 ms returned []
Running 391 sub problems to find dead transitions.
[2026-05-26 01:46:47] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/437 variables, 42/42 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/437 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 2 (OVERLAPS) 3/440 variables, 4/46 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/440 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 4 (OVERLAPS) 394/834 variables, 440/486 constraints. Problems are: Problem set: 0 solved, 391 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 834/980 variables, and 486 constraints, problems are : Problem set: 0 solved, 391 unsolved in 30012 ms.
Refiners :[Generalized P Invariants (flows): 46/46 constraints, State Equation: 440/513 constraints, PredecessorRefiner: 391/391 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 391 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/437 variables, 42/42 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/437 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 2 (OVERLAPS) 3/440 variables, 4/46 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/440 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 4 (OVERLAPS) 394/834 variables, 440/486 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/834 variables, 391/877 constraints. Problems are: Problem set: 0 solved, 391 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 834/980 variables, and 877 constraints, problems are : Problem set: 0 solved, 391 unsolved in 30018 ms.
Refiners :[Generalized P Invariants (flows): 46/46 constraints, State Equation: 440/513 constraints, PredecessorRefiner: 391/391 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60053ms problems are : Problem set: 0 solved, 391 unsolved
Search for dead transitions found 0 dead transitions in 60054ms
Starting structural reductions in SI_LTL mode, iteration 1 : 513/954 places, 467/908 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 73208 ms. Remains : 513/954 places, 467/908 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 69 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : HirschbergSinclair-PT-40-LTLFireability-09
Product exploration explored 100000 steps with 962 reset in 530 ms.
Product exploration explored 100000 steps with 964 reset in 566 ms.
Computed a total of 513 stabilizing places and 467 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 513 transition count 467
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 20 ms. Proved property starting from automaton with 2 states, 3 edges and 1 AP (stutter insensitive
Knowledge-based reduction took 162 ms.
FORMULA HirschbergSinclair-PT-40-LTLFireability-09 FALSE TECHNIQUES KNOWLEDGE
Treatment of property HirschbergSinclair-PT-40-LTLFireability-09 finished in 74567 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(!(X(p0) U (p1 U p2))) U (p3&&(G(p1)||p0))))'
Support contains 5 out of 954 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 954/954 places, 908/908 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 950 transition count 904
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 950 transition count 904
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 948 transition count 902
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 948 transition count 902
Applied a total of 12 rules in 91 ms. Remains 948 /954 variables (removed 6) and now considering 902/908 (removed 6) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17865945542984518606.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1512383988607874365.kers'
[2026-05-26 01:47:49] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17865945542984518606.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1512383988607874365.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 902 rows 948 cols 2712 entries
Finished phase 1 with 896 SingleSign rule and 6 generalized
[2026-05-26 01:47:49] [INFO ] Computed 46 invariants in 5 ms
Computed 46 P flows in 6 ms.
Exported basis to /tmp/petrispot-output-1512383988607874365.kers
Total runtime 8 ms.
[2026-05-26 01:47:49] [INFO ] Implicit Places using invariants in 295 ms returned []
[2026-05-26 01:47:49] [INFO ] Invariant cache hit.
[2026-05-26 01:47:59] [INFO ] Implicit Places using invariants and state equation in 10165 ms returned []
Implicit Place search using SMT with State Equation took 10464 ms to find 0 implicit places.
Running 862 sub problems to find dead transitions.
[2026-05-26 01:47:59] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/908 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 862 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 908/1850 variables, and 5 constraints, problems are : Problem set: 0 solved, 862 unsolved in 30021 ms.
Refiners :[Generalized P Invariants (flows): 5/46 constraints, State Equation: 0/948 constraints, PredecessorRefiner: 862/862 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 862 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/908 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 862 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/908 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 862 unsolved
At refinement iteration 2 (OVERLAPS) 40/948 variables, 41/46 constraints. Problems are: Problem set: 0 solved, 862 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 948/1850 variables, and 46 constraints, problems are : Problem set: 0 solved, 862 unsolved in 30024 ms.
Refiners :[Generalized P Invariants (flows): 46/46 constraints, State Equation: 0/948 constraints, PredecessorRefiner: 0/862 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60147ms problems are : Problem set: 0 solved, 862 unsolved
Search for dead transitions found 0 dead transitions in 60148ms
Starting structural reductions in LTL mode, iteration 1 : 948/954 places, 902/908 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 70721 ms. Remains : 948/954 places, 902/908 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(!(X(p0) U (p1 U p2))) U (p3&&(G(p1)||p0))))'
Stuttering acceptance computed with spot in 311 ms :[(OR (NOT p3) (AND (NOT p0) (NOT p1))), p2, (AND p0 p2), p2, false, (AND (NOT p1) p2), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p1))), (AND (NOT p1) p2)]
Running random walk in product with property : HirschbergSinclair-PT-40-LTLFireability-10
Product exploration explored 100000 steps with 33232 reset in 480 ms.
Product exploration explored 100000 steps with 33365 reset in 484 ms.
Computed a total of 948 stabilizing places and 902 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 948 transition count 902
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 53 factoid took 179 ms. Reduced automaton from 8 states, 33 edges and 4 AP (stutter sensitive) to 2 states, 4 edges and 3 AP (stutter insensitive).
RANDOM walk for 40000 steps (40 resets) in 218 ms. (182 steps per ms) remains 2/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 314 ms. (126 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 120 ms. (330 steps per ms) remains 2/2 properties
[2026-05-26 01:49:01] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 607/611 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/611 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 260/871 variables, 41/46 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/871 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 902/1773 variables, 871/917 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1773 variables, 0/917 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 77/1850 variables, 77/994 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1850 variables, 0/994 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 0/1850 variables, 0/994 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1850/1850 variables, and 994 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1421 ms.
Refiners :[Generalized P Invariants (flows): 46/46 constraints, State Equation: 948/948 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 607/611 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/611 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 260/871 variables, 41/46 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/871 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 902/1773 variables, 871/917 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1773 variables, 0/917 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 77/1850 variables, 77/994 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1850 variables, 2/996 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1850 variables, 0/996 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/1850 variables, 0/996 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1850/1850 variables, and 996 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1694 ms.
Refiners :[Generalized P Invariants (flows): 46/46 constraints, State Equation: 948/948 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3122ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 1422 ms.
Support contains 4 out of 948 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 948/948 places, 902/902 transitions.
Graph (complete) has 1815 edges and 948 vertex of which 911 are kept as prefixes of interest. Removing 37 places using SCC suffix rule.1 ms
Discarding 37 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 37 transitions
Reduce isomorphic transitions removed 37 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 394 transitions
Trivial Post-agglo rules discarded 394 transitions
Performed 394 trivial Post agglomeration. Transition count delta: 394
Iterating post reduction 0 with 431 rules applied. Total rules applied 432 place count 911 transition count 471
Reduce places removed 394 places and 0 transitions.
Graph (complete) has 915 edges and 517 vertex of which 443 are kept as prefixes of interest. Removing 74 places using SCC suffix rule.1 ms
Discarding 74 places :
Also discarding 0 output transitions
Iterating post reduction 1 with 395 rules applied. Total rules applied 827 place count 443 transition count 471
Drop transitions (Empty/Sink Transition effects.) removed 74 transitions
Reduce isomorphic transitions removed 74 transitions.
Iterating post reduction 2 with 74 rules applied. Total rules applied 901 place count 443 transition count 397
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 902 place count 442 transition count 396
Iterating global reduction 3 with 1 rules applied. Total rules applied 903 place count 442 transition count 396
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 904 place count 441 transition count 395
Iterating global reduction 3 with 1 rules applied. Total rules applied 905 place count 441 transition count 395
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 3 with 3 rules applied. Total rules applied 908 place count 441 transition count 392
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 911 place count 438 transition count 392
Reduce places removed 38 places and 38 transitions.
Iterating global reduction 4 with 38 rules applied. Total rules applied 949 place count 400 transition count 354
Reduce places removed 35 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 249 transitions
Trivial Post-agglo rules discarded 249 transitions
Performed 249 trivial Post agglomeration. Transition count delta: 249
Iterating post reduction 4 with 284 rules applied. Total rules applied 1233 place count 365 transition count 105
Reduce places removed 249 places and 0 transitions.
Iterating post reduction 5 with 249 rules applied. Total rules applied 1482 place count 116 transition count 105
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 32 Pre rules applied. Total rules applied 1482 place count 116 transition count 73
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 6 with 64 rules applied. Total rules applied 1546 place count 84 transition count 73
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 6 with 1 rules applied. Total rules applied 1547 place count 83 transition count 73
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 1547 place count 83 transition count 72
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 1549 place count 82 transition count 72
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 7 with 6 rules applied. Total rules applied 1555 place count 79 transition count 69
Applied a total of 1555 rules in 72 ms. Remains 79 /948 variables (removed 869) and now considering 69/902 (removed 833) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 72 ms. Remains : 79/948 places, 69/902 transitions.
RANDOM walk for 40000 steps (550 resets) in 243 ms. (163 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (181 resets) in 107 ms. (370 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40003 steps (233 resets) in 53 ms. (740 steps per ms) remains 1/1 properties
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12805881524151041595.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14950816491781416669.kers'
[2026-05-26 01:49:06] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12805881524151041595.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14950816491781416669.kers]
Culling duplicate invariants (modulo rational): removing 3 columns.
Culled 3 columns in 0 ms.
// Phase 1: matrix 69 rows 76 cols 170 entries
Finished phase 1 with 62 SingleSign rule and 7 generalized
[2026-05-26 01:49:06] [INFO ] Computed 10 invariants in 0 ms
Computed 10 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-14950816491781416669.kers
Total runtime 1 ms.
[2026-05-26 01:49:06] [INFO ] State equation strengthened by 6 read => feed constraints.
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) 2/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 65/71 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/71 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 7/78 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/78 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 69/147 variables, 78/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf6 is UNSAT
After SMT solving in domain Real declared 147/148 variables, and 94 constraints, problems are : Problem set: 1 solved, 0 unsolved in 52 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 78/79 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 57ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge based reduction with 54 factoid took 183 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter insensitive) to 1 states, 1 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 41 ms :[(OR (NOT p3) (NOT p0))]
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11008244807666868962.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1045657020632575523.kers'
[2026-05-26 01:49:06] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11008244807666868962.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1045657020632575523.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 902 rows 948 cols 2712 entries
Finished phase 1 with 896 SingleSign rule and 6 generalized
[2026-05-26 01:49:06] [INFO ] Computed 46 invariants in 7 ms
Computed 46 P flows in 7 ms.
Exported basis to /tmp/petrispot-output-1045657020632575523.kers
Total runtime 9 ms.
[2026-05-26 01:49:07] [INFO ] [Real]Absence check using 0 positive and 46 generalized place invariants in 38 ms returned sat
[2026-05-26 01:49:21] [INFO ] [Real]Absence check using state equation in 14541 ms returned unknown
Could not prove EG (NOT p0)
Knowledge-based reduction took 20753 ms.
Stuttering acceptance computed with spot in 44 ms :[(OR (NOT p3) (NOT p0))]
Support contains 2 out of 948 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 948/948 places, 902/902 transitions.
Reduce places removed 38 places and 38 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 393 transitions
Trivial Post-agglo rules discarded 393 transitions
Performed 393 trivial Post agglomeration. Transition count delta: 393
Iterating post reduction 0 with 393 rules applied. Total rules applied 393 place count 910 transition count 471
Reduce places removed 393 places and 0 transitions.
Iterating post reduction 1 with 393 rules applied. Total rules applied 786 place count 517 transition count 471
Applied a total of 786 rules in 35 ms. Remains 517 /948 variables (removed 431) and now considering 471/902 (removed 431) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14669039003927286530.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12993400398274222670.kers'
[2026-05-26 01:49:21] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14669039003927286530.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12993400398274222670.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 471 rows 517 cols 988 entries
Finished phase 1 with 465 SingleSign rule and 6 generalized
[2026-05-26 01:49:21] [INFO ] Computed 46 invariants in 2 ms
Computed 46 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-12993400398274222670.kers
Total runtime 3 ms.
[2026-05-26 01:49:22] [INFO ] Implicit Places using invariants in 692 ms returned []
[2026-05-26 01:49:22] [INFO ] Invariant cache hit.
[2026-05-26 01:49:22] [INFO ] State equation strengthened by 8 read => feed constraints.
[2026-05-26 01:49:42] [INFO ] Implicit Places using invariants and state equation in 20124 ms returned []
Implicit Place search using SMT with State Equation took 20819 ms to find 0 implicit places.
[2026-05-26 01:49:42] [INFO ] Redundant transitions in 4 ms returned []
Running 398 sub problems to find dead transitions.
[2026-05-26 01:49:42] [INFO ] Invariant cache hit.
[2026-05-26 01:49:42] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/444 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 398 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/444 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 398 unsolved
At refinement iteration 2 (OVERLAPS) 4/448 variables, 5/46 constraints. Problems are: Problem set: 0 solved, 398 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/448 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 398 unsolved
At refinement iteration 4 (OVERLAPS) 402/850 variables, 448/494 constraints. Problems are: Problem set: 0 solved, 398 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/850 variables, 8/502 constraints. Problems are: Problem set: 0 solved, 398 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 850/988 variables, and 502 constraints, problems are : Problem set: 0 solved, 398 unsolved in 30018 ms.
Refiners :[Generalized P Invariants (flows): 46/46 constraints, State Equation: 448/517 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 398/398 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 398 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/444 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 398 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/444 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 398 unsolved
At refinement iteration 2 (OVERLAPS) 4/448 variables, 5/46 constraints. Problems are: Problem set: 0 solved, 398 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/448 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 398 unsolved
At refinement iteration 4 (OVERLAPS) 402/850 variables, 448/494 constraints. Problems are: Problem set: 0 solved, 398 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/850 variables, 8/502 constraints. Problems are: Problem set: 0 solved, 398 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 850/988 variables, and 900 constraints, problems are : Problem set: 0 solved, 398 unsolved in 30022 ms.
Refiners :[Generalized P Invariants (flows): 46/46 constraints, State Equation: 448/517 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 398/398 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60066ms problems are : Problem set: 0 solved, 398 unsolved
Search for dead transitions found 0 dead transitions in 60066ms
Starting structural reductions in SI_LTL mode, iteration 1 : 517/948 places, 471/902 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 80930 ms. Remains : 517/948 places, 471/902 transitions.
Computed a total of 517 stabilizing places and 471 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 517 transition count 471
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 7 factoid took 97 ms. Reduced automaton from 1 states, 1 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 2 AP (stutter insensitive).
RANDOM walk for 40000 steps (72 resets) in 137 ms. (289 steps per ms) remains 1/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 73 ms. (540 steps per ms) remains 1/1 properties
[2026-05-26 01:50:43] [INFO ] Invariant cache hit.
[2026-05-26 01:50:43] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 262/264 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/264 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 176/440 variables, 43/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/440 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 396/836 variables, 440/486 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/836 variables, 6/492 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/836 variables, 0/492 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 11/847 variables, 6/498 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/847 variables, 1/499 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/847 variables, 0/499 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 3/850 variables, 2/501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/850 variables, 1/502 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/850 variables, 0/502 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/850 variables, 0/502 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 850/988 variables, and 502 constraints, problems are : Problem set: 0 solved, 1 unsolved in 415 ms.
Refiners :[Generalized P Invariants (flows): 46/46 constraints, State Equation: 448/517 constraints, ReadFeed: 8/8 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/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 262/264 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/264 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 176/440 variables, 43/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/440 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 396/836 variables, 440/486 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/836 variables, 6/492 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/836 variables, 0/492 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 11/847 variables, 6/498 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/847 variables, 1/499 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/847 variables, 1/500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/847 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 3/850 variables, 2/502 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/850 variables, 1/503 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/850 variables, 0/503 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/850 variables, 0/503 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 850/988 variables, and 503 constraints, problems are : Problem set: 0 solved, 1 unsolved in 545 ms.
Refiners :[Generalized P Invariants (flows): 46/46 constraints, State Equation: 448/517 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 970ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 514 steps, including 13 resets, run visited all 1 properties in 4 ms. (steps per millisecond=128 )
Parikh walk visited 1 properties in 7 ms.
Knowledge based reduction with 7 factoid took 154 ms. Reduced automaton from 1 states, 1 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 38 ms :[(OR (NOT p3) (NOT p0))]
[2026-05-26 01:50:44] [INFO ] Invariant cache hit.
[2026-05-26 01:50:44] [INFO ] [Real]Absence check using 0 positive and 46 generalized place invariants in 23 ms returned sat
[2026-05-26 01:50:45] [INFO ] [Real]Absence check using state equation in 433 ms returned sat
[2026-05-26 01:50:45] [INFO ] Solution in real domain found non-integer solution.
[2026-05-26 01:50:45] [INFO ] [Nat]Absence check using 0 positive and 46 generalized place invariants in 23 ms returned sat
[2026-05-26 01:50:45] [INFO ] [Nat]Absence check using state equation in 366 ms returned sat
[2026-05-26 01:50:45] [INFO ] State equation strengthened by 8 read => feed constraints.
[2026-05-26 01:50:45] [INFO ] [Nat]Added 8 Read/Feed constraints in 26 ms returned sat
[2026-05-26 01:50:45] [INFO ] Computed and/alt/rep : 385/401/385 causal constraints (skipped 13 transitions) in 20 ms.
[2026-05-26 01:50:54] [INFO ] Added : 209 causal constraints over 42 iterations in 8319 ms. Result :sat
Could not prove EG (NOT p0)
Knowledge-based reduction took 11201 ms.
Stuttering acceptance computed with spot in 41 ms :[(OR (NOT p3) (NOT p0))]
Stuttering acceptance computed with spot in 38 ms :[(OR (NOT p3) (NOT p0))]
Stuttering criterion allowed to conclude after 507 steps with 0 reset in 4 ms.
FORMULA HirschbergSinclair-PT-40-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-40-LTLFireability-10 finished in 185116 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((F((p2 U (G(p2)||(p2&&(!p3||G(!p0))))))&&p1))))'
Support contains 6 out of 954 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 954/954 places, 908/908 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 950 transition count 904
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 950 transition count 904
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 948 transition count 902
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 948 transition count 902
Applied a total of 12 rules in 110 ms. Remains 948 /954 variables (removed 6) and now considering 902/908 (removed 6) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-750571960561175717.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13934327734794224465.kers'
[2026-05-26 01:50:54] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-750571960561175717.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13934327734794224465.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 902 rows 948 cols 2712 entries
Finished phase 1 with 896 SingleSign rule and 6 generalized
[2026-05-26 01:50:54] [INFO ] Computed 46 invariants in 4 ms
Computed 46 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-13934327734794224465.kers
Total runtime 7 ms.
[2026-05-26 01:50:54] [INFO ] Implicit Places using invariants in 329 ms returned []
[2026-05-26 01:50:54] [INFO ] Invariant cache hit.
[2026-05-26 01:51:05] [INFO ] Implicit Places using invariants and state equation in 10595 ms returned []
Implicit Place search using SMT with State Equation took 10927 ms to find 0 implicit places.
Running 862 sub problems to find dead transitions.
[2026-05-26 01:51:05] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/908 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 862 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 908/1850 variables, and 5 constraints, problems are : Problem set: 0 solved, 862 unsolved in 30022 ms.
Refiners :[Generalized P Invariants (flows): 5/46 constraints, State Equation: 0/948 constraints, PredecessorRefiner: 862/862 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 862 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/908 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 862 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/908 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 862 unsolved
At refinement iteration 2 (OVERLAPS) 40/948 variables, 41/46 constraints. Problems are: Problem set: 0 solved, 862 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 948/1850 variables, and 46 constraints, problems are : Problem set: 0 solved, 862 unsolved in 30021 ms.
Refiners :[Generalized P Invariants (flows): 46/46 constraints, State Equation: 0/948 constraints, PredecessorRefiner: 0/862 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60155ms problems are : Problem set: 0 solved, 862 unsolved
Search for dead transitions found 0 dead transitions in 60158ms
Starting structural reductions in LTL mode, iteration 1 : 948/954 places, 902/908 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 71201 ms. Remains : 948/954 places, 902/908 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((F((p2 U (G(p2)||(p2&&(!p3||G(!p0))))))&&p1))))'
Stuttering acceptance computed with spot in 209 ms :[(OR (NOT p2) (NOT p1)), (OR (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p1)), true, (NOT p2), (AND p0 (NOT p2))]
Running random walk in product with property : HirschbergSinclair-PT-40-LTLFireability-11
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA HirschbergSinclair-PT-40-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-40-LTLFireability-11 finished in 71461 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(X(X(F(p3))))))))'
Support contains 5 out of 954 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 954/954 places, 908/908 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 951 transition count 905
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 951 transition count 905
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 8 place count 949 transition count 903
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 949 transition count 903
Applied a total of 10 rules in 110 ms. Remains 949 /954 variables (removed 5) and now considering 903/908 (removed 5) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11062662383334329762.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11026704146445775396.kers'
[2026-05-26 01:52:05] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11062662383334329762.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11026704146445775396.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 903 rows 949 cols 2715 entries
Finished phase 1 with 897 SingleSign rule and 6 generalized
[2026-05-26 01:52:05] [INFO ] Computed 46 invariants in 4 ms
Computed 46 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-11026704146445775396.kers
Total runtime 7 ms.
[2026-05-26 01:52:06] [INFO ] Implicit Places using invariants in 304 ms returned []
[2026-05-26 01:52:06] [INFO ] Invariant cache hit.
[2026-05-26 01:52:16] [INFO ] Implicit Places using invariants and state equation in 10565 ms returned []
Implicit Place search using SMT with State Equation took 10875 ms to find 0 implicit places.
Running 863 sub problems to find dead transitions.
[2026-05-26 01:52:16] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/909 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 863 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 909/1852 variables, and 5 constraints, problems are : Problem set: 0 solved, 863 unsolved in 30020 ms.
Refiners :[Generalized P Invariants (flows): 5/46 constraints, State Equation: 0/949 constraints, PredecessorRefiner: 863/863 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 863 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/909 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 863 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/909 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 863 unsolved
At refinement iteration 2 (OVERLAPS) 40/949 variables, 41/46 constraints. Problems are: Problem set: 0 solved, 863 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 949/1852 variables, and 46 constraints, problems are : Problem set: 0 solved, 863 unsolved in 30019 ms.
Refiners :[Generalized P Invariants (flows): 46/46 constraints, State Equation: 0/949 constraints, PredecessorRefiner: 0/863 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60140ms problems are : Problem set: 0 solved, 863 unsolved
Search for dead transitions found 0 dead transitions in 60141ms
Starting structural reductions in LTL mode, iteration 1 : 949/954 places, 903/908 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 71129 ms. Remains : 949/954 places, 903/908 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(X(X(F(p3))))))))'
Stuttering acceptance computed with spot in 220 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p2) (NOT p3))), true, (NOT p1), (NOT p3), (NOT p3), (NOT p3)]
Running random walk in product with property : HirschbergSinclair-PT-40-LTLFireability-13
Entered a terminal (fully accepting) state of product in 6178 steps with 37 reset in 41 ms.
FORMULA HirschbergSinclair-PT-40-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-40-LTLFireability-13 finished in 71433 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(F(p0)))'
Support contains 1 out of 954 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 954/954 places, 908/908 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 950 transition count 904
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 950 transition count 904
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 948 transition count 902
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 948 transition count 902
Applied a total of 12 rules in 116 ms. Remains 948 /954 variables (removed 6) and now considering 902/908 (removed 6) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12310429999323328207.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8208325823641021078.kers'
[2026-05-26 01:53:17] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12310429999323328207.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8208325823641021078.kers]
Culled 0 columns in 2 ms.
// Phase 1: matrix 902 rows 948 cols 2712 entries
Finished phase 1 with 896 SingleSign rule and 6 generalized
[2026-05-26 01:53:17] [INFO ] Computed 46 invariants in 13 ms
Computed 46 P flows in 13 ms.
Exported basis to /tmp/petrispot-output-8208325823641021078.kers
Total runtime 14 ms.
[2026-05-26 01:53:17] [INFO ] Implicit Places using invariants in 319 ms returned []
[2026-05-26 01:53:17] [INFO ] Invariant cache hit.
[2026-05-26 01:53:28] [INFO ] Implicit Places using invariants and state equation in 10583 ms returned []
Implicit Place search using SMT with State Equation took 10904 ms to find 0 implicit places.
Running 862 sub problems to find dead transitions.
[2026-05-26 01:53:28] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/908 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 862 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 908/1850 variables, and 5 constraints, problems are : Problem set: 0 solved, 862 unsolved in 30025 ms.
Refiners :[Generalized P Invariants (flows): 5/46 constraints, State Equation: 0/948 constraints, PredecessorRefiner: 862/862 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 862 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/908 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 862 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/908 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 862 unsolved
At refinement iteration 2 (OVERLAPS) 40/948 variables, 41/46 constraints. Problems are: Problem set: 0 solved, 862 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 948/1850 variables, and 46 constraints, problems are : Problem set: 0 solved, 862 unsolved in 30014 ms.
Refiners :[Generalized P Invariants (flows): 46/46 constraints, State Equation: 0/948 constraints, PredecessorRefiner: 0/862 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60144ms problems are : Problem set: 0 solved, 862 unsolved
Search for dead transitions found 0 dead transitions in 60146ms
Starting structural reductions in LTL mode, iteration 1 : 948/954 places, 902/908 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 71171 ms. Remains : 948/954 places, 902/908 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(F(p0)))'
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : HirschbergSinclair-PT-40-LTLFireability-14
Product exploration explored 100000 steps with 913 reset in 548 ms.
Product exploration explored 100000 steps with 877 reset in 595 ms.
Computed a total of 948 stabilizing places and 902 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 948 transition count 902
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 53 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
RANDOM walk for 412 steps (0 resets) in 9 ms. (41 steps per ms) remains 0/1 properties
Knowledge based reduction with 4 factoid took 54 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 78 ms :[(NOT p0), (NOT p0)]
[2026-05-26 01:54:29] [INFO ] Invariant cache hit.
[2026-05-26 01:54:30] [INFO ] [Real]Absence check using 0 positive and 46 generalized place invariants in 40 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 917 ms.
FORMULA HirschbergSinclair-PT-40-LTLFireability-14 FALSE TECHNIQUES NEGATIVE_KNOWLEDGE
Treatment of property HirschbergSinclair-PT-40-LTLFireability-14 finished in 73341 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(((!p1 U (p2||G(!p1)))&&p0))))'
Spot run failed in 67 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/senseclsl.py", line 2, in
import spot, sys
ModuleNotFoundError: No module named 'spot'
Warning : SL/CL computation failed.
[2026-05-26 01:54:30] [INFO ] Flatten gal took : 23 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin2681521836415989706
[2026-05-26 01:54:30] [INFO ] Computing symmetric may disable matrix : 908 transitions.
[2026-05-26 01:54:30] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-26 01:54:30] [INFO ] Applying decomposition
[2026-05-26 01:54:30] [INFO ] Computing symmetric may enable matrix : 908 transitions.
[2026-05-26 01:54:30] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-26 01:54:30] [INFO ] Flatten gal took : 22 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph8949132148958314692.txt' '-o' '/tmp/graph8949132148958314692.bin' '-w' '/tmp/graph8949132148958314692.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph8949132148958314692.bin' '-l' '-1' '-v' '-w' '/tmp/graph8949132148958314692.weights' '-q' '0' '-e' '0.001'
[2026-05-26 01:54:30] [INFO ] Decomposing Gal with order
[2026-05-26 01:54:30] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-26 01:54:30] [INFO ] Computing Do-Not-Accords matrix : 908 transitions.
[2026-05-26 01:54:30] [INFO ] Computation of Completed DNA matrix. took 8 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-26 01:54:30] [INFO ] Built C files in 149ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2681521836415989706
Running compilation step : cd /tmp/ltsmin2681521836415989706;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '720' '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'
[2026-05-26 01:54:30] [INFO ] Removed a total of 117 redundant transitions.
[2026-05-26 01:54:30] [INFO ] Flatten gal took : 59 ms
[2026-05-26 01:54:30] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 6 ms.
[2026-05-26 01:54:30] [INFO ] Time to serialize gal into /tmp/LTLFireability16530780712734804742.gal : 14 ms
[2026-05-26 01:54:30] [INFO ] Time to serialize properties into /tmp/LTLFireability2671015939881338538.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability16530780712734804742.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability2671015939881338538.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((G(F(("((i2.i1.u8.newmsg9>=1)&&(i2.i0.u36.election_40_4_9_to_right_8>=1))")&&((!("(((i2.i1.u9.newmsg10>=1)&&(i2.i1.u8.election_40_5_...550
Formula 0 simplified : FG(!"((i2.i1.u8.newmsg9>=1)&&(i2.i0.u36.election_40_4_9_to_right_8>=1))" | ("(((i2.i1.u9.newmsg10>=1)&&(i2.i1.u8.election_40_5_10_to...413
Compilation finished in 2500 ms.
Running link step : cd /tmp/ltsmin2681521836415989706;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 46 ms.
Running LTSmin : cd /tmp/ltsmin2681521836415989706;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '-p' '--pins-guards' '--when' '--ltl' '[](<>(((!(LTLAPp1==true) U ((LTLAPp2==true)||[](!(LTLAPp1==true))))&&(LTLAPp0==true))))' '--buchi-type=spotba'
Reverse transition relation is NOT exact ! Due to transitions t0, t3, t4, t7, t10, t13, t17, t19, t23, t26, t27, t30, t31, t32, t35, t37, t39, t58, t151, t...1475
Computing Next relation with stutter on 2.01166e+29 deadlock states
Detected timeout of ITS tools.
[2026-05-26 02:21:08] [INFO ] Flatten gal took : 20 ms
[2026-05-26 02:21:08] [INFO ] Time to serialize gal into /tmp/LTLFireability4081047527790241053.gal : 8 ms
[2026-05-26 02:21:08] [INFO ] Time to serialize properties into /tmp/LTLFireability5396715260200861158.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability4081047527790241053.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability5396715260200861158.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...297
Read 1 LTL properties
Checking formula 0 : !((G(F(("((newmsg9>=1)&&(election_40_4_9_to_right_8>=1))")&&((!("(((newmsg10>=1)&&(election_40_5_10_to_right_9>=1))||(rcv_left_electio...428
Formula 0 simplified : FG(!"((newmsg9>=1)&&(election_40_4_9_to_right_8>=1))" | ("(((newmsg10>=1)&&(election_40_5_10_to_right_9>=1))||(rcv_left_election_40_...319
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t19, t20...810
Computing Next relation with stutter on 2.01166e+29 deadlock states
BK_TIME_CONFINEMENT_REACHED
--------------------
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-40"
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-40, 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-177961074400788"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/HirschbergSinclair-PT-40.tgz
mv HirschbergSinclair-PT-40 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 ;