About the Execution of GreatSPN+red for FireWire-PT-19
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 7915.607 | 1771495.00 | 2505353.00 | 4640.60 | FTFFFTFFF?FFFTF? | 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-171734898300316.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-19, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r549-tall-171734898300316
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 668K
-rw-r--r-- 1 mcc users 7.8K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 89K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K 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.2K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 9.5K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 100K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.4K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 73K 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 221K 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-19-LTLFireability-00
FORMULA_NAME FireWire-PT-19-LTLFireability-01
FORMULA_NAME FireWire-PT-19-LTLFireability-02
FORMULA_NAME FireWire-PT-19-LTLFireability-03
FORMULA_NAME FireWire-PT-19-LTLFireability-04
FORMULA_NAME FireWire-PT-19-LTLFireability-05
FORMULA_NAME FireWire-PT-19-LTLFireability-06
FORMULA_NAME FireWire-PT-19-LTLFireability-07
FORMULA_NAME FireWire-PT-19-LTLFireability-08
FORMULA_NAME FireWire-PT-19-LTLFireability-09
FORMULA_NAME FireWire-PT-19-LTLFireability-10
FORMULA_NAME FireWire-PT-19-LTLFireability-11
FORMULA_NAME FireWire-PT-19-LTLFireability-12
FORMULA_NAME FireWire-PT-19-LTLFireability-13
FORMULA_NAME FireWire-PT-19-LTLFireability-14
FORMULA_NAME FireWire-PT-19-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1717374690235
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-19
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-06-03 00:31:31] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-03 00:31:31] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-03 00:31:31] [INFO ] Load time of PNML (sax parser for PT used): 102 ms
[2024-06-03 00:31:31] [INFO ] Transformed 602 places.
[2024-06-03 00:31:31] [INFO ] Transformed 944 transitions.
[2024-06-03 00:31:31] [INFO ] Found NUPN structural information;
[2024-06-03 00:31:31] [INFO ] Parsed PT model containing 602 places and 944 transitions and 2776 arcs in 201 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA FireWire-PT-19-LTLFireability-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-19-LTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Initial state reduction rules removed 1 formulas.
FORMULA FireWire-PT-19-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 42 out of 602 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 602/602 places, 944/944 transitions.
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 593 transition count 944
Discarding 121 places :
Symmetric choice reduction at 1 with 121 rule applications. Total rules 130 place count 472 transition count 823
Iterating global reduction 1 with 121 rules applied. Total rules applied 251 place count 472 transition count 823
Discarding 31 places :
Symmetric choice reduction at 1 with 31 rule applications. Total rules 282 place count 441 transition count 781
Iterating global reduction 1 with 31 rules applied. Total rules applied 313 place count 441 transition count 781
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 316 place count 441 transition count 778
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 319 place count 438 transition count 775
Iterating global reduction 2 with 3 rules applied. Total rules applied 322 place count 438 transition count 775
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 324 place count 436 transition count 773
Iterating global reduction 2 with 2 rules applied. Total rules applied 326 place count 436 transition count 773
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 328 place count 434 transition count 771
Iterating global reduction 2 with 2 rules applied. Total rules applied 330 place count 434 transition count 771
Applied a total of 330 rules in 135 ms. Remains 434 /602 variables (removed 168) and now considering 771/944 (removed 173) transitions.
// Phase 1: matrix 771 rows 434 cols
[2024-06-03 00:31:31] [INFO ] Computed 10 invariants in 25 ms
[2024-06-03 00:31:32] [INFO ] Implicit Places using invariants in 342 ms returned []
[2024-06-03 00:31:32] [INFO ] Invariant cache hit.
[2024-06-03 00:31:32] [INFO ] Implicit Places using invariants and state equation in 428 ms returned []
Implicit Place search using SMT with State Equation took 799 ms to find 0 implicit places.
Running 770 sub problems to find dead transitions.
[2024-06-03 00:31:32] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/433 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 770 unsolved
At refinement iteration 1 (OVERLAPS) 1/434 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 770 unsolved
[2024-06-03 00:31:44] [INFO ] Deduced a trap composed of 87 places in 111 ms of which 13 ms to minimize.
[2024-06-03 00:31:44] [INFO ] Deduced a trap composed of 77 places in 109 ms of which 6 ms to minimize.
[2024-06-03 00:31:44] [INFO ] Deduced a trap composed of 29 places in 52 ms of which 1 ms to minimize.
[2024-06-03 00:31:45] [INFO ] Deduced a trap composed of 90 places in 61 ms of which 1 ms to minimize.
[2024-06-03 00:31:46] [INFO ] Deduced a trap composed of 88 places in 63 ms of which 1 ms to minimize.
[2024-06-03 00:31:46] [INFO ] Deduced a trap composed of 56 places in 125 ms of which 2 ms to minimize.
[2024-06-03 00:31:47] [INFO ] Deduced a trap composed of 79 places in 125 ms of which 2 ms to minimize.
[2024-06-03 00:31:51] [INFO ] Deduced a trap composed of 74 places in 48 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/434 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 770 unsolved
[2024-06-03 00:31:53] [INFO ] Deduced a trap composed of 76 places in 57 ms of which 1 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 1.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 timeout
0.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/434 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 770 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 434/1205 variables, and 19 constraints, problems are : Problem set: 0 solved, 770 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 0/434 constraints, PredecessorRefiner: 770/770 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 770 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/433 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 770 unsolved
At refinement iteration 1 (OVERLAPS) 1/434 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 770 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/434 variables, 9/19 constraints. Problems are: Problem set: 0 solved, 770 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/434 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 770 unsolved
At refinement iteration 4 (OVERLAPS) 771/1205 variables, 434/453 constraints. Problems are: Problem set: 0 solved, 770 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1205 variables, 770/1223 constraints. Problems are: Problem set: 0 solved, 770 unsolved
[2024-06-03 00:32:24] [INFO ] Deduced a trap composed of 76 places in 94 ms of which 6 ms to minimize.
[2024-06-03 00:32:25] [INFO ] Deduced a trap composed of 230 places in 166 ms of which 3 ms to minimize.
[2024-06-03 00:32:28] [INFO ] Deduced a trap composed of 75 places in 89 ms of which 1 ms to minimize.
[2024-06-03 00:32:28] [INFO ] Deduced a trap composed of 149 places in 141 ms of which 2 ms to minimize.
[2024-06-03 00:32:28] [INFO ] Deduced a trap composed of 134 places in 165 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1205/1205 variables, and 1228 constraints, problems are : Problem set: 0 solved, 770 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 434/434 constraints, PredecessorRefiner: 770/770 constraints, Known Traps: 14/14 constraints]
After SMT, in 60543ms problems are : Problem set: 0 solved, 770 unsolved
Search for dead transitions found 0 dead transitions in 60578ms
Starting structural reductions in LTL mode, iteration 1 : 434/602 places, 771/944 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61540 ms. Remains : 434/602 places, 771/944 transitions.
Support contains 42 out of 434 places after structural reductions.
[2024-06-03 00:32:33] [INFO ] Flatten gal took : 81 ms
[2024-06-03 00:32:33] [INFO ] Flatten gal took : 42 ms
[2024-06-03 00:32:33] [INFO ] Input system was already deterministic with 771 transitions.
Support contains 41 out of 434 places (down from 42) after GAL structural reductions.
RANDOM walk for 40000 steps (29 resets) in 1895 ms. (21 steps per ms) remains 28/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 42 ms. (93 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 48 ms. (81 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (8 resets) in 44 ms. (88 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (8 resets) in 36 ms. (108 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 33 ms. (117 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 41 ms. (95 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (8 resets) in 36 ms. (108 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 41 ms. (95 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (8 resets) in 19 ms. (200 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 41 ms. (95 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 35 ms. (111 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (8 resets) in 34 ms. (114 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (8 resets) in 19 ms. (200 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (8 resets) in 11 ms. (333 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (8 resets) in 10 ms. (363 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 28/28 properties
[2024-06-03 00:32:34] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 1 (OVERLAPS) 281/316 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 28 unsolved
[2024-06-03 00:32:34] [INFO ] Deduced a trap composed of 79 places in 122 ms of which 2 ms to minimize.
[2024-06-03 00:32:35] [INFO ] Deduced a trap composed of 75 places in 128 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/316 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/316 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 4 (OVERLAPS) 61/377 variables, 5/12 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/377 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 6 (OVERLAPS) 711/1088 variables, 377/389 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1088 variables, 0/389 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 8 (OVERLAPS) 27/1115 variables, 12/401 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1115 variables, 0/401 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 10 (OVERLAPS) 31/1146 variables, 15/416 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1146 variables, 0/416 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 12 (OVERLAPS) 20/1166 variables, 10/426 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1166 variables, 0/426 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 14 (OVERLAPS) 24/1190 variables, 10/436 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1190 variables, 0/436 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 16 (OVERLAPS) 14/1204 variables, 9/445 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1204 variables, 0/445 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 18 (OVERLAPS) 1/1205 variables, 1/446 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1205 variables, 0/446 constraints. Problems are: Problem set: 0 solved, 28 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1205/1205 variables, and 446 constraints, problems are : Problem set: 0 solved, 28 unsolved in 5009 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 434/434 constraints, PredecessorRefiner: 28/28 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 28 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 1 (OVERLAPS) 281/316 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/316 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/316 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 4 (OVERLAPS) 61/377 variables, 5/12 constraints. Problems are: Problem set: 0 solved, 28 unsolved
[2024-06-03 00:32:40] [INFO ] Deduced a trap composed of 76 places in 46 ms of which 1 ms to minimize.
[2024-06-03 00:32:40] [INFO ] Deduced a trap composed of 75 places in 66 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/377 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/377 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 7 (OVERLAPS) 711/1088 variables, 377/391 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1088 variables, 28/419 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1088 variables, 0/419 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 10 (OVERLAPS) 27/1115 variables, 12/431 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1115 variables, 0/431 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 12 (OVERLAPS) 31/1146 variables, 15/446 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1146 variables, 0/446 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 14 (OVERLAPS) 20/1166 variables, 10/456 constraints. Problems are: Problem set: 0 solved, 28 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1166/1205 variables, and 456 constraints, problems are : Problem set: 0 solved, 28 unsolved in 5008 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 414/434 constraints, PredecessorRefiner: 28/28 constraints, Known Traps: 4/4 constraints]
After SMT, in 10044ms problems are : Problem set: 0 solved, 28 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 35 out of 434 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 434/434 places, 771/771 transitions.
Graph (trivial) has 290 edges and 434 vertex of which 9 / 434 are part of one of the 2 SCC in 4 ms
Free SCC test removed 7 places
Drop transitions (Empty/Sink Transition effects.) removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 68 transitions
Trivial Post-agglo rules discarded 68 transitions
Performed 68 trivial Post agglomeration. Transition count delta: 68
Iterating post reduction 0 with 68 rules applied. Total rules applied 69 place count 427 transition count 691
Reduce places removed 68 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 73 rules applied. Total rules applied 142 place count 359 transition count 686
Reduce places removed 2 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 2 with 7 rules applied. Total rules applied 149 place count 357 transition count 681
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 154 place count 352 transition count 681
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 40 Pre rules applied. Total rules applied 154 place count 352 transition count 641
Deduced a syphon composed of 40 places in 1 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 4 with 80 rules applied. Total rules applied 234 place count 312 transition count 641
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 235 place count 311 transition count 640
Iterating global reduction 4 with 1 rules applied. Total rules applied 236 place count 311 transition count 640
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 236 place count 311 transition count 639
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 238 place count 310 transition count 639
Performed 46 Post agglomeration using F-continuation condition.Transition count delta: 46
Deduced a syphon composed of 46 places in 1 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 4 with 92 rules applied. Total rules applied 330 place count 264 transition count 593
Performed 34 Post agglomeration using F-continuation condition.Transition count delta: -148
Deduced a syphon composed of 34 places in 1 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 4 with 68 rules applied. Total rules applied 398 place count 230 transition count 741
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 4 with 6 rules applied. Total rules applied 404 place count 230 transition count 735
Free-agglomeration rule applied 28 times.
Iterating global reduction 4 with 28 rules applied. Total rules applied 432 place count 230 transition count 707
Reduce places removed 28 places and 0 transitions.
Iterating post reduction 4 with 28 rules applied. Total rules applied 460 place count 202 transition count 707
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 5 with 6 rules applied. Total rules applied 466 place count 202 transition count 707
Applied a total of 466 rules in 152 ms. Remains 202 /434 variables (removed 232) and now considering 707/771 (removed 64) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 152 ms. Remains : 202/434 places, 707/771 transitions.
RANDOM walk for 40000 steps (1558 resets) in 937 ms. (42 steps per ms) remains 18/28 properties
BEST_FIRST walk for 4004 steps (29 resets) in 10 ms. (364 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (28 resets) in 15 ms. (250 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (27 resets) in 11 ms. (333 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (30 resets) in 11 ms. (333 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (27 resets) in 11 ms. (333 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (30 resets) in 15 ms. (250 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (29 resets) in 16 ms. (235 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (23 resets) in 10 ms. (363 steps per ms) remains 17/18 properties
BEST_FIRST walk for 4003 steps (17 resets) in 25 ms. (153 steps per ms) remains 16/17 properties
BEST_FIRST walk for 4003 steps (31 resets) in 12 ms. (307 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (20 resets) in 19 ms. (200 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (30 resets) in 10 ms. (364 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4000 steps (26 resets) in 21 ms. (181 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (27 resets) in 17 ms. (222 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (28 resets) in 9 ms. (400 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (27 resets) in 10 ms. (363 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (31 resets) in 14 ms. (266 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (31 resets) in 11 ms. (333 steps per ms) remains 16/16 properties
[2024-06-03 00:32:45] [INFO ] Flow matrix only has 682 transitions (discarded 25 similar events)
// Phase 1: matrix 682 rows 202 cols
[2024-06-03 00:32:45] [INFO ] Computed 10 invariants in 3 ms
[2024-06-03 00:32:45] [INFO ] State equation strengthened by 46 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 158/179 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/179 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (OVERLAPS) 17/196 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 16 unsolved
[2024-06-03 00:32:45] [INFO ] Deduced a trap composed of 47 places in 46 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/196 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/196 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (OVERLAPS) 682/878 variables, 196/207 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/878 variables, 46/253 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/878 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 9 (OVERLAPS) 6/884 variables, 6/259 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/884 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 11 (OVERLAPS) 0/884 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Real declared 884/884 variables, and 259 constraints, problems are : Problem set: 0 solved, 16 unsolved in 993 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 202/202 constraints, ReadFeed: 46/46 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 16 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 158/179 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/179 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (OVERLAPS) 17/196 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/196 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 16 unsolved
[2024-06-03 00:32:46] [INFO ] Deduced a trap composed of 42 places in 41 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/196 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/196 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (OVERLAPS) 682/878 variables, 196/208 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/878 variables, 46/254 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/878 variables, 16/270 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/878 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 11 (OVERLAPS) 6/884 variables, 6/276 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/884 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 13 (OVERLAPS) 0/884 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Int declared 884/884 variables, and 276 constraints, problems are : Problem set: 0 solved, 16 unsolved in 1972 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 202/202 constraints, ReadFeed: 46/46 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 2/2 constraints]
After SMT, in 3006ms problems are : Problem set: 0 solved, 16 unsolved
Parikh walk visited 0 properties in 4478 ms.
Support contains 21 out of 202 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 202/202 places, 707/707 transitions.
Graph (trivial) has 40 edges and 202 vertex of which 2 / 202 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 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 0 with 2 rules applied. Total rules applied 3 place count 201 transition count 703
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 5 place count 199 transition count 703
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 5 place count 199 transition count 700
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 11 place count 196 transition count 700
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 15 place count 194 transition count 698
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -30
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 25 place count 189 transition count 728
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 2 with 3 rules applied. Total rules applied 28 place count 189 transition count 725
Free-agglomeration rule applied 6 times.
Iterating global reduction 2 with 6 rules applied. Total rules applied 34 place count 189 transition count 719
Reduce places removed 6 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 15 rules applied. Total rules applied 49 place count 183 transition count 710
Drop transitions (Redundant composition of simpler transitions.) removed 83 transitions
Redundant transition composition rules discarded 83 transitions
Iterating global reduction 3 with 83 rules applied. Total rules applied 132 place count 183 transition count 627
Applied a total of 132 rules in 73 ms. Remains 183 /202 variables (removed 19) and now considering 627/707 (removed 80) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 73 ms. Remains : 183/202 places, 627/707 transitions.
RANDOM walk for 40000 steps (1337 resets) in 529 ms. (75 steps per ms) remains 8/16 properties
BEST_FIRST walk for 40004 steps (281 resets) in 83 ms. (476 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (269 resets) in 65 ms. (606 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (17 resets) in 80 ms. (493 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (77 resets) in 94 ms. (421 steps per ms) remains 6/8 properties
BEST_FIRST walk for 40004 steps (73 resets) in 69 ms. (571 steps per ms) remains 3/6 properties
BEST_FIRST walk for 40004 steps (77 resets) in 85 ms. (465 steps per ms) remains 3/3 properties
[2024-06-03 00:32:53] [INFO ] Flow matrix only has 592 transitions (discarded 35 similar events)
// Phase 1: matrix 592 rows 183 cols
[2024-06-03 00:32:53] [INFO ] Computed 10 invariants in 10 ms
[2024-06-03 00:32:53] [INFO ] State equation strengthened by 90 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) 155/160 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/160 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 17/177 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/177 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 592/769 variables, 177/187 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/769 variables, 90/277 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/769 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 6/775 variables, 6/283 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/775 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 0/775 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 775/775 variables, and 283 constraints, problems are : Problem set: 0 solved, 3 unsolved in 336 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 183/183 constraints, ReadFeed: 90/90 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 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) 155/160 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/160 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 17/177 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/177 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 592/769 variables, 177/187 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/769 variables, 90/277 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/769 variables, 3/280 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/769 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 6/775 variables, 6/286 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/775 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 0/775 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 775/775 variables, and 286 constraints, problems are : Problem set: 0 solved, 3 unsolved in 446 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 183/183 constraints, ReadFeed: 90/90 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 808ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 214 ms.
Support contains 5 out of 183 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 183/183 places, 627/627 transitions.
Graph (trivial) has 32 edges and 183 vertex of which 2 / 183 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 41 transitions
Reduce isomorphic transitions removed 43 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 182 transition count 581
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 7 place count 179 transition count 581
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 7 place count 179 transition count 580
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 9 place count 178 transition count 580
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 11 place count 176 transition count 537
Iterating global reduction 2 with 2 rules applied. Total rules applied 13 place count 176 transition count 537
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 2 with 2 rules applied. Total rules applied 15 place count 175 transition count 536
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 16 place count 174 transition count 533
Iterating global reduction 2 with 1 rules applied. Total rules applied 17 place count 174 transition count 533
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 21 place count 174 transition count 529
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -17
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 29 place count 170 transition count 546
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 3 with 9 rules applied. Total rules applied 38 place count 170 transition count 537
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 39 place count 170 transition count 536
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 40 place count 169 transition count 536
Drop transitions (Redundant composition of simpler transitions.) removed 60 transitions
Redundant transition composition rules discarded 60 transitions
Iterating global reduction 4 with 60 rules applied. Total rules applied 100 place count 169 transition count 476
Applied a total of 100 rules in 53 ms. Remains 169 /183 variables (removed 14) and now considering 476/627 (removed 151) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 53 ms. Remains : 169/183 places, 476/627 transitions.
RANDOM walk for 40000 steps (1440 resets) in 190 ms. (209 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (293 resets) in 70 ms. (563 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40001 steps (97 resets) in 85 ms. (465 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (78 resets) in 55 ms. (714 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 1036173 steps, run timeout after 3001 ms. (steps per millisecond=345 ) properties seen :2 out of 3
Probabilistic random walk after 1036173 steps, saw 286365 distinct states, run finished after 3004 ms. (steps per millisecond=344 ) properties seen :2
[2024-06-03 00:32:57] [INFO ] Flow matrix only has 457 transitions (discarded 19 similar events)
// Phase 1: matrix 457 rows 169 cols
[2024-06-03 00:32:57] [INFO ] Computed 10 invariants in 6 ms
[2024-06-03 00:32:57] [INFO ] State equation strengthened by 88 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) 55/57 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 106/163 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/163 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 457/620 variables, 163/173 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/620 variables, 88/261 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/620 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 6/626 variables, 6/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/626 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/626 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 626/626 variables, and 267 constraints, problems are : Problem set: 0 solved, 1 unsolved in 192 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 169/169 constraints, ReadFeed: 88/88 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 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) 55/57 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 106/163 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/163 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 457/620 variables, 163/173 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/620 variables, 88/261 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/620 variables, 1/262 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/620 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 6/626 variables, 6/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/626 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/626 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 626/626 variables, and 268 constraints, problems are : Problem set: 0 solved, 1 unsolved in 224 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 169/169 constraints, ReadFeed: 88/88 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 432ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 1768 steps, including 179 resets, run visited all 1 properties in 8 ms. (steps per millisecond=221 )
Parikh walk visited 1 properties in 12 ms.
Computed a total of 69 stabilizing places and 75 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(G(p0)))'
Support contains 1 out of 434 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 434/434 places, 771/771 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 424 transition count 731
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 424 transition count 731
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 23 place count 421 transition count 728
Iterating global reduction 0 with 3 rules applied. Total rules applied 26 place count 421 transition count 728
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 27 place count 421 transition count 727
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 28 place count 420 transition count 726
Iterating global reduction 1 with 1 rules applied. Total rules applied 29 place count 420 transition count 726
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 30 place count 419 transition count 725
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 419 transition count 725
Applied a total of 31 rules in 22 ms. Remains 419 /434 variables (removed 15) and now considering 725/771 (removed 46) transitions.
// Phase 1: matrix 725 rows 419 cols
[2024-06-03 00:32:58] [INFO ] Computed 10 invariants in 8 ms
[2024-06-03 00:32:58] [INFO ] Implicit Places using invariants in 148 ms returned []
[2024-06-03 00:32:58] [INFO ] Invariant cache hit.
[2024-06-03 00:32:58] [INFO ] Implicit Places using invariants and state equation in 412 ms returned []
Implicit Place search using SMT with State Equation took 565 ms to find 0 implicit places.
Running 724 sub problems to find dead transitions.
[2024-06-03 00:32:58] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/418 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 724 unsolved
At refinement iteration 1 (OVERLAPS) 1/419 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 724 unsolved
[2024-06-03 00:33:08] [INFO ] Deduced a trap composed of 73 places in 60 ms of which 1 ms to minimize.
[2024-06-03 00:33:09] [INFO ] Deduced a trap composed of 86 places in 57 ms of which 1 ms to minimize.
[2024-06-03 00:33:09] [INFO ] Deduced a trap composed of 75 places in 46 ms of which 1 ms to minimize.
[2024-06-03 00:33:09] [INFO ] Deduced a trap composed of 29 places in 42 ms of which 0 ms to minimize.
[2024-06-03 00:33:09] [INFO ] Deduced a trap composed of 73 places in 47 ms of which 1 ms to minimize.
[2024-06-03 00:33:10] [INFO ] Deduced a trap composed of 86 places in 51 ms of which 1 ms to minimize.
[2024-06-03 00:33:11] [INFO ] Deduced a trap composed of 86 places in 64 ms of which 1 ms to minimize.
[2024-06-03 00:33:11] [INFO ] Deduced a trap composed of 54 places in 108 ms of which 1 ms to minimize.
[2024-06-03 00:33:12] [INFO ] Deduced a trap composed of 73 places in 116 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/419 variables, 9/19 constraints. Problems are: Problem set: 0 solved, 724 unsolved
[2024-06-03 00:33:18] [INFO ] Deduced a trap composed of 55 places in 121 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/419 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 724 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 419/1144 variables, and 20 constraints, problems are : Problem set: 0 solved, 724 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 0/419 constraints, PredecessorRefiner: 724/724 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 724 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/418 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 724 unsolved
At refinement iteration 1 (OVERLAPS) 1/419 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 724 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/419 variables, 10/20 constraints. Problems are: Problem set: 0 solved, 724 unsolved
[2024-06-03 00:33:34] [INFO ] Deduced a trap composed of 28 places in 43 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/419 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 724 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/419 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 724 unsolved
At refinement iteration 5 (OVERLAPS) 725/1144 variables, 419/440 constraints. Problems are: Problem set: 0 solved, 724 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1144 variables, 724/1164 constraints. Problems are: Problem set: 0 solved, 724 unsolved
[2024-06-03 00:33:55] [INFO ] Deduced a trap composed of 75 places in 127 ms of which 2 ms to minimize.
[2024-06-03 00:33:56] [INFO ] Deduced a trap composed of 223 places in 154 ms of which 2 ms to minimize.
[2024-06-03 00:33:58] [INFO ] Deduced a trap composed of 138 places in 147 ms of which 3 ms to minimize.
[2024-06-03 00:33:59] [INFO ] Deduced a trap composed of 75 places in 95 ms of which 4 ms to minimize.
SMT process timed out in 60361ms, After SMT, problems are : Problem set: 0 solved, 724 unsolved
Search for dead transitions found 0 dead transitions in 60368ms
Starting structural reductions in LTL mode, iteration 1 : 419/434 places, 725/771 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60958 ms. Remains : 419/434 places, 725/771 transitions.
Stuttering acceptance computed with spot in 220 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : FireWire-PT-19-LTLFireability-00
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 2 ms.
FORMULA FireWire-PT-19-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-19-LTLFireability-00 finished in 61242 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(X((p0&&(p1 U (p2||G(p1)))))))'
Support contains 5 out of 434 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 434/434 places, 771/771 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 423 transition count 730
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 423 transition count 730
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 25 place count 420 transition count 727
Iterating global reduction 0 with 3 rules applied. Total rules applied 28 place count 420 transition count 727
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 29 place count 420 transition count 726
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 30 place count 419 transition count 725
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 419 transition count 725
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 32 place count 418 transition count 724
Iterating global reduction 1 with 1 rules applied. Total rules applied 33 place count 418 transition count 724
Applied a total of 33 rules in 29 ms. Remains 418 /434 variables (removed 16) and now considering 724/771 (removed 47) transitions.
// Phase 1: matrix 724 rows 418 cols
[2024-06-03 00:33:59] [INFO ] Computed 10 invariants in 7 ms
[2024-06-03 00:33:59] [INFO ] Implicit Places using invariants in 138 ms returned []
[2024-06-03 00:33:59] [INFO ] Invariant cache hit.
[2024-06-03 00:34:00] [INFO ] Implicit Places using invariants and state equation in 362 ms returned []
Implicit Place search using SMT with State Equation took 506 ms to find 0 implicit places.
Running 723 sub problems to find dead transitions.
[2024-06-03 00:34:00] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/417 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 723 unsolved
At refinement iteration 1 (OVERLAPS) 1/418 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 723 unsolved
[2024-06-03 00:34:10] [INFO ] Deduced a trap composed of 85 places in 51 ms of which 1 ms to minimize.
[2024-06-03 00:34:11] [INFO ] Deduced a trap composed of 86 places in 51 ms of which 1 ms to minimize.
[2024-06-03 00:34:12] [INFO ] Deduced a trap composed of 86 places in 48 ms of which 1 ms to minimize.
[2024-06-03 00:34:12] [INFO ] Deduced a trap composed of 54 places in 108 ms of which 1 ms to minimize.
[2024-06-03 00:34:12] [INFO ] Deduced a trap composed of 55 places in 119 ms of which 3 ms to minimize.
[2024-06-03 00:34:12] [INFO ] Deduced a trap composed of 73 places in 109 ms of which 2 ms to minimize.
[2024-06-03 00:34:16] [INFO ] Deduced a trap composed of 72 places in 48 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/418 variables, 7/17 constraints. Problems are: Problem set: 0 solved, 723 unsolved
[2024-06-03 00:34:18] [INFO ] Deduced a trap composed of 75 places in 51 ms of which 1 ms to minimize.
[2024-06-03 00:34:18] [INFO ] Deduced a trap composed of 29 places in 43 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/418 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 723 unsolved
[2024-06-03 00:34:29] [INFO ] Deduced a trap composed of 73 places in 48 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 418/1142 variables, and 20 constraints, problems are : Problem set: 0 solved, 723 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 0/418 constraints, PredecessorRefiner: 723/723 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 723 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/417 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 723 unsolved
At refinement iteration 1 (OVERLAPS) 1/418 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 723 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/418 variables, 10/20 constraints. Problems are: Problem set: 0 solved, 723 unsolved
[2024-06-03 00:34:37] [INFO ] Deduced a trap composed of 29 places in 49 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/418 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 723 unsolved
[2024-06-03 00:34:42] [INFO ] Deduced a trap composed of 28 places in 33 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/418 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 723 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/418 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 723 unsolved
At refinement iteration 6 (OVERLAPS) 724/1142 variables, 418/440 constraints. Problems are: Problem set: 0 solved, 723 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1142 variables, 723/1163 constraints. Problems are: Problem set: 0 solved, 723 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1142/1142 variables, and 1163 constraints, problems are : Problem set: 0 solved, 723 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 418/418 constraints, PredecessorRefiner: 723/723 constraints, Known Traps: 12/12 constraints]
After SMT, in 60379ms problems are : Problem set: 0 solved, 723 unsolved
Search for dead transitions found 0 dead transitions in 60387ms
Starting structural reductions in LTL mode, iteration 1 : 418/434 places, 724/771 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60926 ms. Remains : 418/434 places, 724/771 transitions.
Stuttering acceptance computed with spot in 216 ms :[true, (AND (NOT p2) (NOT p1)), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : FireWire-PT-19-LTLFireability-01
Product exploration explored 100000 steps with 33333 reset in 226 ms.
Product exploration explored 100000 steps with 33333 reset in 175 ms.
Computed a total of 63 stabilizing places and 69 stable transitions
Computed a total of 63 stabilizing places and 69 stable transitions
Knowledge obtained : [(AND p2 p1 p0), (X (X p2)), (X (X (NOT (OR (NOT p0) (AND (NOT p2) (NOT p1)))))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 6 factoid took 20 ms. Reduced automaton from 5 states, 7 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FireWire-PT-19-LTLFireability-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FireWire-PT-19-LTLFireability-01 finished in 61605 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((X(X(X(X(X(F(p1))))))&&p0))))'
Support contains 4 out of 434 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 434/434 places, 771/771 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 423 transition count 730
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 423 transition count 730
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 25 place count 420 transition count 727
Iterating global reduction 0 with 3 rules applied. Total rules applied 28 place count 420 transition count 727
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 29 place count 420 transition count 726
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 30 place count 419 transition count 725
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 419 transition count 725
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 32 place count 418 transition count 724
Iterating global reduction 1 with 1 rules applied. Total rules applied 33 place count 418 transition count 724
Applied a total of 33 rules in 22 ms. Remains 418 /434 variables (removed 16) and now considering 724/771 (removed 47) transitions.
[2024-06-03 00:35:01] [INFO ] Invariant cache hit.
[2024-06-03 00:35:01] [INFO ] Implicit Places using invariants in 127 ms returned []
[2024-06-03 00:35:01] [INFO ] Invariant cache hit.
[2024-06-03 00:35:01] [INFO ] Implicit Places using invariants and state equation in 348 ms returned []
Implicit Place search using SMT with State Equation took 481 ms to find 0 implicit places.
Running 723 sub problems to find dead transitions.
[2024-06-03 00:35:01] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/417 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 723 unsolved
At refinement iteration 1 (OVERLAPS) 1/418 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 723 unsolved
[2024-06-03 00:35:11] [INFO ] Deduced a trap composed of 85 places in 55 ms of which 1 ms to minimize.
[2024-06-03 00:35:12] [INFO ] Deduced a trap composed of 86 places in 53 ms of which 1 ms to minimize.
[2024-06-03 00:35:13] [INFO ] Deduced a trap composed of 86 places in 51 ms of which 1 ms to minimize.
[2024-06-03 00:35:13] [INFO ] Deduced a trap composed of 54 places in 110 ms of which 1 ms to minimize.
[2024-06-03 00:35:13] [INFO ] Deduced a trap composed of 55 places in 127 ms of which 2 ms to minimize.
[2024-06-03 00:35:14] [INFO ] Deduced a trap composed of 73 places in 123 ms of which 2 ms to minimize.
[2024-06-03 00:35:17] [INFO ] Deduced a trap composed of 72 places in 50 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/418 variables, 7/17 constraints. Problems are: Problem set: 0 solved, 723 unsolved
[2024-06-03 00:35:19] [INFO ] Deduced a trap composed of 75 places in 53 ms of which 1 ms to minimize.
[2024-06-03 00:35:19] [INFO ] Deduced a trap composed of 29 places in 41 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/418 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 723 unsolved
[2024-06-03 00:35:30] [INFO ] Deduced a trap composed of 73 places in 55 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 418/1142 variables, and 20 constraints, problems are : Problem set: 0 solved, 723 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 0/418 constraints, PredecessorRefiner: 723/723 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 723 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/417 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 723 unsolved
At refinement iteration 1 (OVERLAPS) 1/418 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 723 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/418 variables, 10/20 constraints. Problems are: Problem set: 0 solved, 723 unsolved
[2024-06-03 00:35:39] [INFO ] Deduced a trap composed of 29 places in 45 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/418 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 723 unsolved
[2024-06-03 00:35:44] [INFO ] Deduced a trap composed of 28 places in 33 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/418 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 723 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/418 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 723 unsolved
At refinement iteration 6 (OVERLAPS) 724/1142 variables, 418/440 constraints. Problems are: Problem set: 0 solved, 723 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1142 variables, 723/1163 constraints. Problems are: Problem set: 0 solved, 723 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1142/1142 variables, and 1163 constraints, problems are : Problem set: 0 solved, 723 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 418/418 constraints, PredecessorRefiner: 723/723 constraints, Known Traps: 12/12 constraints]
After SMT, in 60314ms problems are : Problem set: 0 solved, 723 unsolved
Search for dead transitions found 0 dead transitions in 60326ms
Starting structural reductions in LTL mode, iteration 1 : 418/434 places, 724/771 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60833 ms. Remains : 418/434 places, 724/771 transitions.
Stuttering acceptance computed with spot in 285 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Running random walk in product with property : FireWire-PT-19-LTLFireability-02
Product exploration explored 100000 steps with 0 reset in 109 ms.
Stack based approach found an accepted trace after 97 steps with 0 reset with depth 98 and stack size 98 in 1 ms.
FORMULA FireWire-PT-19-LTLFireability-02 FALSE TECHNIQUES STACK_TEST
Treatment of property FireWire-PT-19-LTLFireability-02 finished in 61252 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))&&(G(!p1)||(!p1&&F(p2)))))'
Support contains 4 out of 434 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 434/434 places, 771/771 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 425 transition count 761
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 425 transition count 761
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 21 place count 422 transition count 758
Iterating global reduction 0 with 3 rules applied. Total rules applied 24 place count 422 transition count 758
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 25 place count 422 transition count 757
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 26 place count 421 transition count 756
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 421 transition count 756
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 28 place count 420 transition count 755
Iterating global reduction 1 with 1 rules applied. Total rules applied 29 place count 420 transition count 755
Applied a total of 29 rules in 26 ms. Remains 420 /434 variables (removed 14) and now considering 755/771 (removed 16) transitions.
// Phase 1: matrix 755 rows 420 cols
[2024-06-03 00:36:02] [INFO ] Computed 10 invariants in 6 ms
[2024-06-03 00:36:02] [INFO ] Implicit Places using invariants in 139 ms returned []
[2024-06-03 00:36:02] [INFO ] Invariant cache hit.
[2024-06-03 00:36:03] [INFO ] Implicit Places using invariants and state equation in 426 ms returned []
Implicit Place search using SMT with State Equation took 578 ms to find 0 implicit places.
Running 754 sub problems to find dead transitions.
[2024-06-03 00:36:03] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/419 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 754 unsolved
At refinement iteration 1 (OVERLAPS) 1/420 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 754 unsolved
[2024-06-03 00:36:13] [INFO ] Deduced a trap composed of 74 places in 53 ms of which 1 ms to minimize.
[2024-06-03 00:36:13] [INFO ] Deduced a trap composed of 28 places in 37 ms of which 1 ms to minimize.
[2024-06-03 00:36:13] [INFO ] Deduced a trap composed of 72 places in 63 ms of which 0 ms to minimize.
[2024-06-03 00:36:13] [INFO ] Deduced a trap composed of 85 places in 52 ms of which 0 ms to minimize.
[2024-06-03 00:36:14] [INFO ] Deduced a trap composed of 87 places in 54 ms of which 2 ms to minimize.
[2024-06-03 00:36:15] [INFO ] Deduced a trap composed of 75 places in 48 ms of which 1 ms to minimize.
[2024-06-03 00:36:15] [INFO ] Deduced a trap composed of 29 places in 36 ms of which 1 ms to minimize.
[2024-06-03 00:36:15] [INFO ] Deduced a trap composed of 73 places in 41 ms of which 1 ms to minimize.
[2024-06-03 00:36:16] [INFO ] Deduced a trap composed of 86 places in 49 ms of which 1 ms to minimize.
[2024-06-03 00:36:16] [INFO ] Deduced a trap composed of 55 places in 111 ms of which 1 ms to minimize.
[2024-06-03 00:36:16] [INFO ] Deduced a trap composed of 74 places in 111 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/420 variables, 11/21 constraints. Problems are: Problem set: 0 solved, 754 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/420 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 754 unsolved
At refinement iteration 4 (OVERLAPS) 755/1175 variables, 420/441 constraints. Problems are: Problem set: 0 solved, 754 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1175/1175 variables, and 441 constraints, problems are : Problem set: 0 solved, 754 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 420/420 constraints, PredecessorRefiner: 754/754 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 754 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/419 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 754 unsolved
At refinement iteration 1 (OVERLAPS) 1/420 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 754 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/420 variables, 11/21 constraints. Problems are: Problem set: 0 solved, 754 unsolved
[2024-06-03 00:36:41] [INFO ] Deduced a trap composed of 56 places in 118 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/420 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 754 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/420 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 754 unsolved
At refinement iteration 5 (OVERLAPS) 755/1175 variables, 420/442 constraints. Problems are: Problem set: 0 solved, 754 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1175 variables, 754/1196 constraints. Problems are: Problem set: 0 solved, 754 unsolved
[2024-06-03 00:37:02] [INFO ] Deduced a trap composed of 218 places in 169 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1175/1175 variables, and 1197 constraints, problems are : Problem set: 0 solved, 754 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 420/420 constraints, PredecessorRefiner: 754/754 constraints, Known Traps: 13/13 constraints]
After SMT, in 60330ms problems are : Problem set: 0 solved, 754 unsolved
Search for dead transitions found 0 dead transitions in 60338ms
Starting structural reductions in LTL mode, iteration 1 : 420/434 places, 755/771 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60945 ms. Remains : 420/434 places, 755/771 transitions.
Stuttering acceptance computed with spot in 170 ms :[(OR (NOT p0) p1), true, (NOT p0), (AND (NOT p2) p1), (NOT p2)]
Running random walk in product with property : FireWire-PT-19-LTLFireability-04
Stuttering criterion allowed to conclude after 111 steps with 0 reset in 1 ms.
FORMULA FireWire-PT-19-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-19-LTLFireability-04 finished in 61147 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)))'
Support contains 1 out of 434 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 434/434 places, 771/771 transitions.
Graph (trivial) has 336 edges and 434 vertex of which 18 / 434 are part of one of the 3 SCC in 2 ms
Free SCC test removed 15 places
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 79 transitions
Trivial Post-agglo rules discarded 79 transitions
Performed 79 trivial Post agglomeration. Transition count delta: 79
Iterating post reduction 0 with 79 rules applied. Total rules applied 80 place count 418 transition count 675
Reduce places removed 79 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 84 rules applied. Total rules applied 164 place count 339 transition count 670
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 166 place count 337 transition count 670
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 40 Pre rules applied. Total rules applied 166 place count 337 transition count 630
Deduced a syphon composed of 40 places in 1 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 3 with 80 rules applied. Total rules applied 246 place count 297 transition count 630
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 251 place count 292 transition count 566
Iterating global reduction 3 with 5 rules applied. Total rules applied 256 place count 292 transition count 566
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 257 place count 292 transition count 565
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 257 place count 292 transition count 563
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 261 place count 290 transition count 563
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 262 place count 289 transition count 562
Iterating global reduction 4 with 1 rules applied. Total rules applied 263 place count 289 transition count 562
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 4 with 2 rules applied. Total rules applied 265 place count 289 transition count 560
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 266 place count 288 transition count 560
Performed 45 Post agglomeration using F-continuation condition.Transition count delta: 45
Deduced a syphon composed of 45 places in 0 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 6 with 90 rules applied. Total rules applied 356 place count 243 transition count 515
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: -148
Deduced a syphon composed of 48 places in 1 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 6 with 96 rules applied. Total rules applied 452 place count 195 transition count 663
Drop transitions (Redundant composition of simpler transitions.) removed 59 transitions
Redundant transition composition rules discarded 59 transitions
Iterating global reduction 6 with 59 rules applied. Total rules applied 511 place count 195 transition count 604
Applied a total of 511 rules in 102 ms. Remains 195 /434 variables (removed 239) and now considering 604/771 (removed 167) transitions.
[2024-06-03 00:37:03] [INFO ] Flow matrix only has 579 transitions (discarded 25 similar events)
// Phase 1: matrix 579 rows 195 cols
[2024-06-03 00:37:03] [INFO ] Computed 10 invariants in 4 ms
[2024-06-03 00:37:03] [INFO ] Implicit Places using invariants in 104 ms returned []
[2024-06-03 00:37:03] [INFO ] Flow matrix only has 579 transitions (discarded 25 similar events)
[2024-06-03 00:37:03] [INFO ] Invariant cache hit.
[2024-06-03 00:37:03] [INFO ] State equation strengthened by 68 read => feed constraints.
[2024-06-03 00:37:04] [INFO ] Implicit Places using invariants and state equation in 414 ms returned []
Implicit Place search using SMT with State Equation took 520 ms to find 0 implicit places.
[2024-06-03 00:37:04] [INFO ] Redundant transitions in 98 ms returned []
Running 576 sub problems to find dead transitions.
[2024-06-03 00:37:04] [INFO ] Flow matrix only has 579 transitions (discarded 25 similar events)
[2024-06-03 00:37:04] [INFO ] Invariant cache hit.
[2024-06-03 00:37:04] [INFO ] State equation strengthened by 68 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/194 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 576 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/194 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 576 unsolved
At refinement iteration 2 (OVERLAPS) 1/195 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 576 unsolved
[2024-06-03 00:37:09] [INFO ] Deduced a trap composed of 54 places in 104 ms of which 2 ms to minimize.
[2024-06-03 00:37:09] [INFO ] Deduced a trap composed of 40 places in 40 ms of which 0 ms to minimize.
[2024-06-03 00:37:09] [INFO ] Deduced a trap composed of 33 places in 109 ms of which 2 ms to minimize.
[2024-06-03 00:37:09] [INFO ] Deduced a trap composed of 42 places in 104 ms of which 2 ms to minimize.
[2024-06-03 00:37:10] [INFO ] Deduced a trap composed of 42 places in 42 ms of which 1 ms to minimize.
[2024-06-03 00:37:10] [INFO ] Deduced a trap composed of 40 places in 102 ms of which 2 ms to minimize.
[2024-06-03 00:37:10] [INFO ] Deduced a trap composed of 43 places in 45 ms of which 0 ms to minimize.
[2024-06-03 00:37:10] [INFO ] Deduced a trap composed of 41 places in 41 ms of which 0 ms to minimize.
[2024-06-03 00:37:10] [INFO ] Deduced a trap composed of 40 places in 110 ms of which 2 ms to minimize.
[2024-06-03 00:37:11] [INFO ] Deduced a trap composed of 40 places in 39 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/195 variables, 10/20 constraints. Problems are: Problem set: 0 solved, 576 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/195 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 576 unsolved
At refinement iteration 5 (OVERLAPS) 578/773 variables, 195/215 constraints. Problems are: Problem set: 0 solved, 576 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/773 variables, 68/283 constraints. Problems are: Problem set: 0 solved, 576 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/773 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 576 unsolved
[2024-06-03 00:37:27] [INFO ] Deduced a trap composed of 53 places in 92 ms of which 1 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/773 variables, 1/284 constraints. Problems are: Problem set: 0 solved, 576 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 773/774 variables, and 284 constraints, problems are : Problem set: 0 solved, 576 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 195/195 constraints, ReadFeed: 68/68 constraints, PredecessorRefiner: 576/576 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 576 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/194 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 576 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/194 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 576 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/194 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 576 unsolved
At refinement iteration 3 (OVERLAPS) 1/195 variables, 9/14 constraints. Problems are: Problem set: 0 solved, 576 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/195 variables, 7/21 constraints. Problems are: Problem set: 0 solved, 576 unsolved
[2024-06-03 00:37:38] [INFO ] Deduced a trap composed of 42 places in 99 ms of which 2 ms to minimize.
[2024-06-03 00:37:38] [INFO ] Deduced a trap composed of 40 places in 89 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/195 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 576 unsolved
[2024-06-03 00:37:41] [INFO ] Deduced a trap composed of 26 places in 102 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/195 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 576 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/195 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 576 unsolved
At refinement iteration 8 (OVERLAPS) 578/773 variables, 195/219 constraints. Problems are: Problem set: 0 solved, 576 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/773 variables, 68/287 constraints. Problems are: Problem set: 0 solved, 576 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/773 variables, 576/863 constraints. Problems are: Problem set: 0 solved, 576 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/773 variables, 0/863 constraints. Problems are: Problem set: 0 solved, 576 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 773/774 variables, and 863 constraints, problems are : Problem set: 0 solved, 576 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 195/195 constraints, ReadFeed: 68/68 constraints, PredecessorRefiner: 576/576 constraints, Known Traps: 14/14 constraints]
After SMT, in 60627ms problems are : Problem set: 0 solved, 576 unsolved
Search for dead transitions found 0 dead transitions in 60633ms
Starting structural reductions in SI_LTL mode, iteration 1 : 195/434 places, 604/771 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61362 ms. Remains : 195/434 places, 604/771 transitions.
Stuttering acceptance computed with spot in 46 ms :[(NOT p0)]
Running random walk in product with property : FireWire-PT-19-LTLFireability-06
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA FireWire-PT-19-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-19-LTLFireability-06 finished in 61424 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((X((F(p0)&&F(G(p1))))&&(p2||G(p3)))))'
Support contains 5 out of 434 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 434/434 places, 771/771 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 423 transition count 730
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 423 transition count 730
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 25 place count 420 transition count 727
Iterating global reduction 0 with 3 rules applied. Total rules applied 28 place count 420 transition count 727
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 29 place count 420 transition count 726
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 30 place count 419 transition count 725
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 419 transition count 725
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 32 place count 418 transition count 724
Iterating global reduction 1 with 1 rules applied. Total rules applied 33 place count 418 transition count 724
Applied a total of 33 rules in 40 ms. Remains 418 /434 variables (removed 16) and now considering 724/771 (removed 47) transitions.
// Phase 1: matrix 724 rows 418 cols
[2024-06-03 00:38:05] [INFO ] Computed 10 invariants in 6 ms
[2024-06-03 00:38:05] [INFO ] Implicit Places using invariants in 159 ms returned []
[2024-06-03 00:38:05] [INFO ] Invariant cache hit.
[2024-06-03 00:38:05] [INFO ] Implicit Places using invariants and state equation in 400 ms returned []
Implicit Place search using SMT with State Equation took 561 ms to find 0 implicit places.
Running 723 sub problems to find dead transitions.
[2024-06-03 00:38:05] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/417 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 723 unsolved
At refinement iteration 1 (OVERLAPS) 1/418 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 723 unsolved
[2024-06-03 00:38:15] [INFO ] Deduced a trap composed of 85 places in 52 ms of which 0 ms to minimize.
[2024-06-03 00:38:16] [INFO ] Deduced a trap composed of 86 places in 44 ms of which 1 ms to minimize.
[2024-06-03 00:38:17] [INFO ] Deduced a trap composed of 86 places in 45 ms of which 1 ms to minimize.
[2024-06-03 00:38:17] [INFO ] Deduced a trap composed of 54 places in 105 ms of which 2 ms to minimize.
[2024-06-03 00:38:17] [INFO ] Deduced a trap composed of 55 places in 115 ms of which 2 ms to minimize.
[2024-06-03 00:38:18] [INFO ] Deduced a trap composed of 73 places in 116 ms of which 2 ms to minimize.
[2024-06-03 00:38:21] [INFO ] Deduced a trap composed of 72 places in 52 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/418 variables, 7/17 constraints. Problems are: Problem set: 0 solved, 723 unsolved
[2024-06-03 00:38:23] [INFO ] Deduced a trap composed of 75 places in 45 ms of which 1 ms to minimize.
[2024-06-03 00:38:23] [INFO ] Deduced a trap composed of 29 places in 40 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/418 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 723 unsolved
[2024-06-03 00:38:34] [INFO ] Deduced a trap composed of 73 places in 49 ms of which 1 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 418/1142 variables, and 20 constraints, problems are : Problem set: 0 solved, 723 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 0/418 constraints, PredecessorRefiner: 723/723 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 723 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/417 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 723 unsolved
At refinement iteration 1 (OVERLAPS) 1/418 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 723 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/418 variables, 10/20 constraints. Problems are: Problem set: 0 solved, 723 unsolved
[2024-06-03 00:38:42] [INFO ] Deduced a trap composed of 29 places in 44 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/418 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 723 unsolved
[2024-06-03 00:38:47] [INFO ] Deduced a trap composed of 28 places in 32 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/418 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 723 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/418 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 723 unsolved
At refinement iteration 6 (OVERLAPS) 724/1142 variables, 418/440 constraints. Problems are: Problem set: 0 solved, 723 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1142 variables, 723/1163 constraints. Problems are: Problem set: 0 solved, 723 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1142/1142 variables, and 1163 constraints, problems are : Problem set: 0 solved, 723 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 418/418 constraints, PredecessorRefiner: 723/723 constraints, Known Traps: 12/12 constraints]
After SMT, in 60297ms problems are : Problem set: 0 solved, 723 unsolved
Search for dead transitions found 0 dead transitions in 60304ms
Starting structural reductions in LTL mode, iteration 1 : 418/434 places, 724/771 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60907 ms. Remains : 418/434 places, 724/771 transitions.
Stuttering acceptance computed with spot in 267 ms :[(OR (NOT p0) (NOT p1) (AND (NOT p2) (NOT p3))), (OR (NOT p0) (NOT p1) (AND (NOT p2) (NOT p3))), true, (OR (NOT p0) (NOT p1)), (NOT p3), (NOT p0), (NOT p1)]
Running random walk in product with property : FireWire-PT-19-LTLFireability-07
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 2 ms.
FORMULA FireWire-PT-19-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-19-LTLFireability-07 finished in 61208 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((p0||(F(p0)&&(p1||F(p2))))))'
Support contains 4 out of 434 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 434/434 places, 771/771 transitions.
Graph (trivial) has 330 edges and 434 vertex of which 18 / 434 are part of one of the 3 SCC in 1 ms
Free SCC test removed 15 places
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 75 transitions
Trivial Post-agglo rules discarded 75 transitions
Performed 75 trivial Post agglomeration. Transition count delta: 75
Iterating post reduction 0 with 75 rules applied. Total rules applied 76 place count 418 transition count 679
Reduce places removed 75 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 80 rules applied. Total rules applied 156 place count 343 transition count 674
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 159 place count 341 transition count 673
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 160 place count 340 transition count 673
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 40 Pre rules applied. Total rules applied 160 place count 340 transition count 633
Deduced a syphon composed of 40 places in 1 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 4 with 80 rules applied. Total rules applied 240 place count 300 transition count 633
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 244 place count 296 transition count 599
Iterating global reduction 4 with 4 rules applied. Total rules applied 248 place count 296 transition count 599
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 248 place count 296 transition count 597
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 252 place count 294 transition count 597
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 253 place count 293 transition count 596
Iterating global reduction 4 with 1 rules applied. Total rules applied 254 place count 293 transition count 596
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 4 with 2 rules applied. Total rules applied 256 place count 293 transition count 594
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 257 place count 292 transition count 594
Performed 44 Post agglomeration using F-continuation condition.Transition count delta: 44
Deduced a syphon composed of 44 places in 0 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 6 with 88 rules applied. Total rules applied 345 place count 248 transition count 550
Performed 47 Post agglomeration using F-continuation condition.Transition count delta: -189
Deduced a syphon composed of 47 places in 0 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 6 with 94 rules applied. Total rules applied 439 place count 201 transition count 739
Drop transitions (Redundant composition of simpler transitions.) removed 84 transitions
Redundant transition composition rules discarded 84 transitions
Iterating global reduction 6 with 84 rules applied. Total rules applied 523 place count 201 transition count 655
Applied a total of 523 rules in 68 ms. Remains 201 /434 variables (removed 233) and now considering 655/771 (removed 116) transitions.
[2024-06-03 00:39:06] [INFO ] Flow matrix only has 624 transitions (discarded 31 similar events)
// Phase 1: matrix 624 rows 201 cols
[2024-06-03 00:39:06] [INFO ] Computed 10 invariants in 2 ms
[2024-06-03 00:39:06] [INFO ] Implicit Places using invariants in 113 ms returned []
[2024-06-03 00:39:06] [INFO ] Flow matrix only has 624 transitions (discarded 31 similar events)
[2024-06-03 00:39:06] [INFO ] Invariant cache hit.
[2024-06-03 00:39:06] [INFO ] State equation strengthened by 69 read => feed constraints.
[2024-06-03 00:39:06] [INFO ] Implicit Places using invariants and state equation in 473 ms returned []
Implicit Place search using SMT with State Equation took 589 ms to find 0 implicit places.
[2024-06-03 00:39:06] [INFO ] Redundant transitions in 66 ms returned []
Running 627 sub problems to find dead transitions.
[2024-06-03 00:39:06] [INFO ] Flow matrix only has 624 transitions (discarded 31 similar events)
[2024-06-03 00:39:06] [INFO ] Invariant cache hit.
[2024-06-03 00:39:06] [INFO ] State equation strengthened by 69 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/200 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 627 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/200 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 627 unsolved
At refinement iteration 2 (OVERLAPS) 1/201 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 627 unsolved
[2024-06-03 00:39:12] [INFO ] Deduced a trap composed of 56 places in 110 ms of which 1 ms to minimize.
[2024-06-03 00:39:12] [INFO ] Deduced a trap composed of 53 places in 105 ms of which 2 ms to minimize.
[2024-06-03 00:39:12] [INFO ] Deduced a trap composed of 40 places in 39 ms of which 1 ms to minimize.
[2024-06-03 00:39:12] [INFO ] Deduced a trap composed of 72 places in 113 ms of which 1 ms to minimize.
[2024-06-03 00:39:13] [INFO ] Deduced a trap composed of 70 places in 110 ms of which 1 ms to minimize.
[2024-06-03 00:39:13] [INFO ] Deduced a trap composed of 43 places in 118 ms of which 1 ms to minimize.
[2024-06-03 00:39:13] [INFO ] Deduced a trap composed of 44 places in 45 ms of which 0 ms to minimize.
[2024-06-03 00:39:13] [INFO ] Deduced a trap composed of 37 places in 116 ms of which 1 ms to minimize.
[2024-06-03 00:39:13] [INFO ] Deduced a trap composed of 42 places in 109 ms of which 2 ms to minimize.
[2024-06-03 00:39:13] [INFO ] Deduced a trap composed of 35 places in 106 ms of which 1 ms to minimize.
[2024-06-03 00:39:14] [INFO ] Deduced a trap composed of 28 places in 113 ms of which 3 ms to minimize.
[2024-06-03 00:39:14] [INFO ] Deduced a trap composed of 42 places in 110 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/201 variables, 12/22 constraints. Problems are: Problem set: 0 solved, 627 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/201 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 627 unsolved
At refinement iteration 5 (OVERLAPS) 623/824 variables, 201/223 constraints. Problems are: Problem set: 0 solved, 627 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/824 variables, 69/292 constraints. Problems are: Problem set: 0 solved, 627 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/824 variables, 0/292 constraints. Problems are: Problem set: 0 solved, 627 unsolved
At refinement iteration 8 (OVERLAPS) 0/824 variables, 0/292 constraints. Problems are: Problem set: 0 solved, 627 unsolved
No progress, stopping.
After SMT solving in domain Real declared 824/825 variables, and 292 constraints, problems are : Problem set: 0 solved, 627 unsolved in 28649 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 201/201 constraints, ReadFeed: 69/69 constraints, PredecessorRefiner: 627/627 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 627 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/200 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 627 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/200 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 627 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/200 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 627 unsolved
At refinement iteration 3 (OVERLAPS) 1/201 variables, 9/16 constraints. Problems are: Problem set: 0 solved, 627 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/201 variables, 6/22 constraints. Problems are: Problem set: 0 solved, 627 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/201 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 627 unsolved
At refinement iteration 6 (OVERLAPS) 623/824 variables, 201/223 constraints. Problems are: Problem set: 0 solved, 627 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/824 variables, 69/292 constraints. Problems are: Problem set: 0 solved, 627 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/824 variables, 627/919 constraints. Problems are: Problem set: 0 solved, 627 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/824 variables, 0/919 constraints. Problems are: Problem set: 0 solved, 627 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 824/825 variables, and 919 constraints, problems are : Problem set: 0 solved, 627 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 201/201 constraints, ReadFeed: 69/69 constraints, PredecessorRefiner: 627/627 constraints, Known Traps: 12/12 constraints]
After SMT, in 59294ms problems are : Problem set: 0 solved, 627 unsolved
Search for dead transitions found 0 dead transitions in 59301ms
Starting structural reductions in SI_LTL mode, iteration 1 : 201/434 places, 655/771 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 60039 ms. Remains : 201/434 places, 655/771 transitions.
Stuttering acceptance computed with spot in 133 ms :[(NOT p0), (NOT p0), (NOT p2)]
Running random walk in product with property : FireWire-PT-19-LTLFireability-08
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA FireWire-PT-19-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-19-LTLFireability-08 finished in 60190 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) U p1)) U p2) U G(!p3)))'
Support contains 5 out of 434 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 434/434 places, 771/771 transitions.
Graph (trivial) has 337 edges and 434 vertex of which 18 / 434 are part of one of the 3 SCC in 2 ms
Free SCC test removed 15 places
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 79 transitions
Trivial Post-agglo rules discarded 79 transitions
Performed 79 trivial Post agglomeration. Transition count delta: 79
Iterating post reduction 0 with 79 rules applied. Total rules applied 80 place count 418 transition count 675
Reduce places removed 79 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 84 rules applied. Total rules applied 164 place count 339 transition count 670
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 166 place count 337 transition count 670
Performed 41 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 41 Pre rules applied. Total rules applied 166 place count 337 transition count 629
Deduced a syphon composed of 41 places in 1 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 3 with 82 rules applied. Total rules applied 248 place count 296 transition count 629
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 251 place count 293 transition count 597
Iterating global reduction 3 with 3 rules applied. Total rules applied 254 place count 293 transition count 597
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 254 place count 293 transition count 595
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 258 place count 291 transition count 595
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 259 place count 290 transition count 594
Iterating global reduction 3 with 1 rules applied. Total rules applied 260 place count 290 transition count 594
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 262 place count 290 transition count 592
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 263 place count 289 transition count 592
Performed 45 Post agglomeration using F-continuation condition.Transition count delta: 45
Deduced a syphon composed of 45 places in 0 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 5 with 90 rules applied. Total rules applied 353 place count 244 transition count 547
Performed 47 Post agglomeration using F-continuation condition.Transition count delta: -193
Deduced a syphon composed of 47 places in 0 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 5 with 94 rules applied. Total rules applied 447 place count 197 transition count 740
Drop transitions (Redundant composition of simpler transitions.) removed 87 transitions
Redundant transition composition rules discarded 87 transitions
Iterating global reduction 5 with 87 rules applied. Total rules applied 534 place count 197 transition count 653
Applied a total of 534 rules in 54 ms. Remains 197 /434 variables (removed 237) and now considering 653/771 (removed 118) transitions.
[2024-06-03 00:40:06] [INFO ] Flow matrix only has 620 transitions (discarded 33 similar events)
// Phase 1: matrix 620 rows 197 cols
[2024-06-03 00:40:06] [INFO ] Computed 10 invariants in 7 ms
[2024-06-03 00:40:06] [INFO ] Implicit Places using invariants in 111 ms returned []
[2024-06-03 00:40:06] [INFO ] Flow matrix only has 620 transitions (discarded 33 similar events)
[2024-06-03 00:40:06] [INFO ] Invariant cache hit.
[2024-06-03 00:40:06] [INFO ] State equation strengthened by 69 read => feed constraints.
[2024-06-03 00:40:07] [INFO ] Implicit Places using invariants and state equation in 521 ms returned []
Implicit Place search using SMT with State Equation took 633 ms to find 0 implicit places.
[2024-06-03 00:40:07] [INFO ] Redundant transitions in 95 ms returned []
Running 625 sub problems to find dead transitions.
[2024-06-03 00:40:07] [INFO ] Flow matrix only has 620 transitions (discarded 33 similar events)
[2024-06-03 00:40:07] [INFO ] Invariant cache hit.
[2024-06-03 00:40:07] [INFO ] State equation strengthened by 69 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/196 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 625 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/196 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 625 unsolved
At refinement iteration 2 (OVERLAPS) 1/197 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 625 unsolved
[2024-06-03 00:40:12] [INFO ] Deduced a trap composed of 53 places in 99 ms of which 2 ms to minimize.
[2024-06-03 00:40:12] [INFO ] Deduced a trap composed of 76 places in 113 ms of which 1 ms to minimize.
[2024-06-03 00:40:12] [INFO ] Deduced a trap composed of 34 places in 107 ms of which 1 ms to minimize.
[2024-06-03 00:40:13] [INFO ] Deduced a trap composed of 27 places in 103 ms of which 1 ms to minimize.
[2024-06-03 00:40:13] [INFO ] Deduced a trap composed of 42 places in 98 ms of which 1 ms to minimize.
[2024-06-03 00:40:13] [INFO ] Deduced a trap composed of 27 places in 94 ms of which 1 ms to minimize.
[2024-06-03 00:40:13] [INFO ] Deduced a trap composed of 42 places in 39 ms of which 0 ms to minimize.
[2024-06-03 00:40:13] [INFO ] Deduced a trap composed of 43 places in 43 ms of which 1 ms to minimize.
[2024-06-03 00:40:13] [INFO ] Deduced a trap composed of 41 places in 36 ms of which 1 ms to minimize.
[2024-06-03 00:40:13] [INFO ] Deduced a trap composed of 40 places in 41 ms of which 0 ms to minimize.
[2024-06-03 00:40:14] [INFO ] Deduced a trap composed of 40 places in 37 ms of which 1 ms to minimize.
[2024-06-03 00:40:14] [INFO ] Deduced a trap composed of 27 places in 102 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/197 variables, 12/22 constraints. Problems are: Problem set: 0 solved, 625 unsolved
[2024-06-03 00:40:20] [INFO ] Deduced a trap composed of 23 places in 103 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/197 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 625 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/197 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 625 unsolved
At refinement iteration 6 (OVERLAPS) 619/816 variables, 197/220 constraints. Problems are: Problem set: 0 solved, 625 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/816 variables, 69/289 constraints. Problems are: Problem set: 0 solved, 625 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/816 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 625 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 816/817 variables, and 289 constraints, problems are : Problem set: 0 solved, 625 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 197/197 constraints, ReadFeed: 69/69 constraints, PredecessorRefiner: 625/625 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 0 solved, 625 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/196 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 625 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/196 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 625 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/196 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 625 unsolved
At refinement iteration 3 (OVERLAPS) 1/197 variables, 9/14 constraints. Problems are: Problem set: 0 solved, 625 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/197 variables, 9/23 constraints. Problems are: Problem set: 0 solved, 625 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/197 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 625 unsolved
At refinement iteration 6 (OVERLAPS) 619/816 variables, 197/220 constraints. Problems are: Problem set: 0 solved, 625 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/816 variables, 69/289 constraints. Problems are: Problem set: 0 solved, 625 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/816 variables, 625/914 constraints. Problems are: Problem set: 0 solved, 625 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/816 variables, 0/914 constraints. Problems are: Problem set: 0 solved, 625 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 816/817 variables, and 914 constraints, problems are : Problem set: 0 solved, 625 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 197/197 constraints, ReadFeed: 69/69 constraints, PredecessorRefiner: 625/625 constraints, Known Traps: 13/13 constraints]
After SMT, in 60701ms problems are : Problem set: 0 solved, 625 unsolved
Search for dead transitions found 0 dead transitions in 60707ms
Starting structural reductions in SI_LTL mode, iteration 1 : 197/434 places, 653/771 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61501 ms. Remains : 197/434 places, 653/771 transitions.
Stuttering acceptance computed with spot in 329 ms :[p3, (NOT p0), (NOT p1), (NOT p1), (NOT p2), (AND (NOT p0) p3 p1), (AND (NOT p1) p2 p3)]
Running random walk in product with property : FireWire-PT-19-LTLFireability-09
Product exploration explored 100000 steps with 40010 reset in 408 ms.
Product exploration explored 100000 steps with 40023 reset in 355 ms.
Computed a total of 7 stabilizing places and 39 stable transitions
Computed a total of 7 stabilizing places and 39 stable transitions
Knowledge obtained : [(AND (NOT p3) (NOT p2) (NOT p1) (NOT p0)), (X (NOT p2)), (X (AND (NOT p2) (NOT p1))), (X (AND (NOT p2) (NOT p1) (NOT p0))), (X (NOT (AND p3 p1 (NOT p0)))), (X (NOT (AND p3 p2))), (X (NOT (AND p3 (NOT p2) (NOT p1)))), (X (NOT (AND p3 p2 (NOT p1)))), (X (NOT p3)), (X (AND (NOT p3) (NOT p2))), (X (NOT (AND p3 (NOT p2)))), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p3) p1 (NOT p0)))), (X (NOT (AND (NOT p3) p2 (NOT p1) (NOT p0)))), (X (NOT (AND p3 (NOT p2) (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p3) p2))), (X (NOT (AND p3 p2 (NOT p1) (NOT p0)))), (X (AND (NOT p3) (NOT p2) (NOT p1) (NOT p0))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (AND (NOT p2) (NOT p1) (NOT p0)))), (X (X (NOT (AND p3 p1 (NOT p0))))), (X (X (NOT (AND p3 p2)))), (X (X (NOT (AND p3 (NOT p2) (NOT p1))))), (X (X (NOT (AND p3 p2 (NOT p1))))), (X (X (NOT p3))), (X (X (AND (NOT p3) (NOT p2)))), (X (X (NOT (AND p3 (NOT p2))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p3) p1 (NOT p0))))), (X (X (NOT (AND (NOT p3) p2 (NOT p1) (NOT p0))))), (X (X (NOT (AND p3 (NOT p2) (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p3) p2)))), (X (X (NOT (AND p3 p2 (NOT p1) (NOT p0))))), (X (X (AND (NOT p3) (NOT p2) (NOT p1) (NOT p0)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 39 factoid took 150 ms. Reduced automaton from 7 states, 25 edges and 4 AP (stutter insensitive) to 7 states, 25 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 296 ms :[p3, (NOT p0), (NOT p1), (NOT p1), (NOT p2), (AND (NOT p0) p3 p1), (AND (NOT p1) p2 p3)]
RANDOM walk for 40000 steps (2413 resets) in 1040 ms. (38 steps per ms) remains 15/19 properties
BEST_FIRST walk for 4004 steps (34 resets) in 31 ms. (125 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (33 resets) in 57 ms. (69 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (32 resets) in 32 ms. (121 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (35 resets) in 64 ms. (61 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (36 resets) in 30 ms. (129 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (35 resets) in 47 ms. (83 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (32 resets) in 63 ms. (62 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (35 resets) in 45 ms. (87 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (34 resets) in 24 ms. (160 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (31 resets) in 58 ms. (67 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (33 resets) in 8 ms. (444 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (36 resets) in 11 ms. (333 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (33 resets) in 8 ms. (444 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (35 resets) in 9 ms. (400 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (32 resets) in 10 ms. (364 steps per ms) remains 15/15 properties
[2024-06-03 00:41:10] [INFO ] Flow matrix only has 620 transitions (discarded 33 similar events)
[2024-06-03 00:41:10] [INFO ] Invariant cache hit.
[2024-06-03 00:41:10] [INFO ] State equation strengthened by 69 read => feed constraints.
Problem apf6 is UNSAT
Problem apf12 is UNSAT
Problem apf13 is UNSAT
Problem apf14 is UNSAT
Problem apf18 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 5 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 156/161 variables, 4/4 constraints. Problems are: Problem set: 5 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/161 variables, 0/4 constraints. Problems are: Problem set: 5 solved, 10 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 30/191 variables, 6/10 constraints. Problems are: Problem set: 5 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/191 variables, 0/10 constraints. Problems are: Problem set: 5 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 619/810 variables, 191/201 constraints. Problems are: Problem set: 5 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/810 variables, 69/270 constraints. Problems are: Problem set: 5 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/810 variables, 0/270 constraints. Problems are: Problem set: 5 solved, 10 unsolved
At refinement iteration 8 (OVERLAPS) 6/816 variables, 6/276 constraints. Problems are: Problem set: 5 solved, 10 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/816 variables, 0/276 constraints. Problems are: Problem set: 5 solved, 10 unsolved
At refinement iteration 10 (OVERLAPS) 0/816 variables, 0/276 constraints. Problems are: Problem set: 5 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 816/817 variables, and 276 constraints, problems are : Problem set: 5 solved, 10 unsolved in 594 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 197/197 constraints, ReadFeed: 69/69 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 5 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 5 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 156/161 variables, 4/4 constraints. Problems are: Problem set: 5 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/161 variables, 0/4 constraints. Problems are: Problem set: 5 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 30/191 variables, 6/10 constraints. Problems are: Problem set: 5 solved, 10 unsolved
[2024-06-03 00:41:10] [INFO ] Deduced a trap composed of 40 places in 39 ms of which 0 ms to minimize.
[2024-06-03 00:41:10] [INFO ] Deduced a trap composed of 41 places in 41 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/191 variables, 2/12 constraints. Problems are: Problem set: 5 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/191 variables, 0/12 constraints. Problems are: Problem set: 5 solved, 10 unsolved
At refinement iteration 6 (OVERLAPS) 619/810 variables, 191/203 constraints. Problems are: Problem set: 5 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/810 variables, 69/272 constraints. Problems are: Problem set: 5 solved, 10 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/810 variables, 10/282 constraints. Problems are: Problem set: 5 solved, 10 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/810 variables, 0/282 constraints. Problems are: Problem set: 5 solved, 10 unsolved
At refinement iteration 10 (OVERLAPS) 6/816 variables, 6/288 constraints. Problems are: Problem set: 5 solved, 10 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/816 variables, 0/288 constraints. Problems are: Problem set: 5 solved, 10 unsolved
At refinement iteration 12 (OVERLAPS) 0/816 variables, 0/288 constraints. Problems are: Problem set: 5 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Int declared 816/817 variables, and 288 constraints, problems are : Problem set: 5 solved, 10 unsolved in 1525 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 197/197 constraints, ReadFeed: 69/69 constraints, PredecessorRefiner: 10/15 constraints, Known Traps: 2/2 constraints]
After SMT, in 2172ms problems are : Problem set: 5 solved, 10 unsolved
Fused 10 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 1849 ms.
Support contains 5 out of 197 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 197/197 places, 653/653 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 197 transition count 650
Free-agglomeration rule applied 30 times.
Iterating global reduction 1 with 30 rules applied. Total rules applied 33 place count 197 transition count 620
Reduce places removed 30 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 39 rules applied. Total rules applied 72 place count 167 transition count 611
Drop transitions (Redundant composition of simpler transitions.) removed 85 transitions
Redundant transition composition rules discarded 85 transitions
Iterating global reduction 2 with 85 rules applied. Total rules applied 157 place count 167 transition count 526
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 2 with 6 rules applied. Total rules applied 163 place count 167 transition count 526
Applied a total of 163 rules in 34 ms. Remains 167 /197 variables (removed 30) and now considering 526/653 (removed 127) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34 ms. Remains : 167/197 places, 526/653 transitions.
RANDOM walk for 40000 steps (1624 resets) in 229 ms. (173 steps per ms) remains 3/10 properties
BEST_FIRST walk for 40004 steps (9 resets) in 64 ms. (615 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 75 ms. (526 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (91 resets) in 76 ms. (519 steps per ms) remains 3/3 properties
[2024-06-03 00:41:14] [INFO ] Flow matrix only has 466 transitions (discarded 60 similar events)
// Phase 1: matrix 466 rows 167 cols
[2024-06-03 00:41:14] [INFO ] Computed 10 invariants in 2 ms
[2024-06-03 00:41:14] [INFO ] State equation strengthened by 97 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) 135/140 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/140 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 21/161 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/161 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 466/627 variables, 161/171 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/627 variables, 97/268 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/627 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 6/633 variables, 6/274 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/633 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 0/633 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 633/633 variables, and 274 constraints, problems are : Problem set: 0 solved, 3 unsolved in 245 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 167/167 constraints, ReadFeed: 97/97 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 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) 135/140 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/140 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 21/161 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-03 00:41:14] [INFO ] Deduced a trap composed of 36 places in 37 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/161 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-03 00:41:14] [INFO ] Deduced a trap composed of 37 places in 32 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/161 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/161 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 466/627 variables, 161/173 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/627 variables, 97/270 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/627 variables, 3/273 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/627 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 6/633 variables, 6/279 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/633 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 0/633 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 633/633 variables, and 279 constraints, problems are : Problem set: 0 solved, 3 unsolved in 600 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 167/167 constraints, ReadFeed: 97/97 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 2/2 constraints]
After SMT, in 872ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 1350 ms.
Support contains 5 out of 167 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 167/167 places, 526/526 transitions.
Applied a total of 0 rules in 5 ms. Remains 167 /167 variables (removed 0) and now considering 526/526 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 167/167 places, 526/526 transitions.
RANDOM walk for 40000 steps (1619 resets) in 122 ms. (325 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 56 ms. (701 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 52 ms. (754 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (91 resets) in 46 ms. (851 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 481686 steps, run timeout after 3001 ms. (steps per millisecond=160 ) properties seen :0 out of 3
Probabilistic random walk after 481686 steps, saw 168269 distinct states, run finished after 3001 ms. (steps per millisecond=160 ) properties seen :0
[2024-06-03 00:41:19] [INFO ] Flow matrix only has 466 transitions (discarded 60 similar events)
[2024-06-03 00:41:19] [INFO ] Invariant cache hit.
[2024-06-03 00:41:19] [INFO ] State equation strengthened by 97 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) 135/140 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/140 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 21/161 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/161 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 466/627 variables, 161/171 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/627 variables, 97/268 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/627 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 6/633 variables, 6/274 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/633 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 0/633 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 633/633 variables, and 274 constraints, problems are : Problem set: 0 solved, 3 unsolved in 259 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 167/167 constraints, ReadFeed: 97/97 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 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) 135/140 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/140 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 21/161 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-03 00:41:19] [INFO ] Deduced a trap composed of 36 places in 34 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/161 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/161 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 466/627 variables, 161/172 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/627 variables, 97/269 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/627 variables, 3/272 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/627 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 6/633 variables, 6/278 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/633 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 0/633 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 633/633 variables, and 278 constraints, problems are : Problem set: 0 solved, 3 unsolved in 579 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 167/167 constraints, ReadFeed: 97/97 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 1/1 constraints]
After SMT, in 852ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 316 ms.
Support contains 5 out of 167 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 167/167 places, 526/526 transitions.
Applied a total of 0 rules in 6 ms. Remains 167 /167 variables (removed 0) and now considering 526/526 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 167/167 places, 526/526 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 167/167 places, 526/526 transitions.
Applied a total of 0 rules in 6 ms. Remains 167 /167 variables (removed 0) and now considering 526/526 (removed 0) transitions.
[2024-06-03 00:41:20] [INFO ] Flow matrix only has 466 transitions (discarded 60 similar events)
[2024-06-03 00:41:20] [INFO ] Invariant cache hit.
[2024-06-03 00:41:20] [INFO ] Implicit Places using invariants in 95 ms returned []
[2024-06-03 00:41:20] [INFO ] Flow matrix only has 466 transitions (discarded 60 similar events)
[2024-06-03 00:41:20] [INFO ] Invariant cache hit.
[2024-06-03 00:41:20] [INFO ] State equation strengthened by 97 read => feed constraints.
[2024-06-03 00:41:21] [INFO ] Implicit Places using invariants and state equation in 332 ms returned []
Implicit Place search using SMT with State Equation took 429 ms to find 0 implicit places.
[2024-06-03 00:41:21] [INFO ] Redundant transitions in 55 ms returned []
Running 499 sub problems to find dead transitions.
[2024-06-03 00:41:21] [INFO ] Flow matrix only has 466 transitions (discarded 60 similar events)
[2024-06-03 00:41:21] [INFO ] Invariant cache hit.
[2024-06-03 00:41:21] [INFO ] State equation strengthened by 97 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/166 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 499 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/166 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 499 unsolved
At refinement iteration 2 (OVERLAPS) 1/167 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 499 unsolved
[2024-06-03 00:41:25] [INFO ] Deduced a trap composed of 28 places in 85 ms of which 1 ms to minimize.
[2024-06-03 00:41:25] [INFO ] Deduced a trap composed of 25 places in 83 ms of which 1 ms to minimize.
[2024-06-03 00:41:25] [INFO ] Deduced a trap composed of 36 places in 40 ms of which 1 ms to minimize.
[2024-06-03 00:41:25] [INFO ] Deduced a trap composed of 37 places in 39 ms of which 1 ms to minimize.
[2024-06-03 00:41:25] [INFO ] Deduced a trap composed of 36 places in 38 ms of which 0 ms to minimize.
[2024-06-03 00:41:25] [INFO ] Deduced a trap composed of 95 places in 87 ms of which 1 ms to minimize.
[2024-06-03 00:41:25] [INFO ] Deduced a trap composed of 19 places in 98 ms of which 1 ms to minimize.
[2024-06-03 00:41:25] [INFO ] Deduced a trap composed of 19 places in 86 ms of which 1 ms to minimize.
[2024-06-03 00:41:26] [INFO ] Deduced a trap composed of 47 places in 95 ms of which 1 ms to minimize.
[2024-06-03 00:41:27] [INFO ] Deduced a trap composed of 126 places in 87 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/167 variables, 10/20 constraints. Problems are: Problem set: 0 solved, 499 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/167 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 499 unsolved
At refinement iteration 5 (OVERLAPS) 466/633 variables, 167/187 constraints. Problems are: Problem set: 0 solved, 499 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/633 variables, 97/284 constraints. Problems are: Problem set: 0 solved, 499 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/633 variables, 0/284 constraints. Problems are: Problem set: 0 solved, 499 unsolved
At refinement iteration 8 (OVERLAPS) 0/633 variables, 0/284 constraints. Problems are: Problem set: 0 solved, 499 unsolved
No progress, stopping.
After SMT solving in domain Real declared 633/633 variables, and 284 constraints, problems are : Problem set: 0 solved, 499 unsolved in 22975 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 167/167 constraints, ReadFeed: 97/97 constraints, PredecessorRefiner: 499/499 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 499 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/166 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 499 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/166 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 499 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/166 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 499 unsolved
At refinement iteration 3 (OVERLAPS) 1/167 variables, 9/13 constraints. Problems are: Problem set: 0 solved, 499 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/167 variables, 7/20 constraints. Problems are: Problem set: 0 solved, 499 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/167 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 499 unsolved
At refinement iteration 6 (OVERLAPS) 466/633 variables, 167/187 constraints. Problems are: Problem set: 0 solved, 499 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/633 variables, 97/284 constraints. Problems are: Problem set: 0 solved, 499 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/633 variables, 499/783 constraints. Problems are: Problem set: 0 solved, 499 unsolved
[2024-06-03 00:42:01] [INFO ] Deduced a trap composed of 5 places in 36 ms of which 1 ms to minimize.
[2024-06-03 00:42:01] [INFO ] Deduced a trap composed of 5 places in 34 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/633 variables, 2/785 constraints. Problems are: Problem set: 0 solved, 499 unsolved
[2024-06-03 00:42:14] [INFO ] Deduced a trap composed of 56 places in 85 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/633 variables, 1/786 constraints. Problems are: Problem set: 0 solved, 499 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 633/633 variables, and 786 constraints, problems are : Problem set: 0 solved, 499 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 167/167 constraints, ReadFeed: 97/97 constraints, PredecessorRefiner: 499/499 constraints, Known Traps: 13/13 constraints]
After SMT, in 53520ms problems are : Problem set: 0 solved, 499 unsolved
Search for dead transitions found 0 dead transitions in 53524ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 54019 ms. Remains : 167/167 places, 526/526 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 152 edges and 167 vertex of which 28 / 167 are part of one of the 4 SCC in 0 ms
Free SCC test removed 24 places
Drop transitions (Empty/Sink Transition effects.) removed 110 transitions
Ensure Unique test removed 52 transitions
Reduce isomorphic transitions removed 162 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 10 place count 134 transition count 352
Iterating global reduction 0 with 9 rules applied. Total rules applied 19 place count 134 transition count 352
Ensure Unique test removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Iterating post reduction 0 with 28 rules applied. Total rules applied 47 place count 134 transition count 324
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 49 place count 133 transition count 323
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 55 place count 130 transition count 326
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 64 place count 130 transition count 317
Drop transitions (Redundant composition of simpler transitions.) removed 22 transitions
Redundant transition composition rules discarded 22 transitions
Iterating global reduction 2 with 22 rules applied. Total rules applied 86 place count 130 transition count 295
Free-agglomeration rule applied 4 times.
Iterating global reduction 2 with 4 rules applied. Total rules applied 90 place count 130 transition count 291
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 94 place count 126 transition count 291
Partial Free-agglomeration rule applied 9 times.
Drop transitions (Partial Free agglomeration) removed 9 transitions
Iterating global reduction 3 with 9 rules applied. Total rules applied 103 place count 126 transition count 291
Applied a total of 103 rules in 26 ms. Remains 126 /167 variables (removed 41) and now considering 291/526 (removed 235) transitions.
Running SMT prover for 3 properties.
[2024-06-03 00:42:14] [INFO ] Flow matrix only has 287 transitions (discarded 4 similar events)
// Phase 1: matrix 287 rows 126 cols
[2024-06-03 00:42:14] [INFO ] Computed 10 invariants in 4 ms
[2024-06-03 00:42:14] [INFO ] [Real]Absence check using 10 positive place invariants in 2 ms returned sat
[2024-06-03 00:42:14] [INFO ] After 136ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-06-03 00:42:14] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2024-06-03 00:42:15] [INFO ] After 102ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-06-03 00:42:15] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-06-03 00:42:15] [INFO ] After 61ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :3
TRAPS : Iteration 0
[2024-06-03 00:42:15] [INFO ] After 136ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
[2024-06-03 00:42:15] [INFO ] After 445ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Over-approximation ignoring read arcs solved 0 properties in 630 ms.
Found 5 invariant AP formulas.
Knowledge obtained : [(AND (NOT p3) (NOT p2) (NOT p1) (NOT p0)), (X (NOT p2)), (X (AND (NOT p2) (NOT p1))), (X (AND (NOT p2) (NOT p1) (NOT p0))), (X (NOT (AND p3 p1 (NOT p0)))), (X (NOT (AND p3 p2))), (X (NOT (AND p3 (NOT p2) (NOT p1)))), (X (NOT (AND p3 p2 (NOT p1)))), (X (NOT p3)), (X (AND (NOT p3) (NOT p2))), (X (NOT (AND p3 (NOT p2)))), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p3) p1 (NOT p0)))), (X (NOT (AND (NOT p3) p2 (NOT p1) (NOT p0)))), (X (NOT (AND p3 (NOT p2) (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p3) p2))), (X (NOT (AND p3 p2 (NOT p1) (NOT p0)))), (X (AND (NOT p3) (NOT p2) (NOT p1) (NOT p0))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (AND (NOT p2) (NOT p1) (NOT p0)))), (X (X (NOT (AND p3 p1 (NOT p0))))), (X (X (NOT (AND p3 p2)))), (X (X (NOT (AND p3 (NOT p2) (NOT p1))))), (X (X (NOT (AND p3 p2 (NOT p1))))), (X (X (NOT p3))), (X (X (AND (NOT p3) (NOT p2)))), (X (X (NOT (AND p3 (NOT p2))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p3) p1 (NOT p0))))), (X (X (NOT (AND (NOT p3) p2 (NOT p1) (NOT p0))))), (X (X (NOT (AND p3 (NOT p2) (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p3) p2)))), (X (X (NOT (AND p3 p2 (NOT p1) (NOT p0))))), (X (X (AND (NOT p3) (NOT p2) (NOT p1) (NOT p0)))), (X (X (NOT p0))), (X (X (NOT p1))), (G (OR p1 (NOT p3) p2)), (G (OR p0 p1 (NOT p3) p2)), (G (OR p3 (NOT p2))), (G (OR p0 p1 p3 (NOT p2))), (G (OR p0 (NOT p1) p3))]
False Knowledge obtained : [(F (NOT (AND (NOT p3) (NOT p2)))), (F (NOT (AND (NOT p0) (NOT p1) (NOT p3) (NOT p2)))), (F (NOT (OR p1 (NOT p3) (NOT p2)))), (F p3), (F (NOT (OR p0 p1 (NOT p3) (NOT p2)))), (F p2), (F (NOT (AND (NOT p1) (NOT p2)))), (F p0), (F (NOT (OR (NOT p3) (NOT p2)))), (F (NOT (AND (NOT p0) (NOT p1)))), (F (NOT (AND (NOT p0) (NOT p1) (NOT p2))))]
Knowledge based reduction with 44 factoid took 622 ms. Reduced automaton from 7 states, 25 edges and 4 AP (stutter insensitive) to 7 states, 22 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 307 ms :[(OR p3 (AND (NOT p1) p2) (AND (NOT p0) p1)), (NOT p0), (NOT p1), (NOT p1), (OR (NOT p2) (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3))), (AND (NOT p0) p3 p1), (AND (NOT p1) p2 p3)]
Stuttering acceptance computed with spot in 285 ms :[(OR p3 (AND (NOT p1) p2) (AND (NOT p0) p1)), (NOT p0), (NOT p1), (NOT p1), (OR (NOT p2) (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3))), (AND (NOT p0) p3 p1), (AND (NOT p1) p2 p3)]
Support contains 5 out of 197 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 197/197 places, 653/653 transitions.
Applied a total of 0 rules in 8 ms. Remains 197 /197 variables (removed 0) and now considering 653/653 (removed 0) transitions.
[2024-06-03 00:42:16] [INFO ] Flow matrix only has 620 transitions (discarded 33 similar events)
// Phase 1: matrix 620 rows 197 cols
[2024-06-03 00:42:16] [INFO ] Computed 10 invariants in 2 ms
[2024-06-03 00:42:16] [INFO ] Implicit Places using invariants in 111 ms returned []
[2024-06-03 00:42:16] [INFO ] Flow matrix only has 620 transitions (discarded 33 similar events)
[2024-06-03 00:42:16] [INFO ] Invariant cache hit.
[2024-06-03 00:42:16] [INFO ] State equation strengthened by 69 read => feed constraints.
[2024-06-03 00:42:17] [INFO ] Implicit Places using invariants and state equation in 544 ms returned []
Implicit Place search using SMT with State Equation took 670 ms to find 0 implicit places.
[2024-06-03 00:42:17] [INFO ] Redundant transitions in 59 ms returned []
Running 625 sub problems to find dead transitions.
[2024-06-03 00:42:17] [INFO ] Flow matrix only has 620 transitions (discarded 33 similar events)
[2024-06-03 00:42:17] [INFO ] Invariant cache hit.
[2024-06-03 00:42:17] [INFO ] State equation strengthened by 69 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/196 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 625 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/196 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 625 unsolved
At refinement iteration 2 (OVERLAPS) 1/197 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 625 unsolved
[2024-06-03 00:42:22] [INFO ] Deduced a trap composed of 53 places in 96 ms of which 1 ms to minimize.
[2024-06-03 00:42:23] [INFO ] Deduced a trap composed of 76 places in 105 ms of which 1 ms to minimize.
[2024-06-03 00:42:23] [INFO ] Deduced a trap composed of 34 places in 111 ms of which 2 ms to minimize.
[2024-06-03 00:42:23] [INFO ] Deduced a trap composed of 27 places in 106 ms of which 1 ms to minimize.
[2024-06-03 00:42:23] [INFO ] Deduced a trap composed of 42 places in 99 ms of which 1 ms to minimize.
[2024-06-03 00:42:23] [INFO ] Deduced a trap composed of 27 places in 96 ms of which 1 ms to minimize.
[2024-06-03 00:42:23] [INFO ] Deduced a trap composed of 42 places in 40 ms of which 0 ms to minimize.
[2024-06-03 00:42:23] [INFO ] Deduced a trap composed of 43 places in 41 ms of which 1 ms to minimize.
[2024-06-03 00:42:23] [INFO ] Deduced a trap composed of 41 places in 33 ms of which 0 ms to minimize.
[2024-06-03 00:42:24] [INFO ] Deduced a trap composed of 40 places in 39 ms of which 0 ms to minimize.
[2024-06-03 00:42:24] [INFO ] Deduced a trap composed of 40 places in 36 ms of which 0 ms to minimize.
[2024-06-03 00:42:25] [INFO ] Deduced a trap composed of 27 places in 93 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/197 variables, 12/22 constraints. Problems are: Problem set: 0 solved, 625 unsolved
[2024-06-03 00:42:30] [INFO ] Deduced a trap composed of 23 places in 107 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/197 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 625 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/197 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 625 unsolved
At refinement iteration 6 (OVERLAPS) 619/816 variables, 197/220 constraints. Problems are: Problem set: 0 solved, 625 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/816 variables, 69/289 constraints. Problems are: Problem set: 0 solved, 625 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/816 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 625 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 816/817 variables, and 289 constraints, problems are : Problem set: 0 solved, 625 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 197/197 constraints, ReadFeed: 69/69 constraints, PredecessorRefiner: 625/625 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 0 solved, 625 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/196 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 625 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/196 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 625 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/196 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 625 unsolved
At refinement iteration 3 (OVERLAPS) 1/197 variables, 9/14 constraints. Problems are: Problem set: 0 solved, 625 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/197 variables, 9/23 constraints. Problems are: Problem set: 0 solved, 625 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/197 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 625 unsolved
At refinement iteration 6 (OVERLAPS) 619/816 variables, 197/220 constraints. Problems are: Problem set: 0 solved, 625 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/816 variables, 69/289 constraints. Problems are: Problem set: 0 solved, 625 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/816 variables, 625/914 constraints. Problems are: Problem set: 0 solved, 625 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/816 variables, 0/914 constraints. Problems are: Problem set: 0 solved, 625 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 816/817 variables, and 914 constraints, problems are : Problem set: 0 solved, 625 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 197/197 constraints, ReadFeed: 69/69 constraints, PredecessorRefiner: 625/625 constraints, Known Traps: 13/13 constraints]
After SMT, in 60693ms problems are : Problem set: 0 solved, 625 unsolved
Search for dead transitions found 0 dead transitions in 60698ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 61444 ms. Remains : 197/197 places, 653/653 transitions.
Computed a total of 7 stabilizing places and 39 stable transitions
Computed a total of 7 stabilizing places and 39 stable transitions
Knowledge obtained : [(AND (NOT p3) (NOT p1) (NOT p2) (NOT p0)), (X (NOT p2)), (X (AND (NOT p1) (NOT p2) (NOT p3) (NOT p0))), (X (NOT (AND (NOT p1) p2 p3))), (X (NOT p3)), (X (NOT (AND (NOT p2) p3))), (X (NOT (AND p2 p3))), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND p1 p3 (NOT p0)))), (X (AND (NOT p2) (NOT p3))), (X (NOT (OR (AND (NOT p1) (NOT p2) p3) (AND (NOT p1) p2 (NOT p3))))), (X (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3)))), (X (NOT (AND (NOT p1) p2 p3 (NOT p0)))), (X (NOT (OR (AND (NOT p1) (NOT p2) p3 (NOT p0)) (AND p1 (NOT p3) (NOT p0)) (AND p2 (NOT p3) (NOT p0))))), (X (NOT (OR (AND (NOT p2) p3) (AND p2 (NOT p3))))), (X (OR (AND (NOT p1) (NOT p2) (NOT p0)) (AND (NOT p3) (NOT p0)))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (AND (NOT p1) (NOT p2) (NOT p3) (NOT p0)))), (X (X (NOT (AND (NOT p1) p2 p3)))), (X (X (NOT p3))), (X (X (NOT (AND (NOT p2) p3)))), (X (X (NOT (AND p2 p3)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 p3 (NOT p0))))), (X (X (AND (NOT p2) (NOT p3)))), (X (X (NOT (OR (AND (NOT p1) (NOT p2) p3) (AND (NOT p1) p2 (NOT p3)))))), (X (X (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))))), (X (X (NOT (AND (NOT p1) p2 p3 (NOT p0))))), (X (X (NOT (OR (AND (NOT p1) (NOT p2) p3 (NOT p0)) (AND p1 (NOT p3) (NOT p0)) (AND p2 (NOT p3) (NOT p0)))))), (X (X (NOT (OR (AND (NOT p2) p3) (AND p2 (NOT p3)))))), (X (X (OR (AND (NOT p1) (NOT p2) (NOT p0)) (AND (NOT p3) (NOT p0))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 35 factoid took 110 ms. Reduced automaton from 7 states, 22 edges and 4 AP (stutter insensitive) to 7 states, 22 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 307 ms :[(OR p3 (AND (NOT p1) p2) (AND (NOT p0) p1)), (NOT p0), (NOT p1), (NOT p1), (OR (NOT p2) (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3))), (AND (NOT p0) p3 p1), (AND (NOT p1) p2 p3)]
RANDOM walk for 40000 steps (2444 resets) in 470 ms. (84 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (33 resets) in 15 ms. (250 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (33 resets) in 15 ms. (250 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (33 resets) in 15 ms. (250 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (31 resets) in 21 ms. (182 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (35 resets) in 11 ms. (333 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (32 resets) in 15 ms. (250 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (36 resets) in 10 ms. (364 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (32 resets) in 11 ms. (333 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (30 resets) in 10 ms. (364 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4002 steps (36 resets) in 18 ms. (210 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (36 resets) in 18 ms. (210 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (35 resets) in 12 ms. (307 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (32 resets) in 13 ms. (285 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4002 steps (34 resets) in 12 ms. (307 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (33 resets) in 15 ms. (250 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (34 resets) in 12 ms. (308 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (31 resets) in 10 ms. (364 steps per ms) remains 17/17 properties
Interrupted probabilistic random walk after 317965 steps, run timeout after 3001 ms. (steps per millisecond=105 ) properties seen :11 out of 17
Probabilistic random walk after 317965 steps, saw 100197 distinct states, run finished after 3001 ms. (steps per millisecond=105 ) properties seen :11
[2024-06-03 00:43:21] [INFO ] Flow matrix only has 620 transitions (discarded 33 similar events)
[2024-06-03 00:43:21] [INFO ] Invariant cache hit.
[2024-06-03 00:43:21] [INFO ] State equation strengthened by 69 read => feed constraints.
Problem apf9 is UNSAT
Problem apf12 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 156/161 variables, 4/4 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/161 variables, 0/4 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 30/191 variables, 6/10 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/191 variables, 0/10 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 619/810 variables, 191/201 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/810 variables, 69/270 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/810 variables, 0/270 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 6/816 variables, 6/276 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/816 variables, 0/276 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 0/816 variables, 0/276 constraints. Problems are: Problem set: 2 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 816/817 variables, and 276 constraints, problems are : Problem set: 2 solved, 4 unsolved in 392 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 197/197 constraints, ReadFeed: 69/69 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 156/161 variables, 4/4 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/161 variables, 0/4 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 30/191 variables, 6/10 constraints. Problems are: Problem set: 2 solved, 4 unsolved
[2024-06-03 00:43:22] [INFO ] Deduced a trap composed of 40 places in 35 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/191 variables, 1/11 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/191 variables, 0/11 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 619/810 variables, 191/202 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/810 variables, 69/271 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/810 variables, 4/275 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/810 variables, 0/275 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 6/816 variables, 6/281 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/816 variables, 0/281 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 0/816 variables, 0/281 constraints. Problems are: Problem set: 2 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 816/817 variables, and 281 constraints, problems are : Problem set: 2 solved, 4 unsolved in 819 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 197/197 constraints, ReadFeed: 69/69 constraints, PredecessorRefiner: 4/6 constraints, Known Traps: 1/1 constraints]
After SMT, in 1232ms problems are : Problem set: 2 solved, 4 unsolved
Fused 4 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 261 ms.
Support contains 5 out of 197 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 197/197 places, 653/653 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 197 transition count 650
Free-agglomeration rule applied 30 times.
Iterating global reduction 1 with 30 rules applied. Total rules applied 33 place count 197 transition count 620
Reduce places removed 30 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 39 rules applied. Total rules applied 72 place count 167 transition count 611
Drop transitions (Redundant composition of simpler transitions.) removed 85 transitions
Redundant transition composition rules discarded 85 transitions
Iterating global reduction 2 with 85 rules applied. Total rules applied 157 place count 167 transition count 526
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 2 with 6 rules applied. Total rules applied 163 place count 167 transition count 526
Applied a total of 163 rules in 29 ms. Remains 167 /197 variables (removed 30) and now considering 526/653 (removed 127) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30 ms. Remains : 167/197 places, 526/653 transitions.
RANDOM walk for 9841 steps (406 resets) in 72 ms. (134 steps per ms) remains 0/4 properties
Found 2 invariant AP formulas.
Knowledge obtained : [(AND (NOT p3) (NOT p1) (NOT p2) (NOT p0)), (X (NOT p2)), (X (AND (NOT p1) (NOT p2) (NOT p3) (NOT p0))), (X (NOT (AND (NOT p1) p2 p3))), (X (NOT p3)), (X (NOT (AND (NOT p2) p3))), (X (NOT (AND p2 p3))), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND p1 p3 (NOT p0)))), (X (AND (NOT p2) (NOT p3))), (X (NOT (OR (AND (NOT p1) (NOT p2) p3) (AND (NOT p1) p2 (NOT p3))))), (X (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3)))), (X (NOT (AND (NOT p1) p2 p3 (NOT p0)))), (X (NOT (OR (AND (NOT p1) (NOT p2) p3 (NOT p0)) (AND p1 (NOT p3) (NOT p0)) (AND p2 (NOT p3) (NOT p0))))), (X (NOT (OR (AND (NOT p2) p3) (AND p2 (NOT p3))))), (X (OR (AND (NOT p1) (NOT p2) (NOT p0)) (AND (NOT p3) (NOT p0)))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (AND (NOT p1) (NOT p2) (NOT p3) (NOT p0)))), (X (X (NOT (AND (NOT p1) p2 p3)))), (X (X (NOT p3))), (X (X (NOT (AND (NOT p2) p3)))), (X (X (NOT (AND p2 p3)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 p3 (NOT p0))))), (X (X (AND (NOT p2) (NOT p3)))), (X (X (NOT (OR (AND (NOT p1) (NOT p2) p3) (AND (NOT p1) p2 (NOT p3)))))), (X (X (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))))), (X (X (NOT (AND (NOT p1) p2 p3 (NOT p0))))), (X (X (NOT (OR (AND (NOT p1) (NOT p2) p3 (NOT p0)) (AND p1 (NOT p3) (NOT p0)) (AND p2 (NOT p3) (NOT p0)))))), (X (X (NOT (OR (AND (NOT p2) p3) (AND p2 (NOT p3)))))), (X (X (OR (AND (NOT p1) (NOT p2) (NOT p0)) (AND (NOT p3) (NOT p0))))), (X (X (NOT p0))), (X (X (NOT p1))), (G (AND (OR p1 p2 (NOT p3)) (OR p1 (NOT p2) p3))), (G (AND (OR p1 p2 (NOT p3) p0) (OR (NOT p1) p3 p0) (OR (NOT p2) p3 p0)))]
False Knowledge obtained : [(F (NOT (AND (NOT p2) (NOT p3)))), (F (NOT (OR (NOT p1) (NOT p3) p0))), (F p0), (F (NOT (OR p2 (NOT p3)))), (F (NOT (OR (AND (NOT p1) (NOT p2) (NOT p0)) (AND (NOT p3) (NOT p0))))), (F p3), (F (NOT (AND (OR p2 (NOT p3)) (OR (NOT p2) p3)))), (F (NOT (AND (NOT p1) (NOT p0)))), (F (NOT (OR (NOT p2) (NOT p3)))), (F p2), (F (NOT (OR p1 (NOT p2) (NOT p3)))), (F p1), (F (NOT (AND (NOT p1) (NOT p2) (NOT p3) (NOT p0)))), (F (NOT (OR p1 (NOT p2) (NOT p3) p0))), (F (NOT (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3)))))]
Knowledge based reduction with 37 factoid took 646 ms. Reduced automaton from 7 states, 22 edges and 4 AP (stutter insensitive) to 7 states, 22 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 307 ms :[(OR p3 (AND (NOT p1) p2) (AND (NOT p0) p1)), (NOT p0), (NOT p1), (NOT p1), (OR (NOT p2) (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3))), (AND (NOT p0) p3 p1), (AND (NOT p1) p2 p3)]
Stuttering acceptance computed with spot in 297 ms :[(OR p3 (AND (NOT p1) p2) (AND (NOT p0) p1)), (NOT p0), (NOT p1), (NOT p1), (OR (NOT p2) (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3))), (AND (NOT p0) p3 p1), (AND (NOT p1) p2 p3)]
Stuttering acceptance computed with spot in 295 ms :[(OR p3 (AND (NOT p1) p2) (AND (NOT p0) p1)), (NOT p0), (NOT p1), (NOT p1), (OR (NOT p2) (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3))), (AND (NOT p0) p3 p1), (AND (NOT p1) p2 p3)]
Product exploration explored 100000 steps with 40087 reset in 359 ms.
Product exploration explored 100000 steps with 39973 reset in 370 ms.
Support contains 5 out of 197 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 197/197 places, 653/653 transitions.
Applied a total of 0 rules in 7 ms. Remains 197 /197 variables (removed 0) and now considering 653/653 (removed 0) transitions.
[2024-06-03 00:43:25] [INFO ] Flow matrix only has 620 transitions (discarded 33 similar events)
[2024-06-03 00:43:25] [INFO ] Invariant cache hit.
[2024-06-03 00:43:25] [INFO ] Implicit Places using invariants in 107 ms returned []
[2024-06-03 00:43:25] [INFO ] Flow matrix only has 620 transitions (discarded 33 similar events)
[2024-06-03 00:43:25] [INFO ] Invariant cache hit.
[2024-06-03 00:43:25] [INFO ] State equation strengthened by 69 read => feed constraints.
[2024-06-03 00:43:26] [INFO ] Implicit Places using invariants and state equation in 522 ms returned []
Implicit Place search using SMT with State Equation took 631 ms to find 0 implicit places.
[2024-06-03 00:43:26] [INFO ] Redundant transitions in 64 ms returned []
Running 625 sub problems to find dead transitions.
[2024-06-03 00:43:26] [INFO ] Flow matrix only has 620 transitions (discarded 33 similar events)
[2024-06-03 00:43:26] [INFO ] Invariant cache hit.
[2024-06-03 00:43:26] [INFO ] State equation strengthened by 69 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/196 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 625 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/196 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 625 unsolved
At refinement iteration 2 (OVERLAPS) 1/197 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 625 unsolved
[2024-06-03 00:43:31] [INFO ] Deduced a trap composed of 53 places in 102 ms of which 2 ms to minimize.
[2024-06-03 00:43:32] [INFO ] Deduced a trap composed of 76 places in 112 ms of which 1 ms to minimize.
[2024-06-03 00:43:32] [INFO ] Deduced a trap composed of 34 places in 106 ms of which 2 ms to minimize.
[2024-06-03 00:43:32] [INFO ] Deduced a trap composed of 27 places in 115 ms of which 2 ms to minimize.
[2024-06-03 00:43:32] [INFO ] Deduced a trap composed of 42 places in 96 ms of which 2 ms to minimize.
[2024-06-03 00:43:32] [INFO ] Deduced a trap composed of 27 places in 95 ms of which 1 ms to minimize.
[2024-06-03 00:43:32] [INFO ] Deduced a trap composed of 42 places in 39 ms of which 1 ms to minimize.
[2024-06-03 00:43:32] [INFO ] Deduced a trap composed of 43 places in 35 ms of which 1 ms to minimize.
[2024-06-03 00:43:32] [INFO ] Deduced a trap composed of 41 places in 32 ms of which 1 ms to minimize.
[2024-06-03 00:43:33] [INFO ] Deduced a trap composed of 40 places in 39 ms of which 1 ms to minimize.
[2024-06-03 00:43:33] [INFO ] Deduced a trap composed of 40 places in 39 ms of which 1 ms to minimize.
[2024-06-03 00:43:33] [INFO ] Deduced a trap composed of 27 places in 93 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/197 variables, 12/22 constraints. Problems are: Problem set: 0 solved, 625 unsolved
[2024-06-03 00:43:39] [INFO ] Deduced a trap composed of 23 places in 90 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/197 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 625 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/197 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 625 unsolved
At refinement iteration 6 (OVERLAPS) 619/816 variables, 197/220 constraints. Problems are: Problem set: 0 solved, 625 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/816 variables, 69/289 constraints. Problems are: Problem set: 0 solved, 625 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/816 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 625 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 816/817 variables, and 289 constraints, problems are : Problem set: 0 solved, 625 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 197/197 constraints, ReadFeed: 69/69 constraints, PredecessorRefiner: 625/625 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 0 solved, 625 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/196 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 625 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/196 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 625 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/196 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 625 unsolved
At refinement iteration 3 (OVERLAPS) 1/197 variables, 9/14 constraints. Problems are: Problem set: 0 solved, 625 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/197 variables, 9/23 constraints. Problems are: Problem set: 0 solved, 625 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/197 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 625 unsolved
At refinement iteration 6 (OVERLAPS) 619/816 variables, 197/220 constraints. Problems are: Problem set: 0 solved, 625 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/816 variables, 69/289 constraints. Problems are: Problem set: 0 solved, 625 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/816 variables, 625/914 constraints. Problems are: Problem set: 0 solved, 625 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/816 variables, 0/914 constraints. Problems are: Problem set: 0 solved, 625 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 816/817 variables, and 914 constraints, problems are : Problem set: 0 solved, 625 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 197/197 constraints, ReadFeed: 69/69 constraints, PredecessorRefiner: 625/625 constraints, Known Traps: 13/13 constraints]
After SMT, in 60617ms problems are : Problem set: 0 solved, 625 unsolved
Search for dead transitions found 0 dead transitions in 60623ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 61331 ms. Remains : 197/197 places, 653/653 transitions.
Treatment of property FireWire-PT-19-LTLFireability-09 finished in 260720 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((G(p0)||(G((p2||X(X(p3))))&&p1))))'
Support contains 4 out of 434 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 434/434 places, 771/771 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 424 transition count 731
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 424 transition count 731
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 22 place count 422 transition count 729
Iterating global reduction 0 with 2 rules applied. Total rules applied 24 place count 422 transition count 729
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 421 transition count 728
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 421 transition count 728
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 420 transition count 727
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 420 transition count 727
Applied a total of 28 rules in 19 ms. Remains 420 /434 variables (removed 14) and now considering 727/771 (removed 44) transitions.
// Phase 1: matrix 727 rows 420 cols
[2024-06-03 00:44:27] [INFO ] Computed 10 invariants in 3 ms
[2024-06-03 00:44:27] [INFO ] Implicit Places using invariants in 242 ms returned []
[2024-06-03 00:44:27] [INFO ] Invariant cache hit.
[2024-06-03 00:44:27] [INFO ] Implicit Places using invariants and state equation in 409 ms returned []
Implicit Place search using SMT with State Equation took 653 ms to find 0 implicit places.
Running 726 sub problems to find dead transitions.
[2024-06-03 00:44:27] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/419 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 726 unsolved
At refinement iteration 1 (OVERLAPS) 1/420 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 726 unsolved
[2024-06-03 00:44:37] [INFO ] Deduced a trap composed of 85 places in 46 ms of which 0 ms to minimize.
[2024-06-03 00:44:38] [INFO ] Deduced a trap composed of 76 places in 50 ms of which 1 ms to minimize.
[2024-06-03 00:44:38] [INFO ] Deduced a trap composed of 29 places in 42 ms of which 1 ms to minimize.
[2024-06-03 00:44:38] [INFO ] Deduced a trap composed of 88 places in 47 ms of which 1 ms to minimize.
[2024-06-03 00:44:39] [INFO ] Deduced a trap composed of 86 places in 47 ms of which 1 ms to minimize.
[2024-06-03 00:44:40] [INFO ] Deduced a trap composed of 54 places in 100 ms of which 2 ms to minimize.
[2024-06-03 00:44:40] [INFO ] Deduced a trap composed of 55 places in 121 ms of which 2 ms to minimize.
[2024-06-03 00:44:40] [INFO ] Deduced a trap composed of 73 places in 104 ms of which 1 ms to minimize.
[2024-06-03 00:44:44] [INFO ] Deduced a trap composed of 72 places in 45 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/420 variables, 9/19 constraints. Problems are: Problem set: 0 solved, 726 unsolved
[2024-06-03 00:44:44] [INFO ] Deduced a trap composed of 74 places in 46 ms of which 1 ms to minimize.
[2024-06-03 00:44:45] [INFO ] Deduced a trap composed of 28 places in 34 ms of which 1 ms to minimize.
[2024-06-03 00:44:46] [INFO ] Deduced a trap composed of 75 places in 52 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/420 variables, 3/22 constraints. Problems are: Problem set: 0 solved, 726 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 420/1147 variables, and 22 constraints, problems are : Problem set: 0 solved, 726 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 0/420 constraints, PredecessorRefiner: 726/726 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 726 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/419 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 726 unsolved
At refinement iteration 1 (OVERLAPS) 1/420 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 726 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/420 variables, 12/22 constraints. Problems are: Problem set: 0 solved, 726 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/420 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 726 unsolved
At refinement iteration 4 (OVERLAPS) 727/1147 variables, 420/442 constraints. Problems are: Problem set: 0 solved, 726 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1147 variables, 726/1168 constraints. Problems are: Problem set: 0 solved, 726 unsolved
[2024-06-03 00:45:16] [INFO ] Deduced a trap composed of 218 places in 161 ms of which 2 ms to minimize.
[2024-06-03 00:45:16] [INFO ] Deduced a trap composed of 208 places in 150 ms of which 2 ms to minimize.
[2024-06-03 00:45:19] [INFO ] Deduced a trap composed of 138 places in 145 ms of which 2 ms to minimize.
[2024-06-03 00:45:19] [INFO ] Deduced a trap composed of 143 places in 135 ms of which 3 ms to minimize.
[2024-06-03 00:45:19] [INFO ] Deduced a trap composed of 130 places in 136 ms of which 2 ms to minimize.
[2024-06-03 00:45:20] [INFO ] Deduced a trap composed of 75 places in 95 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1147/1147 variables, and 1174 constraints, problems are : Problem set: 0 solved, 726 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 420/420 constraints, PredecessorRefiner: 726/726 constraints, Known Traps: 18/18 constraints]
After SMT, in 60291ms problems are : Problem set: 0 solved, 726 unsolved
Search for dead transitions found 0 dead transitions in 60301ms
Starting structural reductions in LTL mode, iteration 1 : 420/434 places, 727/771 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60976 ms. Remains : 420/434 places, 727/771 transitions.
Stuttering acceptance computed with spot in 491 ms :[(OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), true, (NOT p0), (NOT p3), (AND (NOT p2) (NOT p3)), (AND (NOT p3) (NOT p0)), (AND (NOT p0) (NOT p2) (NOT p3)), (NOT p3), (AND (NOT p0) (NOT p3))]
Running random walk in product with property : FireWire-PT-19-LTLFireability-10
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA FireWire-PT-19-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-19-LTLFireability-10 finished in 61487 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((!p0&&X(!p0))) U p1))'
Support contains 3 out of 434 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 434/434 places, 771/771 transitions.
Graph (trivial) has 337 edges and 434 vertex of which 18 / 434 are part of one of the 3 SCC in 2 ms
Free SCC test removed 15 places
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 77 transitions
Trivial Post-agglo rules discarded 77 transitions
Performed 77 trivial Post agglomeration. Transition count delta: 77
Iterating post reduction 0 with 77 rules applied. Total rules applied 78 place count 418 transition count 677
Reduce places removed 77 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 82 rules applied. Total rules applied 160 place count 341 transition count 672
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 162 place count 339 transition count 672
Performed 41 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 41 Pre rules applied. Total rules applied 162 place count 339 transition count 631
Deduced a syphon composed of 41 places in 0 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 3 with 82 rules applied. Total rules applied 244 place count 298 transition count 631
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 249 place count 293 transition count 567
Iterating global reduction 3 with 5 rules applied. Total rules applied 254 place count 293 transition count 567
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 255 place count 293 transition count 566
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 255 place count 293 transition count 564
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 259 place count 291 transition count 564
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 260 place count 290 transition count 563
Iterating global reduction 4 with 1 rules applied. Total rules applied 261 place count 290 transition count 563
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 4 with 2 rules applied. Total rules applied 263 place count 290 transition count 561
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 264 place count 289 transition count 561
Performed 45 Post agglomeration using F-continuation condition.Transition count delta: 45
Deduced a syphon composed of 45 places in 0 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 6 with 90 rules applied. Total rules applied 354 place count 244 transition count 516
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: -140
Deduced a syphon composed of 48 places in 0 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 6 with 96 rules applied. Total rules applied 450 place count 196 transition count 656
Drop transitions (Redundant composition of simpler transitions.) removed 59 transitions
Redundant transition composition rules discarded 59 transitions
Iterating global reduction 6 with 59 rules applied. Total rules applied 509 place count 196 transition count 597
Applied a total of 509 rules in 59 ms. Remains 196 /434 variables (removed 238) and now considering 597/771 (removed 174) transitions.
[2024-06-03 00:45:28] [INFO ] Flow matrix only has 570 transitions (discarded 27 similar events)
// Phase 1: matrix 570 rows 196 cols
[2024-06-03 00:45:28] [INFO ] Computed 10 invariants in 6 ms
[2024-06-03 00:45:28] [INFO ] Implicit Places using invariants in 100 ms returned []
[2024-06-03 00:45:28] [INFO ] Flow matrix only has 570 transitions (discarded 27 similar events)
[2024-06-03 00:45:28] [INFO ] Invariant cache hit.
[2024-06-03 00:45:28] [INFO ] State equation strengthened by 68 read => feed constraints.
[2024-06-03 00:45:29] [INFO ] Implicit Places using invariants and state equation in 487 ms returned []
Implicit Place search using SMT with State Equation took 589 ms to find 0 implicit places.
[2024-06-03 00:45:29] [INFO ] Redundant transitions in 30 ms returned []
Running 578 sub problems to find dead transitions.
[2024-06-03 00:45:29] [INFO ] Flow matrix only has 570 transitions (discarded 27 similar events)
[2024-06-03 00:45:29] [INFO ] Invariant cache hit.
[2024-06-03 00:45:29] [INFO ] State equation strengthened by 68 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/195 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 578 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/195 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 578 unsolved
At refinement iteration 2 (OVERLAPS) 1/196 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 578 unsolved
[2024-06-03 00:45:34] [INFO ] Deduced a trap composed of 54 places in 106 ms of which 1 ms to minimize.
[2024-06-03 00:45:34] [INFO ] Deduced a trap composed of 51 places in 99 ms of which 2 ms to minimize.
[2024-06-03 00:45:34] [INFO ] Deduced a trap composed of 42 places in 41 ms of which 0 ms to minimize.
[2024-06-03 00:45:34] [INFO ] Deduced a trap composed of 72 places in 107 ms of which 1 ms to minimize.
[2024-06-03 00:45:34] [INFO ] Deduced a trap composed of 40 places in 40 ms of which 1 ms to minimize.
[2024-06-03 00:45:34] [INFO ] Deduced a trap composed of 35 places in 105 ms of which 2 ms to minimize.
[2024-06-03 00:45:34] [INFO ] Deduced a trap composed of 42 places in 38 ms of which 1 ms to minimize.
[2024-06-03 00:45:35] [INFO ] Deduced a trap composed of 26 places in 87 ms of which 1 ms to minimize.
[2024-06-03 00:45:35] [INFO ] Deduced a trap composed of 33 places in 97 ms of which 1 ms to minimize.
[2024-06-03 00:45:35] [INFO ] Deduced a trap composed of 40 places in 39 ms of which 0 ms to minimize.
[2024-06-03 00:45:35] [INFO ] Deduced a trap composed of 40 places in 42 ms of which 1 ms to minimize.
[2024-06-03 00:45:36] [INFO ] Deduced a trap composed of 29 places in 103 ms of which 2 ms to minimize.
[2024-06-03 00:45:36] [INFO ] Deduced a trap composed of 40 places in 89 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/196 variables, 13/23 constraints. Problems are: Problem set: 0 solved, 578 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/196 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 578 unsolved
At refinement iteration 5 (OVERLAPS) 569/765 variables, 196/219 constraints. Problems are: Problem set: 0 solved, 578 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/765 variables, 68/287 constraints. Problems are: Problem set: 0 solved, 578 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/765 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 578 unsolved
At refinement iteration 8 (OVERLAPS) 0/765 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 578 unsolved
No progress, stopping.
After SMT solving in domain Real declared 765/766 variables, and 287 constraints, problems are : Problem set: 0 solved, 578 unsolved in 27260 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 196/196 constraints, ReadFeed: 68/68 constraints, PredecessorRefiner: 578/578 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 0 solved, 578 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/195 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 578 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/195 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 578 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/195 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 578 unsolved
At refinement iteration 3 (OVERLAPS) 1/196 variables, 9/15 constraints. Problems are: Problem set: 0 solved, 578 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/196 variables, 8/23 constraints. Problems are: Problem set: 0 solved, 578 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/196 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 578 unsolved
At refinement iteration 6 (OVERLAPS) 569/765 variables, 196/219 constraints. Problems are: Problem set: 0 solved, 578 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/765 variables, 68/287 constraints. Problems are: Problem set: 0 solved, 578 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/765 variables, 578/865 constraints. Problems are: Problem set: 0 solved, 578 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/765 variables, 0/865 constraints. Problems are: Problem set: 0 solved, 578 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 765/766 variables, and 865 constraints, problems are : Problem set: 0 solved, 578 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 196/196 constraints, ReadFeed: 68/68 constraints, PredecessorRefiner: 578/578 constraints, Known Traps: 13/13 constraints]
After SMT, in 57787ms problems are : Problem set: 0 solved, 578 unsolved
Search for dead transitions found 0 dead transitions in 57792ms
Starting structural reductions in SI_LTL mode, iteration 1 : 196/434 places, 597/771 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 58474 ms. Remains : 196/434 places, 597/771 transitions.
Stuttering acceptance computed with spot in 84 ms :[(NOT p1), true, p0]
Running random walk in product with property : FireWire-PT-19-LTLFireability-11
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA FireWire-PT-19-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-19-LTLFireability-11 finished in 58581 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(X(G((F(G(p0)) U p1)))))'
Support contains 3 out of 434 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 434/434 places, 771/771 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 424 transition count 731
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 424 transition count 731
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 23 place count 421 transition count 728
Iterating global reduction 0 with 3 rules applied. Total rules applied 26 place count 421 transition count 728
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 27 place count 421 transition count 727
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 28 place count 420 transition count 726
Iterating global reduction 1 with 1 rules applied. Total rules applied 29 place count 420 transition count 726
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 30 place count 419 transition count 725
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 419 transition count 725
Applied a total of 31 rules in 34 ms. Remains 419 /434 variables (removed 15) and now considering 725/771 (removed 46) transitions.
// Phase 1: matrix 725 rows 419 cols
[2024-06-03 00:46:27] [INFO ] Computed 10 invariants in 6 ms
[2024-06-03 00:46:27] [INFO ] Implicit Places using invariants in 140 ms returned []
[2024-06-03 00:46:27] [INFO ] Invariant cache hit.
[2024-06-03 00:46:27] [INFO ] Implicit Places using invariants and state equation in 455 ms returned []
Implicit Place search using SMT with State Equation took 595 ms to find 0 implicit places.
Running 724 sub problems to find dead transitions.
[2024-06-03 00:46:27] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/418 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 724 unsolved
At refinement iteration 1 (OVERLAPS) 1/419 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 724 unsolved
[2024-06-03 00:46:37] [INFO ] Deduced a trap composed of 28 places in 46 ms of which 1 ms to minimize.
[2024-06-03 00:46:37] [INFO ] Deduced a trap composed of 85 places in 50 ms of which 1 ms to minimize.
[2024-06-03 00:46:38] [INFO ] Deduced a trap composed of 86 places in 44 ms of which 1 ms to minimize.
[2024-06-03 00:46:39] [INFO ] Deduced a trap composed of 73 places in 49 ms of which 1 ms to minimize.
[2024-06-03 00:46:39] [INFO ] Deduced a trap composed of 86 places in 49 ms of which 1 ms to minimize.
[2024-06-03 00:46:40] [INFO ] Deduced a trap composed of 55 places in 105 ms of which 1 ms to minimize.
[2024-06-03 00:46:40] [INFO ] Deduced a trap composed of 74 places in 117 ms of which 2 ms to minimize.
[2024-06-03 00:46:44] [INFO ] Deduced a trap composed of 72 places in 48 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/419 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 724 unsolved
[2024-06-03 00:46:47] [INFO ] Deduced a trap composed of 58 places in 119 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/419 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 724 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 419/1144 variables, and 19 constraints, problems are : Problem set: 0 solved, 724 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 0/419 constraints, PredecessorRefiner: 724/724 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 724 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/418 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 724 unsolved
At refinement iteration 1 (OVERLAPS) 1/419 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 724 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/419 variables, 9/19 constraints. Problems are: Problem set: 0 solved, 724 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/419 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 724 unsolved
At refinement iteration 4 (OVERLAPS) 725/1144 variables, 419/438 constraints. Problems are: Problem set: 0 solved, 724 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1144 variables, 724/1162 constraints. Problems are: Problem set: 0 solved, 724 unsolved
[2024-06-03 00:47:17] [INFO ] Deduced a trap composed of 74 places in 135 ms of which 2 ms to minimize.
[2024-06-03 00:47:17] [INFO ] Deduced a trap composed of 263 places in 143 ms of which 2 ms to minimize.
[2024-06-03 00:47:18] [INFO ] Deduced a trap composed of 222 places in 144 ms of which 2 ms to minimize.
[2024-06-03 00:47:20] [INFO ] Deduced a trap composed of 212 places in 129 ms of which 2 ms to minimize.
[2024-06-03 00:47:20] [INFO ] Deduced a trap composed of 75 places in 93 ms of which 2 ms to minimize.
[2024-06-03 00:47:21] [INFO ] Deduced a trap composed of 157 places in 139 ms of which 2 ms to minimize.
[2024-06-03 00:47:21] [INFO ] Deduced a trap composed of 141 places in 137 ms of which 2 ms to minimize.
[2024-06-03 00:47:21] [INFO ] Deduced a trap composed of 146 places in 130 ms of which 2 ms to minimize.
[2024-06-03 00:47:21] [INFO ] Deduced a trap composed of 142 places in 131 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1144/1144 variables, and 1171 constraints, problems are : Problem set: 0 solved, 724 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 419/419 constraints, PredecessorRefiner: 724/724 constraints, Known Traps: 18/18 constraints]
After SMT, in 60275ms problems are : Problem set: 0 solved, 724 unsolved
Search for dead transitions found 0 dead transitions in 60283ms
Starting structural reductions in LTL mode, iteration 1 : 419/434 places, 725/771 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60915 ms. Remains : 419/434 places, 725/771 transitions.
Stuttering acceptance computed with spot in 211 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p0), (NOT p1)]
Running random walk in product with property : FireWire-PT-19-LTLFireability-12
Product exploration explored 100000 steps with 0 reset in 89 ms.
Stuttering criterion allowed to conclude after 102 steps with 0 reset in 0 ms.
FORMULA FireWire-PT-19-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-19-LTLFireability-12 finished in 61247 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((X(G(p0))&&G((p1&&(p2 U p3))))))'
Support contains 6 out of 434 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 434/434 places, 771/771 transitions.
Graph (trivial) has 331 edges and 434 vertex of which 18 / 434 are part of one of the 3 SCC in 0 ms
Free SCC test removed 15 places
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 76 transitions
Trivial Post-agglo rules discarded 76 transitions
Performed 76 trivial Post agglomeration. Transition count delta: 76
Iterating post reduction 0 with 76 rules applied. Total rules applied 77 place count 418 transition count 678
Reduce places removed 76 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 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 80 rules applied. Total rules applied 157 place count 342 transition count 674
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 159 place count 340 transition count 674
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 40 Pre rules applied. Total rules applied 159 place count 340 transition count 634
Deduced a syphon composed of 40 places in 1 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 3 with 80 rules applied. Total rules applied 239 place count 300 transition count 634
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 244 place count 295 transition count 570
Iterating global reduction 3 with 5 rules applied. Total rules applied 249 place count 295 transition count 570
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 250 place count 295 transition count 569
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 250 place count 295 transition count 567
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 254 place count 293 transition count 567
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 255 place count 292 transition count 566
Iterating global reduction 4 with 1 rules applied. Total rules applied 256 place count 292 transition count 566
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 4 with 2 rules applied. Total rules applied 258 place count 292 transition count 564
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 259 place count 291 transition count 564
Performed 45 Post agglomeration using F-continuation condition.Transition count delta: 45
Deduced a syphon composed of 45 places in 1 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 6 with 90 rules applied. Total rules applied 349 place count 246 transition count 519
Performed 46 Post agglomeration using F-continuation condition.Transition count delta: -152
Deduced a syphon composed of 46 places in 0 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 6 with 92 rules applied. Total rules applied 441 place count 200 transition count 671
Drop transitions (Redundant composition of simpler transitions.) removed 57 transitions
Redundant transition composition rules discarded 57 transitions
Iterating global reduction 6 with 57 rules applied. Total rules applied 498 place count 200 transition count 614
Applied a total of 498 rules in 59 ms. Remains 200 /434 variables (removed 234) and now considering 614/771 (removed 157) transitions.
[2024-06-03 00:47:28] [INFO ] Flow matrix only has 587 transitions (discarded 27 similar events)
// Phase 1: matrix 587 rows 200 cols
[2024-06-03 00:47:28] [INFO ] Computed 10 invariants in 3 ms
[2024-06-03 00:47:28] [INFO ] Implicit Places using invariants in 92 ms returned []
[2024-06-03 00:47:28] [INFO ] Flow matrix only has 587 transitions (discarded 27 similar events)
[2024-06-03 00:47:28] [INFO ] Invariant cache hit.
[2024-06-03 00:47:28] [INFO ] State equation strengthened by 67 read => feed constraints.
[2024-06-03 00:47:29] [INFO ] Implicit Places using invariants and state equation in 449 ms returned []
Implicit Place search using SMT with State Equation took 544 ms to find 0 implicit places.
[2024-06-03 00:47:29] [INFO ] Redundant transitions in 68 ms returned []
Running 577 sub problems to find dead transitions.
[2024-06-03 00:47:29] [INFO ] Flow matrix only has 587 transitions (discarded 27 similar events)
[2024-06-03 00:47:29] [INFO ] Invariant cache hit.
[2024-06-03 00:47:29] [INFO ] State equation strengthened by 67 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/199 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 577 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/199 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 577 unsolved
At refinement iteration 2 (OVERLAPS) 1/200 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 577 unsolved
[2024-06-03 00:47:33] [INFO ] Deduced a trap composed of 51 places in 103 ms of which 1 ms to minimize.
[2024-06-03 00:47:34] [INFO ] Deduced a trap composed of 74 places in 105 ms of which 2 ms to minimize.
[2024-06-03 00:47:34] [INFO ] Deduced a trap composed of 42 places in 38 ms of which 1 ms to minimize.
[2024-06-03 00:47:34] [INFO ] Deduced a trap composed of 33 places in 97 ms of which 2 ms to minimize.
[2024-06-03 00:47:34] [INFO ] Deduced a trap composed of 43 places in 44 ms of which 1 ms to minimize.
[2024-06-03 00:47:35] [INFO ] Deduced a trap composed of 43 places in 39 ms of which 0 ms to minimize.
[2024-06-03 00:47:35] [INFO ] Deduced a trap composed of 27 places in 95 ms of which 1 ms to minimize.
[2024-06-03 00:47:35] [INFO ] Deduced a trap composed of 27 places in 88 ms of which 1 ms to minimize.
[2024-06-03 00:47:35] [INFO ] Deduced a trap composed of 41 places in 41 ms of which 1 ms to minimize.
[2024-06-03 00:47:35] [INFO ] Deduced a trap composed of 40 places in 35 ms of which 1 ms to minimize.
[2024-06-03 00:47:35] [INFO ] Deduced a trap composed of 27 places in 91 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/200 variables, 11/21 constraints. Problems are: Problem set: 0 solved, 577 unsolved
[2024-06-03 00:47:40] [INFO ] Deduced a trap composed of 23 places in 97 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/200 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 577 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/200 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 577 unsolved
At refinement iteration 6 (OVERLAPS) 586/786 variables, 200/222 constraints. Problems are: Problem set: 0 solved, 577 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/786 variables, 67/289 constraints. Problems are: Problem set: 0 solved, 577 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/786 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 577 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 1.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 1.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 1.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 1.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 1.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 1.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 1.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 1.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 1.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 timeout
0.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 786/787 variables, and 289 constraints, problems are : Problem set: 0 solved, 577 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 200/200 constraints, ReadFeed: 67/67 constraints, PredecessorRefiner: 577/577 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 577 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/199 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 577 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/199 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 577 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/199 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 577 unsolved
At refinement iteration 3 (OVERLAPS) 1/200 variables, 9/14 constraints. Problems are: Problem set: 0 solved, 577 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/200 variables, 8/22 constraints. Problems are: Problem set: 0 solved, 577 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/200 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 577 unsolved
At refinement iteration 6 (OVERLAPS) 586/786 variables, 200/222 constraints. Problems are: Problem set: 0 solved, 577 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/786 variables, 67/289 constraints. Problems are: Problem set: 0 solved, 577 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/786 variables, 577/866 constraints. Problems are: Problem set: 0 solved, 577 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/786 variables, 0/866 constraints. Problems are: Problem set: 0 solved, 577 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 786/787 variables, and 866 constraints, problems are : Problem set: 0 solved, 577 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 200/200 constraints, ReadFeed: 67/67 constraints, PredecessorRefiner: 577/577 constraints, Known Traps: 12/12 constraints]
After SMT, in 60505ms problems are : Problem set: 0 solved, 577 unsolved
Search for dead transitions found 0 dead transitions in 60510ms
Starting structural reductions in SI_LTL mode, iteration 1 : 200/434 places, 614/771 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61188 ms. Remains : 200/434 places, 614/771 transitions.
Stuttering acceptance computed with spot in 221 ms :[(OR (NOT p1) (NOT p3) (NOT p0)), (NOT p0), (NOT p3), (OR (NOT p1) (NOT p3))]
Running random walk in product with property : FireWire-PT-19-LTLFireability-14
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA FireWire-PT-19-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-19-LTLFireability-14 finished in 61435 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(X(F((G(F(((!p0&&X(p1)) U (G((!p0&&X(p1)))||(!p0&&X((p1&&X(p2))))))))||(X(p1)&&F(((!p0&&X(p1)) U (G((!p0&&X(p1)))||(!p0&&X((p1&&X(p2)))))))))))))'
Support contains 4 out of 434 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 434/434 places, 771/771 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 425 transition count 761
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 425 transition count 761
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 21 place count 422 transition count 758
Iterating global reduction 0 with 3 rules applied. Total rules applied 24 place count 422 transition count 758
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 25 place count 422 transition count 757
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 26 place count 421 transition count 756
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 421 transition count 756
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 28 place count 420 transition count 755
Iterating global reduction 1 with 1 rules applied. Total rules applied 29 place count 420 transition count 755
Applied a total of 29 rules in 30 ms. Remains 420 /434 variables (removed 14) and now considering 755/771 (removed 16) transitions.
// Phase 1: matrix 755 rows 420 cols
[2024-06-03 00:48:29] [INFO ] Computed 10 invariants in 6 ms
[2024-06-03 00:48:30] [INFO ] Implicit Places using invariants in 142 ms returned []
[2024-06-03 00:48:30] [INFO ] Invariant cache hit.
[2024-06-03 00:48:30] [INFO ] Implicit Places using invariants and state equation in 425 ms returned []
Implicit Place search using SMT with State Equation took 568 ms to find 0 implicit places.
Running 754 sub problems to find dead transitions.
[2024-06-03 00:48:30] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/419 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 754 unsolved
At refinement iteration 1 (OVERLAPS) 1/420 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 754 unsolved
[2024-06-03 00:48:40] [INFO ] Deduced a trap composed of 86 places in 47 ms of which 1 ms to minimize.
[2024-06-03 00:48:41] [INFO ] Deduced a trap composed of 86 places in 67 ms of which 1 ms to minimize.
[2024-06-03 00:48:41] [INFO ] Deduced a trap composed of 29 places in 44 ms of which 2 ms to minimize.
[2024-06-03 00:48:42] [INFO ] Deduced a trap composed of 86 places in 42 ms of which 1 ms to minimize.
[2024-06-03 00:48:42] [INFO ] Deduced a trap composed of 55 places in 105 ms of which 1 ms to minimize.
[2024-06-03 00:48:42] [INFO ] Deduced a trap composed of 56 places in 108 ms of which 2 ms to minimize.
[2024-06-03 00:48:43] [INFO ] Deduced a trap composed of 74 places in 109 ms of which 2 ms to minimize.
[2024-06-03 00:48:47] [INFO ] Deduced a trap composed of 73 places in 50 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/420 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 754 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/420 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 754 unsolved
At refinement iteration 4 (OVERLAPS) 755/1175 variables, 420/438 constraints. Problems are: Problem set: 0 solved, 754 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1175/1175 variables, and 438 constraints, problems are : Problem set: 0 solved, 754 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 420/420 constraints, PredecessorRefiner: 754/754 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 754 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/419 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 754 unsolved
At refinement iteration 1 (OVERLAPS) 1/420 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 754 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/420 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 754 unsolved
[2024-06-03 00:49:07] [INFO ] Deduced a trap composed of 75 places in 53 ms of which 1 ms to minimize.
[2024-06-03 00:49:07] [INFO ] Deduced a trap composed of 73 places in 45 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/420 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 754 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/420 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 754 unsolved
At refinement iteration 5 (OVERLAPS) 755/1175 variables, 420/440 constraints. Problems are: Problem set: 0 solved, 754 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1175 variables, 754/1194 constraints. Problems are: Problem set: 0 solved, 754 unsolved
[2024-06-03 00:49:25] [INFO ] Deduced a trap composed of 223 places in 147 ms of which 2 ms to minimize.
[2024-06-03 00:49:27] [INFO ] Deduced a trap composed of 133 places in 160 ms of which 3 ms to minimize.
[2024-06-03 00:49:28] [INFO ] Deduced a trap composed of 135 places in 149 ms of which 2 ms to minimize.
[2024-06-03 00:49:28] [INFO ] Deduced a trap composed of 217 places in 153 ms of which 3 ms to minimize.
[2024-06-03 00:49:28] [INFO ] Deduced a trap composed of 211 places in 151 ms of which 3 ms to minimize.
[2024-06-03 00:49:29] [INFO ] Deduced a trap composed of 73 places in 121 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1175/1175 variables, and 1200 constraints, problems are : Problem set: 0 solved, 754 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 420/420 constraints, PredecessorRefiner: 754/754 constraints, Known Traps: 16/16 constraints]
After SMT, in 60299ms problems are : Problem set: 0 solved, 754 unsolved
Search for dead transitions found 0 dead transitions in 60306ms
Starting structural reductions in LTL mode, iteration 1 : 420/434 places, 755/771 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60909 ms. Remains : 420/434 places, 755/771 transitions.
Stuttering acceptance computed with spot in 350 ms :[(OR (NOT p1) p0), (OR (NOT p1) p0), (OR (NOT p1) p0), (NOT p1), (AND p0 p1 (NOT p2)), (AND (NOT p1) (NOT p2)), (AND p0 p1 (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p2)))]
Running random walk in product with property : FireWire-PT-19-LTLFireability-15
Product exploration explored 100000 steps with 22249 reset in 143 ms.
Product exploration explored 100000 steps with 22234 reset in 192 ms.
Computed a total of 63 stabilizing places and 69 stable transitions
Computed a total of 63 stabilizing places and 69 stable transitions
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 103 ms. Reduced automaton from 8 states, 20 edges and 3 AP (stutter sensitive) to 8 states, 20 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 327 ms :[(OR (NOT p1) p0), (OR (NOT p1) p0), (OR (NOT p1) p0), (NOT p1), (AND p0 p1 (NOT p2)), (AND (NOT p1) (NOT p2)), (AND p0 p1 (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p2)))]
RANDOM walk for 40000 steps (15 resets) in 431 ms. (92 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40000 steps (14 resets) in 310 ms. (128 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40000 steps (11 resets) in 392 ms. (101 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40000 steps (17 resets) in 387 ms. (103 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40000 steps (16 resets) in 451 ms. (88 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40000 steps (23 resets) in 569 ms. (70 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40001 steps (14 resets) in 574 ms. (69 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40000 steps (20 resets) in 388 ms. (102 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40000 steps (13 resets) in 437 ms. (91 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40000 steps (24 resets) in 437 ms. (91 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40001 steps (16 resets) in 312 ms. (127 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40000 steps (18 resets) in 391 ms. (102 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40000 steps (10 resets) in 479 ms. (83 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40001 steps (16 resets) in 530 ms. (75 steps per ms) remains 13/13 properties
Interrupted probabilistic random walk after 625517 steps, run timeout after 6001 ms. (steps per millisecond=104 ) properties seen :0 out of 13
Probabilistic random walk after 625517 steps, saw 109911 distinct states, run finished after 6001 ms. (steps per millisecond=104 ) properties seen :0
[2024-06-03 00:49:40] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 13 unsolved
Problem apf6 is UNSAT
Problem apf9 is UNSAT
At refinement iteration 1 (OVERLAPS) 210/214 variables, 3/3 constraints. Problems are: Problem set: 2 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/214 variables, 0/3 constraints. Problems are: Problem set: 2 solved, 11 unsolved
At refinement iteration 3 (OVERLAPS) 155/369 variables, 7/10 constraints. Problems are: Problem set: 2 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/369 variables, 0/10 constraints. Problems are: Problem set: 2 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 701/1070 variables, 369/379 constraints. Problems are: Problem set: 2 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1070 variables, 0/379 constraints. Problems are: Problem set: 2 solved, 11 unsolved
At refinement iteration 7 (OVERLAPS) 27/1097 variables, 12/391 constraints. Problems are: Problem set: 2 solved, 11 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1097 variables, 0/391 constraints. Problems are: Problem set: 2 solved, 11 unsolved
At refinement iteration 9 (OVERLAPS) 30/1127 variables, 15/406 constraints. Problems are: Problem set: 2 solved, 11 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1127 variables, 0/406 constraints. Problems are: Problem set: 2 solved, 11 unsolved
At refinement iteration 11 (OVERLAPS) 18/1145 variables, 9/415 constraints. Problems are: Problem set: 2 solved, 11 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1145 variables, 0/415 constraints. Problems are: Problem set: 2 solved, 11 unsolved
At refinement iteration 13 (OVERLAPS) 21/1166 variables, 9/424 constraints. Problems are: Problem set: 2 solved, 11 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1166 variables, 0/424 constraints. Problems are: Problem set: 2 solved, 11 unsolved
At refinement iteration 15 (OVERLAPS) 9/1175 variables, 6/430 constraints. Problems are: Problem set: 2 solved, 11 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1175 variables, 0/430 constraints. Problems are: Problem set: 2 solved, 11 unsolved
At refinement iteration 17 (OVERLAPS) 0/1175 variables, 0/430 constraints. Problems are: Problem set: 2 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1175/1175 variables, and 430 constraints, problems are : Problem set: 2 solved, 11 unsolved in 2191 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 420/420 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 11 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 210/214 variables, 3/3 constraints. Problems are: Problem set: 2 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/214 variables, 0/3 constraints. Problems are: Problem set: 2 solved, 11 unsolved
At refinement iteration 3 (OVERLAPS) 155/369 variables, 7/10 constraints. Problems are: Problem set: 2 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/369 variables, 0/10 constraints. Problems are: Problem set: 2 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 701/1070 variables, 369/379 constraints. Problems are: Problem set: 2 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1070 variables, 11/390 constraints. Problems are: Problem set: 2 solved, 11 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1070 variables, 0/390 constraints. Problems are: Problem set: 2 solved, 11 unsolved
At refinement iteration 8 (OVERLAPS) 27/1097 variables, 12/402 constraints. Problems are: Problem set: 2 solved, 11 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1097 variables, 0/402 constraints. Problems are: Problem set: 2 solved, 11 unsolved
At refinement iteration 10 (OVERLAPS) 30/1127 variables, 15/417 constraints. Problems are: Problem set: 2 solved, 11 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1127 variables, 0/417 constraints. Problems are: Problem set: 2 solved, 11 unsolved
At refinement iteration 12 (OVERLAPS) 18/1145 variables, 9/426 constraints. Problems are: Problem set: 2 solved, 11 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1145 variables, 0/426 constraints. Problems are: Problem set: 2 solved, 11 unsolved
At refinement iteration 14 (OVERLAPS) 21/1166 variables, 9/435 constraints. Problems are: Problem set: 2 solved, 11 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1166 variables, 0/435 constraints. Problems are: Problem set: 2 solved, 11 unsolved
At refinement iteration 16 (OVERLAPS) 9/1175 variables, 6/441 constraints. Problems are: Problem set: 2 solved, 11 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1175 variables, 0/441 constraints. Problems are: Problem set: 2 solved, 11 unsolved
At refinement iteration 18 (OVERLAPS) 0/1175 variables, 0/441 constraints. Problems are: Problem set: 2 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1175/1175 variables, and 441 constraints, problems are : Problem set: 2 solved, 11 unsolved in 2584 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 420/420 constraints, PredecessorRefiner: 11/13 constraints, Known Traps: 0/0 constraints]
After SMT, in 4790ms problems are : Problem set: 2 solved, 11 unsolved
Fused 11 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 3423 ms.
Support contains 4 out of 420 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 420/420 places, 755/755 transitions.
Graph (trivial) has 320 edges and 420 vertex of which 18 / 420 are part of one of the 3 SCC in 1 ms
Free SCC test removed 15 places
Drop transitions (Empty/Sink Transition effects.) removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 70 transitions
Trivial Post-agglo rules discarded 70 transitions
Performed 70 trivial Post agglomeration. Transition count delta: 70
Iterating post reduction 0 with 70 rules applied. Total rules applied 71 place count 405 transition count 663
Reduce places removed 70 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 76 rules applied. Total rules applied 147 place count 335 transition count 657
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 150 place count 332 transition count 657
Performed 47 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 47 Pre rules applied. Total rules applied 150 place count 332 transition count 610
Deduced a syphon composed of 47 places in 0 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 3 with 94 rules applied. Total rules applied 244 place count 285 transition count 610
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 245 place count 284 transition count 580
Iterating global reduction 3 with 1 rules applied. Total rules applied 246 place count 284 transition count 580
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 247 place count 284 transition count 579
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 40
Deduced a syphon composed of 40 places in 1 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 4 with 80 rules applied. Total rules applied 327 place count 244 transition count 539
Performed 44 Post agglomeration using F-continuation condition.Transition count delta: -162
Deduced a syphon composed of 44 places in 0 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 4 with 88 rules applied. Total rules applied 415 place count 200 transition count 701
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 4 with 9 rules applied. Total rules applied 424 place count 200 transition count 692
Drop transitions (Redundant composition of simpler transitions.) removed 75 transitions
Redundant transition composition rules discarded 75 transitions
Iterating global reduction 5 with 75 rules applied. Total rules applied 499 place count 200 transition count 617
Free-agglomeration rule applied 32 times.
Iterating global reduction 5 with 32 rules applied. Total rules applied 531 place count 200 transition count 585
Reduce places removed 32 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 18 transitions
Ensure Unique test removed 36 transitions
Reduce isomorphic transitions removed 54 transitions.
Iterating post reduction 5 with 86 rules applied. Total rules applied 617 place count 168 transition count 531
Drop transitions (Redundant composition of simpler transitions.) removed 45 transitions
Redundant transition composition rules discarded 45 transitions
Iterating global reduction 6 with 45 rules applied. Total rules applied 662 place count 168 transition count 486
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 6 with 3 rules applied. Total rules applied 665 place count 168 transition count 486
Applied a total of 665 rules in 63 ms. Remains 168 /420 variables (removed 252) and now considering 486/755 (removed 269) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63 ms. Remains : 168/420 places, 486/755 transitions.
RANDOM walk for 35891 steps (1417 resets) in 549 ms. (65 steps per ms) remains 0/11 properties
Found 2 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (X (NOT p0))), (G (OR p1 (NOT p0))), (G (OR p1 (NOT p0) p2))]
False Knowledge obtained : [(F (NOT (OR p0 p2))), (F (NOT (OR (NOT p1) p0 p2))), (F (NOT (OR p1 p0 p2))), (F (NOT (OR (NOT p1) (NOT p0) p2))), (F (NOT p1)), (F (NOT (OR p1 p0))), (F (NOT p2)), (F (NOT (OR (NOT p0) p2))), (F (NOT (AND p1 (NOT p0)))), (F p0), (F (NOT (OR (NOT p1) (NOT p0))))]
Knowledge based reduction with 4 factoid took 438 ms. Reduced automaton from 8 states, 20 edges and 3 AP (stutter sensitive) to 8 states, 18 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 381 ms :[(OR (NOT p1) p0), (OR (NOT p1) p0), (OR (NOT p1) p0), (NOT p1), (AND p0 (NOT p2)), (AND (NOT p1) (NOT p2)), (AND p0 (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p2)))]
Stuttering acceptance computed with spot in 355 ms :[(OR (NOT p1) p0), (OR (NOT p1) p0), (OR (NOT p1) p0), (NOT p1), (AND p0 (NOT p2)), (AND (NOT p1) (NOT p2)), (AND p0 (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p2)))]
Support contains 4 out of 420 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 420/420 places, 755/755 transitions.
Applied a total of 0 rules in 8 ms. Remains 420 /420 variables (removed 0) and now considering 755/755 (removed 0) transitions.
[2024-06-03 00:49:49] [INFO ] Invariant cache hit.
[2024-06-03 00:49:49] [INFO ] Implicit Places using invariants in 134 ms returned []
[2024-06-03 00:49:49] [INFO ] Invariant cache hit.
[2024-06-03 00:49:50] [INFO ] Implicit Places using invariants and state equation in 449 ms returned []
Implicit Place search using SMT with State Equation took 584 ms to find 0 implicit places.
Running 754 sub problems to find dead transitions.
[2024-06-03 00:49:50] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/419 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 754 unsolved
At refinement iteration 1 (OVERLAPS) 1/420 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 754 unsolved
[2024-06-03 00:50:00] [INFO ] Deduced a trap composed of 86 places in 56 ms of which 1 ms to minimize.
[2024-06-03 00:50:01] [INFO ] Deduced a trap composed of 86 places in 48 ms of which 1 ms to minimize.
[2024-06-03 00:50:02] [INFO ] Deduced a trap composed of 29 places in 45 ms of which 0 ms to minimize.
[2024-06-03 00:50:02] [INFO ] Deduced a trap composed of 86 places in 51 ms of which 1 ms to minimize.
[2024-06-03 00:50:03] [INFO ] Deduced a trap composed of 55 places in 106 ms of which 2 ms to minimize.
[2024-06-03 00:50:03] [INFO ] Deduced a trap composed of 56 places in 124 ms of which 2 ms to minimize.
[2024-06-03 00:50:03] [INFO ] Deduced a trap composed of 74 places in 116 ms of which 2 ms to minimize.
[2024-06-03 00:50:07] [INFO ] Deduced a trap composed of 73 places in 50 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/420 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 754 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/420 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 754 unsolved
At refinement iteration 4 (OVERLAPS) 755/1175 variables, 420/438 constraints. Problems are: Problem set: 0 solved, 754 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1175/1175 variables, and 438 constraints, problems are : Problem set: 0 solved, 754 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 420/420 constraints, PredecessorRefiner: 754/754 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 754 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/419 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 754 unsolved
At refinement iteration 1 (OVERLAPS) 1/420 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 754 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/420 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 754 unsolved
[2024-06-03 00:50:27] [INFO ] Deduced a trap composed of 75 places in 49 ms of which 0 ms to minimize.
[2024-06-03 00:50:27] [INFO ] Deduced a trap composed of 73 places in 48 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/420 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 754 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/420 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 754 unsolved
At refinement iteration 5 (OVERLAPS) 755/1175 variables, 420/440 constraints. Problems are: Problem set: 0 solved, 754 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1175 variables, 754/1194 constraints. Problems are: Problem set: 0 solved, 754 unsolved
[2024-06-03 00:50:45] [INFO ] Deduced a trap composed of 223 places in 134 ms of which 5 ms to minimize.
[2024-06-03 00:50:47] [INFO ] Deduced a trap composed of 133 places in 144 ms of which 3 ms to minimize.
[2024-06-03 00:50:47] [INFO ] Deduced a trap composed of 135 places in 133 ms of which 2 ms to minimize.
[2024-06-03 00:50:48] [INFO ] Deduced a trap composed of 217 places in 144 ms of which 3 ms to minimize.
[2024-06-03 00:50:48] [INFO ] Deduced a trap composed of 211 places in 129 ms of which 2 ms to minimize.
[2024-06-03 00:50:49] [INFO ] Deduced a trap composed of 73 places in 115 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1175/1175 variables, and 1200 constraints, problems are : Problem set: 0 solved, 754 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 420/420 constraints, PredecessorRefiner: 754/754 constraints, Known Traps: 16/16 constraints]
After SMT, in 60359ms problems are : Problem set: 0 solved, 754 unsolved
Search for dead transitions found 0 dead transitions in 60368ms
Finished structural reductions in LTL mode , in 1 iterations and 60963 ms. Remains : 420/420 places, 755/755 transitions.
Computed a total of 63 stabilizing places and 69 stable transitions
Computed a total of 63 stabilizing places and 69 stable transitions
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 90 ms. Reduced automaton from 8 states, 18 edges and 3 AP (stutter sensitive) to 8 states, 18 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 338 ms :[(OR (NOT p1) p0), (OR (NOT p1) p0), (OR (NOT p1) p0), (NOT p1), (AND p0 (NOT p2)), (AND (NOT p1) (NOT p2)), (AND p0 (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p2)))]
RANDOM walk for 40000 steps (15 resets) in 382 ms. (104 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40000 steps (13 resets) in 328 ms. (121 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40000 steps (16 resets) in 397 ms. (100 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (22 resets) in 353 ms. (113 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40001 steps (16 resets) in 378 ms. (105 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40001 steps (24 resets) in 140 ms. (283 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (20 resets) in 204 ms. (195 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40000 steps (20 resets) in 342 ms. (116 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40000 steps (15 resets) in 346 ms. (115 steps per ms) remains 8/8 properties
Interrupted probabilistic random walk after 378273 steps, run timeout after 3001 ms. (steps per millisecond=126 ) properties seen :0 out of 8
Probabilistic random walk after 378273 steps, saw 69210 distinct states, run finished after 3001 ms. (steps per millisecond=126 ) properties seen :0
[2024-06-03 00:50:55] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 210/214 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/214 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 155/369 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/369 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 701/1070 variables, 369/379 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1070 variables, 0/379 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 27/1097 variables, 12/391 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1097 variables, 0/391 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (OVERLAPS) 30/1127 variables, 15/406 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1127 variables, 0/406 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (OVERLAPS) 18/1145 variables, 9/415 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1145 variables, 0/415 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (OVERLAPS) 21/1166 variables, 9/424 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1166 variables, 0/424 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 15 (OVERLAPS) 9/1175 variables, 6/430 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1175 variables, 0/430 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 17 (OVERLAPS) 0/1175 variables, 0/430 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1175/1175 variables, and 430 constraints, problems are : Problem set: 0 solved, 8 unsolved in 1515 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 420/420 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 210/214 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/214 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 155/369 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/369 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 701/1070 variables, 369/379 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1070 variables, 8/387 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1070 variables, 0/387 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (OVERLAPS) 27/1097 variables, 12/399 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1097 variables, 0/399 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (OVERLAPS) 30/1127 variables, 15/414 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1127 variables, 0/414 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (OVERLAPS) 18/1145 variables, 9/423 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1145 variables, 0/423 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 14 (OVERLAPS) 21/1166 variables, 9/432 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1166 variables, 0/432 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 16 (OVERLAPS) 9/1175 variables, 6/438 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1175 variables, 0/438 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 18 (OVERLAPS) 0/1175 variables, 0/438 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1175/1175 variables, and 438 constraints, problems are : Problem set: 0 solved, 8 unsolved in 1780 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 420/420 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
After SMT, in 3306ms problems are : Problem set: 0 solved, 8 unsolved
Fused 8 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 1549 ms.
Support contains 4 out of 420 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 420/420 places, 755/755 transitions.
Graph (trivial) has 320 edges and 420 vertex of which 18 / 420 are part of one of the 3 SCC in 0 ms
Free SCC test removed 15 places
Drop transitions (Empty/Sink Transition effects.) removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 70 transitions
Trivial Post-agglo rules discarded 70 transitions
Performed 70 trivial Post agglomeration. Transition count delta: 70
Iterating post reduction 0 with 70 rules applied. Total rules applied 71 place count 405 transition count 663
Reduce places removed 70 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 76 rules applied. Total rules applied 147 place count 335 transition count 657
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 150 place count 332 transition count 657
Performed 47 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 47 Pre rules applied. Total rules applied 150 place count 332 transition count 610
Deduced a syphon composed of 47 places in 1 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 3 with 94 rules applied. Total rules applied 244 place count 285 transition count 610
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 245 place count 284 transition count 580
Iterating global reduction 3 with 1 rules applied. Total rules applied 246 place count 284 transition count 580
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 247 place count 284 transition count 579
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 40
Deduced a syphon composed of 40 places in 0 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 4 with 80 rules applied. Total rules applied 327 place count 244 transition count 539
Performed 44 Post agglomeration using F-continuation condition.Transition count delta: -162
Deduced a syphon composed of 44 places in 0 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 4 with 88 rules applied. Total rules applied 415 place count 200 transition count 701
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 4 with 9 rules applied. Total rules applied 424 place count 200 transition count 692
Drop transitions (Redundant composition of simpler transitions.) removed 75 transitions
Redundant transition composition rules discarded 75 transitions
Iterating global reduction 5 with 75 rules applied. Total rules applied 499 place count 200 transition count 617
Free-agglomeration rule applied 32 times.
Iterating global reduction 5 with 32 rules applied. Total rules applied 531 place count 200 transition count 585
Reduce places removed 32 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 18 transitions
Ensure Unique test removed 36 transitions
Reduce isomorphic transitions removed 54 transitions.
Iterating post reduction 5 with 86 rules applied. Total rules applied 617 place count 168 transition count 531
Drop transitions (Redundant composition of simpler transitions.) removed 45 transitions
Redundant transition composition rules discarded 45 transitions
Iterating global reduction 6 with 45 rules applied. Total rules applied 662 place count 168 transition count 486
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 6 with 3 rules applied. Total rules applied 665 place count 168 transition count 486
Applied a total of 665 rules in 58 ms. Remains 168 /420 variables (removed 252) and now considering 486/755 (removed 269) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 58 ms. Remains : 168/420 places, 486/755 transitions.
RANDOM walk for 32815 steps (1284 resets) in 183 ms. (178 steps per ms) remains 0/8 properties
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (X (NOT p0)))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR (NOT p1) p0 p2))), (F (NOT (OR (NOT p0) p2))), (F (NOT (OR p0 p2))), (F (NOT p2)), (F (NOT (OR p1 p2))), (F (NOT (AND p1 (NOT p0)))), (F p0)]
Knowledge based reduction with 2 factoid took 324 ms. Reduced automaton from 8 states, 18 edges and 3 AP (stutter sensitive) to 8 states, 18 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 363 ms :[(OR (NOT p1) p0), (OR (NOT p1) p0), (OR (NOT p1) p0), (NOT p1), (AND p0 (NOT p2)), (AND (NOT p1) (NOT p2)), (AND p0 (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p2)))]
Stuttering acceptance computed with spot in 372 ms :[(OR (NOT p1) p0), (OR (NOT p1) p0), (OR (NOT p1) p0), (NOT p1), (AND p0 (NOT p2)), (AND (NOT p1) (NOT p2)), (AND p0 (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p2)))]
Stuttering acceptance computed with spot in 364 ms :[(OR (NOT p1) p0), (OR (NOT p1) p0), (OR (NOT p1) p0), (NOT p1), (AND p0 (NOT p2)), (AND (NOT p1) (NOT p2)), (AND p0 (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p2)))]
Product exploration explored 100000 steps with 22228 reset in 116 ms.
Product exploration explored 100000 steps with 22224 reset in 129 ms.
Support contains 4 out of 420 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 420/420 places, 755/755 transitions.
Applied a total of 0 rules in 9 ms. Remains 420 /420 variables (removed 0) and now considering 755/755 (removed 0) transitions.
[2024-06-03 00:51:02] [INFO ] Invariant cache hit.
[2024-06-03 00:51:02] [INFO ] Implicit Places using invariants in 134 ms returned []
[2024-06-03 00:51:02] [INFO ] Invariant cache hit.
[2024-06-03 00:51:02] [INFO ] Implicit Places using invariants and state equation in 451 ms returned []
Implicit Place search using SMT with State Equation took 587 ms to find 0 implicit places.
Running 754 sub problems to find dead transitions.
[2024-06-03 00:51:02] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/419 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 754 unsolved
At refinement iteration 1 (OVERLAPS) 1/420 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 754 unsolved
[2024-06-03 00:51:13] [INFO ] Deduced a trap composed of 86 places in 45 ms of which 0 ms to minimize.
[2024-06-03 00:51:14] [INFO ] Deduced a trap composed of 86 places in 49 ms of which 0 ms to minimize.
[2024-06-03 00:51:14] [INFO ] Deduced a trap composed of 29 places in 44 ms of which 1 ms to minimize.
[2024-06-03 00:51:14] [INFO ] Deduced a trap composed of 86 places in 49 ms of which 1 ms to minimize.
[2024-06-03 00:51:15] [INFO ] Deduced a trap composed of 55 places in 104 ms of which 1 ms to minimize.
[2024-06-03 00:51:15] [INFO ] Deduced a trap composed of 56 places in 120 ms of which 2 ms to minimize.
[2024-06-03 00:51:15] [INFO ] Deduced a trap composed of 74 places in 111 ms of which 1 ms to minimize.
[2024-06-03 00:51:19] [INFO ] Deduced a trap composed of 73 places in 43 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/420 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 754 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/420 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 754 unsolved
At refinement iteration 4 (OVERLAPS) 755/1175 variables, 420/438 constraints. Problems are: Problem set: 0 solved, 754 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1175/1175 variables, and 438 constraints, problems are : Problem set: 0 solved, 754 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 420/420 constraints, PredecessorRefiner: 754/754 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 754 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/419 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 754 unsolved
At refinement iteration 1 (OVERLAPS) 1/420 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 754 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/420 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 754 unsolved
[2024-06-03 00:51:40] [INFO ] Deduced a trap composed of 75 places in 57 ms of which 0 ms to minimize.
[2024-06-03 00:51:40] [INFO ] Deduced a trap composed of 73 places in 48 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/420 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 754 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/420 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 754 unsolved
At refinement iteration 5 (OVERLAPS) 755/1175 variables, 420/440 constraints. Problems are: Problem set: 0 solved, 754 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1175 variables, 754/1194 constraints. Problems are: Problem set: 0 solved, 754 unsolved
[2024-06-03 00:51:57] [INFO ] Deduced a trap composed of 223 places in 129 ms of which 2 ms to minimize.
[2024-06-03 00:51:59] [INFO ] Deduced a trap composed of 133 places in 139 ms of which 2 ms to minimize.
[2024-06-03 00:51:59] [INFO ] Deduced a trap composed of 135 places in 136 ms of which 2 ms to minimize.
[2024-06-03 00:52:00] [INFO ] Deduced a trap composed of 217 places in 133 ms of which 2 ms to minimize.
[2024-06-03 00:52:00] [INFO ] Deduced a trap composed of 211 places in 134 ms of which 2 ms to minimize.
[2024-06-03 00:52:01] [INFO ] Deduced a trap composed of 73 places in 114 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1175/1175 variables, and 1200 constraints, problems are : Problem set: 0 solved, 754 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 420/420 constraints, PredecessorRefiner: 754/754 constraints, Known Traps: 16/16 constraints]
After SMT, in 60307ms problems are : Problem set: 0 solved, 754 unsolved
Search for dead transitions found 0 dead transitions in 60314ms
Finished structural reductions in LTL mode , in 1 iterations and 60913 ms. Remains : 420/420 places, 755/755 transitions.
Treatment of property FireWire-PT-19-LTLFireability-15 finished in 213232 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) U p1)) U p2) U G(!p3)))'
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((G(F(((!p0&&X(p1)) U (G((!p0&&X(p1)))||(!p0&&X((p1&&X(p2))))))))||(X(p1)&&F(((!p0&&X(p1)) U (G((!p0&&X(p1)))||(!p0&&X((p1&&X(p2)))))))))))))'
[2024-06-03 00:52:03] [INFO ] Flatten gal took : 41 ms
[2024-06-03 00:52:03] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLFireability.sr.xml took 1 ms.
[2024-06-03 00:52:03] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 434 places, 771 transitions and 2382 arcs took 6 ms.
Total runtime 1232064 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------
Running FireWire-PT-19
IS_COLORED=
IS_NUPN=
LOADING PETRI NET FILE /home/mcc/execution/405/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 434
TRANSITIONS: 771
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.017s, Sys 0.000s]
SAVING FILE /home/mcc/execution/405/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: 2670
MODEL NAME: /home/mcc/execution/405/model
434 places, 771 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-19-LTLFireability-09 CANNOT_COMPUTE
FORMULA FireWire-PT-19-LTLFireability-15 CANNOT_COMPUTE
Ok.
EXITCODE: 0
----------------------------------------------------------------------
BK_STOP 1717376461730
--------------------
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//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ 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 4194304 at unique_table.cc, line 313
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-19"
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-19, 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-171734898300316"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/FireWire-PT-19.tgz
mv FireWire-PT-19 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 ;