About the Execution of ITS-Tools for FireWire-PT-15
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 0.000 | 622097.00 | 0.00 | 0.00 | FFFFTFFFTFTFFFFT | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r086-smll-174860102400355.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5832
Executing tool itstools
Input is FireWire-PT-15, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r086-smll-174860102400355
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 476K
-rw-r--r-- 1 mcc users 6.0K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 62K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.7K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 61K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 10K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 91K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 3 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 90K May 29 14:32 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
echo here is the order used to build the result vector(from xml file)
FORMULA_NAME FireWire-PT-15-LTLCardinality-00
FORMULA_NAME FireWire-PT-15-LTLCardinality-01
FORMULA_NAME FireWire-PT-15-LTLCardinality-02
FORMULA_NAME FireWire-PT-15-LTLCardinality-03
FORMULA_NAME FireWire-PT-15-LTLCardinality-04
FORMULA_NAME FireWire-PT-15-LTLCardinality-05
FORMULA_NAME FireWire-PT-15-LTLCardinality-06
FORMULA_NAME FireWire-PT-15-LTLCardinality-07
FORMULA_NAME FireWire-PT-15-LTLCardinality-08
FORMULA_NAME FireWire-PT-15-LTLCardinality-09
FORMULA_NAME FireWire-PT-15-LTLCardinality-10
FORMULA_NAME FireWire-PT-15-LTLCardinality-11
FORMULA_NAME FireWire-PT-15-LTLCardinality-12
FORMULA_NAME FireWire-PT-15-LTLCardinality-13
FORMULA_NAME FireWire-PT-15-LTLCardinality-14
FORMULA_NAME FireWire-PT-15-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1748885499594
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FireWire-PT-15
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202505121319
[2025-06-02 17:31:42] [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]
[2025-06-02 17:31:42] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-02 17:31:42] [INFO ] Load time of PNML (sax parser for PT used): 191 ms
[2025-06-02 17:31:42] [INFO ] Transformed 248 places.
[2025-06-02 17:31:42] [INFO ] Transformed 383 transitions.
[2025-06-02 17:31:42] [INFO ] Found NUPN structural information;
[2025-06-02 17:31:42] [INFO ] Parsed PT model containing 248 places and 383 transitions and 1144 arcs in 430 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 26 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Initial state reduction rules removed 1 formulas.
FORMULA FireWire-PT-15-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-15-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-15-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-15-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-15-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-15-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-15-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-15-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-15-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-15-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-15-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 15 out of 248 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 248/248 places, 383/383 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 244 transition count 383
Discarding 58 places :
Symmetric choice reduction at 1 with 58 rule applications. Total rules 62 place count 186 transition count 325
Iterating global reduction 1 with 58 rules applied. Total rules applied 120 place count 186 transition count 325
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 133 place count 173 transition count 281
Iterating global reduction 1 with 13 rules applied. Total rules applied 146 place count 173 transition count 281
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 147 place count 173 transition count 280
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 149 place count 171 transition count 277
Iterating global reduction 2 with 2 rules applied. Total rules applied 151 place count 171 transition count 277
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 152 place count 170 transition count 274
Iterating global reduction 2 with 1 rules applied. Total rules applied 153 place count 170 transition count 274
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 154 place count 169 transition count 272
Iterating global reduction 2 with 1 rules applied. Total rules applied 155 place count 169 transition count 272
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 156 place count 168 transition count 269
Iterating global reduction 2 with 1 rules applied. Total rules applied 157 place count 168 transition count 269
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 158 place count 167 transition count 267
Iterating global reduction 2 with 1 rules applied. Total rules applied 159 place count 167 transition count 267
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 160 place count 166 transition count 264
Iterating global reduction 2 with 1 rules applied. Total rules applied 161 place count 166 transition count 264
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 162 place count 165 transition count 262
Iterating global reduction 2 with 1 rules applied. Total rules applied 163 place count 165 transition count 262
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 164 place count 164 transition count 259
Iterating global reduction 2 with 1 rules applied. Total rules applied 165 place count 164 transition count 259
Applied a total of 165 rules in 137 ms. Remains 164 /248 variables (removed 84) and now considering 259/383 (removed 124) transitions.
// Phase 1: matrix 259 rows 164 cols
[2025-06-02 17:31:43] [INFO ] Computed 4 invariants in 31 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:31:44] [INFO ] Implicit Places using invariants in 645 ms returned []
[2025-06-02 17:31:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:31:44] [INFO ] Implicit Places using invariants and state equation in 498 ms returned []
Implicit Place search using SMT with State Equation took 1224 ms to find 0 implicit places.
Running 258 sub problems to find dead transitions.
[2025-06-02 17:31:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/162 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 1 (OVERLAPS) 1/163 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 258 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:31:50] [INFO ] Deduced a trap composed of 80 places in 793 ms of which 55 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:31:51] [INFO ] Deduced a trap composed of 84 places in 155 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:31:51] [INFO ] Deduced a trap composed of 87 places in 164 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:31:51] [INFO ] Deduced a trap composed of 36 places in 181 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:31:52] [INFO ] Deduced a trap composed of 38 places in 169 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:31:52] [INFO ] Deduced a trap composed of 93 places in 144 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:31:52] [INFO ] Deduced a trap composed of 99 places in 141 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:31:53] [INFO ] Deduced a trap composed of 60 places in 176 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:31:53] [INFO ] Deduced a trap composed of 90 places in 151 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:31:53] [INFO ] Deduced a trap composed of 83 places in 175 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:31:53] [INFO ] Deduced a trap composed of 96 places in 169 ms of which 21 ms to minimize.
Problem TDEAD130 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:31:54] [INFO ] Deduced a trap composed of 43 places in 195 ms of which 31 ms to minimize.
Problem TDEAD136 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD183 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD223 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD238 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/163 variables, 12/16 constraints. Problems are: Problem set: 15 solved, 243 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:31:55] [INFO ] Deduced a trap composed of 92 places in 138 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:31:56] [INFO ] Deduced a trap composed of 61 places in 214 ms of which 19 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/163 variables, 2/18 constraints. Problems are: Problem set: 15 solved, 243 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/163 variables, 0/18 constraints. Problems are: Problem set: 15 solved, 243 unsolved
At refinement iteration 5 (OVERLAPS) 259/422 variables, 163/181 constraints. Problems are: Problem set: 15 solved, 243 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:32:03] [INFO ] Deduced a trap composed of 50 places in 180 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:32:05] [INFO ] Deduced a trap composed of 94 places in 135 ms of which 16 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/422 variables, 2/183 constraints. Problems are: Problem set: 15 solved, 243 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 422/423 variables, and 183 constraints, problems are : Problem set: 15 solved, 243 unsolved in 30053 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 163/164 constraints, PredecessorRefiner: 258/258 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 15 solved, 243 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/162 variables, 0/0 constraints. Problems are: Problem set: 15 solved, 243 unsolved
At refinement iteration 1 (OVERLAPS) 1/163 variables, 4/4 constraints. Problems are: Problem set: 15 solved, 243 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/163 variables, 16/20 constraints. Problems are: Problem set: 15 solved, 243 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:32:18] [INFO ] Deduced a trap composed of 94 places in 138 ms of which 12 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/163 variables, 1/21 constraints. Problems are: Problem set: 15 solved, 243 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:32:20] [INFO ] Deduced a trap composed of 91 places in 182 ms of which 23 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/163 variables, 1/22 constraints. Problems are: Problem set: 15 solved, 243 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/163 variables, 0/22 constraints. Problems are: Problem set: 15 solved, 243 unsolved
At refinement iteration 6 (OVERLAPS) 259/422 variables, 163/185 constraints. Problems are: Problem set: 15 solved, 243 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/422 variables, 240/425 constraints. Problems are: Problem set: 15 solved, 243 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:32:29] [INFO ] Deduced a trap composed of 22 places in 108 ms of which 4 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/422 variables, 1/426 constraints. Problems are: Problem set: 15 solved, 243 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:32:43] [INFO ] Deduced a trap along path composed of 7 places in 67 ms of which 14 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 422/423 variables, and 427 constraints, problems are : Problem set: 15 solved, 243 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 163/164 constraints, PredecessorRefiner: 240/258 constraints, Known Traps: 19/19 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 60298ms problems are : Problem set: 15 solved, 243 unsolved
Search for dead transitions found 15 dead transitions in 60325ms
Found 15 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 15 transitions
Dead transitions reduction (with SMT) removed 15 transitions
Starting structural reductions in LTL mode, iteration 1 : 164/248 places, 244/383 transitions.
Applied a total of 0 rules in 7 ms. Remains 164 /164 variables (removed 0) and now considering 244/244 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 61730 ms. Remains : 164/248 places, 244/383 transitions.
Support contains 15 out of 164 places after structural reductions.
[2025-06-02 17:32:45] [INFO ] Flatten gal took : 109 ms
[2025-06-02 17:32:45] [INFO ] Flatten gal took : 77 ms
[2025-06-02 17:32:45] [INFO ] Input system was already deterministic with 244 transitions.
RANDOM walk for 40000 steps (10 resets) in 2187 ms. (18 steps per ms) remains 8/11 properties
BEST_FIRST walk for 40000 steps (11 resets) in 570 ms. (70 steps per ms) remains 7/8 properties
BEST_FIRST walk for 40000 steps (18 resets) in 465 ms. (85 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40000 steps (14 resets) in 245 ms. (162 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40000 steps (10 resets) in 239 ms. (166 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40000 steps (10 resets) in 287 ms. (138 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40000 steps (9 resets) in 214 ms. (186 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40000 steps (8 resets) in 316 ms. (126 steps per ms) remains 7/7 properties
// Phase 1: matrix 244 rows 164 cols
[2025-06-02 17:32:47] [INFO ] Computed 4 invariants in 7 ms
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 125/134 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/134 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 19/153 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/153 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 235/388 variables, 153/157 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/388 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 8/396 variables, 5/162 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/396 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (OVERLAPS) 8/404 variables, 3/165 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/404 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (OVERLAPS) 4/408 variables, 3/168 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/408 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (OVERLAPS) 0/408 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 408/408 variables, and 168 constraints, problems are : Problem set: 0 solved, 7 unsolved in 647 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 164/164 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 125/134 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:32:48] [INFO ] Deduced a trap composed of 85 places in 135 ms of which 13 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/134 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/134 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 19/153 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:32:48] [INFO ] Deduced a trap composed of 81 places in 133 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:32:48] [INFO ] Deduced a trap composed of 81 places in 153 ms of which 23 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/153 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/153 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 235/388 variables, 153/160 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/388 variables, 5/165 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:32:48] [INFO ] Deduced a trap composed of 85 places in 88 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:32:48] [INFO ] Deduced a trap composed of 87 places in 97 ms of which 12 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/388 variables, 2/167 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:32:49] [INFO ] Deduced a trap composed of 41 places in 116 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:32:49] [INFO ] Deduced a trap composed of 50 places in 138 ms of which 23 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/388 variables, 2/169 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/388 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (OVERLAPS) 8/396 variables, 5/174 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/396 variables, 2/176 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/396 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 15 (OVERLAPS) 8/404 variables, 3/179 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/404 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 17 (OVERLAPS) 4/408 variables, 3/182 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/408 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 19 (OVERLAPS) 0/408 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 408/408 variables, and 182 constraints, problems are : Problem set: 0 solved, 7 unsolved in 2710 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 164/164 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3379ms problems are : Problem set: 0 solved, 7 unsolved
Fused 7 Parikh solutions to 6 different solutions.
Parikh walk visited 1 properties in 2050 ms.
Support contains 8 out of 164 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 164/164 places, 244/244 transitions.
Graph (trivial) has 114 edges and 164 vertex of which 11 / 164 are part of one of the 3 SCC in 3 ms
Free SCC test removed 8 places
Drop transitions (Empty/Sink Transition effects.) removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Graph (complete) has 427 edges and 156 vertex of which 155 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 16 rules applied. Total rules applied 18 place count 155 transition count 216
Reduce places removed 16 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 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 1 with 19 rules applied. Total rules applied 37 place count 139 transition count 213
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 38 place count 138 transition count 213
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 13 Pre rules applied. Total rules applied 38 place count 138 transition count 200
Deduced a syphon composed of 13 places in 1 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 26 rules applied. Total rules applied 64 place count 125 transition count 200
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 66 place count 123 transition count 198
Iterating global reduction 3 with 2 rules applied. Total rules applied 68 place count 123 transition count 198
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 68 place count 123 transition count 197
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 70 place count 122 transition count 197
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 72 place count 120 transition count 193
Iterating global reduction 3 with 2 rules applied. Total rules applied 74 place count 120 transition count 193
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 76 place count 118 transition count 191
Iterating global reduction 3 with 2 rules applied. Total rules applied 78 place count 118 transition count 191
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 79 place count 118 transition count 190
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 80 place count 117 transition count 188
Iterating global reduction 4 with 1 rules applied. Total rules applied 81 place count 117 transition count 188
Performed 15 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 15 places in 1 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 4 with 30 rules applied. Total rules applied 111 place count 102 transition count 172
Performed 16 Post agglomeration using F-continuation condition with reduction of 4 identical transitions.
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 4 with 32 rules applied. Total rules applied 143 place count 86 transition count 243
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 146 place count 86 transition count 240
Drop transitions (Redundant composition of simpler transitions.) removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 5 with 14 rules applied. Total rules applied 160 place count 86 transition count 226
Free-agglomeration rule applied 6 times.
Iterating global reduction 5 with 6 rules applied. Total rules applied 166 place count 86 transition count 220
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 172 place count 80 transition count 220
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 174 place count 78 transition count 218
Iterating global reduction 6 with 2 rules applied. Total rules applied 176 place count 78 transition count 218
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 6 with 5 rules applied. Total rules applied 181 place count 78 transition count 213
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 182 place count 78 transition count 213
Applied a total of 182 rules in 137 ms. Remains 78 /164 variables (removed 86) and now considering 213/244 (removed 31) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 137 ms. Remains : 78/164 places, 213/244 transitions.
RANDOM walk for 40000 steps (4001 resets) in 458 ms. (87 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (1287 resets) in 214 ms. (186 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (1260 resets) in 216 ms. (184 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (1269 resets) in 178 ms. (223 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (1284 resets) in 196 ms. (203 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (1289 resets) in 161 ms. (246 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (1293 resets) in 177 ms. (224 steps per ms) remains 6/6 properties
Finished probabilistic random walk after 16559 steps, run visited all 6 properties in 182 ms. (steps per millisecond=90 )
Probabilistic random walk after 16559 steps, saw 6066 distinct states, run finished after 187 ms. (steps per millisecond=88 ) properties seen :6
Computed a total of 36 stabilizing places and 47 stable transitions
Graph (complete) has 441 edges and 164 vertex of which 163 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.7 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G((X(X(p0))||F((p1 U (p2||G(p1)))))))))'
Support contains 5 out of 164 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 164/164 places, 244/244 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 160 transition count 239
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 160 transition count 239
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 9 place count 160 transition count 238
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 11 place count 158 transition count 234
Iterating global reduction 1 with 2 rules applied. Total rules applied 13 place count 158 transition count 234
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 15 place count 156 transition count 231
Iterating global reduction 1 with 2 rules applied. Total rules applied 17 place count 156 transition count 231
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 18 place count 155 transition count 229
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 155 transition count 229
Applied a total of 19 rules in 12 ms. Remains 155 /164 variables (removed 9) and now considering 229/244 (removed 15) transitions.
// Phase 1: matrix 229 rows 155 cols
[2025-06-02 17:32:53] [INFO ] Computed 4 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:32:53] [INFO ] Implicit Places using invariants in 128 ms returned []
[2025-06-02 17:32:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:32:54] [INFO ] Implicit Places using invariants and state equation in 338 ms returned []
Implicit Place search using SMT with State Equation took 468 ms to find 0 implicit places.
Running 228 sub problems to find dead transitions.
[2025-06-02 17:32:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/153 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 1 (OVERLAPS) 1/154 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 228 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:32:58] [INFO ] Deduced a trap composed of 45 places in 154 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:32:58] [INFO ] Deduced a trap composed of 35 places in 167 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:32:58] [INFO ] Deduced a trap composed of 78 places in 169 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:32:58] [INFO ] Deduced a trap composed of 80 places in 169 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:32:58] [INFO ] Deduced a trap composed of 40 places in 183 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:32:59] [INFO ] Deduced a trap composed of 46 places in 172 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:32:59] [INFO ] Deduced a trap composed of 89 places in 141 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:32:59] [INFO ] Deduced a trap composed of 82 places in 164 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:33:00] [INFO ] Deduced a trap composed of 87 places in 157 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:33:00] [INFO ] Deduced a trap composed of 87 places in 158 ms of which 20 ms to minimize.
Problem TDEAD126 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD172 is UNSAT
Problem TDEAD173 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD186 is UNSAT
Problem TDEAD187 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD203 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/154 variables, 10/14 constraints. Problems are: Problem set: 15 solved, 213 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:33:03] [INFO ] Deduced a trap composed of 78 places in 111 ms of which 12 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/154 variables, 1/15 constraints. Problems are: Problem set: 15 solved, 213 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:33:04] [INFO ] Deduced a trap composed of 81 places in 176 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:33:05] [INFO ] Deduced a trap composed of 80 places in 130 ms of which 15 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/154 variables, 2/17 constraints. Problems are: Problem set: 15 solved, 213 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:33:06] [INFO ] Deduced a trap composed of 81 places in 160 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:33:07] [INFO ] Deduced a trap composed of 57 places in 157 ms of which 16 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/154 variables, 2/19 constraints. Problems are: Problem set: 15 solved, 213 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:33:08] [INFO ] Deduced a trap composed of 83 places in 146 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:33:09] [INFO ] Deduced a trap composed of 83 places in 152 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:33:09] [INFO ] Deduced a trap composed of 41 places in 175 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:33:09] [INFO ] Deduced a trap composed of 47 places in 192 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:33:10] [INFO ] Deduced a trap composed of 37 places in 167 ms of which 28 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/154 variables, 5/24 constraints. Problems are: Problem set: 15 solved, 213 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/154 variables, 0/24 constraints. Problems are: Problem set: 15 solved, 213 unsolved
At refinement iteration 8 (OVERLAPS) 229/383 variables, 154/178 constraints. Problems are: Problem set: 15 solved, 213 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/383 variables, 0/178 constraints. Problems are: Problem set: 15 solved, 213 unsolved
At refinement iteration 10 (OVERLAPS) 1/384 variables, 1/179 constraints. Problems are: Problem set: 15 solved, 213 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:33:23] [INFO ] Deduced a trap composed of 77 places in 144 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:33:24] [INFO ] Deduced a trap composed of 58 places in 153 ms of which 17 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 384/384 variables, and 181 constraints, problems are : Problem set: 15 solved, 213 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 155/155 constraints, PredecessorRefiner: 228/228 constraints, Known Traps: 22/22 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 15 solved, 213 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/153 variables, 0/0 constraints. Problems are: Problem set: 15 solved, 213 unsolved
At refinement iteration 1 (OVERLAPS) 1/154 variables, 4/4 constraints. Problems are: Problem set: 15 solved, 213 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/154 variables, 22/26 constraints. Problems are: Problem set: 15 solved, 213 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/154 variables, 0/26 constraints. Problems are: Problem set: 15 solved, 213 unsolved
At refinement iteration 4 (OVERLAPS) 229/383 variables, 154/180 constraints. Problems are: Problem set: 15 solved, 213 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/383 variables, 210/390 constraints. Problems are: Problem set: 15 solved, 213 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:33:30] [INFO ] Deduced a trap composed of 22 places in 80 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:33:31] [INFO ] Deduced a trap composed of 84 places in 145 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:33:31] [INFO ] Deduced a trap composed of 84 places in 151 ms of which 16 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/383 variables, 3/393 constraints. Problems are: Problem set: 15 solved, 213 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:33:46] [INFO ] Deduced a trap along path composed of 7 places in 44 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 383/384 variables, and 394 constraints, problems are : Problem set: 15 solved, 213 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 154/155 constraints, PredecessorRefiner: 210/228 constraints, Known Traps: 25/25 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 60112ms problems are : Problem set: 15 solved, 213 unsolved
Search for dead transitions found 15 dead transitions in 60118ms
Found 15 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 15 transitions
Dead transitions reduction (with SMT) removed 15 transitions
Starting structural reductions in LTL mode, iteration 1 : 155/164 places, 214/244 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 154 transition count 213
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 154 transition count 213
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 153 transition count 212
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 153 transition count 212
Applied a total of 4 rules in 7 ms. Remains 153 /155 variables (removed 2) and now considering 212/214 (removed 2) transitions.
// Phase 1: matrix 212 rows 153 cols
[2025-06-02 17:33:54] [INFO ] Computed 4 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:33:54] [INFO ] Implicit Places using invariants in 140 ms returned []
[2025-06-02 17:33:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:33:54] [INFO ] Implicit Places using invariants and state equation in 382 ms returned []
Implicit Place search using SMT with State Equation took 525 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 153/164 places, 212/244 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 61133 ms. Remains : 153/164 places, 212/244 transitions.
Stuttering acceptance computed with spot in 594 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : FireWire-PT-15-LTLCardinality-01
Product exploration explored 100000 steps with 16633 reset in 537 ms.
Product exploration explored 100000 steps with 16649 reset in 337 ms.
Computed a total of 29 stabilizing places and 36 stable transitions
Graph (complete) has 379 edges and 153 vertex of which 152 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.9 ms
Computed a total of 29 stabilizing places and 36 stable transitions
Knowledge obtained : [(AND (NOT p2) p0 p1), (X (X (NOT p2)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 138 ms. Reduced automaton from 6 states, 8 edges and 3 AP (stutter sensitive) to 6 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 317 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p1))]
Reduction of identical properties reduced properties to check from 6 to 5
RANDOM walk for 40000 steps (9 resets) in 682 ms. (58 steps per ms) remains 3/5 properties
BEST_FIRST walk for 40000 steps (17 resets) in 322 ms. (123 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40000 steps (8 resets) in 205 ms. (194 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40000 steps (9 resets) in 192 ms. (207 steps per ms) remains 2/2 properties
[2025-06-02 17:33:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 117/122 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/122 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 19/141 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/141 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 201/342 variables, 141/145 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/342 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 11/353 variables, 6/151 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/353 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 8/361 variables, 3/154 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/361 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 4/365 variables, 3/157 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/365 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/365 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 365/365 variables, and 157 constraints, problems are : Problem set: 0 solved, 2 unsolved in 322 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 153/153 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 117/122 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:33:57] [INFO ] Deduced a trap composed of 77 places in 138 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:33:57] [INFO ] Deduced a trap composed of 77 places in 117 ms of which 10 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/122 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/122 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 19/141 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/141 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 201/342 variables, 141/147 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/342 variables, 2/149 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/342 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 11/353 variables, 6/155 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/353 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 8/361 variables, 3/158 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/361 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 4/365 variables, 3/161 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/365 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/365 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 365/365 variables, and 161 constraints, problems are : Problem set: 0 solved, 2 unsolved in 955 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 153/153 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1286ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 225 ms.
Support contains 5 out of 153 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 153/153 places, 212/212 transitions.
Graph (trivial) has 113 edges and 153 vertex of which 8 / 153 are part of one of the 2 SCC in 1 ms
Free SCC test removed 6 places
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 0 with 17 rules applied. Total rules applied 18 place count 147 transition count 186
Reduce places removed 17 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 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 1 with 20 rules applied. Total rules applied 38 place count 130 transition count 183
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 39 place count 129 transition count 183
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 15 Pre rules applied. Total rules applied 39 place count 129 transition count 168
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 3 with 30 rules applied. Total rules applied 69 place count 114 transition count 168
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 1 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 3 with 30 rules applied. Total rules applied 99 place count 99 transition count 153
Performed 16 Post agglomeration using F-continuation condition with reduction of 4 identical transitions.
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 32 rules applied. Total rules applied 131 place count 83 transition count 221
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 134 place count 83 transition count 218
Drop transitions (Redundant composition of simpler transitions.) removed 15 transitions
Redundant transition composition rules discarded 15 transitions
Iterating global reduction 4 with 15 rules applied. Total rules applied 149 place count 83 transition count 203
Free-agglomeration rule applied 9 times.
Iterating global reduction 4 with 9 rules applied. Total rules applied 158 place count 83 transition count 194
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 4 with 9 rules applied. Total rules applied 167 place count 74 transition count 194
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 169 place count 72 transition count 192
Iterating global reduction 5 with 2 rules applied. Total rules applied 171 place count 72 transition count 192
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 175 place count 72 transition count 188
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 6 with 3 rules applied. Total rules applied 178 place count 72 transition count 185
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 180 place count 72 transition count 185
Applied a total of 180 rules in 112 ms. Remains 72 /153 variables (removed 81) and now considering 185/212 (removed 27) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 112 ms. Remains : 72/153 places, 185/212 transitions.
RANDOM walk for 40000 steps (14 resets) in 164 ms. (242 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40000 steps (30 resets) in 210 ms. (189 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40000 steps (15 resets) in 202 ms. (197 steps per ms) remains 2/2 properties
Finished probabilistic random walk after 146 steps, run visited all 2 properties in 7 ms. (steps per millisecond=20 )
Probabilistic random walk after 146 steps, saw 91 distinct states, run finished after 8 ms. (steps per millisecond=18 ) properties seen :2
Knowledge obtained : [(AND (NOT p2) p0 p1), (X (X (NOT p2)))]
False Knowledge obtained : [(F (NOT (AND (NOT p2) p1))), (F (NOT (OR p2 p1))), (F (NOT p1)), (F p2), (F (NOT p0)), (F (NOT (OR p0 p2)))]
Knowledge based reduction with 2 factoid took 343 ms. Reduced automaton from 6 states, 8 edges and 3 AP (stutter sensitive) to 6 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 341 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 339 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p1))]
Support contains 5 out of 153 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 153/153 places, 212/212 transitions.
Applied a total of 0 rules in 3 ms. Remains 153 /153 variables (removed 0) and now considering 212/212 (removed 0) transitions.
[2025-06-02 17:34:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:34:00] [INFO ] Implicit Places using invariants in 196 ms returned []
[2025-06-02 17:34:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:34:00] [INFO ] Implicit Places using invariants and state equation in 424 ms returned []
Implicit Place search using SMT with State Equation took 623 ms to find 0 implicit places.
Running 211 sub problems to find dead transitions.
[2025-06-02 17:34:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/151 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 1 (OVERLAPS) 1/152 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 211 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:34:04] [INFO ] Deduced a trap composed of 45 places in 171 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:34:04] [INFO ] Deduced a trap composed of 35 places in 165 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:34:05] [INFO ] Deduced a trap composed of 77 places in 176 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:34:05] [INFO ] Deduced a trap composed of 40 places in 174 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:34:05] [INFO ] Deduced a trap composed of 46 places in 174 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:34:05] [INFO ] Deduced a trap composed of 79 places in 139 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:34:05] [INFO ] Deduced a trap composed of 46 places in 165 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:34:06] [INFO ] Deduced a trap composed of 78 places in 119 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:34:06] [INFO ] Deduced a trap composed of 77 places in 143 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:34:06] [INFO ] Deduced a trap composed of 78 places in 121 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:34:06] [INFO ] Deduced a trap composed of 91 places in 155 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:34:06] [INFO ] Deduced a trap composed of 41 places in 165 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:34:06] [INFO ] Deduced a trap composed of 47 places in 148 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:34:07] [INFO ] Deduced a trap composed of 80 places in 153 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:34:07] [INFO ] Deduced a trap composed of 45 places in 149 ms of which 14 ms to minimize.
Problem TDEAD176 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/152 variables, 15/19 constraints. Problems are: Problem set: 1 solved, 210 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/152 variables, 0/19 constraints. Problems are: Problem set: 1 solved, 210 unsolved
At refinement iteration 4 (OVERLAPS) 212/364 variables, 152/171 constraints. Problems are: Problem set: 1 solved, 210 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:34:15] [INFO ] Deduced a trap composed of 82 places in 156 ms of which 19 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/364 variables, 1/172 constraints. Problems are: Problem set: 1 solved, 210 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/364 variables, 0/172 constraints. Problems are: Problem set: 1 solved, 210 unsolved
At refinement iteration 7 (OVERLAPS) 1/365 variables, 1/173 constraints. Problems are: Problem set: 1 solved, 210 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/365 variables, 0/173 constraints. Problems are: Problem set: 1 solved, 210 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 365/365 variables, and 173 constraints, problems are : Problem set: 1 solved, 210 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 153/153 constraints, PredecessorRefiner: 211/211 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 210 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/151 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 210 unsolved
At refinement iteration 1 (OVERLAPS) 1/152 variables, 4/4 constraints. Problems are: Problem set: 1 solved, 210 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/152 variables, 16/20 constraints. Problems are: Problem set: 1 solved, 210 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/152 variables, 0/20 constraints. Problems are: Problem set: 1 solved, 210 unsolved
At refinement iteration 4 (OVERLAPS) 212/364 variables, 152/172 constraints. Problems are: Problem set: 1 solved, 210 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/364 variables, 207/379 constraints. Problems are: Problem set: 1 solved, 210 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:34:37] [INFO ] Deduced a trap composed of 22 places in 41 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/364 variables, 1/380 constraints. Problems are: Problem set: 1 solved, 210 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:34:48] [INFO ] Deduced a trap along path composed of 7 places in 34 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/364 variables, 1/381 constraints. Problems are: Problem set: 1 solved, 210 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 364/365 variables, and 381 constraints, problems are : Problem set: 1 solved, 210 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 152/153 constraints, PredecessorRefiner: 207/211 constraints, Known Traps: 17/17 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 60080ms problems are : Problem set: 1 solved, 210 unsolved
Search for dead transitions found 1 dead transitions in 60083ms
Found 1 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 1 transitions
Dead transitions reduction (with SMT) removed 1 transitions
Starting structural reductions in LTL mode, iteration 1 : 153/153 places, 211/212 transitions.
Applied a total of 0 rules in 2 ms. Remains 153 /153 variables (removed 0) and now considering 211/211 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 60712 ms. Remains : 153/153 places, 211/212 transitions.
Computed a total of 29 stabilizing places and 36 stable transitions
Graph (complete) has 377 edges and 153 vertex of which 152 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 29 stabilizing places and 36 stable transitions
Knowledge obtained : [(AND (NOT p2) p0 p1), (X (X (NOT p2)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 118 ms. Reduced automaton from 6 states, 8 edges and 3 AP (stutter sensitive) to 6 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 317 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p1))]
Reduction of identical properties reduced properties to check from 6 to 5
RANDOM walk for 40000 steps (19 resets) in 154 ms. (258 steps per ms) remains 2/5 properties
BEST_FIRST walk for 40000 steps (15 resets) in 107 ms. (370 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40000 steps (10 resets) in 118 ms. (336 steps per ms) remains 2/2 properties
// Phase 1: matrix 211 rows 153 cols
[2025-06-02 17:35:01] [INFO ] Computed 4 invariants in 2 ms
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 117/122 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/122 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 19/141 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/141 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 200/341 variables, 141/145 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/341 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 11/352 variables, 6/151 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/352 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 8/360 variables, 3/154 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/360 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 4/364 variables, 3/157 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/364 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/364 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 364/364 variables, and 157 constraints, problems are : Problem set: 0 solved, 2 unsolved in 324 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 153/153 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 117/122 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:35:02] [INFO ] Deduced a trap composed of 77 places in 123 ms of which 16 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/122 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/122 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 19/141 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/141 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 200/341 variables, 141/146 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/341 variables, 2/148 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/341 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 11/352 variables, 6/154 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/352 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 8/360 variables, 3/157 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/360 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 4/364 variables, 3/160 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/364 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/364 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 364/364 variables, and 160 constraints, problems are : Problem set: 0 solved, 2 unsolved in 764 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 153/153 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1099ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 400 ms.
Support contains 5 out of 153 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 153/153 places, 211/211 transitions.
Graph (trivial) has 113 edges and 153 vertex of which 8 / 153 are part of one of the 2 SCC in 10 ms
Free SCC test removed 6 places
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 0 with 17 rules applied. Total rules applied 18 place count 147 transition count 185
Reduce places removed 17 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 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 1 with 20 rules applied. Total rules applied 38 place count 130 transition count 182
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 39 place count 129 transition count 182
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 15 Pre rules applied. Total rules applied 39 place count 129 transition count 167
Deduced a syphon composed of 15 places in 1 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 3 with 30 rules applied. Total rules applied 69 place count 114 transition count 167
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 3 with 30 rules applied. Total rules applied 99 place count 99 transition count 152
Performed 16 Post agglomeration using F-continuation condition with reduction of 4 identical transitions.
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 32 rules applied. Total rules applied 131 place count 83 transition count 218
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 134 place count 83 transition count 215
Drop transitions (Redundant composition of simpler transitions.) removed 15 transitions
Redundant transition composition rules discarded 15 transitions
Iterating global reduction 4 with 15 rules applied. Total rules applied 149 place count 83 transition count 200
Free-agglomeration rule applied 9 times.
Iterating global reduction 4 with 9 rules applied. Total rules applied 158 place count 83 transition count 191
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 4 with 9 rules applied. Total rules applied 167 place count 74 transition count 191
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 169 place count 72 transition count 189
Iterating global reduction 5 with 2 rules applied. Total rules applied 171 place count 72 transition count 189
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 175 place count 72 transition count 185
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 6 with 3 rules applied. Total rules applied 178 place count 72 transition count 182
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 180 place count 72 transition count 182
Applied a total of 180 rules in 77 ms. Remains 72 /153 variables (removed 81) and now considering 182/211 (removed 29) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 78 ms. Remains : 72/153 places, 182/211 transitions.
RANDOM walk for 40000 steps (25 resets) in 74 ms. (533 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40000 steps (34 resets) in 192 ms. (207 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40000 steps (36 resets) in 114 ms. (347 steps per ms) remains 2/2 properties
Finished probabilistic random walk after 146 steps, run visited all 2 properties in 7 ms. (steps per millisecond=20 )
Probabilistic random walk after 146 steps, saw 91 distinct states, run finished after 7 ms. (steps per millisecond=20 ) properties seen :2
Knowledge obtained : [(AND (NOT p2) p0 p1), (X (X (NOT p2)))]
False Knowledge obtained : [(F (NOT (AND (NOT p2) p1))), (F (NOT (OR p2 p1))), (F (NOT p1)), (F p2), (F (NOT p0)), (F (NOT (OR p0 p2)))]
Knowledge based reduction with 2 factoid took 280 ms. Reduced automaton from 6 states, 8 edges and 3 AP (stutter sensitive) to 6 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 294 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 307 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 309 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p1))]
Product exploration explored 100000 steps with 16668 reset in 97 ms.
Product exploration explored 100000 steps with 16682 reset in 142 ms.
Applying partial POR strategy [false, false, false, false, true, true]
Stuttering acceptance computed with spot in 307 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p1))]
Support contains 5 out of 153 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 153/153 places, 211/211 transitions.
Graph (trivial) has 113 edges and 153 vertex of which 8 / 153 are part of one of the 2 SCC in 1 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 17 rules applied. Total rules applied 18 place count 147 transition count 204
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 20 place count 147 transition count 202
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 20 place count 147 transition count 216
Deduced a syphon composed of 28 places in 1 ms
Iterating global reduction 2 with 11 rules applied. Total rules applied 31 place count 147 transition count 216
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 32 place count 146 transition count 215
Deduced a syphon composed of 27 places in 0 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 33 place count 146 transition count 215
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 45 places in 0 ms
Iterating global reduction 2 with 18 rules applied. Total rules applied 51 place count 146 transition count 222
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 57 place count 140 transition count 216
Deduced a syphon composed of 39 places in 1 ms
Iterating global reduction 2 with 6 rules applied. Total rules applied 63 place count 140 transition count 216
Performed 16 Post agglomeration using F-continuation condition with reduction of 4 identical transitions.
Deduced a syphon composed of 55 places in 0 ms
Iterating global reduction 2 with 16 rules applied. Total rules applied 79 place count 140 transition count 329
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 80 place count 140 transition count 328
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 84 place count 136 transition count 320
Deduced a syphon composed of 51 places in 0 ms
Iterating global reduction 3 with 4 rules applied. Total rules applied 88 place count 136 transition count 320
Deduced a syphon composed of 51 places in 1 ms
Drop transitions (Redundant composition of simpler transitions.) removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 3 with 16 rules applied. Total rules applied 104 place count 136 transition count 304
Deduced a syphon composed of 51 places in 0 ms
Applied a total of 104 rules in 70 ms. Remains 136 /153 variables (removed 17) and now considering 304/211 (removed -93) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 17:35:05] [INFO ] Redundant transitions in 36 ms returned []
Running 302 sub problems to find dead transitions.
[2025-06-02 17:35:05] [INFO ] Flow matrix only has 298 transitions (discarded 6 similar events)
// Phase 1: matrix 298 rows 136 cols
[2025-06-02 17:35:05] [INFO ] Computed 4 invariants in 11 ms
[2025-06-02 17:35:05] [INFO ] State equation strengthened by 30 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/134 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 1 (OVERLAPS) 1/135 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 302 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:35:09] [INFO ] Deduced a trap composed of 44 places in 154 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:35:09] [INFO ] Deduced a trap composed of 21 places in 124 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:35:09] [INFO ] Deduced a trap composed of 28 places in 159 ms of which 24 ms to minimize.
Problem TDEAD3 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:35:10] [INFO ] Deduced a trap composed of 4 places in 127 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:35:10] [INFO ] Deduced a trap composed of 7 places in 147 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:35:10] [INFO ] Deduced a trap composed of 19 places in 177 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:35:10] [INFO ] Deduced a trap composed of 19 places in 178 ms of which 22 ms to minimize.
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:35:10] [INFO ] Deduced a trap composed of 46 places in 157 ms of which 14 ms to minimize.
Problem TDEAD43 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD62 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:35:11] [INFO ] Deduced a trap composed of 46 places in 167 ms of which 14 ms to minimize.
Problem TDEAD66 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD128 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD151 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD176 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD182 is UNSAT
Problem TDEAD183 is UNSAT
Problem TDEAD184 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD186 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD212 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD238 is UNSAT
Problem TDEAD239 is UNSAT
Problem TDEAD244 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD246 is UNSAT
Problem TDEAD280 is UNSAT
Problem TDEAD281 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD283 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/135 variables, 9/13 constraints. Problems are: Problem set: 105 solved, 197 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:35:12] [INFO ] Deduced a trap composed of 46 places in 177 ms of which 16 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/135 variables, 1/14 constraints. Problems are: Problem set: 105 solved, 197 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/135 variables, 0/14 constraints. Problems are: Problem set: 105 solved, 197 unsolved
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD119 is UNSAT
At refinement iteration 5 (OVERLAPS) 297/432 variables, 135/149 constraints. Problems are: Problem set: 109 solved, 193 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/432 variables, 29/178 constraints. Problems are: Problem set: 109 solved, 193 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/432 variables, 0/178 constraints. Problems are: Problem set: 109 solved, 193 unsolved
At refinement iteration 8 (OVERLAPS) 1/433 variables, 1/179 constraints. Problems are: Problem set: 109 solved, 193 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/433 variables, 0/179 constraints. Problems are: Problem set: 109 solved, 193 unsolved
At refinement iteration 10 (OVERLAPS) 1/434 variables, 1/180 constraints. Problems are: Problem set: 109 solved, 193 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/434 variables, 0/180 constraints. Problems are: Problem set: 109 solved, 193 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 434/434 variables, and 180 constraints, problems are : Problem set: 109 solved, 193 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 136/136 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 302/302 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 109 solved, 193 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 0/0 constraints. Problems are: Problem set: 109 solved, 193 unsolved
At refinement iteration 1 (OVERLAPS) 49/132 variables, 4/4 constraints. Problems are: Problem set: 109 solved, 193 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/132 variables, 10/14 constraints. Problems are: Problem set: 109 solved, 193 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/132 variables, 0/14 constraints. Problems are: Problem set: 109 solved, 193 unsolved
At refinement iteration 4 (OVERLAPS) 297/429 variables, 132/146 constraints. Problems are: Problem set: 109 solved, 193 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/429 variables, 29/175 constraints. Problems are: Problem set: 109 solved, 193 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/429 variables, 190/365 constraints. Problems are: Problem set: 109 solved, 193 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/429 variables, 0/365 constraints. Problems are: Problem set: 109 solved, 193 unsolved
At refinement iteration 8 (OVERLAPS) 4/433 variables, 4/369 constraints. Problems are: Problem set: 109 solved, 193 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/433 variables, 3/372 constraints. Problems are: Problem set: 109 solved, 193 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 433/434 variables, and 372 constraints, problems are : Problem set: 109 solved, 193 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 136/136 constraints, ReadFeed: 29/30 constraints, PredecessorRefiner: 193/302 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60247ms problems are : Problem set: 109 solved, 193 unsolved
Search for dead transitions found 109 dead transitions in 60250ms
Found 109 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 109 transitions
Dead transitions reduction (with SMT) removed 109 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 136/153 places, 195/211 transitions.
Graph (complete) has 346 edges and 136 vertex of which 85 are kept as prefixes of interest. Removing 51 places using SCC suffix rule.1 ms
Discarding 51 places :
Also discarding 0 output transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -12
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 85 transition count 207
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 2 rules in 11 ms. Remains 85 /136 variables (removed 51) and now considering 207/195 (removed -12) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 85/153 places, 207/211 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 60381 ms. Remains : 85/153 places, 207/211 transitions.
Built C files in :
/tmp/ltsmin8455555016739358561
[2025-06-02 17:36:05] [INFO ] Built C files in 24ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8455555016739358561
Running compilation step : cd /tmp/ltsmin8455555016739358561;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 861 ms.
Running link step : cd /tmp/ltsmin8455555016739358561;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 53 ms.
Running LTSmin : cd /tmp/ltsmin8455555016739358561;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased8016119300992304690.hoa' '--buchi-type=spotba'
LTSmin run took 237 ms.
FORMULA FireWire-PT-15-LTLCardinality-01 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property FireWire-PT-15-LTLCardinality-01 finished in 193398 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0||G(p1)))))'
Support contains 4 out of 164 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 164/164 places, 244/244 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 163 transition count 244
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 4 place count 160 transition count 241
Iterating global reduction 1 with 3 rules applied. Total rules applied 7 place count 160 transition count 241
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 8 place count 160 transition count 240
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 10 place count 158 transition count 236
Iterating global reduction 2 with 2 rules applied. Total rules applied 12 place count 158 transition count 236
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 14 place count 156 transition count 234
Iterating global reduction 2 with 2 rules applied. Total rules applied 16 place count 156 transition count 234
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 17 place count 156 transition count 233
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 18 place count 155 transition count 231
Iterating global reduction 3 with 1 rules applied. Total rules applied 19 place count 155 transition count 231
Applied a total of 19 rules in 21 ms. Remains 155 /164 variables (removed 9) and now considering 231/244 (removed 13) transitions.
// Phase 1: matrix 231 rows 155 cols
[2025-06-02 17:36:07] [INFO ] Computed 4 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:36:07] [INFO ] Implicit Places using invariants in 228 ms returned []
[2025-06-02 17:36:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:36:07] [INFO ] Implicit Places using invariants and state equation in 356 ms returned []
Implicit Place search using SMT with State Equation took 592 ms to find 0 implicit places.
Running 230 sub problems to find dead transitions.
[2025-06-02 17:36:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/154 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 1 (OVERLAPS) 1/155 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 230 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:36:11] [INFO ] Deduced a trap composed of 47 places in 152 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:36:12] [INFO ] Deduced a trap composed of 35 places in 175 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:36:12] [INFO ] Deduced a trap composed of 78 places in 197 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:36:12] [INFO ] Deduced a trap composed of 81 places in 147 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:36:12] [INFO ] Deduced a trap composed of 47 places in 170 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:36:12] [INFO ] Deduced a trap composed of 90 places in 158 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:36:13] [INFO ] Deduced a trap composed of 83 places in 162 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:36:13] [INFO ] Deduced a trap composed of 80 places in 166 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:36:14] [INFO ] Deduced a trap composed of 80 places in 147 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:36:14] [INFO ] Deduced a trap composed of 85 places in 153 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:36:14] [INFO ] Deduced a trap composed of 85 places in 148 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:36:14] [INFO ] Deduced a trap composed of 39 places in 168 ms of which 28 ms to minimize.
Problem TDEAD127 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:36:15] [INFO ] Deduced a trap composed of 81 places in 148 ms of which 22 ms to minimize.
Problem TDEAD140 is UNSAT
Problem TDEAD172 is UNSAT
Problem TDEAD173 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD182 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD197 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD205 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/155 variables, 13/17 constraints. Problems are: Problem set: 16 solved, 214 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:36:16] [INFO ] Deduced a trap composed of 81 places in 166 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:36:16] [INFO ] Deduced a trap composed of 78 places in 117 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:36:16] [INFO ] Deduced a trap composed of 83 places in 139 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:36:16] [INFO ] Deduced a trap composed of 79 places in 116 ms of which 8 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/155 variables, 4/21 constraints. Problems are: Problem set: 16 solved, 214 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:36:20] [INFO ] Deduced a trap composed of 57 places in 157 ms of which 14 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/155 variables, 1/22 constraints. Problems are: Problem set: 16 solved, 214 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:36:21] [INFO ] Deduced a trap composed of 48 places in 190 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:36:21] [INFO ] Deduced a trap composed of 84 places in 159 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:36:21] [INFO ] Deduced a trap composed of 40 places in 169 ms of which 32 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/155 variables, 3/25 constraints. Problems are: Problem set: 16 solved, 214 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/155 variables, 0/25 constraints. Problems are: Problem set: 16 solved, 214 unsolved
At refinement iteration 7 (OVERLAPS) 231/386 variables, 155/180 constraints. Problems are: Problem set: 16 solved, 214 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/386 variables, 0/180 constraints. Problems are: Problem set: 16 solved, 214 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 386/386 variables, and 180 constraints, problems are : Problem set: 16 solved, 214 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 155/155 constraints, PredecessorRefiner: 230/230 constraints, Known Traps: 21/21 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 16 solved, 214 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/154 variables, 0/0 constraints. Problems are: Problem set: 16 solved, 214 unsolved
At refinement iteration 1 (OVERLAPS) 1/155 variables, 4/4 constraints. Problems are: Problem set: 16 solved, 214 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/155 variables, 21/25 constraints. Problems are: Problem set: 16 solved, 214 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:36:40] [INFO ] Deduced a trap composed of 58 places in 175 ms of which 32 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/155 variables, 1/26 constraints. Problems are: Problem set: 16 solved, 214 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/155 variables, 0/26 constraints. Problems are: Problem set: 16 solved, 214 unsolved
At refinement iteration 5 (OVERLAPS) 231/386 variables, 155/181 constraints. Problems are: Problem set: 16 solved, 214 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/386 variables, 214/395 constraints. Problems are: Problem set: 16 solved, 214 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:36:47] [INFO ] Deduced a trap composed of 90 places in 132 ms of which 17 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/386 variables, 1/396 constraints. Problems are: Problem set: 16 solved, 214 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:37:00] [INFO ] Deduced a trap along path composed of 7 places in 42 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 386/386 variables, and 397 constraints, problems are : Problem set: 16 solved, 214 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 155/155 constraints, PredecessorRefiner: 214/230 constraints, Known Traps: 23/23 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 60071ms problems are : Problem set: 16 solved, 214 unsolved
Search for dead transitions found 16 dead transitions in 60074ms
Found 16 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 16 transitions
Dead transitions reduction (with SMT) removed 16 transitions
Starting structural reductions in LTL mode, iteration 1 : 155/164 places, 215/244 transitions.
Applied a total of 0 rules in 5 ms. Remains 155 /155 variables (removed 0) and now considering 215/215 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 60695 ms. Remains : 155/164 places, 215/244 transitions.
Stuttering acceptance computed with spot in 175 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : FireWire-PT-15-LTLCardinality-03
Product exploration explored 100000 steps with 0 reset in 134 ms.
Product exploration explored 100000 steps with 1 reset in 285 ms.
Computed a total of 31 stabilizing places and 40 stable transitions
Computed a total of 31 stabilizing places and 40 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X p0), (X p1), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 9 factoid took 124 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 77 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0))]
RANDOM walk for 40000 steps (12 resets) in 111 ms. (357 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40000 steps (8 resets) in 157 ms. (253 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40000 steps (19 resets) in 102 ms. (388 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40000 steps (11 resets) in 130 ms. (305 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40000 steps (13 resets) in 133 ms. (298 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 644679 steps, run timeout after 3001 ms. (steps per millisecond=214 ) properties seen :3 out of 4
Probabilistic random walk after 644679 steps, saw 150306 distinct states, run finished after 3005 ms. (steps per millisecond=214 ) properties seen :3
// Phase 1: matrix 215 rows 155 cols
[2025-06-02 17:37:11] [INFO ] Computed 4 invariants in 2 ms
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf1 is UNSAT
After SMT solving in domain Real declared 124/370 variables, and 2 constraints, problems are : Problem set: 1 solved, 0 unsolved in 54 ms.
Refiners :[Positive P Invariants (semi-flows): 2/4 constraints, State Equation: 0/155 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X p0), (X p1), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (G (OR p0 p1))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1)), (F (NOT (OR p0 (NOT p1))))]
Knowledge based reduction with 10 factoid took 226 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 80 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 101 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0))]
Support contains 4 out of 155 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 155/155 places, 215/215 transitions.
Graph (trivial) has 118 edges and 155 vertex of which 11 / 155 are part of one of the 3 SCC in 1 ms
Free SCC test removed 8 places
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 0 with 19 rules applied. Total rules applied 20 place count 146 transition count 186
Reduce places removed 19 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 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 1 with 22 rules applied. Total rules applied 42 place count 127 transition count 183
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 43 place count 126 transition count 183
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 15 Pre rules applied. Total rules applied 43 place count 126 transition count 168
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 3 with 30 rules applied. Total rules applied 73 place count 111 transition count 168
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 3 with 30 rules applied. Total rules applied 103 place count 96 transition count 153
Performed 15 Post agglomeration using F-continuation condition with reduction of 4 identical transitions.
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 3 with 30 rules applied. Total rules applied 133 place count 81 transition count 217
Drop transitions (Redundant composition of simpler transitions.) removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 3 with 16 rules applied. Total rules applied 149 place count 81 transition count 201
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 150 place count 81 transition count 201
Applied a total of 150 rules in 27 ms. Remains 81 /155 variables (removed 74) and now considering 201/215 (removed 14) transitions.
[2025-06-02 17:37:12] [INFO ] Flow matrix only has 190 transitions (discarded 11 similar events)
// Phase 1: matrix 190 rows 81 cols
[2025-06-02 17:37:12] [INFO ] Computed 4 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:37:12] [INFO ] Implicit Places using invariants in 135 ms returned []
[2025-06-02 17:37:12] [INFO ] Flow matrix only has 190 transitions (discarded 11 similar events)
[2025-06-02 17:37:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:37:12] [INFO ] State equation strengthened by 27 read => feed constraints.
[2025-06-02 17:37:12] [INFO ] Implicit Places using invariants and state equation in 293 ms returned []
Implicit Place search using SMT with State Equation took 429 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 17:37:12] [INFO ] Redundant transitions in 5 ms returned []
Running 198 sub problems to find dead transitions.
[2025-06-02 17:37:12] [INFO ] Flow matrix only has 190 transitions (discarded 11 similar events)
[2025-06-02 17:37:12] [INFO ] Invariant cache hit.
[2025-06-02 17:37:12] [INFO ] State equation strengthened by 27 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/80 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 2 (OVERLAPS) 1/81 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 198 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:37:15] [INFO ] Deduced a trap composed of 45 places in 109 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:37:15] [INFO ] Deduced a trap composed of 45 places in 124 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:37:15] [INFO ] Deduced a trap composed of 27 places in 144 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:37:16] [INFO ] Deduced a trap composed of 15 places in 130 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:37:16] [INFO ] Deduced a trap composed of 43 places in 110 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:37:16] [INFO ] Deduced a trap composed of 43 places in 110 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:37:16] [INFO ] Deduced a trap composed of 17 places in 124 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:37:16] [INFO ] Deduced a trap composed of 44 places in 118 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:37:17] [INFO ] Deduced a trap composed of 42 places in 150 ms of which 9 ms to minimize.
Problem TDEAD79 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD81 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/81 variables, 9/13 constraints. Problems are: Problem set: 3 solved, 195 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/81 variables, 0/13 constraints. Problems are: Problem set: 3 solved, 195 unsolved
At refinement iteration 5 (OVERLAPS) 189/270 variables, 81/94 constraints. Problems are: Problem set: 3 solved, 195 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/270 variables, 27/121 constraints. Problems are: Problem set: 3 solved, 195 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/270 variables, 0/121 constraints. Problems are: Problem set: 3 solved, 195 unsolved
At refinement iteration 8 (OVERLAPS) 0/270 variables, 0/121 constraints. Problems are: Problem set: 3 solved, 195 unsolved
No progress, stopping.
After SMT solving in domain Real declared 270/271 variables, and 121 constraints, problems are : Problem set: 3 solved, 195 unsolved in 13539 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 81/81 constraints, ReadFeed: 27/27 constraints, PredecessorRefiner: 198/198 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 195 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 195 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/80 variables, 6/7 constraints. Problems are: Problem set: 3 solved, 195 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 0/7 constraints. Problems are: Problem set: 3 solved, 195 unsolved
At refinement iteration 3 (OVERLAPS) 1/81 variables, 3/10 constraints. Problems are: Problem set: 3 solved, 195 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/81 variables, 3/13 constraints. Problems are: Problem set: 3 solved, 195 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/81 variables, 0/13 constraints. Problems are: Problem set: 3 solved, 195 unsolved
At refinement iteration 6 (OVERLAPS) 189/270 variables, 81/94 constraints. Problems are: Problem set: 3 solved, 195 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/270 variables, 27/121 constraints. Problems are: Problem set: 3 solved, 195 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/270 variables, 195/316 constraints. Problems are: Problem set: 3 solved, 195 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/270 variables, 0/316 constraints. Problems are: Problem set: 3 solved, 195 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 270/271 variables, and 316 constraints, problems are : Problem set: 3 solved, 195 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 81/81 constraints, ReadFeed: 27/27 constraints, PredecessorRefiner: 195/198 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 43635ms problems are : Problem set: 3 solved, 195 unsolved
Search for dead transitions found 3 dead transitions in 43636ms
Found 3 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 3 transitions
Dead transitions reduction (with SMT) removed 3 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 81/155 places, 198/215 transitions.
Applied a total of 0 rules in 7 ms. Remains 81 /81 variables (removed 0) and now considering 198/198 (removed 0) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 17:37:56] [INFO ] Redundant transitions in 3 ms returned []
Finished structural reductions in SI_LTL mode , in 2 iterations and 44127 ms. Remains : 81/155 places, 198/215 transitions.
Computed a total of 14 stabilizing places and 22 stable transitions
Computed a total of 14 stabilizing places and 22 stable transitions
Knowledge obtained : [(AND p1 p0), (X p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X p0), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 140 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 102 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0))]
RANDOM walk for 40000 steps (3635 resets) in 358 ms. (111 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (1329 resets) in 84 ms. (470 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (1271 resets) in 81 ms. (487 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (1293 resets) in 114 ms. (347 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (1260 resets) in 118 ms. (336 steps per ms) remains 4/4 properties
Probably explored full state space saw : 21746 states, properties seen :3
Probabilistic random walk after 76190 steps, saw 21746 distinct states, run finished after 368 ms. (steps per millisecond=207 ) properties seen :3
Explored full state space saw : 21746 states, properties seen :0
Exhaustive walk after 76190 steps, saw 21746 distinct states, run finished after 164 ms. (steps per millisecond=464 ) properties seen :0
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 p0), (X p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X p0), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (G (OR p1 p0))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1)), (F (NOT (OR (NOT p1) p0)))]
Knowledge based reduction with 10 factoid took 260 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 90 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1)]
Stuttering acceptance computed with spot in 82 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1)]
Stuttering acceptance computed with spot in 86 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1)]
Product exploration explored 100000 steps with 0 reset in 256 ms.
Product exploration explored 100000 steps with 0 reset in 535 ms.
Built C files in :
/tmp/ltsmin4382182756427145331
[2025-06-02 17:37:58] [INFO ] Computing symmetric may disable matrix : 198 transitions.
[2025-06-02 17:37:58] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 17:37:58] [INFO ] Computing symmetric may enable matrix : 198 transitions.
[2025-06-02 17:37:58] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 17:37:58] [INFO ] Computing Do-Not-Accords matrix : 198 transitions.
[2025-06-02 17:37:58] [INFO ] Computation of Completed DNA matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 17:37:58] [INFO ] Built C files in 36ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4382182756427145331
Running compilation step : cd /tmp/ltsmin4382182756427145331;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 613 ms.
Running link step : cd /tmp/ltsmin4382182756427145331;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 50 ms.
Running LTSmin : cd /tmp/ltsmin4382182756427145331;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased7461645873584942607.hoa' '--buchi-type=spotba'
LTSmin run took 544 ms.
FORMULA FireWire-PT-15-LTLCardinality-03 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property FireWire-PT-15-LTLCardinality-03 finished in 113160 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(((p1&&X(!p2)) U (G((p1&&X(!p2)))||(p1&&X(p3))))))))'
Support contains 5 out of 164 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 164/164 places, 244/244 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 163 transition count 244
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 5 place count 159 transition count 239
Iterating global reduction 1 with 4 rules applied. Total rules applied 9 place count 159 transition count 239
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 12 place count 156 transition count 234
Iterating global reduction 1 with 3 rules applied. Total rules applied 15 place count 156 transition count 234
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 18 place count 153 transition count 230
Iterating global reduction 1 with 3 rules applied. Total rules applied 21 place count 153 transition count 230
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 22 place count 153 transition count 229
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 23 place count 152 transition count 227
Iterating global reduction 2 with 1 rules applied. Total rules applied 24 place count 152 transition count 227
Applied a total of 24 rules in 25 ms. Remains 152 /164 variables (removed 12) and now considering 227/244 (removed 17) transitions.
// Phase 1: matrix 227 rows 152 cols
[2025-06-02 17:38:00] [INFO ] Computed 4 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:38:00] [INFO ] Implicit Places using invariants in 179 ms returned []
[2025-06-02 17:38:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:38:00] [INFO ] Implicit Places using invariants and state equation in 367 ms returned []
Implicit Place search using SMT with State Equation took 570 ms to find 0 implicit places.
Running 226 sub problems to find dead transitions.
[2025-06-02 17:38:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/151 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 1 (OVERLAPS) 1/152 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 226 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:38:04] [INFO ] Deduced a trap composed of 45 places in 155 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:38:04] [INFO ] Deduced a trap composed of 75 places in 160 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:38:04] [INFO ] Deduced a trap composed of 78 places in 164 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:38:05] [INFO ] Deduced a trap composed of 47 places in 164 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:38:05] [INFO ] Deduced a trap composed of 48 places in 163 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:38:05] [INFO ] Deduced a trap composed of 87 places in 156 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:38:05] [INFO ] Deduced a trap composed of 80 places in 167 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:38:06] [INFO ] Deduced a trap composed of 38 places in 151 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:38:06] [INFO ] Deduced a trap composed of 77 places in 154 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:38:06] [INFO ] Deduced a trap composed of 82 places in 163 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:38:07] [INFO ] Deduced a trap composed of 59 places in 131 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:38:07] [INFO ] Deduced a trap composed of 85 places in 143 ms of which 19 ms to minimize.
Problem TDEAD126 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:38:07] [INFO ] Deduced a trap composed of 78 places in 152 ms of which 17 ms to minimize.
Problem TDEAD139 is UNSAT
Problem TDEAD171 is UNSAT
Problem TDEAD172 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD186 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD197 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD202 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/152 variables, 13/17 constraints. Problems are: Problem set: 15 solved, 211 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:38:08] [INFO ] Deduced a trap composed of 75 places in 152 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:38:08] [INFO ] Deduced a trap composed of 80 places in 161 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:38:09] [INFO ] Deduced a trap composed of 76 places in 123 ms of which 8 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/152 variables, 3/20 constraints. Problems are: Problem set: 15 solved, 211 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:38:11] [INFO ] Deduced a trap composed of 81 places in 154 ms of which 27 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/152 variables, 1/21 constraints. Problems are: Problem set: 15 solved, 211 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:38:14] [INFO ] Deduced a trap composed of 78 places in 136 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:38:14] [INFO ] Deduced a trap composed of 81 places in 136 ms of which 16 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/152 variables, 2/23 constraints. Problems are: Problem set: 15 solved, 211 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/152 variables, 0/23 constraints. Problems are: Problem set: 15 solved, 211 unsolved
At refinement iteration 7 (OVERLAPS) 227/379 variables, 152/175 constraints. Problems are: Problem set: 15 solved, 211 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/379 variables, 0/175 constraints. Problems are: Problem set: 15 solved, 211 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 1.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 1.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 1.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 1.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 timeout
0.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 9 (OVERLAPS) 0/379 variables, 0/175 constraints. Problems are: Problem set: 15 solved, 211 unsolved
No progress, stopping.
After SMT solving in domain Real declared 379/379 variables, and 175 constraints, problems are : Problem set: 15 solved, 211 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 152/152 constraints, PredecessorRefiner: 226/226 constraints, Known Traps: 19/19 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 15 solved, 211 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/151 variables, 0/0 constraints. Problems are: Problem set: 15 solved, 211 unsolved
At refinement iteration 1 (OVERLAPS) 1/152 variables, 4/4 constraints. Problems are: Problem set: 15 solved, 211 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/152 variables, 19/23 constraints. Problems are: Problem set: 15 solved, 211 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/152 variables, 0/23 constraints. Problems are: Problem set: 15 solved, 211 unsolved
At refinement iteration 4 (OVERLAPS) 227/379 variables, 152/175 constraints. Problems are: Problem set: 15 solved, 211 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/379 variables, 211/386 constraints. Problems are: Problem set: 15 solved, 211 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:38:41] [INFO ] Deduced a trap along path composed of 7 places in 45 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/379 variables, 1/387 constraints. Problems are: Problem set: 15 solved, 211 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 379/379 variables, and 387 constraints, problems are : Problem set: 15 solved, 211 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 152/152 constraints, PredecessorRefiner: 211/226 constraints, Known Traps: 19/19 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 60069ms problems are : Problem set: 15 solved, 211 unsolved
Search for dead transitions found 15 dead transitions in 60071ms
Found 15 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 15 transitions
Dead transitions reduction (with SMT) removed 15 transitions
Starting structural reductions in LTL mode, iteration 1 : 152/164 places, 212/244 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 151 transition count 211
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 151 transition count 211
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 150 transition count 210
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 150 transition count 210
Applied a total of 4 rules in 8 ms. Remains 150 /152 variables (removed 2) and now considering 210/212 (removed 2) transitions.
// Phase 1: matrix 210 rows 150 cols
[2025-06-02 17:39:00] [INFO ] Computed 4 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:39:01] [INFO ] Implicit Places using invariants in 133 ms returned []
[2025-06-02 17:39:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:39:01] [INFO ] Implicit Places using invariants and state equation in 237 ms returned []
Implicit Place search using SMT with State Equation took 396 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 150/164 places, 210/244 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 61072 ms. Remains : 150/164 places, 210/244 transitions.
Stuttering acceptance computed with spot in 262 ms :[(OR (NOT p0) (NOT p1) (AND p2 (NOT p3))), (NOT p0), (OR (NOT p1) (AND p2 (NOT p3))), (AND p2 (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3))]
Running random walk in product with property : FireWire-PT-15-LTLCardinality-06
Product exploration explored 100000 steps with 2 reset in 84 ms.
Stack based approach found an accepted trace after 15 steps with 2 reset with depth 4 and stack size 4 in 0 ms.
FORMULA FireWire-PT-15-LTLCardinality-06 FALSE TECHNIQUES STACK_TEST
Treatment of property FireWire-PT-15-LTLCardinality-06 finished in 61451 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 164 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 164/164 places, 244/244 transitions.
Graph (trivial) has 124 edges and 164 vertex of which 11 / 164 are part of one of the 3 SCC in 1 ms
Free SCC test removed 8 places
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Graph (complete) has 431 edges and 156 vertex of which 155 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 0 with 17 rules applied. Total rules applied 19 place count 154 transition count 217
Reduce places removed 17 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 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 1 with 20 rules applied. Total rules applied 39 place count 137 transition count 214
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 40 place count 136 transition count 214
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 14 Pre rules applied. Total rules applied 40 place count 136 transition count 200
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 68 place count 122 transition count 200
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 72 place count 118 transition count 195
Iterating global reduction 3 with 4 rules applied. Total rules applied 76 place count 118 transition count 195
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 76 place count 118 transition count 193
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 80 place count 116 transition count 193
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 83 place count 113 transition count 188
Iterating global reduction 3 with 3 rules applied. Total rules applied 86 place count 113 transition count 188
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 89 place count 110 transition count 184
Iterating global reduction 3 with 3 rules applied. Total rules applied 92 place count 110 transition count 184
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 93 place count 110 transition count 183
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 94 place count 109 transition count 181
Iterating global reduction 4 with 1 rules applied. Total rules applied 95 place count 109 transition count 181
Performed 14 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 4 with 28 rules applied. Total rules applied 123 place count 95 transition count 166
Performed 16 Post agglomeration using F-continuation condition with reduction of 4 identical transitions.
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 4 with 32 rules applied. Total rules applied 155 place count 79 transition count 233
Drop transitions (Redundant composition of simpler transitions.) removed 15 transitions
Redundant transition composition rules discarded 15 transitions
Iterating global reduction 4 with 15 rules applied. Total rules applied 170 place count 79 transition count 218
Applied a total of 170 rules in 35 ms. Remains 79 /164 variables (removed 85) and now considering 218/244 (removed 26) transitions.
[2025-06-02 17:39:01] [INFO ] Flow matrix only has 207 transitions (discarded 11 similar events)
// Phase 1: matrix 207 rows 79 cols
[2025-06-02 17:39:01] [INFO ] Computed 4 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:39:01] [INFO ] Implicit Places using invariants in 119 ms returned []
[2025-06-02 17:39:01] [INFO ] Flow matrix only has 207 transitions (discarded 11 similar events)
[2025-06-02 17:39:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:39:01] [INFO ] State equation strengthened by 34 read => feed constraints.
[2025-06-02 17:39:02] [INFO ] Implicit Places using invariants and state equation in 308 ms returned []
Implicit Place search using SMT with State Equation took 432 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 17:39:02] [INFO ] Redundant transitions in 3 ms returned []
Running 215 sub problems to find dead transitions.
[2025-06-02 17:39:02] [INFO ] Flow matrix only has 207 transitions (discarded 11 similar events)
[2025-06-02 17:39:02] [INFO ] Invariant cache hit.
[2025-06-02 17:39:02] [INFO ] State equation strengthened by 34 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/78 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/78 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 2 (OVERLAPS) 1/79 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 215 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:39:05] [INFO ] Deduced a trap composed of 31 places in 134 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:39:05] [INFO ] Deduced a trap composed of 32 places in 115 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:39:05] [INFO ] Deduced a trap composed of 43 places in 116 ms of which 19 ms to minimize.
Problem TDEAD14 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD37 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:39:05] [INFO ] Deduced a trap composed of 45 places in 97 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:39:05] [INFO ] Deduced a trap composed of 18 places in 91 ms of which 5 ms to minimize.
Problem TDEAD58 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:39:05] [INFO ] Deduced a trap composed of 16 places in 99 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:39:05] [INFO ] Deduced a trap composed of 44 places in 88 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:39:06] [INFO ] Deduced a trap composed of 45 places in 104 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:39:06] [INFO ] Deduced a trap composed of 45 places in 117 ms of which 9 ms to minimize.
Problem TDEAD87 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD123 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/79 variables, 9/13 constraints. Problems are: Problem set: 24 solved, 191 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/79 variables, 0/13 constraints. Problems are: Problem set: 24 solved, 191 unsolved
At refinement iteration 5 (OVERLAPS) 206/285 variables, 79/92 constraints. Problems are: Problem set: 24 solved, 191 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/285 variables, 34/126 constraints. Problems are: Problem set: 24 solved, 191 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/285 variables, 0/126 constraints. Problems are: Problem set: 24 solved, 191 unsolved
At refinement iteration 8 (OVERLAPS) 0/285 variables, 0/126 constraints. Problems are: Problem set: 24 solved, 191 unsolved
No progress, stopping.
After SMT solving in domain Real declared 285/286 variables, and 126 constraints, problems are : Problem set: 24 solved, 191 unsolved in 15296 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 79/79 constraints, ReadFeed: 34/34 constraints, PredecessorRefiner: 215/215 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 24 solved, 191 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/78 variables, 1/1 constraints. Problems are: Problem set: 24 solved, 191 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/78 variables, 8/9 constraints. Problems are: Problem set: 24 solved, 191 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/78 variables, 0/9 constraints. Problems are: Problem set: 24 solved, 191 unsolved
At refinement iteration 3 (OVERLAPS) 1/79 variables, 3/12 constraints. Problems are: Problem set: 24 solved, 191 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/79 variables, 1/13 constraints. Problems are: Problem set: 24 solved, 191 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/79 variables, 0/13 constraints. Problems are: Problem set: 24 solved, 191 unsolved
At refinement iteration 6 (OVERLAPS) 206/285 variables, 79/92 constraints. Problems are: Problem set: 24 solved, 191 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/285 variables, 34/126 constraints. Problems are: Problem set: 24 solved, 191 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/285 variables, 191/317 constraints. Problems are: Problem set: 24 solved, 191 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/285 variables, 0/317 constraints. Problems are: Problem set: 24 solved, 191 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 285/286 variables, and 317 constraints, problems are : Problem set: 24 solved, 191 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 79/79 constraints, ReadFeed: 34/34 constraints, PredecessorRefiner: 191/215 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 45363ms problems are : Problem set: 24 solved, 191 unsolved
Search for dead transitions found 24 dead transitions in 45365ms
Found 24 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 24 transitions
Dead transitions reduction (with SMT) removed 24 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 79/164 places, 194/244 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 78 transition count 193
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 78 transition count 193
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 77 transition count 198
Applied a total of 4 rules in 6 ms. Remains 77 /79 variables (removed 2) and now considering 198/194 (removed -4) transitions.
[2025-06-02 17:39:47] [INFO ] Flow matrix only has 187 transitions (discarded 11 similar events)
// Phase 1: matrix 187 rows 77 cols
[2025-06-02 17:39:47] [INFO ] Computed 4 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:39:47] [INFO ] Implicit Places using invariants in 91 ms returned []
[2025-06-02 17:39:47] [INFO ] Flow matrix only has 187 transitions (discarded 11 similar events)
[2025-06-02 17:39:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:39:47] [INFO ] State equation strengthened by 27 read => feed constraints.
[2025-06-02 17:39:47] [INFO ] Implicit Places using invariants and state equation in 187 ms returned []
Implicit Place search using SMT with State Equation took 290 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 77/164 places, 198/244 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 46138 ms. Remains : 77/164 places, 198/244 transitions.
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FireWire-PT-15-LTLCardinality-07
Product exploration explored 100000 steps with 0 reset in 125 ms.
Product exploration explored 100000 steps with 0 reset in 212 ms.
Computed a total of 11 stabilizing places and 18 stable transitions
Computed a total of 11 stabilizing places and 18 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 128 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 104 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (3636 resets) in 86 ms. (459 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (1280 resets) in 42 ms. (930 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 1030 steps, run visited all 1 properties in 6 ms. (steps per millisecond=171 )
Probabilistic random walk after 1030 steps, saw 489 distinct states, run finished after 6 ms. (steps per millisecond=171 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 141 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 84 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 77 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 77/77 places, 198/198 transitions.
Applied a total of 0 rules in 4 ms. Remains 77 /77 variables (removed 0) and now considering 198/198 (removed 0) transitions.
[2025-06-02 17:39:48] [INFO ] Flow matrix only has 187 transitions (discarded 11 similar events)
[2025-06-02 17:39:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:39:48] [INFO ] Implicit Places using invariants in 98 ms returned []
[2025-06-02 17:39:48] [INFO ] Flow matrix only has 187 transitions (discarded 11 similar events)
[2025-06-02 17:39:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:39:49] [INFO ] State equation strengthened by 27 read => feed constraints.
[2025-06-02 17:39:49] [INFO ] Implicit Places using invariants and state equation in 245 ms returned []
Implicit Place search using SMT with State Equation took 345 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 17:39:49] [INFO ] Redundant transitions in 1 ms returned []
Running 195 sub problems to find dead transitions.
[2025-06-02 17:39:49] [INFO ] Flow matrix only has 187 transitions (discarded 11 similar events)
[2025-06-02 17:39:49] [INFO ] Invariant cache hit.
[2025-06-02 17:39:49] [INFO ] State equation strengthened by 27 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/76 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 2 (OVERLAPS) 1/77 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 195 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:39:51] [INFO ] Deduced a trap composed of 15 places in 101 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:39:51] [INFO ] Deduced a trap composed of 42 places in 117 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:39:52] [INFO ] Deduced a trap composed of 41 places in 110 ms of which 8 ms to minimize.
Problem TDEAD192 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD194 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/77 variables, 3/7 constraints. Problems are: Problem set: 3 solved, 192 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/77 variables, 0/7 constraints. Problems are: Problem set: 3 solved, 192 unsolved
At refinement iteration 5 (OVERLAPS) 186/263 variables, 77/84 constraints. Problems are: Problem set: 3 solved, 192 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/263 variables, 27/111 constraints. Problems are: Problem set: 3 solved, 192 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/263 variables, 0/111 constraints. Problems are: Problem set: 3 solved, 192 unsolved
At refinement iteration 8 (OVERLAPS) 0/263 variables, 0/111 constraints. Problems are: Problem set: 3 solved, 192 unsolved
No progress, stopping.
After SMT solving in domain Real declared 263/264 variables, and 111 constraints, problems are : Problem set: 3 solved, 192 unsolved in 12101 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 77/77 constraints, ReadFeed: 27/27 constraints, PredecessorRefiner: 195/195 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 192 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 192 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/76 variables, 2/3 constraints. Problems are: Problem set: 3 solved, 192 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/76 variables, 0/3 constraints. Problems are: Problem set: 3 solved, 192 unsolved
At refinement iteration 3 (OVERLAPS) 1/77 variables, 3/6 constraints. Problems are: Problem set: 3 solved, 192 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/77 variables, 1/7 constraints. Problems are: Problem set: 3 solved, 192 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/77 variables, 0/7 constraints. Problems are: Problem set: 3 solved, 192 unsolved
At refinement iteration 6 (OVERLAPS) 186/263 variables, 77/84 constraints. Problems are: Problem set: 3 solved, 192 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/263 variables, 27/111 constraints. Problems are: Problem set: 3 solved, 192 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/263 variables, 192/303 constraints. Problems are: Problem set: 3 solved, 192 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/263 variables, 0/303 constraints. Problems are: Problem set: 3 solved, 192 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 263/264 variables, and 303 constraints, problems are : Problem set: 3 solved, 192 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 77/77 constraints, ReadFeed: 27/27 constraints, PredecessorRefiner: 192/195 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 42159ms problems are : Problem set: 3 solved, 192 unsolved
Search for dead transitions found 3 dead transitions in 42161ms
Found 3 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 3 transitions
Dead transitions reduction (with SMT) removed 3 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 77/77 places, 195/198 transitions.
Applied a total of 0 rules in 3 ms. Remains 77 /77 variables (removed 0) and now considering 195/195 (removed 0) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 17:40:31] [INFO ] Redundant transitions in 1 ms returned []
Finished structural reductions in SI_LTL mode , in 2 iterations and 42528 ms. Remains : 77/77 places, 195/198 transitions.
Computed a total of 11 stabilizing places and 18 stable transitions
Computed a total of 11 stabilizing places and 18 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 82 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 100 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (3609 resets) in 100 ms. (396 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (1279 resets) in 56 ms. (701 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 1030 steps, run visited all 1 properties in 8 ms. (steps per millisecond=128 )
Probabilistic random walk after 1030 steps, saw 489 distinct states, run finished after 8 ms. (steps per millisecond=128 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 143 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 99 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 99 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 97 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 82 ms.
Product exploration explored 100000 steps with 0 reset in 92 ms.
Built C files in :
/tmp/ltsmin1206456772372217468
[2025-06-02 17:40:32] [INFO ] Computing symmetric may disable matrix : 195 transitions.
[2025-06-02 17:40:32] [INFO ] Computation of Complete disable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 17:40:32] [INFO ] Computing symmetric may enable matrix : 195 transitions.
[2025-06-02 17:40:32] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 17:40:32] [INFO ] Computing Do-Not-Accords matrix : 195 transitions.
[2025-06-02 17:40:32] [INFO ] Computation of Completed DNA matrix. took 8 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 17:40:32] [INFO ] Built C files in 59ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1206456772372217468
Running compilation step : cd /tmp/ltsmin1206456772372217468;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 796 ms.
Running link step : cd /tmp/ltsmin1206456772372217468;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin1206456772372217468;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased17850354326665907906.hoa' '--buchi-type=spotba'
LTSmin run took 362 ms.
FORMULA FireWire-PT-15-LTLCardinality-07 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property FireWire-PT-15-LTLCardinality-07 finished in 91898 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 164 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 164/164 places, 244/244 transitions.
Graph (trivial) has 127 edges and 164 vertex of which 11 / 164 are part of one of the 3 SCC in 1 ms
Free SCC test removed 8 places
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Graph (complete) has 431 edges and 156 vertex of which 155 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 0 with 18 rules applied. Total rules applied 20 place count 154 transition count 216
Reduce places removed 18 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 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 1 with 21 rules applied. Total rules applied 41 place count 136 transition count 213
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 42 place count 135 transition count 213
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 14 Pre rules applied. Total rules applied 42 place count 135 transition count 199
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 70 place count 121 transition count 199
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 73 place count 118 transition count 195
Iterating global reduction 3 with 3 rules applied. Total rules applied 76 place count 118 transition count 195
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 76 place count 118 transition count 193
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 80 place count 116 transition count 193
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 82 place count 114 transition count 191
Iterating global reduction 3 with 2 rules applied. Total rules applied 84 place count 114 transition count 191
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 86 place count 112 transition count 188
Iterating global reduction 3 with 2 rules applied. Total rules applied 88 place count 112 transition count 188
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 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 3 with 2 rules applied. Total rules applied 90 place count 112 transition count 186
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 91 place count 111 transition count 186
Performed 14 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 5 with 28 rules applied. Total rules applied 119 place count 97 transition count 171
Performed 16 Post agglomeration using F-continuation condition with reduction of 4 identical transitions.
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 5 with 32 rules applied. Total rules applied 151 place count 81 transition count 239
Drop transitions (Redundant composition of simpler transitions.) removed 15 transitions
Redundant transition composition rules discarded 15 transitions
Iterating global reduction 5 with 15 rules applied. Total rules applied 166 place count 81 transition count 224
Applied a total of 166 rules in 38 ms. Remains 81 /164 variables (removed 83) and now considering 224/244 (removed 20) transitions.
[2025-06-02 17:40:33] [INFO ] Flow matrix only has 213 transitions (discarded 11 similar events)
// Phase 1: matrix 213 rows 81 cols
[2025-06-02 17:40:33] [INFO ] Computed 4 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:40:33] [INFO ] Implicit Places using invariants in 177 ms returned []
[2025-06-02 17:40:33] [INFO ] Flow matrix only has 213 transitions (discarded 11 similar events)
[2025-06-02 17:40:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:40:33] [INFO ] State equation strengthened by 35 read => feed constraints.
[2025-06-02 17:40:34] [INFO ] Implicit Places using invariants and state equation in 326 ms returned []
Implicit Place search using SMT with State Equation took 506 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 17:40:34] [INFO ] Redundant transitions in 2 ms returned []
Running 221 sub problems to find dead transitions.
[2025-06-02 17:40:34] [INFO ] Flow matrix only has 213 transitions (discarded 11 similar events)
[2025-06-02 17:40:34] [INFO ] Invariant cache hit.
[2025-06-02 17:40:34] [INFO ] State equation strengthened by 35 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/80 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 2 (OVERLAPS) 1/81 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 221 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:40:37] [INFO ] Deduced a trap composed of 43 places in 139 ms of which 17 ms to minimize.
Problem TDEAD13 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD41 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:40:37] [INFO ] Deduced a trap composed of 45 places in 130 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:40:37] [INFO ] Deduced a trap composed of 18 places in 142 ms of which 12 ms to minimize.
Problem TDEAD62 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:40:37] [INFO ] Deduced a trap composed of 16 places in 126 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:40:38] [INFO ] Deduced a trap composed of 42 places in 119 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:40:38] [INFO ] Deduced a trap composed of 45 places in 126 ms of which 15 ms to minimize.
Problem TDEAD91 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD128 is UNSAT
Problem TDEAD129 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/81 variables, 6/10 constraints. Problems are: Problem set: 28 solved, 193 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/81 variables, 0/10 constraints. Problems are: Problem set: 28 solved, 193 unsolved
At refinement iteration 5 (OVERLAPS) 212/293 variables, 81/91 constraints. Problems are: Problem set: 28 solved, 193 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/293 variables, 35/126 constraints. Problems are: Problem set: 28 solved, 193 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/293 variables, 0/126 constraints. Problems are: Problem set: 28 solved, 193 unsolved
At refinement iteration 8 (OVERLAPS) 0/293 variables, 0/126 constraints. Problems are: Problem set: 28 solved, 193 unsolved
No progress, stopping.
After SMT solving in domain Real declared 293/294 variables, and 126 constraints, problems are : Problem set: 28 solved, 193 unsolved in 12728 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 81/81 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 221/221 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 28 solved, 193 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 1/1 constraints. Problems are: Problem set: 28 solved, 193 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/80 variables, 5/6 constraints. Problems are: Problem set: 28 solved, 193 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 0/6 constraints. Problems are: Problem set: 28 solved, 193 unsolved
At refinement iteration 3 (OVERLAPS) 1/81 variables, 3/9 constraints. Problems are: Problem set: 28 solved, 193 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/81 variables, 1/10 constraints. Problems are: Problem set: 28 solved, 193 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/81 variables, 0/10 constraints. Problems are: Problem set: 28 solved, 193 unsolved
At refinement iteration 6 (OVERLAPS) 212/293 variables, 81/91 constraints. Problems are: Problem set: 28 solved, 193 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/293 variables, 35/126 constraints. Problems are: Problem set: 28 solved, 193 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/293 variables, 193/319 constraints. Problems are: Problem set: 28 solved, 193 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:40:55] [INFO ] Deduced a trap composed of 45 places in 96 ms of which 12 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/293 variables, 1/320 constraints. Problems are: Problem set: 28 solved, 193 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 293/294 variables, and 320 constraints, problems are : Problem set: 28 solved, 193 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 81/81 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 193/221 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 42830ms problems are : Problem set: 28 solved, 193 unsolved
Search for dead transitions found 28 dead transitions in 42832ms
Found 28 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 28 transitions
Dead transitions reduction (with SMT) removed 28 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 81/164 places, 196/244 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 80 transition count 201
Applied a total of 2 rules in 7 ms. Remains 80 /81 variables (removed 1) and now considering 201/196 (removed -5) transitions.
[2025-06-02 17:41:16] [INFO ] Flow matrix only has 190 transitions (discarded 11 similar events)
// Phase 1: matrix 190 rows 80 cols
[2025-06-02 17:41:16] [INFO ] Computed 4 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:41:17] [INFO ] Implicit Places using invariants in 165 ms returned []
[2025-06-02 17:41:17] [INFO ] Flow matrix only has 190 transitions (discarded 11 similar events)
[2025-06-02 17:41:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:41:17] [INFO ] State equation strengthened by 27 read => feed constraints.
[2025-06-02 17:41:17] [INFO ] Implicit Places using invariants and state equation in 267 ms returned []
Implicit Place search using SMT with State Equation took 443 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 80/164 places, 201/244 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 43837 ms. Remains : 80/164 places, 201/244 transitions.
Stuttering acceptance computed with spot in 99 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FireWire-PT-15-LTLCardinality-13
Product exploration explored 100000 steps with 2 reset in 68 ms.
Product exploration explored 100000 steps with 0 reset in 77 ms.
Computed a total of 16 stabilizing places and 23 stable transitions
Computed a total of 16 stabilizing places and 23 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 97 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 93 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 3340 steps (306 resets) in 11 ms. (278 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 132 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 97 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 94 ms :[(NOT p0), (NOT p0)]
Support contains 1 out of 80 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 80/80 places, 201/201 transitions.
Applied a total of 0 rules in 4 ms. Remains 80 /80 variables (removed 0) and now considering 201/201 (removed 0) transitions.
[2025-06-02 17:41:18] [INFO ] Flow matrix only has 190 transitions (discarded 11 similar events)
[2025-06-02 17:41:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:41:18] [INFO ] Implicit Places using invariants in 158 ms returned []
[2025-06-02 17:41:18] [INFO ] Flow matrix only has 190 transitions (discarded 11 similar events)
[2025-06-02 17:41:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:41:18] [INFO ] State equation strengthened by 27 read => feed constraints.
[2025-06-02 17:41:18] [INFO ] Implicit Places using invariants and state equation in 310 ms returned []
Implicit Place search using SMT with State Equation took 470 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 17:41:18] [INFO ] Redundant transitions in 1 ms returned []
Running 198 sub problems to find dead transitions.
[2025-06-02 17:41:18] [INFO ] Flow matrix only has 190 transitions (discarded 11 similar events)
[2025-06-02 17:41:18] [INFO ] Invariant cache hit.
[2025-06-02 17:41:18] [INFO ] State equation strengthened by 27 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/79 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/79 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 2 (OVERLAPS) 1/80 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 198 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:41:21] [INFO ] Deduced a trap composed of 43 places in 106 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:41:21] [INFO ] Deduced a trap composed of 44 places in 121 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:41:21] [INFO ] Deduced a trap composed of 15 places in 106 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:41:21] [INFO ] Deduced a trap composed of 40 places in 106 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:41:22] [INFO ] Deduced a trap composed of 42 places in 122 ms of which 9 ms to minimize.
Problem TDEAD189 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD191 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/80 variables, 5/9 constraints. Problems are: Problem set: 3 solved, 195 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/80 variables, 0/9 constraints. Problems are: Problem set: 3 solved, 195 unsolved
At refinement iteration 5 (OVERLAPS) 189/269 variables, 80/89 constraints. Problems are: Problem set: 3 solved, 195 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/269 variables, 27/116 constraints. Problems are: Problem set: 3 solved, 195 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/269 variables, 0/116 constraints. Problems are: Problem set: 3 solved, 195 unsolved
At refinement iteration 8 (OVERLAPS) 0/269 variables, 0/116 constraints. Problems are: Problem set: 3 solved, 195 unsolved
No progress, stopping.
After SMT solving in domain Real declared 269/270 variables, and 116 constraints, problems are : Problem set: 3 solved, 195 unsolved in 11083 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 80/80 constraints, ReadFeed: 27/27 constraints, PredecessorRefiner: 198/198 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 195 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/79 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 195 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/79 variables, 1/2 constraints. Problems are: Problem set: 3 solved, 195 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/79 variables, 0/2 constraints. Problems are: Problem set: 3 solved, 195 unsolved
At refinement iteration 3 (OVERLAPS) 1/80 variables, 3/5 constraints. Problems are: Problem set: 3 solved, 195 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/80 variables, 4/9 constraints. Problems are: Problem set: 3 solved, 195 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/80 variables, 0/9 constraints. Problems are: Problem set: 3 solved, 195 unsolved
At refinement iteration 6 (OVERLAPS) 189/269 variables, 80/89 constraints. Problems are: Problem set: 3 solved, 195 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/269 variables, 27/116 constraints. Problems are: Problem set: 3 solved, 195 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/269 variables, 195/311 constraints. Problems are: Problem set: 3 solved, 195 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:41:36] [INFO ] Deduced a trap composed of 49 places in 71 ms of which 6 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/269 variables, 1/312 constraints. Problems are: Problem set: 3 solved, 195 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 269/270 variables, and 312 constraints, problems are : Problem set: 3 solved, 195 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 80/80 constraints, ReadFeed: 27/27 constraints, PredecessorRefiner: 195/198 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 41161ms problems are : Problem set: 3 solved, 195 unsolved
Search for dead transitions found 3 dead transitions in 41162ms
Found 3 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 3 transitions
Dead transitions reduction (with SMT) removed 3 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 80/80 places, 198/201 transitions.
Applied a total of 0 rules in 9 ms. Remains 80 /80 variables (removed 0) and now considering 198/198 (removed 0) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 17:41:59] [INFO ] Redundant transitions in 1 ms returned []
Finished structural reductions in SI_LTL mode , in 2 iterations and 41676 ms. Remains : 80/80 places, 198/201 transitions.
Computed a total of 16 stabilizing places and 23 stable transitions
Computed a total of 16 stabilizing places and 23 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 107 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 93 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 2262 steps (202 resets) in 11 ms. (188 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 128 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 91 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 90 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 3 reset in 49 ms.
Product exploration explored 100000 steps with 1 reset in 54 ms.
Built C files in :
/tmp/ltsmin16867377919461198506
[2025-06-02 17:42:00] [INFO ] Computing symmetric may disable matrix : 198 transitions.
[2025-06-02 17:42:00] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 17:42:00] [INFO ] Computing symmetric may enable matrix : 198 transitions.
[2025-06-02 17:42:00] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 17:42:00] [INFO ] Computing Do-Not-Accords matrix : 198 transitions.
[2025-06-02 17:42:00] [INFO ] Computation of Completed DNA matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 17:42:00] [INFO ] Built C files in 23ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16867377919461198506
Running compilation step : cd /tmp/ltsmin16867377919461198506;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 588 ms.
Running link step : cd /tmp/ltsmin16867377919461198506;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin16867377919461198506;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased10409884548613322218.hoa' '--buchi-type=spotba'
LTSmin run took 360 ms.
FORMULA FireWire-PT-15-LTLCardinality-13 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property FireWire-PT-15-LTLCardinality-13 finished in 88080 ms.
All properties solved by simple procedures.
Total runtime 619187 ms.
BK_STOP 1748886121691
--------------------
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.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /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="FireWire-PT-15"
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-5832"
echo " Executing tool itstools"
echo " Input is FireWire-PT-15, 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 r086-smll-174860102400355"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/FireWire-PT-15.tgz
mv FireWire-PT-15 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 ;