About the Execution of ITS-Tools for HirschbergSinclair-PT-50
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 15650.504 | 3600000.00 | 6257578.00 | 28126.40 | TFFFF?FF??TTFTFF | 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-177961074400803.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-50, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r146-tall-177961074400803
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.2M
-rw-r--r-- 1 mcc users 13K Mar 7 17:02 CTLCardinality.txt
-rw-r--r-- 1 mcc users 97K Mar 7 17:02 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.1K Mar 7 17:02 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Mar 7 17:02 CTLFireability.xml
-rw-r--r-- 1 mcc users 5.5K Mar 15 10:51 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Mar 15 10:51 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 17K Mar 7 17:02 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 126K Mar 7 17:02 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Mar 7 17:02 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 62K 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.0K 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 652K 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-50-LTLCardinality-00
FORMULA_NAME HirschbergSinclair-PT-50-LTLCardinality-01
FORMULA_NAME HirschbergSinclair-PT-50-LTLCardinality-02
FORMULA_NAME HirschbergSinclair-PT-50-LTLCardinality-03
FORMULA_NAME HirschbergSinclair-PT-50-LTLCardinality-04
FORMULA_NAME HirschbergSinclair-PT-50-LTLCardinality-05
FORMULA_NAME HirschbergSinclair-PT-50-LTLCardinality-06
FORMULA_NAME HirschbergSinclair-PT-50-LTLCardinality-07
FORMULA_NAME HirschbergSinclair-PT-50-LTLCardinality-08
FORMULA_NAME HirschbergSinclair-PT-50-LTLCardinality-09
FORMULA_NAME HirschbergSinclair-PT-50-LTLCardinality-10
FORMULA_NAME HirschbergSinclair-PT-50-LTLCardinality-11
FORMULA_NAME HirschbergSinclair-PT-50-LTLCardinality-12
FORMULA_NAME HirschbergSinclair-PT-50-LTLCardinality-13
FORMULA_NAME HirschbergSinclair-PT-50-LTLCardinality-14
FORMULA_NAME HirschbergSinclair-PT-50-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1779763357056
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=HirschbergSinclair-PT-50
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202604301425
[2026-05-26 02:42:38] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-26 02:42:38] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-26 02:42:38] [INFO ] Load time of PNML (sax parser for PT used): 111 ms
[2026-05-26 02:42:38] [INFO ] Transformed 1208 places.
[2026-05-26 02:42:38] [INFO ] Transformed 1102 transitions.
[2026-05-26 02:42:38] [INFO ] Parsed PT model containing 1208 places and 1102 transitions and 3361 arcs in 205 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA HirschbergSinclair-PT-50-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HirschbergSinclair-PT-50-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HirschbergSinclair-PT-50-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 52 out of 1208 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1208/1208 places, 1102/1102 transitions.
Reduce places removed 48 places and 0 transitions.
Iterating post reduction 0 with 48 rules applied. Total rules applied 48 place count 1160 transition count 1102
Discarding 43 places :
Symmetric choice reduction at 1 with 43 rule applications. Total rules 91 place count 1117 transition count 1059
Iterating global reduction 1 with 43 rules applied. Total rules applied 134 place count 1117 transition count 1059
Discarding 40 places :
Symmetric choice reduction at 1 with 40 rule applications. Total rules 174 place count 1077 transition count 1019
Iterating global reduction 1 with 40 rules applied. Total rules applied 214 place count 1077 transition count 1019
Applied a total of 214 rules in 328 ms. Remains 1077 /1208 variables (removed 131) and now considering 1019/1102 (removed 83) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14119877719204126297.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1892427065907689714.kers'
[2026-05-26 02:42:39] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14119877719204126297.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1892427065907689714.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 1019 rows 1077 cols 3058 entries
Finished phase 1 with 1013 SingleSign rule and 6 generalized
[2026-05-26 02:42:39] [INFO ] Computed 58 invariants in 8 ms
Computed 58 P flows in 9 ms.
Exported basis to /tmp/petrispot-output-1892427065907689714.kers
Total runtime 11 ms.
[2026-05-26 02:42:39] [INFO ] Implicit Places using invariants in 679 ms returned []
[2026-05-26 02:42:39] [INFO ] Invariant cache hit.
[2026-05-26 02:42:50] [INFO ] Implicit Places using invariants and state equation in 10699 ms returned []
Implicit Place search using SMT with State Equation took 11422 ms to find 0 implicit places.
Running 969 sub problems to find dead transitions.
[2026-05-26 02:42:50] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1025 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 969 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1025/2096 variables, and 5 constraints, problems are : Problem set: 0 solved, 969 unsolved in 30045 ms.
Refiners :[Positive P Invariants (semi-flows): 0/2 constraints, Generalized P Invariants (flows): 5/56 constraints, State Equation: 0/1077 constraints, PredecessorRefiner: 969/969 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 969 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1025 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 969 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1025 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 969 unsolved
At refinement iteration 2 (OVERLAPS) 4/1029 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 969 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1029/2096 variables, and 7 constraints, problems are : Problem set: 0 solved, 969 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 5/56 constraints, State Equation: 0/1077 constraints, PredecessorRefiner: 0/969 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60388ms problems are : Problem set: 0 solved, 969 unsolved
Search for dead transitions found 0 dead transitions in 60405ms
Starting structural reductions in LTL mode, iteration 1 : 1077/1208 places, 1019/1102 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 72197 ms. Remains : 1077/1208 places, 1019/1102 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1077/1077 places, 1019/1019 transitions.
Applied a total of 0 rules in 41 ms. Remains 1077 /1077 variables (removed 0) and now considering 1019/1019 (removed 0) transitions.
[2026-05-26 02:43:50] [INFO ] Invariant cache hit.
[2026-05-26 02:43:51] [INFO ] Implicit Places using invariants in 335 ms returned []
[2026-05-26 02:43:51] [INFO ] Invariant cache hit.
[2026-05-26 02:44:01] [INFO ] Implicit Places using invariants and state equation in 10674 ms returned []
Implicit Place search using SMT with State Equation took 11012 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 11054 ms. Remains : 1077/1077 places, 1019/1019 transitions.
Support contains 52 out of 1077 places after structural reductions.
[2026-05-26 02:44:02] [INFO ] Flatten gal took : 97 ms
[2026-05-26 02:44:02] [INFO ] Flatten gal took : 55 ms
[2026-05-26 02:44:02] [INFO ] Input system was already deterministic with 1019 transitions.
RANDOM walk for 40000 steps (36 resets) in 1858 ms. (21 steps per ms) remains 13/33 properties
BEST_FIRST walk for 40004 steps (8 resets) in 125 ms. (317 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 126 ms. (314 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 168 ms. (236 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 173 ms. (229 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 105 ms. (377 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 184 ms. (216 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 114 ms. (347 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 139 ms. (285 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 101 ms. (392 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 108 ms. (367 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 81 ms. (487 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 72 ms. (548 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 70 ms. (563 steps per ms) remains 13/13 properties
[2026-05-26 02:44:03] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (OVERLAPS) 5/25 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (OVERLAPS) 763/788 variables, 14/15 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/788 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (OVERLAPS) 4/792 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/792 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (OVERLAPS) 183/975 variables, 42/58 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/975 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 13 unsolved
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp10 is UNSAT
Problem AtomicPropp13 is UNSAT
Problem AtomicPropp15 is UNSAT
Problem AtomicPropp19 is UNSAT
Problem AtomicPropp20 is UNSAT
Problem AtomicPropp22 is UNSAT
Problem AtomicPropp23 is UNSAT
Problem AtomicPropp25 is UNSAT
Problem AtomicPropp28 is UNSAT
Problem AtomicPropp31 is UNSAT
At refinement iteration 9 (OVERLAPS) 1019/1994 variables, 975/1033 constraints. Problems are: Problem set: 11 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1994 variables, 0/1033 constraints. Problems are: Problem set: 11 solved, 2 unsolved
Problem AtomicPropp32 is UNSAT
At refinement iteration 11 (OVERLAPS) 102/2096 variables, 102/1135 constraints. Problems are: Problem set: 12 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2096 variables, 0/1135 constraints. Problems are: Problem set: 12 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/2096 variables, 0/1135 constraints. Problems are: Problem set: 12 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2096/2096 variables, and 1135 constraints, problems are : Problem set: 12 solved, 1 unsolved in 1477 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 56/56 constraints, State Equation: 1077/1077 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 12 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 12 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 5/7 variables, 1/1 constraints. Problems are: Problem set: 12 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/1 constraints. Problems are: Problem set: 12 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 652/659 variables, 4/5 constraints. Problems are: Problem set: 12 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/659 variables, 0/5 constraints. Problems are: Problem set: 12 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 312/971 variables, 52/57 constraints. Problems are: Problem set: 12 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/971 variables, 0/57 constraints. Problems are: Problem set: 12 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 3/974 variables, 1/58 constraints. Problems are: Problem set: 12 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/974 variables, 0/58 constraints. Problems are: Problem set: 12 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1019/1993 variables, 974/1032 constraints. Problems are: Problem set: 12 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1993 variables, 1/1033 constraints. Problems are: Problem set: 12 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1993 variables, 0/1033 constraints. Problems are: Problem set: 12 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 103/2096 variables, 103/1136 constraints. Problems are: Problem set: 12 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2096 variables, 0/1136 constraints. Problems are: Problem set: 12 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/2096 variables, 0/1136 constraints. Problems are: Problem set: 12 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2096/2096 variables, and 1136 constraints, problems are : Problem set: 12 solved, 1 unsolved in 1286 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 56/56 constraints, State Equation: 1077/1077 constraints, PredecessorRefiner: 1/13 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2778ms problems are : Problem set: 12 solved, 1 unsolved
Parikh walk visited 0 properties in 284 ms.
Support contains 2 out of 1077 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1077/1077 places, 1019/1019 transitions.
Graph (complete) has 2041 edges and 1077 vertex of which 1026 are kept as prefixes of interest. Removing 51 places using SCC suffix rule.3 ms
Discarding 51 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 50 transitions
Reduce isomorphic transitions removed 50 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 449 transitions
Trivial Post-agglo rules discarded 449 transitions
Performed 449 trivial Post agglomeration. Transition count delta: 449
Iterating post reduction 0 with 499 rules applied. Total rules applied 500 place count 1026 transition count 520
Reduce places removed 449 places and 0 transitions.
Graph (complete) has 990 edges and 577 vertex of which 391 are kept as prefixes of interest. Removing 186 places using SCC suffix rule.1 ms
Discarding 186 places :
Also discarding 0 output transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 451 rules applied. Total rules applied 951 place count 391 transition count 519
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 186 transitions
Reduce isomorphic transitions removed 186 transitions.
Iterating post reduction 2 with 187 rules applied. Total rules applied 1138 place count 390 transition count 333
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 1138 place count 390 transition count 332
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1140 place count 389 transition count 332
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 1143 place count 386 transition count 329
Iterating global reduction 3 with 3 rules applied. Total rules applied 1146 place count 386 transition count 329
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 3 with 3 rules applied. Total rules applied 1149 place count 386 transition count 326
Reduce places removed 3 places and 0 transitions.
Graph (complete) has 614 edges and 383 vertex of which 377 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.0 ms
Discarding 6 places :
Also discarding 0 output transitions
Iterating post reduction 4 with 4 rules applied. Total rules applied 1153 place count 377 transition count 326
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 1159 place count 377 transition count 320
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 6 with 2 rules applied. Total rules applied 1161 place count 377 transition count 318
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 1163 place count 375 transition count 318
Reduce places removed 50 places and 50 transitions.
Iterating global reduction 7 with 50 rules applied. Total rules applied 1213 place count 325 transition count 268
Reduce places removed 50 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 246 transitions
Trivial Post-agglo rules discarded 246 transitions
Performed 246 trivial Post agglomeration. Transition count delta: 246
Iterating post reduction 7 with 296 rules applied. Total rules applied 1509 place count 275 transition count 22
Reduce places removed 246 places and 0 transitions.
Iterating post reduction 8 with 246 rules applied. Total rules applied 1755 place count 29 transition count 22
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 14 Pre rules applied. Total rules applied 1755 place count 29 transition count 8
Renaming transitions due to excessive name length > 1024 char.
Deduced a syphon composed of 14 places in 0 ms
Ensure Unique test removed 6 places
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 9 with 34 rules applied. Total rules applied 1789 place count 9 transition count 8
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 9 with 4 rules applied. Total rules applied 1793 place count 9 transition count 4
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 10 with 4 rules applied. Total rules applied 1797 place count 5 transition count 4
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 11 with 1 Pre rules applied. Total rules applied 1797 place count 5 transition count 3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 11 with 2 rules applied. Total rules applied 1799 place count 4 transition count 3
Applied a total of 1799 rules in 105 ms. Remains 4 /1077 variables (removed 1073) and now considering 3/1019 (removed 1016) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 105 ms. Remains : 4/1077 places, 3/1019 transitions.
RANDOM walk for 24 steps (5 resets) in 5 ms. (4 steps per ms) remains 0/1 properties
Successfully simplified 12 atomic propositions for a total of 13 simplifications.
FORMULA HirschbergSinclair-PT-50-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HirschbergSinclair-PT-50-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HirschbergSinclair-PT-50-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HirschbergSinclair-PT-50-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HirschbergSinclair-PT-50-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 1077 stabilizing places and 1019 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1077 transition count 1019
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((p0||X(!p0))) U G((F(G(p1)) U p2))))'
Support contains 4 out of 1077 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1077/1077 places, 1019/1019 transitions.
Graph (complete) has 2041 edges and 1077 vertex of which 1075 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.4 ms
Discarding 2 places :
Also discarding 0 output transitions
Reduce places removed 49 places and 49 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 449 transitions
Trivial Post-agglo rules discarded 449 transitions
Performed 449 trivial Post agglomeration. Transition count delta: 449
Iterating post reduction 0 with 449 rules applied. Total rules applied 450 place count 1026 transition count 521
Reduce places removed 449 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 450 rules applied. Total rules applied 900 place count 577 transition count 520
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 901 place count 576 transition count 520
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 911 place count 566 transition count 510
Iterating global reduction 3 with 10 rules applied. Total rules applied 921 place count 566 transition count 510
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 3 with 3 rules applied. Total rules applied 924 place count 566 transition count 507
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 927 place count 563 transition count 507
Applied a total of 927 rules in 92 ms. Remains 563 /1077 variables (removed 514) and now considering 507/1019 (removed 512) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3444465606587154052.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-229629852693347896.kers'
[2026-05-26 02:44:06] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3444465606587154052.kers, --Pflows, --basisKERS=/tmp/petrispot-output-229629852693347896.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 507 rows 563 cols 1032 entries
Finished phase 1 with 501 SingleSign rule and 6 generalized
[2026-05-26 02:44:06] [INFO ] Computed 56 invariants in 2 ms
Computed 56 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-229629852693347896.kers
Total runtime 2 ms.
[2026-05-26 02:44:07] [INFO ] Implicit Places using invariants in 743 ms returned []
[2026-05-26 02:44:07] [INFO ] Invariant cache hit.
[2026-05-26 02:44:07] [INFO ] State equation strengthened by 8 read => feed constraints.
[2026-05-26 02:44:33] [INFO ] Implicit Places using invariants and state equation in 25971 ms returned []
Implicit Place search using SMT with State Equation took 26722 ms to find 0 implicit places.
[2026-05-26 02:44:33] [INFO ] Redundant transitions in 40 ms returned []
Running 411 sub problems to find dead transitions.
[2026-05-26 02:44:33] [INFO ] Invariant cache hit.
[2026-05-26 02:44:33] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/467 variables, 52/52 constraints. Problems are: Problem set: 0 solved, 411 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/467 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 411 unsolved
At refinement iteration 2 (OVERLAPS) 3/470 variables, 4/56 constraints. Problems are: Problem set: 0 solved, 411 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/470 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 411 unsolved
At refinement iteration 4 (OVERLAPS) 414/884 variables, 470/526 constraints. Problems are: Problem set: 0 solved, 411 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/884 variables, 8/534 constraints. Problems are: Problem set: 0 solved, 411 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 884/1070 variables, and 534 constraints, problems are : Problem set: 0 solved, 411 unsolved in 30024 ms.
Refiners :[Generalized P Invariants (flows): 56/56 constraints, State Equation: 470/563 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 411/411 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 411 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/467 variables, 52/52 constraints. Problems are: Problem set: 0 solved, 411 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/467 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 411 unsolved
At refinement iteration 2 (OVERLAPS) 3/470 variables, 4/56 constraints. Problems are: Problem set: 0 solved, 411 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/470 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 411 unsolved
At refinement iteration 4 (OVERLAPS) 414/884 variables, 470/526 constraints. Problems are: Problem set: 0 solved, 411 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/884 variables, 8/534 constraints. Problems are: Problem set: 0 solved, 411 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 884/1070 variables, and 945 constraints, problems are : Problem set: 0 solved, 411 unsolved in 30039 ms.
Refiners :[Generalized P Invariants (flows): 56/56 constraints, State Equation: 470/563 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 411/411 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60093ms problems are : Problem set: 0 solved, 411 unsolved
Search for dead transitions found 0 dead transitions in 60095ms
Starting structural reductions in SI_LTL mode, iteration 1 : 563/1077 places, 507/1019 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 86963 ms. Remains : 563/1077 places, 507/1019 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((p0||X(!p0))) U G((F(G(p1)) U p2))))'
Stuttering acceptance computed with spot in 661 ms :[(NOT p2), (AND p0 (NOT p1)), false, (AND (NOT p1) (NOT p2)), (AND p0 (NOT p2)), (NOT p2), (AND p0 (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p2) p0), (NOT p2), (NOT p2), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : HirschbergSinclair-PT-50-LTLCardinality-03
Product exploration explored 100000 steps with 26052 reset in 1047 ms.
Product exploration explored 100000 steps with 26136 reset in 1031 ms.
Computed a total of 563 stabilizing places and 507 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 563 transition count 507
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 25 factoid took 45 ms. Proved property starting from automaton with 12 states, 36 edges and 3 AP (stutter insensitive
Knowledge-based reduction took 223 ms.
FORMULA HirschbergSinclair-PT-50-LTLCardinality-03 FALSE TECHNIQUES KNOWLEDGE
Treatment of property HirschbergSinclair-PT-50-LTLCardinality-03 finished in 90022 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 1077 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1077/1077 places, 1019/1019 transitions.
Graph (complete) has 2041 edges and 1077 vertex of which 1075 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.4 ms
Discarding 2 places :
Also discarding 0 output transitions
Reduce places removed 50 places and 50 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 448 transitions
Trivial Post-agglo rules discarded 448 transitions
Performed 448 trivial Post agglomeration. Transition count delta: 448
Iterating post reduction 0 with 448 rules applied. Total rules applied 449 place count 1025 transition count 521
Reduce places removed 448 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 450 rules applied. Total rules applied 899 place count 577 transition count 519
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 901 place count 575 transition count 519
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 911 place count 565 transition count 509
Iterating global reduction 3 with 10 rules applied. Total rules applied 921 place count 565 transition count 509
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 3 with 3 rules applied. Total rules applied 924 place count 565 transition count 506
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 927 place count 562 transition count 506
Applied a total of 927 rules in 77 ms. Remains 562 /1077 variables (removed 515) and now considering 506/1019 (removed 513) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8108858598604058152.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2106088505750430209.kers'
[2026-05-26 02:45:36] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8108858598604058152.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2106088505750430209.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 506 rows 562 cols 1028 entries
Finished phase 1 with 500 SingleSign rule and 6 generalized
[2026-05-26 02:45:36] [INFO ] Computed 56 invariants in 5 ms
Computed 56 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-2106088505750430209.kers
Total runtime 6 ms.
[2026-05-26 02:45:37] [INFO ] Implicit Places using invariants in 784 ms returned []
[2026-05-26 02:45:37] [INFO ] Invariant cache hit.
[2026-05-26 02:45:53] [INFO ] Implicit Places using invariants and state equation in 15722 ms returned []
Implicit Place search using SMT with State Equation took 16509 ms to find 0 implicit places.
[2026-05-26 02:45:53] [INFO ] Redundant transitions in 9 ms returned []
Running 407 sub problems to find dead transitions.
[2026-05-26 02:45:53] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/463 variables, 53/53 constraints. Problems are: Problem set: 0 solved, 407 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/463 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 407 unsolved
At refinement iteration 2 (OVERLAPS) 2/465 variables, 3/56 constraints. Problems are: Problem set: 0 solved, 407 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/465 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 407 unsolved
At refinement iteration 4 (OVERLAPS) 409/874 variables, 465/521 constraints. Problems are: Problem set: 0 solved, 407 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 874/1068 variables, and 521 constraints, problems are : Problem set: 0 solved, 407 unsolved in 30016 ms.
Refiners :[Generalized P Invariants (flows): 56/56 constraints, State Equation: 465/562 constraints, PredecessorRefiner: 407/407 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 407 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/463 variables, 53/53 constraints. Problems are: Problem set: 0 solved, 407 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/463 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 407 unsolved
At refinement iteration 2 (OVERLAPS) 2/465 variables, 3/56 constraints. Problems are: Problem set: 0 solved, 407 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/465 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 407 unsolved
At refinement iteration 4 (OVERLAPS) 409/874 variables, 465/521 constraints. Problems are: Problem set: 0 solved, 407 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/874 variables, 407/928 constraints. Problems are: Problem set: 0 solved, 407 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 874/1068 variables, and 928 constraints, problems are : Problem set: 0 solved, 407 unsolved in 30018 ms.
Refiners :[Generalized P Invariants (flows): 56/56 constraints, State Equation: 465/562 constraints, PredecessorRefiner: 407/407 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60062ms problems are : Problem set: 0 solved, 407 unsolved
Search for dead transitions found 0 dead transitions in 60063ms
Starting structural reductions in SI_LTL mode, iteration 1 : 562/1077 places, 506/1019 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 76667 ms. Remains : 562/1077 places, 506/1019 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 70 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : HirschbergSinclair-PT-50-LTLCardinality-04
Product exploration explored 100000 steps with 266 reset in 408 ms.
Product exploration explored 100000 steps with 266 reset in 387 ms.
Computed a total of 562 stabilizing places and 506 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 562 transition count 506
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 55 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
RANDOM walk for 1601 steps (0 resets) in 16 ms. (94 steps per ms) remains 0/1 properties
Knowledge based reduction with 4 factoid took 58 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 76 ms :[(NOT p0), (NOT p0)]
[2026-05-26 02:46:54] [INFO ] Invariant cache hit.
[2026-05-26 02:46:55] [INFO ] [Real]Absence check using 0 positive and 56 generalized place invariants in 49 ms returned sat
[2026-05-26 02:47:09] [INFO ] [Real]Absence check using state equation in 14683 ms returned unknown
Could not prove EG (NOT p0)
Knowledge-based reduction took 15409 ms.
Stuttering acceptance computed with spot in 89 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 562 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 562/562 places, 506/506 transitions.
Applied a total of 0 rules in 26 ms. Remains 562 /562 variables (removed 0) and now considering 506/506 (removed 0) transitions.
[2026-05-26 02:47:09] [INFO ] Invariant cache hit.
[2026-05-26 02:47:10] [INFO ] Implicit Places using invariants in 786 ms returned []
[2026-05-26 02:47:10] [INFO ] Invariant cache hit.
[2026-05-26 02:47:26] [INFO ] Implicit Places using invariants and state equation in 15786 ms returned []
Implicit Place search using SMT with State Equation took 16572 ms to find 0 implicit places.
[2026-05-26 02:47:26] [INFO ] Redundant transitions in 5 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 16609 ms. Remains : 562/562 places, 506/506 transitions.
Computed a total of 562 stabilizing places and 506 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 562 transition count 506
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 52 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
RANDOM walk for 1600 steps (0 resets) in 13 ms. (114 steps per ms) remains 0/1 properties
Knowledge based reduction with 4 factoid took 59 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 76 ms :[(NOT p0), (NOT p0)]
[2026-05-26 02:47:26] [INFO ] Invariant cache hit.
[2026-05-26 02:47:27] [INFO ] [Real]Absence check using 0 positive and 56 generalized place invariants in 47 ms returned sat
[2026-05-26 02:47:41] [INFO ] [Real]Absence check using state equation in 14691 ms returned unknown
Could not prove EG (NOT p0)
Knowledge-based reduction took 15380 ms.
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 266 reset in 352 ms.
Product exploration explored 100000 steps with 266 reset in 390 ms.
Built C files in :
/tmp/ltsmin1295551319427418549
[2026-05-26 02:47:42] [INFO ] Computing symmetric may disable matrix : 506 transitions.
[2026-05-26 02:47:42] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-26 02:47:42] [INFO ] Computing symmetric may enable matrix : 506 transitions.
[2026-05-26 02:47:42] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-26 02:47:42] [INFO ] Computing Do-Not-Accords matrix : 506 transitions.
[2026-05-26 02:47:42] [INFO ] Computation of Completed DNA matrix. took 11 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-26 02:47:42] [INFO ] Built C files in 92ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1295551319427418549
Running compilation step : cd /tmp/ltsmin1295551319427418549;'/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 1251 ms.
Running link step : cd /tmp/ltsmin1295551319427418549;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 50 ms.
Running LTSmin : cd /tmp/ltsmin1295551319427418549;'/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/stateBased577070492231965399.hoa' '--buchi-type=spotba'
LTSmin run took 4979 ms.
FORMULA HirschbergSinclair-PT-50-LTLCardinality-04 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property HirschbergSinclair-PT-50-LTLCardinality-04 finished in 132381 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((F(G((p0 U p1)))&&G(p2))))'
Support contains 5 out of 1077 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1077/1077 places, 1019/1019 transitions.
Graph (complete) has 2041 edges and 1077 vertex of which 1076 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Reduce places removed 49 places and 49 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 447 transitions
Trivial Post-agglo rules discarded 447 transitions
Performed 447 trivial Post agglomeration. Transition count delta: 447
Iterating post reduction 0 with 447 rules applied. Total rules applied 448 place count 1027 transition count 523
Reduce places removed 447 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 448 rules applied. Total rules applied 896 place count 580 transition count 522
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 897 place count 579 transition count 522
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 906 place count 570 transition count 513
Iterating global reduction 3 with 9 rules applied. Total rules applied 915 place count 570 transition count 513
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 3 with 3 rules applied. Total rules applied 918 place count 570 transition count 510
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 921 place count 567 transition count 510
Applied a total of 921 rules in 51 ms. Remains 567 /1077 variables (removed 510) and now considering 510/1019 (removed 509) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17052432013126147915.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7098520604595533993.kers'
[2026-05-26 02:47:49] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17052432013126147915.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7098520604595533993.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 510 rows 567 cols 1042 entries
Finished phase 1 with 504 SingleSign rule and 6 generalized
[2026-05-26 02:47:49] [INFO ] Computed 57 invariants in 2 ms
Computed 57 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-7098520604595533993.kers
Total runtime 2 ms.
[2026-05-26 02:47:50] [INFO ] Implicit Places using invariants in 760 ms returned []
[2026-05-26 02:47:50] [INFO ] Invariant cache hit.
[2026-05-26 02:47:50] [INFO ] State equation strengthened by 8 read => feed constraints.
[2026-05-26 02:48:07] [INFO ] Implicit Places using invariants and state equation in 16985 ms returned []
Implicit Place search using SMT with State Equation took 17747 ms to find 0 implicit places.
[2026-05-26 02:48:07] [INFO ] Redundant transitions in 5 ms returned []
Running 414 sub problems to find dead transitions.
[2026-05-26 02:48:07] [INFO ] Invariant cache hit.
[2026-05-26 02:48:07] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/470 variables, 52/52 constraints. Problems are: Problem set: 0 solved, 414 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/470 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 414 unsolved
At refinement iteration 2 (OVERLAPS) 2/472 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 414 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/472 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 414 unsolved
At refinement iteration 4 (OVERLAPS) 3/475 variables, 4/57 constraints. Problems are: Problem set: 0 solved, 414 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/475 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 414 unsolved
At refinement iteration 6 (OVERLAPS) 418/893 variables, 475/532 constraints. Problems are: Problem set: 0 solved, 414 unsolved
SMT process timed out in 30045ms, After SMT, problems are : Problem set: 0 solved, 414 unsolved
Search for dead transitions found 0 dead transitions in 30046ms
Starting structural reductions in SI_LTL mode, iteration 1 : 567/1077 places, 510/1019 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 47861 ms. Remains : 567/1077 places, 510/1019 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((F(G((p0 U p1)))&&G(p2))))'
Stuttering acceptance computed with spot in 145 ms :[(OR (NOT p1) (NOT p2)), (NOT p1), (NOT p1)]
Running random walk in product with property : HirschbergSinclair-PT-50-LTLCardinality-05
Product exploration explored 100000 steps with 179 reset in 353 ms.
Product exploration explored 100000 steps with 179 reset in 354 ms.
Computed a total of 567 stabilizing places and 510 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 567 transition count 510
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 20 factoid took 78 ms. Reduced automaton from 3 states, 9 edges and 3 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
RANDOM walk for 40001 steps (68 resets) in 255 ms. (156 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 163 ms. (243 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 463731 steps, run timeout after 3001 ms. (steps per millisecond=154 ) properties seen :0 out of 1
Probabilistic random walk after 463731 steps, saw 166053 distinct states, run finished after 3006 ms. (steps per millisecond=154 ) properties seen :0
[2026-05-26 02:48:41] [INFO ] Invariant cache hit.
[2026-05-26 02:48:41] [INFO ] State equation strengthened by 8 read => feed constraints.
All remaining problems are real, not stopping.
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) 3/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 348/353 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/353 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 118/471 variables, 53/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/471 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 414/885 variables, 471/528 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/885 variables, 6/534 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/885 variables, 0/534 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 5/890 variables, 2/536 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/890 variables, 1/537 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/890 variables, 0/537 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 3/893 variables, 2/539 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/893 variables, 1/540 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/893 variables, 0/540 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/893 variables, 0/540 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 893/1077 variables, and 540 constraints, problems are : Problem set: 0 solved, 1 unsolved in 615 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 56/56 constraints, State Equation: 475/567 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) 3/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 348/353 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/353 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 118/471 variables, 53/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/471 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 414/885 variables, 471/528 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/885 variables, 6/534 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/885 variables, 1/535 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/885 variables, 0/535 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 5/890 variables, 2/537 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/890 variables, 1/538 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/890 variables, 0/538 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 3/893 variables, 2/540 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/893 variables, 1/541 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/893 variables, 0/541 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/893 variables, 0/541 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 893/1077 variables, and 541 constraints, problems are : Problem set: 0 solved, 1 unsolved in 815 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 56/56 constraints, State Equation: 475/567 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1436ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 103 ms.
Support contains 2 out of 567 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 567/567 places, 510/510 transitions.
Graph (complete) has 933 edges and 567 vertex of which 331 are kept as prefixes of interest. Removing 236 places using SCC suffix rule.0 ms
Discarding 236 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 236 transitions
Reduce isomorphic transitions removed 236 transitions.
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 0 with 237 rules applied. Total rules applied 238 place count 331 transition count 273
Reduce places removed 47 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 221 transitions
Trivial Post-agglo rules discarded 221 transitions
Performed 221 trivial Post agglomeration. Transition count delta: 221
Iterating post reduction 1 with 268 rules applied. Total rules applied 506 place count 284 transition count 52
Reduce places removed 221 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 222 rules applied. Total rules applied 728 place count 63 transition count 51
Reduce places removed 2 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 3 with 6 rules applied. Total rules applied 734 place count 61 transition count 47
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 738 place count 57 transition count 47
Performed 23 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 23 Pre rules applied. Total rules applied 738 place count 57 transition count 24
Deduced a syphon composed of 23 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 5 with 49 rules applied. Total rules applied 787 place count 31 transition count 24
Discarding 1 places :
Implicit places reduction removed 1 places
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 5 with 3 rules applied. Total rules applied 790 place count 30 transition count 22
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 792 place count 28 transition count 22
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 792 place count 28 transition count 21
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 794 place count 27 transition count 21
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 796 place count 26 transition count 20
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 7 with 2 rules applied. Total rules applied 798 place count 26 transition count 18
Reduce places removed 4 places and 0 transitions.
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 7 with 6 rules applied. Total rules applied 804 place count 22 transition count 16
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 806 place count 20 transition count 16
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 6 Pre rules applied. Total rules applied 806 place count 20 transition count 10
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 9 with 12 rules applied. Total rules applied 818 place count 14 transition count 10
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 9 with 2 rules applied. Total rules applied 820 place count 12 transition count 10
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 2 Pre rules applied. Total rules applied 820 place count 12 transition count 8
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 10 with 4 rules applied. Total rules applied 824 place count 10 transition count 8
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 10 with 1 rules applied. Total rules applied 825 place count 9 transition count 7
Reduce places removed 1 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 10 with 4 rules applied. Total rules applied 829 place count 8 transition count 4
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 11 with 3 rules applied. Total rules applied 832 place count 5 transition count 4
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 12 with 1 Pre rules applied. Total rules applied 832 place count 5 transition count 3
Renaming transitions due to excessive name length > 1024 char.
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 12 with 2 rules applied. Total rules applied 834 place count 4 transition count 3
Applied a total of 834 rules in 10 ms. Remains 4 /567 variables (removed 563) and now considering 3/510 (removed 507) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 4/567 places, 3/510 transitions.
RANDOM walk for 16 steps (3 resets) in 4 ms. (3 steps per ms) remains 0/1 properties
Knowledge based reduction with 20 factoid took 74 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[(NOT p2)]
Knowledge-based reduction took 5057 ms.
Stuttering acceptance computed with spot in 34 ms :[(NOT p2)]
Support contains 2 out of 567 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 : 567/567 places, 510/510 transitions.
Applied a total of 0 rules in 23 ms. Remains 567 /567 variables (removed 0) and now considering 510/510 (removed 0) transitions.
[2026-05-26 02:48:43] [INFO ] Invariant cache hit.
[2026-05-26 02:48:43] [INFO ] Implicit Places using invariants in 752 ms returned []
[2026-05-26 02:48:43] [INFO ] Invariant cache hit.
[2026-05-26 02:48:44] [INFO ] State equation strengthened by 8 read => feed constraints.
[2026-05-26 02:49:00] [INFO ] Implicit Places using invariants and state equation in 16889 ms returned []
Implicit Place search using SMT with State Equation took 17643 ms to find 0 implicit places.
[2026-05-26 02:49:00] [INFO ] Redundant transitions in 5 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 17677 ms. Remains : 567/567 places, 510/510 transitions.
Computed a total of 567 stabilizing places and 510 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 567 transition count 510
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 50 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
RANDOM walk for 40002 steps (68 resets) in 145 ms. (273 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 91 ms. (434 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 460430 steps, run timeout after 3001 ms. (steps per millisecond=153 ) properties seen :0 out of 1
Probabilistic random walk after 460430 steps, saw 165433 distinct states, run finished after 3001 ms. (steps per millisecond=153 ) properties seen :0
[2026-05-26 02:49:04] [INFO ] Invariant cache hit.
[2026-05-26 02:49:04] [INFO ] State equation strengthened by 8 read => feed constraints.
All remaining problems are real, not stopping.
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) 3/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 348/353 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/353 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 118/471 variables, 53/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/471 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 414/885 variables, 471/528 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/885 variables, 6/534 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/885 variables, 0/534 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 5/890 variables, 2/536 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/890 variables, 1/537 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/890 variables, 0/537 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 3/893 variables, 2/539 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/893 variables, 1/540 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/893 variables, 0/540 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/893 variables, 0/540 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 893/1077 variables, and 540 constraints, problems are : Problem set: 0 solved, 1 unsolved in 636 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 56/56 constraints, State Equation: 475/567 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) 3/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 348/353 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/353 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 118/471 variables, 53/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/471 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 414/885 variables, 471/528 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/885 variables, 6/534 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/885 variables, 1/535 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/885 variables, 0/535 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 5/890 variables, 2/537 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/890 variables, 1/538 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/890 variables, 0/538 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 3/893 variables, 2/540 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/893 variables, 1/541 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/893 variables, 0/541 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/893 variables, 0/541 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 893/1077 variables, and 541 constraints, problems are : Problem set: 0 solved, 1 unsolved in 826 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 56/56 constraints, State Equation: 475/567 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1469ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 110 ms.
Support contains 2 out of 567 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 567/567 places, 510/510 transitions.
Graph (complete) has 933 edges and 567 vertex of which 331 are kept as prefixes of interest. Removing 236 places using SCC suffix rule.1 ms
Discarding 236 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 236 transitions
Reduce isomorphic transitions removed 236 transitions.
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 0 with 237 rules applied. Total rules applied 238 place count 331 transition count 273
Reduce places removed 47 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 221 transitions
Trivial Post-agglo rules discarded 221 transitions
Performed 221 trivial Post agglomeration. Transition count delta: 221
Iterating post reduction 1 with 268 rules applied. Total rules applied 506 place count 284 transition count 52
Reduce places removed 221 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 222 rules applied. Total rules applied 728 place count 63 transition count 51
Reduce places removed 2 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 3 with 6 rules applied. Total rules applied 734 place count 61 transition count 47
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 738 place count 57 transition count 47
Performed 23 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 23 Pre rules applied. Total rules applied 738 place count 57 transition count 24
Deduced a syphon composed of 23 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 5 with 49 rules applied. Total rules applied 787 place count 31 transition count 24
Discarding 1 places :
Implicit places reduction removed 1 places
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 5 with 3 rules applied. Total rules applied 790 place count 30 transition count 22
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 792 place count 28 transition count 22
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 792 place count 28 transition count 21
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 794 place count 27 transition count 21
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 796 place count 26 transition count 20
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 7 with 2 rules applied. Total rules applied 798 place count 26 transition count 18
Reduce places removed 4 places and 0 transitions.
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 7 with 6 rules applied. Total rules applied 804 place count 22 transition count 16
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 806 place count 20 transition count 16
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 6 Pre rules applied. Total rules applied 806 place count 20 transition count 10
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 9 with 12 rules applied. Total rules applied 818 place count 14 transition count 10
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 9 with 2 rules applied. Total rules applied 820 place count 12 transition count 10
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 2 Pre rules applied. Total rules applied 820 place count 12 transition count 8
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 10 with 4 rules applied. Total rules applied 824 place count 10 transition count 8
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 10 with 1 rules applied. Total rules applied 825 place count 9 transition count 7
Reduce places removed 1 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 10 with 4 rules applied. Total rules applied 829 place count 8 transition count 4
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 11 with 3 rules applied. Total rules applied 832 place count 5 transition count 4
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 12 with 1 Pre rules applied. Total rules applied 832 place count 5 transition count 3
Renaming transitions due to excessive name length > 1024 char.
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 12 with 2 rules applied. Total rules applied 834 place count 4 transition count 3
Applied a total of 834 rules in 8 ms. Remains 4 /567 variables (removed 563) and now considering 3/510 (removed 507) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 4/567 places, 3/510 transitions.
RANDOM walk for 28 steps (6 resets) in 4 ms. (5 steps per ms) remains 0/1 properties
Knowledge based reduction with 4 factoid took 57 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 38 ms :[(NOT p2)]
Knowledge-based reduction took 4983 ms.
Stuttering acceptance computed with spot in 38 ms :[(NOT p2)]
Stuttering acceptance computed with spot in 39 ms :[(NOT p2)]
Product exploration explored 100000 steps with 179 reset in 322 ms.
Product exploration explored 100000 steps with 179 reset in 345 ms.
Built C files in :
/tmp/ltsmin5311307450518695720
[2026-05-26 02:49:06] [INFO ] Computing symmetric may disable matrix : 510 transitions.
[2026-05-26 02:49:06] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-26 02:49:06] [INFO ] Computing symmetric may enable matrix : 510 transitions.
[2026-05-26 02:49:06] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-26 02:49:06] [INFO ] Computing Do-Not-Accords matrix : 510 transitions.
[2026-05-26 02:49:06] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-26 02:49:06] [INFO ] Built C files in 60ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5311307450518695720
Running compilation step : cd /tmp/ltsmin5311307450518695720;'/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 1156 ms.
Running link step : cd /tmp/ltsmin5311307450518695720;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin5311307450518695720;'/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/stateBased17692798350056122375.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 567 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 567/567 places, 510/510 transitions.
Reduce places removed 1 places and 1 transitions.
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 0 with 1 rules applied. Total rules applied 1 place count 566 transition count 508
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 2 rules applied. Total rules applied 3 place count 565 transition count 507
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 4 place count 564 transition count 507
Applied a total of 4 rules in 21 ms. Remains 564 /567 variables (removed 3) and now considering 507/510 (removed 3) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10046070376392655336.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9585098535045796505.kers'
[2026-05-26 02:49:21] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10046070376392655336.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9585098535045796505.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 507 rows 564 cols 1030 entries
Finished phase 1 with 501 SingleSign rule and 6 generalized
[2026-05-26 02:49:21] [INFO ] Computed 57 invariants in 2 ms
Computed 57 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-9585098535045796505.kers
Total runtime 2 ms.
[2026-05-26 02:49:22] [INFO ] Implicit Places using invariants in 771 ms returned []
[2026-05-26 02:49:22] [INFO ] Invariant cache hit.
[2026-05-26 02:49:37] [INFO ] Implicit Places using invariants and state equation in 15117 ms returned []
Implicit Place search using SMT with State Equation took 15893 ms to find 0 implicit places.
[2026-05-26 02:49:37] [INFO ] Redundant transitions in 3 ms returned []
Running 408 sub problems to find dead transitions.
[2026-05-26 02:49:37] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/464 variables, 53/53 constraints. Problems are: Problem set: 0 solved, 408 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/464 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 408 unsolved
At refinement iteration 2 (OVERLAPS) 2/466 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 408 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/466 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 408 unsolved
At refinement iteration 4 (OVERLAPS) 2/468 variables, 3/57 constraints. Problems are: Problem set: 0 solved, 408 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/468 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 408 unsolved
At refinement iteration 6 (OVERLAPS) 411/879 variables, 468/525 constraints. Problems are: Problem set: 0 solved, 408 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 879/1071 variables, and 525 constraints, problems are : Problem set: 0 solved, 408 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 56/56 constraints, State Equation: 468/564 constraints, PredecessorRefiner: 408/408 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 408 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/464 variables, 53/53 constraints. Problems are: Problem set: 0 solved, 408 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/464 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 408 unsolved
At refinement iteration 2 (OVERLAPS) 2/466 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 408 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/466 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 408 unsolved
At refinement iteration 4 (OVERLAPS) 2/468 variables, 3/57 constraints. Problems are: Problem set: 0 solved, 408 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/468 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 408 unsolved
At refinement iteration 6 (OVERLAPS) 411/879 variables, 468/525 constraints. Problems are: Problem set: 0 solved, 408 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/879 variables, 408/933 constraints. Problems are: Problem set: 0 solved, 408 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 879/1071 variables, and 933 constraints, problems are : Problem set: 0 solved, 408 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 56/56 constraints, State Equation: 468/564 constraints, PredecessorRefiner: 408/408 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60063ms problems are : Problem set: 0 solved, 408 unsolved
Search for dead transitions found 0 dead transitions in 60064ms
Starting structural reductions in SI_LTL mode, iteration 1 : 564/567 places, 507/510 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 75988 ms. Remains : 564/567 places, 507/510 transitions.
Built C files in :
/tmp/ltsmin5022523965716642001
[2026-05-26 02:50:37] [INFO ] Computing symmetric may disable matrix : 507 transitions.
[2026-05-26 02:50:37] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-26 02:50:37] [INFO ] Computing symmetric may enable matrix : 507 transitions.
[2026-05-26 02:50:37] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-26 02:50:37] [INFO ] Computing Do-Not-Accords matrix : 507 transitions.
[2026-05-26 02:50:37] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-26 02:50:37] [INFO ] Built C files in 51ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5022523965716642001
Running compilation step : cd /tmp/ltsmin5022523965716642001;'/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 1151 ms.
Running link step : cd /tmp/ltsmin5022523965716642001;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin5022523965716642001;'/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/stateBased13193227036066445492.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2026-05-26 02:50:52] [INFO ] Flatten gal took : 21 ms
[2026-05-26 02:50:52] [INFO ] Flatten gal took : 18 ms
[2026-05-26 02:50:52] [INFO ] Time to serialize gal into /tmp/LTL17925575351338381380.gal : 19 ms
[2026-05-26 02:50:52] [INFO ] Time to serialize properties into /tmp/LTL4174420281934583569.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/LTL17925575351338381380.gal' '-t' 'CGAL' '-hoa' '/tmp/aut16023711199838497701.hoa' '-atoms' '/tmp/LTL4174420281934583569.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...319
Loading property file /tmp/LTL4174420281934583569.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut16023711199838497701.hoa
Detected timeout of ITS tools.
[2026-05-26 02:51:07] [INFO ] Flatten gal took : 16 ms
[2026-05-26 02:51:07] [INFO ] Flatten gal took : 14 ms
[2026-05-26 02:51:07] [INFO ] Time to serialize gal into /tmp/LTL5474599257801454981.gal : 3 ms
[2026-05-26 02:51:07] [INFO ] Time to serialize properties into /tmp/LTL15658388911922027074.ltl : 9 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/LTL5474599257801454981.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15658388911922027074.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...276
Read 1 LTL properties
Checking formula 0 : !((F((F(G(("(rcv_left_election_50_3_2_2>=1)")U("(rcv_right_election_50_6_9_41<=election_37_0_1_to_left_37)"))))&&(G("(election_50_6_9_...191
Formula 0 simplified : GF(!"(election_50_6_9_to_left_42<=reply_36_0_left36)" | GF(!"(rcv_left_election_50_3_2_2>=1)" R !"(rcv_right_election_50_6_9_41<=ele...182
Detected timeout of ITS tools.
[2026-05-26 02:51:22] [INFO ] Flatten gal took : 14 ms
[2026-05-26 02:51:22] [INFO ] Applying decomposition
[2026-05-26 02:51:22] [INFO ] Flatten gal took : 14 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/graph18322365607950095134.txt' '-o' '/tmp/graph18322365607950095134.bin' '-w' '/tmp/graph18322365607950095134.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph18322365607950095134.bin' '-l' '-1' '-v' '-w' '/tmp/graph18322365607950095134.weights' '-q' '0' '-e' '0.001'
[2026-05-26 02:51:23] [INFO ] Decomposing Gal with order
[2026-05-26 02:51:23] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-26 02:51:23] [INFO ] Removed a total of 347 redundant transitions.
[2026-05-26 02:51:23] [INFO ] Flatten gal took : 105 ms
[2026-05-26 02:51:23] [INFO ] Fuse similar labels procedure discarded/fused a total of 42 labels/synchronizations in 24 ms.
[2026-05-26 02:51:23] [INFO ] Time to serialize gal into /tmp/LTL9421603088245076608.gal : 17 ms
[2026-05-26 02:51:23] [INFO ] Time to serialize properties into /tmp/LTL13100395616386158577.ltl : 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/LTL9421603088245076608.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13100395616386158577.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...276
Read 1 LTL properties
Checking formula 0 : !((F((F(G(("(gi2.gi0.gi0.gi0.gi5.gu71.rcv_left_election_50_3_2_2>=1)")U("(gu168.rcv_right_election_50_6_9_41<=gu168.election_37_0_1_to...240
Formula 0 simplified : GF(!"(gu167.election_50_6_9_to_left_42<=gu167.reply_36_0_left36)" | GF(!"(gi2.gi0.gi0.gi0.gi5.gu71.rcv_left_election_50_3_2_2>=1)" R...231
Detected timeout of ITS tools.
Treatment of property HirschbergSinclair-PT-50-LTLCardinality-05 finished in 229337 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(p0)))'
Support contains 2 out of 1077 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1077/1077 places, 1019/1019 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 1076 transition count 1019
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 10 place count 1067 transition count 1010
Iterating global reduction 1 with 9 rules applied. Total rules applied 19 place count 1067 transition count 1010
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 25 place count 1061 transition count 1004
Iterating global reduction 1 with 6 rules applied. Total rules applied 31 place count 1061 transition count 1004
Applied a total of 31 rules in 103 ms. Remains 1061 /1077 variables (removed 16) and now considering 1004/1019 (removed 15) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14802820071657447621.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8464735504490545831.kers'
[2026-05-26 02:51:38] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14802820071657447621.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8464735504490545831.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 1004 rows 1061 cols 3018 entries
Finished phase 1 with 998 SingleSign rule and 6 generalized
[2026-05-26 02:51:38] [INFO ] Computed 57 invariants in 5 ms
Computed 57 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-8464735504490545831.kers
Total runtime 8 ms.
[2026-05-26 02:51:39] [INFO ] Implicit Places using invariants in 352 ms returned []
[2026-05-26 02:51:39] [INFO ] Invariant cache hit.
[2026-05-26 02:51:50] [INFO ] Implicit Places using invariants and state equation in 11036 ms returned []
Implicit Place search using SMT with State Equation took 11390 ms to find 0 implicit places.
Running 954 sub problems to find dead transitions.
[2026-05-26 02:51:50] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1010 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 954 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1010/2065 variables, and 5 constraints, problems are : Problem set: 0 solved, 954 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 0/1 constraints, Generalized P Invariants (flows): 5/56 constraints, State Equation: 0/1061 constraints, PredecessorRefiner: 954/954 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 954 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1010 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 954 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1010 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 954 unsolved
At refinement iteration 2 (OVERLAPS) 2/1012 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 954 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1012/2065 variables, and 6 constraints, problems are : Problem set: 0 solved, 954 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 5/56 constraints, State Equation: 0/1061 constraints, PredecessorRefiner: 0/954 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60174ms problems are : Problem set: 0 solved, 954 unsolved
Search for dead transitions found 0 dead transitions in 60180ms
Starting structural reductions in LTL mode, iteration 1 : 1061/1077 places, 1004/1019 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 71679 ms. Remains : 1061/1077 places, 1004/1019 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(p0)))'
Stuttering acceptance computed with spot in 125 ms :[(NOT p0), (NOT p0), true, (NOT p0)]
Running random walk in product with property : HirschbergSinclair-PT-50-LTLCardinality-06
Entered a terminal (fully accepting) state of product in 326 steps with 108 reset in 5 ms.
FORMULA HirschbergSinclair-PT-50-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-50-LTLCardinality-06 finished in 71851 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 2 out of 1077 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1077/1077 places, 1019/1019 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 1075 transition count 1019
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 11 place count 1066 transition count 1010
Iterating global reduction 1 with 9 rules applied. Total rules applied 20 place count 1066 transition count 1010
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 26 place count 1060 transition count 1004
Iterating global reduction 1 with 6 rules applied. Total rules applied 32 place count 1060 transition count 1004
Applied a total of 32 rules in 104 ms. Remains 1060 /1077 variables (removed 17) and now considering 1004/1019 (removed 15) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4783726130821090826.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16361384436995437122.kers'
[2026-05-26 02:52:50] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4783726130821090826.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16361384436995437122.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 1004 rows 1060 cols 3017 entries
Finished phase 1 with 998 SingleSign rule and 6 generalized
[2026-05-26 02:52:50] [INFO ] Computed 56 invariants in 4 ms
Computed 56 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-16361384436995437122.kers
Total runtime 7 ms.
[2026-05-26 02:52:50] [INFO ] Implicit Places using invariants in 342 ms returned []
[2026-05-26 02:52:50] [INFO ] Invariant cache hit.
[2026-05-26 02:53:01] [INFO ] Implicit Places using invariants and state equation in 10761 ms returned []
Implicit Place search using SMT with State Equation took 11103 ms to find 0 implicit places.
Running 954 sub problems to find dead transitions.
[2026-05-26 02:53:01] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1010 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 954 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1010/2064 variables, and 5 constraints, problems are : Problem set: 0 solved, 954 unsolved in 30023 ms.
Refiners :[Generalized P Invariants (flows): 5/56 constraints, State Equation: 0/1060 constraints, PredecessorRefiner: 954/954 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 954 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1010 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 954 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1010 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 954 unsolved
At refinement iteration 2 (OVERLAPS) 50/1060 variables, 51/56 constraints. Problems are: Problem set: 0 solved, 954 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1060/2064 variables, and 56 constraints, problems are : Problem set: 0 solved, 954 unsolved in 30021 ms.
Refiners :[Generalized P Invariants (flows): 56/56 constraints, State Equation: 0/1060 constraints, PredecessorRefiner: 0/954 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60174ms problems are : Problem set: 0 solved, 954 unsolved
Search for dead transitions found 0 dead transitions in 60176ms
Starting structural reductions in LTL mode, iteration 1 : 1060/1077 places, 1004/1019 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 71385 ms. Remains : 1060/1077 places, 1004/1019 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 68 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : HirschbergSinclair-PT-50-LTLCardinality-08
Product exploration explored 100000 steps with 31306 reset in 535 ms.
Product exploration explored 100000 steps with 31708 reset in 563 ms.
Computed a total of 1060 stabilizing places and 1004 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1060 transition count 1004
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 2 factoid took 116 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 2 states, 2 edges and 1 AP (stutter sensitive).
RANDOM walk for 284 steps (0 resets) in 8 ms. (31 steps per ms) remains 0/1 properties
Knowledge based reduction with 2 factoid took 89 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 2 states, 2 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Knowledge-based reduction took 573 ms.
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 1060 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1060/1060 places, 1004/1004 transitions.
Applied a total of 0 rules in 39 ms. Remains 1060 /1060 variables (removed 0) and now considering 1004/1004 (removed 0) transitions.
[2026-05-26 02:54:03] [INFO ] Invariant cache hit.
[2026-05-26 02:54:04] [INFO ] Implicit Places using invariants in 321 ms returned []
[2026-05-26 02:54:04] [INFO ] Invariant cache hit.
[2026-05-26 02:54:14] [INFO ] Implicit Places using invariants and state equation in 10645 ms returned []
Implicit Place search using SMT with State Equation took 10969 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 11009 ms. Remains : 1060/1060 places, 1004/1004 transitions.
Computed a total of 1060 stabilizing places and 1004 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1060 transition count 1004
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 2 factoid took 97 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 2 states, 2 edges and 1 AP (stutter sensitive).
RANDOM walk for 236 steps (0 resets) in 7 ms. (29 steps per ms) remains 0/1 properties
Knowledge based reduction with 2 factoid took 113 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 2 states, 2 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 60 ms :[(NOT p0), (NOT p0)]
Knowledge-based reduction took 533 ms.
Stuttering acceptance computed with spot in 57 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 31205 reset in 532 ms.
Product exploration explored 100000 steps with 32564 reset in 553 ms.
Spot run failed in 81 ms. Status :1
Traceback (most recent call last):
File "/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/autstates.py", line 2, in
import spot
ModuleNotFoundError: No module named 'spot'
java.io.IOException
at fr.lip6.move.gal.application.runner.spot.SpotRunner.computeForwardClosedSI(SpotRunner.java:551)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.treatPartialPOR(LTLPropertySolver.java:419)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:280)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:217)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:66)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:849)
at fr.lip6.move.gal.application.Application.start(Application.java:195)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:219)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:615)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:563)
at org.eclipse.equinox.launcher.Main.run(Main.java:1415)
at org.eclipse.equinox.launcher.Main.main(Main.java:1387)
Built C files in :
/tmp/ltsmin12451089907898381769
[2026-05-26 02:54:16] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12451089907898381769
Running compilation step : cd /tmp/ltsmin12451089907898381769;'/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 1649 ms.
Running link step : cd /tmp/ltsmin12451089907898381769;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin12451089907898381769;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--hoa' '/tmp/stateBased2737743486993629823.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 1060 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1060/1060 places, 1004/1004 transitions.
Applied a total of 0 rules in 39 ms. Remains 1060 /1060 variables (removed 0) and now considering 1004/1004 (removed 0) transitions.
[2026-05-26 02:54:31] [INFO ] Invariant cache hit.
[2026-05-26 02:54:31] [INFO ] Implicit Places using invariants in 317 ms returned []
[2026-05-26 02:54:31] [INFO ] Invariant cache hit.
[2026-05-26 02:54:42] [INFO ] Implicit Places using invariants and state equation in 10644 ms returned []
Implicit Place search using SMT with State Equation took 10963 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 11007 ms. Remains : 1060/1060 places, 1004/1004 transitions.
Built C files in :
/tmp/ltsmin4700162607746821497
[2026-05-26 02:54:42] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4700162607746821497
Running compilation step : cd /tmp/ltsmin4700162607746821497;'/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 1665 ms.
Running link step : cd /tmp/ltsmin4700162607746821497;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin4700162607746821497;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--hoa' '/tmp/stateBased12473888317206222142.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2026-05-26 02:54:57] [INFO ] Flatten gal took : 52 ms
[2026-05-26 02:54:57] [INFO ] Flatten gal took : 30 ms
[2026-05-26 02:54:57] [INFO ] Time to serialize gal into /tmp/LTL12143138969695788558.gal : 8 ms
[2026-05-26 02:54:57] [INFO ] Time to serialize properties into /tmp/LTL16746838178564800781.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12143138969695788558.gal' '-t' 'CGAL' '-hoa' '/tmp/aut15281933548386431945.hoa' '-atoms' '/tmp/LTL16746838178564800781.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...320
Loading property file /tmp/LTL16746838178564800781.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut15281933548386431945.hoa
Detected timeout of ITS tools.
[2026-05-26 02:55:12] [INFO ] Flatten gal took : 23 ms
[2026-05-26 02:55:12] [INFO ] Flatten gal took : 22 ms
[2026-05-26 02:55:12] [INFO ] Time to serialize gal into /tmp/LTL10395611417806050569.gal : 5 ms
[2026-05-26 02:55:12] [INFO ] Time to serialize properties into /tmp/LTL5329292752161203639.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/LTL10395611417806050569.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5329292752161203639.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...276
Read 1 LTL properties
Checking formula 0 : !((X(F("(newmsg36<=rcv_left_reply_32_0_32)"))))
Formula 0 simplified : XG!"(newmsg36<=rcv_left_reply_32_0_32)"
Detected timeout of ITS tools.
[2026-05-26 02:55:27] [INFO ] Flatten gal took : 18 ms
[2026-05-26 02:55:27] [INFO ] Applying decomposition
[2026-05-26 02:55:27] [INFO ] Flatten gal took : 19 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/graph12783941268178694043.txt' '-o' '/tmp/graph12783941268178694043.bin' '-w' '/tmp/graph12783941268178694043.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph12783941268178694043.bin' '-l' '-1' '-v' '-w' '/tmp/graph12783941268178694043.weights' '-q' '0' '-e' '0.001'
[2026-05-26 02:55:27] [INFO ] Decomposing Gal with order
[2026-05-26 02:55:27] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-26 02:55:28] [INFO ] Removed a total of 98 redundant transitions.
[2026-05-26 02:55:28] [INFO ] Flatten gal took : 55 ms
[2026-05-26 02:55:28] [INFO ] Fuse similar labels procedure discarded/fused a total of 15 labels/synchronizations in 6 ms.
[2026-05-26 02:55:28] [INFO ] Time to serialize gal into /tmp/LTL4811075343137551645.gal : 7 ms
[2026-05-26 02:55:28] [INFO ] Time to serialize properties into /tmp/LTL16610335095136468604.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/LTL4811075343137551645.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16610335095136468604.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...276
Read 1 LTL properties
Checking formula 0 : !((X(F("(gu31.newmsg36<=gu31.rcv_left_reply_32_0_32)"))))
Formula 0 simplified : XG!"(gu31.newmsg36<=gu31.rcv_left_reply_32_0_32)"
Detected timeout of ITS tools.
Treatment of property HirschbergSinclair-PT-50-LTLCardinality-08 finished in 172756 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(G(p0))||F(p1))))'
Support contains 4 out of 1077 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1077/1077 places, 1019/1019 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 1075 transition count 1019
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 11 place count 1066 transition count 1010
Iterating global reduction 1 with 9 rules applied. Total rules applied 20 place count 1066 transition count 1010
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 26 place count 1060 transition count 1004
Iterating global reduction 1 with 6 rules applied. Total rules applied 32 place count 1060 transition count 1004
Applied a total of 32 rules in 111 ms. Remains 1060 /1077 variables (removed 17) and now considering 1004/1019 (removed 15) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5550100051834947643.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2514814347886629972.kers'
[2026-05-26 02:55:43] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5550100051834947643.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2514814347886629972.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 1004 rows 1060 cols 3017 entries
Finished phase 1 with 998 SingleSign rule and 6 generalized
[2026-05-26 02:55:43] [INFO ] Computed 56 invariants in 4 ms
Computed 56 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-2514814347886629972.kers
Total runtime 7 ms.
[2026-05-26 02:55:43] [INFO ] Implicit Places using invariants in 352 ms returned []
[2026-05-26 02:55:43] [INFO ] Invariant cache hit.
[2026-05-26 02:55:54] [INFO ] Implicit Places using invariants and state equation in 10794 ms returned []
Implicit Place search using SMT with State Equation took 11153 ms to find 0 implicit places.
Skipped dead transition search.
Starting structural reductions in LTL mode, iteration 1 : 1060/1077 places, 1004/1019 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11265 ms. Remains : 1060/1077 places, 1004/1019 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(G(p0))||F(p1))))'
Stuttering acceptance computed with spot in 164 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : HirschbergSinclair-PT-50-LTLCardinality-09
Product exploration explored 100000 steps with 2010 reset in 660 ms.
Product exploration explored 100000 steps with 1982 reset in 704 ms.
Computed a total of 1060 stabilizing places and 1004 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1060 transition count 1004
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 5 factoid took 139 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
RANDOM walk for 4213 steps (3 resets) in 28 ms. (145 steps per ms) remains 0/4 properties
Knowledge based reduction with 5 factoid took 158 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 146 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Knowledge-based reduction took 756 ms.
Stuttering acceptance computed with spot in 139 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 4 out of 1060 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1060/1060 places, 1004/1004 transitions.
Applied a total of 0 rules in 37 ms. Remains 1060 /1060 variables (removed 0) and now considering 1004/1004 (removed 0) transitions.
[2026-05-26 02:55:56] [INFO ] Invariant cache hit.
[2026-05-26 02:55:57] [INFO ] Implicit Places using invariants in 322 ms returned []
[2026-05-26 02:55:57] [INFO ] Invariant cache hit.
[2026-05-26 02:56:08] [INFO ] Implicit Places using invariants and state equation in 10719 ms returned []
Implicit Place search using SMT with State Equation took 11043 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 11081 ms. Remains : 1060/1060 places, 1004/1004 transitions.
Computed a total of 1060 stabilizing places and 1004 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1060 transition count 1004
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 5 factoid took 129 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
RANDOM walk for 2197 steps (1 resets) in 23 ms. (91 steps per ms) remains 0/4 properties
Knowledge based reduction with 5 factoid took 170 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 133 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Knowledge-based reduction took 701 ms.
Stuttering acceptance computed with spot in 147 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 169 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 2112 reset in 652 ms.
Product exploration explored 100000 steps with 2059 reset in 695 ms.
Spot run failed in 44 ms. Status :1
Traceback (most recent call last):
File "/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/autstates.py", line 2, in
import spot
ModuleNotFoundError: No module named 'spot'
java.io.IOException
at fr.lip6.move.gal.application.runner.spot.SpotRunner.computeForwardClosedSI(SpotRunner.java:551)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.treatPartialPOR(LTLPropertySolver.java:419)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:280)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:217)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:66)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:849)
at fr.lip6.move.gal.application.Application.start(Application.java:195)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:219)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:615)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:563)
at org.eclipse.equinox.launcher.Main.run(Main.java:1415)
at org.eclipse.equinox.launcher.Main.main(Main.java:1387)
Built C files in :
/tmp/ltsmin12678950433143598114
[2026-05-26 02:56:10] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12678950433143598114
Running compilation step : cd /tmp/ltsmin12678950433143598114;'/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 1709 ms.
Running link step : cd /tmp/ltsmin12678950433143598114;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin12678950433143598114;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--hoa' '/tmp/stateBased3502876960657001371.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 1060 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1060/1060 places, 1004/1004 transitions.
Applied a total of 0 rules in 31 ms. Remains 1060 /1060 variables (removed 0) and now considering 1004/1004 (removed 0) transitions.
[2026-05-26 02:56:25] [INFO ] Invariant cache hit.
[2026-05-26 02:56:25] [INFO ] Implicit Places using invariants in 337 ms returned []
[2026-05-26 02:56:25] [INFO ] Invariant cache hit.
[2026-05-26 02:56:36] [INFO ] Implicit Places using invariants and state equation in 10676 ms returned []
Implicit Place search using SMT with State Equation took 11016 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 11047 ms. Remains : 1060/1060 places, 1004/1004 transitions.
Built C files in :
/tmp/ltsmin5900817589014557975
[2026-05-26 02:56:36] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5900817589014557975
Running compilation step : cd /tmp/ltsmin5900817589014557975;'/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 1699 ms.
Running link step : cd /tmp/ltsmin5900817589014557975;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 43 ms.
Running LTSmin : cd /tmp/ltsmin5900817589014557975;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--hoa' '/tmp/stateBased9900518205699873966.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2026-05-26 02:56:51] [INFO ] Flatten gal took : 18 ms
[2026-05-26 02:56:51] [INFO ] Flatten gal took : 17 ms
[2026-05-26 02:56:51] [INFO ] Time to serialize gal into /tmp/LTL14695644160844998676.gal : 7 ms
[2026-05-26 02:56:51] [INFO ] Time to serialize properties into /tmp/LTL3447853046654593987.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14695644160844998676.gal' '-t' 'CGAL' '-hoa' '/tmp/aut17147148501607702202.hoa' '-atoms' '/tmp/LTL3447853046654593987.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...319
Loading property file /tmp/LTL3447853046654593987.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut17147148501607702202.hoa
Detected timeout of ITS tools.
[2026-05-26 02:57:06] [INFO ] Flatten gal took : 18 ms
[2026-05-26 02:57:06] [INFO ] Flatten gal took : 18 ms
[2026-05-26 02:57:06] [INFO ] Time to serialize gal into /tmp/LTL3314612490475037386.gal : 4 ms
[2026-05-26 02:57:06] [INFO ] Time to serialize properties into /tmp/LTL7568768503065447611.ltl : 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/LTL3314612490475037386.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7568768503065447611.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 : !((X((X(G("(rcv_left_reply_37_0_37<=rcv_left_reply_50_5_44)")))||(F("(newmsg8>election_50_6_9_to_left_42)")))))
Formula 0 simplified : X(XF!"(rcv_left_reply_37_0_37<=rcv_left_reply_50_5_44)" & G!"(newmsg8>election_50_6_9_to_left_42)")
Detected timeout of ITS tools.
[2026-05-26 02:57:21] [INFO ] Flatten gal took : 19 ms
[2026-05-26 02:57:21] [INFO ] Applying decomposition
[2026-05-26 02:57:21] [INFO ] Flatten gal took : 16 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/graph1801224075424681321.txt' '-o' '/tmp/graph1801224075424681321.bin' '-w' '/tmp/graph1801224075424681321.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph1801224075424681321.bin' '-l' '-1' '-v' '-w' '/tmp/graph1801224075424681321.weights' '-q' '0' '-e' '0.001'
[2026-05-26 02:57:21] [INFO ] Decomposing Gal with order
[2026-05-26 02:57:21] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-26 02:57:21] [INFO ] Removed a total of 118 redundant transitions.
[2026-05-26 02:57:21] [INFO ] Flatten gal took : 44 ms
[2026-05-26 02:57:21] [INFO ] Fuse similar labels procedure discarded/fused a total of 26 labels/synchronizations in 20 ms.
[2026-05-26 02:57:22] [INFO ] Time to serialize gal into /tmp/LTL7464294183708189132.gal : 7 ms
[2026-05-26 02:57:22] [INFO ] Time to serialize properties into /tmp/LTL12845901042353914557.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/LTL7464294183708189132.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12845901042353914557.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...276
Read 1 LTL properties
Checking formula 0 : !((X((X(G("(gu88.rcv_left_reply_37_0_37<=gu88.rcv_left_reply_50_5_44)")))||(F("(gu102.newmsg8>gu102.election_50_6_9_to_left_42)")))))
Formula 0 simplified : X(XF!"(gu88.rcv_left_reply_37_0_37<=gu88.rcv_left_reply_50_5_44)" & G!"(gu102.newmsg8>gu102.election_50_6_9_to_left_42)")
Detected timeout of ITS tools.
Treatment of property HirschbergSinclair-PT-50-LTLCardinality-09 finished in 113877 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 1077 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1077/1077 places, 1019/1019 transitions.
Graph (complete) has 2041 edges and 1077 vertex of which 1075 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.4 ms
Discarding 2 places :
Also discarding 0 output transitions
Reduce places removed 50 places and 50 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 448 transitions
Trivial Post-agglo rules discarded 448 transitions
Performed 448 trivial Post agglomeration. Transition count delta: 448
Iterating post reduction 0 with 448 rules applied. Total rules applied 449 place count 1025 transition count 521
Reduce places removed 448 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 450 rules applied. Total rules applied 899 place count 577 transition count 519
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 901 place count 575 transition count 519
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 911 place count 565 transition count 509
Iterating global reduction 3 with 10 rules applied. Total rules applied 921 place count 565 transition count 509
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 3 with 3 rules applied. Total rules applied 924 place count 565 transition count 506
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 927 place count 562 transition count 506
Applied a total of 927 rules in 43 ms. Remains 562 /1077 variables (removed 515) and now considering 506/1019 (removed 513) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4071871113571666847.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14205343179654223593.kers'
[2026-05-26 02:57:37] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4071871113571666847.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14205343179654223593.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 506 rows 562 cols 1028 entries
Finished phase 1 with 500 SingleSign rule and 6 generalized
[2026-05-26 02:57:37] [INFO ] Computed 56 invariants in 7 ms
Computed 56 P flows in 8 ms.
Exported basis to /tmp/petrispot-output-14205343179654223593.kers
Total runtime 9 ms.
[2026-05-26 02:57:37] [INFO ] Implicit Places using invariants in 764 ms returned []
[2026-05-26 02:57:37] [INFO ] Invariant cache hit.
[2026-05-26 02:57:53] [INFO ] Implicit Places using invariants and state equation in 15260 ms returned []
Implicit Place search using SMT with State Equation took 16025 ms to find 0 implicit places.
[2026-05-26 02:57:53] [INFO ] Redundant transitions in 3 ms returned []
Running 407 sub problems to find dead transitions.
[2026-05-26 02:57:53] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/463 variables, 53/53 constraints. Problems are: Problem set: 0 solved, 407 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/463 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 407 unsolved
At refinement iteration 2 (OVERLAPS) 2/465 variables, 3/56 constraints. Problems are: Problem set: 0 solved, 407 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/465 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 407 unsolved
At refinement iteration 4 (OVERLAPS) 409/874 variables, 465/521 constraints. Problems are: Problem set: 0 solved, 407 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 874/1068 variables, and 521 constraints, problems are : Problem set: 0 solved, 407 unsolved in 30021 ms.
Refiners :[Generalized P Invariants (flows): 56/56 constraints, State Equation: 465/562 constraints, PredecessorRefiner: 407/407 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 407 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/463 variables, 53/53 constraints. Problems are: Problem set: 0 solved, 407 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/463 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 407 unsolved
At refinement iteration 2 (OVERLAPS) 2/465 variables, 3/56 constraints. Problems are: Problem set: 0 solved, 407 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/465 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 407 unsolved
At refinement iteration 4 (OVERLAPS) 409/874 variables, 465/521 constraints. Problems are: Problem set: 0 solved, 407 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/874 variables, 407/928 constraints. Problems are: Problem set: 0 solved, 407 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 874/1068 variables, and 928 constraints, problems are : Problem set: 0 solved, 407 unsolved in 30023 ms.
Refiners :[Generalized P Invariants (flows): 56/56 constraints, State Equation: 465/562 constraints, PredecessorRefiner: 407/407 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60071ms problems are : Problem set: 0 solved, 407 unsolved
Search for dead transitions found 0 dead transitions in 60072ms
Starting structural reductions in SI_LTL mode, iteration 1 : 562/1077 places, 506/1019 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 76154 ms. Remains : 562/1077 places, 506/1019 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Running random walk in product with property : HirschbergSinclair-PT-50-LTLCardinality-10
Product exploration explored 100000 steps with 326 reset in 392 ms.
Product exploration explored 100000 steps with 326 reset in 423 ms.
Computed a total of 562 stabilizing places and 506 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 562 transition count 506
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge based reduction with 4 factoid took 44 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
RANDOM walk for 1316 steps (0 resets) in 10 ms. (119 steps per ms) remains 0/1 properties
Knowledge based reduction with 4 factoid took 68 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 33 ms :[(NOT p0)]
[2026-05-26 02:58:54] [INFO ] Invariant cache hit.
[2026-05-26 02:58:55] [INFO ] [Real]Absence check using 0 positive and 56 generalized place invariants in 411 ms returned sat
[2026-05-26 02:59:09] [INFO ] [Real]Absence check using state equation in 14318 ms returned unknown
Could not prove EG (NOT p0)
Knowledge-based reduction took 15327 ms.
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Support contains 2 out of 562 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 562/562 places, 506/506 transitions.
Applied a total of 0 rules in 21 ms. Remains 562 /562 variables (removed 0) and now considering 506/506 (removed 0) transitions.
[2026-05-26 02:59:09] [INFO ] Invariant cache hit.
[2026-05-26 02:59:10] [INFO ] Implicit Places using invariants in 763 ms returned []
[2026-05-26 02:59:10] [INFO ] Invariant cache hit.
[2026-05-26 02:59:25] [INFO ] Implicit Places using invariants and state equation in 15139 ms returned []
Implicit Place search using SMT with State Equation took 15904 ms to find 0 implicit places.
[2026-05-26 02:59:25] [INFO ] Redundant transitions in 3 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 15935 ms. Remains : 562/562 places, 506/506 transitions.
Computed a total of 562 stabilizing places and 506 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 562 transition count 506
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 37 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 1317 steps (0 resets) in 14 ms. (87 steps per ms) remains 0/1 properties
Knowledge based reduction with 4 factoid took 65 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 46 ms :[(NOT p0)]
[2026-05-26 02:59:25] [INFO ] Invariant cache hit.
[2026-05-26 02:59:26] [INFO ] [Real]Absence check using 0 positive and 56 generalized place invariants in 414 ms returned sat
[2026-05-26 02:59:40] [INFO ] [Real]Absence check using state equation in 14311 ms returned unknown
Could not prove EG (NOT p0)
Knowledge-based reduction took 15328 ms.
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Product exploration explored 100000 steps with 326 reset in 387 ms.
Product exploration explored 100000 steps with 327 reset in 439 ms.
Built C files in :
/tmp/ltsmin1428414997604774126
[2026-05-26 02:59:41] [INFO ] Computing symmetric may disable matrix : 506 transitions.
[2026-05-26 02:59:41] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-26 02:59:41] [INFO ] Computing symmetric may enable matrix : 506 transitions.
[2026-05-26 02:59:41] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-26 02:59:41] [INFO ] Computing Do-Not-Accords matrix : 506 transitions.
[2026-05-26 02:59:41] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-26 02:59:41] [INFO ] Built C files in 46ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1428414997604774126
Running compilation step : cd /tmp/ltsmin1428414997604774126;'/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 1153 ms.
Running link step : cd /tmp/ltsmin1428414997604774126;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin1428414997604774126;'/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/stateBased10687875459887654136.hoa' '--buchi-type=spotba'
LTSmin run took 4114 ms.
FORMULA HirschbergSinclair-PT-50-LTLCardinality-10 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property HirschbergSinclair-PT-50-LTLCardinality-10 finished in 129989 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))&&(p0 U p1)))'
Support contains 4 out of 1077 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1077/1077 places, 1019/1019 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 1075 transition count 1019
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 12 place count 1065 transition count 1009
Iterating global reduction 1 with 10 rules applied. Total rules applied 22 place count 1065 transition count 1009
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 29 place count 1058 transition count 1002
Iterating global reduction 1 with 7 rules applied. Total rules applied 36 place count 1058 transition count 1002
Applied a total of 36 rules in 101 ms. Remains 1058 /1077 variables (removed 19) and now considering 1002/1019 (removed 17) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3131888449829388093.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8955929054643911713.kers'
[2026-05-26 02:59:47] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3131888449829388093.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8955929054643911713.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 1002 rows 1058 cols 3012 entries
Finished phase 1 with 996 SingleSign rule and 6 generalized
[2026-05-26 02:59:47] [INFO ] Computed 56 invariants in 4 ms
Computed 56 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-8955929054643911713.kers
Total runtime 6 ms.
[2026-05-26 02:59:47] [INFO ] Implicit Places using invariants in 347 ms returned []
[2026-05-26 02:59:47] [INFO ] Invariant cache hit.
[2026-05-26 02:59:59] [INFO ] Implicit Places using invariants and state equation in 11746 ms returned []
Implicit Place search using SMT with State Equation took 12095 ms to find 0 implicit places.
Running 952 sub problems to find dead transitions.
[2026-05-26 02:59:59] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1008 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 952 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1008/2060 variables, and 5 constraints, problems are : Problem set: 0 solved, 952 unsolved in 30021 ms.
Refiners :[Generalized P Invariants (flows): 5/56 constraints, State Equation: 0/1058 constraints, PredecessorRefiner: 952/952 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 952 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1008 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 952 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1008 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 952 unsolved
At refinement iteration 2 (OVERLAPS) 50/1058 variables, 51/56 constraints. Problems are: Problem set: 0 solved, 952 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1058/2060 variables, and 56 constraints, problems are : Problem set: 0 solved, 952 unsolved in 30021 ms.
Refiners :[Generalized P Invariants (flows): 56/56 constraints, State Equation: 0/1058 constraints, PredecessorRefiner: 0/952 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60159ms problems are : Problem set: 0 solved, 952 unsolved
Search for dead transitions found 0 dead transitions in 60165ms
Starting structural reductions in LTL mode, iteration 1 : 1058/1077 places, 1002/1019 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 72366 ms. Remains : 1058/1077 places, 1002/1019 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))&&(p0 U p1)))'
Stuttering acceptance computed with spot in 135 ms :[(OR (NOT p0) (NOT p1)), true, (NOT p0), (NOT p1)]
Running random walk in product with property : HirschbergSinclair-PT-50-LTLCardinality-15
Product exploration explored 100000 steps with 27291 reset in 553 ms.
Product exploration explored 100000 steps with 27695 reset in 579 ms.
Computed a total of 1058 stabilizing places and 1002 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1058 transition count 1002
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 9 factoid took 96 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 2 states, 2 edges and 1 AP (stutter sensitive).
RANDOM walk for 200 steps (0 resets) in 6 ms. (28 steps per ms) remains 0/1 properties
Knowledge based reduction with 9 factoid took 87 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 2 states, 2 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 94 ms :[(NOT p0), (NOT p0)]
Knowledge-based reduction took 533 ms.
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 1058 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 1058/1058 places, 1002/1002 transitions.
Applied a total of 0 rules in 41 ms. Remains 1058 /1058 variables (removed 0) and now considering 1002/1002 (removed 0) transitions.
[2026-05-26 03:01:01] [INFO ] Invariant cache hit.
[2026-05-26 03:01:01] [INFO ] Implicit Places using invariants in 326 ms returned []
[2026-05-26 03:01:01] [INFO ] Invariant cache hit.
[2026-05-26 03:01:13] [INFO ] Implicit Places using invariants and state equation in 11614 ms returned []
Implicit Place search using SMT with State Equation took 11942 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 11984 ms. Remains : 1058/1058 places, 1002/1002 transitions.
Computed a total of 1058 stabilizing places and 1002 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1058 transition count 1002
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 2 factoid took 94 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 2 states, 2 edges and 1 AP (stutter sensitive).
RANDOM walk for 194 steps (0 resets) in 5 ms. (32 steps per ms) remains 0/1 properties
Knowledge based reduction with 2 factoid took 112 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 2 states, 2 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Knowledge-based reduction took 536 ms.
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 83 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 27159 reset in 550 ms.
Product exploration explored 100000 steps with 28294 reset in 568 ms.
Spot run failed in 36 ms. Status :1
Traceback (most recent call last):
File "/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/autstates.py", line 2, in
import spot
ModuleNotFoundError: No module named 'spot'
java.io.IOException
at fr.lip6.move.gal.application.runner.spot.SpotRunner.computeForwardClosedSI(SpotRunner.java:551)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.treatPartialPOR(LTLPropertySolver.java:419)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:280)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:217)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:66)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:849)
at fr.lip6.move.gal.application.Application.start(Application.java:195)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:219)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:615)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:563)
at org.eclipse.equinox.launcher.Main.run(Main.java:1415)
at org.eclipse.equinox.launcher.Main.main(Main.java:1387)
Built C files in :
/tmp/ltsmin423853787798959590
[2026-05-26 03:01:15] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin423853787798959590
Running compilation step : cd /tmp/ltsmin423853787798959590;'/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 1656 ms.
Running link step : cd /tmp/ltsmin423853787798959590;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin423853787798959590;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--hoa' '/tmp/stateBased747139165403061233.hoa' '--buchi-type=spotba'
LTSmin run took 560 ms.
FORMULA HirschbergSinclair-PT-50-LTLCardinality-15 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property HirschbergSinclair-PT-50-LTLCardinality-15 finished in 90423 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((F(G((p0 U p1)))&&G(p2))))'
Spot run failed in 37 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.
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)))'
Spot run failed in 40 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.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(G(p0))||F(p1))))'
Spot run failed in 42 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 03:01:17] [INFO ] Flatten gal took : 16 ms
Using solver Z3 to compute partial order matrices.
[2026-05-26 03:01:17] [INFO ] Applying decomposition
Built C files in :
/tmp/ltsmin1981539864920539754
[2026-05-26 03:01:17] [INFO ] Computing symmetric may disable matrix : 1019 transitions.
[2026-05-26 03:01:17] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-26 03:01:17] [INFO ] Computing symmetric may enable matrix : 1019 transitions.
[2026-05-26 03:01:17] [INFO ] Flatten gal took : 16 ms
[2026-05-26 03:01:17] [INFO ] Computation of Complete enable matrix. took 18 ms. Total solver calls (SAT/UNSAT): 0(0/0)
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/graph9077052795950717758.txt' '-o' '/tmp/graph9077052795950717758.bin' '-w' '/tmp/graph9077052795950717758.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph9077052795950717758.bin' '-l' '-1' '-v' '-w' '/tmp/graph9077052795950717758.weights' '-q' '0' '-e' '0.001'
[2026-05-26 03:01:17] [INFO ] Decomposing Gal with order
[2026-05-26 03:01:17] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-26 03:01:17] [INFO ] Removed a total of 142 redundant transitions.
[2026-05-26 03:01:17] [INFO ] Flatten gal took : 40 ms
[2026-05-26 03:01:17] [INFO ] Fuse similar labels procedure discarded/fused a total of 61 labels/synchronizations in 23 ms.
[2026-05-26 03:01:17] [INFO ] Computing Do-Not-Accords matrix : 1019 transitions.
[2026-05-26 03:01:17] [INFO ] Computation of Completed DNA matrix. took 9 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-26 03:01:17] [INFO ] Built C files in 261ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1981539864920539754
Running compilation step : cd /tmp/ltsmin1981539864920539754;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '240' '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 03:01:17] [INFO ] Time to serialize gal into /tmp/LTLCardinality3013236224501424160.gal : 8 ms
[2026-05-26 03:01:17] [INFO ] Time to serialize properties into /tmp/LTLCardinality399449637810199814.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/LTLCardinality3013236224501424160.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality399449637810199814.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...296
Read 3 LTL properties
Checking formula 0 : !((F((F(G(("(gi0.gi0.gi2.gi0.gu84.rcv_left_election_50_3_2_2>=1)")U("(gu119.rcv_right_election_50_6_9_41<=gu119.election_37_0_1_to_lef...236
Formula 0 simplified : GF(!"(gu118.election_50_6_9_to_left_42<=gu118.reply_36_0_left36)" | GF(!"(gi0.gi0.gi2.gi0.gu84.rcv_left_election_50_3_2_2>=1)" R !"(...227
Compilation finished in 3028 ms.
Running link step : cd /tmp/ltsmin1981539864920539754;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 52 ms.
Running LTSmin : cd /tmp/ltsmin1981539864920539754;'/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' '<>((<>([](((LTLAPp0==true) U (LTLAPp1==true))))&&[]((LTLAPp2==true))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>400 s) on command cd /tmp/ltsmin1981539864920539754;'/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' '<>((<>([](((LTLAPp0==true) U (LTLAPp1==true))))&&[]((LTLAPp2==true))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin1981539864920539754;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--ltl' 'X(<>((LTLAPp3==true)))' '--buchi-type=spotba'
Reverse transition relation is NOT exact ! Due to transitions gu30.t201, gu118.t77, gi0.gi0.gi1.gi0.gu33.t226, gi0.gi0.gi1.gi0.gu33.t232, gi0.gi0.gi1.gi0.g...3406
Computing Next relation with stutter on 6.59924e+36 deadlock states
WARNING : LTSmin timed out (>400 s) on command cd /tmp/ltsmin1981539864920539754;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--ltl' 'X(<>((LTLAPp3==true)))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin1981539864920539754;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--ltl' 'X((X([]((LTLAPp4==true)))||<>((LTLAPp5==true))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>400 s) on command cd /tmp/ltsmin1981539864920539754;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--ltl' 'X((X([]((LTLAPp4==true)))||<>((LTLAPp5==true))))' '--buchi-type=spotba'
Retrying LTSmin with larger timeout 9600 s
Running LTSmin : cd /tmp/ltsmin1981539864920539754;'/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' '<>((<>([](((LTLAPp0==true) U (LTLAPp1==true))))&&[]((LTLAPp2==true))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2026-05-26 03:27:31] [INFO ] Flatten gal took : 16 ms
[2026-05-26 03:27:31] [INFO ] Time to serialize gal into /tmp/LTLCardinality8214569093950139175.gal : 4 ms
[2026-05-26 03:27:31] [INFO ] Time to serialize properties into /tmp/LTLCardinality11994164260756208551.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/LTLCardinality8214569093950139175.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality11994164260756208551.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...298
Read 3 LTL properties
Checking formula 0 : !((F((F(G(("(rcv_left_election_50_3_2_2>=1)")U("(rcv_right_election_50_6_9_41<=election_37_0_1_to_left_37)"))))&&(G("(election_50_6_9_...191
Formula 0 simplified : GF(!"(election_50_6_9_to_left_42<=reply_36_0_left36)" | GF(!"(rcv_left_election_50_3_2_2>=1)" R !"(rcv_right_election_50_6_9_41<=ele...182
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...969
Computing Next relation with stutter on 6.59924e+36 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
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -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 LTLCardinality -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-50"
export BK_EXAMINATION="LTLCardinality"
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-50, examination is LTLCardinality"
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-177961074400803"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/HirschbergSinclair-PT-50.tgz
mv HirschbergSinclair-PT-50 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.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 [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;