About the Execution of ITS-Tools for FireWire-PT-16
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 0.000 | 844038.00 | 0.00 | 0.00 | FFFTFTFTFFFFFFFF | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r086-smll-174860102400363.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-16, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r086-smll-174860102400363
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 580K
-rw-r--r-- 1 mcc users 6.8K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.5K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 37K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 173K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.4K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 84K 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 84K 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-16-LTLCardinality-00
FORMULA_NAME FireWire-PT-16-LTLCardinality-01
FORMULA_NAME FireWire-PT-16-LTLCardinality-02
FORMULA_NAME FireWire-PT-16-LTLCardinality-03
FORMULA_NAME FireWire-PT-16-LTLCardinality-04
FORMULA_NAME FireWire-PT-16-LTLCardinality-05
FORMULA_NAME FireWire-PT-16-LTLCardinality-06
FORMULA_NAME FireWire-PT-16-LTLCardinality-07
FORMULA_NAME FireWire-PT-16-LTLCardinality-08
FORMULA_NAME FireWire-PT-16-LTLCardinality-09
FORMULA_NAME FireWire-PT-16-LTLCardinality-10
FORMULA_NAME FireWire-PT-16-LTLCardinality-11
FORMULA_NAME FireWire-PT-16-LTLCardinality-12
FORMULA_NAME FireWire-PT-16-LTLCardinality-13
FORMULA_NAME FireWire-PT-16-LTLCardinality-14
FORMULA_NAME FireWire-PT-16-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1748887741133
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FireWire-PT-16
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202505121319
[2025-06-02 18:09:03] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-02 18:09:03] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-02 18:09:03] [INFO ] Load time of PNML (sax parser for PT used): 118 ms
[2025-06-02 18:09:03] [INFO ] Transformed 254 places.
[2025-06-02 18:09:03] [INFO ] Transformed 368 transitions.
[2025-06-02 18:09:03] [INFO ] Found NUPN structural information;
[2025-06-02 18:09:03] [INFO ] Parsed PT model containing 254 places and 368 transitions and 1032 arcs in 257 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 18 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA FireWire-PT-16-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-16-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 42 out of 254 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 254/254 places, 368/368 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 251 transition count 368
Discarding 43 places :
Symmetric choice reduction at 1 with 43 rule applications. Total rules 46 place count 208 transition count 325
Iterating global reduction 1 with 43 rules applied. Total rules applied 89 place count 208 transition count 325
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 97 place count 200 transition count 316
Iterating global reduction 1 with 8 rules applied. Total rules applied 105 place count 200 transition count 316
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 106 place count 200 transition count 315
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 107 place count 199 transition count 314
Iterating global reduction 2 with 1 rules applied. Total rules applied 108 place count 199 transition count 314
Applied a total of 108 rules in 118 ms. Remains 199 /254 variables (removed 55) and now considering 314/368 (removed 54) transitions.
// Phase 1: matrix 314 rows 199 cols
[2025-06-02 18:09:03] [INFO ] Computed 4 invariants in 31 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:09:04] [INFO ] Implicit Places using invariants in 505 ms returned []
[2025-06-02 18:09:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:09:04] [INFO ] Implicit Places using invariants and state equation in 406 ms returned []
Implicit Place search using SMT with State Equation took 961 ms to find 0 implicit places.
Running 313 sub problems to find dead transitions.
[2025-06-02 18:09:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/198 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 1 (OVERLAPS) 1/199 variables, 4/4 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 18:09:11] [INFO ] Deduced a trap composed of 84 places in 204 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:09:11] [INFO ] Deduced a trap composed of 88 places in 147 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:09:12] [INFO ] Deduced a trap composed of 91 places in 139 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:09:12] [INFO ] Deduced a trap composed of 65 places in 155 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:09:12] [INFO ] Deduced a trap composed of 58 places in 148 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:09:13] [INFO ] Deduced a trap composed of 80 places in 144 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:09:13] [INFO ] Deduced a trap composed of 89 places in 135 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:09:13] [INFO ] Deduced a trap composed of 65 places in 160 ms of which 12 ms to minimize.
Problem TDEAD170 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD251 is UNSAT
Problem TDEAD267 is UNSAT
Problem TDEAD272 is UNSAT
Problem TDEAD277 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD287 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:09:14] [INFO ] Deduced a trap composed of 91 places in 130 ms of which 11 ms to minimize.
Problem TDEAD293 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:09:14] [INFO ] Deduced a trap composed of 82 places in 138 ms of which 14 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/199 variables, 10/14 constraints. Problems are: Problem set: 11 solved, 302 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/199 variables, 0/14 constraints. Problems are: Problem set: 11 solved, 302 unsolved
At refinement iteration 4 (OVERLAPS) 314/513 variables, 199/213 constraints. Problems are: Problem set: 11 solved, 302 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:09:23] [INFO ] Deduced a trap composed of 70 places in 125 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:09:24] [INFO ] Deduced a trap composed of 102 places in 159 ms of which 15 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/513 variables, 2/215 constraints. Problems are: Problem set: 11 solved, 302 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:09:27] [INFO ] Deduced a trap composed of 31 places in 84 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:09:29] [INFO ] Deduced a trap composed of 71 places in 124 ms of which 24 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/513 variables, 2/217 constraints. Problems are: Problem set: 11 solved, 302 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 513/513 variables, and 217 constraints, problems are : Problem set: 11 solved, 302 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 199/199 constraints, PredecessorRefiner: 313/313 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 11 solved, 302 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/198 variables, 0/0 constraints. Problems are: Problem set: 11 solved, 302 unsolved
At refinement iteration 1 (OVERLAPS) 1/199 variables, 4/4 constraints. Problems are: Problem set: 11 solved, 302 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/199 variables, 14/18 constraints. Problems are: Problem set: 11 solved, 302 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/199 variables, 0/18 constraints. Problems are: Problem set: 11 solved, 302 unsolved
At refinement iteration 4 (OVERLAPS) 314/513 variables, 199/217 constraints. Problems are: Problem set: 11 solved, 302 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/513 variables, 302/519 constraints. Problems are: Problem set: 11 solved, 302 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:09:44] [INFO ] Deduced a trap composed of 78 places in 122 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:09:46] [INFO ] Deduced a trap composed of 83 places in 213 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:09:48] [INFO ] Deduced a trap composed of 101 places in 225 ms of which 41 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/513 variables, 3/522 constraints. Problems are: Problem set: 11 solved, 302 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 513/513 variables, and 522 constraints, problems are : Problem set: 11 solved, 302 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 199/199 constraints, PredecessorRefiner: 302/313 constraints, Known Traps: 17/17 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60275ms problems are : Problem set: 11 solved, 302 unsolved
Search for dead transitions found 11 dead transitions in 60311ms
Found 11 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 11 transitions
Dead transitions reduction (with SMT) removed 11 transitions
Starting structural reductions in LTL mode, iteration 1 : 199/254 places, 303/368 transitions.
Applied a total of 0 rules in 11 ms. Remains 199 /199 variables (removed 0) and now considering 303/303 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 61442 ms. Remains : 199/254 places, 303/368 transitions.
Support contains 42 out of 199 places after structural reductions.
[2025-06-02 18:10:05] [INFO ] Flatten gal took : 108 ms
[2025-06-02 18:10:05] [INFO ] Flatten gal took : 51 ms
[2025-06-02 18:10:05] [INFO ] Input system was already deterministic with 303 transitions.
RANDOM walk for 40000 steps (8 resets) in 3386 ms. (11 steps per ms) remains 17/26 properties
BEST_FIRST walk for 4004 steps (9 resets) in 50 ms. (78 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4002 steps (9 resets) in 39 ms. (100 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4000 steps (9 resets) in 68 ms. (57 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4000 steps (10 resets) in 91 ms. (43 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4001 steps (9 resets) in 107 ms. (37 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4001 steps (10 resets) in 98 ms. (40 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4001 steps (11 resets) in 82 ms. (48 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (10 resets) in 72 ms. (54 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4001 steps (9 resets) in 128 ms. (31 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (12 resets) in 40 ms. (97 steps per ms) remains 16/17 properties
BEST_FIRST walk for 4000 steps (9 resets) in 50 ms. (78 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4000 steps (8 resets) in 56 ms. (70 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4000 steps (8 resets) in 53 ms. (74 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4001 steps (9 resets) in 40 ms. (97 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4000 steps (10 resets) in 32 ms. (121 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4000 steps (8 resets) in 30 ms. (129 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4000 steps (8 resets) in 19 ms. (200 steps per ms) remains 16/16 properties
// Phase 1: matrix 303 rows 199 cols
[2025-06-02 18:10:07] [INFO ] Computed 4 invariants in 9 ms
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
Problem AtomicPropp5 is UNSAT
At refinement iteration 1 (OVERLAPS) 154/178 variables, 4/4 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/178 variables, 0/4 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 3 (OVERLAPS) 284/462 variables, 178/182 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/462 variables, 0/182 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 5 (OVERLAPS) 11/473 variables, 6/188 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/473 variables, 0/188 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 7 (OVERLAPS) 8/481 variables, 4/192 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/481 variables, 0/192 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 9 (OVERLAPS) 8/489 variables, 4/196 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/489 variables, 0/196 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 11 (OVERLAPS) 9/498 variables, 4/200 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/498 variables, 0/200 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 13 (OVERLAPS) 4/502 variables, 3/203 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/502 variables, 0/203 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 15 (OVERLAPS) 0/502 variables, 0/203 constraints. Problems are: Problem set: 1 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Real declared 502/502 variables, and 203 constraints, problems are : Problem set: 1 solved, 15 unsolved in 1963 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 199/199 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 15 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 1 (OVERLAPS) 157/178 variables, 4/4 constraints. Problems are: Problem set: 1 solved, 15 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:10:09] [INFO ] Deduced a trap composed of 58 places in 247 ms of which 44 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:10:09] [INFO ] Deduced a trap composed of 78 places in 206 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:10:10] [INFO ] Deduced a trap composed of 82 places in 176 ms of which 44 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:10:10] [INFO ] Deduced a trap composed of 71 places in 175 ms of which 44 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:10:10] [INFO ] Deduced a trap composed of 100 places in 222 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:10:10] [INFO ] Deduced a trap composed of 87 places in 201 ms of which 39 ms to minimize.
Problem AtomicPropp15 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:10:11] [INFO ] Deduced a trap composed of 84 places in 240 ms of which 46 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:10:11] [INFO ] Deduced a trap composed of 30 places in 237 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:10:11] [INFO ] Deduced a trap composed of 49 places in 228 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:10:11] [INFO ] Deduced a trap composed of 63 places in 234 ms of which 51 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:10:11] [INFO ] Deduced a trap composed of 82 places in 147 ms of which 23 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/178 variables, 11/15 constraints. Problems are: Problem set: 2 solved, 14 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:10:12] [INFO ] Deduced a trap composed of 70 places in 197 ms of which 21 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/178 variables, 1/16 constraints. Problems are: Problem set: 2 solved, 14 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:10:12] [INFO ] Deduced a trap composed of 84 places in 257 ms of which 53 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:10:12] [INFO ] Deduced a trap composed of 65 places in 241 ms of which 43 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/178 variables, 2/18 constraints. Problems are: Problem set: 2 solved, 14 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/178 variables, 0/18 constraints. Problems are: Problem set: 2 solved, 14 unsolved
At refinement iteration 6 (OVERLAPS) 284/462 variables, 178/196 constraints. Problems are: Problem set: 2 solved, 14 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/462 variables, 13/209 constraints. Problems are: Problem set: 2 solved, 14 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/462 variables, 0/209 constraints. Problems are: Problem set: 2 solved, 14 unsolved
SMT process timed out in 7002ms, After SMT, problems are : Problem set: 2 solved, 14 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 18 out of 199 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 199/199 places, 303/303 transitions.
Graph (trivial) has 139 edges and 199 vertex of which 13 / 199 are part of one of the 2 SCC in 5 ms
Free SCC test removed 11 places
Drop transitions (Empty/Sink Transition effects.) removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 37 transitions
Trivial Post-agglo rules discarded 37 transitions
Performed 37 trivial Post agglomeration. Transition count delta: 37
Iterating post reduction 0 with 37 rules applied. Total rules applied 38 place count 188 transition count 252
Reduce places removed 37 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 38 rules applied. Total rules applied 76 place count 151 transition count 251
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 77 place count 150 transition count 251
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 13 Pre rules applied. Total rules applied 77 place count 150 transition count 238
Deduced a syphon composed of 13 places in 1 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 26 rules applied. Total rules applied 103 place count 137 transition count 238
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 109 place count 131 transition count 221
Iterating global reduction 3 with 6 rules applied. Total rules applied 115 place count 131 transition count 221
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 4 rules applied. Total rules applied 119 place count 131 transition count 217
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 120 place count 130 transition count 217
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 120 place count 130 transition count 216
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 122 place count 129 transition count 216
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 5 with 30 rules applied. Total rules applied 152 place count 114 transition count 201
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: -69
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 5 with 32 rules applied. Total rules applied 184 place count 98 transition count 270
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 190 place count 98 transition count 264
Drop transitions (Redundant composition of simpler transitions.) removed 30 transitions
Redundant transition composition rules discarded 30 transitions
Iterating global reduction 6 with 30 rules applied. Total rules applied 220 place count 98 transition count 234
Free-agglomeration rule applied 10 times.
Iterating global reduction 6 with 10 rules applied. Total rules applied 230 place count 98 transition count 224
Reduce places removed 10 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 6 with 25 rules applied. Total rules applied 255 place count 88 transition count 209
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 7 with 9 rules applied. Total rules applied 264 place count 88 transition count 200
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 7 with 2 rules applied. Total rules applied 266 place count 88 transition count 200
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 7 with 3 rules applied. Total rules applied 269 place count 88 transition count 197
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 270 place count 88 transition count 197
Applied a total of 270 rules in 200 ms. Remains 88 /199 variables (removed 111) and now considering 197/303 (removed 106) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 200 ms. Remains : 88/199 places, 197/303 transitions.
RANDOM walk for 40000 steps (3109 resets) in 864 ms. (46 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40002 steps (958 resets) in 278 ms. (143 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40002 steps (956 resets) in 170 ms. (233 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (917 resets) in 157 ms. (253 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (917 resets) in 185 ms. (215 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (922 resets) in 146 ms. (272 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40002 steps (909 resets) in 201 ms. (198 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40002 steps (887 resets) in 221 ms. (180 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (903 resets) in 312 ms. (127 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (931 resets) in 318 ms. (125 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40002 steps (912 resets) in 264 ms. (150 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (909 resets) in 169 ms. (235 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (929 resets) in 117 ms. (339 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40002 steps (933 resets) in 241 ms. (165 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (894 resets) in 131 ms. (303 steps per ms) remains 14/14 properties
Finished probabilistic random walk after 94896 steps, run visited all 14 properties in 593 ms. (steps per millisecond=160 )
Probabilistic random walk after 94896 steps, saw 25412 distinct states, run finished after 601 ms. (steps per millisecond=157 ) properties seen :14
FORMULA FireWire-PT-16-LTLCardinality-02 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 2 atomic propositions for a total of 13 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA FireWire-PT-16-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 29 stabilizing places and 31 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' '!(X((X(p0)&&G(p1))))'
Support contains 2 out of 199 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 199/199 places, 303/303 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 182 transition count 275
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 182 transition count 275
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 35 place count 182 transition count 274
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 41 place count 176 transition count 267
Iterating global reduction 1 with 6 rules applied. Total rules applied 47 place count 176 transition count 267
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 48 place count 175 transition count 266
Iterating global reduction 1 with 1 rules applied. Total rules applied 49 place count 175 transition count 266
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 50 place count 174 transition count 265
Iterating global reduction 1 with 1 rules applied. Total rules applied 51 place count 174 transition count 265
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 52 place count 173 transition count 264
Iterating global reduction 1 with 1 rules applied. Total rules applied 53 place count 173 transition count 264
Applied a total of 53 rules in 28 ms. Remains 173 /199 variables (removed 26) and now considering 264/303 (removed 39) transitions.
// Phase 1: matrix 264 rows 173 cols
[2025-06-02 18:10:16] [INFO ] Computed 4 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:10:16] [INFO ] Implicit Places using invariants in 151 ms returned []
[2025-06-02 18:10:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:10:17] [INFO ] Implicit Places using invariants and state equation in 301 ms returned []
Implicit Place search using SMT with State Equation took 456 ms to find 0 implicit places.
Running 263 sub problems to find dead transitions.
[2025-06-02 18:10:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/172 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 1 (OVERLAPS) 1/173 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 263 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:10:22] [INFO ] Deduced a trap composed of 73 places in 179 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:10:22] [INFO ] Deduced a trap composed of 28 places in 80 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:10:22] [INFO ] Deduced a trap composed of 74 places in 141 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:10:23] [INFO ] Deduced a trap composed of 77 places in 148 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:10:23] [INFO ] Deduced a trap composed of 48 places in 141 ms of which 12 ms to minimize.
Problem TDEAD146 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD154 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:10:24] [INFO ] Deduced a trap composed of 74 places in 185 ms of which 28 ms to minimize.
Problem TDEAD212 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD240 is UNSAT
Problem TDEAD241 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:10:24] [INFO ] Deduced a trap composed of 53 places in 192 ms of which 33 ms to minimize.
Problem TDEAD246 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/173 variables, 7/11 constraints. Problems are: Problem set: 15 solved, 248 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/173 variables, 0/11 constraints. Problems are: Problem set: 15 solved, 248 unsolved
At refinement iteration 4 (OVERLAPS) 264/437 variables, 173/184 constraints. Problems are: Problem set: 15 solved, 248 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:10:31] [INFO ] Deduced a trap composed of 59 places in 182 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:10:31] [INFO ] Deduced a trap composed of 92 places in 195 ms of which 21 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/437 variables, 2/186 constraints. Problems are: Problem set: 15 solved, 248 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/437 variables, 0/186 constraints. Problems are: Problem set: 15 solved, 248 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 437/437 variables, and 186 constraints, problems are : Problem set: 15 solved, 248 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 173/173 constraints, PredecessorRefiner: 263/263 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 15 solved, 248 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/172 variables, 0/0 constraints. Problems are: Problem set: 15 solved, 248 unsolved
At refinement iteration 1 (OVERLAPS) 1/173 variables, 4/4 constraints. Problems are: Problem set: 15 solved, 248 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/173 variables, 9/13 constraints. Problems are: Problem set: 15 solved, 248 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:10:50] [INFO ] Deduced a trap composed of 55 places in 294 ms of which 75 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:10:50] [INFO ] Deduced a trap composed of 82 places in 172 ms of which 20 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/173 variables, 2/15 constraints. Problems are: Problem set: 15 solved, 248 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:10:52] [INFO ] Deduced a trap composed of 71 places in 159 ms of which 15 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/173 variables, 1/16 constraints. Problems are: Problem set: 15 solved, 248 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:10:55] [INFO ] Deduced a trap composed of 51 places in 206 ms of which 35 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/173 variables, 1/17 constraints. Problems are: Problem set: 15 solved, 248 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/173 variables, 0/17 constraints. Problems are: Problem set: 15 solved, 248 unsolved
At refinement iteration 7 (OVERLAPS) 264/437 variables, 173/190 constraints. Problems are: Problem set: 15 solved, 248 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/437 variables, 248/438 constraints. Problems are: Problem set: 15 solved, 248 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:11:03] [INFO ] Deduced a trap composed of 46 places in 76 ms of which 6 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/437 variables, 1/439 constraints. Problems are: Problem set: 15 solved, 248 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:11:13] [INFO ] Deduced a trap composed of 74 places in 189 ms of which 20 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 437/437 variables, and 440 constraints, problems are : Problem set: 15 solved, 248 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 173/173 constraints, PredecessorRefiner: 248/263 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60102ms problems are : Problem set: 15 solved, 248 unsolved
Search for dead transitions found 15 dead transitions in 60107ms
Found 15 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 15 transitions
Dead transitions reduction (with SMT) removed 15 transitions
Starting structural reductions in LTL mode, iteration 1 : 173/199 places, 249/303 transitions.
Applied a total of 0 rules in 6 ms. Remains 173 /173 variables (removed 0) and now considering 249/249 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 60601 ms. Remains : 173/199 places, 249/303 transitions.
Stuttering acceptance computed with spot in 535 ms :[true, (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : FireWire-PT-16-LTLCardinality-00
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 5 ms.
FORMULA FireWire-PT-16-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-16-LTLCardinality-00 finished in 61250 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))))'
Support contains 1 out of 199 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 199/199 places, 303/303 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 181 transition count 274
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 181 transition count 274
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 37 place count 181 transition count 273
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 43 place count 175 transition count 266
Iterating global reduction 1 with 6 rules applied. Total rules applied 49 place count 175 transition count 266
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 50 place count 174 transition count 265
Iterating global reduction 1 with 1 rules applied. Total rules applied 51 place count 174 transition count 265
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 52 place count 173 transition count 264
Iterating global reduction 1 with 1 rules applied. Total rules applied 53 place count 173 transition count 264
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 54 place count 172 transition count 263
Iterating global reduction 1 with 1 rules applied. Total rules applied 55 place count 172 transition count 263
Applied a total of 55 rules in 50 ms. Remains 172 /199 variables (removed 27) and now considering 263/303 (removed 40) transitions.
// Phase 1: matrix 263 rows 172 cols
[2025-06-02 18:11:17] [INFO ] Computed 4 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:11:18] [INFO ] Implicit Places using invariants in 188 ms returned []
[2025-06-02 18:11:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:11:18] [INFO ] Implicit Places using invariants and state equation in 366 ms returned []
Implicit Place search using SMT with State Equation took 558 ms to find 0 implicit places.
Running 262 sub problems to find dead transitions.
[2025-06-02 18:11:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/171 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 1 (OVERLAPS) 1/172 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 262 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:11:23] [INFO ] Deduced a trap composed of 73 places in 144 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:11:23] [INFO ] Deduced a trap composed of 27 places in 79 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:11:24] [INFO ] Deduced a trap composed of 74 places in 140 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:11:24] [INFO ] Deduced a trap composed of 77 places in 150 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:11:24] [INFO ] Deduced a trap composed of 48 places in 137 ms of which 12 ms to minimize.
Problem TDEAD145 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD153 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:11:25] [INFO ] Deduced a trap composed of 74 places in 170 ms of which 29 ms to minimize.
Problem TDEAD211 is UNSAT
Problem TDEAD223 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD227 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD231 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD239 is UNSAT
Problem TDEAD240 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:11:26] [INFO ] Deduced a trap composed of 53 places in 191 ms of which 33 ms to minimize.
Problem TDEAD245 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/172 variables, 7/11 constraints. Problems are: Problem set: 15 solved, 247 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:11:27] [INFO ] Deduced a trap composed of 71 places in 171 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:11:27] [INFO ] Deduced a trap composed of 82 places in 148 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:11:28] [INFO ] Deduced a trap composed of 51 places in 219 ms of which 38 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/172 variables, 3/14 constraints. Problems are: Problem set: 15 solved, 247 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/172 variables, 0/14 constraints. Problems are: Problem set: 15 solved, 247 unsolved
At refinement iteration 5 (OVERLAPS) 263/435 variables, 172/186 constraints. Problems are: Problem set: 15 solved, 247 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:11:35] [INFO ] Deduced a trap composed of 59 places in 204 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:11:36] [INFO ] Deduced a trap composed of 92 places in 163 ms of which 18 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/435 variables, 2/188 constraints. Problems are: Problem set: 15 solved, 247 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/435 variables, 0/188 constraints. Problems are: Problem set: 15 solved, 247 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 1.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 1.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 1.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 1.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 1.0)timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 435/435 variables, and 188 constraints, problems are : Problem set: 15 solved, 247 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 172/172 constraints, PredecessorRefiner: 262/262 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 15 solved, 247 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/171 variables, 0/0 constraints. Problems are: Problem set: 15 solved, 247 unsolved
At refinement iteration 1 (OVERLAPS) 1/172 variables, 4/4 constraints. Problems are: Problem set: 15 solved, 247 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/172 variables, 12/16 constraints. Problems are: Problem set: 15 solved, 247 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:11:51] [INFO ] Deduced a trap composed of 55 places in 200 ms of which 36 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/172 variables, 1/17 constraints. Problems are: Problem set: 15 solved, 247 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/172 variables, 0/17 constraints. Problems are: Problem set: 15 solved, 247 unsolved
At refinement iteration 5 (OVERLAPS) 263/435 variables, 172/189 constraints. Problems are: Problem set: 15 solved, 247 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/435 variables, 247/436 constraints. Problems are: Problem set: 15 solved, 247 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:12:03] [INFO ] Deduced a trap along path composed of 11 places in 62 ms of which 7 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/435 variables, 1/437 constraints. Problems are: Problem set: 15 solved, 247 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:12:15] [INFO ] Deduced a trap composed of 74 places in 238 ms of which 39 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 435/435 variables, and 438 constraints, problems are : Problem set: 15 solved, 247 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 172/172 constraints, PredecessorRefiner: 247/262 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 60107ms problems are : Problem set: 15 solved, 247 unsolved
Search for dead transitions found 15 dead transitions in 60109ms
Found 15 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 15 transitions
Dead transitions reduction (with SMT) removed 15 transitions
Starting structural reductions in LTL mode, iteration 1 : 172/199 places, 248/303 transitions.
Applied a total of 0 rules in 6 ms. Remains 172 /172 variables (removed 0) and now considering 248/248 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 60725 ms. Remains : 172/199 places, 248/303 transitions.
Stuttering acceptance computed with spot in 180 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : FireWire-PT-16-LTLCardinality-01
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA FireWire-PT-16-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-16-LTLCardinality-01 finished in 60929 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))'
Support contains 2 out of 199 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 199/199 places, 303/303 transitions.
Graph (trivial) has 165 edges and 199 vertex of which 18 / 199 are part of one of the 3 SCC in 1 ms
Free SCC test removed 15 places
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 41 transitions
Trivial Post-agglo rules discarded 41 transitions
Performed 41 trivial Post agglomeration. Transition count delta: 41
Iterating post reduction 0 with 41 rules applied. Total rules applied 42 place count 184 transition count 246
Reduce places removed 41 places and 0 transitions.
Iterating post reduction 1 with 41 rules applied. Total rules applied 83 place count 143 transition count 246
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 83 place count 143 transition count 234
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 107 place count 131 transition count 234
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 120 place count 118 transition count 201
Iterating global reduction 2 with 13 rules applied. Total rules applied 133 place count 118 transition count 201
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 4 rules applied. Total rules applied 137 place count 118 transition count 197
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 138 place count 117 transition count 197
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 5 Pre rules applied. Total rules applied 138 place count 117 transition count 192
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 148 place count 112 transition count 192
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 149 place count 111 transition count 191
Iterating global reduction 4 with 1 rules applied. Total rules applied 150 place count 111 transition count 191
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 4 with 36 rules applied. Total rules applied 186 place count 93 transition count 173
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: -74
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 4 with 34 rules applied. Total rules applied 220 place count 76 transition count 247
Drop transitions (Redundant composition of simpler transitions.) removed 37 transitions
Redundant transition composition rules discarded 37 transitions
Iterating global reduction 4 with 37 rules applied. Total rules applied 257 place count 76 transition count 210
Applied a total of 257 rules in 77 ms. Remains 76 /199 variables (removed 123) and now considering 210/303 (removed 93) transitions.
[2025-06-02 18:12:18] [INFO ] Flow matrix only has 183 transitions (discarded 27 similar events)
// Phase 1: matrix 183 rows 76 cols
[2025-06-02 18:12:18] [INFO ] Computed 4 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:12:19] [INFO ] Implicit Places using invariants in 126 ms returned []
[2025-06-02 18:12:19] [INFO ] Flow matrix only has 183 transitions (discarded 27 similar events)
[2025-06-02 18:12:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:12:19] [INFO ] State equation strengthened by 35 read => feed constraints.
[2025-06-02 18:12:19] [INFO ] Implicit Places using invariants and state equation in 374 ms returned []
Implicit Place search using SMT with State Equation took 505 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 18:12:19] [INFO ] Redundant transitions in 16 ms returned []
Running 207 sub problems to find dead transitions.
[2025-06-02 18:12:19] [INFO ] Flow matrix only has 183 transitions (discarded 27 similar events)
[2025-06-02 18:12:19] [INFO ] Invariant cache hit.
[2025-06-02 18:12:19] [INFO ] State equation strengthened by 35 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 1 (OVERLAPS) 1/76 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 207 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:12:22] [INFO ] Deduced a trap composed of 40 places in 124 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:12:22] [INFO ] Deduced a trap composed of 41 places in 116 ms of which 15 ms to minimize.
Problem TDEAD12 is UNSAT
Problem TDEAD14 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:12:22] [INFO ] Deduced a trap composed of 41 places in 125 ms of which 16 ms to minimize.
Problem TDEAD22 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD34 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:12:22] [INFO ] Deduced a trap composed of 43 places in 128 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:12:22] [INFO ] Deduced a trap composed of 20 places in 125 ms of which 15 ms to minimize.
Problem TDEAD53 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:12:22] [INFO ] Deduced a trap composed of 27 places in 125 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:12:23] [INFO ] Deduced a trap composed of 34 places in 134 ms of which 15 ms to minimize.
Problem TDEAD79 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD195 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/76 variables, 7/11 constraints. Problems are: Problem set: 24 solved, 183 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:12:24] [INFO ] Deduced a trap composed of 38 places in 142 ms of which 10 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/76 variables, 1/12 constraints. Problems are: Problem set: 24 solved, 183 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/76 variables, 0/12 constraints. Problems are: Problem set: 24 solved, 183 unsolved
At refinement iteration 5 (OVERLAPS) 182/258 variables, 76/88 constraints. Problems are: Problem set: 24 solved, 183 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/258 variables, 34/122 constraints. Problems are: Problem set: 24 solved, 183 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/258 variables, 0/122 constraints. Problems are: Problem set: 24 solved, 183 unsolved
At refinement iteration 8 (OVERLAPS) 1/259 variables, 1/123 constraints. Problems are: Problem set: 24 solved, 183 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/259 variables, 0/123 constraints. Problems are: Problem set: 24 solved, 183 unsolved
At refinement iteration 10 (OVERLAPS) 0/259 variables, 0/123 constraints. Problems are: Problem set: 24 solved, 183 unsolved
No progress, stopping.
After SMT solving in domain Real declared 259/259 variables, and 123 constraints, problems are : Problem set: 24 solved, 183 unsolved in 16370 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 76/76 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 207/207 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 24 solved, 183 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 0/0 constraints. Problems are: Problem set: 24 solved, 183 unsolved
At refinement iteration 1 (OVERLAPS) 1/76 variables, 4/4 constraints. Problems are: Problem set: 24 solved, 183 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/76 variables, 8/12 constraints. Problems are: Problem set: 24 solved, 183 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/76 variables, 0/12 constraints. Problems are: Problem set: 24 solved, 183 unsolved
At refinement iteration 4 (OVERLAPS) 182/258 variables, 76/88 constraints. Problems are: Problem set: 24 solved, 183 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/258 variables, 34/122 constraints. Problems are: Problem set: 24 solved, 183 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/258 variables, 183/305 constraints. Problems are: Problem set: 24 solved, 183 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/258 variables, 0/305 constraints. Problems are: Problem set: 24 solved, 183 unsolved
At refinement iteration 8 (OVERLAPS) 1/259 variables, 1/306 constraints. Problems are: Problem set: 24 solved, 183 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/259 variables, 0/306 constraints. Problems are: Problem set: 24 solved, 183 unsolved
At refinement iteration 10 (OVERLAPS) 0/259 variables, 0/306 constraints. Problems are: Problem set: 24 solved, 183 unsolved
No progress, stopping.
After SMT solving in domain Int declared 259/259 variables, and 306 constraints, problems are : Problem set: 24 solved, 183 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 76/76 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 183/207 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 46506ms problems are : Problem set: 24 solved, 183 unsolved
Search for dead transitions found 24 dead transitions in 46507ms
Found 24 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 24 transitions
Dead transitions reduction (with SMT) removed 24 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 76/199 places, 186/303 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 75 transition count 191
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 75 transition count 190
Applied a total of 3 rules in 20 ms. Remains 75 /76 variables (removed 1) and now considering 190/186 (removed -4) transitions.
[2025-06-02 18:13:06] [INFO ] Flow matrix only has 163 transitions (discarded 27 similar events)
// Phase 1: matrix 163 rows 75 cols
[2025-06-02 18:13:06] [INFO ] Computed 4 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:13:06] [INFO ] Implicit Places using invariants in 153 ms returned []
[2025-06-02 18:13:06] [INFO ] Flow matrix only has 163 transitions (discarded 27 similar events)
[2025-06-02 18:13:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:13:06] [INFO ] State equation strengthened by 28 read => feed constraints.
[2025-06-02 18:13:06] [INFO ] Implicit Places using invariants and state equation in 238 ms returned []
Implicit Place search using SMT with State Equation took 394 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 75/199 places, 190/303 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 47529 ms. Remains : 75/199 places, 190/303 transitions.
Stuttering acceptance computed with spot in 53 ms :[(NOT p0)]
Running random walk in product with property : FireWire-PT-16-LTLCardinality-05
Product exploration explored 100000 steps with 50000 reset in 508 ms.
Product exploration explored 100000 steps with 50000 reset in 319 ms.
Computed a total of 3 stabilizing places and 7 stable transitions
Computed a total of 3 stabilizing places and 7 stable transitions
Knowledge obtained : [(NOT p0), (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 32 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FireWire-PT-16-LTLCardinality-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FireWire-PT-16-LTLCardinality-05 finished in 48479 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(((p1 U p2)||X(X(p2))||p0)))))'
Support contains 6 out of 199 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 199/199 places, 303/303 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 185 transition count 278
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 185 transition count 278
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 29 place count 185 transition count 277
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 34 place count 180 transition count 271
Iterating global reduction 1 with 5 rules applied. Total rules applied 39 place count 180 transition count 271
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 40 place count 179 transition count 270
Iterating global reduction 1 with 1 rules applied. Total rules applied 41 place count 179 transition count 270
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 42 place count 178 transition count 269
Iterating global reduction 1 with 1 rules applied. Total rules applied 43 place count 178 transition count 269
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 44 place count 177 transition count 268
Iterating global reduction 1 with 1 rules applied. Total rules applied 45 place count 177 transition count 268
Applied a total of 45 rules in 13 ms. Remains 177 /199 variables (removed 22) and now considering 268/303 (removed 35) transitions.
// Phase 1: matrix 268 rows 177 cols
[2025-06-02 18:13:07] [INFO ] Computed 4 invariants in 7 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:13:07] [INFO ] Implicit Places using invariants in 149 ms returned []
[2025-06-02 18:13:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:13:07] [INFO ] Implicit Places using invariants and state equation in 308 ms returned []
Implicit Place search using SMT with State Equation took 459 ms to find 0 implicit places.
Running 267 sub problems to find dead transitions.
[2025-06-02 18:13:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/176 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 1 (OVERLAPS) 1/177 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 267 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:13:13] [INFO ] Deduced a trap composed of 74 places in 158 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:13:14] [INFO ] Deduced a trap composed of 77 places in 160 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:13:14] [INFO ] Deduced a trap composed of 52 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 18:13:14] [INFO ] Deduced a trap composed of 55 places in 203 ms of which 42 ms to minimize.
Problem TDEAD150 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD158 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:13:15] [INFO ] Deduced a trap composed of 74 places in 175 ms of which 33 ms to minimize.
Problem TDEAD216 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD240 is UNSAT
Problem TDEAD241 is UNSAT
Problem TDEAD244 is UNSAT
Problem TDEAD245 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:13:15] [INFO ] Deduced a trap composed of 57 places in 183 ms of which 33 ms to minimize.
Problem TDEAD250 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/177 variables, 6/10 constraints. Problems are: Problem set: 15 solved, 252 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:13:16] [INFO ] Deduced a trap composed of 71 places in 128 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:13:16] [INFO ] Deduced a trap composed of 82 places in 166 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:13:16] [INFO ] Deduced a trap composed of 46 places in 87 ms of which 6 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/177 variables, 3/13 constraints. Problems are: Problem set: 15 solved, 252 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/177 variables, 0/13 constraints. Problems are: Problem set: 15 solved, 252 unsolved
At refinement iteration 5 (OVERLAPS) 268/445 variables, 177/190 constraints. Problems are: Problem set: 15 solved, 252 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:13:25] [INFO ] Deduced a trap composed of 63 places in 224 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:13:26] [INFO ] Deduced a trap composed of 94 places in 163 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:13:26] [INFO ] Deduced a trap composed of 92 places in 184 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:13:27] [INFO ] Deduced a trap composed of 65 places in 182 ms of which 24 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/445 variables, 4/194 constraints. Problems are: Problem set: 15 solved, 252 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Stream closed")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 445/445 variables, and 194 constraints, problems are : Problem set: 15 solved, 252 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 177/177 constraints, PredecessorRefiner: 267/267 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 15 solved, 252 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/176 variables, 0/0 constraints. Problems are: Problem set: 15 solved, 252 unsolved
At refinement iteration 1 (OVERLAPS) 1/177 variables, 4/4 constraints. Problems are: Problem set: 15 solved, 252 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/177 variables, 13/17 constraints. Problems are: Problem set: 15 solved, 252 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:13:40] [INFO ] Deduced a trap composed of 27 places in 84 ms of which 6 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/177 variables, 1/18 constraints. Problems are: Problem set: 15 solved, 252 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:13:43] [INFO ] Deduced a trap composed of 82 places in 199 ms of which 32 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/177 variables, 1/19 constraints. Problems are: Problem set: 15 solved, 252 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/177 variables, 0/19 constraints. Problems are: Problem set: 15 solved, 252 unsolved
At refinement iteration 6 (OVERLAPS) 268/445 variables, 177/196 constraints. Problems are: Problem set: 15 solved, 252 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/445 variables, 252/448 constraints. Problems are: Problem set: 15 solved, 252 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:13:52] [INFO ] Deduced a trap composed of 77 places in 201 ms of which 34 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/445 variables, 1/449 constraints. Problems are: Problem set: 15 solved, 252 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:14:01] [INFO ] Deduced a trap composed of 59 places in 175 ms of which 34 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/445 variables, 1/450 constraints. Problems are: Problem set: 15 solved, 252 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:14:07] [INFO ] Deduced a trap composed of 73 places in 98 ms of which 7 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 445/445 variables, and 451 constraints, problems are : Problem set: 15 solved, 252 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 177/177 constraints, PredecessorRefiner: 252/267 constraints, Known Traps: 18/18 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60084ms problems are : Problem set: 15 solved, 252 unsolved
Search for dead transitions found 15 dead transitions in 60086ms
Found 15 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 15 transitions
Dead transitions reduction (with SMT) removed 15 transitions
Starting structural reductions in LTL mode, iteration 1 : 177/199 places, 253/303 transitions.
Applied a total of 0 rules in 3 ms. Remains 177 /177 variables (removed 0) and now considering 253/253 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 60565 ms. Remains : 177/199 places, 253/303 transitions.
Stuttering acceptance computed with spot in 445 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p2), (NOT p2), (NOT p2), true, (NOT p2)]
Running random walk in product with property : FireWire-PT-16-LTLCardinality-07
Product exploration explored 100000 steps with 0 reset in 457 ms.
Product exploration explored 100000 steps with 0 reset in 497 ms.
Computed a total of 22 stabilizing places and 24 stable transitions
Computed a total of 22 stabilizing places and 24 stable transitions
Knowledge obtained : [(AND p0 p2 p1), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 109 ms. Reduced automaton from 8 states, 12 edges and 3 AP (stutter sensitive) to 8 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 275 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p2), (NOT p2), (NOT p2), true, (NOT p2)]
RANDOM walk for 40000 steps (10 resets) in 424 ms. (94 steps per ms) remains 3/7 properties
BEST_FIRST walk for 40004 steps (9 resets) in 420 ms. (95 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (10 resets) in 279 ms. (142 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40000 steps (16 resets) in 165 ms. (240 steps per ms) remains 3/3 properties
// Phase 1: matrix 253 rows 177 cols
[2025-06-02 18:14:10] [INFO ] Computed 4 invariants in 2 ms
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 143/149 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/149 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 12/161 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/161 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 237/398 variables, 161/165 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/398 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 15/413 variables, 6/171 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/413 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 15/428 variables, 8/179 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/428 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 2/430 variables, 2/181 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/430 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 0/430 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 430/430 variables, and 181 constraints, problems are : Problem set: 0 solved, 3 unsolved in 306 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 177/177 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 143/149 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/149 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 12/161 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/161 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 237/398 variables, 161/165 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/398 variables, 1/166 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:14:10] [INFO ] Deduced a trap composed of 56 places in 138 ms of which 34 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/398 variables, 1/167 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/398 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 15/413 variables, 6/173 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/413 variables, 2/175 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/413 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 15/428 variables, 8/183 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/428 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 2/430 variables, 2/185 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:14:11] [INFO ] Deduced a trap composed of 46 places in 85 ms of which 8 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/430 variables, 1/186 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/430 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 0/430 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 430/430 variables, and 186 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1127 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 177/177 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1444ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 676 ms.
Support contains 6 out of 177 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 177/177 places, 253/253 transitions.
Graph (trivial) has 138 edges and 177 vertex of which 13 / 177 are part of one of the 2 SCC in 3 ms
Free SCC test removed 11 places
Drop transitions (Empty/Sink Transition effects.) removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 0 with 30 rules applied. Total rules applied 31 place count 166 transition count 208
Reduce places removed 30 places and 0 transitions.
Iterating post reduction 1 with 30 rules applied. Total rules applied 61 place count 136 transition count 208
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 19 Pre rules applied. Total rules applied 61 place count 136 transition count 189
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 38 rules applied. Total rules applied 99 place count 117 transition count 189
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 100 place count 116 transition count 179
Iterating global reduction 2 with 1 rules applied. Total rules applied 101 place count 116 transition count 179
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 102 place count 116 transition count 178
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 136 place count 99 transition count 161
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: -73
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 170 place count 82 transition count 234
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 173 place count 82 transition count 231
Drop transitions (Redundant composition of simpler transitions.) removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 4 with 19 rules applied. Total rules applied 192 place count 82 transition count 212
Free-agglomeration rule applied 10 times.
Iterating global reduction 4 with 10 rules applied. Total rules applied 202 place count 82 transition count 202
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 4 with 10 rules applied. Total rules applied 212 place count 72 transition count 202
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 5 with 3 rules applied. Total rules applied 215 place count 72 transition count 199
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 5 with 3 rules applied. Total rules applied 218 place count 72 transition count 199
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 220 place count 72 transition count 197
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 221 place count 72 transition count 197
Applied a total of 221 rules in 51 ms. Remains 72 /177 variables (removed 105) and now considering 197/253 (removed 56) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 51 ms. Remains : 72/177 places, 197/253 transitions.
RANDOM walk for 40000 steps (3237 resets) in 87 ms. (454 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (890 resets) in 68 ms. (579 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40001 steps (856 resets) in 75 ms. (526 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (909 resets) in 47 ms. (833 steps per ms) remains 3/3 properties
Probably explored full state space saw : 8928 states, properties seen :1
Probabilistic random walk after 30589 steps, saw 8928 distinct states, run finished after 126 ms. (steps per millisecond=242 ) properties seen :1
Explored full state space saw : 8928 states, properties seen :0
Exhaustive walk after 30589 steps, saw 8928 distinct states, run finished after 115 ms. (steps per millisecond=265 ) properties seen :0
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p0 p2 p1), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X p0)), (X (X p1)), (G (OR p2 p0 p1)), (G (OR p2 p0 (NOT p1)))]
False Knowledge obtained : [(F (NOT (OR p2 p1))), (F (NOT p0)), (F (NOT p1)), (F (NOT (OR p2 (NOT p1)))), (F (NOT p2))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 8 factoid took 19 ms. Reduced automaton from 8 states, 12 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FireWire-PT-16-LTLCardinality-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FireWire-PT-16-LTLCardinality-07 finished in 65379 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))'
Support contains 3 out of 199 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 199/199 places, 303/303 transitions.
Graph (trivial) has 160 edges and 199 vertex of which 14 / 199 are part of one of the 2 SCC in 1 ms
Free SCC test removed 12 places
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 39 transitions
Trivial Post-agglo rules discarded 39 transitions
Performed 39 trivial Post agglomeration. Transition count delta: 39
Iterating post reduction 0 with 39 rules applied. Total rules applied 40 place count 186 transition count 250
Reduce places removed 39 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 40 rules applied. Total rules applied 80 place count 147 transition count 249
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 81 place count 146 transition count 249
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 12 Pre rules applied. Total rules applied 81 place count 146 transition count 237
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 105 place count 134 transition count 237
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 117 place count 122 transition count 205
Iterating global reduction 3 with 12 rules applied. Total rules applied 129 place count 122 transition count 205
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 3 rules applied. Total rules applied 132 place count 122 transition count 202
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 133 place count 121 transition count 202
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 5 Pre rules applied. Total rules applied 133 place count 121 transition count 197
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 5 with 10 rules applied. Total rules applied 143 place count 116 transition count 197
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 144 place count 115 transition count 196
Iterating global reduction 5 with 1 rules applied. Total rules applied 145 place count 115 transition count 196
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 5 with 32 rules applied. Total rules applied 177 place count 99 transition count 180
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: -74
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 5 with 32 rules applied. Total rules applied 209 place count 83 transition count 254
Drop transitions (Redundant composition of simpler transitions.) removed 37 transitions
Redundant transition composition rules discarded 37 transitions
Iterating global reduction 5 with 37 rules applied. Total rules applied 246 place count 83 transition count 217
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 247 place count 82 transition count 216
Applied a total of 247 rules in 45 ms. Remains 82 /199 variables (removed 117) and now considering 216/303 (removed 87) transitions.
[2025-06-02 18:14:12] [INFO ] Flow matrix only has 190 transitions (discarded 26 similar events)
// Phase 1: matrix 190 rows 82 cols
[2025-06-02 18:14:12] [INFO ] Computed 4 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:14:12] [INFO ] Implicit Places using invariants in 123 ms returned []
[2025-06-02 18:14:12] [INFO ] Flow matrix only has 190 transitions (discarded 26 similar events)
[2025-06-02 18:14:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:14:13] [INFO ] State equation strengthened by 33 read => feed constraints.
[2025-06-02 18:14:13] [INFO ] Implicit Places using invariants and state equation in 289 ms returned []
Implicit Place search using SMT with State Equation took 415 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 18:14:13] [INFO ] Redundant transitions in 24 ms returned []
Running 211 sub problems to find dead transitions.
[2025-06-02 18:14:13] [INFO ] Flow matrix only has 190 transitions (discarded 26 similar events)
[2025-06-02 18:14:13] [INFO ] Invariant cache hit.
[2025-06-02 18:14:13] [INFO ] State equation strengthened by 33 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/81 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 2 (OVERLAPS) 1/82 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 211 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:14:15] [INFO ] Deduced a trap composed of 40 places in 118 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:14:16] [INFO ] Deduced a trap composed of 41 places in 119 ms of which 8 ms to minimize.
Problem TDEAD17 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:14:16] [INFO ] Deduced a trap composed of 40 places in 100 ms of which 7 ms to minimize.
Problem TDEAD19 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:14:16] [INFO ] Deduced a trap composed of 43 places in 115 ms of which 20 ms to minimize.
Problem TDEAD27 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD39 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:14:16] [INFO ] Deduced a trap composed of 43 places in 118 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:14:16] [INFO ] Deduced a trap composed of 41 places in 113 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:14:16] [INFO ] Deduced a trap composed of 21 places in 133 ms of which 13 ms to minimize.
Problem TDEAD58 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:14:17] [INFO ] Deduced a trap composed of 28 places in 132 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:14:17] [INFO ] Deduced a trap composed of 35 places in 130 ms of which 14 ms to minimize.
Problem TDEAD89 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD205 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/82 variables, 9/13 constraints. Problems are: Problem set: 24 solved, 187 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:14:19] [INFO ] Deduced a trap composed of 39 places in 123 ms of which 7 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/82 variables, 1/14 constraints. Problems are: Problem set: 24 solved, 187 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/82 variables, 0/14 constraints. Problems are: Problem set: 24 solved, 187 unsolved
At refinement iteration 6 (OVERLAPS) 189/271 variables, 82/96 constraints. Problems are: Problem set: 24 solved, 187 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/271 variables, 32/128 constraints. Problems are: Problem set: 24 solved, 187 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/271 variables, 0/128 constraints. Problems are: Problem set: 24 solved, 187 unsolved
At refinement iteration 9 (OVERLAPS) 1/272 variables, 1/129 constraints. Problems are: Problem set: 24 solved, 187 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/272 variables, 0/129 constraints. Problems are: Problem set: 24 solved, 187 unsolved
At refinement iteration 11 (OVERLAPS) 0/272 variables, 0/129 constraints. Problems are: Problem set: 24 solved, 187 unsolved
No progress, stopping.
After SMT solving in domain Real declared 272/272 variables, and 129 constraints, problems are : Problem set: 24 solved, 187 unsolved in 18426 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 82/82 constraints, ReadFeed: 33/33 constraints, PredecessorRefiner: 211/211 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 24 solved, 187 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 1/1 constraints. Problems are: Problem set: 24 solved, 187 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/81 variables, 5/6 constraints. Problems are: Problem set: 24 solved, 187 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/81 variables, 0/6 constraints. Problems are: Problem set: 24 solved, 187 unsolved
At refinement iteration 3 (OVERLAPS) 1/82 variables, 3/9 constraints. Problems are: Problem set: 24 solved, 187 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/82 variables, 5/14 constraints. Problems are: Problem set: 24 solved, 187 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/82 variables, 0/14 constraints. Problems are: Problem set: 24 solved, 187 unsolved
At refinement iteration 6 (OVERLAPS) 189/271 variables, 82/96 constraints. Problems are: Problem set: 24 solved, 187 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/271 variables, 32/128 constraints. Problems are: Problem set: 24 solved, 187 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/271 variables, 187/315 constraints. Problems are: Problem set: 24 solved, 187 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/271 variables, 0/315 constraints. Problems are: Problem set: 24 solved, 187 unsolved
At refinement iteration 10 (OVERLAPS) 1/272 variables, 1/316 constraints. Problems are: Problem set: 24 solved, 187 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/272 variables, 0/316 constraints. Problems are: Problem set: 24 solved, 187 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 272/272 variables, and 316 constraints, problems are : Problem set: 24 solved, 187 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 82/82 constraints, ReadFeed: 33/33 constraints, PredecessorRefiner: 187/211 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 48552ms problems are : Problem set: 24 solved, 187 unsolved
Search for dead transitions found 24 dead transitions in 48554ms
Found 24 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 24 transitions
Dead transitions reduction (with SMT) removed 24 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 82/199 places, 192/303 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 81 transition count 197
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 81 transition count 196
Applied a total of 3 rules in 21 ms. Remains 81 /82 variables (removed 1) and now considering 196/192 (removed -4) transitions.
[2025-06-02 18:15:01] [INFO ] Flow matrix only has 170 transitions (discarded 26 similar events)
// Phase 1: matrix 170 rows 81 cols
[2025-06-02 18:15:01] [INFO ] Computed 4 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:15:01] [INFO ] Implicit Places using invariants in 160 ms returned []
[2025-06-02 18:15:01] [INFO ] Flow matrix only has 170 transitions (discarded 26 similar events)
[2025-06-02 18:15:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:15:02] [INFO ] State equation strengthened by 26 read => feed constraints.
[2025-06-02 18:15:02] [INFO ] Implicit Places using invariants and state equation in 315 ms returned []
Implicit Place search using SMT with State Equation took 477 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 81/199 places, 196/303 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 49548 ms. Remains : 81/199 places, 196/303 transitions.
Stuttering acceptance computed with spot in 54 ms :[(NOT p0)]
Running random walk in product with property : FireWire-PT-16-LTLCardinality-08
Stuttering criterion allowed to conclude after 168 steps with 24 reset in 1 ms.
FORMULA FireWire-PT-16-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-16-LTLCardinality-08 finished in 49619 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(F((p0&&F(p1)&&F(p2)))))'
Support contains 2 out of 199 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 199/199 places, 303/303 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 182 transition count 284
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 182 transition count 284
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 35 place count 182 transition count 283
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 41 place count 176 transition count 276
Iterating global reduction 1 with 6 rules applied. Total rules applied 47 place count 176 transition count 276
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 48 place count 175 transition count 275
Iterating global reduction 1 with 1 rules applied. Total rules applied 49 place count 175 transition count 275
Applied a total of 49 rules in 9 ms. Remains 175 /199 variables (removed 24) and now considering 275/303 (removed 28) transitions.
// Phase 1: matrix 275 rows 175 cols
[2025-06-02 18:15:02] [INFO ] Computed 4 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:15:02] [INFO ] Implicit Places using invariants in 198 ms returned []
[2025-06-02 18:15:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:15:02] [INFO ] Implicit Places using invariants and state equation in 392 ms returned []
Implicit Place search using SMT with State Equation took 593 ms to find 0 implicit places.
Running 274 sub problems to find dead transitions.
[2025-06-02 18:15:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/174 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 1 (OVERLAPS) 1/175 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 274 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:15:09] [INFO ] Deduced a trap composed of 74 places in 163 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:15:09] [INFO ] Deduced a trap composed of 54 places in 206 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:15:09] [INFO ] Deduced a trap composed of 77 places in 147 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:15:09] [INFO ] Deduced a trap composed of 56 places in 190 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:15:09] [INFO ] Deduced a trap composed of 51 places in 175 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:15:10] [INFO ] Deduced a trap composed of 52 places in 199 ms of which 35 ms to minimize.
Problem TDEAD147 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD221 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD239 is UNSAT
Problem TDEAD240 is UNSAT
Problem TDEAD243 is UNSAT
Problem TDEAD244 is UNSAT
Problem TDEAD247 is UNSAT
Problem TDEAD248 is UNSAT
Problem TDEAD251 is UNSAT
Problem TDEAD252 is UNSAT
Problem TDEAD257 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/175 variables, 6/10 constraints. Problems are: Problem set: 15 solved, 259 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:15:12] [INFO ] Deduced a trap composed of 49 places in 174 ms of which 16 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/175 variables, 1/11 constraints. Problems are: Problem set: 15 solved, 259 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/175 variables, 0/11 constraints. Problems are: Problem set: 15 solved, 259 unsolved
At refinement iteration 5 (OVERLAPS) 275/450 variables, 175/186 constraints. Problems are: Problem set: 15 solved, 259 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:15:20] [INFO ] Deduced a trap composed of 60 places in 198 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:15:21] [INFO ] Deduced a trap composed of 92 places in 173 ms of which 17 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/450 variables, 2/188 constraints. Problems are: Problem set: 15 solved, 259 unsolved
Error getting values : (error "ParserException while parsing response: ((t0 1.0)
(t1 1.0)
(t2 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 450/450 variables, and 188 constraints, problems are : Problem set: 15 solved, 259 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 175/175 constraints, PredecessorRefiner: 274/274 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 15 solved, 259 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/174 variables, 0/0 constraints. Problems are: Problem set: 15 solved, 259 unsolved
At refinement iteration 1 (OVERLAPS) 1/175 variables, 4/4 constraints. Problems are: Problem set: 15 solved, 259 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/175 variables, 9/13 constraints. Problems are: Problem set: 15 solved, 259 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/175 variables, 0/13 constraints. Problems are: Problem set: 15 solved, 259 unsolved
At refinement iteration 4 (OVERLAPS) 275/450 variables, 175/188 constraints. Problems are: Problem set: 15 solved, 259 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/450 variables, 259/447 constraints. Problems are: Problem set: 15 solved, 259 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:15:40] [INFO ] Deduced a trap composed of 71 places in 108 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:15:40] [INFO ] Deduced a trap composed of 46 places in 100 ms of which 7 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/450 variables, 2/449 constraints. Problems are: Problem set: 15 solved, 259 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:15:54] [INFO ] Deduced a trap along path composed of 11 places in 64 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/450 variables, 1/450 constraints. Problems are: Problem set: 15 solved, 259 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 450/450 variables, and 450 constraints, problems are : Problem set: 15 solved, 259 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 175/175 constraints, PredecessorRefiner: 259/274 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 60077ms problems are : Problem set: 15 solved, 259 unsolved
Search for dead transitions found 15 dead transitions in 60079ms
Found 15 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 15 transitions
Dead transitions reduction (with SMT) removed 15 transitions
Starting structural reductions in LTL mode, iteration 1 : 175/199 places, 260/303 transitions.
Applied a total of 0 rules in 3 ms. Remains 175 /175 variables (removed 0) and now considering 260/260 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 60686 ms. Remains : 175/199 places, 260/303 transitions.
Stuttering acceptance computed with spot in 253 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), (NOT p1), (NOT p2)]
Running random walk in product with property : FireWire-PT-16-LTLCardinality-09
Stuttering criterion allowed to conclude after 58 steps with 0 reset in 0 ms.
FORMULA FireWire-PT-16-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-16-LTLCardinality-09 finished in 60966 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 199 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 199/199 places, 303/303 transitions.
Graph (trivial) has 162 edges and 199 vertex of which 14 / 199 are part of one of the 2 SCC in 1 ms
Free SCC test removed 12 places
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 42 transitions
Trivial Post-agglo rules discarded 42 transitions
Performed 42 trivial Post agglomeration. Transition count delta: 42
Iterating post reduction 0 with 42 rules applied. Total rules applied 43 place count 186 transition count 247
Reduce places removed 42 places and 0 transitions.
Iterating post reduction 1 with 42 rules applied. Total rules applied 85 place count 144 transition count 247
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 85 place count 144 transition count 235
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 109 place count 132 transition count 235
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 122 place count 119 transition count 202
Iterating global reduction 2 with 13 rules applied. Total rules applied 135 place count 119 transition count 202
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 4 rules applied. Total rules applied 139 place count 119 transition count 198
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 140 place count 118 transition count 198
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 5 Pre rules applied. Total rules applied 140 place count 118 transition count 193
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 150 place count 113 transition count 193
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 151 place count 112 transition count 192
Iterating global reduction 4 with 1 rules applied. Total rules applied 152 place count 112 transition count 192
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 4 with 32 rules applied. Total rules applied 184 place count 96 transition count 176
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: -67
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 4 with 32 rules applied. Total rules applied 216 place count 80 transition count 243
Drop transitions (Redundant composition of simpler transitions.) removed 30 transitions
Redundant transition composition rules discarded 30 transitions
Iterating global reduction 4 with 30 rules applied. Total rules applied 246 place count 80 transition count 213
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 247 place count 79 transition count 212
Applied a total of 247 rules in 58 ms. Remains 79 /199 variables (removed 120) and now considering 212/303 (removed 91) transitions.
[2025-06-02 18:16:03] [INFO ] Flow matrix only has 186 transitions (discarded 26 similar events)
// Phase 1: matrix 186 rows 79 cols
[2025-06-02 18:16:03] [INFO ] Computed 4 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:16:03] [INFO ] Implicit Places using invariants in 188 ms returned []
[2025-06-02 18:16:03] [INFO ] Flow matrix only has 186 transitions (discarded 26 similar events)
[2025-06-02 18:16:03] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:16:03] [INFO ] State equation strengthened by 34 read => feed constraints.
[2025-06-02 18:16:04] [INFO ] Implicit Places using invariants and state equation in 532 ms returned []
Implicit Place search using SMT with State Equation took 726 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 18:16:04] [INFO ] Redundant transitions in 5 ms returned []
Running 208 sub problems to find dead transitions.
[2025-06-02 18:16:04] [INFO ] Flow matrix only has 186 transitions (discarded 26 similar events)
[2025-06-02 18:16:04] [INFO ] Invariant cache hit.
[2025-06-02 18:16:04] [INFO ] State equation strengthened by 34 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/78 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/78 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 2 (OVERLAPS) 1/79 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 208 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:16:06] [INFO ] Deduced a trap composed of 35 places in 117 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:16:07] [INFO ] Deduced a trap composed of 41 places in 125 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:16:07] [INFO ] Deduced a trap composed of 42 places in 111 ms of which 8 ms to minimize.
Problem TDEAD16 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:16:07] [INFO ] Deduced a trap composed of 41 places in 103 ms of which 6 ms to minimize.
Problem TDEAD18 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:16:07] [INFO ] Deduced a trap composed of 44 places in 120 ms of which 14 ms to minimize.
Problem TDEAD28 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD40 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:16:07] [INFO ] Deduced a trap composed of 44 places in 125 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:16:07] [INFO ] Deduced a trap composed of 42 places in 115 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:16:08] [INFO ] Deduced a trap composed of 21 places in 122 ms of which 7 ms to minimize.
Problem TDEAD59 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:16:08] [INFO ] Deduced a trap composed of 28 places in 107 ms of which 8 ms to minimize.
Problem TDEAD89 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD197 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/79 variables, 9/13 constraints. Problems are: Problem set: 24 solved, 184 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/79 variables, 0/13 constraints. Problems are: Problem set: 24 solved, 184 unsolved
At refinement iteration 5 (OVERLAPS) 185/264 variables, 79/92 constraints. Problems are: Problem set: 24 solved, 184 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/264 variables, 33/125 constraints. Problems are: Problem set: 24 solved, 184 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/264 variables, 0/125 constraints. Problems are: Problem set: 24 solved, 184 unsolved
At refinement iteration 8 (OVERLAPS) 1/265 variables, 1/126 constraints. Problems are: Problem set: 24 solved, 184 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/265 variables, 0/126 constraints. Problems are: Problem set: 24 solved, 184 unsolved
At refinement iteration 10 (OVERLAPS) 0/265 variables, 0/126 constraints. Problems are: Problem set: 24 solved, 184 unsolved
No progress, stopping.
After SMT solving in domain Real declared 265/265 variables, and 126 constraints, problems are : Problem set: 24 solved, 184 unsolved in 17156 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 79/79 constraints, ReadFeed: 34/34 constraints, PredecessorRefiner: 208/208 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 24 solved, 184 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/78 variables, 1/1 constraints. Problems are: Problem set: 24 solved, 184 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/78 variables, 4/5 constraints. Problems are: Problem set: 24 solved, 184 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/78 variables, 0/5 constraints. Problems are: Problem set: 24 solved, 184 unsolved
At refinement iteration 3 (OVERLAPS) 1/79 variables, 3/8 constraints. Problems are: Problem set: 24 solved, 184 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/79 variables, 5/13 constraints. Problems are: Problem set: 24 solved, 184 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/79 variables, 0/13 constraints. Problems are: Problem set: 24 solved, 184 unsolved
At refinement iteration 6 (OVERLAPS) 185/264 variables, 79/92 constraints. Problems are: Problem set: 24 solved, 184 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/264 variables, 33/125 constraints. Problems are: Problem set: 24 solved, 184 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/264 variables, 184/309 constraints. Problems are: Problem set: 24 solved, 184 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/264 variables, 0/309 constraints. Problems are: Problem set: 24 solved, 184 unsolved
At refinement iteration 10 (OVERLAPS) 1/265 variables, 1/310 constraints. Problems are: Problem set: 24 solved, 184 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/265 variables, 0/310 constraints. Problems are: Problem set: 24 solved, 184 unsolved
At refinement iteration 12 (OVERLAPS) 0/265 variables, 0/310 constraints. Problems are: Problem set: 24 solved, 184 unsolved
No progress, stopping.
After SMT solving in domain Int declared 265/265 variables, and 310 constraints, problems are : Problem set: 24 solved, 184 unsolved in 27849 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 79/79 constraints, ReadFeed: 34/34 constraints, PredecessorRefiner: 184/208 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 45063ms problems are : Problem set: 24 solved, 184 unsolved
Search for dead transitions found 24 dead transitions in 45066ms
Found 24 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 24 transitions
Dead transitions reduction (with SMT) removed 24 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 79/199 places, 188/303 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 78 transition count 193
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 78 transition count 192
Applied a total of 3 rules in 11 ms. Remains 78 /79 variables (removed 1) and now considering 192/188 (removed -4) transitions.
[2025-06-02 18:16:49] [INFO ] Flow matrix only has 166 transitions (discarded 26 similar events)
// Phase 1: matrix 166 rows 78 cols
[2025-06-02 18:16:49] [INFO ] Computed 4 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:16:49] [INFO ] Implicit Places using invariants in 148 ms returned []
[2025-06-02 18:16:49] [INFO ] Flow matrix only has 166 transitions (discarded 26 similar events)
[2025-06-02 18:16:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:16:49] [INFO ] State equation strengthened by 27 read => feed constraints.
[2025-06-02 18:16:49] [INFO ] Implicit Places using invariants and state equation in 280 ms returned []
Implicit Place search using SMT with State Equation took 430 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 78/199 places, 192/303 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 46304 ms. Remains : 78/199 places, 192/303 transitions.
Stuttering acceptance computed with spot in 110 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FireWire-PT-16-LTLCardinality-10
Stuttering criterion allowed to conclude after 69 steps with 11 reset in 0 ms.
FORMULA FireWire-PT-16-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-16-LTLCardinality-10 finished in 46434 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((p0&&(p1 U G((p2||((p1 U p3) U p0))))) U p2)))'
Support contains 6 out of 199 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 199/199 places, 303/303 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 182 transition count 275
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 182 transition count 275
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 35 place count 182 transition count 274
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 39 place count 178 transition count 269
Iterating global reduction 1 with 4 rules applied. Total rules applied 43 place count 178 transition count 269
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 44 place count 177 transition count 268
Iterating global reduction 1 with 1 rules applied. Total rules applied 45 place count 177 transition count 268
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 46 place count 176 transition count 267
Iterating global reduction 1 with 1 rules applied. Total rules applied 47 place count 176 transition count 267
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 48 place count 175 transition count 266
Iterating global reduction 1 with 1 rules applied. Total rules applied 49 place count 175 transition count 266
Applied a total of 49 rules in 12 ms. Remains 175 /199 variables (removed 24) and now considering 266/303 (removed 37) transitions.
// Phase 1: matrix 266 rows 175 cols
[2025-06-02 18:16:49] [INFO ] Computed 4 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:16:49] [INFO ] Implicit Places using invariants in 207 ms returned []
[2025-06-02 18:16:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:16:50] [INFO ] Implicit Places using invariants and state equation in 359 ms returned []
Implicit Place search using SMT with State Equation took 577 ms to find 0 implicit places.
Running 265 sub problems to find dead transitions.
[2025-06-02 18:16:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/174 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 1 (OVERLAPS) 1/175 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 265 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:16:55] [INFO ] Deduced a trap composed of 28 places in 89 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:16:56] [INFO ] Deduced a trap composed of 74 places in 136 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:16:56] [INFO ] Deduced a trap composed of 77 places in 156 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:16:56] [INFO ] Deduced a trap composed of 49 places in 151 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:16:57] [INFO ] Deduced a trap composed of 52 places in 198 ms of which 37 ms to minimize.
Problem TDEAD147 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD155 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:16:58] [INFO ] Deduced a trap composed of 74 places in 176 ms of which 32 ms to minimize.
Problem TDEAD213 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD226 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD234 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD238 is UNSAT
Problem TDEAD241 is UNSAT
Problem TDEAD242 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:16:58] [INFO ] Deduced a trap composed of 54 places in 170 ms of which 22 ms to minimize.
Problem TDEAD247 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:16:58] [INFO ] Deduced a trap composed of 77 places in 129 ms of which 13 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/175 variables, 8/12 constraints. Problems are: Problem set: 15 solved, 250 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/175 variables, 0/12 constraints. Problems are: Problem set: 15 solved, 250 unsolved
At refinement iteration 4 (OVERLAPS) 266/441 variables, 175/187 constraints. Problems are: Problem set: 15 solved, 250 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:17:05] [INFO ] Deduced a trap composed of 82 places in 138 ms of which 19 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/441 variables, 1/188 constraints. Problems are: Problem set: 15 solved, 250 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/441 variables, 0/188 constraints. Problems are: Problem set: 15 solved, 250 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:17:18] [INFO ] Deduced a trap composed of 93 places in 164 ms of which 30 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 441/441 variables, and 189 constraints, problems are : Problem set: 15 solved, 250 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 175/175 constraints, PredecessorRefiner: 265/265 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 15 solved, 250 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/174 variables, 0/0 constraints. Problems are: Problem set: 15 solved, 250 unsolved
At refinement iteration 1 (OVERLAPS) 1/175 variables, 4/4 constraints. Problems are: Problem set: 15 solved, 250 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/175 variables, 10/14 constraints. Problems are: Problem set: 15 solved, 250 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/175 variables, 0/14 constraints. Problems are: Problem set: 15 solved, 250 unsolved
At refinement iteration 4 (OVERLAPS) 266/441 variables, 175/189 constraints. Problems are: Problem set: 15 solved, 250 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/441 variables, 250/439 constraints. Problems are: Problem set: 15 solved, 250 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:17:27] [INFO ] Deduced a trap composed of 46 places in 159 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:17:29] [INFO ] Deduced a trap composed of 72 places in 110 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:17:29] [INFO ] Deduced a trap composed of 75 places in 192 ms of which 25 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/441 variables, 3/442 constraints. Problems are: Problem set: 15 solved, 250 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:17:36] [INFO ] Deduced a trap composed of 29 places in 86 ms of which 5 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/441 variables, 1/443 constraints. Problems are: Problem set: 15 solved, 250 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:17:49] [INFO ] Deduced a trap along path composed of 12 places in 50 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((t0 1)
(t1 1)
(t2 1)
(t3 1)
(t4 1)
(t5 1)
(t6 0)
(t7 0)
(t8 1)
(t9 1)
(t10 1)
(t11 1)
(t12 0)
(t13 0)
(t14 0)
(t15 0)
(t16 0)
(t17 0)
(t18 0)
(t19 0)
(t20 0)
(t21 1)
(t22 1)
(t23 1)
(t24 0)
(t25 0)
(t26 0)
(t27 0)
(t28 0)
(t29 0)
(t30 0)
(t31 0)
(t32 1)
(t33 0)
(t34 0)
(t35 0)
(t36 0)
(t37 0)
(t38 0)
(t39 0)
(t40 0)
(t41 0)
(t42 1)
(t43 1)
(t44 0)
(t45 0)
(t46 0)
(t47 0)
(t48 0)
(t49 0)
(t50 0)
(t51 1)
(t52 0)
(t53 0)
(t54 0)
(t55 0)
(t56 0)
(t57 0)
(t58 0)
(t59 0)
(t60 1)
(t61 1)
(t62 3)
(t63 3)
(t64 1)
(t65 0)
(t66 2)
(t67 0)
(t68 0)
(t69 2)
(t70 2)
(t71 0)
(t72 0)
(t73 2)
(t74 1)
(t75 1)
(t76 0)
(t77 1)
(t78 1)
(t79 1)
(t80 0)
(t81 0)
(t82 1)
(t83 0)
(t84 0)
(t85 0)
(t86 0)
(t87 1)
(t88 0)
(t89 0)
(t90 0)
(t91 0)
(t92 0)
(t93 2)
(t94 2)
(t95 1)
(t96 4)
(t97 0)
(t98 0)
(t99 2)timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 441/441 variables, and 444 constraints, problems are : Problem set: 15 solved, 250 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 175/175 constraints, PredecessorRefiner: 250/265 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 60069ms problems are : Problem set: 15 solved, 250 unsolved
Search for dead transitions found 15 dead transitions in 60070ms
Found 15 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 15 transitions
Dead transitions reduction (with SMT) removed 15 transitions
Starting structural reductions in LTL mode, iteration 1 : 175/199 places, 251/303 transitions.
Applied a total of 0 rules in 2 ms. Remains 175 /175 variables (removed 0) and now considering 251/251 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 60663 ms. Remains : 175/199 places, 251/303 transitions.
Stuttering acceptance computed with spot in 737 ms :[(NOT p2), (NOT p2), true, (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p3), (NOT p0), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p3))]
Running random walk in product with property : FireWire-PT-16-LTLCardinality-11
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA FireWire-PT-16-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-16-LTLCardinality-11 finished in 61451 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(((p0 U !p1) U (X(G(p0))&&F(p1)))))'
Support contains 3 out of 199 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 199/199 places, 303/303 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 183 transition count 276
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 183 transition count 276
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 33 place count 183 transition count 275
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 39 place count 177 transition count 268
Iterating global reduction 1 with 6 rules applied. Total rules applied 45 place count 177 transition count 268
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 46 place count 176 transition count 267
Iterating global reduction 1 with 1 rules applied. Total rules applied 47 place count 176 transition count 267
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 48 place count 175 transition count 266
Iterating global reduction 1 with 1 rules applied. Total rules applied 49 place count 175 transition count 266
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 50 place count 174 transition count 265
Iterating global reduction 1 with 1 rules applied. Total rules applied 51 place count 174 transition count 265
Applied a total of 51 rules in 16 ms. Remains 174 /199 variables (removed 25) and now considering 265/303 (removed 38) transitions.
// Phase 1: matrix 265 rows 174 cols
[2025-06-02 18:17:51] [INFO ] Computed 4 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:17:51] [INFO ] Implicit Places using invariants in 181 ms returned []
[2025-06-02 18:17:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:17:51] [INFO ] Implicit Places using invariants and state equation in 406 ms returned []
Implicit Place search using SMT with State Equation took 590 ms to find 0 implicit places.
Running 264 sub problems to find dead transitions.
[2025-06-02 18:17:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/173 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 1 (OVERLAPS) 1/174 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 264 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:17:57] [INFO ] Deduced a trap composed of 75 places in 151 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:17:57] [INFO ] Deduced a trap composed of 78 places in 154 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:17:57] [INFO ] Deduced a trap composed of 49 places in 140 ms of which 12 ms to minimize.
Problem TDEAD147 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD155 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:17:58] [INFO ] Deduced a trap composed of 75 places in 157 ms of which 22 ms to minimize.
Problem TDEAD213 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD226 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD234 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD238 is UNSAT
Problem TDEAD241 is UNSAT
Problem TDEAD242 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:17:58] [INFO ] Deduced a trap composed of 54 places in 176 ms of which 33 ms to minimize.
Problem TDEAD247 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/174 variables, 5/9 constraints. Problems are: Problem set: 15 solved, 249 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:18:00] [INFO ] Deduced a trap composed of 52 places in 208 ms of which 39 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/174 variables, 1/10 constraints. Problems are: Problem set: 15 solved, 249 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/174 variables, 0/10 constraints. Problems are: Problem set: 15 solved, 249 unsolved
At refinement iteration 5 (OVERLAPS) 265/439 variables, 174/184 constraints. Problems are: Problem set: 15 solved, 249 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:18:07] [INFO ] Deduced a trap composed of 60 places in 189 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:18:08] [INFO ] Deduced a trap composed of 94 places in 159 ms of which 17 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/439 variables, 2/186 constraints. Problems are: Problem set: 15 solved, 249 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:18:15] [INFO ] Deduced a trap composed of 46 places in 148 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:18:15] [INFO ] Deduced a trap composed of 72 places in 151 ms of which 27 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/439 variables, 2/188 constraints. Problems are: Problem set: 15 solved, 249 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 439/439 variables, and 188 constraints, problems are : Problem set: 15 solved, 249 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 174/174 constraints, PredecessorRefiner: 264/264 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 15 solved, 249 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/173 variables, 0/0 constraints. Problems are: Problem set: 15 solved, 249 unsolved
At refinement iteration 1 (OVERLAPS) 1/174 variables, 4/4 constraints. Problems are: Problem set: 15 solved, 249 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/174 variables, 10/14 constraints. Problems are: Problem set: 15 solved, 249 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/174 variables, 0/14 constraints. Problems are: Problem set: 15 solved, 249 unsolved
At refinement iteration 4 (OVERLAPS) 265/439 variables, 174/188 constraints. Problems are: Problem set: 15 solved, 249 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/439 variables, 249/437 constraints. Problems are: Problem set: 15 solved, 249 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:18:30] [INFO ] Deduced a trap composed of 74 places in 162 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:18:30] [INFO ] Deduced a trap composed of 77 places in 204 ms of which 37 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/439 variables, 2/439 constraints. Problems are: Problem set: 15 solved, 249 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:18:41] [INFO ] Deduced a trap along path composed of 10 places in 68 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/439 variables, 1/440 constraints. Problems are: Problem set: 15 solved, 249 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 439/439 variables, and 440 constraints, problems are : Problem set: 15 solved, 249 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 174/174 constraints, PredecessorRefiner: 249/264 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 60091ms problems are : Problem set: 15 solved, 249 unsolved
Search for dead transitions found 15 dead transitions in 60094ms
Found 15 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 15 transitions
Dead transitions reduction (with SMT) removed 15 transitions
Starting structural reductions in LTL mode, iteration 1 : 174/199 places, 250/303 transitions.
Applied a total of 0 rules in 2 ms. Remains 174 /174 variables (removed 0) and now considering 250/250 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 60705 ms. Remains : 174/199 places, 250/303 transitions.
Stuttering acceptance computed with spot in 301 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (NOT p1), (AND p1 (NOT p0)), true]
Running random walk in product with property : FireWire-PT-16-LTLCardinality-12
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA FireWire-PT-16-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-16-LTLCardinality-12 finished in 61040 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 199 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 199/199 places, 303/303 transitions.
Graph (trivial) has 163 edges and 199 vertex of which 18 / 199 are part of one of the 3 SCC in 1 ms
Free SCC test removed 15 places
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 41 transitions
Trivial Post-agglo rules discarded 41 transitions
Performed 41 trivial Post agglomeration. Transition count delta: 41
Iterating post reduction 0 with 41 rules applied. Total rules applied 42 place count 183 transition count 245
Reduce places removed 41 places and 0 transitions.
Iterating post reduction 1 with 41 rules applied. Total rules applied 83 place count 142 transition count 245
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 83 place count 142 transition count 233
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 107 place count 130 transition count 233
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 119 place count 118 transition count 201
Iterating global reduction 2 with 12 rules applied. Total rules applied 131 place count 118 transition count 201
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 4 rules applied. Total rules applied 135 place count 118 transition count 197
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 136 place count 117 transition count 197
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 4 Pre rules applied. Total rules applied 136 place count 117 transition count 193
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 144 place count 113 transition count 193
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 145 place count 112 transition count 192
Iterating global reduction 4 with 1 rules applied. Total rules applied 146 place count 112 transition count 192
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 4 with 34 rules applied. Total rules applied 180 place count 95 transition count 175
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: -74
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 4 with 34 rules applied. Total rules applied 214 place count 78 transition count 249
Drop transitions (Redundant composition of simpler transitions.) removed 37 transitions
Redundant transition composition rules discarded 37 transitions
Iterating global reduction 4 with 37 rules applied. Total rules applied 251 place count 78 transition count 212
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 252 place count 77 transition count 211
Applied a total of 252 rules in 42 ms. Remains 77 /199 variables (removed 122) and now considering 211/303 (removed 92) transitions.
[2025-06-02 18:18:52] [INFO ] Flow matrix only has 184 transitions (discarded 27 similar events)
// Phase 1: matrix 184 rows 77 cols
[2025-06-02 18:18:52] [INFO ] Computed 4 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:18:52] [INFO ] Implicit Places using invariants in 163 ms returned []
[2025-06-02 18:18:52] [INFO ] Flow matrix only has 184 transitions (discarded 27 similar events)
[2025-06-02 18:18:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:18:52] [INFO ] State equation strengthened by 34 read => feed constraints.
[2025-06-02 18:18:52] [INFO ] Implicit Places using invariants and state equation in 306 ms returned []
Implicit Place search using SMT with State Equation took 473 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 18:18:52] [INFO ] Redundant transitions in 4 ms returned []
Running 207 sub problems to find dead transitions.
[2025-06-02 18:18:52] [INFO ] Flow matrix only has 184 transitions (discarded 27 similar events)
[2025-06-02 18:18:52] [INFO ] Invariant cache hit.
[2025-06-02 18:18:52] [INFO ] State equation strengthened by 34 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/76 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 2 (OVERLAPS) 1/77 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 207 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:18:55] [INFO ] Deduced a trap composed of 41 places in 129 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:18:55] [INFO ] Deduced a trap composed of 43 places in 119 ms of which 14 ms to minimize.
Problem TDEAD14 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:18:55] [INFO ] Deduced a trap composed of 42 places in 120 ms of which 14 ms to minimize.
Problem TDEAD16 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:18:55] [INFO ] Deduced a trap composed of 42 places in 108 ms of which 11 ms to minimize.
Problem TDEAD26 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD38 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:18:56] [INFO ] Deduced a trap composed of 20 places in 116 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:18:56] [INFO ] Deduced a trap composed of 26 places in 124 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:18:56] [INFO ] Deduced a trap composed of 19 places in 109 ms of which 11 ms to minimize.
Problem TDEAD56 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:18:56] [INFO ] Deduced a trap composed of 34 places in 118 ms of which 14 ms to minimize.
Problem TDEAD80 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD196 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/77 variables, 8/12 constraints. Problems are: Problem set: 24 solved, 183 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/77 variables, 0/12 constraints. Problems are: Problem set: 24 solved, 183 unsolved
At refinement iteration 5 (OVERLAPS) 183/260 variables, 77/89 constraints. Problems are: Problem set: 24 solved, 183 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/260 variables, 34/123 constraints. Problems are: Problem set: 24 solved, 183 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/260 variables, 0/123 constraints. Problems are: Problem set: 24 solved, 183 unsolved
At refinement iteration 8 (OVERLAPS) 0/260 variables, 0/123 constraints. Problems are: Problem set: 24 solved, 183 unsolved
No progress, stopping.
After SMT solving in domain Real declared 260/261 variables, and 123 constraints, problems are : Problem set: 24 solved, 183 unsolved in 11395 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 77/77 constraints, ReadFeed: 34/34 constraints, PredecessorRefiner: 207/207 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 24 solved, 183 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 1/1 constraints. Problems are: Problem set: 24 solved, 183 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/76 variables, 5/6 constraints. Problems are: Problem set: 24 solved, 183 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/76 variables, 0/6 constraints. Problems are: Problem set: 24 solved, 183 unsolved
At refinement iteration 3 (OVERLAPS) 1/77 variables, 3/9 constraints. Problems are: Problem set: 24 solved, 183 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/77 variables, 3/12 constraints. Problems are: Problem set: 24 solved, 183 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/77 variables, 0/12 constraints. Problems are: Problem set: 24 solved, 183 unsolved
At refinement iteration 6 (OVERLAPS) 183/260 variables, 77/89 constraints. Problems are: Problem set: 24 solved, 183 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/260 variables, 34/123 constraints. Problems are: Problem set: 24 solved, 183 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/260 variables, 183/306 constraints. Problems are: Problem set: 24 solved, 183 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/260 variables, 0/306 constraints. Problems are: Problem set: 24 solved, 183 unsolved
At refinement iteration 10 (OVERLAPS) 0/260 variables, 0/306 constraints. Problems are: Problem set: 24 solved, 183 unsolved
No progress, stopping.
After SMT solving in domain Int declared 260/261 variables, and 306 constraints, problems are : Problem set: 24 solved, 183 unsolved in 19330 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 77/77 constraints, ReadFeed: 34/34 constraints, PredecessorRefiner: 183/207 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 30785ms problems are : Problem set: 24 solved, 183 unsolved
Search for dead transitions found 24 dead transitions in 30788ms
Found 24 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 24 transitions
Dead transitions reduction (with SMT) removed 24 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 77/199 places, 187/303 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 76 transition count 192
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 76 transition count 191
Applied a total of 3 rules in 8 ms. Remains 76 /77 variables (removed 1) and now considering 191/187 (removed -4) transitions.
[2025-06-02 18:19:23] [INFO ] Flow matrix only has 164 transitions (discarded 27 similar events)
// Phase 1: matrix 164 rows 76 cols
[2025-06-02 18:19:23] [INFO ] Computed 4 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:19:23] [INFO ] Implicit Places using invariants in 149 ms returned []
[2025-06-02 18:19:23] [INFO ] Flow matrix only has 164 transitions (discarded 27 similar events)
[2025-06-02 18:19:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:19:23] [INFO ] State equation strengthened by 27 read => feed constraints.
[2025-06-02 18:19:24] [INFO ] Implicit Places using invariants and state equation in 297 ms returned []
Implicit Place search using SMT with State Equation took 448 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 76/199 places, 191/303 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 31772 ms. Remains : 76/199 places, 191/303 transitions.
Stuttering acceptance computed with spot in 107 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FireWire-PT-16-LTLCardinality-13
Product exploration explored 100000 steps with 0 reset in 188 ms.
Product exploration explored 100000 steps with 0 reset in 184 ms.
Computed a total of 3 stabilizing places and 7 stable transitions
Computed a total of 3 stabilizing places and 7 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 114 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 101 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (5485 resets) in 84 ms. (470 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (1784 resets) in 59 ms. (666 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 3886 steps, run visited all 1 properties in 21 ms. (steps per millisecond=185 )
Probabilistic random walk after 3886 steps, saw 1458 distinct states, run finished after 21 ms. (steps per millisecond=185 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 117 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 88 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 80 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 76 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 76/76 places, 191/191 transitions.
Applied a total of 0 rules in 5 ms. Remains 76 /76 variables (removed 0) and now considering 191/191 (removed 0) transitions.
[2025-06-02 18:19:25] [INFO ] Flow matrix only has 164 transitions (discarded 27 similar events)
[2025-06-02 18:19:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:19:25] [INFO ] Implicit Places using invariants in 114 ms returned []
[2025-06-02 18:19:25] [INFO ] Flow matrix only has 164 transitions (discarded 27 similar events)
[2025-06-02 18:19:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:19:25] [INFO ] State equation strengthened by 27 read => feed constraints.
[2025-06-02 18:19:25] [INFO ] Implicit Places using invariants and state equation in 293 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 18:19:25] [INFO ] Redundant transitions in 3 ms returned []
Running 187 sub problems to find dead transitions.
[2025-06-02 18:19:25] [INFO ] Flow matrix only has 164 transitions (discarded 27 similar events)
[2025-06-02 18:19:25] [INFO ] Invariant cache hit.
[2025-06-02 18:19:25] [INFO ] State equation strengthened by 27 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/75 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 2 (OVERLAPS) 1/76 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 187 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:19:27] [INFO ] Deduced a trap composed of 41 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 18:19:27] [INFO ] Deduced a trap composed of 19 places in 116 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:19:27] [INFO ] Deduced a trap composed of 25 places in 124 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:19:28] [INFO ] Deduced a trap composed of 41 places in 117 ms of which 9 ms to minimize.
Problem TDEAD186 is UNSAT
Problem TDEAD187 is UNSAT
Problem TDEAD188 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/76 variables, 4/8 constraints. Problems are: Problem set: 3 solved, 184 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/76 variables, 0/8 constraints. Problems are: Problem set: 3 solved, 184 unsolved
At refinement iteration 5 (OVERLAPS) 163/239 variables, 76/84 constraints. Problems are: Problem set: 3 solved, 184 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/239 variables, 27/111 constraints. Problems are: Problem set: 3 solved, 184 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:19:32] [INFO ] Deduced a trap composed of 42 places in 122 ms of which 16 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/239 variables, 1/112 constraints. Problems are: Problem set: 3 solved, 184 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/239 variables, 0/112 constraints. Problems are: Problem set: 3 solved, 184 unsolved
At refinement iteration 9 (OVERLAPS) 0/239 variables, 0/112 constraints. Problems are: Problem set: 3 solved, 184 unsolved
No progress, stopping.
After SMT solving in domain Real declared 239/240 variables, and 112 constraints, problems are : Problem set: 3 solved, 184 unsolved in 14113 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 76/76 constraints, ReadFeed: 27/27 constraints, PredecessorRefiner: 187/187 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 184 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 184 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/75 variables, 4/5 constraints. Problems are: Problem set: 3 solved, 184 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/75 variables, 0/5 constraints. Problems are: Problem set: 3 solved, 184 unsolved
At refinement iteration 3 (OVERLAPS) 1/76 variables, 3/8 constraints. Problems are: Problem set: 3 solved, 184 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/76 variables, 1/9 constraints. Problems are: Problem set: 3 solved, 184 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/76 variables, 0/9 constraints. Problems are: Problem set: 3 solved, 184 unsolved
At refinement iteration 6 (OVERLAPS) 163/239 variables, 76/85 constraints. Problems are: Problem set: 3 solved, 184 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/239 variables, 27/112 constraints. Problems are: Problem set: 3 solved, 184 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/239 variables, 184/296 constraints. Problems are: Problem set: 3 solved, 184 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/239 variables, 0/296 constraints. Problems are: Problem set: 3 solved, 184 unsolved
At refinement iteration 10 (OVERLAPS) 0/239 variables, 0/296 constraints. Problems are: Problem set: 3 solved, 184 unsolved
No progress, stopping.
After SMT solving in domain Int declared 239/240 variables, and 296 constraints, problems are : Problem set: 3 solved, 184 unsolved in 18649 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 76/76 constraints, ReadFeed: 27/27 constraints, PredecessorRefiner: 184/187 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 32821ms problems are : Problem set: 3 solved, 184 unsolved
Search for dead transitions found 3 dead transitions in 32823ms
Found 3 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 3 transitions
Dead transitions reduction (with SMT) removed 3 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 76/76 places, 188/191 transitions.
Applied a total of 0 rules in 5 ms. Remains 76 /76 variables (removed 0) and now considering 188/188 (removed 0) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 18:19:58] [INFO ] Redundant transitions in 1 ms returned []
Finished structural reductions in SI_LTL mode , in 2 iterations and 33266 ms. Remains : 76/76 places, 188/191 transitions.
Computed a total of 3 stabilizing places and 7 stable transitions
Computed a total of 3 stabilizing places and 7 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 106 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 98 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (5495 resets) in 111 ms. (357 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (1758 resets) in 30 ms. (1290 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 3886 steps, run visited all 1 properties in 24 ms. (steps per millisecond=161 )
Probabilistic random walk after 3886 steps, saw 1458 distinct states, run finished after 24 ms. (steps per millisecond=161 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 133 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 99 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 103 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 97 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 88 ms.
Product exploration explored 100000 steps with 0 reset in 186 ms.
Built C files in :
/tmp/ltsmin15861844630180418902
[2025-06-02 18:19:59] [INFO ] Computing symmetric may disable matrix : 188 transitions.
[2025-06-02 18:19:59] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 18:19:59] [INFO ] Computing symmetric may enable matrix : 188 transitions.
[2025-06-02 18:19:59] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 18:19:59] [INFO ] Computing Do-Not-Accords matrix : 188 transitions.
[2025-06-02 18:19:59] [INFO ] Computation of Completed DNA matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 18:19:59] [INFO ] Built C files in 92ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15861844630180418902
Running compilation step : cd /tmp/ltsmin15861844630180418902;'/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 1098 ms.
Running link step : cd /tmp/ltsmin15861844630180418902;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 64 ms.
Running LTSmin : cd /tmp/ltsmin15861844630180418902;'/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/stateBased8964846515631143489.hoa' '--buchi-type=spotba'
LTSmin run took 477 ms.
FORMULA FireWire-PT-16-LTLCardinality-13 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property FireWire-PT-16-LTLCardinality-13 finished in 68986 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(F(p0))||G(p1)))'
Support contains 3 out of 199 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 199/199 places, 303/303 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 182 transition count 275
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 182 transition count 275
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 35 place count 182 transition count 274
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 40 place count 177 transition count 269
Iterating global reduction 1 with 5 rules applied. Total rules applied 45 place count 177 transition count 269
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 46 place count 176 transition count 268
Iterating global reduction 1 with 1 rules applied. Total rules applied 47 place count 176 transition count 268
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 48 place count 175 transition count 267
Iterating global reduction 1 with 1 rules applied. Total rules applied 49 place count 175 transition count 267
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 50 place count 174 transition count 266
Iterating global reduction 1 with 1 rules applied. Total rules applied 51 place count 174 transition count 266
Applied a total of 51 rules in 16 ms. Remains 174 /199 variables (removed 25) and now considering 266/303 (removed 37) transitions.
// Phase 1: matrix 266 rows 174 cols
[2025-06-02 18:20:01] [INFO ] Computed 4 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:20:01] [INFO ] Implicit Places using invariants in 170 ms returned []
[2025-06-02 18:20:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:20:01] [INFO ] Implicit Places using invariants and state equation in 413 ms returned []
Implicit Place search using SMT with State Equation took 586 ms to find 0 implicit places.
Running 265 sub problems to find dead transitions.
[2025-06-02 18:20:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/173 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 1 (OVERLAPS) 1/174 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 265 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:20:07] [INFO ] Deduced a trap composed of 76 places in 144 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:20:07] [INFO ] Deduced a trap composed of 79 places in 149 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:20:08] [INFO ] Deduced a trap composed of 48 places in 135 ms of which 13 ms to minimize.
Problem TDEAD148 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD156 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:20:09] [INFO ] Deduced a trap composed of 76 places in 152 ms of which 28 ms to minimize.
Problem TDEAD214 is UNSAT
Problem TDEAD226 is UNSAT
Problem TDEAD227 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD231 is UNSAT
Problem TDEAD234 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD238 is UNSAT
Problem TDEAD239 is UNSAT
Problem TDEAD242 is UNSAT
Problem TDEAD243 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:20:09] [INFO ] Deduced a trap composed of 53 places in 164 ms of which 31 ms to minimize.
Problem TDEAD248 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/174 variables, 5/9 constraints. Problems are: Problem set: 15 solved, 250 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:20:10] [INFO ] Deduced a trap composed of 84 places in 136 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:20:10] [INFO ] Deduced a trap composed of 84 places in 142 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:20:11] [INFO ] Deduced a trap composed of 51 places in 179 ms of which 35 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/174 variables, 3/12 constraints. Problems are: Problem set: 15 solved, 250 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/174 variables, 0/12 constraints. Problems are: Problem set: 15 solved, 250 unsolved
At refinement iteration 5 (OVERLAPS) 266/440 variables, 174/186 constraints. Problems are: Problem set: 15 solved, 250 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:20:18] [INFO ] Deduced a trap composed of 59 places in 199 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:20:19] [INFO ] Deduced a trap composed of 94 places in 158 ms of which 19 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/440 variables, 2/188 constraints. Problems are: Problem set: 15 solved, 250 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/440 variables, 0/188 constraints. Problems are: Problem set: 15 solved, 250 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 440/440 variables, and 188 constraints, problems are : Problem set: 15 solved, 250 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 174/174 constraints, PredecessorRefiner: 265/265 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 15 solved, 250 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/173 variables, 0/0 constraints. Problems are: Problem set: 15 solved, 250 unsolved
At refinement iteration 1 (OVERLAPS) 1/174 variables, 4/4 constraints. Problems are: Problem set: 15 solved, 250 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/174 variables, 10/14 constraints. Problems are: Problem set: 15 solved, 250 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/174 variables, 0/14 constraints. Problems are: Problem set: 15 solved, 250 unsolved
At refinement iteration 4 (OVERLAPS) 266/440 variables, 174/188 constraints. Problems are: Problem set: 15 solved, 250 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/440 variables, 250/438 constraints. Problems are: Problem set: 15 solved, 250 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:20:39] [INFO ] Deduced a trap composed of 73 places in 93 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:20:39] [INFO ] Deduced a trap composed of 46 places in 73 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:20:40] [INFO ] Deduced a trap composed of 75 places in 159 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:20:40] [INFO ] Deduced a trap composed of 74 places in 181 ms of which 39 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/440 variables, 4/442 constraints. Problems are: Problem set: 15 solved, 250 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:20:47] [INFO ] Deduced a trap composed of 79 places in 164 ms of which 21 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/440 variables, 1/443 constraints. Problems are: Problem set: 15 solved, 250 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:20:58] [INFO ] Deduced a trap along path composed of 10 places in 39 ms of which 1 ms to minimize.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 440/440 variables, and 444 constraints, problems are : Problem set: 15 solved, 250 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 174/174 constraints, PredecessorRefiner: 250/265 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 60080ms problems are : Problem set: 15 solved, 250 unsolved
Search for dead transitions found 15 dead transitions in 60082ms
Found 15 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 15 transitions
Dead transitions reduction (with SMT) removed 15 transitions
Starting structural reductions in LTL mode, iteration 1 : 174/199 places, 251/303 transitions.
Applied a total of 0 rules in 3 ms. Remains 174 /174 variables (removed 0) and now considering 251/251 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 60691 ms. Remains : 174/199 places, 251/303 transitions.
Stuttering acceptance computed with spot in 167 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : FireWire-PT-16-LTLCardinality-14
Product exploration explored 100000 steps with 2 reset in 150 ms.
Product exploration explored 100000 steps with 2 reset in 169 ms.
Computed a total of 21 stabilizing places and 23 stable transitions
Computed a total of 21 stabilizing places and 23 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (AND p1 (NOT p0))), (X (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X p1), (X (X (AND p1 (NOT p0)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p1))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 9 factoid took 165 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 5 states, 13 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 257 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
RANDOM walk for 40000 steps (12 resets) in 308 ms. (129 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40000 steps (8 resets) in 181 ms. (219 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40001 steps (11 resets) in 204 ms. (195 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40000 steps (8 resets) in 188 ms. (211 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (11 resets) in 224 ms. (177 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40001 steps (12 resets) in 182 ms. (218 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40000 steps (9 resets) in 133 ms. (298 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 578605 steps, run timeout after 3001 ms. (steps per millisecond=192 ) properties seen :0 out of 6
Probabilistic random walk after 578605 steps, saw 115851 distinct states, run finished after 3008 ms. (steps per millisecond=192 ) properties seen :0
// Phase 1: matrix 251 rows 174 cols
[2025-06-02 18:21:06] [INFO ] Computed 4 invariants in 2 ms
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Problem apf3 is UNSAT
At refinement iteration 1 (OVERLAPS) 81/84 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/84 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 74/158 variables, 3/4 constraints. Problems are: Problem set: 1 solved, 5 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:21:06] [INFO ] Deduced a trap composed of 79 places in 169 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:21:06] [INFO ] Deduced a trap composed of 80 places in 132 ms of which 22 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/158 variables, 2/6 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/158 variables, 0/6 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 236/394 variables, 158/164 constraints. Problems are: Problem set: 1 solved, 5 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:21:07] [INFO ] Deduced a trap composed of 46 places in 129 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:21:07] [INFO ] Deduced a trap composed of 79 places in 158 ms of which 21 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/394 variables, 2/166 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/394 variables, 0/166 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 9/403 variables, 5/171 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/403 variables, 0/171 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 6/409 variables, 3/174 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/409 variables, 0/174 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 6/415 variables, 3/177 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/415 variables, 0/177 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 15 (OVERLAPS) 7/422 variables, 3/180 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/422 variables, 0/180 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 17 (OVERLAPS) 3/425 variables, 2/182 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/425 variables, 0/182 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 19 (OVERLAPS) 0/425 variables, 0/182 constraints. Problems are: Problem set: 1 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 425/425 variables, and 182 constraints, problems are : Problem set: 1 solved, 5 unsolved in 1980 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 174/174 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 5 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 81/84 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/84 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 74/158 variables, 3/4 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/158 variables, 4/8 constraints. Problems are: Problem set: 1 solved, 5 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:21:08] [INFO ] Deduced a trap composed of 59 places in 192 ms of which 41 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/158 variables, 1/9 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/158 variables, 0/9 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 236/394 variables, 158/167 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/394 variables, 1/168 constraints. Problems are: Problem set: 1 solved, 5 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:21:09] [INFO ] Deduced a trap composed of 75 places in 129 ms of which 16 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/394 variables, 1/169 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/394 variables, 0/169 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 9/403 variables, 5/174 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/403 variables, 4/178 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/403 variables, 0/178 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 14 (OVERLAPS) 6/409 variables, 3/181 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/409 variables, 0/181 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 16 (OVERLAPS) 6/415 variables, 3/184 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/415 variables, 0/184 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 18 (OVERLAPS) 7/422 variables, 3/187 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/422 variables, 0/187 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 20 (OVERLAPS) 3/425 variables, 2/189 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/425 variables, 0/189 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 22 (OVERLAPS) 0/425 variables, 0/189 constraints. Problems are: Problem set: 1 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 425/425 variables, and 189 constraints, problems are : Problem set: 1 solved, 5 unsolved in 2496 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 174/174 constraints, PredecessorRefiner: 5/6 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4502ms problems are : Problem set: 1 solved, 5 unsolved
Fused 5 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 1163 ms.
Support contains 3 out of 174 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 174/174 places, 251/251 transitions.
Graph (trivial) has 138 edges and 174 vertex of which 18 / 174 are part of one of the 3 SCC in 0 ms
Free SCC test removed 15 places
Drop transitions (Empty/Sink Transition effects.) removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 27 transitions
Trivial Post-agglo rules discarded 27 transitions
Performed 27 trivial Post agglomeration. Transition count delta: 27
Iterating post reduction 0 with 27 rules applied. Total rules applied 28 place count 159 transition count 205
Reduce places removed 27 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 29 rules applied. Total rules applied 57 place count 132 transition count 203
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 58 place count 131 transition count 203
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 17 Pre rules applied. Total rules applied 58 place count 131 transition count 186
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 92 place count 114 transition count 186
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 93 place count 113 transition count 176
Iterating global reduction 3 with 1 rules applied. Total rules applied 94 place count 113 transition count 176
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 95 place count 113 transition count 175
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 4 with 34 rules applied. Total rules applied 129 place count 96 transition count 158
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: -75
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 4 with 34 rules applied. Total rules applied 163 place count 79 transition count 233
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 169 place count 79 transition count 227
Drop transitions (Redundant composition of simpler transitions.) removed 35 transitions
Redundant transition composition rules discarded 35 transitions
Iterating global reduction 5 with 35 rules applied. Total rules applied 204 place count 79 transition count 192
Free-agglomeration rule applied 10 times.
Iterating global reduction 5 with 10 rules applied. Total rules applied 214 place count 79 transition count 182
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 5 with 10 rules applied. Total rules applied 224 place count 69 transition count 182
Drop transitions (Redundant composition of simpler transitions.) removed 22 transitions
Redundant transition composition rules discarded 22 transitions
Iterating global reduction 6 with 22 rules applied. Total rules applied 246 place count 69 transition count 160
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 247 place count 69 transition count 160
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 248 place count 69 transition count 160
Applied a total of 248 rules in 49 ms. Remains 69 /174 variables (removed 105) and now considering 160/251 (removed 91) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 50 ms. Remains : 69/174 places, 160/251 transitions.
RANDOM walk for 40000 steps (4093 resets) in 404 ms. (98 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (1218 resets) in 98 ms. (404 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (1274 resets) in 99 ms. (400 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (1234 resets) in 164 ms. (242 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (1268 resets) in 88 ms. (449 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40001 steps (1247 resets) in 93 ms. (425 steps per ms) remains 5/5 properties
Finished probabilistic random walk after 1730 steps, run visited all 5 properties in 21 ms. (steps per millisecond=82 )
Probabilistic random walk after 1730 steps, saw 759 distinct states, run finished after 22 ms. (steps per millisecond=78 ) properties seen :5
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) p1), (X (AND p1 (NOT p0))), (X (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X p1), (X (X (AND p1 (NOT p0)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p1)), (G (OR (NOT p0) p1))]
False Knowledge obtained : [(F p0), (F (NOT p1)), (F (NOT (AND (NOT p0) p1))), (F (NOT (OR p0 p1))), (F (NOT (OR (NOT p0) (NOT p1))))]
Knowledge based reduction with 10 factoid took 419 ms. Reduced automaton from 5 states, 13 edges and 2 AP (stutter insensitive) to 7 states, 17 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 356 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false, false]
Stuttering acceptance computed with spot in 372 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false, false]
Support contains 3 out of 174 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 174/174 places, 251/251 transitions.
Graph (trivial) has 138 edges and 174 vertex of which 18 / 174 are part of one of the 3 SCC in 0 ms
Free SCC test removed 15 places
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 27 transitions
Trivial Post-agglo rules discarded 27 transitions
Performed 27 trivial Post agglomeration. Transition count delta: 27
Iterating post reduction 0 with 27 rules applied. Total rules applied 28 place count 158 transition count 207
Reduce places removed 27 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 29 rules applied. Total rules applied 57 place count 131 transition count 205
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 58 place count 130 transition count 205
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 17 Pre rules applied. Total rules applied 58 place count 130 transition count 188
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 92 place count 113 transition count 188
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 93 place count 112 transition count 178
Iterating global reduction 3 with 1 rules applied. Total rules applied 94 place count 112 transition count 178
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 95 place count 112 transition count 177
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 4 with 32 rules applied. Total rules applied 127 place count 96 transition count 161
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: -70
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 4 with 32 rules applied. Total rules applied 159 place count 80 transition count 231
Drop transitions (Redundant composition of simpler transitions.) removed 38 transitions
Redundant transition composition rules discarded 38 transitions
Iterating global reduction 4 with 38 rules applied. Total rules applied 197 place count 80 transition count 193
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 198 place count 80 transition count 193
Applied a total of 198 rules in 45 ms. Remains 80 /174 variables (removed 94) and now considering 193/251 (removed 58) transitions.
[2025-06-02 18:21:13] [INFO ] Flow matrix only has 166 transitions (discarded 27 similar events)
// Phase 1: matrix 166 rows 80 cols
[2025-06-02 18:21:13] [INFO ] Computed 4 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:21:14] [INFO ] Implicit Places using invariants in 151 ms returned []
[2025-06-02 18:21:14] [INFO ] Flow matrix only has 166 transitions (discarded 27 similar events)
[2025-06-02 18:21:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:21:14] [INFO ] State equation strengthened by 25 read => feed constraints.
[2025-06-02 18:21:14] [INFO ] Implicit Places using invariants and state equation in 302 ms returned []
Implicit Place search using SMT with State Equation took 455 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 18:21:14] [INFO ] Redundant transitions in 2 ms returned []
Running 190 sub problems to find dead transitions.
[2025-06-02 18:21:14] [INFO ] Flow matrix only has 166 transitions (discarded 27 similar events)
[2025-06-02 18:21:14] [INFO ] Invariant cache hit.
[2025-06-02 18:21:14] [INFO ] State equation strengthened by 25 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/79 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/79 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 2 (OVERLAPS) 1/80 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 190 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:21:16] [INFO ] Deduced a trap composed of 42 places in 115 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:21:17] [INFO ] Deduced a trap composed of 41 places in 135 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:21:17] [INFO ] Deduced a trap composed of 42 places in 116 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:21:17] [INFO ] Deduced a trap composed of 42 places in 129 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:21:17] [INFO ] Deduced a trap composed of 19 places in 113 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:21:17] [INFO ] Deduced a trap composed of 26 places in 123 ms of which 17 ms to minimize.
Problem TDEAD70 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:21:17] [INFO ] Deduced a trap composed of 43 places in 129 ms of which 16 ms to minimize.
Problem TDEAD82 is UNSAT
Problem TDEAD83 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/80 variables, 7/11 constraints. Problems are: Problem set: 3 solved, 187 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:21:19] [INFO ] Deduced a trap composed of 42 places in 92 ms of which 6 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/80 variables, 1/12 constraints. Problems are: Problem set: 3 solved, 187 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/80 variables, 0/12 constraints. Problems are: Problem set: 3 solved, 187 unsolved
At refinement iteration 6 (OVERLAPS) 165/245 variables, 80/92 constraints. Problems are: Problem set: 3 solved, 187 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/245 variables, 25/117 constraints. Problems are: Problem set: 3 solved, 187 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/245 variables, 0/117 constraints. Problems are: Problem set: 3 solved, 187 unsolved
At refinement iteration 9 (OVERLAPS) 0/245 variables, 0/117 constraints. Problems are: Problem set: 3 solved, 187 unsolved
No progress, stopping.
After SMT solving in domain Real declared 245/246 variables, and 117 constraints, problems are : Problem set: 3 solved, 187 unsolved in 16798 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 80/80 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 190/190 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 187 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/79 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 187 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/79 variables, 3/4 constraints. Problems are: Problem set: 3 solved, 187 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/79 variables, 0/4 constraints. Problems are: Problem set: 3 solved, 187 unsolved
At refinement iteration 3 (OVERLAPS) 1/80 variables, 3/7 constraints. Problems are: Problem set: 3 solved, 187 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/80 variables, 5/12 constraints. Problems are: Problem set: 3 solved, 187 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:21:32] [INFO ] Deduced a trap composed of 44 places in 102 ms of which 11 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/80 variables, 1/13 constraints. Problems are: Problem set: 3 solved, 187 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/80 variables, 0/13 constraints. Problems are: Problem set: 3 solved, 187 unsolved
At refinement iteration 7 (OVERLAPS) 165/245 variables, 80/93 constraints. Problems are: Problem set: 3 solved, 187 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/245 variables, 25/118 constraints. Problems are: Problem set: 3 solved, 187 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/245 variables, 187/305 constraints. Problems are: Problem set: 3 solved, 187 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:21:37] [INFO ] Deduced a trap composed of 43 places in 114 ms of which 9 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/245 variables, 1/306 constraints. Problems are: Problem set: 3 solved, 187 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/245 variables, 0/306 constraints. Problems are: Problem set: 3 solved, 187 unsolved
At refinement iteration 12 (OVERLAPS) 0/245 variables, 0/306 constraints. Problems are: Problem set: 3 solved, 187 unsolved
No progress, stopping.
After SMT solving in domain Int declared 245/246 variables, and 306 constraints, problems are : Problem set: 3 solved, 187 unsolved in 21577 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 80/80 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 187/190 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 38443ms problems are : Problem set: 3 solved, 187 unsolved
Search for dead transitions found 3 dead transitions in 38445ms
Found 3 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 3 transitions
Dead transitions reduction (with SMT) removed 3 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 80/174 places, 190/251 transitions.
Applied a total of 0 rules in 7 ms. Remains 80 /80 variables (removed 0) and now considering 190/190 (removed 0) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 18:21:52] [INFO ] Redundant transitions in 4 ms returned []
Finished structural reductions in SI_LTL mode , in 2 iterations and 38976 ms. Remains : 80/174 places, 190/251 transitions.
Computed a total of 2 stabilizing places and 4 stable transitions
Computed a total of 2 stabilizing places and 4 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (AND (NOT p0) p1)), (X (NOT (AND p0 p1))), (X p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND p0 p1)))), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 199 ms. Reduced automaton from 7 states, 17 edges and 2 AP (stutter insensitive) to 7 states, 18 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 311 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1)), false, false]
RANDOM walk for 40000 steps (4425 resets) in 274 ms. (145 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (1417 resets) in 103 ms. (384 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (1521 resets) in 111 ms. (357 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (1443 resets) in 91 ms. (434 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (1464 resets) in 83 ms. (476 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (1505 resets) in 79 ms. (500 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (1415 resets) in 100 ms. (396 steps per ms) remains 6/6 properties
Probably explored full state space saw : 34281 states, properties seen :5
Probabilistic random walk after 143601 steps, saw 34281 distinct states, run finished after 404 ms. (steps per millisecond=355 ) properties seen :5
Explored full state space saw : 34281 states, properties seen :0
Exhaustive walk after 143601 steps, saw 34281 distinct states, run finished after 229 ms. (steps per millisecond=627 ) properties seen :0
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) p1), (X (AND (NOT p0) p1)), (X (NOT (AND p0 p1))), (X p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND p0 p1)))), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (G (OR (NOT p0) p1))]
False Knowledge obtained : [(F p0), (F (NOT p1)), (F (NOT (AND (NOT p0) p1))), (F (NOT (OR p0 p1))), (F (NOT (OR (NOT p0) (NOT p1))))]
Knowledge based reduction with 14 factoid took 567 ms. Reduced automaton from 7 states, 18 edges and 2 AP (stutter insensitive) to 7 states, 17 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 360 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false, false]
Stuttering acceptance computed with spot in 364 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false, false]
Stuttering acceptance computed with spot in 368 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false, false]
Product exploration explored 100000 steps with 1 reset in 451 ms.
Product exploration explored 100000 steps with 6 reset in 425 ms.
Built C files in :
/tmp/ltsmin10175376517899071951
[2025-06-02 18:21:56] [INFO ] Computing symmetric may disable matrix : 190 transitions.
[2025-06-02 18:21:56] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 18:21:56] [INFO ] Computing symmetric may enable matrix : 190 transitions.
[2025-06-02 18:21:56] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 18:21:56] [INFO ] Computing Do-Not-Accords matrix : 190 transitions.
[2025-06-02 18:21:56] [INFO ] Computation of Completed DNA matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 18:21:56] [INFO ] Built C files in 41ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10175376517899071951
Running compilation step : cd /tmp/ltsmin10175376517899071951;'/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 905 ms.
Running link step : cd /tmp/ltsmin10175376517899071951;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin10175376517899071951;'/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/stateBased8820718052876271297.hoa' '--buchi-type=spotba'
LTSmin run took 409 ms.
FORMULA FireWire-PT-16-LTLCardinality-14 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property FireWire-PT-16-LTLCardinality-14 finished in 117117 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 199 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 199/199 places, 303/303 transitions.
Graph (trivial) has 161 edges and 199 vertex of which 18 / 199 are part of one of the 3 SCC in 0 ms
Free SCC test removed 15 places
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 41 transitions
Trivial Post-agglo rules discarded 41 transitions
Performed 41 trivial Post agglomeration. Transition count delta: 41
Iterating post reduction 0 with 41 rules applied. Total rules applied 42 place count 183 transition count 245
Reduce places removed 41 places and 0 transitions.
Iterating post reduction 1 with 41 rules applied. Total rules applied 83 place count 142 transition count 245
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 83 place count 142 transition count 233
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 107 place count 130 transition count 233
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 119 place count 118 transition count 201
Iterating global reduction 2 with 12 rules applied. Total rules applied 131 place count 118 transition count 201
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 4 rules applied. Total rules applied 135 place count 118 transition count 197
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 136 place count 117 transition count 197
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 4 Pre rules applied. Total rules applied 136 place count 117 transition count 193
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 144 place count 113 transition count 193
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 145 place count 112 transition count 192
Iterating global reduction 4 with 1 rules applied. Total rules applied 146 place count 112 transition count 192
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 4 with 32 rules applied. Total rules applied 178 place count 96 transition count 176
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: -63
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 4 with 32 rules applied. Total rules applied 210 place count 80 transition count 239
Drop transitions (Redundant composition of simpler transitions.) removed 32 transitions
Redundant transition composition rules discarded 32 transitions
Iterating global reduction 4 with 32 rules applied. Total rules applied 242 place count 80 transition count 207
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 243 place count 79 transition count 206
Applied a total of 243 rules in 32 ms. Remains 79 /199 variables (removed 120) and now considering 206/303 (removed 97) transitions.
[2025-06-02 18:21:58] [INFO ] Flow matrix only has 180 transitions (discarded 26 similar events)
// Phase 1: matrix 180 rows 79 cols
[2025-06-02 18:21:58] [INFO ] Computed 4 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:21:58] [INFO ] Implicit Places using invariants in 162 ms returned []
[2025-06-02 18:21:58] [INFO ] Flow matrix only has 180 transitions (discarded 26 similar events)
[2025-06-02 18:21:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:21:58] [INFO ] State equation strengthened by 31 read => feed constraints.
[2025-06-02 18:21:58] [INFO ] Implicit Places using invariants and state equation in 278 ms returned []
Implicit Place search using SMT with State Equation took 442 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 18:21:58] [INFO ] Redundant transitions in 2 ms returned []
Running 202 sub problems to find dead transitions.
[2025-06-02 18:21:58] [INFO ] Flow matrix only has 180 transitions (discarded 26 similar events)
[2025-06-02 18:21:58] [INFO ] Invariant cache hit.
[2025-06-02 18:21:58] [INFO ] State equation strengthened by 31 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/78 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/78 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 2 (OVERLAPS) 1/79 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 202 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:22:01] [INFO ] Deduced a trap composed of 33 places in 117 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:22:01] [INFO ] Deduced a trap composed of 42 places in 123 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:22:01] [INFO ] Deduced a trap composed of 43 places in 115 ms of which 15 ms to minimize.
Problem TDEAD17 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:22:01] [INFO ] Deduced a trap composed of 42 places in 102 ms of which 6 ms to minimize.
Problem TDEAD19 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:22:01] [INFO ] Deduced a trap composed of 43 places in 114 ms of which 21 ms to minimize.
Problem TDEAD29 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD41 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:22:01] [INFO ] Deduced a trap composed of 26 places in 124 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:22:02] [INFO ] Deduced a trap composed of 19 places in 107 ms of which 6 ms to minimize.
Problem TDEAD60 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD184 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD191 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/79 variables, 7/11 constraints. Problems are: Problem set: 24 solved, 178 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/79 variables, 0/11 constraints. Problems are: Problem set: 24 solved, 178 unsolved
At refinement iteration 5 (OVERLAPS) 179/258 variables, 79/90 constraints. Problems are: Problem set: 24 solved, 178 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/258 variables, 31/121 constraints. Problems are: Problem set: 24 solved, 178 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/258 variables, 0/121 constraints. Problems are: Problem set: 24 solved, 178 unsolved
At refinement iteration 8 (OVERLAPS) 0/258 variables, 0/121 constraints. Problems are: Problem set: 24 solved, 178 unsolved
No progress, stopping.
After SMT solving in domain Real declared 258/259 variables, and 121 constraints, problems are : Problem set: 24 solved, 178 unsolved in 10954 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 79/79 constraints, ReadFeed: 31/31 constraints, PredecessorRefiner: 202/202 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 24 solved, 178 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/78 variables, 1/1 constraints. Problems are: Problem set: 24 solved, 178 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/78 variables, 6/7 constraints. Problems are: Problem set: 24 solved, 178 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/78 variables, 0/7 constraints. Problems are: Problem set: 24 solved, 178 unsolved
At refinement iteration 3 (OVERLAPS) 1/79 variables, 3/10 constraints. Problems are: Problem set: 24 solved, 178 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/79 variables, 1/11 constraints. Problems are: Problem set: 24 solved, 178 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/79 variables, 0/11 constraints. Problems are: Problem set: 24 solved, 178 unsolved
At refinement iteration 6 (OVERLAPS) 179/258 variables, 79/90 constraints. Problems are: Problem set: 24 solved, 178 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/258 variables, 31/121 constraints. Problems are: Problem set: 24 solved, 178 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/258 variables, 178/299 constraints. Problems are: Problem set: 24 solved, 178 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/258 variables, 0/299 constraints. Problems are: Problem set: 24 solved, 178 unsolved
At refinement iteration 10 (OVERLAPS) 0/258 variables, 0/299 constraints. Problems are: Problem set: 24 solved, 178 unsolved
No progress, stopping.
After SMT solving in domain Int declared 258/259 variables, and 299 constraints, problems are : Problem set: 24 solved, 178 unsolved in 23647 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 79/79 constraints, ReadFeed: 31/31 constraints, PredecessorRefiner: 178/202 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 34654ms problems are : Problem set: 24 solved, 178 unsolved
Search for dead transitions found 24 dead transitions in 34656ms
Found 24 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 24 transitions
Dead transitions reduction (with SMT) removed 24 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 79/199 places, 182/303 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 78 transition count 187
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 78 transition count 186
Applied a total of 3 rules in 10 ms. Remains 78 /79 variables (removed 1) and now considering 186/182 (removed -4) transitions.
[2025-06-02 18:22:33] [INFO ] Flow matrix only has 160 transitions (discarded 26 similar events)
// Phase 1: matrix 160 rows 78 cols
[2025-06-02 18:22:33] [INFO ] Computed 4 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:22:33] [INFO ] Implicit Places using invariants in 143 ms returned []
[2025-06-02 18:22:33] [INFO ] Flow matrix only has 160 transitions (discarded 26 similar events)
[2025-06-02 18:22:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:22:33] [INFO ] State equation strengthened by 24 read => feed constraints.
[2025-06-02 18:22:33] [INFO ] Implicit Places using invariants and state equation in 233 ms returned []
Implicit Place search using SMT with State Equation took 379 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 78/199 places, 186/303 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 35530 ms. Remains : 78/199 places, 186/303 transitions.
Stuttering acceptance computed with spot in 111 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FireWire-PT-16-LTLCardinality-15
Product exploration explored 100000 steps with 0 reset in 79 ms.
Product exploration explored 100000 steps with 0 reset in 327 ms.
Computed a total of 3 stabilizing places and 7 stable transitions
Computed a total of 3 stabilizing places and 7 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 112 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 100 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (5522 resets) in 105 ms. (377 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (1759 resets) in 48 ms. (816 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 971 steps, run visited all 1 properties in 8 ms. (steps per millisecond=121 )
Probabilistic random walk after 971 steps, saw 457 distinct states, run finished after 8 ms. (steps per millisecond=121 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 142 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 100 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 100 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 78 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 78/78 places, 186/186 transitions.
Applied a total of 0 rules in 2 ms. Remains 78 /78 variables (removed 0) and now considering 186/186 (removed 0) transitions.
[2025-06-02 18:22:35] [INFO ] Flow matrix only has 160 transitions (discarded 26 similar events)
[2025-06-02 18:22:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:22:35] [INFO ] Implicit Places using invariants in 133 ms returned []
[2025-06-02 18:22:35] [INFO ] Flow matrix only has 160 transitions (discarded 26 similar events)
[2025-06-02 18:22:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:22:35] [INFO ] State equation strengthened by 24 read => feed constraints.
[2025-06-02 18:22:35] [INFO ] Implicit Places using invariants and state equation in 281 ms returned []
Implicit Place search using SMT with State Equation took 416 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 18:22:35] [INFO ] Redundant transitions in 1 ms returned []
Running 182 sub problems to find dead transitions.
[2025-06-02 18:22:35] [INFO ] Flow matrix only has 160 transitions (discarded 26 similar events)
[2025-06-02 18:22:35] [INFO ] Invariant cache hit.
[2025-06-02 18:22:35] [INFO ] State equation strengthened by 24 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/77 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/77 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 2 (OVERLAPS) 1/78 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 182 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:22:37] [INFO ] Deduced a trap composed of 42 places in 122 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:22:38] [INFO ] Deduced a trap composed of 19 places in 128 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:22:38] [INFO ] Deduced a trap composed of 25 places in 132 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:22:39] [INFO ] Deduced a trap composed of 42 places in 119 ms of which 9 ms to minimize.
Problem TDEAD181 is UNSAT
Problem TDEAD182 is UNSAT
Problem TDEAD183 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/78 variables, 4/8 constraints. Problems are: Problem set: 3 solved, 179 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/78 variables, 0/8 constraints. Problems are: Problem set: 3 solved, 179 unsolved
At refinement iteration 5 (OVERLAPS) 159/237 variables, 78/86 constraints. Problems are: Problem set: 3 solved, 179 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/237 variables, 24/110 constraints. Problems are: Problem set: 3 solved, 179 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/237 variables, 0/110 constraints. Problems are: Problem set: 3 solved, 179 unsolved
At refinement iteration 8 (OVERLAPS) 0/237 variables, 0/110 constraints. Problems are: Problem set: 3 solved, 179 unsolved
No progress, stopping.
After SMT solving in domain Real declared 237/238 variables, and 110 constraints, problems are : Problem set: 3 solved, 179 unsolved in 10693 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 78/78 constraints, ReadFeed: 24/24 constraints, PredecessorRefiner: 182/182 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 179 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/77 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 179 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/77 variables, 2/3 constraints. Problems are: Problem set: 3 solved, 179 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/77 variables, 0/3 constraints. Problems are: Problem set: 3 solved, 179 unsolved
At refinement iteration 3 (OVERLAPS) 1/78 variables, 3/6 constraints. Problems are: Problem set: 3 solved, 179 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/78 variables, 2/8 constraints. Problems are: Problem set: 3 solved, 179 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/78 variables, 0/8 constraints. Problems are: Problem set: 3 solved, 179 unsolved
At refinement iteration 6 (OVERLAPS) 159/237 variables, 78/86 constraints. Problems are: Problem set: 3 solved, 179 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/237 variables, 24/110 constraints. Problems are: Problem set: 3 solved, 179 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/237 variables, 179/289 constraints. Problems are: Problem set: 3 solved, 179 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/237 variables, 0/289 constraints. Problems are: Problem set: 3 solved, 179 unsolved
At refinement iteration 10 (OVERLAPS) 0/237 variables, 0/289 constraints. Problems are: Problem set: 3 solved, 179 unsolved
No progress, stopping.
After SMT solving in domain Int declared 237/238 variables, and 289 constraints, problems are : Problem set: 3 solved, 179 unsolved in 16820 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 78/78 constraints, ReadFeed: 24/24 constraints, PredecessorRefiner: 179/182 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 27553ms problems are : Problem set: 3 solved, 179 unsolved
Search for dead transitions found 3 dead transitions in 27553ms
Found 3 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 3 transitions
Dead transitions reduction (with SMT) removed 3 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 78/78 places, 183/186 transitions.
Applied a total of 0 rules in 3 ms. Remains 78 /78 variables (removed 0) and now considering 183/183 (removed 0) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 18:23:03] [INFO ] Redundant transitions in 1 ms returned []
Finished structural reductions in SI_LTL mode , in 2 iterations and 27990 ms. Remains : 78/78 places, 183/186 transitions.
Computed a total of 3 stabilizing places and 7 stable transitions
Computed a total of 3 stabilizing places and 7 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 85 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 68 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (5454 resets) in 74 ms. (533 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (1782 resets) in 40 ms. (975 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 971 steps, run visited all 1 properties in 8 ms. (steps per millisecond=121 )
Probabilistic random walk after 971 steps, saw 457 distinct states, run finished after 8 ms. (steps per millisecond=121 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 136 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 95 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 95 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 98 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 2 reset in 86 ms.
Product exploration explored 100000 steps with 0 reset in 93 ms.
Built C files in :
/tmp/ltsmin6186596537105705138
[2025-06-02 18:23:03] [INFO ] Computing symmetric may disable matrix : 183 transitions.
[2025-06-02 18:23:03] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 18:23:03] [INFO ] Computing symmetric may enable matrix : 183 transitions.
[2025-06-02 18:23:03] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 18:23:03] [INFO ] Computing Do-Not-Accords matrix : 183 transitions.
[2025-06-02 18:23:03] [INFO ] Computation of Completed DNA matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 18:23:03] [INFO ] Built C files in 41ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6186596537105705138
Running compilation step : cd /tmp/ltsmin6186596537105705138;'/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 646 ms.
Running link step : cd /tmp/ltsmin6186596537105705138;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 59 ms.
Running LTSmin : cd /tmp/ltsmin6186596537105705138;'/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/stateBased10629533561790833648.hoa' '--buchi-type=spotba'
LTSmin run took 462 ms.
FORMULA FireWire-PT-16-LTLCardinality-15 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property FireWire-PT-16-LTLCardinality-15 finished in 66783 ms.
All properties solved by simple procedures.
Total runtime 842040 ms.
BK_STOP 1748888585171
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="FireWire-PT-16"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5832"
echo " Executing tool itstools"
echo " Input is FireWire-PT-16, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r086-smll-174860102400363"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/FireWire-PT-16.tgz
mv FireWire-PT-16 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;