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 | 700232.00 | 0.00 | 0.00 | FTFFTFFFFFFTFFFF | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r086-smll-174860102400356.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 LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r086-smll-174860102400356
=====================================================================
--------------------
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-LTLFireability-00
FORMULA_NAME FireWire-PT-15-LTLFireability-01
FORMULA_NAME FireWire-PT-15-LTLFireability-02
FORMULA_NAME FireWire-PT-15-LTLFireability-03
FORMULA_NAME FireWire-PT-15-LTLFireability-04
FORMULA_NAME FireWire-PT-15-LTLFireability-05
FORMULA_NAME FireWire-PT-15-LTLFireability-06
FORMULA_NAME FireWire-PT-15-LTLFireability-07
FORMULA_NAME FireWire-PT-15-LTLFireability-08
FORMULA_NAME FireWire-PT-15-LTLFireability-09
FORMULA_NAME FireWire-PT-15-LTLFireability-10
FORMULA_NAME FireWire-PT-15-LTLFireability-11
FORMULA_NAME FireWire-PT-15-LTLFireability-12
FORMULA_NAME FireWire-PT-15-LTLFireability-13
FORMULA_NAME FireWire-PT-15-LTLFireability-14
FORMULA_NAME FireWire-PT-15-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1748885947008
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
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
LTLFireability PT
Running Version 202505121319
[2025-06-02 17:39:09] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-02 17:39:09] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-02 17:39:09] [INFO ] Load time of PNML (sax parser for PT used): 187 ms
[2025-06-02 17:39:10] [INFO ] Transformed 248 places.
[2025-06-02 17:39:10] [INFO ] Transformed 383 transitions.
[2025-06-02 17:39:10] [INFO ] Found NUPN structural information;
[2025-06-02 17:39:10] [INFO ] Parsed PT model containing 248 places and 383 transitions and 1144 arcs in 406 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 22 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 7 formulas.
FORMULA FireWire-PT-15-LTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-15-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-15-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-15-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-15-LTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-15-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-15-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 32 out of 248 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 248/248 places, 383/383 transitions.
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 243 transition count 383
Discarding 56 places :
Symmetric choice reduction at 1 with 56 rule applications. Total rules 61 place count 187 transition count 327
Iterating global reduction 1 with 56 rules applied. Total rules applied 117 place count 187 transition count 327
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 118 place count 187 transition count 326
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 128 place count 177 transition count 294
Iterating global reduction 2 with 10 rules applied. Total rules applied 138 place count 177 transition count 294
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 140 place count 175 transition count 292
Iterating global reduction 2 with 2 rules applied. Total rules applied 142 place count 175 transition count 292
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 143 place count 175 transition count 291
Applied a total of 143 rules in 153 ms. Remains 175 /248 variables (removed 73) and now considering 291/383 (removed 92) transitions.
// Phase 1: matrix 291 rows 175 cols
[2025-06-02 17:39:10] [INFO ] Computed 4 invariants in 39 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:39:11] [INFO ] Implicit Places using invariants in 635 ms returned []
[2025-06-02 17:39:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:39:11] [INFO ] Implicit Places using invariants and state equation in 608 ms returned []
Implicit Place search using SMT with State Equation took 1315 ms to find 0 implicit places.
Running 290 sub problems to find dead transitions.
[2025-06-02 17:39:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/174 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 1 (OVERLAPS) 1/175 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 290 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:39:18] [INFO ] Deduced a trap composed of 84 places in 328 ms of which 62 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:39:18] [INFO ] Deduced a trap composed of 86 places in 200 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:39:19] [INFO ] Deduced a trap composed of 91 places in 184 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:39:19] [INFO ] Deduced a trap composed of 43 places in 206 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:39:20] [INFO ] Deduced a trap composed of 67 places in 181 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:39:20] [INFO ] Deduced a trap composed of 84 places in 118 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:39:20] [INFO ] Deduced a trap composed of 44 places in 122 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:39:20] [INFO ] Deduced a trap composed of 68 places in 122 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:39:20] [INFO ] Deduced a trap composed of 99 places in 137 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:39:20] [INFO ] Deduced a trap composed of 109 places in 141 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:39:21] [INFO ] Deduced a trap composed of 43 places in 172 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:39:21] [INFO ] Deduced a trap composed of 48 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:39:21] [INFO ] Deduced a trap composed of 52 places in 171 ms of which 25 ms to minimize.
Problem TDEAD135 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD151 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD219 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD231 is UNSAT
Problem TDEAD235 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:39:22] [INFO ] Deduced a trap composed of 96 places in 224 ms of which 44 ms to minimize.
Problem TDEAD239 is UNSAT
Problem TDEAD244 is UNSAT
Problem TDEAD249 is UNSAT
Problem TDEAD254 is UNSAT
Problem TDEAD259 is UNSAT
Problem TDEAD269 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/175 variables, 14/18 constraints. Problems are: Problem set: 17 solved, 273 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:39:23] [INFO ] Deduced a trap composed of 85 places in 190 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:39:24] [INFO ] Deduced a trap composed of 100 places in 202 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:39:24] [INFO ] Deduced a trap composed of 50 places in 165 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:39:25] [INFO ] Deduced a trap composed of 44 places in 197 ms of which 32 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/175 variables, 4/22 constraints. Problems are: Problem set: 17 solved, 273 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:39:28] [INFO ] Deduced a trap composed of 97 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:39:28] [INFO ] Deduced a trap composed of 107 places in 203 ms of which 23 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/175 variables, 2/24 constraints. Problems are: Problem set: 17 solved, 273 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/175 variables, 0/24 constraints. Problems are: Problem set: 17 solved, 273 unsolved
At refinement iteration 6 (OVERLAPS) 291/466 variables, 175/199 constraints. Problems are: Problem set: 17 solved, 273 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 466/466 variables, and 199 constraints, problems are : Problem set: 17 solved, 273 unsolved in 30055 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 175/175 constraints, PredecessorRefiner: 290/290 constraints, Known Traps: 20/20 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 17 solved, 273 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/174 variables, 0/0 constraints. Problems are: Problem set: 17 solved, 273 unsolved
At refinement iteration 1 (OVERLAPS) 1/175 variables, 4/4 constraints. Problems are: Problem set: 17 solved, 273 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/175 variables, 20/24 constraints. Problems are: Problem set: 17 solved, 273 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/175 variables, 0/24 constraints. Problems are: Problem set: 17 solved, 273 unsolved
At refinement iteration 4 (OVERLAPS) 291/466 variables, 175/199 constraints. Problems are: Problem set: 17 solved, 273 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/466 variables, 273/472 constraints. Problems are: Problem set: 17 solved, 273 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:39:53] [INFO ] Deduced a trap composed of 22 places in 63 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:39:56] [INFO ] Deduced a trap composed of 99 places in 118 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:39:57] [INFO ] Deduced a trap composed of 55 places in 192 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:39:58] [INFO ] Deduced a trap composed of 102 places in 177 ms of which 22 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/466 variables, 4/476 constraints. Problems are: Problem set: 17 solved, 273 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 466/466 variables, and 476 constraints, problems are : Problem set: 17 solved, 273 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 175/175 constraints, PredecessorRefiner: 273/290 constraints, Known Traps: 24/24 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60364ms problems are : Problem set: 17 solved, 273 unsolved
Search for dead transitions found 17 dead transitions in 60516ms
Found 17 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 17 transitions
Dead transitions reduction (with SMT) removed 17 transitions
Starting structural reductions in LTL mode, iteration 1 : 175/248 places, 274/383 transitions.
Applied a total of 0 rules in 8 ms. Remains 175 /175 variables (removed 0) and now considering 274/274 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 62054 ms. Remains : 175/248 places, 274/383 transitions.
Support contains 32 out of 175 places after structural reductions.
[2025-06-02 17:40:12] [INFO ] Flatten gal took : 104 ms
[2025-06-02 17:40:12] [INFO ] Flatten gal took : 51 ms
[2025-06-02 17:40:12] [INFO ] Input system was already deterministic with 274 transitions.
Support contains 30 out of 175 places (down from 32) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 27 to 26
RANDOM walk for 40000 steps (17 resets) in 2385 ms. (16 steps per ms) remains 21/26 properties
BEST_FIRST walk for 4002 steps (12 resets) in 111 ms. (35 steps per ms) remains 19/21 properties
BEST_FIRST walk for 4003 steps (10 resets) in 71 ms. (55 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4000 steps (11 resets) in 69 ms. (57 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4000 steps (9 resets) in 89 ms. (44 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4002 steps (12 resets) in 53 ms. (74 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4002 steps (9 resets) in 38 ms. (102 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4000 steps (10 resets) in 40 ms. (97 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (10 resets) in 15 ms. (250 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4001 steps (11 resets) in 19 ms. (200 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4001 steps (11 resets) in 29 ms. (133 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4002 steps (11 resets) in 16 ms. (235 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4000 steps (10 resets) in 14 ms. (266 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4000 steps (10 resets) in 21 ms. (181 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4001 steps (9 resets) in 27 ms. (142 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4001 steps (11 resets) in 16 ms. (235 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4000 steps (12 resets) in 16 ms. (235 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4001 steps (10 resets) in 36 ms. (108 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4000 steps (9 resets) in 31 ms. (125 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4001 steps (10 resets) in 37 ms. (105 steps per ms) remains 19/19 properties
// Phase 1: matrix 274 rows 175 cols
[2025-06-02 17:40:14] [INFO ] Computed 4 invariants in 4 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/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 19 unsolved
Problem AtomicPropp3 is UNSAT
At refinement iteration 1 (OVERLAPS) 141/164 variables, 4/4 constraints. Problems are: Problem set: 1 solved, 18 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:40:14] [INFO ] Deduced a trap composed of 92 places in 175 ms of which 28 ms to minimize.
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp2 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:40:14] [INFO ] Deduced a trap composed of 96 places in 198 ms of which 35 ms to minimize.
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp9 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/164 variables, 2/6 constraints. Problems are: Problem set: 5 solved, 14 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/164 variables, 0/6 constraints. Problems are: Problem set: 5 solved, 14 unsolved
At refinement iteration 4 (OVERLAPS) 265/429 variables, 164/170 constraints. Problems are: Problem set: 5 solved, 14 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/429 variables, 0/170 constraints. Problems are: Problem set: 5 solved, 14 unsolved
At refinement iteration 6 (OVERLAPS) 8/437 variables, 5/175 constraints. Problems are: Problem set: 5 solved, 14 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:40:15] [INFO ] Deduced a trap composed of 55 places in 187 ms of which 41 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/437 variables, 1/176 constraints. Problems are: Problem set: 5 solved, 14 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/437 variables, 0/176 constraints. Problems are: Problem set: 5 solved, 14 unsolved
At refinement iteration 9 (OVERLAPS) 8/445 variables, 3/179 constraints. Problems are: Problem set: 5 solved, 14 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/445 variables, 0/179 constraints. Problems are: Problem set: 5 solved, 14 unsolved
At refinement iteration 11 (OVERLAPS) 4/449 variables, 3/182 constraints. Problems are: Problem set: 5 solved, 14 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/449 variables, 0/182 constraints. Problems are: Problem set: 5 solved, 14 unsolved
At refinement iteration 13 (OVERLAPS) 0/449 variables, 0/182 constraints. Problems are: Problem set: 5 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Real declared 449/449 variables, and 182 constraints, problems are : Problem set: 5 solved, 14 unsolved in 3263 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 175/175 constraints, PredecessorRefiner: 19/19 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 5 solved, 14 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 5 solved, 14 unsolved
At refinement iteration 1 (OVERLAPS) 148/164 variables, 4/4 constraints. Problems are: Problem set: 5 solved, 14 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/164 variables, 3/7 constraints. Problems are: Problem set: 5 solved, 14 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:40:17] [INFO ] Deduced a trap composed of 96 places in 198 ms of which 33 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/164 variables, 1/8 constraints. Problems are: Problem set: 5 solved, 14 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/164 variables, 0/8 constraints. Problems are: Problem set: 5 solved, 14 unsolved
At refinement iteration 5 (OVERLAPS) 265/429 variables, 164/172 constraints. Problems are: Problem set: 5 solved, 14 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/429 variables, 13/185 constraints. Problems are: Problem set: 5 solved, 14 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:40:18] [INFO ] Deduced a trap composed of 43 places in 168 ms of which 31 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/429 variables, 1/186 constraints. Problems are: Problem set: 5 solved, 14 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/429 variables, 0/186 constraints. Problems are: Problem set: 5 solved, 14 unsolved
At refinement iteration 9 (OVERLAPS) 8/437 variables, 5/191 constraints. Problems are: Problem set: 5 solved, 14 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/437 variables, 1/192 constraints. Problems are: Problem set: 5 solved, 14 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:40:20] [INFO ] Deduced a trap composed of 67 places in 177 ms of which 22 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/437 variables, 1/193 constraints. Problems are: Problem set: 5 solved, 14 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/437 variables, 0/193 constraints. Problems are: Problem set: 5 solved, 14 unsolved
At refinement iteration 13 (OVERLAPS) 8/445 variables, 3/196 constraints. Problems are: Problem set: 5 solved, 14 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/445 variables, 0/196 constraints. Problems are: Problem set: 5 solved, 14 unsolved
At refinement iteration 15 (OVERLAPS) 4/449 variables, 3/199 constraints. Problems are: Problem set: 5 solved, 14 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/449 variables, 0/199 constraints. Problems are: Problem set: 5 solved, 14 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 449/449 variables, and 199 constraints, problems are : Problem set: 5 solved, 14 unsolved in 5011 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 175/175 constraints, PredecessorRefiner: 14/19 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 8288ms problems are : Problem set: 5 solved, 14 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 16 out of 175 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 175/175 places, 274/274 transitions.
Graph (trivial) has 109 edges and 175 vertex of which 11 / 175 are part of one of the 3 SCC in 4 ms
Free SCC test removed 8 places
Drop transitions (Empty/Sink Transition effects.) removed 12 transitions
Reduce isomorphic transitions removed 12 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 167 transition count 243
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 148 transition count 240
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 43 place count 147 transition count 240
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 43 place count 147 transition count 230
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 63 place count 137 transition count 230
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 2 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 97 place count 120 transition count 213
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 98 place count 119 transition count 211
Iterating global reduction 3 with 1 rules applied. Total rules applied 99 place count 119 transition count 211
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 100 place count 118 transition count 208
Iterating global reduction 3 with 1 rules applied. Total rules applied 101 place count 118 transition count 208
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 102 place count 117 transition count 207
Iterating global reduction 3 with 1 rules applied. Total rules applied 103 place count 117 transition count 207
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 104 place count 116 transition count 204
Iterating global reduction 3 with 1 rules applied. Total rules applied 105 place count 116 transition count 204
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 106 place count 115 transition count 203
Iterating global reduction 3 with 1 rules applied. Total rules applied 107 place count 115 transition count 203
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 108 place count 114 transition count 200
Iterating global reduction 3 with 1 rules applied. Total rules applied 109 place count 114 transition count 200
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 110 place count 113 transition count 199
Iterating global reduction 3 with 1 rules applied. Total rules applied 111 place count 113 transition count 199
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 112 place count 112 transition count 196
Iterating global reduction 3 with 1 rules applied. Total rules applied 113 place count 112 transition count 196
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 114 place count 111 transition count 195
Iterating global reduction 3 with 1 rules applied. Total rules applied 115 place count 111 transition count 195
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 116 place count 110 transition count 192
Iterating global reduction 3 with 1 rules applied. Total rules applied 117 place count 110 transition count 192
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 118 place count 109 transition count 191
Iterating global reduction 3 with 1 rules applied. Total rules applied 119 place count 109 transition count 191
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 120 place count 108 transition count 189
Iterating global reduction 3 with 1 rules applied. Total rules applied 121 place count 108 transition count 189
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: -60
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 147 place count 95 transition count 249
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 148 place count 95 transition count 248
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 4 with 5 rules applied. Total rules applied 153 place count 95 transition count 243
Free-agglomeration rule applied 5 times.
Iterating global reduction 4 with 5 rules applied. Total rules applied 158 place count 95 transition count 238
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 163 place count 90 transition count 238
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 165 place count 90 transition count 236
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 5 with 2 rules applied. Total rules applied 167 place count 90 transition count 234
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 169 place count 88 transition count 234
Applied a total of 169 rules in 236 ms. Remains 88 /175 variables (removed 87) and now considering 234/274 (removed 40) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 236 ms. Remains : 88/175 places, 234/274 transitions.
RANDOM walk for 40000 steps (3970 resets) in 1292 ms. (30 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (1027 resets) in 250 ms. (159 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40002 steps (1211 resets) in 154 ms. (258 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (1045 resets) in 169 ms. (235 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40001 steps (1055 resets) in 140 ms. (283 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (1223 resets) in 163 ms. (243 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (891 resets) in 222 ms. (179 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40002 steps (1229 resets) in 150 ms. (264 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (1204 resets) in 160 ms. (248 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (1232 resets) in 142 ms. (279 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40001 steps (1220 resets) in 143 ms. (277 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40002 steps (1225 resets) in 155 ms. (256 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (1235 resets) in 112 ms. (354 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40002 steps (1222 resets) in 127 ms. (312 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40002 steps (1232 resets) in 112 ms. (354 steps per ms) remains 14/14 properties
Finished probabilistic random walk after 11905 steps, run visited all 14 properties in 154 ms. (steps per millisecond=77 )
Probabilistic random walk after 11905 steps, saw 4055 distinct states, run finished after 160 ms. (steps per millisecond=74 ) properties seen :14
Successfully simplified 5 atomic propositions for a total of 9 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA FireWire-PT-15-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 44 stabilizing places and 66 stable transitions
FORMULA FireWire-PT-15-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
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((p0&&X((p1&&X((p1 U (X(p2)||G(p1))))))))))'
Support contains 3 out of 175 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 175/175 places, 274/274 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 167 transition count 257
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 167 transition count 257
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 17 place count 167 transition count 256
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 21 place count 163 transition count 248
Iterating global reduction 1 with 4 rules applied. Total rules applied 25 place count 163 transition count 248
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 26 place count 162 transition count 245
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 162 transition count 245
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 28 place count 161 transition count 244
Iterating global reduction 1 with 1 rules applied. Total rules applied 29 place count 161 transition count 244
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 30 place count 160 transition count 241
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 160 transition count 241
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 32 place count 159 transition count 240
Iterating global reduction 1 with 1 rules applied. Total rules applied 33 place count 159 transition count 240
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 34 place count 158 transition count 237
Iterating global reduction 1 with 1 rules applied. Total rules applied 35 place count 158 transition count 237
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 36 place count 157 transition count 236
Iterating global reduction 1 with 1 rules applied. Total rules applied 37 place count 157 transition count 236
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 38 place count 156 transition count 233
Iterating global reduction 1 with 1 rules applied. Total rules applied 39 place count 156 transition count 233
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 40 place count 155 transition count 232
Iterating global reduction 1 with 1 rules applied. Total rules applied 41 place count 155 transition count 232
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 42 place count 154 transition count 229
Iterating global reduction 1 with 1 rules applied. Total rules applied 43 place count 154 transition count 229
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 44 place count 153 transition count 228
Iterating global reduction 1 with 1 rules applied. Total rules applied 45 place count 153 transition count 228
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 46 place count 152 transition count 226
Iterating global reduction 1 with 1 rules applied. Total rules applied 47 place count 152 transition count 226
Applied a total of 47 rules in 46 ms. Remains 152 /175 variables (removed 23) and now considering 226/274 (removed 48) transitions.
// Phase 1: matrix 226 rows 152 cols
[2025-06-02 17:40:24] [INFO ] Computed 4 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:40:24] [INFO ] Implicit Places using invariants in 123 ms returned []
[2025-06-02 17:40:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:40:24] [INFO ] Implicit Places using invariants and state equation in 244 ms returned []
Implicit Place search using SMT with State Equation took 369 ms to find 0 implicit places.
Running 225 sub problems to find dead transitions.
[2025-06-02 17:40:24] [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, 225 unsolved
At refinement iteration 1 (OVERLAPS) 1/152 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 225 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:40:28] [INFO ] Deduced a trap composed of 46 places in 150 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:40:28] [INFO ] Deduced a trap composed of 35 places in 178 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:28] [INFO ] Deduced a trap composed of 76 places in 175 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:40:28] [INFO ] Deduced a trap composed of 79 places in 143 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:40:29] [INFO ] Deduced a trap composed of 39 places in 150 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:40:29] [INFO ] Deduced a trap composed of 46 places in 142 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:40:29] [INFO ] Deduced a trap composed of 88 places in 140 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:40:29] [INFO ] Deduced a trap composed of 81 places in 132 ms of which 20 ms to minimize.
Problem TDEAD124 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD183 is UNSAT
Problem TDEAD184 is UNSAT
Problem TDEAD187 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD200 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/152 variables, 8/12 constraints. Problems are: Problem set: 15 solved, 210 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:40:31] [INFO ] Deduced a trap composed of 47 places in 137 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:40:31] [INFO ] Deduced a trap composed of 79 places in 149 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:40:31] [INFO ] Deduced a trap composed of 82 places in 152 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:40:31] [INFO ] Deduced a trap composed of 79 places in 116 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:40:31] [INFO ] Deduced a trap composed of 82 places in 121 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:32] [INFO ] Deduced a trap composed of 78 places in 202 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:40:32] [INFO ] Deduced a trap composed of 57 places in 179 ms of which 34 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/152 variables, 7/19 constraints. Problems are: Problem set: 15 solved, 210 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:40:35] [INFO ] Deduced a trap composed of 83 places in 167 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:40:36] [INFO ] Deduced a trap composed of 83 places in 147 ms of which 17 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/152 variables, 2/21 constraints. Problems are: Problem set: 15 solved, 210 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/152 variables, 0/21 constraints. Problems are: Problem set: 15 solved, 210 unsolved
At refinement iteration 6 (OVERLAPS) 226/378 variables, 152/173 constraints. Problems are: Problem set: 15 solved, 210 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/378 variables, 0/173 constraints. Problems are: Problem set: 15 solved, 210 unsolved
At refinement iteration 8 (OVERLAPS) 0/378 variables, 0/173 constraints. Problems are: Problem set: 15 solved, 210 unsolved
No progress, stopping.
After SMT solving in domain Real declared 378/378 variables, and 173 constraints, problems are : Problem set: 15 solved, 210 unsolved in 27909 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 152/152 constraints, PredecessorRefiner: 225/225 constraints, Known Traps: 17/17 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 15 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: 15 solved, 210 unsolved
At refinement iteration 1 (OVERLAPS) 1/152 variables, 4/4 constraints. Problems are: Problem set: 15 solved, 210 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/152 variables, 17/21 constraints. Problems are: Problem set: 15 solved, 210 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/152 variables, 0/21 constraints. Problems are: Problem set: 15 solved, 210 unsolved
At refinement iteration 4 (OVERLAPS) 226/378 variables, 152/173 constraints. Problems are: Problem set: 15 solved, 210 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/378 variables, 210/383 constraints. Problems are: Problem set: 15 solved, 210 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:40:59] [INFO ] Deduced a trap composed of 77 places in 149 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:40:59] [INFO ] Deduced a trap composed of 81 places in 135 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:40:59] [INFO ] Deduced a trap composed of 88 places in 137 ms of which 16 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/378 variables, 3/386 constraints. Problems are: Problem set: 15 solved, 210 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:41:07] [INFO ] Deduced a trap composed of 22 places in 76 ms of which 6 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/378 variables, 1/387 constraints. Problems are: Problem set: 15 solved, 210 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 378/378 variables, and 387 constraints, problems are : Problem set: 15 solved, 210 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 152/152 constraints, PredecessorRefiner: 210/225 constraints, Known Traps: 21/21 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 57975ms problems are : Problem set: 15 solved, 210 unsolved
Search for dead transitions found 15 dead transitions in 57977ms
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/175 places, 211/274 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 151 transition count 210
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 151 transition count 210
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 150 transition count 209
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 150 transition count 209
Applied a total of 4 rules in 16 ms. Remains 150 /152 variables (removed 2) and now considering 209/211 (removed 2) transitions.
// Phase 1: matrix 209 rows 150 cols
[2025-06-02 17:41:22] [INFO ] Computed 4 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:41:22] [INFO ] Implicit Places using invariants in 204 ms returned []
[2025-06-02 17:41:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:41:23] [INFO ] Implicit Places using invariants and state equation in 345 ms returned []
Implicit Place search using SMT with State Equation took 556 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 150/175 places, 209/274 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 58966 ms. Remains : 150/175 places, 209/274 transitions.
Stuttering acceptance computed with spot in 691 ms :[true, (NOT p2), (OR (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : FireWire-PT-15-LTLFireability-04
Product exploration explored 100000 steps with 16666 reset in 444 ms.
Product exploration explored 100000 steps with 16666 reset in 268 ms.
Computed a total of 28 stabilizing places and 37 stable transitions
Computed a total of 28 stabilizing places and 37 stable transitions
Detected a total of 28/150 stabilizing places and 37/209 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p2 p0 p1), (X (X p0)), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 112 ms. Reduced automaton from 8 states, 12 edges and 3 AP (stutter sensitive) to 8 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 298 ms :[true, (NOT p2), (NOT p1), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (NOT p1), (NOT p1), (NOT p1)]
RANDOM walk for 40000 steps (12 resets) in 806 ms. (49 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40003 steps (14 resets) in 206 ms. (193 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (15 resets) in 130 ms. (305 steps per ms) remains 2/2 properties
[2025-06-02 17:41:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 94/97 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/97 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 42/139 variables, 2/4 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:41:25] [INFO ] Deduced a trap composed of 44 places in 154 ms of which 30 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/139 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/139 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 199/338 variables, 139/144 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/338 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 13/351 variables, 7/151 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/351 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 5/356 variables, 2/153 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/356 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem apf3 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 3/359 variables, 2/155 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/359 variables, 0/155 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/359 variables, 0/155 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 359/359 variables, and 155 constraints, problems are : Problem set: 1 solved, 1 unsolved in 631 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 150/150 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 94/96 variables, 2/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/96 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 42/138 variables, 2/4 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/138 variables, 1/5 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/138 variables, 0/5 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 197/335 variables, 138/143 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/335 variables, 1/144 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/335 variables, 0/144 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 12/347 variables, 6/150 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/347 variables, 0/150 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 8/355 variables, 3/153 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/355 variables, 0/153 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 4/359 variables, 3/156 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/359 variables, 0/156 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/359 variables, 0/156 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 359/359 variables, and 156 constraints, problems are : Problem set: 1 solved, 1 unsolved in 365 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 150/150 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1004ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 52 ms.
Support contains 2 out of 150 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 150/150 places, 209/209 transitions.
Graph (trivial) has 115 edges and 150 vertex of which 11 / 150 are part of one of the 3 SCC in 1 ms
Free SCC test removed 8 places
Drop transitions (Empty/Sink Transition effects.) removed 13 transitions
Reduce isomorphic transitions removed 13 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 19 place count 142 transition count 178
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 40 place count 124 transition count 175
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 42 place count 123 transition count 174
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 43 place count 122 transition count 174
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 16 Pre rules applied. Total rules applied 43 place count 122 transition count 158
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 75 place count 106 transition count 158
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
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 103 place count 92 transition count 144
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 4 with 32 rules applied. Total rules applied 135 place count 76 transition count 205
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 137 place count 76 transition count 203
Drop transitions (Redundant composition of simpler transitions.) removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 5 with 16 rules applied. Total rules applied 153 place count 76 transition count 187
Free-agglomeration rule applied 6 times.
Iterating global reduction 5 with 6 rules applied. Total rules applied 159 place count 76 transition count 181
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 165 place count 70 transition count 181
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 167 place count 70 transition count 179
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 168 place count 70 transition count 179
Applied a total of 168 rules in 80 ms. Remains 70 /150 variables (removed 80) and now considering 179/209 (removed 30) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 80 ms. Remains : 70/150 places, 179/209 transitions.
RANDOM walk for 40000 steps (4082 resets) in 117 ms. (338 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (1060 resets) in 34 ms. (1142 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 2229 steps, run visited all 1 properties in 11 ms. (steps per millisecond=202 )
Probabilistic random walk after 2229 steps, saw 1096 distinct states, run finished after 11 ms. (steps per millisecond=202 ) properties seen :1
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p2 p0 p1), (X (X p0)), (F (OR (G p2) (G (NOT p2)))), (G (OR p2 p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR p2 (NOT p1)))), (F (NOT p2))]
Knowledge based reduction with 4 factoid took 297 ms. Reduced automaton from 8 states, 11 edges and 2 AP (stutter sensitive) to 7 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 337 ms :[(NOT p2), (AND (NOT p2) (NOT p1)), (NOT p1), (NOT p1), (NOT p1), (NOT p1), true]
Stuttering acceptance computed with spot in 329 ms :[(NOT p2), (AND (NOT p2) (NOT p1)), (NOT p1), (NOT p1), (NOT p1), (NOT p1), true]
Support contains 3 out of 150 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 150/150 places, 209/209 transitions.
Applied a total of 0 rules in 4 ms. Remains 150 /150 variables (removed 0) and now considering 209/209 (removed 0) transitions.
[2025-06-02 17:41:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:41:27] [INFO ] Implicit Places using invariants in 187 ms returned []
[2025-06-02 17:41:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:41:28] [INFO ] Implicit Places using invariants and state equation in 327 ms returned []
Implicit Place search using SMT with State Equation took 517 ms to find 0 implicit places.
Running 208 sub problems to find dead transitions.
[2025-06-02 17:41:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/149 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 1 (OVERLAPS) 1/150 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 208 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:41:31] [INFO ] Deduced a trap composed of 46 places in 163 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:41:32] [INFO ] Deduced a trap composed of 35 places in 159 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:41:32] [INFO ] Deduced a trap composed of 77 places in 135 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:41:32] [INFO ] Deduced a trap composed of 76 places in 123 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:41:32] [INFO ] Deduced a trap composed of 76 places in 118 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:41:32] [INFO ] Deduced a trap composed of 76 places in 105 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:33] [INFO ] Deduced a trap composed of 45 places in 151 ms of which 18 ms to minimize.
Problem TDEAD173 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/150 variables, 7/11 constraints. Problems are: Problem set: 1 solved, 207 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:41:34] [INFO ] Deduced a trap composed of 78 places in 117 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:41:34] [INFO ] Deduced a trap composed of 81 places in 130 ms of which 17 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/150 variables, 2/13 constraints. Problems are: Problem set: 1 solved, 207 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:41:37] [INFO ] Deduced a trap composed of 76 places in 137 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:41:37] [INFO ] Deduced a trap composed of 39 places in 119 ms of which 11 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/150 variables, 2/15 constraints. Problems are: Problem set: 1 solved, 207 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/150 variables, 0/15 constraints. Problems are: Problem set: 1 solved, 207 unsolved
At refinement iteration 6 (OVERLAPS) 209/359 variables, 150/165 constraints. Problems are: Problem set: 1 solved, 207 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:41:43] [INFO ] Deduced a trap composed of 77 places in 130 ms of which 10 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/359 variables, 1/166 constraints. Problems are: Problem set: 1 solved, 207 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/359 variables, 0/166 constraints. Problems are: Problem set: 1 solved, 207 unsolved
At refinement iteration 9 (OVERLAPS) 0/359 variables, 0/166 constraints. Problems are: Problem set: 1 solved, 207 unsolved
No progress, stopping.
After SMT solving in domain Real declared 359/359 variables, and 166 constraints, problems are : Problem set: 1 solved, 207 unsolved in 27650 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 150/150 constraints, PredecessorRefiner: 208/208 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 207 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/149 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 207 unsolved
At refinement iteration 1 (OVERLAPS) 1/150 variables, 4/4 constraints. Problems are: Problem set: 1 solved, 207 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/150 variables, 12/16 constraints. Problems are: Problem set: 1 solved, 207 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:41:58] [INFO ] Deduced a trap composed of 37 places in 167 ms of which 27 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/150 variables, 1/17 constraints. Problems are: Problem set: 1 solved, 207 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/150 variables, 0/17 constraints. Problems are: Problem set: 1 solved, 207 unsolved
At refinement iteration 5 (OVERLAPS) 209/359 variables, 150/167 constraints. Problems are: Problem set: 1 solved, 207 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/359 variables, 207/374 constraints. Problems are: Problem set: 1 solved, 207 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:42:07] [INFO ] Deduced a trap composed of 76 places in 154 ms of which 17 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/359 variables, 1/375 constraints. Problems are: Problem set: 1 solved, 207 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/359 variables, 0/375 constraints. Problems are: Problem set: 1 solved, 207 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 359/359 variables, and 375 constraints, problems are : Problem set: 1 solved, 207 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 150/150 constraints, PredecessorRefiner: 207/208 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 57715ms problems are : Problem set: 1 solved, 207 unsolved
Search for dead transitions found 1 dead transitions in 57717ms
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 : 150/150 places, 208/209 transitions.
Applied a total of 0 rules in 5 ms. Remains 150 /150 variables (removed 0) and now considering 208/208 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 58245 ms. Remains : 150/150 places, 208/209 transitions.
Computed a total of 28 stabilizing places and 37 stable transitions
Computed a total of 28 stabilizing places and 37 stable transitions
Detected a total of 28/150 stabilizing places and 37/208 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p2 p1), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 128 ms. Reduced automaton from 7 states, 8 edges and 2 AP (stutter sensitive) to 7 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 234 ms :[(AND (NOT p1) (NOT p2)), (NOT p2), (NOT p1), (NOT p1), (NOT p1), (NOT p1), true]
RANDOM walk for 40000 steps (9 resets) in 83 ms. (476 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40002 steps (14 resets) in 42 ms. (930 steps per ms) remains 1/1 properties
// Phase 1: matrix 208 rows 150 cols
[2025-06-02 17:42:26] [INFO ] Computed 4 invariants in 1 ms
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 94/96 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/96 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 42/138 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:42:26] [INFO ] Deduced a trap composed of 35 places in 108 ms of which 17 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/138 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/138 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 196/334 variables, 138/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/334 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 12/346 variables, 6/149 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/346 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 8/354 variables, 3/152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/354 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 4/358 variables, 3/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/358 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/358 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 358/358 variables, and 155 constraints, problems are : Problem set: 0 solved, 1 unsolved in 339 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 150/150 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 94/96 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/96 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 42/138 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/138 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/138 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 196/334 variables, 138/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/334 variables, 1/144 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/334 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 12/346 variables, 6/150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/346 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 8/354 variables, 3/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/354 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 4/358 variables, 3/156 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/358 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/358 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 358/358 variables, and 156 constraints, problems are : Problem set: 0 solved, 1 unsolved in 306 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 150/150 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 653ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 15 ms.
Support contains 2 out of 150 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 150/150 places, 208/208 transitions.
Graph (trivial) has 115 edges and 150 vertex of which 11 / 150 are part of one of the 3 SCC in 1 ms
Free SCC test removed 8 places
Drop transitions (Empty/Sink Transition effects.) removed 13 transitions
Reduce isomorphic transitions removed 13 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 19 place count 142 transition count 177
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 40 place count 124 transition count 174
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 42 place count 123 transition count 173
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 43 place count 122 transition count 173
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 16 Pre rules applied. Total rules applied 43 place count 122 transition count 157
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 75 place count 106 transition count 157
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
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 103 place count 92 transition count 143
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 4 with 32 rules applied. Total rules applied 135 place count 76 transition count 202
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 137 place count 76 transition count 200
Drop transitions (Redundant composition of simpler transitions.) removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 5 with 16 rules applied. Total rules applied 153 place count 76 transition count 184
Free-agglomeration rule applied 6 times.
Iterating global reduction 5 with 6 rules applied. Total rules applied 159 place count 76 transition count 178
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 165 place count 70 transition count 178
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 167 place count 70 transition count 176
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 168 place count 70 transition count 176
Applied a total of 168 rules in 37 ms. Remains 70 /150 variables (removed 80) and now considering 176/208 (removed 32) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 37 ms. Remains : 70/150 places, 176/208 transitions.
RANDOM walk for 40000 steps (4045 resets) in 109 ms. (363 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (1074 resets) in 43 ms. (909 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 2229 steps, run visited all 1 properties in 14 ms. (steps per millisecond=159 )
Probabilistic random walk after 2229 steps, saw 1096 distinct states, run finished after 14 ms. (steps per millisecond=159 ) properties seen :1
Knowledge obtained : [(AND p2 p1), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p2))]
Knowledge based reduction with 2 factoid took 195 ms. Reduced automaton from 7 states, 8 edges and 2 AP (stutter sensitive) to 7 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 320 ms :[(AND (NOT p1) (NOT p2)), (NOT p2), (NOT p1), (NOT p1), (NOT p1), (NOT p1), true]
Stuttering acceptance computed with spot in 324 ms :[(AND (NOT p1) (NOT p2)), (NOT p2), (NOT p1), (NOT p1), (NOT p1), (NOT p1), true]
Stuttering acceptance computed with spot in 322 ms :[(AND (NOT p1) (NOT p2)), (NOT p2), (NOT p1), (NOT p1), (NOT p1), (NOT p1), true]
Product exploration explored 100000 steps with 20000 reset in 119 ms.
Product exploration explored 100000 steps with 20000 reset in 389 ms.
Applying partial POR strategy [false, true, false, false, false, false, true]
Stuttering acceptance computed with spot in 256 ms :[(AND (NOT p1) (NOT p2)), (NOT p2), (NOT p1), (NOT p1), (NOT p1), (NOT p1), true]
Support contains 3 out of 150 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 150/150 places, 208/208 transitions.
Graph (trivial) has 113 edges and 150 vertex of which 11 / 150 are part of one of the 3 SCC in 0 ms
Free SCC test removed 8 places
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 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 142 transition count 199
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 142 transition count 197
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 142 transition count 210
Deduced a syphon composed of 28 places in 0 ms
Iterating global reduction 2 with 11 rules applied. Total rules applied 31 place count 142 transition count 210
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 32 place count 141 transition count 209
Deduced a syphon composed of 27 places in 0 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 33 place count 141 transition count 209
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 45 places in 0 ms
Iterating global reduction 2 with 18 rules applied. Total rules applied 51 place count 141 transition count 218
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 57 place count 135 transition count 212
Deduced a syphon composed of 39 places in 0 ms
Iterating global reduction 2 with 6 rules applied. Total rules applied 63 place count 135 transition count 212
Performed 17 Post agglomeration using F-continuation condition with reduction of 4 identical transitions.
Deduced a syphon composed of 56 places in 0 ms
Iterating global reduction 2 with 17 rules applied. Total rules applied 80 place count 135 transition count 323
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 81 place count 135 transition count 322
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 86 place count 130 transition count 312
Deduced a syphon composed of 51 places in 0 ms
Iterating global reduction 3 with 5 rules applied. Total rules applied 91 place count 130 transition count 312
Deduced a syphon composed of 51 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 17 transitions
Redundant transition composition rules discarded 17 transitions
Iterating global reduction 3 with 17 rules applied. Total rules applied 108 place count 130 transition count 295
Deduced a syphon composed of 51 places in 0 ms
Applied a total of 108 rules in 47 ms. Remains 130 /150 variables (removed 20) and now considering 295/208 (removed -87) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 17:42:29] [INFO ] Redundant transitions in 21 ms returned []
Running 293 sub problems to find dead transitions.
[2025-06-02 17:42:29] [INFO ] Flow matrix only has 288 transitions (discarded 7 similar events)
// Phase 1: matrix 288 rows 130 cols
[2025-06-02 17:42:29] [INFO ] Computed 4 invariants in 2 ms
[2025-06-02 17:42:29] [INFO ] State equation strengthened by 29 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/129 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 1 (OVERLAPS) 1/130 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 293 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:42:34] [INFO ] Deduced a trap composed of 41 places in 161 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:42:34] [INFO ] Deduced a trap composed of 26 places in 170 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 TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:42:34] [INFO ] Deduced a trap composed of 4 places in 187 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:42:34] [INFO ] Deduced a trap composed of 7 places in 165 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:42:35] [INFO ] Deduced a trap composed of 16 places in 179 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:42:35] [INFO ] Deduced a trap composed of 17 places in 176 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:42:35] [INFO ] Deduced a trap composed of 17 places in 179 ms of which 19 ms to minimize.
Problem TDEAD37 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:42:35] [INFO ] Deduced a trap composed of 42 places in 150 ms of which 11 ms to minimize.
Problem TDEAD59 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD145 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD151 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD173 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD176 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD186 is UNSAT
Problem TDEAD187 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD227 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD271 is UNSAT
Problem TDEAD272 is UNSAT
Problem TDEAD273 is UNSAT
Problem TDEAD274 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/130 variables, 8/12 constraints. Problems are: Problem set: 102 solved, 191 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:42:37] [INFO ] Deduced a trap composed of 43 places in 161 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:42:37] [INFO ] Deduced a trap composed of 18 places in 176 ms of which 21 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/130 variables, 2/14 constraints. Problems are: Problem set: 102 solved, 191 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/130 variables, 0/14 constraints. Problems are: Problem set: 102 solved, 191 unsolved
Problem TDEAD31 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD113 is UNSAT
At refinement iteration 5 (OVERLAPS) 287/417 variables, 130/144 constraints. Problems are: Problem set: 108 solved, 185 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/417 variables, 28/172 constraints. Problems are: Problem set: 108 solved, 185 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/417 variables, 0/172 constraints. Problems are: Problem set: 108 solved, 185 unsolved
At refinement iteration 8 (OVERLAPS) 1/418 variables, 1/173 constraints. Problems are: Problem set: 108 solved, 185 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/418 variables, 0/173 constraints. Problems are: Problem set: 108 solved, 185 unsolved
At refinement iteration 10 (OVERLAPS) 0/418 variables, 0/173 constraints. Problems are: Problem set: 108 solved, 185 unsolved
No progress, stopping.
After SMT solving in domain Real declared 418/418 variables, and 173 constraints, problems are : Problem set: 108 solved, 185 unsolved in 26069 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 130/130 constraints, ReadFeed: 29/29 constraints, PredecessorRefiner: 293/293 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 108 solved, 185 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/78 variables, 0/0 constraints. Problems are: Problem set: 108 solved, 185 unsolved
At refinement iteration 1 (OVERLAPS) 49/127 variables, 4/4 constraints. Problems are: Problem set: 108 solved, 185 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/127 variables, 10/14 constraints. Problems are: Problem set: 108 solved, 185 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 0/14 constraints. Problems are: Problem set: 108 solved, 185 unsolved
At refinement iteration 4 (OVERLAPS) 286/413 variables, 127/141 constraints. Problems are: Problem set: 108 solved, 185 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/413 variables, 28/169 constraints. Problems are: Problem set: 108 solved, 185 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/413 variables, 185/354 constraints. Problems are: Problem set: 108 solved, 185 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/413 variables, 0/354 constraints. Problems are: Problem set: 108 solved, 185 unsolved
At refinement iteration 8 (OVERLAPS) 4/417 variables, 3/357 constraints. Problems are: Problem set: 108 solved, 185 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 417/418 variables, and 357 constraints, problems are : Problem set: 108 solved, 185 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 130/130 constraints, ReadFeed: 28/29 constraints, PredecessorRefiner: 185/293 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 56242ms problems are : Problem set: 108 solved, 185 unsolved
Search for dead transitions found 108 dead transitions in 56244ms
Found 108 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 108 transitions
Dead transitions reduction (with SMT) removed 108 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 130/150 places, 187/208 transitions.
Graph (complete) has 333 edges and 130 vertex of which 79 are kept as prefixes of interest. Removing 51 places using SCC suffix rule.3 ms
Discarding 51 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 15 ms. Remains 79 /130 variables (removed 51) and now considering 187/187 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 79/150 places, 187/208 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 56336 ms. Remains : 79/150 places, 187/208 transitions.
Built C files in :
/tmp/ltsmin6050234021280355125
[2025-06-02 17:43:25] [INFO ] Built C files in 24ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6050234021280355125
Running compilation step : cd /tmp/ltsmin6050234021280355125;'/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 669 ms.
Running link step : cd /tmp/ltsmin6050234021280355125;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 53 ms.
Running LTSmin : cd /tmp/ltsmin6050234021280355125;'/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/stateBased5308424327626402539.hoa' '--buchi-type=spotba'
LTSmin run took 130 ms.
FORMULA FireWire-PT-15-LTLFireability-04 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property FireWire-PT-15-LTLFireability-04 finished in 182445 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0) U X(p1)))'
Support contains 3 out of 175 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 175/175 places, 274/274 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 167 transition count 257
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 167 transition count 257
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 17 place count 167 transition count 256
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 20 place count 164 transition count 250
Iterating global reduction 1 with 3 rules applied. Total rules applied 23 place count 164 transition count 250
Applied a total of 23 rules in 8 ms. Remains 164 /175 variables (removed 11) and now considering 250/274 (removed 24) transitions.
// Phase 1: matrix 250 rows 164 cols
[2025-06-02 17:43:26] [INFO ] Computed 4 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:43:26] [INFO ] Implicit Places using invariants in 155 ms returned []
[2025-06-02 17:43:26] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:43:27] [INFO ] Implicit Places using invariants and state equation in 359 ms returned []
Implicit Place search using SMT with State Equation took 517 ms to find 0 implicit places.
Running 249 sub problems to find dead transitions.
[2025-06-02 17:43:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/163 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 1 (OVERLAPS) 1/164 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 249 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:43:30] [INFO ] Deduced a trap composed of 46 places in 129 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:43:31] [INFO ] Deduced a trap composed of 35 places in 132 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:43:31] [INFO ] Deduced a trap composed of 76 places in 146 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:43:31] [INFO ] Deduced a trap composed of 85 places in 132 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:43:31] [INFO ] Deduced a trap composed of 52 places in 146 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:43:31] [INFO ] Deduced a trap composed of 94 places in 199 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:43:32] [INFO ] Deduced a trap composed of 39 places in 197 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:43:32] [INFO ] Deduced a trap composed of 87 places in 205 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:43:32] [INFO ] Deduced a trap composed of 88 places in 135 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:43:33] [INFO ] Deduced a trap composed of 76 places in 132 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:43:33] [INFO ] Deduced a trap composed of 78 places in 184 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:43:33] [INFO ] Deduced a trap composed of 64 places in 194 ms of which 31 ms to minimize.
Problem TDEAD127 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD145 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD149 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:43:34] [INFO ] Deduced a trap composed of 85 places in 179 ms of which 28 ms to minimize.
Problem TDEAD162 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD212 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD217 is UNSAT
Problem TDEAD220 is UNSAT
Problem TDEAD221 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD225 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/164 variables, 13/17 constraints. Problems are: Problem set: 26 solved, 223 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:43:35] [INFO ] Deduced a trap composed of 79 places in 171 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:43:35] [INFO ] Deduced a trap composed of 89 places in 165 ms of which 20 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/164 variables, 2/19 constraints. Problems are: Problem set: 26 solved, 223 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:43:38] [INFO ] Deduced a trap composed of 88 places in 139 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:43:39] [INFO ] Deduced a trap composed of 53 places in 205 ms of which 36 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/164 variables, 2/21 constraints. Problems are: Problem set: 26 solved, 223 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/164 variables, 0/21 constraints. Problems are: Problem set: 26 solved, 223 unsolved
At refinement iteration 6 (OVERLAPS) 250/414 variables, 164/185 constraints. Problems are: Problem set: 26 solved, 223 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/414 variables, 0/185 constraints. Problems are: Problem set: 26 solved, 223 unsolved
At refinement iteration 8 (OVERLAPS) 0/414 variables, 0/185 constraints. Problems are: Problem set: 26 solved, 223 unsolved
No progress, stopping.
After SMT solving in domain Real declared 414/414 variables, and 185 constraints, problems are : Problem set: 26 solved, 223 unsolved in 29245 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 164/164 constraints, PredecessorRefiner: 249/249 constraints, Known Traps: 17/17 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 26 solved, 223 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/163 variables, 0/0 constraints. Problems are: Problem set: 26 solved, 223 unsolved
At refinement iteration 1 (OVERLAPS) 1/164 variables, 4/4 constraints. Problems are: Problem set: 26 solved, 223 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/164 variables, 17/21 constraints. Problems are: Problem set: 26 solved, 223 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:43:59] [INFO ] Deduced a trap composed of 65 places in 192 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:43:59] [INFO ] Deduced a trap composed of 92 places in 170 ms of which 24 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/164 variables, 2/23 constraints. Problems are: Problem set: 26 solved, 223 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/164 variables, 0/23 constraints. Problems are: Problem set: 26 solved, 223 unsolved
At refinement iteration 5 (OVERLAPS) 250/414 variables, 164/187 constraints. Problems are: Problem set: 26 solved, 223 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/414 variables, 223/410 constraints. Problems are: Problem set: 26 solved, 223 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:44:07] [INFO ] Deduced a trap composed of 77 places in 150 ms of which 15 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/414 variables, 1/411 constraints. Problems are: Problem set: 26 solved, 223 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:44:15] [INFO ] Deduced a trap composed of 22 places in 66 ms of which 4 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/414 variables, 1/412 constraints. Problems are: Problem set: 26 solved, 223 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 414/414 variables, and 412 constraints, problems are : Problem set: 26 solved, 223 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 164/164 constraints, PredecessorRefiner: 223/249 constraints, Known Traps: 21/21 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 59307ms problems are : Problem set: 26 solved, 223 unsolved
Search for dead transitions found 26 dead transitions in 59308ms
Found 26 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 26 transitions
Dead transitions reduction (with SMT) removed 26 transitions
Starting structural reductions in LTL mode, iteration 1 : 164/175 places, 224/274 transitions.
Applied a total of 0 rules in 4 ms. Remains 164 /164 variables (removed 0) and now considering 224/224 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 59838 ms. Remains : 164/175 places, 224/274 transitions.
Stuttering acceptance computed with spot in 221 ms :[(NOT p1), (NOT p1), (NOT p1), true, (NOT p0)]
Running random walk in product with property : FireWire-PT-15-LTLFireability-05
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA FireWire-PT-15-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-15-LTLFireability-05 finished in 60095 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||X((X(X(X(!p1))) U (p0&&X(X(X(!p1)))))))))'
Support contains 3 out of 175 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 175/175 places, 274/274 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 167 transition count 266
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 167 transition count 266
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 20 place count 163 transition count 258
Iterating global reduction 0 with 4 rules applied. Total rules applied 24 place count 163 transition count 258
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 162 transition count 255
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 162 transition count 255
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 161 transition count 254
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 161 transition count 254
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 160 transition count 251
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 160 transition count 251
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 159 transition count 250
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 159 transition count 250
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 158 transition count 247
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 158 transition count 247
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 157 transition count 246
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 157 transition count 246
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 156 transition count 243
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 156 transition count 243
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 155 transition count 242
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 155 transition count 242
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 154 transition count 239
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 154 transition count 239
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 153 transition count 238
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 153 transition count 238
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 45 place count 152 transition count 236
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 152 transition count 236
Applied a total of 46 rules in 55 ms. Remains 152 /175 variables (removed 23) and now considering 236/274 (removed 38) transitions.
// Phase 1: matrix 236 rows 152 cols
[2025-06-02 17:44:26] [INFO ] Computed 4 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:44:27] [INFO ] Implicit Places using invariants in 169 ms returned []
[2025-06-02 17:44:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:44:27] [INFO ] Implicit Places using invariants and state equation in 322 ms returned []
Implicit Place search using SMT with State Equation took 493 ms to find 0 implicit places.
Running 235 sub problems to find dead transitions.
[2025-06-02 17:44:27] [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, 235 unsolved
At refinement iteration 1 (OVERLAPS) 1/152 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 235 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:44:31] [INFO ] Deduced a trap composed of 45 places in 156 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:44:31] [INFO ] Deduced a trap composed of 75 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:44:31] [INFO ] Deduced a trap composed of 78 places in 152 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:44:31] [INFO ] Deduced a trap composed of 47 places in 166 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:44:32] [INFO ] Deduced a trap composed of 40 places in 164 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:44:32] [INFO ] Deduced a trap composed of 41 places in 124 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:44:32] [INFO ] Deduced a trap composed of 78 places in 114 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:44:32] [INFO ] Deduced a trap composed of 81 places in 89 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:44:32] [INFO ] Deduced a trap composed of 48 places in 98 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:44:32] [INFO ] Deduced a trap composed of 78 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:44:32] [INFO ] Deduced a trap composed of 81 places in 140 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:44:33] [INFO ] Deduced a trap composed of 87 places in 163 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:44:33] [INFO ] Deduced a trap composed of 80 places in 107 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:44:33] [INFO ] Deduced a trap composed of 77 places in 158 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:44:34] [INFO ] Deduced a trap composed of 58 places in 143 ms of which 16 ms to minimize.
Problem TDEAD125 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD188 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
Problem TDEAD206 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD211 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/152 variables, 15/19 constraints. Problems are: Problem set: 15 solved, 220 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:44:35] [INFO ] Deduced a trap composed of 80 places in 152 ms of which 20 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/152 variables, 1/20 constraints. Problems are: Problem set: 15 solved, 220 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:44:38] [INFO ] Deduced a trap composed of 38 places in 141 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:44:38] [INFO ] Deduced a trap composed of 85 places in 178 ms of which 18 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/152 variables, 2/22 constraints. Problems are: Problem set: 15 solved, 220 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:44:39] [INFO ] Deduced a trap composed of 59 places in 117 ms of which 11 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/152 variables, 1/23 constraints. Problems are: Problem set: 15 solved, 220 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/152 variables, 0/23 constraints. Problems are: Problem set: 15 solved, 220 unsolved
At refinement iteration 7 (OVERLAPS) 236/388 variables, 152/175 constraints. Problems are: Problem set: 15 solved, 220 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/388 variables, 0/175 constraints. Problems are: Problem set: 15 solved, 220 unsolved
At refinement iteration 9 (OVERLAPS) 0/388 variables, 0/175 constraints. Problems are: Problem set: 15 solved, 220 unsolved
No progress, stopping.
After SMT solving in domain Real declared 388/388 variables, and 175 constraints, problems are : Problem set: 15 solved, 220 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 152/152 constraints, PredecessorRefiner: 235/235 constraints, Known Traps: 19/19 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 15 solved, 220 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, 220 unsolved
At refinement iteration 1 (OVERLAPS) 1/152 variables, 4/4 constraints. Problems are: Problem set: 15 solved, 220 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/152 variables, 19/23 constraints. Problems are: Problem set: 15 solved, 220 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/152 variables, 0/23 constraints. Problems are: Problem set: 15 solved, 220 unsolved
At refinement iteration 4 (OVERLAPS) 236/388 variables, 152/175 constraints. Problems are: Problem set: 15 solved, 220 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/388 variables, 220/395 constraints. Problems are: Problem set: 15 solved, 220 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:45:05] [INFO ] Deduced a trap composed of 76 places in 88 ms of which 8 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/388 variables, 1/396 constraints. Problems are: Problem set: 15 solved, 220 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:45:12] [INFO ] Deduced a trap composed of 87 places in 129 ms of which 16 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/388 variables, 1/397 constraints. Problems are: Problem set: 15 solved, 220 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:45:21] [INFO ] Deduced a trap composed of 82 places in 128 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:45:25] [INFO ] Deduced a trap composed of 78 places in 112 ms of which 14 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/388 variables, 2/399 constraints. Problems are: Problem set: 15 solved, 220 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 388/388 variables, and 399 constraints, problems are : Problem set: 15 solved, 220 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 152/152 constraints, PredecessorRefiner: 220/235 constraints, Known Traps: 23/23 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60046ms problems are : Problem set: 15 solved, 220 unsolved
Search for dead transitions found 15 dead transitions in 60047ms
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/175 places, 221/274 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 151 transition count 220
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 151 transition count 220
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 150 transition count 219
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 150 transition count 219
Applied a total of 4 rules in 6 ms. Remains 150 /152 variables (removed 2) and now considering 219/221 (removed 2) transitions.
// Phase 1: matrix 219 rows 150 cols
[2025-06-02 17:45:27] [INFO ] Computed 4 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:45:27] [INFO ] Implicit Places using invariants in 115 ms returned []
[2025-06-02 17:45:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:45:27] [INFO ] Implicit Places using invariants and state equation in 237 ms returned []
Implicit Place search using SMT with State Equation took 381 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 150/175 places, 219/274 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 60987 ms. Remains : 150/175 places, 219/274 transitions.
Stuttering acceptance computed with spot in 275 ms :[(NOT p0), (NOT p0), (OR (NOT p0) p1), p1, p1, p1, true]
Running random walk in product with property : FireWire-PT-15-LTLFireability-07
Product exploration explored 100000 steps with 14273 reset in 176 ms.
Stack based approach found an accepted trace after 323 steps with 45 reset with depth 5 and stack size 5 in 2 ms.
FORMULA FireWire-PT-15-LTLFireability-07 FALSE TECHNIQUES STACK_TEST
Treatment of property FireWire-PT-15-LTLFireability-07 finished in 61466 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(F(p0))&&(p1||X(F((p2||X(p2))))))))'
Support contains 3 out of 175 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 175/175 places, 274/274 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 168 transition count 258
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 168 transition count 258
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 15 place count 168 transition count 257
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 18 place count 165 transition count 251
Iterating global reduction 1 with 3 rules applied. Total rules applied 21 place count 165 transition count 251
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 22 place count 164 transition count 248
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 164 transition count 248
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 163 transition count 247
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 163 transition count 247
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 26 place count 162 transition count 244
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 162 transition count 244
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 28 place count 161 transition count 243
Iterating global reduction 1 with 1 rules applied. Total rules applied 29 place count 161 transition count 243
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 30 place count 160 transition count 240
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 160 transition count 240
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 32 place count 159 transition count 239
Iterating global reduction 1 with 1 rules applied. Total rules applied 33 place count 159 transition count 239
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 34 place count 158 transition count 236
Iterating global reduction 1 with 1 rules applied. Total rules applied 35 place count 158 transition count 236
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 36 place count 157 transition count 235
Iterating global reduction 1 with 1 rules applied. Total rules applied 37 place count 157 transition count 235
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 38 place count 156 transition count 232
Iterating global reduction 1 with 1 rules applied. Total rules applied 39 place count 156 transition count 232
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 40 place count 155 transition count 231
Iterating global reduction 1 with 1 rules applied. Total rules applied 41 place count 155 transition count 231
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 42 place count 154 transition count 229
Iterating global reduction 1 with 1 rules applied. Total rules applied 43 place count 154 transition count 229
Applied a total of 43 rules in 28 ms. Remains 154 /175 variables (removed 21) and now considering 229/274 (removed 45) transitions.
// Phase 1: matrix 229 rows 154 cols
[2025-06-02 17:45:28] [INFO ] Computed 4 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:45:28] [INFO ] Implicit Places using invariants in 148 ms returned []
[2025-06-02 17:45:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:45:28] [INFO ] Implicit Places using invariants and state equation in 256 ms returned []
Implicit Place search using SMT with State Equation took 421 ms to find 0 implicit places.
Running 228 sub problems to find dead transitions.
[2025-06-02 17:45:28] [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:45:31] [INFO ] Deduced a trap composed of 45 places in 121 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:45:31] [INFO ] Deduced a trap composed of 81 places in 132 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:45:32] [INFO ] Deduced a trap composed of 35 places in 105 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:45:32] [INFO ] Deduced a trap composed of 80 places in 103 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:45:32] [INFO ] Deduced a trap composed of 82 places in 97 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:45:32] [INFO ] Deduced a trap composed of 79 places in 75 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:45:33] [INFO ] Deduced a trap composed of 80 places in 266 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:45:33] [INFO ] Deduced a trap composed of 84 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:45:33] [INFO ] Deduced a trap composed of 87 places in 87 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:45:33] [INFO ] Deduced a trap composed of 87 places in 106 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:45:33] [INFO ] Deduced a trap composed of 39 places in 115 ms of which 14 ms to minimize.
Problem TDEAD128 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:45:33] [INFO ] Deduced a trap composed of 80 places in 92 ms of which 17 ms to minimize.
Problem TDEAD141 is UNSAT
Problem TDEAD173 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD187 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD204 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:45:34] [INFO ] Deduced a trap composed of 90 places in 75 ms of which 9 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/154 variables, 13/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:45:34] [INFO ] Deduced a trap composed of 89 places in 95 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:45:35] [INFO ] Deduced a trap composed of 86 places in 144 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:45:35] [INFO ] Deduced a trap composed of 90 places in 127 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:45:36] [INFO ] Deduced a trap composed of 57 places in 132 ms of which 15 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/154 variables, 4/21 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:45:38] [INFO ] Deduced a trap composed of 83 places in 91 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:45:38] [INFO ] Deduced a trap composed of 84 places in 87 ms of which 10 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/154 variables, 2/23 constraints. Problems are: Problem set: 15 solved, 213 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/154 variables, 0/23 constraints. Problems are: Problem set: 15 solved, 213 unsolved
At refinement iteration 6 (OVERLAPS) 229/383 variables, 154/177 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:45:45] [INFO ] Deduced a trap composed of 22 places in 99 ms of which 7 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/383 variables, 1/178 constraints. Problems are: Problem set: 15 solved, 213 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/383 variables, 0/178 constraints. Problems are: Problem set: 15 solved, 213 unsolved
At refinement iteration 9 (OVERLAPS) 0/383 variables, 0/178 constraints. Problems are: Problem set: 15 solved, 213 unsolved
No progress, stopping.
After SMT solving in domain Real declared 383/383 variables, and 178 constraints, problems are : Problem set: 15 solved, 213 unsolved in 29065 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 154/154 constraints, PredecessorRefiner: 228/228 constraints, Known Traps: 20/20 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, 20/24 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:45:59] [INFO ] Deduced a trap composed of 83 places in 126 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:45:59] [INFO ] Deduced a trap composed of 47 places in 174 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:46:00] [INFO ] Deduced a trap composed of 37 places in 163 ms of which 27 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/154 variables, 3/27 constraints. Problems are: Problem set: 15 solved, 213 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/154 variables, 0/27 constraints. Problems are: Problem set: 15 solved, 213 unsolved
At refinement iteration 5 (OVERLAPS) 229/383 variables, 154/181 constraints. Problems are: Problem set: 15 solved, 213 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/383 variables, 213/394 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:46:08] [INFO ] Deduced a trap along path composed of 8 places in 36 ms of which 5 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/383 variables, 1/395 constraints. Problems are: Problem set: 15 solved, 213 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/383 variables, 0/395 constraints. Problems are: Problem set: 15 solved, 213 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 383/383 variables, and 395 constraints, problems are : Problem set: 15 solved, 213 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 154/154 constraints, PredecessorRefiner: 213/228 constraints, Known Traps: 23/23 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 59101ms problems are : Problem set: 15 solved, 213 unsolved
Search for dead transitions found 15 dead transitions in 59103ms
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 : 154/175 places, 214/274 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 153 transition count 213
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 153 transition count 213
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 152 transition count 212
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 152 transition count 212
Applied a total of 4 rules in 6 ms. Remains 152 /154 variables (removed 2) and now considering 212/214 (removed 2) transitions.
// Phase 1: matrix 212 rows 152 cols
[2025-06-02 17:46:27] [INFO ] Computed 4 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:46:28] [INFO ] Implicit Places using invariants in 188 ms returned []
[2025-06-02 17:46:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:46:28] [INFO ] Implicit Places using invariants and state equation in 320 ms returned []
Implicit Place search using SMT with State Equation took 519 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 152/175 places, 212/274 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 60081 ms. Remains : 152/175 places, 212/274 transitions.
Stuttering acceptance computed with spot in 221 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p2)]
Running random walk in product with property : FireWire-PT-15-LTLFireability-08
Product exploration explored 100000 steps with 1 reset in 104 ms.
Stack based approach found an accepted trace after 7 steps with 1 reset with depth 5 and stack size 5 in 0 ms.
FORMULA FireWire-PT-15-LTLFireability-08 FALSE TECHNIQUES STACK_TEST
Treatment of property FireWire-PT-15-LTLFireability-08 finished in 60433 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0 U X(X(X(p1)))))))'
Support contains 2 out of 175 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 175/175 places, 274/274 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 167 transition count 257
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 167 transition count 257
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 17 place count 167 transition count 256
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 20 place count 164 transition count 250
Iterating global reduction 1 with 3 rules applied. Total rules applied 23 place count 164 transition count 250
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 163 transition count 247
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 163 transition count 247
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 26 place count 162 transition count 246
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 162 transition count 246
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 28 place count 161 transition count 243
Iterating global reduction 1 with 1 rules applied. Total rules applied 29 place count 161 transition count 243
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 30 place count 160 transition count 242
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 160 transition count 242
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 32 place count 159 transition count 239
Iterating global reduction 1 with 1 rules applied. Total rules applied 33 place count 159 transition count 239
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 34 place count 158 transition count 238
Iterating global reduction 1 with 1 rules applied. Total rules applied 35 place count 158 transition count 238
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 36 place count 157 transition count 235
Iterating global reduction 1 with 1 rules applied. Total rules applied 37 place count 157 transition count 235
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 38 place count 156 transition count 234
Iterating global reduction 1 with 1 rules applied. Total rules applied 39 place count 156 transition count 234
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 40 place count 155 transition count 231
Iterating global reduction 1 with 1 rules applied. Total rules applied 41 place count 155 transition count 231
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 42 place count 154 transition count 230
Iterating global reduction 1 with 1 rules applied. Total rules applied 43 place count 154 transition count 230
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 44 place count 153 transition count 228
Iterating global reduction 1 with 1 rules applied. Total rules applied 45 place count 153 transition count 228
Applied a total of 45 rules in 33 ms. Remains 153 /175 variables (removed 22) and now considering 228/274 (removed 46) transitions.
// Phase 1: matrix 228 rows 153 cols
[2025-06-02 17:46:28] [INFO ] Computed 4 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:46:29] [INFO ] Implicit Places using invariants in 199 ms returned []
[2025-06-02 17:46:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:46:29] [INFO ] Implicit Places using invariants and state equation in 288 ms returned []
Implicit Place search using SMT with State Equation took 491 ms to find 0 implicit places.
Running 227 sub problems to find dead transitions.
[2025-06-02 17:46:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/152 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 1 (OVERLAPS) 1/153 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 227 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:46:33] [INFO ] Deduced a trap composed of 45 places in 177 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:46:33] [INFO ] Deduced a trap composed of 75 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:46:33] [INFO ] Deduced a trap composed of 79 places in 153 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:46:33] [INFO ] Deduced a trap composed of 39 places in 168 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:46:33] [INFO ] Deduced a trap composed of 47 places in 165 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:46:34] [INFO ] Deduced a trap composed of 77 places in 124 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:46:34] [INFO ] Deduced a trap composed of 78 places in 143 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:46:34] [INFO ] Deduced a trap composed of 88 places in 131 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:46:34] [INFO ] Deduced a trap composed of 81 places in 158 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:46:35] [INFO ] Deduced a trap composed of 83 places in 149 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:46:35] [INFO ] Deduced a trap composed of 59 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:46:35] [INFO ] Deduced a trap composed of 75 places in 168 ms of which 18 ms to minimize.
Problem TDEAD125 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD171 is UNSAT
Problem TDEAD177 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/153 variables, 12/16 constraints. Problems are: Problem set: 16 solved, 211 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:46:37] [INFO ] Deduced a trap composed of 40 places in 168 ms of which 29 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/153 variables, 1/17 constraints. Problems are: Problem set: 16 solved, 211 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:46:39] [INFO ] Deduced a trap composed of 82 places in 166 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:46:39] [INFO ] Deduced a trap composed of 48 places in 165 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:46:40] [INFO ] Deduced a trap composed of 78 places in 141 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:46:40] [INFO ] Deduced a trap composed of 82 places in 124 ms of which 15 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/153 variables, 4/21 constraints. Problems are: Problem set: 16 solved, 211 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/153 variables, 0/21 constraints. Problems are: Problem set: 16 solved, 211 unsolved
At refinement iteration 6 (OVERLAPS) 228/381 variables, 153/174 constraints. Problems are: Problem set: 16 solved, 211 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/381 variables, 0/174 constraints. Problems are: Problem set: 16 solved, 211 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:46:52] [INFO ] Deduced a trap composed of 83 places in 120 ms of which 14 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/381 variables, 1/175 constraints. Problems are: Problem set: 16 solved, 211 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/381 variables, 0/175 constraints. Problems are: Problem set: 16 solved, 211 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 381/381 variables, and 175 constraints, problems are : Problem set: 16 solved, 211 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 153/153 constraints, PredecessorRefiner: 227/227 constraints, Known Traps: 18/18 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 16 solved, 211 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/152 variables, 0/0 constraints. Problems are: Problem set: 16 solved, 211 unsolved
At refinement iteration 1 (OVERLAPS) 1/153 variables, 4/4 constraints. Problems are: Problem set: 16 solved, 211 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/153 variables, 18/22 constraints. Problems are: Problem set: 16 solved, 211 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/153 variables, 0/22 constraints. Problems are: Problem set: 16 solved, 211 unsolved
At refinement iteration 4 (OVERLAPS) 228/381 variables, 153/175 constraints. Problems are: Problem set: 16 solved, 211 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/381 variables, 211/386 constraints. Problems are: Problem set: 16 solved, 211 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/381 variables, 0/386 constraints. Problems are: Problem set: 16 solved, 211 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:47:23] [INFO ] Deduced a trap composed of 76 places in 183 ms of which 19 ms to minimize.
At refinement iteration 7 (OVERLAPS) 0/381 variables, 1/387 constraints. Problems are: Problem set: 16 solved, 211 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 381/381 variables, and 387 constraints, problems are : Problem set: 16 solved, 211 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 153/153 constraints, PredecessorRefiner: 211/227 constraints, Known Traps: 19/19 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60048ms problems are : Problem set: 16 solved, 211 unsolved
Search for dead transitions found 16 dead transitions in 60049ms
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 : 153/175 places, 212/274 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 152 transition count 211
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 152 transition count 211
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 151 transition count 210
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 151 transition count 210
Applied a total of 4 rules in 4 ms. Remains 151 /153 variables (removed 2) and now considering 210/212 (removed 2) transitions.
// Phase 1: matrix 210 rows 151 cols
[2025-06-02 17:47:29] [INFO ] Computed 4 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:47:29] [INFO ] Implicit Places using invariants in 117 ms returned []
[2025-06-02 17:47:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:47:29] [INFO ] Implicit Places using invariants and state equation in 265 ms returned []
Implicit Place search using SMT with State Equation took 391 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 151/175 places, 210/274 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 60971 ms. Remains : 151/175 places, 210/274 transitions.
Stuttering acceptance computed with spot in 706 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Running random walk in product with property : FireWire-PT-15-LTLFireability-09
Product exploration explored 100000 steps with 19928 reset in 138 ms.
Product exploration explored 100000 steps with 19914 reset in 339 ms.
Computed a total of 28 stabilizing places and 36 stable transitions
Computed a total of 28 stabilizing places and 36 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 212 ms. Reduced automaton from 12 states, 32 edges and 2 AP (stutter sensitive) to 12 states, 32 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 591 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1)]
RANDOM walk for 40000 steps (11 resets) in 97 ms. (408 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40000 steps (12 resets) in 75 ms. (526 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40000 steps (13 resets) in 130 ms. (305 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40000 steps (13 resets) in 115 ms. (344 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40000 steps (10 resets) in 78 ms. (506 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 1547780 steps, run timeout after 3001 ms. (steps per millisecond=515 ) properties seen :3 out of 4
Probabilistic random walk after 1547780 steps, saw 308853 distinct states, run finished after 3004 ms. (steps per millisecond=515 ) properties seen :3
[2025-06-02 17:47:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf1 is UNSAT
After SMT solving in domain Real declared 85/361 variables, and 1 constraints, problems are : Problem set: 1 solved, 0 unsolved in 31 ms.
Refiners :[Positive P Invariants (semi-flows): 1/4 constraints, State Equation: 0/151 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 34ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (X (NOT p0))), (G (OR (NOT p0) p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR p0 p1))), (F p0)]
Knowledge based reduction with 4 factoid took 470 ms. Reduced automaton from 12 states, 32 edges and 2 AP (stutter sensitive) to 12 states, 26 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 678 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 683 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Support contains 2 out of 151 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 151/151 places, 210/210 transitions.
Applied a total of 0 rules in 3 ms. Remains 151 /151 variables (removed 0) and now considering 210/210 (removed 0) transitions.
[2025-06-02 17:47:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:47:37] [INFO ] Implicit Places using invariants in 184 ms returned []
[2025-06-02 17:47:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:47:37] [INFO ] Implicit Places using invariants and state equation in 343 ms returned []
Implicit Place search using SMT with State Equation took 530 ms to find 0 implicit places.
Running 209 sub problems to find dead transitions.
[2025-06-02 17:47:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/150 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 1 (OVERLAPS) 1/151 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 209 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:47:41] [INFO ] Deduced a trap composed of 45 places in 137 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:47:41] [INFO ] Deduced a trap composed of 35 places in 155 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:47:41] [INFO ] Deduced a trap composed of 75 places in 150 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:47:41] [INFO ] Deduced a trap composed of 76 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:47:41] [INFO ] Deduced a trap composed of 47 places in 168 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:47:41] [INFO ] Deduced a trap composed of 77 places in 138 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:47:42] [INFO ] Deduced a trap composed of 75 places in 130 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:47:42] [INFO ] Deduced a trap composed of 90 places in 153 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:47:42] [INFO ] Deduced a trap composed of 83 places in 134 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:47:43] [INFO ] Deduced a trap composed of 44 places in 154 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:47:43] [INFO ] Deduced a trap composed of 75 places in 118 ms of which 15 ms to minimize.
Problem TDEAD175 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/151 variables, 11/15 constraints. Problems are: Problem set: 1 solved, 208 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:47:44] [INFO ] Deduced a trap composed of 78 places in 133 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:47:44] [INFO ] Deduced a trap composed of 76 places in 114 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:47:44] [INFO ] Deduced a trap composed of 79 places in 89 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:47:45] [INFO ] Deduced a trap composed of 78 places in 96 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:47:45] [INFO ] Deduced a trap composed of 45 places in 105 ms of which 18 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/151 variables, 5/20 constraints. Problems are: Problem set: 1 solved, 208 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:47:47] [INFO ] Deduced a trap composed of 79 places in 87 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:47:47] [INFO ] Deduced a trap composed of 48 places in 152 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:47:47] [INFO ] Deduced a trap composed of 39 places in 150 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:47:47] [INFO ] Deduced a trap composed of 40 places in 138 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:47:48] [INFO ] Deduced a trap composed of 81 places in 126 ms of which 14 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/151 variables, 5/25 constraints. Problems are: Problem set: 1 solved, 208 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/151 variables, 0/25 constraints. Problems are: Problem set: 1 solved, 208 unsolved
At refinement iteration 6 (OVERLAPS) 210/361 variables, 151/176 constraints. Problems are: Problem set: 1 solved, 208 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/361 variables, 0/176 constraints. Problems are: Problem set: 1 solved, 208 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:47:57] [INFO ] Deduced a trap composed of 76 places in 87 ms of which 8 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/361 variables, 1/177 constraints. Problems are: Problem set: 1 solved, 208 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:47:59] [INFO ] Deduced a trap composed of 81 places in 99 ms of which 10 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/361 variables, 1/178 constraints. Problems are: Problem set: 1 solved, 208 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/361 variables, 0/178 constraints. Problems are: Problem set: 1 solved, 208 unsolved
Error getting values : (error "ParserException while parsing response: ((t0 1.0)
(t1 1.0)
(t2 1.0)
(t3 1.0)
(t4 1.0)
(t5 1.0)
(t6 1.0)
(t7 0.0)
(t8 0.0)
(t9 0.0)
(t10 0.0)
(t11 1.0)
(t12 0.0)
(t13 0.0)
(t14 0.0)
(t15 0.0)
(t16 0.0)
(t17 0.0)
(t18 0.0)
(t19 0.0)
(t20 1.0)
(t21 1.0)
(t22 1.0)
(t23 0.0)
(t24 0.0)
(t25 0.0)
(t26 0.0)
(t27 0.0)
(t28 0.0)
(t29 0.0)
(t30 0.0)
(t31 0.0)
(t32 0.0)
(t33 0.0)
(t34 0.0)
(t35 0.0)
(t36 0.0)
(t37 0.0)
(t38 0.0)
(t39 1.0)
(t40 1.0)
(t41 0.0)
(t42 0.0)
(t43 0.0)
(t44 0.0)
(t45 0.0)
(t46 0.0)
(t47 timeout
0.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 361/361 variables, and 178 constraints, problems are : Problem set: 1 solved, 208 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 151/151 constraints, PredecessorRefiner: 209/209 constraints, Known Traps: 23/23 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 208 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/150 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 208 unsolved
At refinement iteration 1 (OVERLAPS) 1/151 variables, 4/4 constraints. Problems are: Problem set: 1 solved, 208 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/151 variables, 23/27 constraints. Problems are: Problem set: 1 solved, 208 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/151 variables, 0/27 constraints. Problems are: Problem set: 1 solved, 208 unsolved
At refinement iteration 4 (OVERLAPS) 210/361 variables, 151/178 constraints. Problems are: Problem set: 1 solved, 208 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/361 variables, 208/386 constraints. Problems are: Problem set: 1 solved, 208 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:48:12] [INFO ] Deduced a trap composed of 37 places in 94 ms of which 19 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/361 variables, 1/387 constraints. Problems are: Problem set: 1 solved, 208 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:48:19] [INFO ] Deduced a trap along path composed of 7 places in 24 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/361 variables, 1/388 constraints. Problems are: Problem set: 1 solved, 208 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 361/361 variables, and 388 constraints, problems are : Problem set: 1 solved, 208 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 151/151 constraints, PredecessorRefiner: 208/209 constraints, Known Traps: 24/24 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 60049ms problems are : Problem set: 1 solved, 208 unsolved
Search for dead transitions found 1 dead transitions in 60051ms
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 : 151/151 places, 209/210 transitions.
Applied a total of 0 rules in 3 ms. Remains 151 /151 variables (removed 0) and now considering 209/209 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 60588 ms. Remains : 151/151 places, 209/210 transitions.
Computed a total of 28 stabilizing places and 36 stable transitions
Computed a total of 28 stabilizing places and 36 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 319 ms. Reduced automaton from 12 states, 26 edges and 2 AP (stutter sensitive) to 12 states, 26 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 553 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1)]
RANDOM walk for 40000 steps (11 resets) in 78 ms. (506 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40000 steps (11 resets) in 102 ms. (388 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40000 steps (8 resets) in 83 ms. (476 steps per ms) remains 2/2 properties
Finished probabilistic random walk after 438763 steps, run visited all 2 properties in 869 ms. (steps per millisecond=504 )
Probabilistic random walk after 438763 steps, saw 107017 distinct states, run finished after 869 ms. (steps per millisecond=504 ) properties seen :2
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F (NOT p1)), (F p0)]
Knowledge based reduction with 3 factoid took 281 ms. Reduced automaton from 12 states, 26 edges and 2 AP (stutter sensitive) to 12 states, 26 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 654 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 671 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 674 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 20043 reset in 229 ms.
Product exploration explored 100000 steps with 20039 reset in 210 ms.
Built C files in :
/tmp/ltsmin2013539723198422165
[2025-06-02 17:48:42] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2013539723198422165
Running compilation step : cd /tmp/ltsmin2013539723198422165;'/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 743 ms.
Running link step : cd /tmp/ltsmin2013539723198422165;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 51 ms.
Running LTSmin : cd /tmp/ltsmin2013539723198422165;'/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/stateBased6366151274680843993.hoa' '--buchi-type=spotba'
LTSmin run took 902 ms.
FORMULA FireWire-PT-15-LTLFireability-09 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property FireWire-PT-15-LTLFireability-09 finished in 135605 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((X((X(G(p2))&&p1))&&p0))))'
Support contains 5 out of 175 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 175/175 places, 274/274 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 168 transition count 267
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 168 transition count 267
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 18 place count 164 transition count 259
Iterating global reduction 0 with 4 rules applied. Total rules applied 22 place count 164 transition count 259
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 163 transition count 256
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 163 transition count 256
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 162 transition count 255
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 162 transition count 255
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 161 transition count 252
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 161 transition count 252
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 160 transition count 251
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 160 transition count 251
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 159 transition count 248
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 159 transition count 248
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 158 transition count 247
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 158 transition count 247
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 157 transition count 244
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 157 transition count 244
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 156 transition count 243
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 156 transition count 243
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 155 transition count 240
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 155 transition count 240
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 154 transition count 239
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 154 transition count 239
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 153 transition count 237
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 153 transition count 237
Applied a total of 44 rules in 16 ms. Remains 153 /175 variables (removed 22) and now considering 237/274 (removed 37) transitions.
// Phase 1: matrix 237 rows 153 cols
[2025-06-02 17:48:44] [INFO ] Computed 4 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:48:44] [INFO ] Implicit Places using invariants in 121 ms returned []
[2025-06-02 17:48:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:48:44] [INFO ] Implicit Places using invariants and state equation in 254 ms returned []
Implicit Place search using SMT with State Equation took 377 ms to find 0 implicit places.
Running 236 sub problems to find dead transitions.
[2025-06-02 17:48: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/152 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 1 (OVERLAPS) 1/153 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 236 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:48:48] [INFO ] Deduced a trap composed of 46 places in 147 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:48:49] [INFO ] Deduced a trap composed of 76 places in 154 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:48:49] [INFO ] Deduced a trap composed of 79 places in 159 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:48:49] [INFO ] Deduced a trap composed of 48 places in 169 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:48:49] [INFO ] Deduced a trap composed of 41 places in 167 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:48:49] [INFO ] Deduced a trap composed of 77 places in 137 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:48:49] [INFO ] Deduced a trap composed of 78 places in 160 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:48:50] [INFO ] Deduced a trap composed of 88 places in 160 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:48:50] [INFO ] Deduced a trap composed of 80 places in 161 ms of which 24 ms to minimize.
Problem TDEAD125 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD188 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
Problem TDEAD206 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD211 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/153 variables, 9/13 constraints. Problems are: Problem set: 15 solved, 221 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:48:52] [INFO ] Deduced a trap composed of 78 places in 152 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:48:52] [INFO ] Deduced a trap composed of 39 places in 172 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:48:53] [INFO ] Deduced a trap composed of 60 places in 167 ms of which 30 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/153 variables, 3/16 constraints. Problems are: Problem set: 15 solved, 221 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:48:56] [INFO ] Deduced a trap composed of 49 places in 171 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:48:56] [INFO ] Deduced a trap composed of 81 places in 173 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:48:56] [INFO ] Deduced a trap composed of 44 places in 163 ms of which 19 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/153 variables, 3/19 constraints. Problems are: Problem set: 15 solved, 221 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/153 variables, 0/19 constraints. Problems are: Problem set: 15 solved, 221 unsolved
At refinement iteration 6 (OVERLAPS) 237/390 variables, 153/172 constraints. Problems are: Problem set: 15 solved, 221 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:49:04] [INFO ] Deduced a trap composed of 82 places in 180 ms of which 22 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/390 variables, 1/173 constraints. Problems are: Problem set: 15 solved, 221 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:49:06] [INFO ] Deduced a trap composed of 76 places in 133 ms of which 10 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/390 variables, 1/174 constraints. Problems are: Problem set: 15 solved, 221 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/390 variables, 0/174 constraints. Problems are: Problem set: 15 solved, 221 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 390/390 variables, and 174 constraints, problems are : Problem set: 15 solved, 221 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 153/153 constraints, PredecessorRefiner: 236/236 constraints, Known Traps: 17/17 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 15 solved, 221 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/152 variables, 0/0 constraints. Problems are: Problem set: 15 solved, 221 unsolved
At refinement iteration 1 (OVERLAPS) 1/153 variables, 4/4 constraints. Problems are: Problem set: 15 solved, 221 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/153 variables, 17/21 constraints. Problems are: Problem set: 15 solved, 221 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/153 variables, 0/21 constraints. Problems are: Problem set: 15 solved, 221 unsolved
At refinement iteration 4 (OVERLAPS) 237/390 variables, 153/174 constraints. Problems are: Problem set: 15 solved, 221 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/390 variables, 221/395 constraints. Problems are: Problem set: 15 solved, 221 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:49:22] [INFO ] Deduced a trap composed of 88 places in 130 ms of which 16 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/390 variables, 1/396 constraints. Problems are: Problem set: 15 solved, 221 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:49:30] [INFO ] Deduced a trap composed of 22 places in 76 ms of which 5 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/390 variables, 1/397 constraints. Problems are: Problem set: 15 solved, 221 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 390/390 variables, and 397 constraints, problems are : Problem set: 15 solved, 221 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 153/153 constraints, PredecessorRefiner: 221/236 constraints, Known Traps: 19/19 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60061ms problems are : Problem set: 15 solved, 221 unsolved
Search for dead transitions found 15 dead transitions in 60062ms
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 : 153/175 places, 222/274 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 152 transition count 221
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 152 transition count 221
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 151 transition count 220
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 151 transition count 220
Applied a total of 4 rules in 6 ms. Remains 151 /153 variables (removed 2) and now considering 220/222 (removed 2) transitions.
// Phase 1: matrix 220 rows 151 cols
[2025-06-02 17:49:44] [INFO ] Computed 4 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:49:44] [INFO ] Implicit Places using invariants in 116 ms returned []
[2025-06-02 17:49:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:49:45] [INFO ] Implicit Places using invariants and state equation in 259 ms returned []
Implicit Place search using SMT with State Equation took 391 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 151/175 places, 220/274 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 60853 ms. Remains : 151/175 places, 220/274 transitions.
Stuttering acceptance computed with spot in 312 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p2), (NOT p2)]
Running random walk in product with property : FireWire-PT-15-LTLFireability-13
Product exploration explored 100000 steps with 0 reset in 125 ms.
Stack based approach found an accepted trace after 35 steps with 0 reset with depth 36 and stack size 36 in 0 ms.
FORMULA FireWire-PT-15-LTLFireability-13 FALSE TECHNIQUES STACK_TEST
Treatment of property FireWire-PT-15-LTLFireability-13 finished in 61310 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&X(F(p1))&&(p2||G(p3)))))'
Support contains 3 out of 175 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 175/175 places, 274/274 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 166 transition count 256
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 166 transition count 256
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 19 place count 166 transition count 255
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 23 place count 162 transition count 247
Iterating global reduction 1 with 4 rules applied. Total rules applied 27 place count 162 transition count 247
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 28 place count 161 transition count 244
Iterating global reduction 1 with 1 rules applied. Total rules applied 29 place count 161 transition count 244
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 30 place count 160 transition count 243
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 160 transition count 243
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 32 place count 159 transition count 240
Iterating global reduction 1 with 1 rules applied. Total rules applied 33 place count 159 transition count 240
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 34 place count 158 transition count 239
Iterating global reduction 1 with 1 rules applied. Total rules applied 35 place count 158 transition count 239
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 36 place count 157 transition count 236
Iterating global reduction 1 with 1 rules applied. Total rules applied 37 place count 157 transition count 236
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 38 place count 156 transition count 235
Iterating global reduction 1 with 1 rules applied. Total rules applied 39 place count 156 transition count 235
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 40 place count 155 transition count 232
Iterating global reduction 1 with 1 rules applied. Total rules applied 41 place count 155 transition count 232
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 42 place count 154 transition count 231
Iterating global reduction 1 with 1 rules applied. Total rules applied 43 place count 154 transition count 231
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 44 place count 153 transition count 228
Iterating global reduction 1 with 1 rules applied. Total rules applied 45 place count 153 transition count 228
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 46 place count 152 transition count 227
Iterating global reduction 1 with 1 rules applied. Total rules applied 47 place count 152 transition count 227
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 48 place count 151 transition count 225
Iterating global reduction 1 with 1 rules applied. Total rules applied 49 place count 151 transition count 225
Applied a total of 49 rules in 26 ms. Remains 151 /175 variables (removed 24) and now considering 225/274 (removed 49) transitions.
// Phase 1: matrix 225 rows 151 cols
[2025-06-02 17:49:45] [INFO ] Computed 4 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:49:45] [INFO ] Implicit Places using invariants in 173 ms returned []
[2025-06-02 17:49:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:49:46] [INFO ] Implicit Places using invariants and state equation in 295 ms returned []
Implicit Place search using SMT with State Equation took 502 ms to find 0 implicit places.
Running 224 sub problems to find dead transitions.
[2025-06-02 17:49:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/150 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 1 (OVERLAPS) 1/151 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 224 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:49:49] [INFO ] Deduced a trap composed of 45 places in 145 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:49:49] [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:49:50] [INFO ] Deduced a trap composed of 75 places in 159 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:49:50] [INFO ] Deduced a trap composed of 78 places in 148 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:49:50] [INFO ] Deduced a trap composed of 46 places in 162 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:49:50] [INFO ] Deduced a trap composed of 39 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:49:50] [INFO ] Deduced a trap composed of 87 places in 159 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:49:51] [INFO ] Deduced a trap composed of 80 places in 137 ms of which 16 ms to minimize.
Problem TDEAD124 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD183 is UNSAT
Problem TDEAD184 is UNSAT
Problem TDEAD187 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD200 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/151 variables, 8/12 constraints. Problems are: Problem set: 15 solved, 209 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:49:52] [INFO ] Deduced a trap composed of 47 places in 156 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:49:52] [INFO ] Deduced a trap composed of 40 places in 166 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:49:53] [INFO ] Deduced a trap composed of 78 places in 132 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:49:53] [INFO ] Deduced a trap composed of 81 places in 149 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:49:53] [INFO ] Deduced a trap composed of 82 places in 160 ms of which 17 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/151 variables, 5/17 constraints. Problems are: Problem set: 15 solved, 209 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:49:57] [INFO ] Deduced a trap composed of 57 places in 162 ms of which 15 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/151 variables, 1/18 constraints. Problems are: Problem set: 15 solved, 209 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:49:58] [INFO ] Deduced a trap composed of 85 places in 145 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:49:59] [INFO ] Deduced a trap composed of 85 places in 145 ms of which 20 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/151 variables, 2/20 constraints. Problems are: Problem set: 15 solved, 209 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:50:00] [INFO ] Deduced a trap composed of 75 places in 119 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:50:00] [INFO ] Deduced a trap composed of 76 places in 119 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:50:01] [INFO ] Deduced a trap composed of 58 places in 152 ms of which 15 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/151 variables, 3/23 constraints. Problems are: Problem set: 15 solved, 209 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:50:03] [INFO ] Deduced a trap composed of 77 places in 144 ms of which 15 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/151 variables, 1/24 constraints. Problems are: Problem set: 15 solved, 209 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:50:05] [INFO ] Deduced a trap composed of 78 places in 156 ms of which 18 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/151 variables, 1/25 constraints. Problems are: Problem set: 15 solved, 209 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/151 variables, 0/25 constraints. Problems are: Problem set: 15 solved, 209 unsolved
At refinement iteration 10 (OVERLAPS) 225/376 variables, 151/176 constraints. Problems are: Problem set: 15 solved, 209 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/376 variables, 0/176 constraints. Problems are: Problem set: 15 solved, 209 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 376/376 variables, and 176 constraints, problems are : Problem set: 15 solved, 209 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 151/151 constraints, PredecessorRefiner: 224/224 constraints, Known Traps: 21/21 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 15 solved, 209 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/150 variables, 0/0 constraints. Problems are: Problem set: 15 solved, 209 unsolved
At refinement iteration 1 (OVERLAPS) 1/151 variables, 4/4 constraints. Problems are: Problem set: 15 solved, 209 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/151 variables, 21/25 constraints. Problems are: Problem set: 15 solved, 209 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/151 variables, 0/25 constraints. Problems are: Problem set: 15 solved, 209 unsolved
At refinement iteration 4 (OVERLAPS) 225/376 variables, 151/176 constraints. Problems are: Problem set: 15 solved, 209 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/376 variables, 209/385 constraints. Problems are: Problem set: 15 solved, 209 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:50:26] [INFO ] Deduced a trap along path composed of 7 places in 35 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/376 variables, 1/386 constraints. Problems are: Problem set: 15 solved, 209 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Stream closed")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 376/376 variables, and 386 constraints, problems are : Problem set: 15 solved, 209 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 151/151 constraints, PredecessorRefiner: 209/224 constraints, Known Traps: 21/21 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 60061ms problems are : Problem set: 15 solved, 209 unsolved
Search for dead transitions found 15 dead transitions in 60062ms
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 : 151/175 places, 210/274 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 150 transition count 209
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 150 transition count 209
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 149 transition count 208
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 149 transition count 208
Applied a total of 4 rules in 6 ms. Remains 149 /151 variables (removed 2) and now considering 208/210 (removed 2) transitions.
// Phase 1: matrix 208 rows 149 cols
[2025-06-02 17:50:46] [INFO ] Computed 4 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:50:46] [INFO ] Implicit Places using invariants in 162 ms returned []
[2025-06-02 17:50:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:50:46] [INFO ] Implicit Places using invariants and state equation in 326 ms returned []
Implicit Place search using SMT with State Equation took 497 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 149/175 places, 208/274 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 61095 ms. Remains : 149/175 places, 208/274 transitions.
Stuttering acceptance computed with spot in 243 ms :[(OR (NOT p0) (NOT p1) (AND (NOT p2) (NOT p3))), (NOT p1), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p3))]
Running random walk in product with property : FireWire-PT-15-LTLFireability-14
Product exploration explored 100000 steps with 0 reset in 144 ms.
Stack based approach found an accepted trace after 29 steps with 0 reset with depth 30 and stack size 30 in 0 ms.
FORMULA FireWire-PT-15-LTLFireability-14 FALSE TECHNIQUES STACK_TEST
Treatment of property FireWire-PT-15-LTLFireability-14 finished in 61515 ms.
All properties solved by simple procedures.
Total runtime 697595 ms.
BK_STOP 1748886647240
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="FireWire-PT-15"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5832"
echo " Executing tool itstools"
echo " Input is FireWire-PT-15, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r086-smll-174860102400356"
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 [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;