About the Execution of GreatSPN+red for FireWire-PT-18
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 10550.632 | 1723023.00 | 2848244.00 | 3973.40 | TTFTFFFF?TF?FF?T | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2024-input.r549-tall-171734898300308.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-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-5568
Executing tool greatspnxred
Input is FireWire-PT-18, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r549-tall-171734898300308
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 560K
-rw-r--r-- 1 mcc users 8.3K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 95K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 10K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 106K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 4.1K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 25K Jun 2 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Jun 2 17:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Jun 2 17:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 equiv_col
-rw-r--r-- 1 mcc users 3 Jun 2 16:33 instance
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 iscolored
-rw-r--r-- 1 mcc users 168K Jun 2 16:33 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME FireWire-PT-18-LTLFireability-00
FORMULA_NAME FireWire-PT-18-LTLFireability-01
FORMULA_NAME FireWire-PT-18-LTLFireability-02
FORMULA_NAME FireWire-PT-18-LTLFireability-03
FORMULA_NAME FireWire-PT-18-LTLFireability-04
FORMULA_NAME FireWire-PT-18-LTLFireability-05
FORMULA_NAME FireWire-PT-18-LTLFireability-06
FORMULA_NAME FireWire-PT-18-LTLFireability-07
FORMULA_NAME FireWire-PT-18-LTLFireability-08
FORMULA_NAME FireWire-PT-18-LTLFireability-09
FORMULA_NAME FireWire-PT-18-LTLFireability-10
FORMULA_NAME FireWire-PT-18-LTLFireability-11
FORMULA_NAME FireWire-PT-18-LTLFireability-12
FORMULA_NAME FireWire-PT-18-LTLFireability-13
FORMULA_NAME FireWire-PT-18-LTLFireability-14
FORMULA_NAME FireWire-PT-18-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1717372954091
Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FireWire-PT-18
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-06-03 00:02:35] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-03 00:02:35] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-03 00:02:35] [INFO ] Load time of PNML (sax parser for PT used): 99 ms
[2024-06-03 00:02:35] [INFO ] Transformed 437 places.
[2024-06-03 00:02:35] [INFO ] Transformed 707 transitions.
[2024-06-03 00:02:35] [INFO ] Found NUPN structural information;
[2024-06-03 00:02:35] [INFO ] Parsed PT model containing 437 places and 707 transitions and 2170 arcs in 208 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 6 formulas.
FORMULA FireWire-PT-18-LTLFireability-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-18-LTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-18-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-18-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-18-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-18-LTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 31 out of 437 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 437/437 places, 707/707 transitions.
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 427 transition count 707
Discarding 97 places :
Symmetric choice reduction at 1 with 97 rule applications. Total rules 107 place count 330 transition count 610
Iterating global reduction 1 with 97 rules applied. Total rules applied 204 place count 330 transition count 610
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 205 place count 330 transition count 609
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 224 place count 311 transition count 560
Iterating global reduction 2 with 19 rules applied. Total rules applied 243 place count 311 transition count 560
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 247 place count 307 transition count 554
Iterating global reduction 2 with 4 rules applied. Total rules applied 251 place count 307 transition count 554
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 252 place count 307 transition count 553
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 253 place count 306 transition count 550
Iterating global reduction 3 with 1 rules applied. Total rules applied 254 place count 306 transition count 550
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 255 place count 305 transition count 548
Iterating global reduction 3 with 1 rules applied. Total rules applied 256 place count 305 transition count 548
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 257 place count 304 transition count 545
Iterating global reduction 3 with 1 rules applied. Total rules applied 258 place count 304 transition count 545
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 259 place count 303 transition count 543
Iterating global reduction 3 with 1 rules applied. Total rules applied 260 place count 303 transition count 543
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 261 place count 302 transition count 540
Iterating global reduction 3 with 1 rules applied. Total rules applied 262 place count 302 transition count 540
Applied a total of 262 rules in 124 ms. Remains 302 /437 variables (removed 135) and now considering 540/707 (removed 167) transitions.
// Phase 1: matrix 540 rows 302 cols
[2024-06-03 00:02:35] [INFO ] Computed 7 invariants in 23 ms
[2024-06-03 00:02:36] [INFO ] Implicit Places using invariants in 375 ms returned []
[2024-06-03 00:02:36] [INFO ] Invariant cache hit.
[2024-06-03 00:02:36] [INFO ] Implicit Places using invariants and state equation in 356 ms returned []
Implicit Place search using SMT with State Equation took 760 ms to find 0 implicit places.
Running 539 sub problems to find dead transitions.
[2024-06-03 00:02:36] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/301 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 539 unsolved
At refinement iteration 1 (OVERLAPS) 1/302 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 539 unsolved
[2024-06-03 00:02:42] [INFO ] Deduced a trap composed of 177 places in 140 ms of which 22 ms to minimize.
[2024-06-03 00:02:43] [INFO ] Deduced a trap composed of 95 places in 57 ms of which 2 ms to minimize.
[2024-06-03 00:02:43] [INFO ] Deduced a trap composed of 84 places in 116 ms of which 1 ms to minimize.
[2024-06-03 00:02:43] [INFO ] Deduced a trap composed of 83 places in 136 ms of which 1 ms to minimize.
[2024-06-03 00:02:44] [INFO ] Deduced a trap composed of 86 places in 92 ms of which 1 ms to minimize.
[2024-06-03 00:02:45] [INFO ] Deduced a trap composed of 49 places in 146 ms of which 2 ms to minimize.
[2024-06-03 00:02:45] [INFO ] Deduced a trap composed of 46 places in 207 ms of which 14 ms to minimize.
[2024-06-03 00:02:46] [INFO ] Deduced a trap composed of 95 places in 162 ms of which 11 ms to minimize.
[2024-06-03 00:02:46] [INFO ] Deduced a trap composed of 59 places in 207 ms of which 2 ms to minimize.
[2024-06-03 00:02:47] [INFO ] Deduced a trap composed of 159 places in 125 ms of which 2 ms to minimize.
[2024-06-03 00:02:47] [INFO ] Deduced a trap composed of 42 places in 123 ms of which 2 ms to minimize.
[2024-06-03 00:02:47] [INFO ] Deduced a trap composed of 78 places in 79 ms of which 1 ms to minimize.
[2024-06-03 00:02:48] [INFO ] Deduced a trap composed of 52 places in 124 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/302 variables, 13/20 constraints. Problems are: Problem set: 0 solved, 539 unsolved
[2024-06-03 00:02:49] [INFO ] Deduced a trap composed of 173 places in 155 ms of which 1 ms to minimize.
[2024-06-03 00:02:50] [INFO ] Deduced a trap composed of 176 places in 118 ms of which 2 ms to minimize.
[2024-06-03 00:02:50] [INFO ] Deduced a trap composed of 177 places in 122 ms of which 2 ms to minimize.
[2024-06-03 00:02:50] [INFO ] Deduced a trap composed of 95 places in 123 ms of which 2 ms to minimize.
[2024-06-03 00:02:51] [INFO ] Deduced a trap composed of 174 places in 123 ms of which 2 ms to minimize.
[2024-06-03 00:02:51] [INFO ] Deduced a trap composed of 91 places in 111 ms of which 1 ms to minimize.
[2024-06-03 00:02:51] [INFO ] Deduced a trap composed of 96 places in 144 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/302 variables, 7/27 constraints. Problems are: Problem set: 0 solved, 539 unsolved
[2024-06-03 00:02:58] [INFO ] Deduced a trap composed of 172 places in 132 ms of which 3 ms to minimize.
[2024-06-03 00:02:58] [INFO ] Deduced a trap composed of 49 places in 108 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/302 variables, 2/29 constraints. Problems are: Problem set: 0 solved, 539 unsolved
[2024-06-03 00:03:01] [INFO ] Deduced a trap composed of 173 places in 106 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/302 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 539 unsolved
[2024-06-03 00:03:05] [INFO ] Deduced a trap composed of 85 places in 112 ms of which 1 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 302/842 variables, and 31 constraints, problems are : Problem set: 0 solved, 539 unsolved in 30083 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/302 constraints, PredecessorRefiner: 539/539 constraints, Known Traps: 24/24 constraints]
Escalating to Integer solving :Problem set: 0 solved, 539 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/301 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 539 unsolved
At refinement iteration 1 (OVERLAPS) 1/302 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 539 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/302 variables, 24/31 constraints. Problems are: Problem set: 0 solved, 539 unsolved
[2024-06-03 00:03:10] [INFO ] Deduced a trap composed of 80 places in 86 ms of which 2 ms to minimize.
[2024-06-03 00:03:10] [INFO ] Deduced a trap composed of 71 places in 118 ms of which 1 ms to minimize.
[2024-06-03 00:03:12] [INFO ] Deduced a trap composed of 107 places in 116 ms of which 2 ms to minimize.
[2024-06-03 00:03:12] [INFO ] Deduced a trap composed of 66 places in 128 ms of which 2 ms to minimize.
[2024-06-03 00:03:12] [INFO ] Deduced a trap composed of 46 places in 172 ms of which 2 ms to minimize.
[2024-06-03 00:03:12] [INFO ] Deduced a trap composed of 58 places in 126 ms of which 2 ms to minimize.
[2024-06-03 00:03:12] [INFO ] Deduced a trap composed of 175 places in 111 ms of which 1 ms to minimize.
[2024-06-03 00:03:13] [INFO ] Deduced a trap composed of 186 places in 120 ms of which 1 ms to minimize.
[2024-06-03 00:03:13] [INFO ] Deduced a trap composed of 173 places in 122 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/302 variables, 9/40 constraints. Problems are: Problem set: 0 solved, 539 unsolved
[2024-06-03 00:03:15] [INFO ] Deduced a trap composed of 103 places in 60 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/302 variables, 1/41 constraints. Problems are: Problem set: 0 solved, 539 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/302 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 539 unsolved
At refinement iteration 6 (OVERLAPS) 540/842 variables, 302/343 constraints. Problems are: Problem set: 0 solved, 539 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/842 variables, 539/882 constraints. Problems are: Problem set: 0 solved, 539 unsolved
[2024-06-03 00:03:34] [INFO ] Deduced a trap composed of 26 places in 61 ms of which 8 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 842/842 variables, and 883 constraints, problems are : Problem set: 0 solved, 539 unsolved in 30053 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 302/302 constraints, PredecessorRefiner: 539/539 constraints, Known Traps: 35/35 constraints]
After SMT, in 60527ms problems are : Problem set: 0 solved, 539 unsolved
Search for dead transitions found 0 dead transitions in 60550ms
Starting structural reductions in LTL mode, iteration 1 : 302/437 places, 540/707 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61474 ms. Remains : 302/437 places, 540/707 transitions.
Support contains 31 out of 302 places after structural reductions.
[2024-06-03 00:03:37] [INFO ] Flatten gal took : 85 ms
[2024-06-03 00:03:37] [INFO ] Flatten gal took : 38 ms
[2024-06-03 00:03:37] [INFO ] Input system was already deterministic with 540 transitions.
Reduction of identical properties reduced properties to check from 21 to 20
RANDOM walk for 40000 steps (21 resets) in 2118 ms. (18 steps per ms) remains 15/20 properties
BEST_FIRST walk for 4003 steps (8 resets) in 40 ms. (97 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (8 resets) in 31 ms. (125 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (9 resets) in 12 ms. (307 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (8 resets) in 30 ms. (129 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 63 ms. (62 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4001 steps (10 resets) in 9 ms. (400 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (8 resets) in 27 ms. (142 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (10 resets) in 9 ms. (400 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (9 resets) in 12 ms. (307 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (9 resets) in 43 ms. (90 steps per ms) remains 14/15 properties
BEST_FIRST walk for 4001 steps (9 resets) in 14 ms. (266 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4003 steps (8 resets) in 61 ms. (64 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4004 steps (9 resets) in 15 ms. (250 steps per ms) remains 14/14 properties
[2024-06-03 00:03:38] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (OVERLAPS) 241/261 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/261 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (OVERLAPS) 14/275 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/275 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (OVERLAPS) 514/789 variables, 275/282 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/789 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 7 (OVERLAPS) 26/815 variables, 13/295 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/815 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 9 (OVERLAPS) 18/833 variables, 7/302 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/833 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 11 (OVERLAPS) 9/842 variables, 7/309 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/842 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 13 (OVERLAPS) 0/842 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Real declared 842/842 variables, and 309 constraints, problems are : Problem set: 0 solved, 14 unsolved in 1438 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 302/302 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 14 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (OVERLAPS) 241/261 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 14 unsolved
[2024-06-03 00:03:40] [INFO ] Deduced a trap composed of 103 places in 129 ms of which 2 ms to minimize.
[2024-06-03 00:03:41] [INFO ] Deduced a trap composed of 105 places in 604 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/261 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/261 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (OVERLAPS) 14/275 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 14 unsolved
[2024-06-03 00:03:42] [INFO ] Deduced a trap composed of 78 places in 104 ms of which 1 ms to minimize.
[2024-06-03 00:03:42] [INFO ] Deduced a trap composed of 83 places in 414 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/275 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/275 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 7 (OVERLAPS) 514/789 variables, 275/286 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/789 variables, 14/300 constraints. Problems are: Problem set: 0 solved, 14 unsolved
[2024-06-03 00:03:43] [INFO ] Deduced a trap composed of 95 places in 66 ms of which 14 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/789 variables, 1/301 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/789 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 11 (OVERLAPS) 26/815 variables, 13/314 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/815 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 13 (OVERLAPS) 18/833 variables, 7/321 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/833 variables, 0/321 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 15 (OVERLAPS) 9/842 variables, 7/328 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/842 variables, 0/328 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 17 (OVERLAPS) 0/842 variables, 0/328 constraints. Problems are: Problem set: 0 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Int declared 842/842 variables, and 328 constraints, problems are : Problem set: 0 solved, 14 unsolved in 4892 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 302/302 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 5/5 constraints]
After SMT, in 6345ms problems are : Problem set: 0 solved, 14 unsolved
Fused 14 Parikh solutions to 13 different solutions.
Parikh walk visited 0 properties in 30298 ms.
Support contains 20 out of 302 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 302/302 places, 540/540 transitions.
Graph (trivial) has 194 edges and 302 vertex of which 11 / 302 are part of one of the 3 SCC in 4 ms
Free SCC test removed 8 places
Drop transitions (Empty/Sink Transition effects.) removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 0 with 31 rules applied. Total rules applied 32 place count 294 transition count 495
Reduce places removed 31 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 33 rules applied. Total rules applied 65 place count 263 transition count 493
Reduce places removed 1 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 3 rules applied. Total rules applied 68 place count 262 transition count 491
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 70 place count 260 transition count 491
Performed 27 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 27 Pre rules applied. Total rules applied 70 place count 260 transition count 464
Deduced a syphon composed of 27 places in 1 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 4 with 54 rules applied. Total rules applied 124 place count 233 transition count 464
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 126 place count 231 transition count 462
Iterating global reduction 4 with 2 rules applied. Total rules applied 128 place count 231 transition count 462
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 4 with 3 rules applied. Total rules applied 131 place count 231 transition count 459
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 132 place count 230 transition count 459
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 28
Deduced a syphon composed of 28 places in 1 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 6 with 56 rules applied. Total rules applied 188 place count 202 transition count 431
Performed 28 Post agglomeration using F-continuation condition with reduction of 5 identical transitions.
Deduced a syphon composed of 28 places in 1 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 6 with 56 rules applied. Total rules applied 244 place count 174 transition count 546
Drop transitions (Redundant composition of simpler transitions.) removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 6 with 11 rules applied. Total rules applied 255 place count 174 transition count 535
Free-agglomeration rule applied 10 times.
Iterating global reduction 6 with 10 rules applied. Total rules applied 265 place count 174 transition count 525
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 6 with 10 rules applied. Total rules applied 275 place count 164 transition count 525
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 7 with 5 rules applied. Total rules applied 280 place count 164 transition count 520
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 282 place count 164 transition count 520
Applied a total of 282 rules in 239 ms. Remains 164 /302 variables (removed 138) and now considering 520/540 (removed 20) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 239 ms. Remains : 164/302 places, 520/540 transitions.
RANDOM walk for 40000 steps (1728 resets) in 923 ms. (43 steps per ms) remains 9/14 properties
BEST_FIRST walk for 40003 steps (217 resets) in 130 ms. (305 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (409 resets) in 114 ms. (347 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (294 resets) in 150 ms. (264 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (419 resets) in 77 ms. (512 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (420 resets) in 55 ms. (714 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (154 resets) in 96 ms. (412 steps per ms) remains 7/9 properties
BEST_FIRST walk for 40003 steps (355 resets) in 110 ms. (360 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (343 resets) in 59 ms. (666 steps per ms) remains 7/7 properties
[2024-06-03 00:04:16] [INFO ] Flow matrix only has 502 transitions (discarded 18 similar events)
// Phase 1: matrix 502 rows 164 cols
[2024-06-03 00:04:16] [INFO ] Computed 7 invariants in 6 ms
[2024-06-03 00:04:16] [INFO ] State equation strengthened by 36 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 139/150 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/150 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 6/156 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/156 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 502/658 variables, 156/163 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/658 variables, 36/199 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/658 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (OVERLAPS) 8/666 variables, 8/207 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/666 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (OVERLAPS) 0/666 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 666/666 variables, and 207 constraints, problems are : Problem set: 0 solved, 7 unsolved in 392 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 164/164 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 139/150 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-06-03 00:04:16] [INFO ] Deduced a trap composed of 64 places in 49 ms of which 1 ms to minimize.
[2024-06-03 00:04:17] [INFO ] Deduced a trap composed of 60 places in 79 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/150 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/150 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 6/156 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-06-03 00:04:17] [INFO ] Deduced a trap composed of 39 places in 50 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/156 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/156 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 502/658 variables, 156/166 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/658 variables, 36/202 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/658 variables, 7/209 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-06-03 00:04:17] [INFO ] Deduced a trap composed of 58 places in 49 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/658 variables, 1/210 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/658 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (OVERLAPS) 8/666 variables, 8/218 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/666 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 14 (OVERLAPS) 0/666 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 666/666 variables, and 218 constraints, problems are : Problem set: 0 solved, 7 unsolved in 1466 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 164/164 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 4/4 constraints]
After SMT, in 1886ms problems are : Problem set: 0 solved, 7 unsolved
Parikh walk visited 0 properties in 4282 ms.
Support contains 11 out of 164 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 164/164 places, 520/520 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 164 transition count 519
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 163 transition count 519
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 2 place count 163 transition count 516
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 8 place count 160 transition count 516
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 10 place count 158 transition count 420
Iterating global reduction 2 with 2 rules applied. Total rules applied 12 place count 158 transition count 420
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 14 place count 158 transition count 418
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 18 place count 156 transition count 424
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 20 place count 156 transition count 422
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 22 place count 154 transition count 422
Applied a total of 22 rules in 32 ms. Remains 154 /164 variables (removed 10) and now considering 422/520 (removed 98) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32 ms. Remains : 154/164 places, 422/520 transitions.
RANDOM walk for 40000 steps (1769 resets) in 236 ms. (168 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (172 resets) in 195 ms. (204 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (455 resets) in 50 ms. (784 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (451 resets) in 48 ms. (816 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (435 resets) in 38 ms. (1025 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (194 resets) in 118 ms. (336 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (381 resets) in 45 ms. (869 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (368 resets) in 41 ms. (952 steps per ms) remains 7/7 properties
Interrupted probabilistic random walk after 527656 steps, run timeout after 3001 ms. (steps per millisecond=175 ) properties seen :3 out of 7
Probabilistic random walk after 527656 steps, saw 150710 distinct states, run finished after 3004 ms. (steps per millisecond=175 ) properties seen :3
[2024-06-03 00:04:26] [INFO ] Flow matrix only has 412 transitions (discarded 10 similar events)
// Phase 1: matrix 412 rows 154 cols
[2024-06-03 00:04:26] [INFO ] Computed 7 invariants in 6 ms
[2024-06-03 00:04:26] [INFO ] State equation strengthened by 34 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 128/134 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-03 00:04:26] [INFO ] Deduced a trap composed of 57 places in 44 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/134 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/134 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 12/146 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-03 00:04:26] [INFO ] Deduced a trap composed of 39 places in 46 ms of which 1 ms to minimize.
[2024-06-03 00:04:26] [INFO ] Deduced a trap composed of 60 places in 42 ms of which 1 ms to minimize.
[2024-06-03 00:04:26] [INFO ] Deduced a trap composed of 42 places in 43 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/146 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/146 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 412/558 variables, 146/157 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/558 variables, 34/191 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/558 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 8/566 variables, 8/199 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/566 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 0/566 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 566/566 variables, and 199 constraints, problems are : Problem set: 0 solved, 4 unsolved in 643 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 154/154 constraints, ReadFeed: 34/34 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 128/134 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/134 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/134 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 12/146 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/146 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/146 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 412/558 variables, 146/157 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/558 variables, 34/191 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/558 variables, 4/195 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-03 00:04:26] [INFO ] Deduced a trap composed of 51 places in 48 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/558 variables, 1/196 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/558 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 8/566 variables, 8/204 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/566 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 0/566 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 566/566 variables, and 204 constraints, problems are : Problem set: 0 solved, 4 unsolved in 530 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 154/154 constraints, ReadFeed: 34/34 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 5/5 constraints]
After SMT, in 1198ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 2181 ms.
Support contains 6 out of 154 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 154/154 places, 422/422 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 154 transition count 421
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 153 transition count 421
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 152 transition count 420
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 151 transition count 419
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 151 transition count 419
Free-agglomeration rule applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 9 place count 151 transition count 416
Reduce places removed 3 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 17 place count 148 transition count 411
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 19 place count 146 transition count 409
Iterating global reduction 1 with 2 rules applied. Total rules applied 21 place count 146 transition count 409
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 24 place count 146 transition count 406
Drop transitions (Redundant composition of simpler transitions.) removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 2 with 11 rules applied. Total rules applied 35 place count 146 transition count 395
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 36 place count 146 transition count 395
Applied a total of 36 rules in 42 ms. Remains 146 /154 variables (removed 8) and now considering 395/422 (removed 27) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42 ms. Remains : 146/154 places, 395/422 transitions.
RANDOM walk for 40000 steps (1941 resets) in 115 ms. (344 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (473 resets) in 42 ms. (930 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (476 resets) in 32 ms. (1212 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (190 resets) in 65 ms. (606 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (396 resets) in 36 ms. (1081 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 548357 steps, run timeout after 3001 ms. (steps per millisecond=182 ) properties seen :1 out of 4
Probabilistic random walk after 548357 steps, saw 158292 distinct states, run finished after 3001 ms. (steps per millisecond=182 ) properties seen :1
[2024-06-03 00:04:32] [INFO ] Flow matrix only has 389 transitions (discarded 6 similar events)
// Phase 1: matrix 389 rows 146 cols
[2024-06-03 00:04:32] [INFO ] Computed 7 invariants in 3 ms
[2024-06-03 00:04:32] [INFO ] State equation strengthened by 70 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 69/74 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-03 00:04:32] [INFO ] Deduced a trap composed of 56 places in 31 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/74 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/74 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 64/138 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/138 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 389/527 variables, 138/146 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/527 variables, 70/216 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/527 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 8/535 variables, 8/224 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/535 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 0/535 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 535/535 variables, and 224 constraints, problems are : Problem set: 0 solved, 3 unsolved in 281 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 146/146 constraints, ReadFeed: 70/70 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 69/74 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/74 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/74 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 64/138 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-03 00:04:32] [INFO ] Deduced a trap composed of 41 places in 39 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/138 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/138 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 389/527 variables, 138/147 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/527 variables, 70/217 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/527 variables, 3/220 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-03 00:04:33] [INFO ] Deduced a trap composed of 50 places in 40 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/527 variables, 1/221 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/527 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 8/535 variables, 8/229 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/535 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 0/535 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 535/535 variables, and 229 constraints, problems are : Problem set: 0 solved, 3 unsolved in 437 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 146/146 constraints, ReadFeed: 70/70 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 3/3 constraints]
After SMT, in 729ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 795 ms.
Support contains 5 out of 146 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 146/146 places, 395/395 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 145 transition count 394
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 144 transition count 393
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 144 transition count 393
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 143 transition count 387
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 143 transition count 387
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 142 transition count 385
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 142 transition count 385
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 141 transition count 382
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 141 transition count 382
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 140 transition count 380
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 140 transition count 380
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 139 transition count 377
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 139 transition count 377
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 138 transition count 375
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 138 transition count 375
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 137 transition count 372
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 137 transition count 372
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 136 transition count 370
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 136 transition count 370
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 135 transition count 367
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 135 transition count 367
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 134 transition count 365
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 134 transition count 365
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 133 transition count 363
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 133 transition count 363
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 132 transition count 361
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 132 transition count 361
Applied a total of 28 rules in 38 ms. Remains 132 /146 variables (removed 14) and now considering 361/395 (removed 34) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 38 ms. Remains : 132/146 places, 361/395 transitions.
RANDOM walk for 40000 steps (1884 resets) in 111 ms. (357 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (485 resets) in 47 ms. (833 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (190 resets) in 66 ms. (597 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (409 resets) in 52 ms. (754 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 676207 steps, run timeout after 3001 ms. (steps per millisecond=225 ) properties seen :0 out of 3
Probabilistic random walk after 676207 steps, saw 187022 distinct states, run finished after 3001 ms. (steps per millisecond=225 ) properties seen :0
[2024-06-03 00:04:37] [INFO ] Flow matrix only has 355 transitions (discarded 6 similar events)
// Phase 1: matrix 355 rows 132 cols
[2024-06-03 00:04:37] [INFO ] Computed 7 invariants in 5 ms
[2024-06-03 00:04:37] [INFO ] State equation strengthened by 64 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 69/74 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-03 00:04:37] [INFO ] Deduced a trap composed of 56 places in 40 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/74 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/74 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 50/124 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-03 00:04:37] [INFO ] Deduced a trap composed of 41 places in 37 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/124 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/124 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 355/479 variables, 124/133 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/479 variables, 64/197 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/479 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 8/487 variables, 8/205 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/487 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 0/487 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 487/487 variables, and 205 constraints, problems are : Problem set: 0 solved, 3 unsolved in 340 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 132/132 constraints, ReadFeed: 64/64 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 69/74 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/74 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/74 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 50/124 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/124 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/124 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 355/479 variables, 124/133 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/479 variables, 64/197 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/479 variables, 3/200 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/479 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 8/487 variables, 8/208 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/487 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 0/487 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 487/487 variables, and 208 constraints, problems are : Problem set: 0 solved, 3 unsolved in 348 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 132/132 constraints, ReadFeed: 64/64 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 2/2 constraints]
After SMT, in 707ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 296 ms.
Support contains 5 out of 132 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 132/132 places, 361/361 transitions.
Applied a total of 0 rules in 19 ms. Remains 132 /132 variables (removed 0) and now considering 361/361 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 132/132 places, 361/361 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 132/132 places, 361/361 transitions.
Applied a total of 0 rules in 7 ms. Remains 132 /132 variables (removed 0) and now considering 361/361 (removed 0) transitions.
[2024-06-03 00:04:38] [INFO ] Flow matrix only has 355 transitions (discarded 6 similar events)
[2024-06-03 00:04:38] [INFO ] Invariant cache hit.
[2024-06-03 00:04:38] [INFO ] Implicit Places using invariants in 89 ms returned []
[2024-06-03 00:04:38] [INFO ] Flow matrix only has 355 transitions (discarded 6 similar events)
[2024-06-03 00:04:38] [INFO ] Invariant cache hit.
[2024-06-03 00:04:38] [INFO ] State equation strengthened by 64 read => feed constraints.
[2024-06-03 00:04:38] [INFO ] Implicit Places using invariants and state equation in 231 ms returned []
Implicit Place search using SMT with State Equation took 326 ms to find 0 implicit places.
[2024-06-03 00:04:38] [INFO ] Redundant transitions in 22 ms returned []
Running 357 sub problems to find dead transitions.
[2024-06-03 00:04:38] [INFO ] Flow matrix only has 355 transitions (discarded 6 similar events)
[2024-06-03 00:04:38] [INFO ] Invariant cache hit.
[2024-06-03 00:04:38] [INFO ] State equation strengthened by 64 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/131 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 357 unsolved
At refinement iteration 1 (OVERLAPS) 1/132 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 357 unsolved
[2024-06-03 00:04:40] [INFO ] Deduced a trap composed of 56 places in 40 ms of which 0 ms to minimize.
[2024-06-03 00:04:40] [INFO ] Deduced a trap composed of 45 places in 73 ms of which 1 ms to minimize.
[2024-06-03 00:04:40] [INFO ] Deduced a trap composed of 16 places in 73 ms of which 1 ms to minimize.
[2024-06-03 00:04:41] [INFO ] Deduced a trap composed of 22 places in 66 ms of which 2 ms to minimize.
[2024-06-03 00:04:41] [INFO ] Deduced a trap composed of 25 places in 74 ms of which 1 ms to minimize.
[2024-06-03 00:04:41] [INFO ] Deduced a trap composed of 50 places in 40 ms of which 1 ms to minimize.
[2024-06-03 00:04:41] [INFO ] Deduced a trap composed of 73 places in 69 ms of which 1 ms to minimize.
[2024-06-03 00:04:41] [INFO ] Deduced a trap composed of 40 places in 73 ms of which 1 ms to minimize.
[2024-06-03 00:04:41] [INFO ] Deduced a trap composed of 24 places in 69 ms of which 1 ms to minimize.
[2024-06-03 00:04:42] [INFO ] Deduced a trap composed of 95 places in 70 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/132 variables, 10/17 constraints. Problems are: Problem set: 0 solved, 357 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/132 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 357 unsolved
At refinement iteration 4 (OVERLAPS) 355/487 variables, 132/149 constraints. Problems are: Problem set: 0 solved, 357 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/487 variables, 64/213 constraints. Problems are: Problem set: 0 solved, 357 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/487 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 357 unsolved
At refinement iteration 7 (OVERLAPS) 0/487 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 357 unsolved
No progress, stopping.
After SMT solving in domain Real declared 487/487 variables, and 213 constraints, problems are : Problem set: 0 solved, 357 unsolved in 11378 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 132/132 constraints, ReadFeed: 64/64 constraints, PredecessorRefiner: 357/357 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 357 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/131 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 357 unsolved
At refinement iteration 1 (OVERLAPS) 1/132 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 357 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/132 variables, 10/17 constraints. Problems are: Problem set: 0 solved, 357 unsolved
[2024-06-03 00:04:51] [INFO ] Deduced a trap composed of 35 places in 38 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/132 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 357 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/132 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 357 unsolved
At refinement iteration 5 (OVERLAPS) 355/487 variables, 132/150 constraints. Problems are: Problem set: 0 solved, 357 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/487 variables, 64/214 constraints. Problems are: Problem set: 0 solved, 357 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/487 variables, 357/571 constraints. Problems are: Problem set: 0 solved, 357 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/487 variables, 0/571 constraints. Problems are: Problem set: 0 solved, 357 unsolved
At refinement iteration 9 (OVERLAPS) 0/487 variables, 0/571 constraints. Problems are: Problem set: 0 solved, 357 unsolved
No progress, stopping.
After SMT solving in domain Int declared 487/487 variables, and 571 constraints, problems are : Problem set: 0 solved, 357 unsolved in 29801 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 132/132 constraints, ReadFeed: 64/64 constraints, PredecessorRefiner: 357/357 constraints, Known Traps: 11/11 constraints]
After SMT, in 41501ms problems are : Problem set: 0 solved, 357 unsolved
Search for dead transitions found 0 dead transitions in 41505ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41879 ms. Remains : 132/132 places, 361/361 transitions.
FORMULA FireWire-PT-18-LTLFireability-07 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 86 stabilizing places and 132 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((F(p0)||G(p1)))))'
Support contains 4 out of 302 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 302/302 places, 540/540 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 291 transition count 490
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 291 transition count 490
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 24 place count 291 transition count 488
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 30 place count 285 transition count 479
Iterating global reduction 1 with 6 rules applied. Total rules applied 36 place count 285 transition count 479
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 40 place count 281 transition count 472
Iterating global reduction 1 with 4 rules applied. Total rules applied 44 place count 281 transition count 472
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 46 place count 279 transition count 466
Iterating global reduction 1 with 2 rules applied. Total rules applied 48 place count 279 transition count 466
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 50 place count 277 transition count 462
Iterating global reduction 1 with 2 rules applied. Total rules applied 52 place count 277 transition count 462
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 54 place count 275 transition count 457
Iterating global reduction 1 with 2 rules applied. Total rules applied 56 place count 275 transition count 457
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 58 place count 273 transition count 453
Iterating global reduction 1 with 2 rules applied. Total rules applied 60 place count 273 transition count 453
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 62 place count 271 transition count 449
Iterating global reduction 1 with 2 rules applied. Total rules applied 64 place count 271 transition count 449
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 65 place count 270 transition count 447
Iterating global reduction 1 with 1 rules applied. Total rules applied 66 place count 270 transition count 447
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 67 place count 269 transition count 444
Iterating global reduction 1 with 1 rules applied. Total rules applied 68 place count 269 transition count 444
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 69 place count 268 transition count 442
Iterating global reduction 1 with 1 rules applied. Total rules applied 70 place count 268 transition count 442
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 71 place count 267 transition count 439
Iterating global reduction 1 with 1 rules applied. Total rules applied 72 place count 267 transition count 439
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 73 place count 266 transition count 437
Iterating global reduction 1 with 1 rules applied. Total rules applied 74 place count 266 transition count 437
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 75 place count 265 transition count 435
Iterating global reduction 1 with 1 rules applied. Total rules applied 76 place count 265 transition count 435
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 77 place count 264 transition count 433
Iterating global reduction 1 with 1 rules applied. Total rules applied 78 place count 264 transition count 433
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 79 place count 263 transition count 432
Iterating global reduction 1 with 1 rules applied. Total rules applied 80 place count 263 transition count 432
Applied a total of 80 rules in 38 ms. Remains 263 /302 variables (removed 39) and now considering 432/540 (removed 108) transitions.
// Phase 1: matrix 432 rows 263 cols
[2024-06-03 00:05:20] [INFO ] Computed 7 invariants in 5 ms
[2024-06-03 00:05:20] [INFO ] Implicit Places using invariants in 107 ms returned []
[2024-06-03 00:05:20] [INFO ] Invariant cache hit.
[2024-06-03 00:05:20] [INFO ] Implicit Places using invariants and state equation in 265 ms returned []
Implicit Place search using SMT with State Equation took 374 ms to find 0 implicit places.
Running 431 sub problems to find dead transitions.
[2024-06-03 00:05:20] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/262 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 431 unsolved
At refinement iteration 1 (OVERLAPS) 1/263 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 431 unsolved
[2024-06-03 00:05:24] [INFO ] Deduced a trap composed of 166 places in 87 ms of which 2 ms to minimize.
[2024-06-03 00:05:24] [INFO ] Deduced a trap composed of 77 places in 42 ms of which 1 ms to minimize.
[2024-06-03 00:05:24] [INFO ] Deduced a trap composed of 76 places in 49 ms of which 1 ms to minimize.
[2024-06-03 00:05:25] [INFO ] Deduced a trap composed of 149 places in 90 ms of which 1 ms to minimize.
[2024-06-03 00:05:25] [INFO ] Deduced a trap composed of 77 places in 50 ms of which 1 ms to minimize.
[2024-06-03 00:05:25] [INFO ] Deduced a trap composed of 76 places in 53 ms of which 1 ms to minimize.
[2024-06-03 00:05:26] [INFO ] Deduced a trap composed of 39 places in 84 ms of which 2 ms to minimize.
[2024-06-03 00:05:26] [INFO ] Deduced a trap composed of 82 places in 94 ms of which 2 ms to minimize.
[2024-06-03 00:05:26] [INFO ] Deduced a trap composed of 49 places in 86 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/263 variables, 9/16 constraints. Problems are: Problem set: 0 solved, 431 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/263 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 431 unsolved
At refinement iteration 4 (OVERLAPS) 432/695 variables, 263/279 constraints. Problems are: Problem set: 0 solved, 431 unsolved
[2024-06-03 00:05:33] [INFO ] Deduced a trap composed of 106 places in 91 ms of which 1 ms to minimize.
[2024-06-03 00:05:33] [INFO ] Deduced a trap composed of 59 places in 92 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/695 variables, 2/281 constraints. Problems are: Problem set: 0 solved, 431 unsolved
[2024-06-03 00:05:37] [INFO ] Deduced a trap composed of 63 places in 92 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/695 variables, 1/282 constraints. Problems are: Problem set: 0 solved, 431 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/695 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 431 unsolved
At refinement iteration 8 (OVERLAPS) 0/695 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 431 unsolved
No progress, stopping.
After SMT solving in domain Real declared 695/695 variables, and 282 constraints, problems are : Problem set: 0 solved, 431 unsolved in 29484 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 263/263 constraints, PredecessorRefiner: 431/431 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 431 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/262 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 431 unsolved
At refinement iteration 1 (OVERLAPS) 1/263 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 431 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/263 variables, 12/19 constraints. Problems are: Problem set: 0 solved, 431 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/263 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 431 unsolved
At refinement iteration 4 (OVERLAPS) 432/695 variables, 263/282 constraints. Problems are: Problem set: 0 solved, 431 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/695 variables, 431/713 constraints. Problems are: Problem set: 0 solved, 431 unsolved
[2024-06-03 00:05:58] [INFO ] Deduced a trap composed of 91 places in 103 ms of which 2 ms to minimize.
[2024-06-03 00:05:59] [INFO ] Deduced a trap composed of 153 places in 110 ms of which 2 ms to minimize.
[2024-06-03 00:05:59] [INFO ] Deduced a trap composed of 146 places in 101 ms of which 2 ms to minimize.
[2024-06-03 00:05:59] [INFO ] Deduced a trap composed of 23 places in 70 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/695 variables, 4/717 constraints. Problems are: Problem set: 0 solved, 431 unsolved
[2024-06-03 00:06:11] [INFO ] Deduced a trap composed of 158 places in 93 ms of which 2 ms to minimize.
[2024-06-03 00:06:13] [INFO ] Deduced a trap composed of 162 places in 105 ms of which 2 ms to minimize.
[2024-06-03 00:06:13] [INFO ] Deduced a trap composed of 158 places in 92 ms of which 2 ms to minimize.
[2024-06-03 00:06:18] [INFO ] Deduced a trap composed of 163 places in 90 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/695 variables, 4/721 constraints. Problems are: Problem set: 0 solved, 431 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 695/695 variables, and 721 constraints, problems are : Problem set: 0 solved, 431 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 263/263 constraints, PredecessorRefiner: 431/431 constraints, Known Traps: 20/20 constraints]
After SMT, in 59612ms problems are : Problem set: 0 solved, 431 unsolved
Search for dead transitions found 0 dead transitions in 59616ms
Starting structural reductions in LTL mode, iteration 1 : 263/302 places, 432/540 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60031 ms. Remains : 263/302 places, 432/540 transitions.
Stuttering acceptance computed with spot in 306 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : FireWire-PT-18-LTLFireability-01
Product exploration explored 100000 steps with 33333 reset in 216 ms.
Product exploration explored 100000 steps with 33333 reset in 158 ms.
Computed a total of 56 stabilizing places and 72 stable transitions
Computed a total of 56 stabilizing places and 72 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 5 factoid took 27 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FireWire-PT-18-LTLFireability-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FireWire-PT-18-LTLFireability-01 finished in 60844 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(G((p0||F(p1)))) U p0))'
Support contains 3 out of 302 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 302/302 places, 540/540 transitions.
Graph (trivial) has 214 edges and 302 vertex of which 11 / 302 are part of one of the 3 SCC in 1 ms
Free SCC test removed 8 places
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 38 transitions
Trivial Post-agglo rules discarded 38 transitions
Performed 38 trivial Post agglomeration. Transition count delta: 38
Iterating post reduction 0 with 38 rules applied. Total rules applied 39 place count 293 transition count 492
Reduce places removed 38 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 40 rules applied. Total rules applied 79 place count 255 transition count 490
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 80 place count 254 transition count 490
Performed 26 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 26 Pre rules applied. Total rules applied 80 place count 254 transition count 464
Deduced a syphon composed of 26 places in 1 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 3 with 52 rules applied. Total rules applied 132 place count 228 transition count 464
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 139 place count 221 transition count 418
Iterating global reduction 3 with 7 rules applied. Total rules applied 146 place count 221 transition count 418
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 150 place count 221 transition count 414
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 151 place count 220 transition count 414
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 151 place count 220 transition count 413
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 153 place count 219 transition count 413
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 156 place count 216 transition count 408
Iterating global reduction 5 with 3 rules applied. Total rules applied 159 place count 216 transition count 408
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 161 place count 214 transition count 404
Iterating global reduction 5 with 2 rules applied. Total rules applied 163 place count 214 transition count 404
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 165 place count 212 transition count 398
Iterating global reduction 5 with 2 rules applied. Total rules applied 167 place count 212 transition count 398
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 169 place count 210 transition count 394
Iterating global reduction 5 with 2 rules applied. Total rules applied 171 place count 210 transition count 394
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 173 place count 208 transition count 389
Iterating global reduction 5 with 2 rules applied. Total rules applied 175 place count 208 transition count 389
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 177 place count 206 transition count 385
Iterating global reduction 5 with 2 rules applied. Total rules applied 179 place count 206 transition count 385
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 180 place count 205 transition count 382
Iterating global reduction 5 with 1 rules applied. Total rules applied 181 place count 205 transition count 382
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 182 place count 204 transition count 380
Iterating global reduction 5 with 1 rules applied. Total rules applied 183 place count 204 transition count 380
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 184 place count 203 transition count 377
Iterating global reduction 5 with 1 rules applied. Total rules applied 185 place count 203 transition count 377
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 186 place count 202 transition count 375
Iterating global reduction 5 with 1 rules applied. Total rules applied 187 place count 202 transition count 375
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 188 place count 201 transition count 372
Iterating global reduction 5 with 1 rules applied. Total rules applied 189 place count 201 transition count 372
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 190 place count 200 transition count 370
Iterating global reduction 5 with 1 rules applied. Total rules applied 191 place count 200 transition count 370
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 192 place count 199 transition count 368
Iterating global reduction 5 with 1 rules applied. Total rules applied 193 place count 199 transition count 368
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 194 place count 198 transition count 366
Iterating global reduction 5 with 1 rules applied. Total rules applied 195 place count 198 transition count 366
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 27
Deduced a syphon composed of 27 places in 0 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 5 with 54 rules applied. Total rules applied 249 place count 171 transition count 339
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 250 place count 171 transition count 338
Performed 30 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 6 with 60 rules applied. Total rules applied 310 place count 141 transition count 418
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 312 place count 141 transition count 416
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 313 place count 140 transition count 415
Applied a total of 313 rules in 120 ms. Remains 140 /302 variables (removed 162) and now considering 415/540 (removed 125) transitions.
[2024-06-03 00:06:21] [INFO ] Flow matrix only has 396 transitions (discarded 19 similar events)
// Phase 1: matrix 396 rows 140 cols
[2024-06-03 00:06:21] [INFO ] Computed 7 invariants in 3 ms
[2024-06-03 00:06:21] [INFO ] Implicit Places using invariants in 90 ms returned []
[2024-06-03 00:06:21] [INFO ] Flow matrix only has 396 transitions (discarded 19 similar events)
[2024-06-03 00:06:21] [INFO ] Invariant cache hit.
[2024-06-03 00:06:21] [INFO ] State equation strengthened by 25 read => feed constraints.
[2024-06-03 00:06:21] [INFO ] Implicit Places using invariants and state equation in 239 ms returned []
Implicit Place search using SMT with State Equation took 334 ms to find 0 implicit places.
[2024-06-03 00:06:21] [INFO ] Redundant transitions in 8 ms returned []
Running 408 sub problems to find dead transitions.
[2024-06-03 00:06:21] [INFO ] Flow matrix only has 396 transitions (discarded 19 similar events)
[2024-06-03 00:06:21] [INFO ] Invariant cache hit.
[2024-06-03 00:06:21] [INFO ] State equation strengthened by 25 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/139 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 408 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/139 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 408 unsolved
At refinement iteration 2 (OVERLAPS) 1/140 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 408 unsolved
[2024-06-03 00:06:24] [INFO ] Deduced a trap composed of 51 places in 44 ms of which 1 ms to minimize.
[2024-06-03 00:06:24] [INFO ] Deduced a trap composed of 23 places in 84 ms of which 1 ms to minimize.
[2024-06-03 00:06:24] [INFO ] Deduced a trap composed of 26 places in 82 ms of which 1 ms to minimize.
[2024-06-03 00:06:25] [INFO ] Deduced a trap composed of 25 places in 81 ms of which 1 ms to minimize.
[2024-06-03 00:06:25] [INFO ] Deduced a trap composed of 94 places in 83 ms of which 1 ms to minimize.
[2024-06-03 00:06:25] [INFO ] Deduced a trap composed of 39 places in 87 ms of which 0 ms to minimize.
[2024-06-03 00:06:25] [INFO ] Deduced a trap composed of 42 places in 55 ms of which 1 ms to minimize.
[2024-06-03 00:06:25] [INFO ] Deduced a trap composed of 40 places in 65 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/140 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 408 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/140 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 408 unsolved
At refinement iteration 5 (OVERLAPS) 395/535 variables, 140/155 constraints. Problems are: Problem set: 0 solved, 408 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/535 variables, 25/180 constraints. Problems are: Problem set: 0 solved, 408 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/535 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 408 unsolved
At refinement iteration 8 (OVERLAPS) 0/535 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 408 unsolved
No progress, stopping.
After SMT solving in domain Real declared 535/536 variables, and 180 constraints, problems are : Problem set: 0 solved, 408 unsolved in 13837 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 140/140 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 408/408 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 408 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/139 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 408 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/139 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 408 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/139 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 408 unsolved
At refinement iteration 3 (OVERLAPS) 1/140 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 408 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/140 variables, 5/15 constraints. Problems are: Problem set: 0 solved, 408 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/140 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 408 unsolved
At refinement iteration 6 (OVERLAPS) 395/535 variables, 140/155 constraints. Problems are: Problem set: 0 solved, 408 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/535 variables, 25/180 constraints. Problems are: Problem set: 0 solved, 408 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/535 variables, 408/588 constraints. Problems are: Problem set: 0 solved, 408 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/535 variables, 0/588 constraints. Problems are: Problem set: 0 solved, 408 unsolved
At refinement iteration 10 (OVERLAPS) 0/535 variables, 0/588 constraints. Problems are: Problem set: 0 solved, 408 unsolved
No progress, stopping.
After SMT solving in domain Int declared 535/536 variables, and 588 constraints, problems are : Problem set: 0 solved, 408 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 140/140 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 408/408 constraints, Known Traps: 8/8 constraints]
After SMT, in 44177ms problems are : Problem set: 0 solved, 408 unsolved
Search for dead transitions found 0 dead transitions in 44181ms
Starting structural reductions in SI_LTL mode, iteration 1 : 140/302 places, 415/540 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 44652 ms. Remains : 140/302 places, 415/540 transitions.
Stuttering acceptance computed with spot in 133 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : FireWire-PT-18-LTLFireability-02
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA FireWire-PT-18-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-18-LTLFireability-02 finished in 44804 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(X((F(p0)||(X(p1) U p2))))))'
Support contains 5 out of 302 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 302/302 places, 540/540 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 292 transition count 492
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 292 transition count 492
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 22 place count 292 transition count 490
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 27 place count 287 transition count 484
Iterating global reduction 1 with 5 rules applied. Total rules applied 32 place count 287 transition count 484
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 35 place count 284 transition count 479
Iterating global reduction 1 with 3 rules applied. Total rules applied 38 place count 284 transition count 479
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 39 place count 283 transition count 476
Iterating global reduction 1 with 1 rules applied. Total rules applied 40 place count 283 transition count 476
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 41 place count 282 transition count 474
Iterating global reduction 1 with 1 rules applied. Total rules applied 42 place count 282 transition count 474
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 43 place count 281 transition count 471
Iterating global reduction 1 with 1 rules applied. Total rules applied 44 place count 281 transition count 471
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 45 place count 280 transition count 469
Iterating global reduction 1 with 1 rules applied. Total rules applied 46 place count 280 transition count 469
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 47 place count 279 transition count 466
Iterating global reduction 1 with 1 rules applied. Total rules applied 48 place count 279 transition count 466
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 49 place count 278 transition count 464
Iterating global reduction 1 with 1 rules applied. Total rules applied 50 place count 278 transition count 464
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 51 place count 277 transition count 461
Iterating global reduction 1 with 1 rules applied. Total rules applied 52 place count 277 transition count 461
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 53 place count 276 transition count 459
Iterating global reduction 1 with 1 rules applied. Total rules applied 54 place count 276 transition count 459
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 55 place count 275 transition count 456
Iterating global reduction 1 with 1 rules applied. Total rules applied 56 place count 275 transition count 456
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 57 place count 274 transition count 454
Iterating global reduction 1 with 1 rules applied. Total rules applied 58 place count 274 transition count 454
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 59 place count 273 transition count 452
Iterating global reduction 1 with 1 rules applied. Total rules applied 60 place count 273 transition count 452
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 61 place count 272 transition count 450
Iterating global reduction 1 with 1 rules applied. Total rules applied 62 place count 272 transition count 450
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 63 place count 271 transition count 449
Iterating global reduction 1 with 1 rules applied. Total rules applied 64 place count 271 transition count 449
Applied a total of 64 rules in 91 ms. Remains 271 /302 variables (removed 31) and now considering 449/540 (removed 91) transitions.
// Phase 1: matrix 449 rows 271 cols
[2024-06-03 00:07:06] [INFO ] Computed 7 invariants in 2 ms
[2024-06-03 00:07:06] [INFO ] Implicit Places using invariants in 344 ms returned []
[2024-06-03 00:07:06] [INFO ] Invariant cache hit.
[2024-06-03 00:07:06] [INFO ] Implicit Places using invariants and state equation in 270 ms returned []
Implicit Place search using SMT with State Equation took 629 ms to find 0 implicit places.
Running 448 sub problems to find dead transitions.
[2024-06-03 00:07:06] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/270 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 448 unsolved
At refinement iteration 1 (OVERLAPS) 1/271 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 448 unsolved
[2024-06-03 00:07:10] [INFO ] Deduced a trap composed of 166 places in 95 ms of which 2 ms to minimize.
[2024-06-03 00:07:10] [INFO ] Deduced a trap composed of 77 places in 58 ms of which 1 ms to minimize.
[2024-06-03 00:07:11] [INFO ] Deduced a trap composed of 76 places in 62 ms of which 1 ms to minimize.
[2024-06-03 00:07:11] [INFO ] Deduced a trap composed of 88 places in 68 ms of which 1 ms to minimize.
[2024-06-03 00:07:11] [INFO ] Deduced a trap composed of 77 places in 71 ms of which 1 ms to minimize.
[2024-06-03 00:07:11] [INFO ] Deduced a trap composed of 76 places in 60 ms of which 1 ms to minimize.
[2024-06-03 00:07:12] [INFO ] Deduced a trap composed of 39 places in 107 ms of which 2 ms to minimize.
[2024-06-03 00:07:12] [INFO ] Deduced a trap composed of 87 places in 129 ms of which 1 ms to minimize.
[2024-06-03 00:07:12] [INFO ] Deduced a trap composed of 49 places in 110 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/271 variables, 9/16 constraints. Problems are: Problem set: 0 solved, 448 unsolved
[2024-06-03 00:07:14] [INFO ] Deduced a trap composed of 155 places in 104 ms of which 2 ms to minimize.
[2024-06-03 00:07:14] [INFO ] Deduced a trap composed of 165 places in 89 ms of which 2 ms to minimize.
[2024-06-03 00:07:14] [INFO ] Deduced a trap composed of 152 places in 107 ms of which 2 ms to minimize.
[2024-06-03 00:07:14] [INFO ] Deduced a trap composed of 162 places in 109 ms of which 2 ms to minimize.
[2024-06-03 00:07:15] [INFO ] Deduced a trap composed of 153 places in 108 ms of which 1 ms to minimize.
[2024-06-03 00:07:15] [INFO ] Deduced a trap composed of 91 places in 54 ms of which 1 ms to minimize.
[2024-06-03 00:07:15] [INFO ] Deduced a trap composed of 78 places in 64 ms of which 1 ms to minimize.
[2024-06-03 00:07:16] [INFO ] Deduced a trap composed of 154 places in 132 ms of which 1 ms to minimize.
[2024-06-03 00:07:16] [INFO ] Deduced a trap composed of 78 places in 121 ms of which 1 ms to minimize.
[2024-06-03 00:07:16] [INFO ] Deduced a trap composed of 166 places in 100 ms of which 1 ms to minimize.
[2024-06-03 00:07:16] [INFO ] Deduced a trap composed of 155 places in 120 ms of which 2 ms to minimize.
[2024-06-03 00:07:16] [INFO ] Deduced a trap composed of 161 places in 111 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/271 variables, 12/28 constraints. Problems are: Problem set: 0 solved, 448 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/271 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 448 unsolved
At refinement iteration 5 (OVERLAPS) 449/720 variables, 271/299 constraints. Problems are: Problem set: 0 solved, 448 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/720 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 448 unsolved
At refinement iteration 7 (OVERLAPS) 0/720 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 448 unsolved
No progress, stopping.
After SMT solving in domain Real declared 720/720 variables, and 299 constraints, problems are : Problem set: 0 solved, 448 unsolved in 29036 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 271/271 constraints, PredecessorRefiner: 448/448 constraints, Known Traps: 21/21 constraints]
Escalating to Integer solving :Problem set: 0 solved, 448 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/270 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 448 unsolved
At refinement iteration 1 (OVERLAPS) 1/271 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 448 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/271 variables, 21/28 constraints. Problems are: Problem set: 0 solved, 448 unsolved
[2024-06-03 00:07:38] [INFO ] Deduced a trap composed of 155 places in 90 ms of which 2 ms to minimize.
[2024-06-03 00:07:39] [INFO ] Deduced a trap composed of 156 places in 94 ms of which 2 ms to minimize.
[2024-06-03 00:07:39] [INFO ] Deduced a trap composed of 154 places in 90 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/271 variables, 3/31 constraints. Problems are: Problem set: 0 solved, 448 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/271 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 448 unsolved
At refinement iteration 5 (OVERLAPS) 449/720 variables, 271/302 constraints. Problems are: Problem set: 0 solved, 448 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/720 variables, 448/750 constraints. Problems are: Problem set: 0 solved, 448 unsolved
[2024-06-03 00:07:48] [INFO ] Deduced a trap composed of 164 places in 104 ms of which 2 ms to minimize.
[2024-06-03 00:07:48] [INFO ] Deduced a trap composed of 23 places in 78 ms of which 1 ms to minimize.
[2024-06-03 00:07:55] [INFO ] Deduced a trap composed of 171 places in 90 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/720 variables, 3/753 constraints. Problems are: Problem set: 0 solved, 448 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 720/720 variables, and 753 constraints, problems are : Problem set: 0 solved, 448 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 271/271 constraints, PredecessorRefiner: 448/448 constraints, Known Traps: 27/27 constraints]
After SMT, in 59183ms problems are : Problem set: 0 solved, 448 unsolved
Search for dead transitions found 0 dead transitions in 59187ms
Starting structural reductions in LTL mode, iteration 1 : 271/302 places, 449/540 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 59908 ms. Remains : 271/302 places, 449/540 transitions.
Stuttering acceptance computed with spot in 134 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : FireWire-PT-18-LTLFireability-08
Product exploration explored 100000 steps with 1 reset in 78 ms.
Product exploration explored 100000 steps with 1 reset in 164 ms.
Computed a total of 64 stabilizing places and 89 stable transitions
Computed a total of 64 stabilizing places and 89 stable transitions
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p2)), (X (NOT (AND (NOT p0) (NOT p2)))), (X p0), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 199 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter sensitive) to 3 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 105 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
RANDOM walk for 40000 steps (17 resets) in 322 ms. (123 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40000 steps (13 resets) in 309 ms. (129 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40000 steps (15 resets) in 193 ms. (206 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40000 steps (26 resets) in 121 ms. (327 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40000 steps (9 resets) in 233 ms. (170 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40000 steps (14 resets) in 106 ms. (373 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 1350573 steps, run timeout after 3001 ms. (steps per millisecond=450 ) properties seen :4 out of 5
Probabilistic random walk after 1350573 steps, saw 313707 distinct states, run finished after 3001 ms. (steps per millisecond=450 ) properties seen :4
[2024-06-03 00:08:10] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 125/127 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/127 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 120/247 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-03 00:08:10] [INFO ] Deduced a trap composed of 88 places in 57 ms of which 1 ms to minimize.
[2024-06-03 00:08:10] [INFO ] Deduced a trap composed of 76 places in 51 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/247 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/247 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 425/672 variables, 247/256 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/672 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 24/696 variables, 12/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/696 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 16/712 variables, 6/274 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/712 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 8/720 variables, 6/280 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/720 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/720 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 720/720 variables, and 280 constraints, problems are : Problem set: 0 solved, 1 unsolved in 347 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 271/271 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 125/127 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/127 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 120/247 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/247 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/247 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 425/672 variables, 247/256 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/672 variables, 1/257 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/672 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 24/696 variables, 12/269 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/696 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 16/712 variables, 6/275 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/712 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 8/720 variables, 6/281 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/720 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/720 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 720/720 variables, and 281 constraints, problems are : Problem set: 0 solved, 1 unsolved in 264 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 271/271 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
After SMT, in 644ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 39 ms.
Support contains 2 out of 271 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 271/271 places, 449/449 transitions.
Graph (trivial) has 200 edges and 271 vertex of which 11 / 271 are part of one of the 3 SCC in 0 ms
Free SCC test removed 8 places
Drop transitions (Empty/Sink Transition effects.) removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 0 with 36 rules applied. Total rules applied 37 place count 263 transition count 399
Reduce places removed 36 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 41 rules applied. Total rules applied 78 place count 227 transition count 394
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 80 place count 225 transition count 394
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 29 Pre rules applied. Total rules applied 80 place count 225 transition count 365
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 3 with 58 rules applied. Total rules applied 138 place count 196 transition count 365
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 3 with 46 rules applied. Total rules applied 184 place count 173 transition count 342
Performed 30 Post agglomeration using F-continuation condition with reduction of 6 identical transitions.
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 3 with 60 rules applied. Total rules applied 244 place count 143 transition count 406
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 246 place count 143 transition count 404
Free-agglomeration rule applied 15 times.
Iterating global reduction 3 with 15 rules applied. Total rules applied 261 place count 143 transition count 389
Reduce places removed 15 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 21 rules applied. Total rules applied 282 place count 128 transition count 383
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 286 place count 124 transition count 379
Iterating global reduction 4 with 4 rules applied. Total rules applied 290 place count 124 transition count 379
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 296 place count 124 transition count 373
Drop transitions (Redundant composition of simpler transitions.) removed 18 transitions
Redundant transition composition rules discarded 18 transitions
Iterating global reduction 5 with 18 rules applied. Total rules applied 314 place count 124 transition count 355
Applied a total of 314 rules in 35 ms. Remains 124 /271 variables (removed 147) and now considering 355/449 (removed 94) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36 ms. Remains : 124/271 places, 355/449 transitions.
RANDOM walk for 40000 steps (1941 resets) in 113 ms. (350 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (194 resets) in 43 ms. (909 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1353834 steps, run timeout after 3001 ms. (steps per millisecond=451 ) properties seen :0 out of 1
Probabilistic random walk after 1353834 steps, saw 447545 distinct states, run finished after 3001 ms. (steps per millisecond=451 ) properties seen :0
[2024-06-03 00:08:14] [INFO ] Flow matrix only has 348 transitions (discarded 7 similar events)
// Phase 1: matrix 348 rows 124 cols
[2024-06-03 00:08:14] [INFO ] Computed 7 invariants in 5 ms
[2024-06-03 00:08:14] [INFO ] State equation strengthened by 65 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 60/62 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 54/116 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-03 00:08:14] [INFO ] Deduced a trap composed of 42 places in 35 ms of which 1 ms to minimize.
[2024-06-03 00:08:14] [INFO ] Deduced a trap composed of 35 places in 50 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/116 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/116 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 348/464 variables, 116/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/464 variables, 65/190 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/464 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 8/472 variables, 8/198 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/472 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/472 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 472/472 variables, and 198 constraints, problems are : Problem set: 0 solved, 1 unsolved in 260 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 124/124 constraints, ReadFeed: 65/65 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 60/62 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 54/116 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/116 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/116 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 348/464 variables, 116/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/464 variables, 65/190 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/464 variables, 1/191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/464 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 8/472 variables, 8/199 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/472 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/472 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 472/472 variables, and 199 constraints, problems are : Problem set: 0 solved, 1 unsolved in 178 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 124/124 constraints, ReadFeed: 65/65 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
After SMT, in 490ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 14 ms.
Support contains 2 out of 124 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 124/124 places, 355/355 transitions.
Applied a total of 0 rules in 5 ms. Remains 124 /124 variables (removed 0) and now considering 355/355 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 124/124 places, 355/355 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 124/124 places, 355/355 transitions.
Applied a total of 0 rules in 6 ms. Remains 124 /124 variables (removed 0) and now considering 355/355 (removed 0) transitions.
[2024-06-03 00:08:14] [INFO ] Flow matrix only has 348 transitions (discarded 7 similar events)
[2024-06-03 00:08:14] [INFO ] Invariant cache hit.
[2024-06-03 00:08:14] [INFO ] Implicit Places using invariants in 136 ms returned []
[2024-06-03 00:08:14] [INFO ] Flow matrix only has 348 transitions (discarded 7 similar events)
[2024-06-03 00:08:14] [INFO ] Invariant cache hit.
[2024-06-03 00:08:14] [INFO ] State equation strengthened by 65 read => feed constraints.
[2024-06-03 00:08:15] [INFO ] Implicit Places using invariants and state equation in 358 ms returned []
Implicit Place search using SMT with State Equation took 521 ms to find 0 implicit places.
[2024-06-03 00:08:15] [INFO ] Redundant transitions in 2 ms returned []
Running 351 sub problems to find dead transitions.
[2024-06-03 00:08:15] [INFO ] Flow matrix only has 348 transitions (discarded 7 similar events)
[2024-06-03 00:08:15] [INFO ] Invariant cache hit.
[2024-06-03 00:08:15] [INFO ] State equation strengthened by 65 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 351 unsolved
At refinement iteration 1 (OVERLAPS) 1/124 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 351 unsolved
[2024-06-03 00:08:17] [INFO ] Deduced a trap composed of 16 places in 80 ms of which 1 ms to minimize.
[2024-06-03 00:08:17] [INFO ] Deduced a trap composed of 23 places in 77 ms of which 0 ms to minimize.
[2024-06-03 00:08:17] [INFO ] Deduced a trap composed of 42 places in 47 ms of which 0 ms to minimize.
[2024-06-03 00:08:17] [INFO ] Deduced a trap composed of 22 places in 77 ms of which 1 ms to minimize.
[2024-06-03 00:08:17] [INFO ] Deduced a trap composed of 67 places in 82 ms of which 1 ms to minimize.
[2024-06-03 00:08:18] [INFO ] Deduced a trap composed of 83 places in 66 ms of which 0 ms to minimize.
[2024-06-03 00:08:18] [INFO ] Deduced a trap composed of 89 places in 72 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 351 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/124 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 351 unsolved
At refinement iteration 4 (OVERLAPS) 348/472 variables, 124/138 constraints. Problems are: Problem set: 0 solved, 351 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/472 variables, 65/203 constraints. Problems are: Problem set: 0 solved, 351 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/472 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 351 unsolved
At refinement iteration 7 (OVERLAPS) 0/472 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 351 unsolved
No progress, stopping.
After SMT solving in domain Real declared 472/472 variables, and 203 constraints, problems are : Problem set: 0 solved, 351 unsolved in 10920 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 124/124 constraints, ReadFeed: 65/65 constraints, PredecessorRefiner: 351/351 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 351 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 351 unsolved
At refinement iteration 1 (OVERLAPS) 1/124 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 351 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 351 unsolved
[2024-06-03 00:08:27] [INFO ] Deduced a trap composed of 35 places in 63 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/124 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 351 unsolved
[2024-06-03 00:08:28] [INFO ] Deduced a trap composed of 35 places in 33 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/124 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 351 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/124 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 351 unsolved
At refinement iteration 6 (OVERLAPS) 348/472 variables, 124/140 constraints. Problems are: Problem set: 0 solved, 351 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/472 variables, 65/205 constraints. Problems are: Problem set: 0 solved, 351 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/472 variables, 351/556 constraints. Problems are: Problem set: 0 solved, 351 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/472 variables, 0/556 constraints. Problems are: Problem set: 0 solved, 351 unsolved
At refinement iteration 10 (OVERLAPS) 0/472 variables, 0/556 constraints. Problems are: Problem set: 0 solved, 351 unsolved
No progress, stopping.
After SMT solving in domain Int declared 472/472 variables, and 556 constraints, problems are : Problem set: 0 solved, 351 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 124/124 constraints, ReadFeed: 65/65 constraints, PredecessorRefiner: 351/351 constraints, Known Traps: 9/9 constraints]
After SMT, in 41355ms problems are : Problem set: 0 solved, 351 unsolved
Search for dead transitions found 0 dead transitions in 41370ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41907 ms. Remains : 124/124 places, 355/355 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 81 edges and 124 vertex of which 20 / 124 are part of one of the 3 SCC in 1 ms
Free SCC test removed 17 places
Drop transitions (Empty/Sink Transition effects.) removed 99 transitions
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 117 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 3 place count 105 transition count 236
Iterating global reduction 0 with 2 rules applied. Total rules applied 5 place count 105 transition count 236
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 15 place count 105 transition count 226
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 17 place count 104 transition count 225
Drop transitions (Redundant composition of simpler transitions.) removed 18 transitions
Redundant transition composition rules discarded 18 transitions
Iterating global reduction 1 with 18 rules applied. Total rules applied 35 place count 104 transition count 207
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 4 rules applied. Total rules applied 39 place count 104 transition count 203
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 45 place count 100 transition count 201
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 45 place count 100 transition count 199
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 49 place count 98 transition count 199
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 51 place count 97 transition count 198
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 52 place count 97 transition count 197
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 54 place count 96 transition count 196
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 55 place count 95 transition count 171
Iterating global reduction 3 with 1 rules applied. Total rules applied 56 place count 95 transition count 171
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 58 place count 95 transition count 169
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 60 place count 93 transition count 169
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 4 with 4 rules applied. Total rules applied 64 place count 93 transition count 165
Free-agglomeration rule applied 2 times.
Iterating global reduction 4 with 2 rules applied. Total rules applied 66 place count 93 transition count 163
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 68 place count 91 transition count 163
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 5 with 4 rules applied. Total rules applied 72 place count 91 transition count 163
Applied a total of 72 rules in 28 ms. Remains 91 /124 variables (removed 33) and now considering 163/355 (removed 192) transitions.
Running SMT prover for 1 properties.
[2024-06-03 00:08:56] [INFO ] Flow matrix only has 161 transitions (discarded 2 similar events)
// Phase 1: matrix 161 rows 91 cols
[2024-06-03 00:08:56] [INFO ] Computed 7 invariants in 1 ms
[2024-06-03 00:08:56] [INFO ] [Real]Absence check using 7 positive place invariants in 1 ms returned sat
[2024-06-03 00:08:56] [INFO ] After 213ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-03 00:08:57] [INFO ] [Nat]Absence check using 7 positive place invariants in 55 ms returned sat
[2024-06-03 00:08:57] [INFO ] After 284ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-06-03 00:08:57] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-06-03 00:08:57] [INFO ] After 9ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-03 00:08:57] [INFO ] After 22ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-03 00:08:57] [INFO ] After 549ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 802 ms.
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p2)), (X (NOT (AND (NOT p0) (NOT p2)))), (X p0), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT p0)), (F (NOT (OR p2 p0))), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 11 factoid took 368 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter sensitive) to 3 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 176 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 172 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Support contains 5 out of 271 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 271/271 places, 449/449 transitions.
Applied a total of 0 rules in 4 ms. Remains 271 /271 variables (removed 0) and now considering 449/449 (removed 0) transitions.
// Phase 1: matrix 449 rows 271 cols
[2024-06-03 00:08:58] [INFO ] Computed 7 invariants in 5 ms
[2024-06-03 00:08:58] [INFO ] Implicit Places using invariants in 134 ms returned []
[2024-06-03 00:08:58] [INFO ] Invariant cache hit.
[2024-06-03 00:08:58] [INFO ] Implicit Places using invariants and state equation in 260 ms returned []
Implicit Place search using SMT with State Equation took 409 ms to find 0 implicit places.
Running 448 sub problems to find dead transitions.
[2024-06-03 00:08:58] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/270 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 448 unsolved
At refinement iteration 1 (OVERLAPS) 1/271 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 448 unsolved
[2024-06-03 00:09:02] [INFO ] Deduced a trap composed of 166 places in 110 ms of which 2 ms to minimize.
[2024-06-03 00:09:02] [INFO ] Deduced a trap composed of 77 places in 56 ms of which 1 ms to minimize.
[2024-06-03 00:09:02] [INFO ] Deduced a trap composed of 76 places in 51 ms of which 1 ms to minimize.
[2024-06-03 00:09:03] [INFO ] Deduced a trap composed of 88 places in 54 ms of which 1 ms to minimize.
[2024-06-03 00:09:03] [INFO ] Deduced a trap composed of 77 places in 49 ms of which 1 ms to minimize.
[2024-06-03 00:09:03] [INFO ] Deduced a trap composed of 76 places in 45 ms of which 1 ms to minimize.
[2024-06-03 00:09:04] [INFO ] Deduced a trap composed of 39 places in 88 ms of which 2 ms to minimize.
[2024-06-03 00:09:04] [INFO ] Deduced a trap composed of 87 places in 101 ms of which 2 ms to minimize.
[2024-06-03 00:09:04] [INFO ] Deduced a trap composed of 49 places in 103 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/271 variables, 9/16 constraints. Problems are: Problem set: 0 solved, 448 unsolved
[2024-06-03 00:09:06] [INFO ] Deduced a trap composed of 155 places in 96 ms of which 2 ms to minimize.
[2024-06-03 00:09:06] [INFO ] Deduced a trap composed of 165 places in 92 ms of which 1 ms to minimize.
[2024-06-03 00:09:06] [INFO ] Deduced a trap composed of 152 places in 95 ms of which 2 ms to minimize.
[2024-06-03 00:09:06] [INFO ] Deduced a trap composed of 162 places in 93 ms of which 2 ms to minimize.
[2024-06-03 00:09:06] [INFO ] Deduced a trap composed of 153 places in 92 ms of which 2 ms to minimize.
[2024-06-03 00:09:07] [INFO ] Deduced a trap composed of 91 places in 46 ms of which 5 ms to minimize.
[2024-06-03 00:09:07] [INFO ] Deduced a trap composed of 78 places in 48 ms of which 1 ms to minimize.
[2024-06-03 00:09:07] [INFO ] Deduced a trap composed of 154 places in 94 ms of which 1 ms to minimize.
[2024-06-03 00:09:07] [INFO ] Deduced a trap composed of 78 places in 92 ms of which 1 ms to minimize.
[2024-06-03 00:09:08] [INFO ] Deduced a trap composed of 166 places in 93 ms of which 2 ms to minimize.
[2024-06-03 00:09:08] [INFO ] Deduced a trap composed of 155 places in 94 ms of which 2 ms to minimize.
[2024-06-03 00:09:08] [INFO ] Deduced a trap composed of 161 places in 88 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/271 variables, 12/28 constraints. Problems are: Problem set: 0 solved, 448 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/271 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 448 unsolved
At refinement iteration 5 (OVERLAPS) 449/720 variables, 271/299 constraints. Problems are: Problem set: 0 solved, 448 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/720 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 448 unsolved
At refinement iteration 7 (OVERLAPS) 0/720 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 448 unsolved
No progress, stopping.
After SMT solving in domain Real declared 720/720 variables, and 299 constraints, problems are : Problem set: 0 solved, 448 unsolved in 28720 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 271/271 constraints, PredecessorRefiner: 448/448 constraints, Known Traps: 21/21 constraints]
Escalating to Integer solving :Problem set: 0 solved, 448 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/270 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 448 unsolved
At refinement iteration 1 (OVERLAPS) 1/271 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 448 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/271 variables, 21/28 constraints. Problems are: Problem set: 0 solved, 448 unsolved
[2024-06-03 00:09:30] [INFO ] Deduced a trap composed of 155 places in 109 ms of which 2 ms to minimize.
[2024-06-03 00:09:30] [INFO ] Deduced a trap composed of 156 places in 99 ms of which 1 ms to minimize.
[2024-06-03 00:09:30] [INFO ] Deduced a trap composed of 154 places in 89 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/271 variables, 3/31 constraints. Problems are: Problem set: 0 solved, 448 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/271 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 448 unsolved
At refinement iteration 5 (OVERLAPS) 449/720 variables, 271/302 constraints. Problems are: Problem set: 0 solved, 448 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/720 variables, 448/750 constraints. Problems are: Problem set: 0 solved, 448 unsolved
[2024-06-03 00:09:39] [INFO ] Deduced a trap composed of 164 places in 105 ms of which 2 ms to minimize.
[2024-06-03 00:09:39] [INFO ] Deduced a trap composed of 23 places in 76 ms of which 1 ms to minimize.
[2024-06-03 00:09:46] [INFO ] Deduced a trap composed of 171 places in 89 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/720 variables, 3/753 constraints. Problems are: Problem set: 0 solved, 448 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 720/720 variables, and 753 constraints, problems are : Problem set: 0 solved, 448 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 271/271 constraints, PredecessorRefiner: 448/448 constraints, Known Traps: 27/27 constraints]
After SMT, in 58892ms problems are : Problem set: 0 solved, 448 unsolved
Search for dead transitions found 0 dead transitions in 58896ms
Finished structural reductions in LTL mode , in 1 iterations and 59310 ms. Remains : 271/271 places, 449/449 transitions.
Computed a total of 64 stabilizing places and 89 stable transitions
Computed a total of 64 stabilizing places and 89 stable transitions
Knowledge obtained : [(AND (NOT p2) p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p2)), (X (NOT (AND (NOT p2) (NOT p0)))), (X p0), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 185 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter sensitive) to 3 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 106 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
RANDOM walk for 40000 steps (16 resets) in 109 ms. (363 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40000 steps (25 resets) in 102 ms. (388 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40000 steps (14 resets) in 96 ms. (412 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40000 steps (14 resets) in 72 ms. (547 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40000 steps (12 resets) in 130 ms. (305 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40000 steps (11 resets) in 87 ms. (454 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 1314427 steps, run timeout after 3001 ms. (steps per millisecond=437 ) properties seen :4 out of 5
Probabilistic random walk after 1314427 steps, saw 305448 distinct states, run finished after 3001 ms. (steps per millisecond=437 ) properties seen :4
[2024-06-03 00:10:01] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 125/127 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/127 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 120/247 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-03 00:10:01] [INFO ] Deduced a trap composed of 88 places in 66 ms of which 1 ms to minimize.
[2024-06-03 00:10:01] [INFO ] Deduced a trap composed of 76 places in 53 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/247 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/247 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 425/672 variables, 247/256 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/672 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 24/696 variables, 12/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/696 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 16/712 variables, 6/274 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/712 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 8/720 variables, 6/280 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/720 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/720 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 720/720 variables, and 280 constraints, problems are : Problem set: 0 solved, 1 unsolved in 366 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 271/271 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 125/127 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/127 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 120/247 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/247 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/247 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 425/672 variables, 247/256 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/672 variables, 1/257 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/672 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 24/696 variables, 12/269 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/696 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 16/712 variables, 6/275 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/712 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 8/720 variables, 6/281 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/720 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/720 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 720/720 variables, and 281 constraints, problems are : Problem set: 0 solved, 1 unsolved in 248 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 271/271 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
After SMT, in 654ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 38 ms.
Support contains 2 out of 271 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 271/271 places, 449/449 transitions.
Graph (trivial) has 200 edges and 271 vertex of which 11 / 271 are part of one of the 3 SCC in 0 ms
Free SCC test removed 8 places
Drop transitions (Empty/Sink Transition effects.) removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 0 with 36 rules applied. Total rules applied 37 place count 263 transition count 399
Reduce places removed 36 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 41 rules applied. Total rules applied 78 place count 227 transition count 394
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 80 place count 225 transition count 394
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 29 Pre rules applied. Total rules applied 80 place count 225 transition count 365
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 3 with 58 rules applied. Total rules applied 138 place count 196 transition count 365
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 3 with 46 rules applied. Total rules applied 184 place count 173 transition count 342
Performed 30 Post agglomeration using F-continuation condition with reduction of 6 identical transitions.
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 3 with 60 rules applied. Total rules applied 244 place count 143 transition count 406
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 246 place count 143 transition count 404
Free-agglomeration rule applied 15 times.
Iterating global reduction 3 with 15 rules applied. Total rules applied 261 place count 143 transition count 389
Reduce places removed 15 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 21 rules applied. Total rules applied 282 place count 128 transition count 383
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 286 place count 124 transition count 379
Iterating global reduction 4 with 4 rules applied. Total rules applied 290 place count 124 transition count 379
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 296 place count 124 transition count 373
Drop transitions (Redundant composition of simpler transitions.) removed 18 transitions
Redundant transition composition rules discarded 18 transitions
Iterating global reduction 5 with 18 rules applied. Total rules applied 314 place count 124 transition count 355
Applied a total of 314 rules in 61 ms. Remains 124 /271 variables (removed 147) and now considering 355/449 (removed 94) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62 ms. Remains : 124/271 places, 355/449 transitions.
RANDOM walk for 40000 steps (1965 resets) in 134 ms. (296 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (198 resets) in 29 ms. (1333 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1333446 steps, run timeout after 3001 ms. (steps per millisecond=444 ) properties seen :0 out of 1
Probabilistic random walk after 1333446 steps, saw 442171 distinct states, run finished after 3001 ms. (steps per millisecond=444 ) properties seen :0
[2024-06-03 00:10:04] [INFO ] Flow matrix only has 348 transitions (discarded 7 similar events)
// Phase 1: matrix 348 rows 124 cols
[2024-06-03 00:10:04] [INFO ] Computed 7 invariants in 3 ms
[2024-06-03 00:10:04] [INFO ] State equation strengthened by 65 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 60/62 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 54/116 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-03 00:10:04] [INFO ] Deduced a trap composed of 42 places in 49 ms of which 0 ms to minimize.
[2024-06-03 00:10:05] [INFO ] Deduced a trap composed of 35 places in 55 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/116 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/116 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 348/464 variables, 116/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/464 variables, 65/190 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/464 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 8/472 variables, 8/198 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/472 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/472 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 472/472 variables, and 198 constraints, problems are : Problem set: 0 solved, 1 unsolved in 259 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 124/124 constraints, ReadFeed: 65/65 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 60/62 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 54/116 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/116 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/116 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 348/464 variables, 116/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/464 variables, 65/190 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/464 variables, 1/191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/464 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 8/472 variables, 8/199 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/472 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/472 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 472/472 variables, and 199 constraints, problems are : Problem set: 0 solved, 1 unsolved in 169 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 124/124 constraints, ReadFeed: 65/65 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
After SMT, in 460ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 14 ms.
Support contains 2 out of 124 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 124/124 places, 355/355 transitions.
Applied a total of 0 rules in 3 ms. Remains 124 /124 variables (removed 0) and now considering 355/355 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 124/124 places, 355/355 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 124/124 places, 355/355 transitions.
Applied a total of 0 rules in 3 ms. Remains 124 /124 variables (removed 0) and now considering 355/355 (removed 0) transitions.
[2024-06-03 00:10:05] [INFO ] Flow matrix only has 348 transitions (discarded 7 similar events)
[2024-06-03 00:10:05] [INFO ] Invariant cache hit.
[2024-06-03 00:10:05] [INFO ] Implicit Places using invariants in 140 ms returned []
[2024-06-03 00:10:05] [INFO ] Flow matrix only has 348 transitions (discarded 7 similar events)
[2024-06-03 00:10:05] [INFO ] Invariant cache hit.
[2024-06-03 00:10:05] [INFO ] State equation strengthened by 65 read => feed constraints.
[2024-06-03 00:10:05] [INFO ] Implicit Places using invariants and state equation in 225 ms returned []
Implicit Place search using SMT with State Equation took 397 ms to find 0 implicit places.
[2024-06-03 00:10:05] [INFO ] Redundant transitions in 2 ms returned []
Running 351 sub problems to find dead transitions.
[2024-06-03 00:10:05] [INFO ] Flow matrix only has 348 transitions (discarded 7 similar events)
[2024-06-03 00:10:05] [INFO ] Invariant cache hit.
[2024-06-03 00:10:05] [INFO ] State equation strengthened by 65 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 351 unsolved
At refinement iteration 1 (OVERLAPS) 1/124 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 351 unsolved
[2024-06-03 00:10:07] [INFO ] Deduced a trap composed of 16 places in 63 ms of which 1 ms to minimize.
[2024-06-03 00:10:07] [INFO ] Deduced a trap composed of 23 places in 78 ms of which 1 ms to minimize.
[2024-06-03 00:10:07] [INFO ] Deduced a trap composed of 42 places in 43 ms of which 0 ms to minimize.
[2024-06-03 00:10:08] [INFO ] Deduced a trap composed of 22 places in 74 ms of which 1 ms to minimize.
[2024-06-03 00:10:08] [INFO ] Deduced a trap composed of 67 places in 78 ms of which 1 ms to minimize.
[2024-06-03 00:10:08] [INFO ] Deduced a trap composed of 83 places in 86 ms of which 1 ms to minimize.
[2024-06-03 00:10:08] [INFO ] Deduced a trap composed of 89 places in 74 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 351 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/124 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 351 unsolved
At refinement iteration 4 (OVERLAPS) 348/472 variables, 124/138 constraints. Problems are: Problem set: 0 solved, 351 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/472 variables, 65/203 constraints. Problems are: Problem set: 0 solved, 351 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/472 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 351 unsolved
At refinement iteration 7 (OVERLAPS) 0/472 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 351 unsolved
No progress, stopping.
After SMT solving in domain Real declared 472/472 variables, and 203 constraints, problems are : Problem set: 0 solved, 351 unsolved in 10752 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 124/124 constraints, ReadFeed: 65/65 constraints, PredecessorRefiner: 351/351 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 351 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 351 unsolved
At refinement iteration 1 (OVERLAPS) 1/124 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 351 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 351 unsolved
[2024-06-03 00:10:18] [INFO ] Deduced a trap composed of 35 places in 66 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/124 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 351 unsolved
[2024-06-03 00:10:19] [INFO ] Deduced a trap composed of 35 places in 60 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/124 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 351 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/124 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 351 unsolved
At refinement iteration 6 (OVERLAPS) 348/472 variables, 124/140 constraints. Problems are: Problem set: 0 solved, 351 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/472 variables, 65/205 constraints. Problems are: Problem set: 0 solved, 351 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/472 variables, 351/556 constraints. Problems are: Problem set: 0 solved, 351 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/472 variables, 0/556 constraints. Problems are: Problem set: 0 solved, 351 unsolved
At refinement iteration 10 (OVERLAPS) 0/472 variables, 0/556 constraints. Problems are: Problem set: 0 solved, 351 unsolved
No progress, stopping.
After SMT solving in domain Int declared 472/472 variables, and 556 constraints, problems are : Problem set: 0 solved, 351 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 124/124 constraints, ReadFeed: 65/65 constraints, PredecessorRefiner: 351/351 constraints, Known Traps: 9/9 constraints]
After SMT, in 41042ms problems are : Problem set: 0 solved, 351 unsolved
Search for dead transitions found 0 dead transitions in 41045ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41469 ms. Remains : 124/124 places, 355/355 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 81 edges and 124 vertex of which 20 / 124 are part of one of the 3 SCC in 0 ms
Free SCC test removed 17 places
Drop transitions (Empty/Sink Transition effects.) removed 99 transitions
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 117 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 3 place count 105 transition count 236
Iterating global reduction 0 with 2 rules applied. Total rules applied 5 place count 105 transition count 236
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 15 place count 105 transition count 226
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 17 place count 104 transition count 225
Drop transitions (Redundant composition of simpler transitions.) removed 18 transitions
Redundant transition composition rules discarded 18 transitions
Iterating global reduction 1 with 18 rules applied. Total rules applied 35 place count 104 transition count 207
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 4 rules applied. Total rules applied 39 place count 104 transition count 203
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 45 place count 100 transition count 201
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 45 place count 100 transition count 199
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 49 place count 98 transition count 199
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 51 place count 97 transition count 198
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 52 place count 97 transition count 197
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 54 place count 96 transition count 196
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 55 place count 95 transition count 171
Iterating global reduction 3 with 1 rules applied. Total rules applied 56 place count 95 transition count 171
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 58 place count 95 transition count 169
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 60 place count 93 transition count 169
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 4 with 4 rules applied. Total rules applied 64 place count 93 transition count 165
Free-agglomeration rule applied 2 times.
Iterating global reduction 4 with 2 rules applied. Total rules applied 66 place count 93 transition count 163
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 68 place count 91 transition count 163
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 5 with 4 rules applied. Total rules applied 72 place count 91 transition count 163
Applied a total of 72 rules in 25 ms. Remains 91 /124 variables (removed 33) and now considering 163/355 (removed 192) transitions.
Running SMT prover for 1 properties.
[2024-06-03 00:10:46] [INFO ] Flow matrix only has 161 transitions (discarded 2 similar events)
// Phase 1: matrix 161 rows 91 cols
[2024-06-03 00:10:46] [INFO ] Computed 7 invariants in 1 ms
[2024-06-03 00:10:46] [INFO ] [Real]Absence check using 7 positive place invariants in 1 ms returned sat
[2024-06-03 00:10:46] [INFO ] After 121ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-03 00:10:47] [INFO ] [Nat]Absence check using 7 positive place invariants in 1 ms returned sat
[2024-06-03 00:10:47] [INFO ] After 48ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-06-03 00:10:47] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-06-03 00:10:47] [INFO ] After 9ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-03 00:10:47] [INFO ] After 21ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-03 00:10:47] [INFO ] After 112ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 264 ms.
Knowledge obtained : [(AND (NOT p2) p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p2)), (X (NOT (AND (NOT p2) (NOT p0)))), (X p0), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT p0)), (F (NOT (OR p2 p0))), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 11 factoid took 239 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter sensitive) to 3 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 110 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 117 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 105 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 2 reset in 79 ms.
Product exploration explored 100000 steps with 0 reset in 179 ms.
Support contains 5 out of 271 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 271/271 places, 449/449 transitions.
Applied a total of 0 rules in 3 ms. Remains 271 /271 variables (removed 0) and now considering 449/449 (removed 0) transitions.
// Phase 1: matrix 449 rows 271 cols
[2024-06-03 00:10:48] [INFO ] Computed 7 invariants in 4 ms
[2024-06-03 00:10:48] [INFO ] Implicit Places using invariants in 98 ms returned []
[2024-06-03 00:10:48] [INFO ] Invariant cache hit.
[2024-06-03 00:10:48] [INFO ] Implicit Places using invariants and state equation in 262 ms returned []
Implicit Place search using SMT with State Equation took 385 ms to find 0 implicit places.
Running 448 sub problems to find dead transitions.
[2024-06-03 00:10:48] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/270 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 448 unsolved
At refinement iteration 1 (OVERLAPS) 1/271 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 448 unsolved
[2024-06-03 00:10:52] [INFO ] Deduced a trap composed of 166 places in 92 ms of which 2 ms to minimize.
[2024-06-03 00:10:52] [INFO ] Deduced a trap composed of 77 places in 57 ms of which 1 ms to minimize.
[2024-06-03 00:10:52] [INFO ] Deduced a trap composed of 76 places in 60 ms of which 1 ms to minimize.
[2024-06-03 00:10:52] [INFO ] Deduced a trap composed of 88 places in 57 ms of which 0 ms to minimize.
[2024-06-03 00:10:53] [INFO ] Deduced a trap composed of 77 places in 47 ms of which 1 ms to minimize.
[2024-06-03 00:10:53] [INFO ] Deduced a trap composed of 76 places in 56 ms of which 1 ms to minimize.
[2024-06-03 00:10:53] [INFO ] Deduced a trap composed of 39 places in 106 ms of which 1 ms to minimize.
[2024-06-03 00:10:54] [INFO ] Deduced a trap composed of 87 places in 110 ms of which 1 ms to minimize.
[2024-06-03 00:10:54] [INFO ] Deduced a trap composed of 49 places in 105 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/271 variables, 9/16 constraints. Problems are: Problem set: 0 solved, 448 unsolved
[2024-06-03 00:10:55] [INFO ] Deduced a trap composed of 155 places in 117 ms of which 2 ms to minimize.
[2024-06-03 00:10:56] [INFO ] Deduced a trap composed of 165 places in 94 ms of which 1 ms to minimize.
[2024-06-03 00:10:56] [INFO ] Deduced a trap composed of 152 places in 106 ms of which 2 ms to minimize.
[2024-06-03 00:10:56] [INFO ] Deduced a trap composed of 162 places in 103 ms of which 2 ms to minimize.
[2024-06-03 00:10:56] [INFO ] Deduced a trap composed of 153 places in 97 ms of which 2 ms to minimize.
[2024-06-03 00:10:56] [INFO ] Deduced a trap composed of 91 places in 57 ms of which 1 ms to minimize.
[2024-06-03 00:10:57] [INFO ] Deduced a trap composed of 78 places in 54 ms of which 0 ms to minimize.
[2024-06-03 00:10:57] [INFO ] Deduced a trap composed of 154 places in 115 ms of which 1 ms to minimize.
[2024-06-03 00:10:57] [INFO ] Deduced a trap composed of 78 places in 127 ms of which 2 ms to minimize.
[2024-06-03 00:10:57] [INFO ] Deduced a trap composed of 166 places in 99 ms of which 1 ms to minimize.
[2024-06-03 00:10:58] [INFO ] Deduced a trap composed of 155 places in 100 ms of which 1 ms to minimize.
[2024-06-03 00:10:58] [INFO ] Deduced a trap composed of 161 places in 109 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/271 variables, 12/28 constraints. Problems are: Problem set: 0 solved, 448 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/271 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 448 unsolved
At refinement iteration 5 (OVERLAPS) 449/720 variables, 271/299 constraints. Problems are: Problem set: 0 solved, 448 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/720 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 448 unsolved
At refinement iteration 7 (OVERLAPS) 0/720 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 448 unsolved
No progress, stopping.
After SMT solving in domain Real declared 720/720 variables, and 299 constraints, problems are : Problem set: 0 solved, 448 unsolved in 28197 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 271/271 constraints, PredecessorRefiner: 448/448 constraints, Known Traps: 21/21 constraints]
Escalating to Integer solving :Problem set: 0 solved, 448 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/270 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 448 unsolved
At refinement iteration 1 (OVERLAPS) 1/271 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 448 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/271 variables, 21/28 constraints. Problems are: Problem set: 0 solved, 448 unsolved
[2024-06-03 00:11:19] [INFO ] Deduced a trap composed of 155 places in 80 ms of which 2 ms to minimize.
[2024-06-03 00:11:20] [INFO ] Deduced a trap composed of 156 places in 97 ms of which 2 ms to minimize.
[2024-06-03 00:11:20] [INFO ] Deduced a trap composed of 154 places in 83 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/271 variables, 3/31 constraints. Problems are: Problem set: 0 solved, 448 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/271 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 448 unsolved
At refinement iteration 5 (OVERLAPS) 449/720 variables, 271/302 constraints. Problems are: Problem set: 0 solved, 448 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/720 variables, 448/750 constraints. Problems are: Problem set: 0 solved, 448 unsolved
[2024-06-03 00:11:28] [INFO ] Deduced a trap composed of 164 places in 94 ms of which 1 ms to minimize.
[2024-06-03 00:11:28] [INFO ] Deduced a trap composed of 23 places in 71 ms of which 1 ms to minimize.
[2024-06-03 00:11:35] [INFO ] Deduced a trap composed of 171 places in 94 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/720 variables, 3/753 constraints. Problems are: Problem set: 0 solved, 448 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 720/720 variables, and 753 constraints, problems are : Problem set: 0 solved, 448 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 271/271 constraints, PredecessorRefiner: 448/448 constraints, Known Traps: 27/27 constraints]
After SMT, in 58341ms problems are : Problem set: 0 solved, 448 unsolved
Search for dead transitions found 0 dead transitions in 58345ms
Finished structural reductions in LTL mode , in 1 iterations and 58734 ms. Remains : 271/271 places, 449/449 transitions.
Treatment of property FireWire-PT-18-LTLFireability-08 finished in 280915 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(((p1 U p2)&&p0))))'
Support contains 4 out of 302 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 302/302 places, 540/540 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 293 transition count 530
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 293 transition count 530
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 19 place count 293 transition count 529
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 25 place count 287 transition count 520
Iterating global reduction 1 with 6 rules applied. Total rules applied 31 place count 287 transition count 520
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 35 place count 283 transition count 513
Iterating global reduction 1 with 4 rules applied. Total rules applied 39 place count 283 transition count 513
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 41 place count 281 transition count 507
Iterating global reduction 1 with 2 rules applied. Total rules applied 43 place count 281 transition count 507
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 45 place count 279 transition count 503
Iterating global reduction 1 with 2 rules applied. Total rules applied 47 place count 279 transition count 503
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 49 place count 277 transition count 498
Iterating global reduction 1 with 2 rules applied. Total rules applied 51 place count 277 transition count 498
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 53 place count 275 transition count 494
Iterating global reduction 1 with 2 rules applied. Total rules applied 55 place count 275 transition count 494
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 57 place count 273 transition count 490
Iterating global reduction 1 with 2 rules applied. Total rules applied 59 place count 273 transition count 490
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 60 place count 272 transition count 488
Iterating global reduction 1 with 1 rules applied. Total rules applied 61 place count 272 transition count 488
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 62 place count 271 transition count 485
Iterating global reduction 1 with 1 rules applied. Total rules applied 63 place count 271 transition count 485
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 64 place count 270 transition count 483
Iterating global reduction 1 with 1 rules applied. Total rules applied 65 place count 270 transition count 483
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 66 place count 269 transition count 480
Iterating global reduction 1 with 1 rules applied. Total rules applied 67 place count 269 transition count 480
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 68 place count 268 transition count 478
Iterating global reduction 1 with 1 rules applied. Total rules applied 69 place count 268 transition count 478
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 70 place count 267 transition count 476
Iterating global reduction 1 with 1 rules applied. Total rules applied 71 place count 267 transition count 476
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 72 place count 266 transition count 474
Iterating global reduction 1 with 1 rules applied. Total rules applied 73 place count 266 transition count 474
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 74 place count 265 transition count 473
Iterating global reduction 1 with 1 rules applied. Total rules applied 75 place count 265 transition count 473
Applied a total of 75 rules in 64 ms. Remains 265 /302 variables (removed 37) and now considering 473/540 (removed 67) transitions.
// Phase 1: matrix 473 rows 265 cols
[2024-06-03 00:11:47] [INFO ] Computed 7 invariants in 2 ms
[2024-06-03 00:11:47] [INFO ] Implicit Places using invariants in 173 ms returned []
[2024-06-03 00:11:47] [INFO ] Invariant cache hit.
[2024-06-03 00:11:47] [INFO ] Implicit Places using invariants and state equation in 386 ms returned []
Implicit Place search using SMT with State Equation took 573 ms to find 0 implicit places.
Running 472 sub problems to find dead transitions.
[2024-06-03 00:11:47] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/264 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 472 unsolved
At refinement iteration 1 (OVERLAPS) 1/265 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 472 unsolved
[2024-06-03 00:11:51] [INFO ] Deduced a trap composed of 162 places in 102 ms of which 2 ms to minimize.
[2024-06-03 00:11:51] [INFO ] Deduced a trap composed of 149 places in 94 ms of which 1 ms to minimize.
[2024-06-03 00:11:51] [INFO ] Deduced a trap composed of 76 places in 76 ms of which 1 ms to minimize.
[2024-06-03 00:11:52] [INFO ] Deduced a trap composed of 77 places in 88 ms of which 1 ms to minimize.
[2024-06-03 00:11:52] [INFO ] Deduced a trap composed of 148 places in 108 ms of which 1 ms to minimize.
[2024-06-03 00:11:52] [INFO ] Deduced a trap composed of 77 places in 107 ms of which 2 ms to minimize.
[2024-06-03 00:11:52] [INFO ] Deduced a trap composed of 76 places in 119 ms of which 2 ms to minimize.
[2024-06-03 00:11:52] [INFO ] Deduced a trap composed of 41 places in 113 ms of which 2 ms to minimize.
[2024-06-03 00:11:53] [INFO ] Deduced a trap composed of 84 places in 128 ms of which 2 ms to minimize.
[2024-06-03 00:11:54] [INFO ] Deduced a trap composed of 51 places in 108 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/265 variables, 10/17 constraints. Problems are: Problem set: 0 solved, 472 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/265 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 472 unsolved
At refinement iteration 4 (OVERLAPS) 473/738 variables, 265/282 constraints. Problems are: Problem set: 0 solved, 472 unsolved
[2024-06-03 00:12:01] [INFO ] Deduced a trap composed of 121 places in 128 ms of which 2 ms to minimize.
[2024-06-03 00:12:01] [INFO ] Deduced a trap composed of 148 places in 97 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/738 variables, 2/284 constraints. Problems are: Problem set: 0 solved, 472 unsolved
[2024-06-03 00:12:07] [INFO ] Deduced a trap composed of 41 places in 89 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/738 variables, 1/285 constraints. Problems are: Problem set: 0 solved, 472 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/738 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 472 unsolved
[2024-06-03 00:12:17] [INFO ] Deduced a trap composed of 64 places in 90 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 738/738 variables, and 286 constraints, problems are : Problem set: 0 solved, 472 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 265/265 constraints, PredecessorRefiner: 472/472 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 472 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/264 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 472 unsolved
At refinement iteration 1 (OVERLAPS) 1/265 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 472 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/265 variables, 14/21 constraints. Problems are: Problem set: 0 solved, 472 unsolved
[2024-06-03 00:12:20] [INFO ] Deduced a trap composed of 147 places in 104 ms of which 2 ms to minimize.
[2024-06-03 00:12:20] [INFO ] Deduced a trap composed of 89 places in 132 ms of which 2 ms to minimize.
[2024-06-03 00:12:20] [INFO ] Deduced a trap composed of 181 places in 108 ms of which 2 ms to minimize.
[2024-06-03 00:12:21] [INFO ] Deduced a trap composed of 149 places in 113 ms of which 1 ms to minimize.
[2024-06-03 00:12:21] [INFO ] Deduced a trap composed of 98 places in 138 ms of which 1 ms to minimize.
[2024-06-03 00:12:21] [INFO ] Deduced a trap composed of 155 places in 122 ms of which 2 ms to minimize.
[2024-06-03 00:12:21] [INFO ] Deduced a trap composed of 149 places in 107 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/265 variables, 7/28 constraints. Problems are: Problem set: 0 solved, 472 unsolved
[2024-06-03 00:12:23] [INFO ] Deduced a trap composed of 78 places in 59 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/265 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 472 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/265 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 472 unsolved
At refinement iteration 6 (OVERLAPS) 473/738 variables, 265/294 constraints. Problems are: Problem set: 0 solved, 472 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/738 variables, 472/766 constraints. Problems are: Problem set: 0 solved, 472 unsolved
[2024-06-03 00:12:34] [INFO ] Deduced a trap composed of 23 places in 90 ms of which 1 ms to minimize.
[2024-06-03 00:12:35] [INFO ] Deduced a trap composed of 167 places in 101 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/738 variables, 2/768 constraints. Problems are: Problem set: 0 solved, 472 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 738/738 variables, and 768 constraints, problems are : Problem set: 0 solved, 472 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 265/265 constraints, PredecessorRefiner: 472/472 constraints, Known Traps: 24/24 constraints]
After SMT, in 60159ms problems are : Problem set: 0 solved, 472 unsolved
Search for dead transitions found 0 dead transitions in 60164ms
Starting structural reductions in LTL mode, iteration 1 : 265/302 places, 473/540 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60802 ms. Remains : 265/302 places, 473/540 transitions.
Stuttering acceptance computed with spot in 115 ms :[(OR (NOT p2) (NOT p0)), (NOT p2), (OR (NOT p0) (NOT p2))]
Running random walk in product with property : FireWire-PT-18-LTLFireability-10
Product exploration explored 100000 steps with 0 reset in 178 ms.
Stack based approach found an accepted trace after 4 steps with 0 reset with depth 5 and stack size 5 in 0 ms.
FORMULA FireWire-PT-18-LTLFireability-10 FALSE TECHNIQUES STACK_TEST
Treatment of property FireWire-PT-18-LTLFireability-10 finished in 61129 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(G(p0))||G(p1)))'
Support contains 6 out of 302 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 302/302 places, 540/540 transitions.
Graph (trivial) has 214 edges and 302 vertex of which 11 / 302 are part of one of the 3 SCC in 1 ms
Free SCC test removed 8 places
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 38 transitions
Trivial Post-agglo rules discarded 38 transitions
Performed 38 trivial Post agglomeration. Transition count delta: 38
Iterating post reduction 0 with 38 rules applied. Total rules applied 39 place count 293 transition count 492
Reduce places removed 38 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 40 rules applied. Total rules applied 79 place count 255 transition count 490
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 80 place count 254 transition count 490
Performed 27 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 27 Pre rules applied. Total rules applied 80 place count 254 transition count 463
Deduced a syphon composed of 27 places in 0 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 3 with 54 rules applied. Total rules applied 134 place count 227 transition count 463
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 143 place count 218 transition count 415
Iterating global reduction 3 with 9 rules applied. Total rules applied 152 place count 218 transition count 415
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 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 5 rules applied. Total rules applied 157 place count 218 transition count 410
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 158 place count 217 transition count 410
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 158 place count 217 transition count 408
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 162 place count 215 transition count 408
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 166 place count 211 transition count 402
Iterating global reduction 5 with 4 rules applied. Total rules applied 170 place count 211 transition count 402
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 173 place count 208 transition count 396
Iterating global reduction 5 with 3 rules applied. Total rules applied 176 place count 208 transition count 396
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 178 place count 206 transition count 390
Iterating global reduction 5 with 2 rules applied. Total rules applied 180 place count 206 transition count 390
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 182 place count 204 transition count 386
Iterating global reduction 5 with 2 rules applied. Total rules applied 184 place count 204 transition count 386
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 186 place count 202 transition count 381
Iterating global reduction 5 with 2 rules applied. Total rules applied 188 place count 202 transition count 381
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 190 place count 200 transition count 377
Iterating global reduction 5 with 2 rules applied. Total rules applied 192 place count 200 transition count 377
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 193 place count 199 transition count 374
Iterating global reduction 5 with 1 rules applied. Total rules applied 194 place count 199 transition count 374
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 195 place count 198 transition count 372
Iterating global reduction 5 with 1 rules applied. Total rules applied 196 place count 198 transition count 372
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 197 place count 197 transition count 369
Iterating global reduction 5 with 1 rules applied. Total rules applied 198 place count 197 transition count 369
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 199 place count 196 transition count 367
Iterating global reduction 5 with 1 rules applied. Total rules applied 200 place count 196 transition count 367
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 201 place count 195 transition count 364
Iterating global reduction 5 with 1 rules applied. Total rules applied 202 place count 195 transition count 364
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 203 place count 194 transition count 362
Iterating global reduction 5 with 1 rules applied. Total rules applied 204 place count 194 transition count 362
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 5 with 48 rules applied. Total rules applied 252 place count 170 transition count 338
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 253 place count 170 transition count 337
Performed 30 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 6 with 60 rules applied. Total rules applied 313 place count 140 transition count 401
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 315 place count 140 transition count 399
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 316 place count 139 transition count 398
Applied a total of 316 rules in 74 ms. Remains 139 /302 variables (removed 163) and now considering 398/540 (removed 142) transitions.
[2024-06-03 00:12:48] [INFO ] Flow matrix only has 379 transitions (discarded 19 similar events)
// Phase 1: matrix 379 rows 139 cols
[2024-06-03 00:12:48] [INFO ] Computed 7 invariants in 4 ms
[2024-06-03 00:12:48] [INFO ] Implicit Places using invariants in 88 ms returned []
[2024-06-03 00:12:48] [INFO ] Flow matrix only has 379 transitions (discarded 19 similar events)
[2024-06-03 00:12:48] [INFO ] Invariant cache hit.
[2024-06-03 00:12:48] [INFO ] State equation strengthened by 9 read => feed constraints.
[2024-06-03 00:12:48] [INFO ] Implicit Places using invariants and state equation in 198 ms returned []
Implicit Place search using SMT with State Equation took 286 ms to find 0 implicit places.
[2024-06-03 00:12:48] [INFO ] Redundant transitions in 3 ms returned []
Running 393 sub problems to find dead transitions.
[2024-06-03 00:12:48] [INFO ] Flow matrix only has 379 transitions (discarded 19 similar events)
[2024-06-03 00:12:48] [INFO ] Invariant cache hit.
[2024-06-03 00:12:48] [INFO ] State equation strengthened by 9 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/138 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/138 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 2 (OVERLAPS) 1/139 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 393 unsolved
[2024-06-03 00:12:51] [INFO ] Deduced a trap composed of 24 places in 78 ms of which 2 ms to minimize.
[2024-06-03 00:12:51] [INFO ] Deduced a trap composed of 27 places in 80 ms of which 1 ms to minimize.
[2024-06-03 00:12:51] [INFO ] Deduced a trap composed of 26 places in 75 ms of which 1 ms to minimize.
[2024-06-03 00:12:51] [INFO ] Deduced a trap composed of 49 places in 39 ms of which 1 ms to minimize.
[2024-06-03 00:12:51] [INFO ] Deduced a trap composed of 95 places in 73 ms of which 1 ms to minimize.
[2024-06-03 00:12:52] [INFO ] Deduced a trap composed of 42 places in 81 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/139 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 393 unsolved
[2024-06-03 00:12:54] [INFO ] Deduced a trap composed of 40 places in 36 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/139 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/139 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 6 (OVERLAPS) 378/517 variables, 139/153 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/517 variables, 9/162 constraints. Problems are: Problem set: 0 solved, 393 unsolved
[2024-06-03 00:13:00] [INFO ] Deduced a trap composed of 41 places in 82 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/517 variables, 1/163 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/517 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 10 (OVERLAPS) 0/517 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 393 unsolved
No progress, stopping.
After SMT solving in domain Real declared 517/518 variables, and 163 constraints, problems are : Problem set: 0 solved, 393 unsolved in 19029 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 139/139 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 393/393 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 393 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/138 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/138 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/138 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 3 (OVERLAPS) 1/139 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/139 variables, 4/15 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/139 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 6 (OVERLAPS) 378/517 variables, 139/154 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/517 variables, 9/163 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/517 variables, 393/556 constraints. Problems are: Problem set: 0 solved, 393 unsolved
[2024-06-03 00:13:16] [INFO ] Deduced a trap composed of 41 places in 38 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/517 variables, 1/557 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/517 variables, 0/557 constraints. Problems are: Problem set: 0 solved, 393 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 517/518 variables, and 557 constraints, problems are : Problem set: 0 solved, 393 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 139/139 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 393/393 constraints, Known Traps: 9/9 constraints]
After SMT, in 49348ms problems are : Problem set: 0 solved, 393 unsolved
Search for dead transitions found 0 dead transitions in 49353ms
Starting structural reductions in SI_LTL mode, iteration 1 : 139/302 places, 398/540 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 49722 ms. Remains : 139/302 places, 398/540 transitions.
Stuttering acceptance computed with spot in 80 ms :[(AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : FireWire-PT-18-LTLFireability-11
Product exploration explored 100000 steps with 4 reset in 56 ms.
Product exploration explored 100000 steps with 0 reset in 50 ms.
Computed a total of 23 stabilizing places and 40 stable transitions
Computed a total of 23 stabilizing places and 40 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT p0)), (X p1), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 78 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p1) (NOT p0)), (NOT p0)]
RANDOM walk for 32423 steps (1678 resets) in 270 ms. (119 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT p0)), (X p1), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(F p0), (F (NOT p1))]
Knowledge based reduction with 5 factoid took 115 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 85 ms :[(AND (NOT p1) (NOT p0)), (NOT p0)]
Stuttering acceptance computed with spot in 79 ms :[(AND (NOT p1) (NOT p0)), (NOT p0)]
Support contains 6 out of 139 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 139/139 places, 398/398 transitions.
Applied a total of 0 rules in 7 ms. Remains 139 /139 variables (removed 0) and now considering 398/398 (removed 0) transitions.
[2024-06-03 00:13:38] [INFO ] Flow matrix only has 379 transitions (discarded 19 similar events)
[2024-06-03 00:13:38] [INFO ] Invariant cache hit.
[2024-06-03 00:13:38] [INFO ] Implicit Places using invariants in 77 ms returned []
[2024-06-03 00:13:38] [INFO ] Flow matrix only has 379 transitions (discarded 19 similar events)
[2024-06-03 00:13:38] [INFO ] Invariant cache hit.
[2024-06-03 00:13:38] [INFO ] State equation strengthened by 9 read => feed constraints.
[2024-06-03 00:13:38] [INFO ] Implicit Places using invariants and state equation in 198 ms returned []
Implicit Place search using SMT with State Equation took 277 ms to find 0 implicit places.
[2024-06-03 00:13:38] [INFO ] Redundant transitions in 3 ms returned []
Running 393 sub problems to find dead transitions.
[2024-06-03 00:13:38] [INFO ] Flow matrix only has 379 transitions (discarded 19 similar events)
[2024-06-03 00:13:38] [INFO ] Invariant cache hit.
[2024-06-03 00:13:38] [INFO ] State equation strengthened by 9 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/138 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/138 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 2 (OVERLAPS) 1/139 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 393 unsolved
[2024-06-03 00:13:41] [INFO ] Deduced a trap composed of 24 places in 71 ms of which 1 ms to minimize.
[2024-06-03 00:13:41] [INFO ] Deduced a trap composed of 27 places in 70 ms of which 1 ms to minimize.
[2024-06-03 00:13:41] [INFO ] Deduced a trap composed of 26 places in 73 ms of which 1 ms to minimize.
[2024-06-03 00:13:41] [INFO ] Deduced a trap composed of 49 places in 38 ms of which 1 ms to minimize.
[2024-06-03 00:13:42] [INFO ] Deduced a trap composed of 95 places in 79 ms of which 1 ms to minimize.
[2024-06-03 00:13:42] [INFO ] Deduced a trap composed of 42 places in 76 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/139 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 393 unsolved
[2024-06-03 00:13:44] [INFO ] Deduced a trap composed of 40 places in 40 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/139 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/139 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 6 (OVERLAPS) 378/517 variables, 139/153 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/517 variables, 9/162 constraints. Problems are: Problem set: 0 solved, 393 unsolved
[2024-06-03 00:13:50] [INFO ] Deduced a trap composed of 41 places in 85 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/517 variables, 1/163 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/517 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 10 (OVERLAPS) 0/517 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 393 unsolved
No progress, stopping.
After SMT solving in domain Real declared 517/518 variables, and 163 constraints, problems are : Problem set: 0 solved, 393 unsolved in 18472 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 139/139 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 393/393 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 393 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/138 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/138 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/138 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 3 (OVERLAPS) 1/139 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/139 variables, 4/15 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/139 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 6 (OVERLAPS) 378/517 variables, 139/154 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/517 variables, 9/163 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/517 variables, 393/556 constraints. Problems are: Problem set: 0 solved, 393 unsolved
[2024-06-03 00:14:06] [INFO ] Deduced a trap composed of 41 places in 41 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/517 variables, 1/557 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/517 variables, 0/557 constraints. Problems are: Problem set: 0 solved, 393 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 517/518 variables, and 557 constraints, problems are : Problem set: 0 solved, 393 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 139/139 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 393/393 constraints, Known Traps: 9/9 constraints]
After SMT, in 48749ms problems are : Problem set: 0 solved, 393 unsolved
Search for dead transitions found 0 dead transitions in 48753ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 49044 ms. Remains : 139/139 places, 398/398 transitions.
Computed a total of 23 stabilizing places and 40 stable transitions
Computed a total of 23 stabilizing places and 40 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT p0)), (X p1), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 99 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 84 ms :[(AND (NOT p1) (NOT p0)), (NOT p0)]
RANDOM walk for 18919 steps (972 resets) in 59 ms. (315 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT p0)), (X p1), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(F p0), (F (NOT p1))]
Knowledge based reduction with 5 factoid took 149 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 68 ms :[(AND (NOT p1) (NOT p0)), (NOT p0)]
Stuttering acceptance computed with spot in 81 ms :[(AND (NOT p1) (NOT p0)), (NOT p0)]
Stuttering acceptance computed with spot in 87 ms :[(AND (NOT p1) (NOT p0)), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 45 ms.
Product exploration explored 100000 steps with 0 reset in 46 ms.
Support contains 6 out of 139 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 139/139 places, 398/398 transitions.
Applied a total of 0 rules in 5 ms. Remains 139 /139 variables (removed 0) and now considering 398/398 (removed 0) transitions.
[2024-06-03 00:14:28] [INFO ] Flow matrix only has 379 transitions (discarded 19 similar events)
[2024-06-03 00:14:28] [INFO ] Invariant cache hit.
[2024-06-03 00:14:28] [INFO ] Implicit Places using invariants in 81 ms returned []
[2024-06-03 00:14:28] [INFO ] Flow matrix only has 379 transitions (discarded 19 similar events)
[2024-06-03 00:14:28] [INFO ] Invariant cache hit.
[2024-06-03 00:14:28] [INFO ] State equation strengthened by 9 read => feed constraints.
[2024-06-03 00:14:28] [INFO ] Implicit Places using invariants and state equation in 191 ms returned []
Implicit Place search using SMT with State Equation took 273 ms to find 0 implicit places.
[2024-06-03 00:14:28] [INFO ] Redundant transitions in 2 ms returned []
Running 393 sub problems to find dead transitions.
[2024-06-03 00:14:28] [INFO ] Flow matrix only has 379 transitions (discarded 19 similar events)
[2024-06-03 00:14:28] [INFO ] Invariant cache hit.
[2024-06-03 00:14:28] [INFO ] State equation strengthened by 9 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/138 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/138 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 2 (OVERLAPS) 1/139 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 393 unsolved
[2024-06-03 00:14:31] [INFO ] Deduced a trap composed of 24 places in 77 ms of which 1 ms to minimize.
[2024-06-03 00:14:31] [INFO ] Deduced a trap composed of 27 places in 74 ms of which 1 ms to minimize.
[2024-06-03 00:14:31] [INFO ] Deduced a trap composed of 26 places in 78 ms of which 1 ms to minimize.
[2024-06-03 00:14:31] [INFO ] Deduced a trap composed of 49 places in 36 ms of which 1 ms to minimize.
[2024-06-03 00:14:32] [INFO ] Deduced a trap composed of 95 places in 80 ms of which 1 ms to minimize.
[2024-06-03 00:14:32] [INFO ] Deduced a trap composed of 42 places in 79 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/139 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 393 unsolved
[2024-06-03 00:14:34] [INFO ] Deduced a trap composed of 40 places in 44 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/139 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/139 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 6 (OVERLAPS) 378/517 variables, 139/153 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/517 variables, 9/162 constraints. Problems are: Problem set: 0 solved, 393 unsolved
[2024-06-03 00:14:40] [INFO ] Deduced a trap composed of 41 places in 82 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/517 variables, 1/163 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/517 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 10 (OVERLAPS) 0/517 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 393 unsolved
No progress, stopping.
After SMT solving in domain Real declared 517/518 variables, and 163 constraints, problems are : Problem set: 0 solved, 393 unsolved in 18926 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 139/139 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 393/393 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 393 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/138 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/138 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/138 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 3 (OVERLAPS) 1/139 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/139 variables, 4/15 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/139 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 6 (OVERLAPS) 378/517 variables, 139/154 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/517 variables, 9/163 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/517 variables, 393/556 constraints. Problems are: Problem set: 0 solved, 393 unsolved
[2024-06-03 00:14:56] [INFO ] Deduced a trap composed of 41 places in 39 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/517 variables, 1/557 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/517 variables, 0/557 constraints. Problems are: Problem set: 0 solved, 393 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 517/518 variables, and 557 constraints, problems are : Problem set: 0 solved, 393 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 139/139 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 393/393 constraints, Known Traps: 9/9 constraints]
After SMT, in 49194ms problems are : Problem set: 0 solved, 393 unsolved
Search for dead transitions found 0 dead transitions in 49197ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 49483 ms. Remains : 139/139 places, 398/398 transitions.
Treatment of property FireWire-PT-18-LTLFireability-11 finished in 149758 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(G(!p0)) U !p0)))'
Support contains 2 out of 302 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 302/302 places, 540/540 transitions.
Graph (trivial) has 215 edges and 302 vertex of which 11 / 302 are part of one of the 3 SCC in 1 ms
Free SCC test removed 8 places
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 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 293 transition count 493
Reduce places removed 37 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 39 rules applied. Total rules applied 77 place count 256 transition count 491
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 78 place count 255 transition count 491
Performed 27 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 27 Pre rules applied. Total rules applied 78 place count 255 transition count 464
Deduced a syphon composed of 27 places in 0 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 3 with 54 rules applied. Total rules applied 132 place count 228 transition count 464
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 140 place count 220 transition count 436
Iterating global reduction 3 with 8 rules applied. Total rules applied 148 place count 220 transition count 436
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 152 place count 220 transition count 432
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 153 place count 219 transition count 432
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 153 place count 219 transition count 430
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 157 place count 217 transition count 430
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 161 place count 213 transition count 424
Iterating global reduction 5 with 4 rules applied. Total rules applied 165 place count 213 transition count 424
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 168 place count 210 transition count 418
Iterating global reduction 5 with 3 rules applied. Total rules applied 171 place count 210 transition count 418
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 173 place count 208 transition count 412
Iterating global reduction 5 with 2 rules applied. Total rules applied 175 place count 208 transition count 412
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 177 place count 206 transition count 408
Iterating global reduction 5 with 2 rules applied. Total rules applied 179 place count 206 transition count 408
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 181 place count 204 transition count 403
Iterating global reduction 5 with 2 rules applied. Total rules applied 183 place count 204 transition count 403
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 185 place count 202 transition count 399
Iterating global reduction 5 with 2 rules applied. Total rules applied 187 place count 202 transition count 399
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 188 place count 201 transition count 396
Iterating global reduction 5 with 1 rules applied. Total rules applied 189 place count 201 transition count 396
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 190 place count 200 transition count 394
Iterating global reduction 5 with 1 rules applied. Total rules applied 191 place count 200 transition count 394
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 192 place count 199 transition count 391
Iterating global reduction 5 with 1 rules applied. Total rules applied 193 place count 199 transition count 391
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 194 place count 198 transition count 389
Iterating global reduction 5 with 1 rules applied. Total rules applied 195 place count 198 transition count 389
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 196 place count 197 transition count 386
Iterating global reduction 5 with 1 rules applied. Total rules applied 197 place count 197 transition count 386
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 198 place count 196 transition count 384
Iterating global reduction 5 with 1 rules applied. Total rules applied 199 place count 196 transition count 384
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 200 place count 195 transition count 382
Iterating global reduction 5 with 1 rules applied. Total rules applied 201 place count 195 transition count 382
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 202 place count 194 transition count 380
Iterating global reduction 5 with 1 rules applied. Total rules applied 203 place count 194 transition count 380
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 1 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 5 with 48 rules applied. Total rules applied 251 place count 170 transition count 356
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 252 place count 170 transition count 355
Performed 31 Post agglomeration using F-continuation condition with reduction of 4 identical transitions.
Deduced a syphon composed of 31 places in 1 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 6 with 62 rules applied. Total rules applied 314 place count 139 transition count 472
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 6 with 4 rules applied. Total rules applied 318 place count 139 transition count 468
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 319 place count 138 transition count 467
Applied a total of 319 rules in 66 ms. Remains 138 /302 variables (removed 164) and now considering 467/540 (removed 73) transitions.
[2024-06-03 00:15:18] [INFO ] Flow matrix only has 443 transitions (discarded 24 similar events)
// Phase 1: matrix 443 rows 138 cols
[2024-06-03 00:15:18] [INFO ] Computed 7 invariants in 1 ms
[2024-06-03 00:15:18] [INFO ] Implicit Places using invariants in 77 ms returned []
[2024-06-03 00:15:18] [INFO ] Flow matrix only has 443 transitions (discarded 24 similar events)
[2024-06-03 00:15:18] [INFO ] Invariant cache hit.
[2024-06-03 00:15:18] [INFO ] State equation strengthened by 26 read => feed constraints.
[2024-06-03 00:15:18] [INFO ] Implicit Places using invariants and state equation in 217 ms returned []
Implicit Place search using SMT with State Equation took 298 ms to find 0 implicit places.
[2024-06-03 00:15:18] [INFO ] Redundant transitions in 4 ms returned []
Running 462 sub problems to find dead transitions.
[2024-06-03 00:15:18] [INFO ] Flow matrix only has 443 transitions (discarded 24 similar events)
[2024-06-03 00:15:18] [INFO ] Invariant cache hit.
[2024-06-03 00:15:18] [INFO ] State equation strengthened by 26 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/137 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/137 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 2 (OVERLAPS) 1/138 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 462 unsolved
[2024-06-03 00:15:21] [INFO ] Deduced a trap composed of 25 places in 82 ms of which 2 ms to minimize.
[2024-06-03 00:15:21] [INFO ] Deduced a trap composed of 27 places in 77 ms of which 1 ms to minimize.
[2024-06-03 00:15:21] [INFO ] Deduced a trap composed of 25 places in 83 ms of which 1 ms to minimize.
[2024-06-03 00:15:22] [INFO ] Deduced a trap composed of 93 places in 82 ms of which 1 ms to minimize.
[2024-06-03 00:15:22] [INFO ] Deduced a trap composed of 41 places in 84 ms of which 4 ms to minimize.
[2024-06-03 00:15:22] [INFO ] Deduced a trap composed of 41 places in 42 ms of which 1 ms to minimize.
[2024-06-03 00:15:22] [INFO ] Deduced a trap composed of 40 places in 82 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/138 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/138 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 5 (OVERLAPS) 442/580 variables, 138/152 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/580 variables, 26/178 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/580 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 8 (OVERLAPS) 0/580 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 462 unsolved
No progress, stopping.
After SMT solving in domain Real declared 580/581 variables, and 178 constraints, problems are : Problem set: 0 solved, 462 unsolved in 16502 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 138/138 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 462/462 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 462 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/137 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/137 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/137 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 3 (OVERLAPS) 1/138 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/138 variables, 5/14 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/138 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 6 (OVERLAPS) 442/580 variables, 138/152 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/580 variables, 26/178 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/580 variables, 462/640 constraints. Problems are: Problem set: 0 solved, 462 unsolved
[2024-06-03 00:15:46] [INFO ] Deduced a trap composed of 21 places in 95 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/580 variables, 1/641 constraints. Problems are: Problem set: 0 solved, 462 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 580/581 variables, and 641 constraints, problems are : Problem set: 0 solved, 462 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 138/138 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 462/462 constraints, Known Traps: 8/8 constraints]
After SMT, in 46881ms problems are : Problem set: 0 solved, 462 unsolved
Search for dead transitions found 0 dead transitions in 46886ms
Starting structural reductions in SI_LTL mode, iteration 1 : 138/302 places, 467/540 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 47260 ms. Remains : 138/302 places, 467/540 transitions.
Stuttering acceptance computed with spot in 40 ms :[p0]
Running random walk in product with property : FireWire-PT-18-LTLFireability-12
Product exploration explored 100000 steps with 0 reset in 143 ms.
Product exploration explored 100000 steps with 2 reset in 165 ms.
Computed a total of 21 stabilizing places and 36 stable transitions
Computed a total of 21 stabilizing places and 36 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 126 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 45 ms :[p0]
RANDOM walk for 40000 steps (2083 resets) in 147 ms. (270 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (474 resets) in 26 ms. (1481 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 3785 steps, run visited all 1 properties in 15 ms. (steps per millisecond=252 )
Probabilistic random walk after 3785 steps, saw 1588 distinct states, run finished after 21 ms. (steps per millisecond=180 ) properties seen :1
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 168 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 45 ms :[p0]
Stuttering acceptance computed with spot in 51 ms :[p0]
Support contains 2 out of 138 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 138/138 places, 467/467 transitions.
Applied a total of 0 rules in 4 ms. Remains 138 /138 variables (removed 0) and now considering 467/467 (removed 0) transitions.
[2024-06-03 00:16:06] [INFO ] Flow matrix only has 443 transitions (discarded 24 similar events)
[2024-06-03 00:16:06] [INFO ] Invariant cache hit.
[2024-06-03 00:16:06] [INFO ] Implicit Places using invariants in 78 ms returned []
[2024-06-03 00:16:06] [INFO ] Flow matrix only has 443 transitions (discarded 24 similar events)
[2024-06-03 00:16:06] [INFO ] Invariant cache hit.
[2024-06-03 00:16:06] [INFO ] State equation strengthened by 26 read => feed constraints.
[2024-06-03 00:16:06] [INFO ] Implicit Places using invariants and state equation in 227 ms returned []
Implicit Place search using SMT with State Equation took 330 ms to find 0 implicit places.
[2024-06-03 00:16:06] [INFO ] Redundant transitions in 2 ms returned []
Running 462 sub problems to find dead transitions.
[2024-06-03 00:16:06] [INFO ] Flow matrix only has 443 transitions (discarded 24 similar events)
[2024-06-03 00:16:06] [INFO ] Invariant cache hit.
[2024-06-03 00:16:06] [INFO ] State equation strengthened by 26 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/137 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/137 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 2 (OVERLAPS) 1/138 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 462 unsolved
[2024-06-03 00:16:09] [INFO ] Deduced a trap composed of 25 places in 102 ms of which 1 ms to minimize.
[2024-06-03 00:16:09] [INFO ] Deduced a trap composed of 27 places in 95 ms of which 1 ms to minimize.
[2024-06-03 00:16:09] [INFO ] Deduced a trap composed of 25 places in 93 ms of which 1 ms to minimize.
[2024-06-03 00:16:10] [INFO ] Deduced a trap composed of 93 places in 86 ms of which 1 ms to minimize.
[2024-06-03 00:16:10] [INFO ] Deduced a trap composed of 41 places in 85 ms of which 1 ms to minimize.
[2024-06-03 00:16:10] [INFO ] Deduced a trap composed of 41 places in 42 ms of which 1 ms to minimize.
[2024-06-03 00:16:10] [INFO ] Deduced a trap composed of 40 places in 46 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/138 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/138 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 5 (OVERLAPS) 442/580 variables, 138/152 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/580 variables, 26/178 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/580 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 8 (OVERLAPS) 0/580 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 462 unsolved
No progress, stopping.
After SMT solving in domain Real declared 580/581 variables, and 178 constraints, problems are : Problem set: 0 solved, 462 unsolved in 16520 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 138/138 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 462/462 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 462 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/137 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/137 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/137 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 3 (OVERLAPS) 1/138 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/138 variables, 5/14 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/138 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 6 (OVERLAPS) 442/580 variables, 138/152 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/580 variables, 26/178 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/580 variables, 462/640 constraints. Problems are: Problem set: 0 solved, 462 unsolved
[2024-06-03 00:16:35] [INFO ] Deduced a trap composed of 21 places in 85 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/580 variables, 1/641 constraints. Problems are: Problem set: 0 solved, 462 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 580/581 variables, and 641 constraints, problems are : Problem set: 0 solved, 462 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 138/138 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 462/462 constraints, Known Traps: 8/8 constraints]
After SMT, in 46859ms problems are : Problem set: 0 solved, 462 unsolved
Search for dead transitions found 0 dead transitions in 46863ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 47211 ms. Remains : 138/138 places, 467/467 transitions.
Computed a total of 21 stabilizing places and 36 stable transitions
Computed a total of 21 stabilizing places and 36 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 107 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 50 ms :[p0]
RANDOM walk for 40000 steps (2099 resets) in 118 ms. (336 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (462 resets) in 51 ms. (769 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 3785 steps, run visited all 1 properties in 27 ms. (steps per millisecond=140 )
Probabilistic random walk after 3785 steps, saw 1588 distinct states, run finished after 31 ms. (steps per millisecond=122 ) properties seen :1
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 113 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 50 ms :[p0]
Stuttering acceptance computed with spot in 45 ms :[p0]
Stuttering acceptance computed with spot in 47 ms :[p0]
Product exploration explored 100000 steps with 2 reset in 42 ms.
Product exploration explored 100000 steps with 1 reset in 167 ms.
Support contains 2 out of 138 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 138/138 places, 467/467 transitions.
Applied a total of 0 rules in 4 ms. Remains 138 /138 variables (removed 0) and now considering 467/467 (removed 0) transitions.
[2024-06-03 00:16:54] [INFO ] Flow matrix only has 443 transitions (discarded 24 similar events)
[2024-06-03 00:16:54] [INFO ] Invariant cache hit.
[2024-06-03 00:16:54] [INFO ] Implicit Places using invariants in 85 ms returned []
[2024-06-03 00:16:54] [INFO ] Flow matrix only has 443 transitions (discarded 24 similar events)
[2024-06-03 00:16:54] [INFO ] Invariant cache hit.
[2024-06-03 00:16:54] [INFO ] State equation strengthened by 26 read => feed constraints.
[2024-06-03 00:16:54] [INFO ] Implicit Places using invariants and state equation in 235 ms returned []
Implicit Place search using SMT with State Equation took 322 ms to find 0 implicit places.
[2024-06-03 00:16:54] [INFO ] Redundant transitions in 4 ms returned []
Running 462 sub problems to find dead transitions.
[2024-06-03 00:16:54] [INFO ] Flow matrix only has 443 transitions (discarded 24 similar events)
[2024-06-03 00:16:54] [INFO ] Invariant cache hit.
[2024-06-03 00:16:54] [INFO ] State equation strengthened by 26 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/137 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/137 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 2 (OVERLAPS) 1/138 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 462 unsolved
[2024-06-03 00:16:57] [INFO ] Deduced a trap composed of 25 places in 101 ms of which 1 ms to minimize.
[2024-06-03 00:16:57] [INFO ] Deduced a trap composed of 27 places in 88 ms of which 1 ms to minimize.
[2024-06-03 00:16:57] [INFO ] Deduced a trap composed of 25 places in 86 ms of which 1 ms to minimize.
[2024-06-03 00:16:58] [INFO ] Deduced a trap composed of 93 places in 85 ms of which 1 ms to minimize.
[2024-06-03 00:16:58] [INFO ] Deduced a trap composed of 41 places in 86 ms of which 1 ms to minimize.
[2024-06-03 00:16:58] [INFO ] Deduced a trap composed of 41 places in 44 ms of which 1 ms to minimize.
[2024-06-03 00:16:58] [INFO ] Deduced a trap composed of 40 places in 43 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/138 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/138 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 5 (OVERLAPS) 442/580 variables, 138/152 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/580 variables, 26/178 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/580 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 8 (OVERLAPS) 0/580 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 462 unsolved
No progress, stopping.
After SMT solving in domain Real declared 580/581 variables, and 178 constraints, problems are : Problem set: 0 solved, 462 unsolved in 16608 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 138/138 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 462/462 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 462 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/137 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/137 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/137 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 3 (OVERLAPS) 1/138 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/138 variables, 5/14 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/138 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 6 (OVERLAPS) 442/580 variables, 138/152 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/580 variables, 26/178 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/580 variables, 462/640 constraints. Problems are: Problem set: 0 solved, 462 unsolved
[2024-06-03 00:17:23] [INFO ] Deduced a trap composed of 21 places in 78 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/580 variables, 1/641 constraints. Problems are: Problem set: 0 solved, 462 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 580/581 variables, and 641 constraints, problems are : Problem set: 0 solved, 462 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 138/138 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 462/462 constraints, Known Traps: 8/8 constraints]
After SMT, in 47039ms problems are : Problem set: 0 solved, 462 unsolved
Search for dead transitions found 0 dead transitions in 47044ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 47381 ms. Remains : 138/138 places, 467/467 transitions.
Treatment of property FireWire-PT-18-LTLFireability-12 finished in 143569 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(p1))))'
Support contains 3 out of 302 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 302/302 places, 540/540 transitions.
Graph (trivial) has 212 edges and 302 vertex of which 11 / 302 are part of one of the 3 SCC in 0 ms
Free SCC test removed 8 places
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Reduce places removed 1 places and 1 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 293 transition count 493
Reduce places removed 37 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 39 rules applied. Total rules applied 77 place count 256 transition count 491
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 79 place count 255 transition count 490
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 80 place count 254 transition count 490
Performed 27 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 27 Pre rules applied. Total rules applied 80 place count 254 transition count 463
Deduced a syphon composed of 27 places in 0 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 4 with 54 rules applied. Total rules applied 134 place count 227 transition count 463
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 142 place count 219 transition count 416
Iterating global reduction 4 with 8 rules applied. Total rules applied 150 place count 219 transition count 416
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 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 4 with 5 rules applied. Total rules applied 155 place count 219 transition count 411
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 156 place count 218 transition count 411
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 156 place count 218 transition count 409
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 160 place count 216 transition count 409
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 164 place count 212 transition count 403
Iterating global reduction 6 with 4 rules applied. Total rules applied 168 place count 212 transition count 403
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 170 place count 210 transition count 399
Iterating global reduction 6 with 2 rules applied. Total rules applied 172 place count 210 transition count 399
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 174 place count 208 transition count 393
Iterating global reduction 6 with 2 rules applied. Total rules applied 176 place count 208 transition count 393
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 178 place count 206 transition count 389
Iterating global reduction 6 with 2 rules applied. Total rules applied 180 place count 206 transition count 389
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 182 place count 204 transition count 384
Iterating global reduction 6 with 2 rules applied. Total rules applied 184 place count 204 transition count 384
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 186 place count 202 transition count 380
Iterating global reduction 6 with 2 rules applied. Total rules applied 188 place count 202 transition count 380
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 189 place count 201 transition count 377
Iterating global reduction 6 with 1 rules applied. Total rules applied 190 place count 201 transition count 377
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 191 place count 200 transition count 375
Iterating global reduction 6 with 1 rules applied. Total rules applied 192 place count 200 transition count 375
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 193 place count 199 transition count 372
Iterating global reduction 6 with 1 rules applied. Total rules applied 194 place count 199 transition count 372
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 195 place count 198 transition count 370
Iterating global reduction 6 with 1 rules applied. Total rules applied 196 place count 198 transition count 370
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 197 place count 197 transition count 367
Iterating global reduction 6 with 1 rules applied. Total rules applied 198 place count 197 transition count 367
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 199 place count 196 transition count 365
Iterating global reduction 6 with 1 rules applied. Total rules applied 200 place count 196 transition count 365
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 201 place count 195 transition count 363
Iterating global reduction 6 with 1 rules applied. Total rules applied 202 place count 195 transition count 363
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 203 place count 194 transition count 361
Iterating global reduction 6 with 1 rules applied. Total rules applied 204 place count 194 transition count 361
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 6 with 48 rules applied. Total rules applied 252 place count 170 transition count 337
Performed 30 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 6 with 60 rules applied. Total rules applied 312 place count 140 transition count 414
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 6 with 5 rules applied. Total rules applied 317 place count 140 transition count 409
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 318 place count 139 transition count 408
Applied a total of 318 rules in 63 ms. Remains 139 /302 variables (removed 163) and now considering 408/540 (removed 132) transitions.
[2024-06-03 00:17:41] [INFO ] Flow matrix only has 389 transitions (discarded 19 similar events)
// Phase 1: matrix 389 rows 139 cols
[2024-06-03 00:17:41] [INFO ] Computed 7 invariants in 2 ms
[2024-06-03 00:17:41] [INFO ] Implicit Places using invariants in 149 ms returned []
[2024-06-03 00:17:41] [INFO ] Flow matrix only has 389 transitions (discarded 19 similar events)
[2024-06-03 00:17:41] [INFO ] Invariant cache hit.
[2024-06-03 00:17:41] [INFO ] State equation strengthened by 25 read => feed constraints.
[2024-06-03 00:17:41] [INFO ] Implicit Places using invariants and state equation in 234 ms returned []
Implicit Place search using SMT with State Equation took 403 ms to find 0 implicit places.
[2024-06-03 00:17:41] [INFO ] Redundant transitions in 2 ms returned []
Running 403 sub problems to find dead transitions.
[2024-06-03 00:17:41] [INFO ] Flow matrix only has 389 transitions (discarded 19 similar events)
[2024-06-03 00:17:41] [INFO ] Invariant cache hit.
[2024-06-03 00:17:41] [INFO ] State equation strengthened by 25 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/138 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/138 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 2 (OVERLAPS) 1/139 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 403 unsolved
[2024-06-03 00:17:44] [INFO ] Deduced a trap composed of 23 places in 88 ms of which 1 ms to minimize.
[2024-06-03 00:17:44] [INFO ] Deduced a trap composed of 25 places in 96 ms of which 1 ms to minimize.
[2024-06-03 00:17:45] [INFO ] Deduced a trap composed of 23 places in 86 ms of which 1 ms to minimize.
[2024-06-03 00:17:45] [INFO ] Deduced a trap composed of 96 places in 86 ms of which 1 ms to minimize.
[2024-06-03 00:17:45] [INFO ] Deduced a trap composed of 43 places in 72 ms of which 1 ms to minimize.
[2024-06-03 00:17:45] [INFO ] Deduced a trap composed of 44 places in 35 ms of which 0 ms to minimize.
[2024-06-03 00:17:45] [INFO ] Deduced a trap composed of 40 places in 50 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/139 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/139 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 5 (OVERLAPS) 388/527 variables, 139/153 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/527 variables, 25/178 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/527 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 8 (OVERLAPS) 0/527 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 403 unsolved
No progress, stopping.
After SMT solving in domain Real declared 527/528 variables, and 178 constraints, problems are : Problem set: 0 solved, 403 unsolved in 12820 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 139/139 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 403/403 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 403 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/138 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/138 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/138 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 3 (OVERLAPS) 1/139 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/139 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/139 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 6 (OVERLAPS) 388/527 variables, 139/153 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/527 variables, 25/178 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/527 variables, 403/581 constraints. Problems are: Problem set: 0 solved, 403 unsolved
[2024-06-03 00:18:07] [INFO ] Deduced a trap composed of 26 places in 85 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/527 variables, 1/582 constraints. Problems are: Problem set: 0 solved, 403 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 527/528 variables, and 582 constraints, problems are : Problem set: 0 solved, 403 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 139/139 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 403/403 constraints, Known Traps: 8/8 constraints]
After SMT, in 43122ms problems are : Problem set: 0 solved, 403 unsolved
Search for dead transitions found 0 dead transitions in 43126ms
Starting structural reductions in SI_LTL mode, iteration 1 : 139/302 places, 408/540 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 43612 ms. Remains : 139/302 places, 408/540 transitions.
Stuttering acceptance computed with spot in 141 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : FireWire-PT-18-LTLFireability-13
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA FireWire-PT-18-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-18-LTLFireability-13 finished in 43775 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G((F(p1)&&F(G(p2)))))))'
Support contains 5 out of 302 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 302/302 places, 540/540 transitions.
Graph (trivial) has 210 edges and 302 vertex of which 8 / 302 are part of one of the 2 SCC in 0 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 38 transitions
Trivial Post-agglo rules discarded 38 transitions
Performed 38 trivial Post agglomeration. Transition count delta: 38
Iterating post reduction 0 with 38 rules applied. Total rules applied 39 place count 295 transition count 494
Reduce places removed 38 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 40 rules applied. Total rules applied 79 place count 257 transition count 492
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 81 place count 256 transition count 491
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 82 place count 255 transition count 491
Performed 27 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 27 Pre rules applied. Total rules applied 82 place count 255 transition count 464
Deduced a syphon composed of 27 places in 0 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 4 with 54 rules applied. Total rules applied 136 place count 228 transition count 464
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 144 place count 220 transition count 417
Iterating global reduction 4 with 8 rules applied. Total rules applied 152 place count 220 transition count 417
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 155 place count 220 transition count 414
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 155 place count 220 transition count 412
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 159 place count 218 transition count 412
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 162 place count 215 transition count 407
Iterating global reduction 5 with 3 rules applied. Total rules applied 165 place count 215 transition count 407
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 168 place count 212 transition count 401
Iterating global reduction 5 with 3 rules applied. Total rules applied 171 place count 212 transition count 401
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 173 place count 210 transition count 395
Iterating global reduction 5 with 2 rules applied. Total rules applied 175 place count 210 transition count 395
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 177 place count 208 transition count 391
Iterating global reduction 5 with 2 rules applied. Total rules applied 179 place count 208 transition count 391
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 181 place count 206 transition count 386
Iterating global reduction 5 with 2 rules applied. Total rules applied 183 place count 206 transition count 386
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 185 place count 204 transition count 382
Iterating global reduction 5 with 2 rules applied. Total rules applied 187 place count 204 transition count 382
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 188 place count 203 transition count 379
Iterating global reduction 5 with 1 rules applied. Total rules applied 189 place count 203 transition count 379
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 190 place count 202 transition count 377
Iterating global reduction 5 with 1 rules applied. Total rules applied 191 place count 202 transition count 377
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 192 place count 201 transition count 374
Iterating global reduction 5 with 1 rules applied. Total rules applied 193 place count 201 transition count 374
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 194 place count 200 transition count 372
Iterating global reduction 5 with 1 rules applied. Total rules applied 195 place count 200 transition count 372
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 196 place count 199 transition count 369
Iterating global reduction 5 with 1 rules applied. Total rules applied 197 place count 199 transition count 369
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 198 place count 198 transition count 367
Iterating global reduction 5 with 1 rules applied. Total rules applied 199 place count 198 transition count 367
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 200 place count 197 transition count 365
Iterating global reduction 5 with 1 rules applied. Total rules applied 201 place count 197 transition count 365
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 202 place count 196 transition count 363
Iterating global reduction 5 with 1 rules applied. Total rules applied 203 place count 196 transition count 363
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 5 with 48 rules applied. Total rules applied 251 place count 172 transition count 339
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 252 place count 172 transition count 338
Performed 30 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 6 with 60 rules applied. Total rules applied 312 place count 142 transition count 414
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 314 place count 142 transition count 412
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 315 place count 141 transition count 411
Applied a total of 315 rules in 70 ms. Remains 141 /302 variables (removed 161) and now considering 411/540 (removed 129) transitions.
[2024-06-03 00:18:25] [INFO ] Flow matrix only has 396 transitions (discarded 15 similar events)
// Phase 1: matrix 396 rows 141 cols
[2024-06-03 00:18:25] [INFO ] Computed 7 invariants in 2 ms
[2024-06-03 00:18:25] [INFO ] Implicit Places using invariants in 87 ms returned []
[2024-06-03 00:18:25] [INFO ] Flow matrix only has 396 transitions (discarded 15 similar events)
[2024-06-03 00:18:25] [INFO ] Invariant cache hit.
[2024-06-03 00:18:25] [INFO ] State equation strengthened by 24 read => feed constraints.
[2024-06-03 00:18:25] [INFO ] Implicit Places using invariants and state equation in 221 ms returned []
Implicit Place search using SMT with State Equation took 310 ms to find 0 implicit places.
[2024-06-03 00:18:25] [INFO ] Redundant transitions in 4 ms returned []
Running 406 sub problems to find dead transitions.
[2024-06-03 00:18:25] [INFO ] Flow matrix only has 396 transitions (discarded 15 similar events)
[2024-06-03 00:18:25] [INFO ] Invariant cache hit.
[2024-06-03 00:18:25] [INFO ] State equation strengthened by 24 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/140 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/140 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 2 (OVERLAPS) 1/141 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 406 unsolved
[2024-06-03 00:18:28] [INFO ] Deduced a trap composed of 51 places in 87 ms of which 1 ms to minimize.
[2024-06-03 00:18:28] [INFO ] Deduced a trap composed of 71 places in 77 ms of which 1 ms to minimize.
[2024-06-03 00:18:28] [INFO ] Deduced a trap composed of 27 places in 81 ms of which 1 ms to minimize.
[2024-06-03 00:18:28] [INFO ] Deduced a trap composed of 20 places in 71 ms of which 1 ms to minimize.
[2024-06-03 00:18:29] [INFO ] Deduced a trap composed of 26 places in 74 ms of which 1 ms to minimize.
[2024-06-03 00:18:29] [INFO ] Deduced a trap composed of 96 places in 82 ms of which 1 ms to minimize.
[2024-06-03 00:18:29] [INFO ] Deduced a trap composed of 41 places in 68 ms of which 0 ms to minimize.
[2024-06-03 00:18:29] [INFO ] Deduced a trap composed of 42 places in 32 ms of which 0 ms to minimize.
[2024-06-03 00:18:29] [INFO ] Deduced a trap composed of 43 places in 40 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/141 variables, 9/16 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/141 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 5 (OVERLAPS) 395/536 variables, 141/157 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/536 variables, 23/180 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/536 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 8 (OVERLAPS) 1/537 variables, 1/181 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/537 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 10 (OVERLAPS) 0/537 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 406 unsolved
No progress, stopping.
After SMT solving in domain Real declared 537/537 variables, and 181 constraints, problems are : Problem set: 0 solved, 406 unsolved in 18672 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 141/141 constraints, ReadFeed: 24/24 constraints, PredecessorRefiner: 406/406 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 406 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/140 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/140 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/140 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 3 (OVERLAPS) 1/141 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/141 variables, 3/16 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/141 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 6 (OVERLAPS) 395/536 variables, 141/157 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/536 variables, 23/180 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/536 variables, 406/586 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/536 variables, 0/586 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 10 (OVERLAPS) 1/537 variables, 1/587 constraints. Problems are: Problem set: 0 solved, 406 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 537/537 variables, and 587 constraints, problems are : Problem set: 0 solved, 406 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 141/141 constraints, ReadFeed: 24/24 constraints, PredecessorRefiner: 406/406 constraints, Known Traps: 9/9 constraints]
After SMT, in 48988ms problems are : Problem set: 0 solved, 406 unsolved
Search for dead transitions found 0 dead transitions in 48993ms
Starting structural reductions in SI_LTL mode, iteration 1 : 141/302 places, 411/540 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 49385 ms. Remains : 141/302 places, 411/540 transitions.
Stuttering acceptance computed with spot in 144 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : FireWire-PT-18-LTLFireability-14
Product exploration explored 100000 steps with 0 reset in 123 ms.
Product exploration explored 100000 steps with 12 reset in 175 ms.
Computed a total of 21 stabilizing places and 37 stable transitions
Computed a total of 21 stabilizing places and 37 stable transitions
Knowledge obtained : [(AND p1 (NOT p2) p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X p0), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p0))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (AND p0 (NOT p2))), (X (NOT (AND p0 (NOT p2)))), (X (AND p0 p2)), (X (NOT (AND p0 p2))), (X p1), (X (NOT p1)), (X (X p2)), (X (X (NOT p2))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND p0 p2))), (X (X (NOT (AND p0 p2)))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 9 factoid took 884 ms. Reduced automaton from 3 states, 9 edges and 3 AP (stutter insensitive) to 3 states, 9 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 145 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p0))]
RANDOM walk for 40000 steps (14 resets) in 107 ms. (370 steps per ms) remains 4/9 properties
BEST_FIRST walk for 40002 steps (8 resets) in 42 ms. (930 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40000 steps (12 resets) in 138 ms. (287 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (10 resets) in 174 ms. (228 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (8 resets) in 472 ms. (84 steps per ms) remains 4/4 properties
[2024-06-03 00:19:16] [INFO ] Flow matrix only has 396 transitions (discarded 15 similar events)
[2024-06-03 00:19:16] [INFO ] Invariant cache hit.
[2024-06-03 00:19:16] [INFO ] State equation strengthened by 24 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 119/124 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 9/133 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/133 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 395/528 variables, 133/140 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/528 variables, 23/163 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/528 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 8/536 variables, 8/171 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/536 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 1/537 variables, 1/172 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/537 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 0/537 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 537/537 variables, and 172 constraints, problems are : Problem set: 0 solved, 4 unsolved in 240 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 141/141 constraints, ReadFeed: 24/24 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 119/124 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 9/133 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/133 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 395/528 variables, 133/140 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/528 variables, 23/163 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/528 variables, 4/167 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/528 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 8/536 variables, 8/175 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-03 00:19:17] [INFO ] Deduced a trap composed of 20 places in 79 ms of which 1 ms to minimize.
[2024-06-03 00:19:17] [INFO ] Deduced a trap composed of 40 places in 77 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/536 variables, 2/177 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/536 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 1/537 variables, 1/178 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/537 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 0/537 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 537/537 variables, and 178 constraints, problems are : Problem set: 0 solved, 4 unsolved in 592 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 141/141 constraints, ReadFeed: 24/24 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 2/2 constraints]
After SMT, in 843ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 235 ms.
Support contains 5 out of 141 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 141/141 places, 411/411 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 141 transition count 409
Free-agglomeration rule applied 14 times.
Iterating global reduction 1 with 14 rules applied. Total rules applied 16 place count 141 transition count 395
Reduce places removed 14 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 19 rules applied. Total rules applied 35 place count 127 transition count 390
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 37 place count 125 transition count 388
Iterating global reduction 2 with 2 rules applied. Total rules applied 39 place count 125 transition count 388
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 42 place count 125 transition count 385
Drop transitions (Redundant composition of simpler transitions.) removed 17 transitions
Redundant transition composition rules discarded 17 transitions
Iterating global reduction 3 with 17 rules applied. Total rules applied 59 place count 125 transition count 368
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 60 place count 125 transition count 368
Applied a total of 60 rules in 31 ms. Remains 125 /141 variables (removed 16) and now considering 368/411 (removed 43) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31 ms. Remains : 125/141 places, 368/411 transitions.
RANDOM walk for 40000 steps (32 resets) in 759 ms. (52 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 262 ms. (152 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40000 steps (33 resets) in 720 ms. (55 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (10 resets) in 650 ms. (61 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (8 resets) in 143 ms. (277 steps per ms) remains 4/4 properties
Finished probabilistic random walk after 3206 steps, run visited all 4 properties in 43 ms. (steps per millisecond=74 )
Probabilistic random walk after 3206 steps, saw 1456 distinct states, run finished after 44 ms. (steps per millisecond=72 ) properties seen :4
Knowledge obtained : [(AND p1 (NOT p2) p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X p0), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p0))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (AND p0 (NOT p2))), (X (NOT (AND p0 (NOT p2)))), (X (AND p0 p2)), (X (NOT (AND p0 p2))), (X p1), (X (NOT p1)), (X (X p2)), (X (X (NOT p2))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND p0 p2))), (X (X (NOT (AND p0 p2)))), (X (X p1)), (X (X (NOT p1))), (F (NOT (OR p0 p2))), (F p2), (F (NOT p0)), (F (NOT (AND p0 (NOT p2)))), (F (NOT (OR p1 (NOT p0)))), (F (NOT (OR p0 (NOT p2)))), (F (NOT p1)), (F (NOT (OR p1 p0))), (F (NOT (OR (NOT p0) (NOT p2))))]
Knowledge based reduction with 9 factoid took 1190 ms. Reduced automaton from 3 states, 9 edges and 3 AP (stutter insensitive) to 3 states, 9 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 158 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 145 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p0))]
Support contains 5 out of 141 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 141/141 places, 411/411 transitions.
Applied a total of 0 rules in 11 ms. Remains 141 /141 variables (removed 0) and now considering 411/411 (removed 0) transitions.
[2024-06-03 00:19:20] [INFO ] Flow matrix only has 396 transitions (discarded 15 similar events)
[2024-06-03 00:19:20] [INFO ] Invariant cache hit.
[2024-06-03 00:19:20] [INFO ] Implicit Places using invariants in 88 ms returned []
[2024-06-03 00:19:20] [INFO ] Flow matrix only has 396 transitions (discarded 15 similar events)
[2024-06-03 00:19:20] [INFO ] Invariant cache hit.
[2024-06-03 00:19:20] [INFO ] State equation strengthened by 24 read => feed constraints.
[2024-06-03 00:19:20] [INFO ] Implicit Places using invariants and state equation in 215 ms returned []
Implicit Place search using SMT with State Equation took 303 ms to find 0 implicit places.
[2024-06-03 00:19:20] [INFO ] Redundant transitions in 4 ms returned []
Running 406 sub problems to find dead transitions.
[2024-06-03 00:19:20] [INFO ] Flow matrix only has 396 transitions (discarded 15 similar events)
[2024-06-03 00:19:20] [INFO ] Invariant cache hit.
[2024-06-03 00:19:20] [INFO ] State equation strengthened by 24 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/140 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/140 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 2 (OVERLAPS) 1/141 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 406 unsolved
[2024-06-03 00:19:23] [INFO ] Deduced a trap composed of 51 places in 83 ms of which 1 ms to minimize.
[2024-06-03 00:19:23] [INFO ] Deduced a trap composed of 71 places in 80 ms of which 1 ms to minimize.
[2024-06-03 00:19:23] [INFO ] Deduced a trap composed of 27 places in 79 ms of which 1 ms to minimize.
[2024-06-03 00:19:23] [INFO ] Deduced a trap composed of 20 places in 82 ms of which 1 ms to minimize.
[2024-06-03 00:19:23] [INFO ] Deduced a trap composed of 26 places in 85 ms of which 1 ms to minimize.
[2024-06-03 00:19:24] [INFO ] Deduced a trap composed of 96 places in 75 ms of which 1 ms to minimize.
[2024-06-03 00:19:24] [INFO ] Deduced a trap composed of 41 places in 78 ms of which 1 ms to minimize.
[2024-06-03 00:19:24] [INFO ] Deduced a trap composed of 42 places in 35 ms of which 1 ms to minimize.
[2024-06-03 00:19:24] [INFO ] Deduced a trap composed of 43 places in 40 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/141 variables, 9/16 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/141 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 5 (OVERLAPS) 395/536 variables, 141/157 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/536 variables, 23/180 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/536 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 8 (OVERLAPS) 1/537 variables, 1/181 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/537 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 10 (OVERLAPS) 0/537 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 406 unsolved
No progress, stopping.
After SMT solving in domain Real declared 537/537 variables, and 181 constraints, problems are : Problem set: 0 solved, 406 unsolved in 18496 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 141/141 constraints, ReadFeed: 24/24 constraints, PredecessorRefiner: 406/406 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 406 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/140 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/140 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/140 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 3 (OVERLAPS) 1/141 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/141 variables, 3/16 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/141 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 6 (OVERLAPS) 395/536 variables, 141/157 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/536 variables, 23/180 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/536 variables, 406/586 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/536 variables, 0/586 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 10 (OVERLAPS) 1/537 variables, 1/587 constraints. Problems are: Problem set: 0 solved, 406 unsolved
(s8 1timeout
^^^^^^^^
(error "Invalid token: 1timeout")
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 1timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 537/537 variables, and 587 constraints, problems are : Problem set: 0 solved, 406 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 141/141 constraints, ReadFeed: 24/24 constraints, PredecessorRefiner: 406/406 constraints, Known Traps: 9/9 constraints]
After SMT, in 48832ms problems are : Problem set: 0 solved, 406 unsolved
Search for dead transitions found 0 dead transitions in 48837ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 49166 ms. Remains : 141/141 places, 411/411 transitions.
Computed a total of 21 stabilizing places and 37 stable transitions
Computed a total of 21 stabilizing places and 37 stable transitions
Knowledge obtained : [(AND p1 (NOT p2) p0), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p0)), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (AND (NOT p1) p0)), (X (NOT (AND (NOT p1) p0))), (X (AND p0 (NOT p2))), (X (NOT (AND p0 (NOT p2)))), (X (AND p0 p2)), (X (NOT (AND p0 p2))), (X p1), (X (NOT p1)), (X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND p0 p2))), (X (X (NOT (AND p0 p2)))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 9 factoid took 717 ms. Reduced automaton from 3 states, 9 edges and 3 AP (stutter insensitive) to 3 states, 9 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 134 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p0))]
RANDOM walk for 40000 steps (20 resets) in 409 ms. (97 steps per ms) remains 4/9 properties
BEST_FIRST walk for 40002 steps (8 resets) in 311 ms. (128 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (8 resets) in 169 ms. (235 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40000 steps (12 resets) in 425 ms. (93 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (14 resets) in 185 ms. (215 steps per ms) remains 4/4 properties
[2024-06-03 00:20:10] [INFO ] Flow matrix only has 396 transitions (discarded 15 similar events)
[2024-06-03 00:20:10] [INFO ] Invariant cache hit.
[2024-06-03 00:20:10] [INFO ] State equation strengthened by 24 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 119/124 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 9/133 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/133 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 395/528 variables, 133/140 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/528 variables, 23/163 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/528 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 8/536 variables, 8/171 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/536 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 1/537 variables, 1/172 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/537 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 0/537 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 537/537 variables, and 172 constraints, problems are : Problem set: 0 solved, 4 unsolved in 248 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 141/141 constraints, ReadFeed: 24/24 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 119/124 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 9/133 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/133 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 395/528 variables, 133/140 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/528 variables, 23/163 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/528 variables, 4/167 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-03 00:20:11] [INFO ] Deduced a trap composed of 20 places in 84 ms of which 1 ms to minimize.
[2024-06-03 00:20:11] [INFO ] Deduced a trap composed of 40 places in 81 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/528 variables, 2/169 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/528 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 8/536 variables, 8/177 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/536 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 1/537 variables, 1/178 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/537 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 0/537 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 537/537 variables, and 178 constraints, problems are : Problem set: 0 solved, 4 unsolved in 611 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 141/141 constraints, ReadFeed: 24/24 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 2/2 constraints]
After SMT, in 867ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 210 ms.
Support contains 5 out of 141 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 141/141 places, 411/411 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 141 transition count 409
Free-agglomeration rule applied 14 times.
Iterating global reduction 1 with 14 rules applied. Total rules applied 16 place count 141 transition count 395
Reduce places removed 14 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 19 rules applied. Total rules applied 35 place count 127 transition count 390
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 37 place count 125 transition count 388
Iterating global reduction 2 with 2 rules applied. Total rules applied 39 place count 125 transition count 388
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 42 place count 125 transition count 385
Drop transitions (Redundant composition of simpler transitions.) removed 17 transitions
Redundant transition composition rules discarded 17 transitions
Iterating global reduction 3 with 17 rules applied. Total rules applied 59 place count 125 transition count 368
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 60 place count 125 transition count 368
Applied a total of 60 rules in 20 ms. Remains 125 /141 variables (removed 16) and now considering 368/411 (removed 43) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 125/141 places, 368/411 transitions.
RANDOM walk for 40000 steps (19 resets) in 441 ms. (90 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (8 resets) in 172 ms. (231 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 195 ms. (204 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40000 steps (18 resets) in 492 ms. (81 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (29 resets) in 261 ms. (152 steps per ms) remains 4/4 properties
Finished probabilistic random walk after 3206 steps, run visited all 4 properties in 37 ms. (steps per millisecond=86 )
Probabilistic random walk after 3206 steps, saw 1456 distinct states, run finished after 37 ms. (steps per millisecond=86 ) properties seen :4
Knowledge obtained : [(AND p1 (NOT p2) p0), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p0)), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (AND (NOT p1) p0)), (X (NOT (AND (NOT p1) p0))), (X (AND p0 (NOT p2))), (X (NOT (AND p0 (NOT p2)))), (X (AND p0 p2)), (X (NOT (AND p0 p2))), (X p1), (X (NOT p1)), (X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND p0 p2))), (X (X (NOT (AND p0 p2)))), (X (X p1)), (X (X (NOT p1))), (F p2), (F (NOT (OR (NOT p2) p0))), (F (NOT (OR (NOT p2) (NOT p0)))), (F (NOT (OR (NOT p0) p1))), (F (NOT (OR p0 p1))), (F (NOT (AND (NOT p2) p0))), (F (NOT p1)), (F (NOT p0)), (F (NOT (OR p2 p0)))]
Knowledge based reduction with 9 factoid took 1209 ms. Reduced automaton from 3 states, 9 edges and 3 AP (stutter insensitive) to 3 states, 9 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 140 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 136 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 143 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p0))]
Product exploration explored 100000 steps with 0 reset in 207 ms.
Product exploration explored 100000 steps with 5 reset in 118 ms.
Support contains 5 out of 141 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 141/141 places, 411/411 transitions.
Applied a total of 0 rules in 4 ms. Remains 141 /141 variables (removed 0) and now considering 411/411 (removed 0) transitions.
[2024-06-03 00:20:14] [INFO ] Flow matrix only has 396 transitions (discarded 15 similar events)
[2024-06-03 00:20:14] [INFO ] Invariant cache hit.
[2024-06-03 00:20:14] [INFO ] Implicit Places using invariants in 88 ms returned []
[2024-06-03 00:20:14] [INFO ] Flow matrix only has 396 transitions (discarded 15 similar events)
[2024-06-03 00:20:14] [INFO ] Invariant cache hit.
[2024-06-03 00:20:14] [INFO ] State equation strengthened by 24 read => feed constraints.
[2024-06-03 00:20:14] [INFO ] Implicit Places using invariants and state equation in 231 ms returned []
Implicit Place search using SMT with State Equation took 320 ms to find 0 implicit places.
[2024-06-03 00:20:14] [INFO ] Redundant transitions in 3 ms returned []
Running 406 sub problems to find dead transitions.
[2024-06-03 00:20:14] [INFO ] Flow matrix only has 396 transitions (discarded 15 similar events)
[2024-06-03 00:20:14] [INFO ] Invariant cache hit.
[2024-06-03 00:20:14] [INFO ] State equation strengthened by 24 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/140 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/140 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 2 (OVERLAPS) 1/141 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 406 unsolved
[2024-06-03 00:20:17] [INFO ] Deduced a trap composed of 51 places in 87 ms of which 2 ms to minimize.
[2024-06-03 00:20:17] [INFO ] Deduced a trap composed of 71 places in 76 ms of which 1 ms to minimize.
[2024-06-03 00:20:17] [INFO ] Deduced a trap composed of 27 places in 81 ms of which 2 ms to minimize.
[2024-06-03 00:20:17] [INFO ] Deduced a trap composed of 20 places in 74 ms of which 1 ms to minimize.
[2024-06-03 00:20:18] [INFO ] Deduced a trap composed of 26 places in 73 ms of which 1 ms to minimize.
[2024-06-03 00:20:18] [INFO ] Deduced a trap composed of 96 places in 79 ms of which 1 ms to minimize.
[2024-06-03 00:20:18] [INFO ] Deduced a trap composed of 41 places in 83 ms of which 1 ms to minimize.
[2024-06-03 00:20:18] [INFO ] Deduced a trap composed of 42 places in 35 ms of which 0 ms to minimize.
[2024-06-03 00:20:18] [INFO ] Deduced a trap composed of 43 places in 45 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/141 variables, 9/16 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/141 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 5 (OVERLAPS) 395/536 variables, 141/157 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/536 variables, 23/180 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/536 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 8 (OVERLAPS) 1/537 variables, 1/181 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/537 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 10 (OVERLAPS) 0/537 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 406 unsolved
No progress, stopping.
After SMT solving in domain Real declared 537/537 variables, and 181 constraints, problems are : Problem set: 0 solved, 406 unsolved in 18699 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 141/141 constraints, ReadFeed: 24/24 constraints, PredecessorRefiner: 406/406 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 406 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/140 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/140 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/140 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 3 (OVERLAPS) 1/141 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/141 variables, 3/16 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/141 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 6 (OVERLAPS) 395/536 variables, 141/157 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/536 variables, 23/180 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/536 variables, 406/586 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/536 variables, 0/586 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 10 (OVERLAPS) 1/537 variables, 1/587 constraints. Problems are: Problem set: 0 solved, 406 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 537/537 variables, and 587 constraints, problems are : Problem set: 0 solved, 406 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 141/141 constraints, ReadFeed: 24/24 constraints, PredecessorRefiner: 406/406 constraints, Known Traps: 9/9 constraints]
After SMT, in 49038ms problems are : Problem set: 0 solved, 406 unsolved
Search for dead transitions found 0 dead transitions in 49042ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 49376 ms. Remains : 141/141 places, 411/411 transitions.
Treatment of property FireWire-PT-18-LTLFireability-14 finished in 158536 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 302 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 302/302 places, 540/540 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 291 transition count 490
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 291 transition count 490
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 24 place count 291 transition count 488
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 30 place count 285 transition count 479
Iterating global reduction 1 with 6 rules applied. Total rules applied 36 place count 285 transition count 479
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 40 place count 281 transition count 472
Iterating global reduction 1 with 4 rules applied. Total rules applied 44 place count 281 transition count 472
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 46 place count 279 transition count 466
Iterating global reduction 1 with 2 rules applied. Total rules applied 48 place count 279 transition count 466
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 50 place count 277 transition count 462
Iterating global reduction 1 with 2 rules applied. Total rules applied 52 place count 277 transition count 462
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 54 place count 275 transition count 457
Iterating global reduction 1 with 2 rules applied. Total rules applied 56 place count 275 transition count 457
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 58 place count 273 transition count 453
Iterating global reduction 1 with 2 rules applied. Total rules applied 60 place count 273 transition count 453
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 62 place count 271 transition count 449
Iterating global reduction 1 with 2 rules applied. Total rules applied 64 place count 271 transition count 449
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 65 place count 270 transition count 447
Iterating global reduction 1 with 1 rules applied. Total rules applied 66 place count 270 transition count 447
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 67 place count 269 transition count 444
Iterating global reduction 1 with 1 rules applied. Total rules applied 68 place count 269 transition count 444
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 69 place count 268 transition count 442
Iterating global reduction 1 with 1 rules applied. Total rules applied 70 place count 268 transition count 442
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 71 place count 267 transition count 439
Iterating global reduction 1 with 1 rules applied. Total rules applied 72 place count 267 transition count 439
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 73 place count 266 transition count 437
Iterating global reduction 1 with 1 rules applied. Total rules applied 74 place count 266 transition count 437
Applied a total of 74 rules in 26 ms. Remains 266 /302 variables (removed 36) and now considering 437/540 (removed 103) transitions.
// Phase 1: matrix 437 rows 266 cols
[2024-06-03 00:21:03] [INFO ] Computed 7 invariants in 4 ms
[2024-06-03 00:21:03] [INFO ] Implicit Places using invariants in 115 ms returned []
[2024-06-03 00:21:03] [INFO ] Invariant cache hit.
[2024-06-03 00:21:04] [INFO ] Implicit Places using invariants and state equation in 234 ms returned []
Implicit Place search using SMT with State Equation took 375 ms to find 0 implicit places.
Running 436 sub problems to find dead transitions.
[2024-06-03 00:21:04] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/265 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 436 unsolved
At refinement iteration 1 (OVERLAPS) 1/266 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 436 unsolved
[2024-06-03 00:21:08] [INFO ] Deduced a trap composed of 169 places in 126 ms of which 2 ms to minimize.
[2024-06-03 00:21:08] [INFO ] Deduced a trap composed of 77 places in 51 ms of which 1 ms to minimize.
[2024-06-03 00:21:08] [INFO ] Deduced a trap composed of 76 places in 43 ms of which 1 ms to minimize.
[2024-06-03 00:21:09] [INFO ] Deduced a trap composed of 77 places in 49 ms of which 1 ms to minimize.
[2024-06-03 00:21:09] [INFO ] Deduced a trap composed of 76 places in 47 ms of which 1 ms to minimize.
[2024-06-03 00:21:09] [INFO ] Deduced a trap composed of 88 places in 43 ms of which 0 ms to minimize.
[2024-06-03 00:21:09] [INFO ] Deduced a trap composed of 39 places in 99 ms of which 1 ms to minimize.
[2024-06-03 00:21:09] [INFO ] Deduced a trap composed of 87 places in 100 ms of which 2 ms to minimize.
[2024-06-03 00:21:10] [INFO ] Deduced a trap composed of 49 places in 95 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/266 variables, 9/16 constraints. Problems are: Problem set: 0 solved, 436 unsolved
[2024-06-03 00:21:11] [INFO ] Deduced a trap composed of 153 places in 103 ms of which 2 ms to minimize.
[2024-06-03 00:21:11] [INFO ] Deduced a trap composed of 151 places in 93 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/266 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 436 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/266 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 436 unsolved
At refinement iteration 5 (OVERLAPS) 437/703 variables, 266/284 constraints. Problems are: Problem set: 0 solved, 436 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/703 variables, 0/284 constraints. Problems are: Problem set: 0 solved, 436 unsolved
At refinement iteration 7 (OVERLAPS) 0/703 variables, 0/284 constraints. Problems are: Problem set: 0 solved, 436 unsolved
No progress, stopping.
After SMT solving in domain Real declared 703/703 variables, and 284 constraints, problems are : Problem set: 0 solved, 436 unsolved in 27269 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 266/266 constraints, PredecessorRefiner: 436/436 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 436 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/265 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 436 unsolved
At refinement iteration 1 (OVERLAPS) 1/266 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 436 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/266 variables, 11/18 constraints. Problems are: Problem set: 0 solved, 436 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/266 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 436 unsolved
At refinement iteration 4 (OVERLAPS) 437/703 variables, 266/284 constraints. Problems are: Problem set: 0 solved, 436 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/703 variables, 436/720 constraints. Problems are: Problem set: 0 solved, 436 unsolved
[2024-06-03 00:21:39] [INFO ] Deduced a trap composed of 23 places in 49 ms of which 1 ms to minimize.
[2024-06-03 00:21:48] [INFO ] Deduced a trap composed of 78 places in 59 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/703 variables, 2/722 constraints. Problems are: Problem set: 0 solved, 436 unsolved
[2024-06-03 00:21:56] [INFO ] Deduced a trap composed of 160 places in 103 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 703/703 variables, and 723 constraints, problems are : Problem set: 0 solved, 436 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 266/266 constraints, PredecessorRefiner: 436/436 constraints, Known Traps: 14/14 constraints]
After SMT, in 57414ms problems are : Problem set: 0 solved, 436 unsolved
Search for dead transitions found 0 dead transitions in 57418ms
Starting structural reductions in LTL mode, iteration 1 : 266/302 places, 437/540 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 57820 ms. Remains : 266/302 places, 437/540 transitions.
Stuttering acceptance computed with spot in 89 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FireWire-PT-18-LTLFireability-15
Product exploration explored 100000 steps with 50000 reset in 178 ms.
Product exploration explored 100000 steps with 50000 reset in 194 ms.
Computed a total of 59 stabilizing places and 77 stable transitions
Computed a total of 59 stabilizing places and 77 stable transitions
Knowledge obtained : [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 18 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FireWire-PT-18-LTLFireability-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FireWire-PT-18-LTLFireability-15 finished in 58320 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(X((F(p0)||(X(p1) U p2))))))'
Found a Lengthening insensitive property : FireWire-PT-18-LTLFireability-08
Stuttering acceptance computed with spot in 127 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Support contains 5 out of 302 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 302/302 places, 540/540 transitions.
Graph (trivial) has 212 edges and 302 vertex of which 11 / 302 are part of one of the 3 SCC in 0 ms
Free SCC test removed 8 places
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
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 293 transition count 491
Reduce places removed 39 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 41 rules applied. Total rules applied 81 place count 254 transition count 489
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 82 place count 253 transition count 489
Performed 27 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 27 Pre rules applied. Total rules applied 82 place count 253 transition count 462
Deduced a syphon composed of 27 places in 1 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 3 with 54 rules applied. Total rules applied 136 place count 226 transition count 462
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 144 place count 218 transition count 416
Iterating global reduction 3 with 8 rules applied. Total rules applied 152 place count 218 transition count 416
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 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 5 rules applied. Total rules applied 157 place count 218 transition count 411
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 158 place count 217 transition count 411
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 158 place count 217 transition count 409
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 162 place count 215 transition count 409
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 165 place count 212 transition count 406
Iterating global reduction 5 with 3 rules applied. Total rules applied 168 place count 212 transition count 406
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 170 place count 210 transition count 402
Iterating global reduction 5 with 2 rules applied. Total rules applied 172 place count 210 transition count 402
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 173 place count 209 transition count 399
Iterating global reduction 5 with 1 rules applied. Total rules applied 174 place count 209 transition count 399
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 175 place count 208 transition count 397
Iterating global reduction 5 with 1 rules applied. Total rules applied 176 place count 208 transition count 397
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 177 place count 207 transition count 394
Iterating global reduction 5 with 1 rules applied. Total rules applied 178 place count 207 transition count 394
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 179 place count 206 transition count 392
Iterating global reduction 5 with 1 rules applied. Total rules applied 180 place count 206 transition count 392
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 181 place count 205 transition count 389
Iterating global reduction 5 with 1 rules applied. Total rules applied 182 place count 205 transition count 389
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 183 place count 204 transition count 387
Iterating global reduction 5 with 1 rules applied. Total rules applied 184 place count 204 transition count 387
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 185 place count 203 transition count 384
Iterating global reduction 5 with 1 rules applied. Total rules applied 186 place count 203 transition count 384
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 187 place count 202 transition count 382
Iterating global reduction 5 with 1 rules applied. Total rules applied 188 place count 202 transition count 382
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 189 place count 201 transition count 379
Iterating global reduction 5 with 1 rules applied. Total rules applied 190 place count 201 transition count 379
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 191 place count 200 transition count 377
Iterating global reduction 5 with 1 rules applied. Total rules applied 192 place count 200 transition count 377
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 193 place count 199 transition count 375
Iterating global reduction 5 with 1 rules applied. Total rules applied 194 place count 199 transition count 375
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 195 place count 198 transition count 373
Iterating global reduction 5 with 1 rules applied. Total rules applied 196 place count 198 transition count 373
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 5 with 48 rules applied. Total rules applied 244 place count 174 transition count 349
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 245 place count 174 transition count 348
Performed 29 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 6 with 58 rules applied. Total rules applied 303 place count 145 transition count 407
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 304 place count 144 transition count 406
Applied a total of 304 rules in 65 ms. Remains 144 /302 variables (removed 158) and now considering 406/540 (removed 134) transitions.
[2024-06-03 00:22:02] [INFO ] Flow matrix only has 387 transitions (discarded 19 similar events)
// Phase 1: matrix 387 rows 144 cols
[2024-06-03 00:22:02] [INFO ] Computed 7 invariants in 4 ms
[2024-06-03 00:22:02] [INFO ] Implicit Places using invariants in 92 ms returned []
[2024-06-03 00:22:02] [INFO ] Flow matrix only has 387 transitions (discarded 19 similar events)
[2024-06-03 00:22:02] [INFO ] Invariant cache hit.
[2024-06-03 00:22:02] [INFO ] State equation strengthened by 9 read => feed constraints.
[2024-06-03 00:22:02] [INFO ] Implicit Places using invariants and state equation in 192 ms returned []
Implicit Place search using SMT with State Equation took 285 ms to find 0 implicit places.
Running 401 sub problems to find dead transitions.
[2024-06-03 00:22:02] [INFO ] Flow matrix only has 387 transitions (discarded 19 similar events)
[2024-06-03 00:22:02] [INFO ] Invariant cache hit.
[2024-06-03 00:22:02] [INFO ] State equation strengthened by 9 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 401 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 401 unsolved
At refinement iteration 2 (OVERLAPS) 1/144 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 401 unsolved
[2024-06-03 00:22:05] [INFO ] Deduced a trap composed of 24 places in 82 ms of which 1 ms to minimize.
[2024-06-03 00:22:05] [INFO ] Deduced a trap composed of 26 places in 77 ms of which 1 ms to minimize.
[2024-06-03 00:22:06] [INFO ] Deduced a trap composed of 50 places in 45 ms of which 1 ms to minimize.
[2024-06-03 00:22:06] [INFO ] Deduced a trap composed of 96 places in 95 ms of which 1 ms to minimize.
[2024-06-03 00:22:06] [INFO ] Deduced a trap composed of 24 places in 76 ms of which 1 ms to minimize.
[2024-06-03 00:22:06] [INFO ] Deduced a trap composed of 43 places in 82 ms of which 1 ms to minimize.
[2024-06-03 00:22:06] [INFO ] Deduced a trap composed of 44 places in 88 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/144 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 401 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/144 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 401 unsolved
At refinement iteration 5 (OVERLAPS) 386/530 variables, 144/158 constraints. Problems are: Problem set: 0 solved, 401 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/530 variables, 9/167 constraints. Problems are: Problem set: 0 solved, 401 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/530 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 401 unsolved
At refinement iteration 8 (OVERLAPS) 0/530 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 401 unsolved
No progress, stopping.
After SMT solving in domain Real declared 530/531 variables, and 167 constraints, problems are : Problem set: 0 solved, 401 unsolved in 13025 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 144/144 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 401/401 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 401 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 401 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 401 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/143 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 401 unsolved
At refinement iteration 3 (OVERLAPS) 1/144 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 401 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/144 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 401 unsolved
[2024-06-03 00:22:18] [INFO ] Deduced a trap composed of 40 places in 77 ms of which 1 ms to minimize.
[2024-06-03 00:22:18] [INFO ] Deduced a trap composed of 20 places in 81 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/144 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 401 unsolved
[2024-06-03 00:22:20] [INFO ] Deduced a trap composed of 41 places in 80 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/144 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 401 unsolved
[2024-06-03 00:22:21] [INFO ] Deduced a trap composed of 100 places in 83 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/144 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 401 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/144 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 401 unsolved
At refinement iteration 9 (OVERLAPS) 386/530 variables, 144/162 constraints. Problems are: Problem set: 0 solved, 401 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/530 variables, 9/171 constraints. Problems are: Problem set: 0 solved, 401 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/530 variables, 401/572 constraints. Problems are: Problem set: 0 solved, 401 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/530 variables, 0/572 constraints. Problems are: Problem set: 0 solved, 401 unsolved
At refinement iteration 13 (OVERLAPS) 0/530 variables, 0/572 constraints. Problems are: Problem set: 0 solved, 401 unsolved
No progress, stopping.
After SMT solving in domain Int declared 530/531 variables, and 572 constraints, problems are : Problem set: 0 solved, 401 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 144/144 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 401/401 constraints, Known Traps: 11/11 constraints]
After SMT, in 43348ms problems are : Problem set: 0 solved, 401 unsolved
Search for dead transitions found 0 dead transitions in 43353ms
Starting structural reductions in LI_LTL mode, iteration 1 : 144/302 places, 406/540 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 43704 ms. Remains : 144/302 places, 406/540 transitions.
Running random walk in product with property : FireWire-PT-18-LTLFireability-08
Product exploration explored 100000 steps with 1 reset in 38 ms.
Product exploration explored 100000 steps with 1 reset in 43 ms.
Computed a total of 28 stabilizing places and 52 stable transitions
Computed a total of 28 stabilizing places and 52 stable transitions
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p2)), (X (NOT (AND (NOT p0) (NOT p2)))), (X p0), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 221 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter sensitive) to 3 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 140 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
RANDOM walk for 40000 steps (2067 resets) in 561 ms. (71 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (473 resets) in 198 ms. (201 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (473 resets) in 170 ms. (233 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (478 resets) in 148 ms. (268 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (479 resets) in 213 ms. (186 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (485 resets) in 141 ms. (281 steps per ms) remains 5/5 properties
Finished probabilistic random walk after 896838 steps, run visited all 5 properties in 2262 ms. (steps per millisecond=396 )
Probabilistic random walk after 896838 steps, saw 254088 distinct states, run finished after 2264 ms. (steps per millisecond=396 ) properties seen :5
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p2)), (X (NOT (AND (NOT p0) (NOT p2)))), (X p0), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT p0)), (F p2), (F (NOT (OR p2 p0))), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 11 factoid took 260 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter sensitive) to 3 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 153 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 121 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Support contains 5 out of 144 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 144/144 places, 406/406 transitions.
Applied a total of 0 rules in 2 ms. Remains 144 /144 variables (removed 0) and now considering 406/406 (removed 0) transitions.
[2024-06-03 00:22:49] [INFO ] Flow matrix only has 387 transitions (discarded 19 similar events)
[2024-06-03 00:22:49] [INFO ] Invariant cache hit.
[2024-06-03 00:22:49] [INFO ] Implicit Places using invariants in 88 ms returned []
[2024-06-03 00:22:49] [INFO ] Flow matrix only has 387 transitions (discarded 19 similar events)
[2024-06-03 00:22:49] [INFO ] Invariant cache hit.
[2024-06-03 00:22:50] [INFO ] State equation strengthened by 9 read => feed constraints.
[2024-06-03 00:22:50] [INFO ] Implicit Places using invariants and state equation in 199 ms returned []
Implicit Place search using SMT with State Equation took 314 ms to find 0 implicit places.
Running 401 sub problems to find dead transitions.
[2024-06-03 00:22:50] [INFO ] Flow matrix only has 387 transitions (discarded 19 similar events)
[2024-06-03 00:22:50] [INFO ] Invariant cache hit.
[2024-06-03 00:22:50] [INFO ] State equation strengthened by 9 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 401 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 401 unsolved
At refinement iteration 2 (OVERLAPS) 1/144 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 401 unsolved
[2024-06-03 00:22:52] [INFO ] Deduced a trap composed of 24 places in 85 ms of which 1 ms to minimize.
[2024-06-03 00:22:52] [INFO ] Deduced a trap composed of 26 places in 81 ms of which 1 ms to minimize.
[2024-06-03 00:22:53] [INFO ] Deduced a trap composed of 50 places in 47 ms of which 0 ms to minimize.
[2024-06-03 00:22:53] [INFO ] Deduced a trap composed of 96 places in 80 ms of which 1 ms to minimize.
[2024-06-03 00:22:53] [INFO ] Deduced a trap composed of 24 places in 74 ms of which 1 ms to minimize.
[2024-06-03 00:22:53] [INFO ] Deduced a trap composed of 43 places in 80 ms of which 1 ms to minimize.
[2024-06-03 00:22:54] [INFO ] Deduced a trap composed of 44 places in 84 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/144 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 401 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/144 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 401 unsolved
At refinement iteration 5 (OVERLAPS) 386/530 variables, 144/158 constraints. Problems are: Problem set: 0 solved, 401 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/530 variables, 9/167 constraints. Problems are: Problem set: 0 solved, 401 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/530 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 401 unsolved
At refinement iteration 8 (OVERLAPS) 0/530 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 401 unsolved
No progress, stopping.
After SMT solving in domain Real declared 530/531 variables, and 167 constraints, problems are : Problem set: 0 solved, 401 unsolved in 12766 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 144/144 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 401/401 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 401 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 401 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 401 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/143 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 401 unsolved
At refinement iteration 3 (OVERLAPS) 1/144 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 401 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/144 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 401 unsolved
[2024-06-03 00:23:05] [INFO ] Deduced a trap composed of 40 places in 85 ms of which 2 ms to minimize.
[2024-06-03 00:23:05] [INFO ] Deduced a trap composed of 20 places in 77 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/144 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 401 unsolved
[2024-06-03 00:23:07] [INFO ] Deduced a trap composed of 41 places in 79 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/144 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 401 unsolved
[2024-06-03 00:23:08] [INFO ] Deduced a trap composed of 100 places in 78 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/144 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 401 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/144 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 401 unsolved
At refinement iteration 9 (OVERLAPS) 386/530 variables, 144/162 constraints. Problems are: Problem set: 0 solved, 401 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/530 variables, 9/171 constraints. Problems are: Problem set: 0 solved, 401 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/530 variables, 401/572 constraints. Problems are: Problem set: 0 solved, 401 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/530 variables, 0/572 constraints. Problems are: Problem set: 0 solved, 401 unsolved
At refinement iteration 13 (OVERLAPS) 0/530 variables, 0/572 constraints. Problems are: Problem set: 0 solved, 401 unsolved
No progress, stopping.
After SMT solving in domain Int declared 530/531 variables, and 572 constraints, problems are : Problem set: 0 solved, 401 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 144/144 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 401/401 constraints, Known Traps: 11/11 constraints]
After SMT, in 43065ms problems are : Problem set: 0 solved, 401 unsolved
Search for dead transitions found 0 dead transitions in 43070ms
Finished structural reductions in LTL mode , in 1 iterations and 43387 ms. Remains : 144/144 places, 406/406 transitions.
Computed a total of 28 stabilizing places and 52 stable transitions
Computed a total of 28 stabilizing places and 52 stable transitions
Knowledge obtained : [(AND (NOT p2) p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p2)), (X (NOT (AND (NOT p2) (NOT p0)))), (X p0), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 217 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter sensitive) to 3 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 130 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
RANDOM walk for 40000 steps (2060 resets) in 707 ms. (56 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (476 resets) in 136 ms. (291 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (482 resets) in 249 ms. (160 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (478 resets) in 215 ms. (185 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (472 resets) in 206 ms. (193 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (480 resets) in 173 ms. (229 steps per ms) remains 5/5 properties
Finished probabilistic random walk after 896838 steps, run visited all 5 properties in 2145 ms. (steps per millisecond=418 )
Probabilistic random walk after 896838 steps, saw 254088 distinct states, run finished after 2145 ms. (steps per millisecond=418 ) properties seen :5
Knowledge obtained : [(AND (NOT p2) p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p2)), (X (NOT (AND (NOT p2) (NOT p0)))), (X p0), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT p0)), (F p2), (F (NOT (OR p2 p0))), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 11 factoid took 301 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter sensitive) to 3 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 136 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 112 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 154 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 4 reset in 48 ms.
Product exploration explored 100000 steps with 1 reset in 48 ms.
Support contains 5 out of 144 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 144/144 places, 406/406 transitions.
Applied a total of 0 rules in 1 ms. Remains 144 /144 variables (removed 0) and now considering 406/406 (removed 0) transitions.
[2024-06-03 00:23:37] [INFO ] Flow matrix only has 387 transitions (discarded 19 similar events)
[2024-06-03 00:23:37] [INFO ] Invariant cache hit.
[2024-06-03 00:23:37] [INFO ] Implicit Places using invariants in 89 ms returned []
[2024-06-03 00:23:37] [INFO ] Flow matrix only has 387 transitions (discarded 19 similar events)
[2024-06-03 00:23:37] [INFO ] Invariant cache hit.
[2024-06-03 00:23:37] [INFO ] State equation strengthened by 9 read => feed constraints.
[2024-06-03 00:23:37] [INFO ] Implicit Places using invariants and state equation in 195 ms returned []
Implicit Place search using SMT with State Equation took 286 ms to find 0 implicit places.
Running 401 sub problems to find dead transitions.
[2024-06-03 00:23:37] [INFO ] Flow matrix only has 387 transitions (discarded 19 similar events)
[2024-06-03 00:23:37] [INFO ] Invariant cache hit.
[2024-06-03 00:23:37] [INFO ] State equation strengthened by 9 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 401 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 401 unsolved
At refinement iteration 2 (OVERLAPS) 1/144 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 401 unsolved
[2024-06-03 00:23:40] [INFO ] Deduced a trap composed of 24 places in 87 ms of which 1 ms to minimize.
[2024-06-03 00:23:40] [INFO ] Deduced a trap composed of 26 places in 90 ms of which 1 ms to minimize.
[2024-06-03 00:23:40] [INFO ] Deduced a trap composed of 50 places in 41 ms of which 0 ms to minimize.
[2024-06-03 00:23:40] [INFO ] Deduced a trap composed of 96 places in 77 ms of which 1 ms to minimize.
[2024-06-03 00:23:41] [INFO ] Deduced a trap composed of 24 places in 73 ms of which 1 ms to minimize.
[2024-06-03 00:23:41] [INFO ] Deduced a trap composed of 43 places in 76 ms of which 1 ms to minimize.
[2024-06-03 00:23:41] [INFO ] Deduced a trap composed of 44 places in 83 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/144 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 401 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/144 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 401 unsolved
At refinement iteration 5 (OVERLAPS) 386/530 variables, 144/158 constraints. Problems are: Problem set: 0 solved, 401 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/530 variables, 9/167 constraints. Problems are: Problem set: 0 solved, 401 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/530 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 401 unsolved
At refinement iteration 8 (OVERLAPS) 0/530 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 401 unsolved
No progress, stopping.
After SMT solving in domain Real declared 530/531 variables, and 167 constraints, problems are : Problem set: 0 solved, 401 unsolved in 12381 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 144/144 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 401/401 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 401 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 401 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 401 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/143 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 401 unsolved
At refinement iteration 3 (OVERLAPS) 1/144 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 401 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/144 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 401 unsolved
[2024-06-03 00:23:52] [INFO ] Deduced a trap composed of 40 places in 75 ms of which 1 ms to minimize.
[2024-06-03 00:23:52] [INFO ] Deduced a trap composed of 20 places in 82 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/144 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 401 unsolved
[2024-06-03 00:23:54] [INFO ] Deduced a trap composed of 41 places in 100 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/144 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 401 unsolved
[2024-06-03 00:23:55] [INFO ] Deduced a trap composed of 100 places in 80 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/144 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 401 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/144 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 401 unsolved
At refinement iteration 9 (OVERLAPS) 386/530 variables, 144/162 constraints. Problems are: Problem set: 0 solved, 401 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/530 variables, 9/171 constraints. Problems are: Problem set: 0 solved, 401 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/530 variables, 401/572 constraints. Problems are: Problem set: 0 solved, 401 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/530 variables, 0/572 constraints. Problems are: Problem set: 0 solved, 401 unsolved
At refinement iteration 13 (OVERLAPS) 0/530 variables, 0/572 constraints. Problems are: Problem set: 0 solved, 401 unsolved
No progress, stopping.
After SMT solving in domain Int declared 530/531 variables, and 572 constraints, problems are : Problem set: 0 solved, 401 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 144/144 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 401/401 constraints, Known Traps: 11/11 constraints]
After SMT, in 42673ms problems are : Problem set: 0 solved, 401 unsolved
Search for dead transitions found 0 dead transitions in 42678ms
Finished structural reductions in LTL mode , in 1 iterations and 42966 ms. Remains : 144/144 places, 406/406 transitions.
Treatment of property FireWire-PT-18-LTLFireability-08 finished in 138187 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(G(p0))||G(p1)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(G(!p0)) U !p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G((F(p1)&&F(G(p2)))))))'
[2024-06-03 00:24:20] [INFO ] Flatten gal took : 40 ms
[2024-06-03 00:24:20] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/LTLFireability.sr.xml took 15 ms.
[2024-06-03 00:24:20] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 302 places, 540 transitions and 1709 arcs took 17 ms.
Total runtime 1305520 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------
Running FireWire-PT-18
IS_COLORED=
IS_NUPN=
LOADING PETRI NET FILE /home/mcc/execution/411/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 302
TRANSITIONS: 540
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.008s, Sys 0.004s]
SAVING FILE /home/mcc/execution/411/model (.net / .def) ...
EXPORT TIME: [User 0.002s, Sys 0.000s]
----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES
Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net
Process ID: 3022
MODEL NAME: /home/mcc/execution/411/model
302 places, 540 transitions.
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA FireWire-PT-18-LTLFireability-12 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA FireWire-PT-18-LTLFireability-08 CANNOT_COMPUTE
FORMULA FireWire-PT-18-LTLFireability-11 CANNOT_COMPUTE
FORMULA FireWire-PT-18-LTLFireability-14 CANNOT_COMPUTE
Ok.
EXITCODE: 0
----------------------------------------------------------------------
BK_STOP 1717374677114
--------------------
content from stderr:
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
MEDDLY ERROR: Insufficient memory
Error in allocating array of size 2097152 at unique_table.cc, line 313
MEDDLY ERROR: Insufficient memory
MEDDLY ERROR: Insufficient memory
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-18"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="greatspnxred"
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-5568"
echo " Executing tool greatspnxred"
echo " Input is FireWire-PT-18, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r549-tall-171734898300308"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/FireWire-PT-18.tgz
mv FireWire-PT-18 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;