About the Execution of ITS-Tools for FireWire-PT-08
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 0.000 | 1173443.00 | 0.00 | 0.00 | FFTFFFFFTFFFFTFF | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r086-smll-174860102200300.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-08, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r086-smll-174860102200300
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 544K
-rw-r--r-- 1 mcc users 6.3K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 67K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 63K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 143K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.4K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 50K 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 97K 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-08-LTLFireability-00
FORMULA_NAME FireWire-PT-08-LTLFireability-01
FORMULA_NAME FireWire-PT-08-LTLFireability-02
FORMULA_NAME FireWire-PT-08-LTLFireability-03
FORMULA_NAME FireWire-PT-08-LTLFireability-04
FORMULA_NAME FireWire-PT-08-LTLFireability-05
FORMULA_NAME FireWire-PT-08-LTLFireability-06
FORMULA_NAME FireWire-PT-08-LTLFireability-07
FORMULA_NAME FireWire-PT-08-LTLFireability-08
FORMULA_NAME FireWire-PT-08-LTLFireability-09
FORMULA_NAME FireWire-PT-08-LTLFireability-10
FORMULA_NAME FireWire-PT-08-LTLFireability-11
FORMULA_NAME FireWire-PT-08-LTLFireability-12
FORMULA_NAME FireWire-PT-08-LTLFireability-13
FORMULA_NAME FireWire-PT-08-LTLFireability-14
FORMULA_NAME FireWire-PT-08-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1748856190921
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-08
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202505121319
[2025-06-02 09:23:13] [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 09:23:13] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-02 09:23:13] [INFO ] Load time of PNML (sax parser for PT used): 191 ms
[2025-06-02 09:23:13] [INFO ] Transformed 127 places.
[2025-06-02 09:23:13] [INFO ] Transformed 397 transitions.
[2025-06-02 09:23:13] [INFO ] Found NUPN structural information;
[2025-06-02 09:23:13] [INFO ] Parsed PT model containing 127 places and 397 transitions and 1475 arcs in 421 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 24 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
Ensure Unique test removed 53 transitions
Reduce redundant transitions removed 53 transitions.
FORMULA FireWire-PT-08-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 42 out of 127 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 127/127 places, 344/344 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 124 transition count 338
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 124 transition count 338
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 8 place count 124 transition count 336
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 14 place count 124 transition count 330
Applied a total of 14 rules in 100 ms. Remains 124 /127 variables (removed 3) and now considering 330/344 (removed 14) transitions.
[2025-06-02 09:23:14] [INFO ] Flow matrix only has 304 transitions (discarded 26 similar events)
// Phase 1: matrix 304 rows 124 cols
[2025-06-02 09:23:14] [INFO ] Computed 8 invariants in 15 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 09:23:14] [INFO ] Implicit Places using invariants in 492 ms returned []
[2025-06-02 09:23:14] [INFO ] Flow matrix only has 304 transitions (discarded 26 similar events)
[2025-06-02 09:23:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 09:23:15] [INFO ] State equation strengthened by 45 read => feed constraints.
[2025-06-02 09:23:15] [INFO ] Implicit Places using invariants and state equation in 633 ms returned []
Implicit Place search using SMT with State Equation took 1197 ms to find 0 implicit places.
Running 329 sub problems to find dead transitions.
[2025-06-02 09:23:15] [INFO ] Flow matrix only has 304 transitions (discarded 26 similar events)
[2025-06-02 09:23:15] [INFO ] Invariant cache hit.
[2025-06-02 09:23:15] [INFO ] State equation strengthened by 45 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 329 unsolved
At refinement iteration 1 (OVERLAPS) 1/124 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 329 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:23:22] [INFO ] Deduced a trap composed of 41 places in 254 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:23:22] [INFO ] Deduced a trap composed of 15 places in 163 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:23:23] [INFO ] Deduced a trap composed of 35 places in 711 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:23:23] [INFO ] Deduced a trap composed of 43 places in 214 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:23:23] [INFO ] Deduced a trap composed of 22 places in 198 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:23:24] [INFO ] Deduced a trap composed of 18 places in 193 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:23:25] [INFO ] Deduced a trap composed of 17 places in 167 ms of which 19 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 7/15 constraints. Problems are: Problem set: 0 solved, 329 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/124 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 329 unsolved
At refinement iteration 4 (OVERLAPS) 303/427 variables, 124/139 constraints. Problems are: Problem set: 0 solved, 329 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/427 variables, 44/183 constraints. Problems are: Problem set: 0 solved, 329 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/427 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 329 unsolved
At refinement iteration 7 (OVERLAPS) 1/428 variables, 1/184 constraints. Problems are: Problem set: 0 solved, 329 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/428 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 329 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 428/428 variables, and 184 constraints, problems are : Problem set: 0 solved, 329 unsolved in 30052 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 124/124 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 329/329 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 329 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 329 unsolved
At refinement iteration 1 (OVERLAPS) 1/124 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 329 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 7/15 constraints. Problems are: Problem set: 0 solved, 329 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/124 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 329 unsolved
At refinement iteration 4 (OVERLAPS) 303/427 variables, 124/139 constraints. Problems are: Problem set: 0 solved, 329 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/427 variables, 44/183 constraints. Problems are: Problem set: 0 solved, 329 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/427 variables, 329/512 constraints. Problems are: Problem set: 0 solved, 329 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 427/428 variables, and 512 constraints, problems are : Problem set: 0 solved, 329 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 124/124 constraints, ReadFeed: 44/45 constraints, PredecessorRefiner: 329/329 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60641ms problems are : Problem set: 0 solved, 329 unsolved
Search for dead transitions found 0 dead transitions in 60688ms
Starting structural reductions in LTL mode, iteration 1 : 124/127 places, 330/344 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62024 ms. Remains : 124/127 places, 330/344 transitions.
Support contains 42 out of 124 places after structural reductions.
[2025-06-02 09:24:16] [INFO ] Flatten gal took : 97 ms
[2025-06-02 09:24:16] [INFO ] Flatten gal took : 62 ms
[2025-06-02 09:24:16] [INFO ] Input system was already deterministic with 330 transitions.
Support contains 41 out of 124 places (down from 42) after GAL structural reductions.
RANDOM walk for 40000 steps (2250 resets) in 3856 ms. (10 steps per ms) remains 19/37 properties
BEST_FIRST walk for 4003 steps (64 resets) in 58 ms. (67 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (64 resets) in 43 ms. (90 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (54 resets) in 43 ms. (91 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (13 resets) in 42 ms. (93 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (8 resets) in 30 ms. (129 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 71 ms. (55 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (9 resets) in 20 ms. (190 steps per ms) remains 17/19 properties
BEST_FIRST walk for 4004 steps (10 resets) in 17 ms. (222 steps per ms) remains 16/17 properties
BEST_FIRST walk for 4004 steps (99 resets) in 16 ms. (235 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (62 resets) in 48 ms. (81 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4001 steps (58 resets) in 23 ms. (166 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (53 resets) in 10 ms. (363 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (83 resets) in 21 ms. (182 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (57 resets) in 12 ms. (308 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (52 resets) in 21 ms. (182 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (48 resets) in 17 ms. (222 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (9 resets) in 14 ms. (266 steps per ms) remains 15/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 15/15 properties
[2025-06-02 09:24:18] [INFO ] Flow matrix only has 304 transitions (discarded 26 similar events)
[2025-06-02 09:24:18] [INFO ] Invariant cache hit.
[2025-06-02 09:24:18] [INFO ] State equation strengthened by 45 read => feed constraints.
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/21 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 15 unsolved
Problem AtomicPropp25 is UNSAT
Problem AtomicPropp32 is UNSAT
At refinement iteration 1 (OVERLAPS) 88/109 variables, 4/4 constraints. Problems are: Problem set: 2 solved, 13 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:24:18] [INFO ] Deduced a trap composed of 15 places in 110 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:24:18] [INFO ] Deduced a trap composed of 22 places in 122 ms of which 22 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/109 variables, 2/6 constraints. Problems are: Problem set: 2 solved, 13 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/109 variables, 0/6 constraints. Problems are: Problem set: 2 solved, 13 unsolved
At refinement iteration 4 (OVERLAPS) 12/121 variables, 4/10 constraints. Problems are: Problem set: 2 solved, 13 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:24:18] [INFO ] Deduced a trap composed of 17 places in 53 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:24:18] [INFO ] Deduced a trap composed of 35 places in 71 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:24:19] [INFO ] Deduced a trap composed of 43 places in 77 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/121 variables, 3/13 constraints. Problems are: Problem set: 2 solved, 13 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/121 variables, 0/13 constraints. Problems are: Problem set: 2 solved, 13 unsolved
At refinement iteration 7 (OVERLAPS) 303/424 variables, 121/134 constraints. Problems are: Problem set: 2 solved, 13 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/424 variables, 44/178 constraints. Problems are: Problem set: 2 solved, 13 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/424 variables, 0/178 constraints. Problems are: Problem set: 2 solved, 13 unsolved
At refinement iteration 10 (OVERLAPS) 3/427 variables, 3/181 constraints. Problems are: Problem set: 2 solved, 13 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/427 variables, 0/181 constraints. Problems are: Problem set: 2 solved, 13 unsolved
At refinement iteration 12 (OVERLAPS) 1/428 variables, 1/182 constraints. Problems are: Problem set: 2 solved, 13 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/428 variables, 0/182 constraints. Problems are: Problem set: 2 solved, 13 unsolved
At refinement iteration 14 (OVERLAPS) 0/428 variables, 0/182 constraints. Problems are: Problem set: 2 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Real declared 428/428 variables, and 182 constraints, problems are : Problem set: 2 solved, 13 unsolved in 1739 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 124/124 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 13 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: 2 solved, 13 unsolved
At refinement iteration 1 (OVERLAPS) 93/109 variables, 4/4 constraints. Problems are: Problem set: 2 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/109 variables, 2/6 constraints. Problems are: Problem set: 2 solved, 13 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/109 variables, 0/6 constraints. Problems are: Problem set: 2 solved, 13 unsolved
At refinement iteration 4 (OVERLAPS) 12/121 variables, 4/10 constraints. Problems are: Problem set: 2 solved, 13 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/121 variables, 3/13 constraints. Problems are: Problem set: 2 solved, 13 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/121 variables, 0/13 constraints. Problems are: Problem set: 2 solved, 13 unsolved
At refinement iteration 7 (OVERLAPS) 303/424 variables, 121/134 constraints. Problems are: Problem set: 2 solved, 13 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/424 variables, 44/178 constraints. Problems are: Problem set: 2 solved, 13 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/424 variables, 13/191 constraints. Problems are: Problem set: 2 solved, 13 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/424 variables, 0/191 constraints. Problems are: Problem set: 2 solved, 13 unsolved
At refinement iteration 11 (OVERLAPS) 3/427 variables, 3/194 constraints. Problems are: Problem set: 2 solved, 13 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/427 variables, 0/194 constraints. Problems are: Problem set: 2 solved, 13 unsolved
At refinement iteration 13 (OVERLAPS) 1/428 variables, 1/195 constraints. Problems are: Problem set: 2 solved, 13 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/428 variables, 0/195 constraints. Problems are: Problem set: 2 solved, 13 unsolved
At refinement iteration 15 (OVERLAPS) 0/428 variables, 0/195 constraints. Problems are: Problem set: 2 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Int declared 428/428 variables, and 195 constraints, problems are : Problem set: 2 solved, 13 unsolved in 4316 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 124/124 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 13/15 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 6083ms problems are : Problem set: 2 solved, 13 unsolved
Fused 13 Parikh solutions to 11 different solutions.
Parikh walk visited 0 properties in 8189 ms.
Support contains 16 out of 124 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 124/124 places, 330/330 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 124 transition count 327
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 5 place count 123 transition count 326
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 11 place count 120 transition count 332
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 17 place count 120 transition count 326
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 2 with 3 rules applied. Total rules applied 20 place count 120 transition count 323
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 21 place count 120 transition count 325
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 24 place count 119 transition count 323
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 26 place count 119 transition count 321
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 27 place count 118 transition count 320
Applied a total of 27 rules in 119 ms. Remains 118 /124 variables (removed 6) and now considering 320/330 (removed 10) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 120 ms. Remains : 118/124 places, 320/330 transitions.
RANDOM walk for 40000 steps (2346 resets) in 513 ms. (77 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (582 resets) in 106 ms. (373 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (581 resets) in 119 ms. (333 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (75 resets) in 105 ms. (377 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (55 resets) in 123 ms. (322 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40001 steps (47 resets) in 122 ms. (325 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (1125 resets) in 149 ms. (266 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (592 resets) in 147 ms. (270 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (556 resets) in 172 ms. (231 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (625 resets) in 202 ms. (197 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (579 resets) in 226 ms. (176 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (555 resets) in 199 ms. (200 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40001 steps (592 resets) in 200 ms. (199 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (63 resets) in 125 ms. (317 steps per ms) remains 13/13 properties
Interrupted probabilistic random walk after 472850 steps, run timeout after 3001 ms. (steps per millisecond=157 ) properties seen :7 out of 13
Probabilistic random walk after 472850 steps, saw 114551 distinct states, run finished after 3012 ms. (steps per millisecond=156 ) properties seen :7
[2025-06-02 09:24:36] [INFO ] Flow matrix only has 291 transitions (discarded 29 similar events)
// Phase 1: matrix 291 rows 118 cols
[2025-06-02 09:24:36] [INFO ] Computed 8 invariants in 4 ms
[2025-06-02 09:24:36] [INFO ] State equation strengthened by 45 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 55/63 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 235/298 variables, 63/65 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/298 variables, 23/88 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/298 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 101/399 variables, 47/135 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/399 variables, 3/138 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/399 variables, 22/160 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/399 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 1/400 variables, 1/161 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/400 variables, 1/162 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/400 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 9/409 variables, 7/169 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/409 variables, 2/171 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/409 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (OVERLAPS) 0/409 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 409/409 variables, and 171 constraints, problems are : Problem set: 0 solved, 6 unsolved in 876 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 118/118 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 55/63 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 235/298 variables, 63/65 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/298 variables, 23/88 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/298 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 101/399 variables, 47/135 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/399 variables, 3/138 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/399 variables, 22/160 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/399 variables, 6/166 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/399 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 1/400 variables, 1/167 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/400 variables, 1/168 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/400 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (OVERLAPS) 9/409 variables, 7/175 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/409 variables, 2/177 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/409 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (OVERLAPS) 0/409 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 409/409 variables, and 177 constraints, problems are : Problem set: 0 solved, 6 unsolved in 1959 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 118/118 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2862ms problems are : Problem set: 0 solved, 6 unsolved
Parikh walk visited 0 properties in 3226 ms.
Support contains 8 out of 118 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 118/118 places, 320/320 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 115 transition count 312
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 115 transition count 312
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 7 place count 115 transition count 311
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 9 place count 113 transition count 307
Iterating global reduction 1 with 2 rules applied. Total rules applied 11 place count 113 transition count 307
Applied a total of 11 rules in 33 ms. Remains 113 /118 variables (removed 5) and now considering 307/320 (removed 13) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33 ms. Remains : 113/118 places, 307/320 transitions.
RANDOM walk for 40000 steps (2255 resets) in 136 ms. (291 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (565 resets) in 53 ms. (740 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (65 resets) in 163 ms. (243 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (65 resets) in 366 ms. (109 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (1119 resets) in 251 ms. (158 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (578 resets) in 158 ms. (251 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (595 resets) in 36 ms. (1081 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 545848 steps, run timeout after 3001 ms. (steps per millisecond=181 ) properties seen :0 out of 6
Probabilistic random walk after 545848 steps, saw 124430 distinct states, run finished after 3001 ms. (steps per millisecond=181 ) properties seen :0
[2025-06-02 09:24:45] [INFO ] Flow matrix only has 278 transitions (discarded 29 similar events)
// Phase 1: matrix 278 rows 113 cols
[2025-06-02 09:24:45] [INFO ] Computed 8 invariants in 3 ms
[2025-06-02 09:24:46] [INFO ] State equation strengthened by 43 read => feed constraints.
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 55/63 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 225/288 variables, 63/65 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/288 variables, 23/88 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/288 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 93/381 variables, 42/130 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/381 variables, 3/133 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/381 variables, 20/153 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/381 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 1/382 variables, 1/154 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/382 variables, 1/155 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/382 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 9/391 variables, 7/162 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/391 variables, 2/164 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/391 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (OVERLAPS) 0/391 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 391/391 variables, and 164 constraints, problems are : Problem set: 0 solved, 6 unsolved in 720 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 113/113 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 55/63 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 225/288 variables, 63/65 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/288 variables, 23/88 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/288 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 93/381 variables, 42/130 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/381 variables, 3/133 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/381 variables, 20/153 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/381 variables, 6/159 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/381 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 1/382 variables, 1/160 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/382 variables, 1/161 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/382 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (OVERLAPS) 9/391 variables, 7/168 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/391 variables, 2/170 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/391 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (OVERLAPS) 0/391 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 391/391 variables, and 170 constraints, problems are : Problem set: 0 solved, 6 unsolved in 1995 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 113/113 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2734ms problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 739 ms.
Support contains 8 out of 113 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 113/113 places, 307/307 transitions.
Applied a total of 0 rules in 15 ms. Remains 113 /113 variables (removed 0) and now considering 307/307 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 113/113 places, 307/307 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 113/113 places, 307/307 transitions.
Applied a total of 0 rules in 14 ms. Remains 113 /113 variables (removed 0) and now considering 307/307 (removed 0) transitions.
[2025-06-02 09:24:49] [INFO ] Flow matrix only has 278 transitions (discarded 29 similar events)
[2025-06-02 09:24:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 09:24:49] [INFO ] Implicit Places using invariants in 138 ms returned []
[2025-06-02 09:24:49] [INFO ] Flow matrix only has 278 transitions (discarded 29 similar events)
[2025-06-02 09:24:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 09:24:49] [INFO ] State equation strengthened by 43 read => feed constraints.
[2025-06-02 09:24:49] [INFO ] Implicit Places using invariants and state equation in 264 ms returned []
Implicit Place search using SMT with State Equation took 409 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 09:24:49] [INFO ] Redundant transitions in 23 ms returned []
Running 305 sub problems to find dead transitions.
[2025-06-02 09:24:49] [INFO ] Flow matrix only has 278 transitions (discarded 29 similar events)
[2025-06-02 09:24:49] [INFO ] Invariant cache hit.
[2025-06-02 09:24:49] [INFO ] State equation strengthened by 43 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 305 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:24:52] [INFO ] Deduced a trap composed of 39 places in 180 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:24:52] [INFO ] Deduced a trap composed of 15 places in 180 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:24:52] [INFO ] Deduced a trap composed of 15 places in 181 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:24:52] [INFO ] Deduced a trap composed of 32 places in 66 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:24:52] [INFO ] Deduced a trap composed of 40 places in 66 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:24:52] [INFO ] Deduced a trap composed of 21 places in 196 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:24:53] [INFO ] Deduced a trap composed of 15 places in 206 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:24:54] [INFO ] Deduced a trap composed of 15 places in 166 ms of which 16 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/112 variables, 8/16 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 3 (OVERLAPS) 278/390 variables, 112/128 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/390 variables, 43/171 constraints. Problems are: Problem set: 0 solved, 305 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:25:02] [INFO ] Deduced a trap composed of 15 places in 163 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:25:04] [INFO ] Deduced a trap composed of 37 places in 150 ms of which 20 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/390 variables, 2/173 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/390 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 7 (OVERLAPS) 1/391 variables, 1/174 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/391 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 305 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 391/391 variables, and 174 constraints, problems are : Problem set: 0 solved, 305 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 113/113 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 305/305 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 305 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/112 variables, 10/18 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 3 (OVERLAPS) 278/390 variables, 112/130 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/390 variables, 43/173 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/390 variables, 305/478 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/390 variables, 0/478 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 7 (OVERLAPS) 1/391 variables, 1/479 constraints. Problems are: Problem set: 0 solved, 305 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 391/391 variables, and 479 constraints, problems are : Problem set: 0 solved, 305 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 113/113 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 305/305 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60163ms problems are : Problem set: 0 solved, 305 unsolved
Search for dead transitions found 0 dead transitions in 60165ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60619 ms. Remains : 113/113 places, 307/307 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 106 edges and 113 vertex of which 29 / 113 are part of one of the 4 SCC in 4 ms
Free SCC test removed 25 places
Drop transitions (Empty/Sink Transition effects.) removed 119 transitions
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 126 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 87 transition count 180
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 87 transition count 177
Free-agglomeration rule applied 3 times with reduction of 2 identical transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 9 place count 87 transition count 172
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 13 place count 84 transition count 171
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 1 with 3 rules applied. Total rules applied 16 place count 84 transition count 171
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 84 transition count 170
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 18 place count 83 transition count 169
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 83 transition count 169
Applied a total of 19 rules in 62 ms. Remains 83 /113 variables (removed 30) and now considering 169/307 (removed 138) transitions.
Running SMT prover for 6 properties.
[2025-06-02 09:25:50] [INFO ] Flow matrix only has 167 transitions (discarded 2 similar events)
// Phase 1: matrix 167 rows 83 cols
[2025-06-02 09:25:50] [INFO ] Computed 8 invariants in 2 ms
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-06-02 09:25:50] [INFO ] [Real]Absence check using 8 positive place invariants in 6 ms returned sat
[2025-06-02 09:25:50] [INFO ] After 266ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-06-02 09:25:50] [INFO ] [Nat]Absence check using 8 positive place invariants in 7 ms returned sat
[2025-06-02 09:25:50] [INFO ] After 204ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
TRAPS : Iteration 0
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:25:50] [INFO ] Deduced a trap composed of 7 places in 103 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:25:50] [INFO ] Deduced a trap composed of 7 places in 82 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:25:51] [INFO ] Deduced a trap composed of 21 places in 60 ms of which 4 ms to minimize.
[2025-06-02 09:25:51] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 297 ms
TRAPS : Iteration 1
[2025-06-02 09:25:51] [INFO ] After 796ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
[2025-06-02 09:25:51] [INFO ] After 1004ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Over-approximation ignoring read arcs solved 0 properties in 1362 ms.
FORMULA FireWire-PT-08-LTLFireability-14 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA FireWire-PT-08-LTLFireability-05 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA FireWire-PT-08-LTLFireability-06 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 2 atomic propositions for a total of 12 simplifications.
Computed a total of 22 stabilizing places and 46 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 124 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 124/124 places, 330/330 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 119 transition count 318
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 119 transition count 318
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 9 place count 119 transition count 317
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 12 place count 116 transition count 311
Iterating global reduction 1 with 3 rules applied. Total rules applied 15 place count 116 transition count 311
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 16 place count 115 transition count 308
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 115 transition count 308
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 18 place count 114 transition count 306
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 114 transition count 306
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 20 place count 113 transition count 303
Iterating global reduction 1 with 1 rules applied. Total rules applied 21 place count 113 transition count 303
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 22 place count 112 transition count 301
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 112 transition count 301
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 111 transition count 298
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 111 transition count 298
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 26 place count 110 transition count 296
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 110 transition count 296
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 28 place count 109 transition count 293
Iterating global reduction 1 with 1 rules applied. Total rules applied 29 place count 109 transition count 293
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 30 place count 108 transition count 291
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 108 transition count 291
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 32 place count 107 transition count 289
Iterating global reduction 1 with 1 rules applied. Total rules applied 33 place count 107 transition count 289
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 34 place count 106 transition count 287
Iterating global reduction 1 with 1 rules applied. Total rules applied 35 place count 106 transition count 287
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 37 place count 105 transition count 286
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 43 place count 102 transition count 292
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 49 place count 102 transition count 286
Applied a total of 49 rules in 98 ms. Remains 102 /124 variables (removed 22) and now considering 286/330 (removed 44) transitions.
[2025-06-02 09:25:52] [INFO ] Flow matrix only has 253 transitions (discarded 33 similar events)
// Phase 1: matrix 253 rows 102 cols
[2025-06-02 09:25:52] [INFO ] Computed 8 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 09:25:52] [INFO ] Implicit Places using invariants in 158 ms returned []
[2025-06-02 09:25:52] [INFO ] Flow matrix only has 253 transitions (discarded 33 similar events)
[2025-06-02 09:25:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 09:25:52] [INFO ] State equation strengthened by 38 read => feed constraints.
[2025-06-02 09:25:52] [INFO ] Implicit Places using invariants and state equation in 360 ms returned []
Implicit Place search using SMT with State Equation took 520 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 09:25:52] [INFO ] Redundant transitions in 15 ms returned []
Running 283 sub problems to find dead transitions.
[2025-06-02 09:25:52] [INFO ] Flow matrix only has 253 transitions (discarded 33 similar events)
[2025-06-02 09:25:52] [INFO ] Invariant cache hit.
[2025-06-02 09:25:52] [INFO ] State equation strengthened by 38 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 283 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:25:54] [INFO ] Deduced a trap composed of 35 places in 167 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:25:54] [INFO ] Deduced a trap composed of 36 places in 174 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:25:54] [INFO ] Deduced a trap composed of 15 places in 154 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:25:54] [INFO ] Deduced a trap composed of 21 places in 183 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:25:55] [INFO ] Deduced a trap composed of 33 places in 60 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:25:55] [INFO ] Deduced a trap composed of 15 places in 151 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:25:55] [INFO ] Deduced a trap composed of 21 places in 184 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:25:56] [INFO ] Deduced a trap composed of 15 places in 127 ms of which 16 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 8/16 constraints. Problems are: Problem set: 0 solved, 283 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:25:57] [INFO ] Deduced a trap composed of 35 places in 190 ms of which 16 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/101 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 4 (OVERLAPS) 252/353 variables, 101/118 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/353 variables, 38/156 constraints. Problems are: Problem set: 0 solved, 283 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:26:03] [INFO ] Deduced a trap composed of 15 places in 96 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:26:03] [INFO ] Deduced a trap composed of 15 places in 110 ms of which 8 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/353 variables, 2/158 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/353 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 8 (OVERLAPS) 1/354 variables, 1/159 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/354 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 283 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 354/355 variables, and 159 constraints, problems are : Problem set: 0 solved, 283 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 102/102 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 283/283 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 283 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 11/19 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 3 (OVERLAPS) 252/353 variables, 101/120 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/353 variables, 38/158 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/353 variables, 283/441 constraints. Problems are: Problem set: 0 solved, 283 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:26:32] [INFO ] Deduced a trap composed of 32 places in 83 ms of which 5 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/353 variables, 1/442 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/353 variables, 0/442 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 8 (OVERLAPS) 1/354 variables, 1/443 constraints. Problems are: Problem set: 0 solved, 283 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 354/355 variables, and 443 constraints, problems are : Problem set: 0 solved, 283 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 102/102 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 283/283 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60225ms problems are : Problem set: 0 solved, 283 unsolved
Search for dead transitions found 0 dead transitions in 60228ms
Starting structural reductions in SI_LTL mode, iteration 1 : 102/124 places, 286/330 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 60876 ms. Remains : 102/124 places, 286/330 transitions.
Stuttering acceptance computed with spot in 387 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FireWire-PT-08-LTLFireability-00
Product exploration explored 100000 steps with 0 reset in 323 ms.
Product exploration explored 100000 steps with 0 reset in 243 ms.
Computed a total of 8 stabilizing places and 15 stable transitions
Computed a total of 8 stabilizing places and 15 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 119 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 109 steps (4 resets) in 6 ms. (15 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 111 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 102 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 102/102 places, 286/286 transitions.
Applied a total of 0 rules in 8 ms. Remains 102 /102 variables (removed 0) and now considering 286/286 (removed 0) transitions.
[2025-06-02 09:26:54] [INFO ] Flow matrix only has 253 transitions (discarded 33 similar events)
[2025-06-02 09:26:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 09:26:54] [INFO ] Implicit Places using invariants in 142 ms returned []
[2025-06-02 09:26:54] [INFO ] Flow matrix only has 253 transitions (discarded 33 similar events)
[2025-06-02 09:26:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 09:26:54] [INFO ] State equation strengthened by 38 read => feed constraints.
[2025-06-02 09:26:54] [INFO ] Implicit Places using invariants and state equation in 269 ms returned []
Implicit Place search using SMT with State Equation took 414 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 09:26:54] [INFO ] Redundant transitions in 7 ms returned []
Running 283 sub problems to find dead transitions.
[2025-06-02 09:26:54] [INFO ] Flow matrix only has 253 transitions (discarded 33 similar events)
[2025-06-02 09:26:54] [INFO ] Invariant cache hit.
[2025-06-02 09:26:54] [INFO ] State equation strengthened by 38 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 283 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:26:56] [INFO ] Deduced a trap composed of 35 places in 173 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:26:56] [INFO ] Deduced a trap composed of 36 places in 146 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:26:56] [INFO ] Deduced a trap composed of 15 places in 101 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:26:56] [INFO ] Deduced a trap composed of 21 places in 108 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:26:57] [INFO ] Deduced a trap composed of 33 places in 62 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:26:57] [INFO ] Deduced a trap composed of 15 places in 169 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:26:58] [INFO ] Deduced a trap composed of 21 places in 179 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:26:58] [INFO ] Deduced a trap composed of 15 places in 139 ms of which 18 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 8/16 constraints. Problems are: Problem set: 0 solved, 283 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:26:58] [INFO ] Deduced a trap composed of 35 places in 156 ms of which 17 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/101 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 4 (OVERLAPS) 252/353 variables, 101/118 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/353 variables, 38/156 constraints. Problems are: Problem set: 0 solved, 283 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:27:06] [INFO ] Deduced a trap composed of 15 places in 143 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:27:06] [INFO ] Deduced a trap composed of 15 places in 139 ms of which 9 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/353 variables, 2/158 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/353 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 8 (OVERLAPS) 1/354 variables, 1/159 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/354 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 283 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 354/355 variables, and 159 constraints, problems are : Problem set: 0 solved, 283 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 102/102 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 283/283 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 283 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 11/19 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 3 (OVERLAPS) 252/353 variables, 101/120 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/353 variables, 38/158 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/353 variables, 283/441 constraints. Problems are: Problem set: 0 solved, 283 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:27:34] [INFO ] Deduced a trap composed of 32 places in 68 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/353 variables, 1/442 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/353 variables, 0/442 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 8 (OVERLAPS) 1/354 variables, 1/443 constraints. Problems are: Problem set: 0 solved, 283 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 354/355 variables, and 443 constraints, problems are : Problem set: 0 solved, 283 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 102/102 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 283/283 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60204ms problems are : Problem set: 0 solved, 283 unsolved
Search for dead transitions found 0 dead transitions in 60206ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 60642 ms. Remains : 102/102 places, 286/286 transitions.
Computed a total of 8 stabilizing places and 15 stable transitions
Computed a total of 8 stabilizing places and 15 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 94 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 86 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 237 steps (13 resets) in 9 ms. (23 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 128 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 83 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 82 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1 reset in 153 ms.
Product exploration explored 100000 steps with 0 reset in 123 ms.
Built C files in :
/tmp/ltsmin1475453502768152472
[2025-06-02 09:27:56] [INFO ] Computing symmetric may disable matrix : 286 transitions.
[2025-06-02 09:27:56] [INFO ] Computation of Complete disable matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 09:27:56] [INFO ] Computing symmetric may enable matrix : 286 transitions.
[2025-06-02 09:27:56] [INFO ] Computation of Complete enable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 09:27:56] [INFO ] Computing Do-Not-Accords matrix : 286 transitions.
[2025-06-02 09:27:56] [INFO ] Computation of Completed DNA matrix. took 16 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 09:27:56] [INFO ] Built C files in 193ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1475453502768152472
Running compilation step : cd /tmp/ltsmin1475453502768152472;'/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 1562 ms.
Running link step : cd /tmp/ltsmin1475453502768152472;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 61 ms.
Running LTSmin : cd /tmp/ltsmin1475453502768152472;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased12337204231820140988.hoa' '--buchi-type=spotba'
LTSmin run took 853 ms.
FORMULA FireWire-PT-08-LTLFireability-00 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property FireWire-PT-08-LTLFireability-00 finished in 126694 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G((X((!p0||X(p1)))||F(p2))) U !p3)))'
Support contains 8 out of 124 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 124/124 places, 330/330 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 121 transition count 321
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 121 transition count 321
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 9 place count 118 transition count 315
Iterating global reduction 0 with 3 rules applied. Total rules applied 12 place count 118 transition count 315
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 117 transition count 312
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 117 transition count 312
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 116 transition count 310
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 116 transition count 310
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 115 transition count 307
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 115 transition count 307
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 114 transition count 305
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 114 transition count 305
Applied a total of 20 rules in 11 ms. Remains 114 /124 variables (removed 10) and now considering 305/330 (removed 25) transitions.
[2025-06-02 09:27:58] [INFO ] Flow matrix only has 279 transitions (discarded 26 similar events)
// Phase 1: matrix 279 rows 114 cols
[2025-06-02 09:27:58] [INFO ] Computed 8 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 09:27:58] [INFO ] Implicit Places using invariants in 117 ms returned []
[2025-06-02 09:27:58] [INFO ] Flow matrix only has 279 transitions (discarded 26 similar events)
[2025-06-02 09:27:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 09:27:59] [INFO ] State equation strengthened by 40 read => feed constraints.
[2025-06-02 09:27:59] [INFO ] Implicit Places using invariants and state equation in 283 ms returned []
Implicit Place search using SMT with State Equation took 402 ms to find 0 implicit places.
Running 304 sub problems to find dead transitions.
[2025-06-02 09:27:59] [INFO ] Flow matrix only has 279 transitions (discarded 26 similar events)
[2025-06-02 09:27:59] [INFO ] Invariant cache hit.
[2025-06-02 09:27:59] [INFO ] State equation strengthened by 40 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/113 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 1 (OVERLAPS) 1/114 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 304 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:28:03] [INFO ] Deduced a trap composed of 38 places in 112 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:28:03] [INFO ] Deduced a trap composed of 15 places in 152 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:28:03] [INFO ] Deduced a trap composed of 22 places in 111 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:28:03] [INFO ] Deduced a trap composed of 35 places in 59 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:28:03] [INFO ] Deduced a trap composed of 43 places in 59 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:28:04] [INFO ] Deduced a trap composed of 18 places in 174 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:28:04] [INFO ] Deduced a trap composed of 17 places in 119 ms of which 14 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/114 variables, 7/15 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/114 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 4 (OVERLAPS) 278/392 variables, 114/129 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/392 variables, 39/168 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/392 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 7 (OVERLAPS) 1/393 variables, 1/169 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/393 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 9 (OVERLAPS) 0/393 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 304 unsolved
No progress, stopping.
After SMT solving in domain Real declared 393/393 variables, and 169 constraints, problems are : Problem set: 0 solved, 304 unsolved in 28951 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 114/114 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 304/304 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 304 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/113 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 1 (OVERLAPS) 1/114 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/114 variables, 7/15 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/114 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 4 (OVERLAPS) 278/392 variables, 114/129 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/392 variables, 39/168 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/392 variables, 304/472 constraints. Problems are: Problem set: 0 solved, 304 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 392/393 variables, and 472 constraints, problems are : Problem set: 0 solved, 304 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 114/114 constraints, ReadFeed: 39/40 constraints, PredecessorRefiner: 304/304 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 59130ms problems are : Problem set: 0 solved, 304 unsolved
Search for dead transitions found 0 dead transitions in 59134ms
Starting structural reductions in LTL mode, iteration 1 : 114/124 places, 305/330 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 59549 ms. Remains : 114/124 places, 305/330 transitions.
Stuttering acceptance computed with spot in 424 ms :[p3, p3, (AND (NOT p2) p0 (NOT p1)), (AND (NOT p2) p0 (NOT p1)), (AND (NOT p2) (NOT p1)), (NOT p2)]
Running random walk in product with property : FireWire-PT-08-LTLFireability-02
Product exploration explored 100000 steps with 50000 reset in 331 ms.
Product exploration explored 100000 steps with 50000 reset in 353 ms.
Computed a total of 16 stabilizing places and 31 stable transitions
Computed a total of 16 stabilizing places and 31 stable transitions
Knowledge obtained : [(AND (NOT p3) (NOT p2) (NOT p0) (NOT p1)), (X (NOT (AND p3 (NOT p2)))), (X (NOT p2)), (X (NOT p3)), (X (X (NOT (AND p3 (NOT p2))))), (X (X (NOT p2))), (X (X (NOT p3))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 9 factoid took 25 ms. Reduced automaton from 6 states, 9 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FireWire-PT-08-LTLFireability-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FireWire-PT-08-LTLFireability-02 finished in 60723 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((F(G(p0))&&G(p1))))'
Support contains 4 out of 124 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 124/124 places, 330/330 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 119 transition count 318
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 119 transition count 318
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 9 place count 119 transition count 317
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 12 place count 116 transition count 311
Iterating global reduction 1 with 3 rules applied. Total rules applied 15 place count 116 transition count 311
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 16 place count 115 transition count 308
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 115 transition count 308
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 18 place count 114 transition count 306
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 114 transition count 306
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 20 place count 113 transition count 303
Iterating global reduction 1 with 1 rules applied. Total rules applied 21 place count 113 transition count 303
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 22 place count 112 transition count 301
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 112 transition count 301
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 111 transition count 298
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 111 transition count 298
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 26 place count 110 transition count 296
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 110 transition count 296
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 29 place count 109 transition count 295
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 35 place count 106 transition count 301
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 41 place count 106 transition count 295
Applied a total of 41 rules in 71 ms. Remains 106 /124 variables (removed 18) and now considering 295/330 (removed 35) transitions.
[2025-06-02 09:28:59] [INFO ] Flow matrix only has 262 transitions (discarded 33 similar events)
// Phase 1: matrix 262 rows 106 cols
[2025-06-02 09:28:59] [INFO ] Computed 8 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 09:28:59] [INFO ] Implicit Places using invariants in 90 ms returned []
[2025-06-02 09:28:59] [INFO ] Flow matrix only has 262 transitions (discarded 33 similar events)
[2025-06-02 09:28:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 09:28:59] [INFO ] State equation strengthened by 39 read => feed constraints.
[2025-06-02 09:28:59] [INFO ] Implicit Places using invariants and state equation in 257 ms returned []
Implicit Place search using SMT with State Equation took 349 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 09:28:59] [INFO ] Redundant transitions in 2 ms returned []
Running 292 sub problems to find dead transitions.
[2025-06-02 09:28:59] [INFO ] Flow matrix only has 262 transitions (discarded 33 similar events)
[2025-06-02 09:28:59] [INFO ] Invariant cache hit.
[2025-06-02 09:28:59] [INFO ] State equation strengthened by 39 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 292 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:29:01] [INFO ] Deduced a trap composed of 36 places in 155 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:29:01] [INFO ] Deduced a trap composed of 15 places in 145 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:29:01] [INFO ] Deduced a trap composed of 21 places in 148 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:29:01] [INFO ] Deduced a trap composed of 33 places in 91 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:29:02] [INFO ] Deduced a trap composed of 41 places in 68 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:29:02] [INFO ] Deduced a trap composed of 15 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 09:29:03] [INFO ] Deduced a trap composed of 15 places in 105 ms of which 14 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/105 variables, 7/15 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/105 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 3 (OVERLAPS) 261/366 variables, 105/120 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/366 variables, 39/159 constraints. Problems are: Problem set: 0 solved, 292 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:29:09] [INFO ] Deduced a trap composed of 15 places in 131 ms of which 12 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/366 variables, 1/160 constraints. Problems are: Problem set: 0 solved, 292 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:29:14] [INFO ] Deduced a trap composed of 33 places in 92 ms of which 6 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/366 variables, 1/161 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/366 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 8 (OVERLAPS) 1/367 variables, 1/162 constraints. Problems are: Problem set: 0 solved, 292 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:29:24] [INFO ] Deduced a trap composed of 21 places in 182 ms of which 22 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/367 variables, 1/163 constraints. Problems are: Problem set: 0 solved, 292 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 367/368 variables, and 163 constraints, problems are : Problem set: 0 solved, 292 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 106/106 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 292/292 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 292 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/105 variables, 10/18 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/105 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 3 (OVERLAPS) 261/366 variables, 105/123 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/366 variables, 39/162 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/366 variables, 292/454 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/366 variables, 0/454 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 7 (OVERLAPS) 1/367 variables, 1/455 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/367 variables, 0/455 constraints. Problems are: Problem set: 0 solved, 292 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 367/368 variables, and 455 constraints, problems are : Problem set: 0 solved, 292 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 106/106 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 292/292 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60133ms problems are : Problem set: 0 solved, 292 unsolved
Search for dead transitions found 0 dead transitions in 60136ms
Starting structural reductions in SI_LTL mode, iteration 1 : 106/124 places, 295/330 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 60566 ms. Remains : 106/124 places, 295/330 transitions.
Stuttering acceptance computed with spot in 96 ms :[(OR (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : FireWire-PT-08-LTLFireability-03
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA FireWire-PT-08-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-08-LTLFireability-03 finished in 60690 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)&&F(p1)&&F((p2||G(p0)))) U p3))'
Support contains 6 out of 124 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 124/124 places, 330/330 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 121 transition count 322
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 121 transition count 322
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 7 place count 121 transition count 321
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 9 place count 119 transition count 317
Iterating global reduction 1 with 2 rules applied. Total rules applied 11 place count 119 transition count 317
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 12 place count 118 transition count 314
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 118 transition count 314
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 14 place count 117 transition count 312
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 117 transition count 312
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 16 place count 116 transition count 309
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 116 transition count 309
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 18 place count 115 transition count 307
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 115 transition count 307
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 20 place count 114 transition count 304
Iterating global reduction 1 with 1 rules applied. Total rules applied 21 place count 114 transition count 304
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 22 place count 113 transition count 302
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 113 transition count 302
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 112 transition count 299
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 112 transition count 299
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 26 place count 111 transition count 297
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 111 transition count 297
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 29 place count 110 transition count 296
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 33 place count 108 transition count 300
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 1 with 4 rules applied. Total rules applied 37 place count 108 transition count 296
Applied a total of 37 rules in 41 ms. Remains 108 /124 variables (removed 16) and now considering 296/330 (removed 34) transitions.
[2025-06-02 09:30:00] [INFO ] Flow matrix only has 266 transitions (discarded 30 similar events)
// Phase 1: matrix 266 rows 108 cols
[2025-06-02 09:30:00] [INFO ] Computed 8 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 09:30:00] [INFO ] Implicit Places using invariants in 89 ms returned []
[2025-06-02 09:30:00] [INFO ] Flow matrix only has 266 transitions (discarded 30 similar events)
[2025-06-02 09:30:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 09:30:00] [INFO ] State equation strengthened by 41 read => feed constraints.
[2025-06-02 09:30:00] [INFO ] Implicit Places using invariants and state equation in 237 ms returned []
Implicit Place search using SMT with State Equation took 328 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 09:30:00] [INFO ] Redundant transitions in 4 ms returned []
Running 295 sub problems to find dead transitions.
[2025-06-02 09:30:00] [INFO ] Flow matrix only has 266 transitions (discarded 30 similar events)
[2025-06-02 09:30:00] [INFO ] Invariant cache hit.
[2025-06-02 09:30:00] [INFO ] State equation strengthened by 41 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 1 (OVERLAPS) 1/108 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 295 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:30:04] [INFO ] Deduced a trap composed of 36 places in 175 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:30:04] [INFO ] Deduced a trap composed of 15 places in 170 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:30:04] [INFO ] Deduced a trap composed of 22 places in 176 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:30:05] [INFO ] Deduced a trap composed of 35 places in 76 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:30:05] [INFO ] Deduced a trap composed of 43 places in 49 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:30:05] [INFO ] Deduced a trap composed of 16 places in 125 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:30:05] [INFO ] Deduced a trap composed of 16 places in 100 ms of which 20 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 7/15 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/108 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 4 (OVERLAPS) 265/373 variables, 108/123 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/373 variables, 40/163 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/373 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 7 (OVERLAPS) 1/374 variables, 1/164 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/374 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 9 (OVERLAPS) 0/374 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 295 unsolved
No progress, stopping.
After SMT solving in domain Real declared 374/374 variables, and 164 constraints, problems are : Problem set: 0 solved, 295 unsolved in 23736 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 108/108 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 295/295 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 295 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 1 (OVERLAPS) 1/108 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 7/15 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/108 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 4 (OVERLAPS) 265/373 variables, 108/123 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/373 variables, 40/163 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/373 variables, 295/458 constraints. Problems are: Problem set: 0 solved, 295 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 1)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 1)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 1)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 1)
(s37 1)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 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 373/374 variables, and 458 constraints, problems are : Problem set: 0 solved, 295 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 108/108 constraints, ReadFeed: 40/41 constraints, PredecessorRefiner: 295/295 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 53878ms problems are : Problem set: 0 solved, 295 unsolved
Search for dead transitions found 0 dead transitions in 53880ms
Starting structural reductions in SI_LTL mode, iteration 1 : 108/124 places, 296/330 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 54264 ms. Remains : 108/124 places, 296/330 transitions.
Stuttering acceptance computed with spot in 179 ms :[(NOT p3), (NOT p0), (NOT p1), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : FireWire-PT-08-LTLFireability-04
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 1 ms.
FORMULA FireWire-PT-08-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-08-LTLFireability-04 finished in 54476 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((X(X((X(X(p1)) U ((X(X(p1))&&(!p2 U (p3||G(!p2))))||X(X(G(p1)))))))||p0)))'
Support contains 5 out of 124 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 124/124 places, 330/330 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 120 transition count 319
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 120 transition count 319
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 9 place count 120 transition count 318
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 11 place count 118 transition count 314
Iterating global reduction 1 with 2 rules applied. Total rules applied 13 place count 118 transition count 314
Applied a total of 13 rules in 4 ms. Remains 118 /124 variables (removed 6) and now considering 314/330 (removed 16) transitions.
[2025-06-02 09:30:54] [INFO ] Flow matrix only has 288 transitions (discarded 26 similar events)
// Phase 1: matrix 288 rows 118 cols
[2025-06-02 09:30:54] [INFO ] Computed 8 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 09:30:54] [INFO ] Implicit Places using invariants in 102 ms returned []
[2025-06-02 09:30:54] [INFO ] Flow matrix only has 288 transitions (discarded 26 similar events)
[2025-06-02 09:30:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 09:30:54] [INFO ] State equation strengthened by 42 read => feed constraints.
[2025-06-02 09:30:55] [INFO ] Implicit Places using invariants and state equation in 326 ms returned []
Implicit Place search using SMT with State Equation took 430 ms to find 0 implicit places.
Running 313 sub problems to find dead transitions.
[2025-06-02 09:30:55] [INFO ] Flow matrix only has 288 transitions (discarded 26 similar events)
[2025-06-02 09:30:55] [INFO ] Invariant cache hit.
[2025-06-02 09:30:55] [INFO ] State equation strengthened by 42 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/117 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 1 (OVERLAPS) 1/118 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 313 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:30:59] [INFO ] Deduced a trap composed of 41 places in 111 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:30:59] [INFO ] Deduced a trap composed of 15 places in 157 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:30:59] [INFO ] Deduced a trap composed of 17 places in 48 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:31:00] [INFO ] Deduced a trap composed of 22 places in 206 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:31:00] [INFO ] Deduced a trap composed of 17 places in 213 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:31:00] [INFO ] Deduced a trap composed of 35 places in 74 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:31:00] [INFO ] Deduced a trap composed of 43 places in 63 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/118 variables, 7/15 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/118 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 4 (OVERLAPS) 287/405 variables, 118/133 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/405 variables, 41/174 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/405 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 7 (OVERLAPS) 1/406 variables, 1/175 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/406 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 9 (OVERLAPS) 0/406 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 313 unsolved
No progress, stopping.
After SMT solving in domain Real declared 406/406 variables, and 175 constraints, problems are : Problem set: 0 solved, 313 unsolved in 27441 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 118/118 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 313/313 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 313 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/117 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 1 (OVERLAPS) 1/118 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/118 variables, 7/15 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/118 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 4 (OVERLAPS) 287/405 variables, 118/133 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/405 variables, 41/174 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/405 variables, 313/487 constraints. Problems are: Problem set: 0 solved, 313 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 405/406 variables, and 487 constraints, problems are : Problem set: 0 solved, 313 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 118/118 constraints, ReadFeed: 41/42 constraints, PredecessorRefiner: 313/313 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 57559ms problems are : Problem set: 0 solved, 313 unsolved
Search for dead transitions found 0 dead transitions in 57561ms
Starting structural reductions in LTL mode, iteration 1 : 118/124 places, 314/330 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 57996 ms. Remains : 118/124 places, 314/330 transitions.
Stuttering acceptance computed with spot in 569 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (AND (NOT p3) p2 (NOT p1)), (AND (NOT p1) (NOT p3) p2), (NOT p1), (NOT p1), (AND (NOT p3) p2 (NOT p1)), true, (AND (NOT p3) p2 p1)]
Running random walk in product with property : FireWire-PT-08-LTLFireability-07
Product exploration explored 100000 steps with 0 reset in 115 ms.
Product exploration explored 100000 steps with 0 reset in 115 ms.
Computed a total of 21 stabilizing places and 43 stable transitions
Computed a total of 21 stabilizing places and 43 stable transitions
Knowledge obtained : [(AND p0 p3 (NOT p2) (NOT p1)), (X (X (NOT p2))), (X (X p3)), (X (X (NOT (AND (NOT p3) p2 (NOT p1))))), (X (X (NOT (AND (NOT p3) (NOT p2) p1)))), (X (X (NOT (AND (NOT p3) (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p3) p2 p1)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 512 ms. Reduced automaton from 10 states, 23 edges and 4 AP (stutter sensitive) to 10 states, 23 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 392 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (AND p2 (NOT p3) (NOT p1)), (AND (NOT p1) p2 (NOT p3)), (NOT p1), (NOT p1), (AND p2 (NOT p3) (NOT p1)), true, (AND p2 (NOT p3) p1)]
RANDOM walk for 40000 steps (2225 resets) in 521 ms. (76 steps per ms) remains 7/10 properties
BEST_FIRST walk for 40003 steps (1084 resets) in 264 ms. (150 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (1101 resets) in 135 ms. (294 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (468 resets) in 158 ms. (251 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (1050 resets) in 441 ms. (90 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (85 resets) in 131 ms. (303 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (448 resets) in 430 ms. (92 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (61 resets) in 107 ms. (370 steps per ms) remains 7/7 properties
[2025-06-02 09:31:55] [INFO ] Flow matrix only has 288 transitions (discarded 26 similar events)
[2025-06-02 09:31:55] [INFO ] Invariant cache hit.
[2025-06-02 09:31:55] [INFO ] State equation strengthened by 42 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Problem apf2 is UNSAT
Problem apf8 is UNSAT
At refinement iteration 1 (OVERLAPS) 60/65 variables, 2/2 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 0/2 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 50/115 variables, 6/8 constraints. Problems are: Problem set: 2 solved, 5 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:31:55] [INFO ] Deduced a trap composed of 43 places in 48 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/115 variables, 1/9 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/115 variables, 0/9 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 287/402 variables, 115/124 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/402 variables, 41/165 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/402 variables, 0/165 constraints. Problems are: Problem set: 2 solved, 5 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 3/405 variables, 3/168 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/405 variables, 0/168 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 1/406 variables, 1/169 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/406 variables, 0/169 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 0/406 variables, 0/169 constraints. Problems are: Problem set: 2 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 406/406 variables, and 169 constraints, problems are : Problem set: 2 solved, 5 unsolved in 523 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 118/118 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 5 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 60/65 variables, 2/2 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 0/2 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 50/115 variables, 6/8 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/115 variables, 1/9 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/115 variables, 0/9 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 287/402 variables, 115/124 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/402 variables, 41/165 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/402 variables, 5/170 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/402 variables, 0/170 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 3/405 variables, 3/173 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/405 variables, 0/173 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 1/406 variables, 1/174 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/406 variables, 0/174 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 14 (OVERLAPS) 0/406 variables, 0/174 constraints. Problems are: Problem set: 2 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 406/406 variables, and 174 constraints, problems are : Problem set: 2 solved, 5 unsolved in 995 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 118/118 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 5/7 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1533ms problems are : Problem set: 2 solved, 5 unsolved
Fused 5 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 828 ms.
Support contains 5 out of 118 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 118/118 places, 314/314 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 118 transition count 311
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 5 place count 117 transition count 310
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 11 place count 114 transition count 316
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 17 place count 114 transition count 310
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 2 with 3 rules applied. Total rules applied 20 place count 114 transition count 307
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 21 place count 114 transition count 309
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 24 place count 113 transition count 307
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 26 place count 113 transition count 305
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 27 place count 112 transition count 304
Applied a total of 27 rules in 30 ms. Remains 112 /118 variables (removed 6) and now considering 304/314 (removed 10) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30 ms. Remains : 112/118 places, 304/314 transitions.
RANDOM walk for 40000 steps (2273 resets) in 191 ms. (208 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (1103 resets) in 90 ms. (439 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (1115 resets) in 82 ms. (481 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (1132 resets) in 99 ms. (400 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (70 resets) in 60 ms. (655 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (71 resets) in 58 ms. (678 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 472502 steps, run timeout after 3001 ms. (steps per millisecond=157 ) properties seen :0 out of 5
Probabilistic random walk after 472502 steps, saw 108576 distinct states, run finished after 3001 ms. (steps per millisecond=157 ) properties seen :0
[2025-06-02 09:32:00] [INFO ] Flow matrix only has 275 transitions (discarded 29 similar events)
// Phase 1: matrix 275 rows 112 cols
[2025-06-02 09:32:00] [INFO ] Computed 8 invariants in 2 ms
[2025-06-02 09:32:00] [INFO ] State equation strengthened by 42 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 57/62 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 222/284 variables, 62/64 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/284 variables, 22/86 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/284 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 5 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 93/377 variables, 42/128 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/377 variables, 3/131 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/377 variables, 20/151 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/377 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 1/378 variables, 1/152 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/378 variables, 1/153 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/378 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 9/387 variables, 7/160 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/387 variables, 2/162 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/387 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (OVERLAPS) 0/387 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 387/387 variables, and 162 constraints, problems are : Problem set: 0 solved, 5 unsolved in 575 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 112/112 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 57/62 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 222/284 variables, 62/64 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/284 variables, 22/86 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/284 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 93/377 variables, 42/128 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/377 variables, 3/131 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/377 variables, 20/151 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/377 variables, 5/156 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/377 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 1/378 variables, 1/157 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/378 variables, 1/158 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/378 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (OVERLAPS) 9/387 variables, 7/165 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/387 variables, 2/167 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/387 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (OVERLAPS) 0/387 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 387/387 variables, and 167 constraints, problems are : Problem set: 0 solved, 5 unsolved in 1308 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 112/112 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1897ms problems are : Problem set: 0 solved, 5 unsolved
Fused 5 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 310 ms.
Support contains 5 out of 112 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 112/112 places, 304/304 transitions.
Applied a total of 0 rules in 5 ms. Remains 112 /112 variables (removed 0) and now considering 304/304 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 112/112 places, 304/304 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 112/112 places, 304/304 transitions.
Applied a total of 0 rules in 4 ms. Remains 112 /112 variables (removed 0) and now considering 304/304 (removed 0) transitions.
[2025-06-02 09:32:02] [INFO ] Flow matrix only has 275 transitions (discarded 29 similar events)
[2025-06-02 09:32:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 09:32:03] [INFO ] Implicit Places using invariants in 118 ms returned []
[2025-06-02 09:32:03] [INFO ] Flow matrix only has 275 transitions (discarded 29 similar events)
[2025-06-02 09:32:03] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 09:32:03] [INFO ] State equation strengthened by 42 read => feed constraints.
[2025-06-02 09:32:03] [INFO ] Implicit Places using invariants and state equation in 271 ms returned []
Implicit Place search using SMT with State Equation took 392 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 09:32:03] [INFO ] Redundant transitions in 2 ms returned []
Running 302 sub problems to find dead transitions.
[2025-06-02 09:32:03] [INFO ] Flow matrix only has 275 transitions (discarded 29 similar events)
[2025-06-02 09:32:03] [INFO ] Invariant cache hit.
[2025-06-02 09:32:03] [INFO ] State equation strengthened by 42 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 302 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:32:04] [INFO ] Deduced a trap composed of 39 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 09:32:04] [INFO ] Deduced a trap composed of 32 places in 66 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:32:05] [INFO ] Deduced a trap composed of 15 places in 159 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:32:05] [INFO ] Deduced a trap composed of 21 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 09:32:05] [INFO ] Deduced a trap composed of 40 places in 56 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:32:05] [INFO ] Deduced a trap composed of 15 places in 136 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:32:06] [INFO ] Deduced a trap composed of 15 places in 137 ms of which 17 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/111 variables, 7/15 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/111 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 3 (OVERLAPS) 275/386 variables, 111/126 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/386 variables, 42/168 constraints. Problems are: Problem set: 0 solved, 302 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:32:11] [INFO ] Deduced a trap composed of 15 places in 140 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:32:11] [INFO ] Deduced a trap composed of 15 places in 136 ms of which 11 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/386 variables, 2/170 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/386 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 7 (OVERLAPS) 1/387 variables, 1/171 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/387 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 9 (OVERLAPS) 0/387 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 302 unsolved
No progress, stopping.
After SMT solving in domain Real declared 387/387 variables, and 171 constraints, problems are : Problem set: 0 solved, 302 unsolved in 29943 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 112/112 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 302/302 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 302 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/111 variables, 9/17 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/111 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 3 (OVERLAPS) 275/386 variables, 111/128 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/386 variables, 42/170 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/386 variables, 302/472 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/386 variables, 0/472 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 7 (OVERLAPS) 1/387 variables, 1/473 constraints. Problems are: Problem set: 0 solved, 302 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 387/387 variables, and 473 constraints, problems are : Problem set: 0 solved, 302 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 112/112 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 302/302 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60055ms problems are : Problem set: 0 solved, 302 unsolved
Search for dead transitions found 0 dead transitions in 60057ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60461 ms. Remains : 112/112 places, 304/304 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 107 edges and 112 vertex of which 29 / 112 are part of one of the 4 SCC in 1 ms
Free SCC test removed 25 places
Drop transitions (Empty/Sink Transition effects.) removed 119 transitions
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 126 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 86 transition count 177
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 86 transition count 174
Free-agglomeration rule applied 4 times with reduction of 2 identical transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 10 place count 86 transition count 168
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 15 place count 82 transition count 167
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 1 with 3 rules applied. Total rules applied 18 place count 82 transition count 167
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 82 transition count 166
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 20 place count 81 transition count 165
Iterating global reduction 1 with 1 rules applied. Total rules applied 21 place count 81 transition count 165
Applied a total of 21 rules in 28 ms. Remains 81 /112 variables (removed 31) and now considering 165/304 (removed 139) transitions.
Running SMT prover for 5 properties.
[2025-06-02 09:33:03] [INFO ] Flow matrix only has 163 transitions (discarded 2 similar events)
// Phase 1: matrix 163 rows 81 cols
[2025-06-02 09:33:03] [INFO ] Computed 8 invariants in 2 ms
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-06-02 09:33:03] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2025-06-02 09:33:03] [INFO ] After 217ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-06-02 09:33:03] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2025-06-02 09:33:03] [INFO ] After 152ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
TRAPS : Iteration 0
[2025-06-02 09:33:04] [INFO ] After 259ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
[2025-06-02 09:33:04] [INFO ] After 427ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Over-approximation ignoring read arcs solved 0 properties in 685 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p0 p3 (NOT p2) (NOT p1)), (X (X (NOT p2))), (X (X p3)), (X (X (NOT (AND (NOT p3) p2 (NOT p1))))), (X (X (NOT (AND (NOT p3) (NOT p2) p1)))), (X (X (NOT (AND (NOT p3) (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p3) p2 p1)))), (X (X (NOT p1))), (G (OR (NOT p1) (NOT p2) p3)), (G (OR (NOT p1) p2 p3))]
False Knowledge obtained : [(F (NOT (OR p1 p2 p3))), (F (NOT p3)), (F (NOT (OR p2 p3)))]
Knowledge based reduction with 10 factoid took 416 ms. Reduced automaton from 10 states, 23 edges and 4 AP (stutter sensitive) to 9 states, 16 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 464 ms :[(OR (AND (NOT p0) p2 (NOT p3)) (AND (NOT p0) (NOT p1))), (OR (NOT p1) (AND p2 (NOT p3))), (NOT p1), (AND p2 (NOT p3)), (AND p2 (NOT p3) (NOT p1)), (OR (NOT p1) (AND p2 (NOT p3))), (NOT p1), (AND p2 (NOT p3)), true]
Stuttering acceptance computed with spot in 410 ms :[(OR (AND (NOT p0) p2 (NOT p3)) (AND (NOT p0) (NOT p1))), (OR (NOT p1) (AND p2 (NOT p3))), (NOT p1), (AND p2 (NOT p3)), (AND p2 (NOT p3) (NOT p1)), (OR (NOT p1) (AND p2 (NOT p3))), (NOT p1), (AND p2 (NOT p3)), true]
Support contains 5 out of 118 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 118/118 places, 314/314 transitions.
Applied a total of 0 rules in 10 ms. Remains 118 /118 variables (removed 0) and now considering 314/314 (removed 0) transitions.
[2025-06-02 09:33:05] [INFO ] Flow matrix only has 288 transitions (discarded 26 similar events)
// Phase 1: matrix 288 rows 118 cols
[2025-06-02 09:33:05] [INFO ] Computed 8 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 09:33:05] [INFO ] Implicit Places using invariants in 175 ms returned []
[2025-06-02 09:33:05] [INFO ] Flow matrix only has 288 transitions (discarded 26 similar events)
[2025-06-02 09:33:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 09:33:05] [INFO ] State equation strengthened by 42 read => feed constraints.
[2025-06-02 09:33:06] [INFO ] Implicit Places using invariants and state equation in 378 ms returned []
Implicit Place search using SMT with State Equation took 555 ms to find 0 implicit places.
Running 313 sub problems to find dead transitions.
[2025-06-02 09:33:06] [INFO ] Flow matrix only has 288 transitions (discarded 26 similar events)
[2025-06-02 09:33:06] [INFO ] Invariant cache hit.
[2025-06-02 09:33:06] [INFO ] State equation strengthened by 42 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/117 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 1 (OVERLAPS) 1/118 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 313 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:33:10] [INFO ] Deduced a trap composed of 41 places in 135 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:33:10] [INFO ] Deduced a trap composed of 15 places in 105 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:33:10] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:33:10] [INFO ] Deduced a trap composed of 22 places in 165 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:33:11] [INFO ] Deduced a trap composed of 17 places in 163 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:33:11] [INFO ] Deduced a trap composed of 35 places in 76 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:33:11] [INFO ] Deduced a trap composed of 43 places in 68 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/118 variables, 7/15 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/118 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 4 (OVERLAPS) 287/405 variables, 118/133 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/405 variables, 41/174 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/405 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 7 (OVERLAPS) 1/406 variables, 1/175 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/406 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 9 (OVERLAPS) 0/406 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 313 unsolved
No progress, stopping.
After SMT solving in domain Real declared 406/406 variables, and 175 constraints, problems are : Problem set: 0 solved, 313 unsolved in 22123 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 118/118 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 313/313 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 313 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/117 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 1 (OVERLAPS) 1/118 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/118 variables, 7/15 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/118 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 4 (OVERLAPS) 287/405 variables, 118/133 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/405 variables, 41/174 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/405 variables, 313/487 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/405 variables, 0/487 constraints. Problems are: Problem set: 0 solved, 313 unsolved
SMT process timed out in 52277ms, After SMT, problems are : Problem set: 0 solved, 313 unsolved
Search for dead transitions found 0 dead transitions in 52280ms
Finished structural reductions in LTL mode , in 1 iterations and 52846 ms. Remains : 118/118 places, 314/314 transitions.
Computed a total of 21 stabilizing places and 43 stable transitions
Computed a total of 21 stabilizing places and 43 stable transitions
Knowledge obtained : [(AND p0 (NOT p2) p3 (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND p2 (NOT p3))))), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X p3))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 267 ms. Reduced automaton from 9 states, 16 edges and 4 AP (stutter sensitive) to 9 states, 16 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 465 ms :[(OR (AND (NOT p0) p2 (NOT p3)) (AND (NOT p0) (NOT p1))), (OR (NOT p1) (AND p2 (NOT p3))), (NOT p1), (AND p2 (NOT p3)), (AND p2 (NOT p3) (NOT p1)), (OR (NOT p1) (AND p2 (NOT p3))), (NOT p1), (AND p2 (NOT p3)), true]
RANDOM walk for 40000 steps (2181 resets) in 167 ms. (238 steps per ms) remains 4/6 properties
BEST_FIRST walk for 40004 steps (1044 resets) in 70 ms. (563 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (1078 resets) in 73 ms. (540 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (86 resets) in 70 ms. (563 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (48 resets) in 52 ms. (754 steps per ms) remains 4/4 properties
[2025-06-02 09:33:59] [INFO ] Flow matrix only has 288 transitions (discarded 26 similar events)
[2025-06-02 09:33:59] [INFO ] Invariant cache hit.
[2025-06-02 09:33:59] [INFO ] State equation strengthened by 42 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 60/65 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 50/115 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:33:59] [INFO ] Deduced a trap composed of 35 places in 58 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:33:59] [INFO ] Deduced a trap composed of 43 places in 70 ms of which 6 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/115 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/115 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 287/402 variables, 115/125 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/402 variables, 41/166 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/402 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 3/405 variables, 3/169 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/405 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 1/406 variables, 1/170 constraints. Problems are: Problem set: 0 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/406 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 0/406 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 406/406 variables, and 170 constraints, problems are : Problem set: 0 solved, 4 unsolved in 757 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 118/118 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 60/65 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 50/115 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/115 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/115 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 287/402 variables, 115/125 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/402 variables, 41/166 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/402 variables, 4/170 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/402 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 3/405 variables, 3/173 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/405 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 1/406 variables, 1/174 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/406 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 0/406 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 406/406 variables, and 174 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1209 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 118/118 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2001ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 800 ms.
Support contains 5 out of 118 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 118/118 places, 314/314 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 118 transition count 311
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 5 place count 117 transition count 310
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 11 place count 114 transition count 316
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 17 place count 114 transition count 310
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 2 with 3 rules applied. Total rules applied 20 place count 114 transition count 307
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 21 place count 114 transition count 309
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 24 place count 113 transition count 307
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 26 place count 113 transition count 305
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 27 place count 112 transition count 304
Applied a total of 27 rules in 27 ms. Remains 112 /118 variables (removed 6) and now considering 304/314 (removed 10) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27 ms. Remains : 112/118 places, 304/314 transitions.
RANDOM walk for 40000 steps (2339 resets) in 163 ms. (243 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (1128 resets) in 135 ms. (294 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (1095 resets) in 63 ms. (625 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (47 resets) in 36 ms. (1081 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (76 resets) in 56 ms. (701 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 520581 steps, run timeout after 3001 ms. (steps per millisecond=173 ) properties seen :0 out of 4
Probabilistic random walk after 520581 steps, saw 119337 distinct states, run finished after 3001 ms. (steps per millisecond=173 ) properties seen :0
[2025-06-02 09:34:05] [INFO ] Flow matrix only has 275 transitions (discarded 29 similar events)
// Phase 1: matrix 275 rows 112 cols
[2025-06-02 09:34:05] [INFO ] Computed 8 invariants in 2 ms
[2025-06-02 09:34:05] [INFO ] State equation strengthened by 42 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 57/62 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 222/284 variables, 62/64 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/284 variables, 22/86 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/284 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 93/377 variables, 42/128 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/377 variables, 3/131 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/377 variables, 20/151 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/377 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 1/378 variables, 1/152 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/378 variables, 1/153 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/378 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 9/387 variables, 7/160 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/387 variables, 2/162 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/387 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 0/387 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 387/387 variables, and 162 constraints, problems are : Problem set: 0 solved, 4 unsolved in 396 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 112/112 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 57/62 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 222/284 variables, 62/64 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/284 variables, 22/86 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/284 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 93/377 variables, 42/128 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/377 variables, 3/131 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/377 variables, 20/151 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/377 variables, 4/155 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/377 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 1/378 variables, 1/156 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/378 variables, 1/157 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/378 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 9/387 variables, 7/164 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/387 variables, 2/166 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/387 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 0/387 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 387/387 variables, and 166 constraints, problems are : Problem set: 0 solved, 4 unsolved in 946 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 112/112 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1351ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 1610 ms.
Support contains 5 out of 112 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 112/112 places, 304/304 transitions.
Applied a total of 0 rules in 5 ms. Remains 112 /112 variables (removed 0) and now considering 304/304 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 112/112 places, 304/304 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 112/112 places, 304/304 transitions.
Applied a total of 0 rules in 5 ms. Remains 112 /112 variables (removed 0) and now considering 304/304 (removed 0) transitions.
[2025-06-02 09:34:08] [INFO ] Flow matrix only has 275 transitions (discarded 29 similar events)
[2025-06-02 09:34:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 09:34:08] [INFO ] Implicit Places using invariants in 116 ms returned []
[2025-06-02 09:34:08] [INFO ] Flow matrix only has 275 transitions (discarded 29 similar events)
[2025-06-02 09:34:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 09:34:08] [INFO ] State equation strengthened by 42 read => feed constraints.
[2025-06-02 09:34:08] [INFO ] Implicit Places using invariants and state equation in 295 ms returned []
Implicit Place search using SMT with State Equation took 418 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 09:34:08] [INFO ] Redundant transitions in 4 ms returned []
Running 302 sub problems to find dead transitions.
[2025-06-02 09:34:08] [INFO ] Flow matrix only has 275 transitions (discarded 29 similar events)
[2025-06-02 09:34:08] [INFO ] Invariant cache hit.
[2025-06-02 09:34:08] [INFO ] State equation strengthened by 42 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 302 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:34:10] [INFO ] Deduced a trap composed of 39 places in 202 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:34:10] [INFO ] Deduced a trap composed of 32 places in 89 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:34:10] [INFO ] Deduced a trap composed of 15 places in 182 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:34:11] [INFO ] Deduced a trap composed of 21 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 09:34:11] [INFO ] Deduced a trap composed of 40 places in 50 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:34:11] [INFO ] Deduced a trap composed of 15 places in 190 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:34:12] [INFO ] Deduced a trap composed of 15 places in 86 ms of which 11 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/111 variables, 7/15 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/111 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 3 (OVERLAPS) 275/386 variables, 111/126 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/386 variables, 42/168 constraints. Problems are: Problem set: 0 solved, 302 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:34:18] [INFO ] Deduced a trap composed of 15 places in 95 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:34:18] [INFO ] Deduced a trap composed of 15 places in 96 ms of which 6 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/386 variables, 2/170 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/386 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 7 (OVERLAPS) 1/387 variables, 1/171 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/387 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 302 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 9 (OVERLAPS) 0/387 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 302 unsolved
No progress, stopping.
After SMT solving in domain Real declared 387/387 variables, and 171 constraints, problems are : Problem set: 0 solved, 302 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 112/112 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 302/302 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 302 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/111 variables, 9/17 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/111 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 3 (OVERLAPS) 275/386 variables, 111/128 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/386 variables, 42/170 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/386 variables, 302/472 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/386 variables, 0/472 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 7 (OVERLAPS) 1/387 variables, 1/473 constraints. Problems are: Problem set: 0 solved, 302 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 387/387 variables, and 473 constraints, problems are : Problem set: 0 solved, 302 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 112/112 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 302/302 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60184ms problems are : Problem set: 0 solved, 302 unsolved
Search for dead transitions found 0 dead transitions in 60186ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60621 ms. Remains : 112/112 places, 304/304 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 107 edges and 112 vertex of which 29 / 112 are part of one of the 4 SCC in 0 ms
Free SCC test removed 25 places
Drop transitions (Empty/Sink Transition effects.) removed 119 transitions
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 126 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 86 transition count 177
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 86 transition count 174
Free-agglomeration rule applied 4 times with reduction of 2 identical transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 10 place count 86 transition count 168
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 15 place count 82 transition count 167
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 1 with 3 rules applied. Total rules applied 18 place count 82 transition count 167
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 82 transition count 166
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 20 place count 81 transition count 165
Iterating global reduction 1 with 1 rules applied. Total rules applied 21 place count 81 transition count 165
Applied a total of 21 rules in 16 ms. Remains 81 /112 variables (removed 31) and now considering 165/304 (removed 139) transitions.
Running SMT prover for 4 properties.
[2025-06-02 09:35:08] [INFO ] Flow matrix only has 163 transitions (discarded 2 similar events)
// Phase 1: matrix 163 rows 81 cols
[2025-06-02 09:35:08] [INFO ] Computed 8 invariants in 2 ms
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-06-02 09:35:08] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2025-06-02 09:35:09] [INFO ] After 214ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-06-02 09:35:09] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2025-06-02 09:35:09] [INFO ] After 188ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
TRAPS : Iteration 0
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:35:09] [INFO ] Deduced a trap composed of 21 places in 62 ms of which 4 ms to minimize.
[2025-06-02 09:35:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 83 ms
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:35:09] [INFO ] Deduced a trap composed of 7 places in 36 ms of which 2 ms to minimize.
[2025-06-02 09:35:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 54 ms
TRAPS : Iteration 1
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:35:09] [INFO ] Deduced a trap composed of 7 places in 45 ms of which 3 ms to minimize.
[2025-06-02 09:35:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 62 ms
TRAPS : Iteration 2
[2025-06-02 09:35:09] [INFO ] After 614ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
[2025-06-02 09:35:09] [INFO ] After 754ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Over-approximation ignoring read arcs solved 0 properties in 995 ms.
Knowledge obtained : [(AND p0 (NOT p2) p3 (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND p2 (NOT p3))))), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X p3))]
False Knowledge obtained : [(F (NOT (OR p2 p3))), (F (NOT p3))]
Knowledge based reduction with 5 factoid took 277 ms. Reduced automaton from 9 states, 16 edges and 4 AP (stutter sensitive) to 9 states, 16 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 409 ms :[(OR (AND (NOT p0) p2 (NOT p3)) (AND (NOT p0) (NOT p1))), (OR (NOT p1) (AND p2 (NOT p3))), (NOT p1), (AND p2 (NOT p3)), (AND p2 (NOT p3) (NOT p1)), (OR (NOT p1) (AND p2 (NOT p3))), (NOT p1), (AND p2 (NOT p3)), true]
Stuttering acceptance computed with spot in 434 ms :[(OR (AND (NOT p0) p2 (NOT p3)) (AND (NOT p0) (NOT p1))), (OR (NOT p1) (AND p2 (NOT p3))), (NOT p1), (AND p2 (NOT p3)), (AND p2 (NOT p3) (NOT p1)), (OR (NOT p1) (AND p2 (NOT p3))), (NOT p1), (AND p2 (NOT p3)), true]
Stuttering acceptance computed with spot in 469 ms :[(OR (AND (NOT p0) p2 (NOT p3)) (AND (NOT p0) (NOT p1))), (OR (NOT p1) (AND p2 (NOT p3))), (NOT p1), (AND p2 (NOT p3)), (AND p2 (NOT p3) (NOT p1)), (OR (NOT p1) (AND p2 (NOT p3))), (NOT p1), (AND p2 (NOT p3)), true]
Product exploration explored 100000 steps with 0 reset in 119 ms.
Product exploration explored 100000 steps with 1 reset in 228 ms.
Applying partial POR strategy [false, false, false, false, true, false, true, true, true]
Stuttering acceptance computed with spot in 332 ms :[(OR (AND (NOT p0) p2 (NOT p3)) (AND (NOT p0) (NOT p1))), (OR (NOT p1) (AND p2 (NOT p3))), (NOT p1), (AND p2 (NOT p3)), (AND p2 (NOT p3) (NOT p1)), (OR (NOT p1) (AND p2 (NOT p3))), (NOT p1), (AND p2 (NOT p3)), true]
Support contains 5 out of 118 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 118/118 places, 314/314 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 1 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 118 transition count 314
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -12
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 0 with 3 rules applied. Total rules applied 4 place count 118 transition count 326
Deduced a syphon composed of 4 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 0 with 6 rules applied. Total rules applied 10 place count 118 transition count 320
Deduced a syphon composed of 4 places in 0 ms
Applied a total of 10 rules in 24 ms. Remains 118 /118 variables (removed 0) and now considering 320/314 (removed -6) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 09:35:12] [INFO ] Redundant transitions in 2 ms returned []
Running 319 sub problems to find dead transitions.
[2025-06-02 09:35:12] [INFO ] Flow matrix only has 287 transitions (discarded 33 similar events)
// Phase 1: matrix 287 rows 118 cols
[2025-06-02 09:35:12] [INFO ] Computed 8 invariants in 1 ms
[2025-06-02 09:35:12] [INFO ] State equation strengthened by 44 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/117 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 1 (OVERLAPS) 1/118 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 319 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:35:16] [INFO ] Deduced a trap composed of 34 places in 52 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:35:16] [INFO ] Deduced a trap composed of 42 places in 68 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:35:16] [INFO ] Deduced a trap composed of 52 places in 53 ms of which 4 ms to minimize.
Problem TDEAD2 is UNSAT
Problem TDEAD3 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:35:17] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 2 ms to minimize.
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:35:17] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 2 ms to minimize.
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:35:17] [INFO ] Deduced a trap composed of 41 places in 166 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:35:17] [INFO ] Deduced a trap composed of 16 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 09:35:17] [INFO ] Deduced a trap composed of 15 places in 158 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:35:17] [INFO ] Deduced a trap composed of 22 places in 173 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:35:18] [INFO ] Deduced a trap composed of 16 places in 159 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:35:19] [INFO ] Deduced a trap composed of 5 places in 49 ms of which 4 ms to minimize.
Problem TDEAD299 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/118 variables, 11/19 constraints. Problems are: Problem set: 7 solved, 312 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/118 variables, 0/19 constraints. Problems are: Problem set: 7 solved, 312 unsolved
At refinement iteration 4 (OVERLAPS) 286/404 variables, 118/137 constraints. Problems are: Problem set: 7 solved, 312 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/404 variables, 43/180 constraints. Problems are: Problem set: 7 solved, 312 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/404 variables, 0/180 constraints. Problems are: Problem set: 7 solved, 312 unsolved
At refinement iteration 7 (OVERLAPS) 1/405 variables, 1/181 constraints. Problems are: Problem set: 7 solved, 312 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/405 variables, 0/181 constraints. Problems are: Problem set: 7 solved, 312 unsolved
At refinement iteration 9 (OVERLAPS) 0/405 variables, 0/181 constraints. Problems are: Problem set: 7 solved, 312 unsolved
No progress, stopping.
After SMT solving in domain Real declared 405/405 variables, and 181 constraints, problems are : Problem set: 7 solved, 312 unsolved in 25845 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 118/118 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 319/319 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 7 solved, 312 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/113 variables, 0/0 constraints. Problems are: Problem set: 7 solved, 312 unsolved
At refinement iteration 1 (OVERLAPS) 5/118 variables, 8/8 constraints. Problems are: Problem set: 7 solved, 312 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/118 variables, 11/19 constraints. Problems are: Problem set: 7 solved, 312 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/118 variables, 0/19 constraints. Problems are: Problem set: 7 solved, 312 unsolved
At refinement iteration 4 (OVERLAPS) 286/404 variables, 118/137 constraints. Problems are: Problem set: 7 solved, 312 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/404 variables, 43/180 constraints. Problems are: Problem set: 7 solved, 312 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/404 variables, 312/492 constraints. Problems are: Problem set: 7 solved, 312 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 404/405 variables, and 492 constraints, problems are : Problem set: 7 solved, 312 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 118/118 constraints, ReadFeed: 43/44 constraints, PredecessorRefiner: 312/319 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 55951ms problems are : Problem set: 7 solved, 312 unsolved
Search for dead transitions found 7 dead transitions in 55952ms
Found 7 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 7 transitions
Dead transitions reduction (with SMT) removed 7 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 118/118 places, 313/314 transitions.
Graph (complete) has 622 edges and 118 vertex of which 114 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.3 ms
Discarding 4 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 14 ms. Remains 114 /118 variables (removed 4) and now considering 313/313 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 114/118 places, 313/314 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 56000 ms. Remains : 114/118 places, 313/314 transitions.
Built C files in :
/tmp/ltsmin10633558138929414476
[2025-06-02 09:36:08] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10633558138929414476
Running compilation step : cd /tmp/ltsmin10633558138929414476;'/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 1100 ms.
Running link step : cd /tmp/ltsmin10633558138929414476;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 44 ms.
Running LTSmin : cd /tmp/ltsmin10633558138929414476;'/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/stateBased8768759955199238197.hoa' '--buchi-type=spotba'
LTSmin run took 7819 ms.
FORMULA FireWire-PT-08-LTLFireability-07 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property FireWire-PT-08-LTLFireability-07 finished in 322956 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((G(p0)||F(p1)))))'
Support contains 4 out of 124 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 124/124 places, 330/330 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 120 transition count 319
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 120 transition count 319
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 9 place count 120 transition count 318
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 11 place count 118 transition count 314
Iterating global reduction 1 with 2 rules applied. Total rules applied 13 place count 118 transition count 314
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 14 place count 117 transition count 311
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 117 transition count 311
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 16 place count 116 transition count 309
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 116 transition count 309
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 18 place count 115 transition count 306
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 115 transition count 306
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 20 place count 114 transition count 304
Iterating global reduction 1 with 1 rules applied. Total rules applied 21 place count 114 transition count 304
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 22 place count 113 transition count 301
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 113 transition count 301
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 112 transition count 299
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 112 transition count 299
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 26 place count 111 transition count 296
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 111 transition count 296
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 28 place count 110 transition count 294
Iterating global reduction 1 with 1 rules applied. Total rules applied 29 place count 110 transition count 294
Applied a total of 29 rules in 26 ms. Remains 110 /124 variables (removed 14) and now considering 294/330 (removed 36) transitions.
[2025-06-02 09:36:17] [INFO ] Flow matrix only has 268 transitions (discarded 26 similar events)
// Phase 1: matrix 268 rows 110 cols
[2025-06-02 09:36:17] [INFO ] Computed 8 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 09:36:17] [INFO ] Implicit Places using invariants in 139 ms returned []
[2025-06-02 09:36:17] [INFO ] Flow matrix only has 268 transitions (discarded 26 similar events)
[2025-06-02 09:36:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 09:36:17] [INFO ] State equation strengthened by 38 read => feed constraints.
[2025-06-02 09:36:18] [INFO ] Implicit Places using invariants and state equation in 331 ms returned []
Implicit Place search using SMT with State Equation took 472 ms to find 0 implicit places.
Running 293 sub problems to find dead transitions.
[2025-06-02 09:36:18] [INFO ] Flow matrix only has 268 transitions (discarded 26 similar events)
[2025-06-02 09:36:18] [INFO ] Invariant cache hit.
[2025-06-02 09:36:18] [INFO ] State equation strengthened by 38 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/109 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 1 (OVERLAPS) 1/110 variables, 8/8 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 09:36:21] [INFO ] Deduced a trap composed of 36 places in 103 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:36:21] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:36:21] [INFO ] Deduced a trap composed of 15 places in 126 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:36:21] [INFO ] Deduced a trap composed of 22 places in 154 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:36:21] [INFO ] Deduced a trap composed of 35 places in 70 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:36:21] [INFO ] Deduced a trap composed of 43 places in 71 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:36:22] [INFO ] Deduced a trap composed of 17 places in 99 ms of which 11 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/110 variables, 7/15 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/110 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 4 (OVERLAPS) 267/377 variables, 110/125 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/377 variables, 37/162 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 09:36:29] [INFO ] Deduced a trap composed of 22 places in 88 ms of which 11 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/377 variables, 1/163 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/377 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 8 (OVERLAPS) 1/378 variables, 1/164 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/378 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 10 (OVERLAPS) 0/378 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 293 unsolved
No progress, stopping.
After SMT solving in domain Real declared 378/378 variables, and 164 constraints, problems are : Problem set: 0 solved, 293 unsolved in 21378 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 110/110 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 293/293 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 293 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/109 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 1 (OVERLAPS) 1/110 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/110 variables, 8/16 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/110 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 4 (OVERLAPS) 267/377 variables, 110/126 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/377 variables, 37/163 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/377 variables, 293/456 constraints. Problems are: Problem set: 0 solved, 293 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 377/378 variables, and 456 constraints, problems are : Problem set: 0 solved, 293 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 110/110 constraints, ReadFeed: 37/38 constraints, PredecessorRefiner: 293/293 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 51532ms problems are : Problem set: 0 solved, 293 unsolved
Search for dead transitions found 0 dead transitions in 51536ms
Starting structural reductions in LTL mode, iteration 1 : 110/124 places, 294/330 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 52036 ms. Remains : 110/124 places, 294/330 transitions.
Stuttering acceptance computed with spot in 163 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : FireWire-PT-08-LTLFireability-08
Product exploration explored 100000 steps with 33333 reset in 152 ms.
Product exploration explored 100000 steps with 33333 reset in 140 ms.
Computed a total of 12 stabilizing places and 21 stable transitions
Computed a total of 12 stabilizing places and 21 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 5 factoid took 21 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FireWire-PT-08-LTLFireability-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FireWire-PT-08-LTLFireability-08 finished in 52542 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) U p1))&&(G(p3)||p2))))'
Support contains 6 out of 124 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 124/124 places, 330/330 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 121 transition count 322
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 121 transition count 322
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 7 place count 121 transition count 321
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 9 place count 119 transition count 317
Iterating global reduction 1 with 2 rules applied. Total rules applied 11 place count 119 transition count 317
Applied a total of 11 rules in 9 ms. Remains 119 /124 variables (removed 5) and now considering 317/330 (removed 13) transitions.
[2025-06-02 09:37:10] [INFO ] Flow matrix only has 291 transitions (discarded 26 similar events)
// Phase 1: matrix 291 rows 119 cols
[2025-06-02 09:37:10] [INFO ] Computed 8 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 09:37:10] [INFO ] Implicit Places using invariants in 149 ms returned []
[2025-06-02 09:37:10] [INFO ] Flow matrix only has 291 transitions (discarded 26 similar events)
[2025-06-02 09:37:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 09:37:10] [INFO ] State equation strengthened by 43 read => feed constraints.
[2025-06-02 09:37:10] [INFO ] Implicit Places using invariants and state equation in 528 ms returned []
Implicit Place search using SMT with State Equation took 680 ms to find 0 implicit places.
Running 316 sub problems to find dead transitions.
[2025-06-02 09:37:10] [INFO ] Flow matrix only has 291 transitions (discarded 26 similar events)
[2025-06-02 09:37:10] [INFO ] Invariant cache hit.
[2025-06-02 09:37:10] [INFO ] State equation strengthened by 43 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/118 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 1 (OVERLAPS) 1/119 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 316 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:37:15] [INFO ] Deduced a trap composed of 41 places in 132 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:37:15] [INFO ] Deduced a trap composed of 15 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 09:37:15] [INFO ] Deduced a trap composed of 35 places in 54 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:37:15] [INFO ] Deduced a trap composed of 43 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 09:37:15] [INFO ] Deduced a trap composed of 22 places in 120 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:37:16] [INFO ] Deduced a trap composed of 17 places in 100 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:37:16] [INFO ] Deduced a trap composed of 17 places in 163 ms of which 20 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/119 variables, 7/15 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/119 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 4 (OVERLAPS) 290/409 variables, 119/134 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/409 variables, 42/176 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/409 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 7 (OVERLAPS) 1/410 variables, 1/177 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/410 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 9 (OVERLAPS) 0/410 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 316 unsolved
No progress, stopping.
After SMT solving in domain Real declared 410/410 variables, and 177 constraints, problems are : Problem set: 0 solved, 316 unsolved in 25235 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 119/119 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 316/316 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 316 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/118 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 1 (OVERLAPS) 1/119 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/119 variables, 7/15 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/119 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 4 (OVERLAPS) 290/409 variables, 119/134 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/409 variables, 42/176 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/409 variables, 316/492 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/409 variables, 0/492 constraints. Problems are: Problem set: 0 solved, 316 unsolved
SMT process timed out in 55361ms, After SMT, problems are : Problem set: 0 solved, 316 unsolved
Search for dead transitions found 0 dead transitions in 55363ms
Starting structural reductions in LTL mode, iteration 1 : 119/124 places, 317/330 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 56055 ms. Remains : 119/124 places, 317/330 transitions.
Stuttering acceptance computed with spot in 259 ms :[(OR (NOT p1) (AND (NOT p2) (NOT p3))), (OR (NOT p1) (AND (NOT p2) (NOT p3))), true, (NOT p1), (NOT p3), (NOT p0)]
Running random walk in product with property : FireWire-PT-08-LTLFireability-09
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA FireWire-PT-08-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-08-LTLFireability-09 finished in 56348 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((X(p0)||G(p1)))))'
Support contains 3 out of 124 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 124/124 places, 330/330 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 120 transition count 319
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 120 transition count 319
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 9 place count 120 transition count 318
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 12 place count 117 transition count 312
Iterating global reduction 1 with 3 rules applied. Total rules applied 15 place count 117 transition count 312
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 16 place count 116 transition count 309
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 116 transition count 309
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 18 place count 115 transition count 307
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 115 transition count 307
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 20 place count 114 transition count 304
Iterating global reduction 1 with 1 rules applied. Total rules applied 21 place count 114 transition count 304
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 22 place count 113 transition count 302
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 113 transition count 302
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 112 transition count 299
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 112 transition count 299
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 26 place count 111 transition count 297
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 111 transition count 297
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 28 place count 110 transition count 294
Iterating global reduction 1 with 1 rules applied. Total rules applied 29 place count 110 transition count 294
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 30 place count 109 transition count 292
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 109 transition count 292
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 32 place count 108 transition count 290
Iterating global reduction 1 with 1 rules applied. Total rules applied 33 place count 108 transition count 290
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 34 place count 107 transition count 288
Iterating global reduction 1 with 1 rules applied. Total rules applied 35 place count 107 transition count 288
Applied a total of 35 rules in 33 ms. Remains 107 /124 variables (removed 17) and now considering 288/330 (removed 42) transitions.
[2025-06-02 09:38:06] [INFO ] Flow matrix only has 262 transitions (discarded 26 similar events)
// Phase 1: matrix 262 rows 107 cols
[2025-06-02 09:38:06] [INFO ] Computed 8 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 09:38:06] [INFO ] Implicit Places using invariants in 142 ms returned []
[2025-06-02 09:38:06] [INFO ] Flow matrix only has 262 transitions (discarded 26 similar events)
[2025-06-02 09:38:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 09:38:06] [INFO ] State equation strengthened by 38 read => feed constraints.
[2025-06-02 09:38:07] [INFO ] Implicit Places using invariants and state equation in 366 ms returned []
Implicit Place search using SMT with State Equation took 510 ms to find 0 implicit places.
Running 287 sub problems to find dead transitions.
[2025-06-02 09:38:07] [INFO ] Flow matrix only has 262 transitions (discarded 26 similar events)
[2025-06-02 09:38:07] [INFO ] Invariant cache hit.
[2025-06-02 09:38:07] [INFO ] State equation strengthened by 38 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 1 (OVERLAPS) 1/107 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 287 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:38:10] [INFO ] Deduced a trap composed of 36 places in 126 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:38:10] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:38:10] [INFO ] Deduced a trap composed of 15 places in 110 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:38:11] [INFO ] Deduced a trap composed of 22 places in 118 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:38:11] [INFO ] Deduced a trap composed of 35 places in 53 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:38:12] [INFO ] Deduced a trap composed of 17 places in 106 ms of which 12 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/107 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 4 (OVERLAPS) 261/368 variables, 107/121 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/368 variables, 37/158 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/368 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 7 (OVERLAPS) 1/369 variables, 1/159 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/369 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 9 (OVERLAPS) 0/369 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 287 unsolved
No progress, stopping.
After SMT solving in domain Real declared 369/369 variables, and 159 constraints, problems are : Problem set: 0 solved, 287 unsolved in 25466 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 107/107 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 287/287 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 287 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 1 (OVERLAPS) 1/107 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/107 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 4 (OVERLAPS) 261/368 variables, 107/121 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/368 variables, 37/158 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/368 variables, 287/445 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/368 variables, 0/445 constraints. Problems are: Problem set: 0 solved, 287 unsolved
SMT process timed out in 55552ms, After SMT, problems are : Problem set: 0 solved, 287 unsolved
Search for dead transitions found 0 dead transitions in 55553ms
Starting structural reductions in LTL mode, iteration 1 : 107/124 places, 288/330 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 56098 ms. Remains : 107/124 places, 288/330 transitions.
Stuttering acceptance computed with spot in 264 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : FireWire-PT-08-LTLFireability-10
Product exploration explored 100000 steps with 0 reset in 66 ms.
Product exploration explored 100000 steps with 0 reset in 63 ms.
Computed a total of 10 stabilizing places and 17 stable transitions
Computed a total of 10 stabilizing places and 17 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X p1), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 p0)))), (X (X (AND p1 (NOT p0)))), (X (X p1))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 8 factoid took 126 ms. Reduced automaton from 6 states, 13 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 54 ms :[true, (NOT p1)]
RANDOM walk for 5388 steps (296 resets) in 12 ms. (414 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p0) p1), (X p1), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 p0)))), (X (X (AND p1 (NOT p0)))), (X (X p1))]
False Knowledge obtained : [(F (NOT p1))]
Property proved to be false thanks to negative knowledge :(F (NOT p1))
Knowledge based reduction with 8 factoid took 172 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA FireWire-PT-08-LTLFireability-10 FALSE TECHNIQUES KNOWLEDGE
Treatment of property FireWire-PT-08-LTLFireability-10 finished in 56892 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((F(p1)&&p0))))'
Support contains 3 out of 124 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 124/124 places, 330/330 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 122 transition count 325
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 122 transition count 325
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 5 place count 122 transition count 324
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 121 transition count 322
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 121 transition count 322
Applied a total of 7 rules in 6 ms. Remains 121 /124 variables (removed 3) and now considering 322/330 (removed 8) transitions.
[2025-06-02 09:39:03] [INFO ] Flow matrix only has 296 transitions (discarded 26 similar events)
// Phase 1: matrix 296 rows 121 cols
[2025-06-02 09:39:03] [INFO ] Computed 8 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 09:39:03] [INFO ] Implicit Places using invariants in 106 ms returned []
[2025-06-02 09:39:03] [INFO ] Flow matrix only has 296 transitions (discarded 26 similar events)
[2025-06-02 09:39:03] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 09:39:03] [INFO ] State equation strengthened by 44 read => feed constraints.
[2025-06-02 09:39:03] [INFO ] Implicit Places using invariants and state equation in 305 ms returned []
Implicit Place search using SMT with State Equation took 413 ms to find 0 implicit places.
Running 321 sub problems to find dead transitions.
[2025-06-02 09:39:03] [INFO ] Flow matrix only has 296 transitions (discarded 26 similar events)
[2025-06-02 09:39:03] [INFO ] Invariant cache hit.
[2025-06-02 09:39:03] [INFO ] State equation strengthened by 44 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/120 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 1 (OVERLAPS) 1/121 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 321 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:39:08] [INFO ] Deduced a trap composed of 41 places in 147 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:39:08] [INFO ] Deduced a trap composed of 35 places in 70 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:39:08] [INFO ] Deduced a trap composed of 15 places in 152 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:39:08] [INFO ] Deduced a trap composed of 43 places in 75 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:39:09] [INFO ] Deduced a trap composed of 17 places in 52 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:39:09] [INFO ] Deduced a trap composed of 17 places in 162 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:39:10] [INFO ] Deduced a trap composed of 22 places in 168 ms of which 15 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/121 variables, 7/15 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/121 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 4 (OVERLAPS) 295/416 variables, 121/136 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/416 variables, 43/179 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/416 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 7 (OVERLAPS) 1/417 variables, 1/180 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/417 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 9 (OVERLAPS) 0/417 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 321 unsolved
No progress, stopping.
After SMT solving in domain Real declared 417/417 variables, and 180 constraints, problems are : Problem set: 0 solved, 321 unsolved in 26193 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 121/121 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 321/321 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 321 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/120 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 1 (OVERLAPS) 1/121 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/121 variables, 7/15 constraints. Problems are: Problem set: 0 solved, 321 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:39:33] [INFO ] Deduced a trap composed of 22 places in 121 ms of which 19 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/121 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/121 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 5 (OVERLAPS) 295/416 variables, 121/137 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/416 variables, 43/180 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/416 variables, 321/501 constraints. Problems are: Problem set: 0 solved, 321 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 416/417 variables, and 501 constraints, problems are : Problem set: 0 solved, 321 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 121/121 constraints, ReadFeed: 43/44 constraints, PredecessorRefiner: 321/321 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 56299ms problems are : Problem set: 0 solved, 321 unsolved
Search for dead transitions found 0 dead transitions in 56301ms
Starting structural reductions in LTL mode, iteration 1 : 121/124 places, 322/330 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 56720 ms. Remains : 121/124 places, 322/330 transitions.
Stuttering acceptance computed with spot in 149 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : FireWire-PT-08-LTLFireability-11
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA FireWire-PT-08-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-08-LTLFireability-11 finished in 56888 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(G(p0))&&(G(!p1) U G(p2))))'
Support contains 6 out of 124 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 124/124 places, 330/330 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 120 transition count 319
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 120 transition count 319
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 9 place count 120 transition count 318
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 12 place count 117 transition count 312
Iterating global reduction 1 with 3 rules applied. Total rules applied 15 place count 117 transition count 312
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 16 place count 116 transition count 309
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 116 transition count 309
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 18 place count 115 transition count 307
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 115 transition count 307
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 20 place count 114 transition count 304
Iterating global reduction 1 with 1 rules applied. Total rules applied 21 place count 114 transition count 304
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 22 place count 113 transition count 302
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 113 transition count 302
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 112 transition count 299
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 112 transition count 299
Applied a total of 25 rules in 10 ms. Remains 112 /124 variables (removed 12) and now considering 299/330 (removed 31) transitions.
[2025-06-02 09:40:00] [INFO ] Flow matrix only has 273 transitions (discarded 26 similar events)
// Phase 1: matrix 273 rows 112 cols
[2025-06-02 09:40:00] [INFO ] Computed 8 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 09:40:00] [INFO ] Implicit Places using invariants in 128 ms returned []
[2025-06-02 09:40:00] [INFO ] Flow matrix only has 273 transitions (discarded 26 similar events)
[2025-06-02 09:40:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 09:40:00] [INFO ] State equation strengthened by 39 read => feed constraints.
[2025-06-02 09:40:00] [INFO ] Implicit Places using invariants and state equation in 288 ms returned []
Implicit Place search using SMT with State Equation took 418 ms to find 0 implicit places.
Running 298 sub problems to find dead transitions.
[2025-06-02 09:40:00] [INFO ] Flow matrix only has 273 transitions (discarded 26 similar events)
[2025-06-02 09:40:00] [INFO ] Invariant cache hit.
[2025-06-02 09:40:00] [INFO ] State equation strengthened by 39 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 1 (OVERLAPS) 1/112 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 298 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:40:04] [INFO ] Deduced a trap composed of 38 places in 177 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:40:04] [INFO ] Deduced a trap composed of 15 places in 171 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:40:04] [INFO ] Deduced a trap composed of 35 places in 54 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:40:04] [INFO ] Deduced a trap composed of 43 places in 70 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:40:05] [INFO ] Deduced a trap composed of 17 places in 51 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:40:05] [INFO ] Deduced a trap composed of 17 places in 149 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:40:06] [INFO ] Deduced a trap composed of 22 places in 103 ms of which 12 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 7/15 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/112 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 4 (OVERLAPS) 272/384 variables, 112/127 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/384 variables, 38/165 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/384 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 7 (OVERLAPS) 1/385 variables, 1/166 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/385 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 9 (OVERLAPS) 0/385 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 298 unsolved
No progress, stopping.
After SMT solving in domain Real declared 385/385 variables, and 166 constraints, problems are : Problem set: 0 solved, 298 unsolved in 22650 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 112/112 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 298/298 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 298 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 1 (OVERLAPS) 1/112 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 7/15 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/112 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 4 (OVERLAPS) 272/384 variables, 112/127 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/384 variables, 38/165 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/384 variables, 298/463 constraints. Problems are: Problem set: 0 solved, 298 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 384/385 variables, and 463 constraints, problems are : Problem set: 0 solved, 298 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 112/112 constraints, ReadFeed: 38/39 constraints, PredecessorRefiner: 298/298 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 52774ms problems are : Problem set: 0 solved, 298 unsolved
Search for dead transitions found 0 dead transitions in 52775ms
Starting structural reductions in LTL mode, iteration 1 : 112/124 places, 299/330 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 53209 ms. Remains : 112/124 places, 299/330 transitions.
Stuttering acceptance computed with spot in 347 ms :[(OR (NOT p0) (NOT p2)), true, (NOT p0), (AND p2 p1), (NOT p2), (NOT p2)]
Running random walk in product with property : FireWire-PT-08-LTLFireability-12
Stuttering criterion allowed to conclude after 3 steps with 1 reset in 0 ms.
FORMULA FireWire-PT-08-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-08-LTLFireability-12 finished in 53576 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(p0)||G(p1))))'
Support contains 4 out of 124 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 124/124 places, 330/330 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 121 transition count 322
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 121 transition count 322
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 7 place count 121 transition count 321
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 9 place count 119 transition count 317
Iterating global reduction 1 with 2 rules applied. Total rules applied 11 place count 119 transition count 317
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 12 place count 118 transition count 314
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 118 transition count 314
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 14 place count 117 transition count 312
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 117 transition count 312
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 16 place count 116 transition count 309
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 116 transition count 309
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 18 place count 115 transition count 307
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 115 transition count 307
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 20 place count 114 transition count 304
Iterating global reduction 1 with 1 rules applied. Total rules applied 21 place count 114 transition count 304
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 22 place count 113 transition count 302
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 113 transition count 302
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 112 transition count 299
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 112 transition count 299
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 26 place count 111 transition count 297
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 111 transition count 297
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 28 place count 110 transition count 295
Iterating global reduction 1 with 1 rules applied. Total rules applied 29 place count 110 transition count 295
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 30 place count 109 transition count 293
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 109 transition count 293
Applied a total of 31 rules in 31 ms. Remains 109 /124 variables (removed 15) and now considering 293/330 (removed 37) transitions.
[2025-06-02 09:40:53] [INFO ] Flow matrix only has 267 transitions (discarded 26 similar events)
// Phase 1: matrix 267 rows 109 cols
[2025-06-02 09:40:53] [INFO ] Computed 8 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 09:40:54] [INFO ] Implicit Places using invariants in 278 ms returned []
[2025-06-02 09:40:54] [INFO ] Flow matrix only has 267 transitions (discarded 26 similar events)
[2025-06-02 09:40:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 09:40:54] [INFO ] State equation strengthened by 39 read => feed constraints.
[2025-06-02 09:40:54] [INFO ] Implicit Places using invariants and state equation in 412 ms returned []
Implicit Place search using SMT with State Equation took 705 ms to find 0 implicit places.
Running 292 sub problems to find dead transitions.
[2025-06-02 09:40:54] [INFO ] Flow matrix only has 267 transitions (discarded 26 similar events)
[2025-06-02 09:40:54] [INFO ] Invariant cache hit.
[2025-06-02 09:40:54] [INFO ] State equation strengthened by 39 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 1 (OVERLAPS) 1/109 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 292 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:40:58] [INFO ] Deduced a trap composed of 36 places in 112 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:40:58] [INFO ] Deduced a trap composed of 35 places in 65 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:40:58] [INFO ] Deduced a trap composed of 15 places in 143 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:40:58] [INFO ] Deduced a trap composed of 17 places in 47 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:40:59] [INFO ] Deduced a trap composed of 22 places in 144 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:40:59] [INFO ] Deduced a trap composed of 17 places in 121 ms of which 16 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/109 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/109 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 4 (OVERLAPS) 266/375 variables, 109/123 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/375 variables, 38/161 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/375 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 7 (OVERLAPS) 1/376 variables, 1/162 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/376 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 9 (OVERLAPS) 0/376 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 292 unsolved
No progress, stopping.
After SMT solving in domain Real declared 376/376 variables, and 162 constraints, problems are : Problem set: 0 solved, 292 unsolved in 23469 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 109/109 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 292/292 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 292 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 1 (OVERLAPS) 1/109 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/109 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/109 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 4 (OVERLAPS) 266/375 variables, 109/123 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/375 variables, 38/161 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/375 variables, 292/453 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/375 variables, 0/453 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 8 (OVERLAPS) 1/376 variables, 1/454 constraints. Problems are: Problem set: 0 solved, 292 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 376/376 variables, and 454 constraints, problems are : Problem set: 0 solved, 292 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 109/109 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 292/292 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 53563ms problems are : Problem set: 0 solved, 292 unsolved
Search for dead transitions found 0 dead transitions in 53564ms
Starting structural reductions in LTL mode, iteration 1 : 109/124 places, 293/330 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 54301 ms. Remains : 109/124 places, 293/330 transitions.
Stuttering acceptance computed with spot in 255 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : FireWire-PT-08-LTLFireability-13
Product exploration explored 100000 steps with 33333 reset in 137 ms.
Product exploration explored 100000 steps with 33333 reset in 148 ms.
Computed a total of 10 stabilizing places and 17 stable transitions
Computed a total of 10 stabilizing places and 17 stable transitions
Knowledge obtained : [(AND p0 p1), (X p1), (X (X p0)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 6 factoid took 19 ms. Reduced automaton from 6 states, 9 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FireWire-PT-08-LTLFireability-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FireWire-PT-08-LTLFireability-13 finished in 54884 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((F(p0)&&X((F(p2)&&p1)))))'
Support contains 8 out of 124 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 124/124 places, 330/330 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 120 transition count 319
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 120 transition count 319
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 9 place count 120 transition count 318
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 12 place count 117 transition count 312
Iterating global reduction 1 with 3 rules applied. Total rules applied 15 place count 117 transition count 312
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 16 place count 116 transition count 309
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 116 transition count 309
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 18 place count 115 transition count 307
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 115 transition count 307
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 20 place count 114 transition count 304
Iterating global reduction 1 with 1 rules applied. Total rules applied 21 place count 114 transition count 304
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 22 place count 113 transition count 302
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 113 transition count 302
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 112 transition count 299
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 112 transition count 299
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 26 place count 111 transition count 297
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 111 transition count 297
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 28 place count 110 transition count 294
Iterating global reduction 1 with 1 rules applied. Total rules applied 29 place count 110 transition count 294
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 30 place count 109 transition count 292
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 109 transition count 292
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 32 place count 108 transition count 290
Iterating global reduction 1 with 1 rules applied. Total rules applied 33 place count 108 transition count 290
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 34 place count 107 transition count 288
Iterating global reduction 1 with 1 rules applied. Total rules applied 35 place count 107 transition count 288
Applied a total of 35 rules in 10 ms. Remains 107 /124 variables (removed 17) and now considering 288/330 (removed 42) transitions.
[2025-06-02 09:41:48] [INFO ] Flow matrix only has 262 transitions (discarded 26 similar events)
// Phase 1: matrix 262 rows 107 cols
[2025-06-02 09:41:48] [INFO ] Computed 8 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 09:41:48] [INFO ] Implicit Places using invariants in 108 ms returned []
[2025-06-02 09:41:48] [INFO ] Flow matrix only has 262 transitions (discarded 26 similar events)
[2025-06-02 09:41:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 09:41:49] [INFO ] State equation strengthened by 38 read => feed constraints.
[2025-06-02 09:41:49] [INFO ] Implicit Places using invariants and state equation in 344 ms returned []
Implicit Place search using SMT with State Equation took 454 ms to find 0 implicit places.
Running 287 sub problems to find dead transitions.
[2025-06-02 09:41:49] [INFO ] Flow matrix only has 262 transitions (discarded 26 similar events)
[2025-06-02 09:41:49] [INFO ] Invariant cache hit.
[2025-06-02 09:41:49] [INFO ] State equation strengthened by 38 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 1 (OVERLAPS) 1/107 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 287 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:41:52] [INFO ] Deduced a trap composed of 36 places in 120 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:41:52] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:41:53] [INFO ] Deduced a trap composed of 15 places in 142 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:41:53] [INFO ] Deduced a trap composed of 22 places in 143 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:41:53] [INFO ] Deduced a trap composed of 35 places in 56 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:41:54] [INFO ] Deduced a trap composed of 17 places in 131 ms of which 18 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/107 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 4 (OVERLAPS) 261/368 variables, 107/121 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/368 variables, 37/158 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/368 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 7 (OVERLAPS) 1/369 variables, 1/159 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/369 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 9 (OVERLAPS) 0/369 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 287 unsolved
No progress, stopping.
After SMT solving in domain Real declared 369/369 variables, and 159 constraints, problems are : Problem set: 0 solved, 287 unsolved in 24806 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 107/107 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 287/287 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 287 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 1 (OVERLAPS) 1/107 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/107 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 4 (OVERLAPS) 261/368 variables, 107/121 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/368 variables, 37/158 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/368 variables, 287/445 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/368 variables, 0/445 constraints. Problems are: Problem set: 0 solved, 287 unsolved
SMT process timed out in 54881ms, After SMT, problems are : Problem set: 0 solved, 287 unsolved
Search for dead transitions found 0 dead transitions in 54882ms
Starting structural reductions in LTL mode, iteration 1 : 107/124 places, 288/330 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 55348 ms. Remains : 107/124 places, 288/330 transitions.
Stuttering acceptance computed with spot in 213 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (NOT p0), (OR (NOT p1) (NOT p2)), (NOT p2)]
Running random walk in product with property : FireWire-PT-08-LTLFireability-15
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA FireWire-PT-08-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-08-LTLFireability-15 finished in 55588 ms.
All properties solved by simple procedures.
Total runtime 1170911 ms.
BK_STOP 1748857364364
--------------------
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-08"
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-08, 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-174860102200300"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/FireWire-PT-08.tgz
mv FireWire-PT-08 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 ;