About the Execution of ITS-Tools for FireWire-PT-13
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 7572.376 | 3600000.00 | 8013016.00 | 5341.80 | TFFFFFFFFFFFF?FF | 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.r550-tall-171734899000268.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 itstools
Input is FireWire-PT-13, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r550-tall-171734899000268
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 560K
-rw-r--r-- 1 mcc users 6.0K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 63K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K 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 17K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 12K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 126K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 49K 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 153K 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-13-LTLFireability-00
FORMULA_NAME FireWire-PT-13-LTLFireability-01
FORMULA_NAME FireWire-PT-13-LTLFireability-02
FORMULA_NAME FireWire-PT-13-LTLFireability-03
FORMULA_NAME FireWire-PT-13-LTLFireability-04
FORMULA_NAME FireWire-PT-13-LTLFireability-05
FORMULA_NAME FireWire-PT-13-LTLFireability-06
FORMULA_NAME FireWire-PT-13-LTLFireability-07
FORMULA_NAME FireWire-PT-13-LTLFireability-08
FORMULA_NAME FireWire-PT-13-LTLFireability-09
FORMULA_NAME FireWire-PT-13-LTLFireability-10
FORMULA_NAME FireWire-PT-13-LTLFireability-11
FORMULA_NAME FireWire-PT-13-LTLFireability-12
FORMULA_NAME FireWire-PT-13-LTLFireability-13
FORMULA_NAME FireWire-PT-13-LTLFireability-14
FORMULA_NAME FireWire-PT-13-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1717365595224
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FireWire-PT-13
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202405141337
[2024-06-02 21:59:56] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-06-02 21:59:56] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 21:59:56] [INFO ] Load time of PNML (sax parser for PT used): 92 ms
[2024-06-02 21:59:56] [INFO ] Transformed 205 places.
[2024-06-02 21:59:56] [INFO ] Transformed 610 transitions.
[2024-06-02 21:59:56] [INFO ] Found NUPN structural information;
[2024-06-02 21:59:56] [INFO ] Parsed PT model containing 205 places and 610 transitions and 2309 arcs in 191 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 4 formulas.
Ensure Unique test removed 68 transitions
Reduce redundant transitions removed 68 transitions.
FORMULA FireWire-PT-13-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-13-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-13-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-13-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 40 out of 205 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 205/205 places, 542/542 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 201 transition count 534
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 201 transition count 534
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 9 place count 201 transition count 533
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 10 place count 200 transition count 530
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 200 transition count 530
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 12 place count 199 transition count 528
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 199 transition count 528
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 14 place count 198 transition count 525
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 198 transition count 525
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 16 place count 197 transition count 523
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 197 transition count 523
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 23 place count 197 transition count 517
Applied a total of 23 rules in 76 ms. Remains 197 /205 variables (removed 8) and now considering 517/542 (removed 25) transitions.
[2024-06-02 21:59:56] [INFO ] Flow matrix only has 485 transitions (discarded 32 similar events)
// Phase 1: matrix 485 rows 197 cols
[2024-06-02 21:59:56] [INFO ] Computed 10 invariants in 24 ms
[2024-06-02 21:59:57] [INFO ] Implicit Places using invariants in 277 ms returned []
[2024-06-02 21:59:57] [INFO ] Flow matrix only has 485 transitions (discarded 32 similar events)
[2024-06-02 21:59:57] [INFO ] Invariant cache hit.
[2024-06-02 21:59:57] [INFO ] State equation strengthened by 71 read => feed constraints.
[2024-06-02 21:59:57] [INFO ] Implicit Places using invariants and state equation in 541 ms returned [21, 83, 142]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 848 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 194/205 places, 517/542 transitions.
Applied a total of 0 rules in 6 ms. Remains 194 /194 variables (removed 0) and now considering 517/517 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 948 ms. Remains : 194/205 places, 517/542 transitions.
Support contains 40 out of 194 places after structural reductions.
[2024-06-02 21:59:57] [INFO ] Flatten gal took : 63 ms
[2024-06-02 21:59:57] [INFO ] Flatten gal took : 36 ms
[2024-06-02 21:59:58] [INFO ] Input system was already deterministic with 517 transitions.
Reduction of identical properties reduced properties to check from 32 to 30
RANDOM walk for 40000 steps (1161 resets) in 2192 ms. (18 steps per ms) remains 9/30 properties
BEST_FIRST walk for 40003 steps (35 resets) in 148 ms. (268 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (9 resets) in 103 ms. (384 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (49 resets) in 89 ms. (444 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (242 resets) in 85 ms. (465 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (259 resets) in 127 ms. (312 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (239 resets) in 65 ms. (606 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (225 resets) in 65 ms. (606 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (256 resets) in 100 ms. (396 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (245 resets) in 95 ms. (416 steps per ms) remains 9/9 properties
[2024-06-02 21:59:59] [INFO ] Flow matrix only has 485 transitions (discarded 32 similar events)
// Phase 1: matrix 485 rows 194 cols
[2024-06-02 21:59:59] [INFO ] Computed 7 invariants in 4 ms
[2024-06-02 21:59:59] [INFO ] State equation strengthened by 71 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Problem AtomicPropp13 is UNSAT
At refinement iteration 1 (OVERLAPS) 158/171 variables, 4/4 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/171 variables, 0/4 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 9/180 variables, 3/7 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/180 variables, 0/7 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 473/653 variables, 180/187 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/653 variables, 67/254 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/653 variables, 0/254 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 8 (OVERLAPS) 25/678 variables, 14/268 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/678 variables, 3/271 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/678 variables, 0/271 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 11 (OVERLAPS) 1/679 variables, 1/272 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/679 variables, 0/272 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 13 (OVERLAPS) 0/679 variables, 0/272 constraints. Problems are: Problem set: 1 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 679/679 variables, and 272 constraints, problems are : Problem set: 1 solved, 8 unsolved in 775 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 194/194 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 162/171 variables, 4/4 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/171 variables, 0/4 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 9/180 variables, 3/7 constraints. Problems are: Problem set: 1 solved, 8 unsolved
[2024-06-02 22:00:00] [INFO ] Deduced a trap composed of 36 places in 56 ms of which 12 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/180 variables, 1/8 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/180 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 6 (OVERLAPS) 473/653 variables, 180/188 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/653 variables, 67/255 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/653 variables, 7/262 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/653 variables, 0/262 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 10 (OVERLAPS) 25/678 variables, 14/276 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/678 variables, 3/279 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/678 variables, 1/280 constraints. Problems are: Problem set: 1 solved, 8 unsolved
[2024-06-02 22:00:00] [INFO ] Deduced a trap composed of 44 places in 41 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/678 variables, 1/281 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/678 variables, 0/281 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 15 (OVERLAPS) 1/679 variables, 1/282 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/679 variables, 0/282 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 17 (OVERLAPS) 0/679 variables, 0/282 constraints. Problems are: Problem set: 1 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 679/679 variables, and 282 constraints, problems are : Problem set: 1 solved, 8 unsolved in 1769 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 194/194 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 8/9 constraints, Known Traps: 2/2 constraints]
After SMT, in 2639ms problems are : Problem set: 1 solved, 8 unsolved
Fused 8 Parikh solutions to 6 different solutions.
Parikh walk visited 0 properties in 8058 ms.
Support contains 9 out of 194 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 194/194 places, 517/517 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 194 transition count 514
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 3 Pre rules applied. Total rules applied 3 place count 194 transition count 511
Deduced a syphon composed of 3 places in 12 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 9 place count 191 transition count 511
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 11 place count 189 transition count 507
Iterating global reduction 1 with 2 rules applied. Total rules applied 13 place count 189 transition count 507
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 15 place count 189 transition count 505
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 19 place count 187 transition count 503
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -6
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 25 place count 184 transition count 509
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 31 place count 184 transition count 503
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 34 place count 184 transition count 500
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 3 with 3 rules applied. Total rules applied 37 place count 184 transition count 506
Reduce places removed 3 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 46 place count 181 transition count 500
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 52 place count 181 transition count 494
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 53 place count 180 transition count 493
Applied a total of 53 rules in 126 ms. Remains 180 /194 variables (removed 14) and now considering 493/517 (removed 24) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 126 ms. Remains : 180/194 places, 493/517 transitions.
RANDOM walk for 40000 steps (1284 resets) in 1308 ms. (30 steps per ms) remains 7/8 properties
BEST_FIRST walk for 40004 steps (32 resets) in 413 ms. (96 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (45 resets) in 99 ms. (400 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (278 resets) in 81 ms. (487 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (282 resets) in 86 ms. (459 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (281 resets) in 112 ms. (354 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (280 resets) in 94 ms. (421 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (270 resets) in 80 ms. (493 steps per ms) remains 7/7 properties
[2024-06-02 22:00:10] [INFO ] Flow matrix only has 456 transitions (discarded 37 similar events)
// Phase 1: matrix 456 rows 180 cols
[2024-06-02 22:00:10] [INFO ] Computed 7 invariants in 3 ms
[2024-06-02 22:00:10] [INFO ] State equation strengthened by 69 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 154/162 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/162 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 445/607 variables, 162/166 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/607 variables, 69/235 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/607 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 27/634 variables, 16/251 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/634 variables, 3/254 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/634 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (OVERLAPS) 2/636 variables, 2/256 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/636 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (OVERLAPS) 0/636 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 636/636 variables, and 256 constraints, problems are : Problem set: 0 solved, 7 unsolved in 462 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 180/180 constraints, ReadFeed: 69/69 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 154/162 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/162 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 445/607 variables, 162/166 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/607 variables, 69/235 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/607 variables, 6/241 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/607 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 27/634 variables, 16/257 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/634 variables, 3/260 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/634 variables, 1/261 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-06-02 22:00:11] [INFO ] Deduced a trap composed of 40 places in 45 ms of which 1 ms to minimize.
[2024-06-02 22:00:11] [INFO ] Deduced a trap composed of 32 places in 44 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/634 variables, 2/263 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/634 variables, 0/263 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (OVERLAPS) 2/636 variables, 2/265 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/636 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 14 (OVERLAPS) 0/636 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 636/636 variables, and 265 constraints, problems are : Problem set: 0 solved, 7 unsolved in 1420 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 180/180 constraints, ReadFeed: 69/69 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 2/2 constraints]
After SMT, in 1908ms problems are : Problem set: 0 solved, 7 unsolved
Fused 7 Parikh solutions to 6 different solutions.
Parikh walk visited 0 properties in 4743 ms.
Support contains 8 out of 180 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 180/180 places, 493/493 transitions.
Applied a total of 0 rules in 11 ms. Remains 180 /180 variables (removed 0) and now considering 493/493 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 180/180 places, 493/493 transitions.
RANDOM walk for 40000 steps (1342 resets) in 207 ms. (192 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (48 resets) in 57 ms. (689 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (55 resets) in 52 ms. (754 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (277 resets) in 39 ms. (1000 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40001 steps (294 resets) in 52 ms. (754 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (262 resets) in 73 ms. (540 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (276 resets) in 83 ms. (476 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (264 resets) in 67 ms. (588 steps per ms) remains 7/7 properties
Interrupted probabilistic random walk after 506437 steps, run timeout after 3001 ms. (steps per millisecond=168 ) properties seen :0 out of 7
Probabilistic random walk after 506437 steps, saw 126554 distinct states, run finished after 3010 ms. (steps per millisecond=168 ) properties seen :0
[2024-06-02 22:00:20] [INFO ] Flow matrix only has 456 transitions (discarded 37 similar events)
[2024-06-02 22:00:20] [INFO ] Invariant cache hit.
[2024-06-02 22:00:20] [INFO ] State equation strengthened by 69 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 154/162 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/162 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 445/607 variables, 162/166 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/607 variables, 69/235 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/607 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 27/634 variables, 16/251 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/634 variables, 3/254 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/634 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (OVERLAPS) 2/636 variables, 2/256 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/636 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (OVERLAPS) 0/636 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 636/636 variables, and 256 constraints, problems are : Problem set: 0 solved, 7 unsolved in 468 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 180/180 constraints, ReadFeed: 69/69 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 154/162 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/162 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 445/607 variables, 162/166 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/607 variables, 69/235 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/607 variables, 6/241 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/607 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 27/634 variables, 16/257 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/634 variables, 3/260 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/634 variables, 1/261 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-06-02 22:00:21] [INFO ] Deduced a trap composed of 40 places in 68 ms of which 1 ms to minimize.
[2024-06-02 22:00:21] [INFO ] Deduced a trap composed of 32 places in 41 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/634 variables, 2/263 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/634 variables, 0/263 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (OVERLAPS) 2/636 variables, 2/265 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/636 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 14 (OVERLAPS) 0/636 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 636/636 variables, and 265 constraints, problems are : Problem set: 0 solved, 7 unsolved in 1341 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 180/180 constraints, ReadFeed: 69/69 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 2/2 constraints]
After SMT, in 1844ms problems are : Problem set: 0 solved, 7 unsolved
Fused 7 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 732 ms.
Support contains 8 out of 180 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 180/180 places, 493/493 transitions.
Applied a total of 0 rules in 9 ms. Remains 180 /180 variables (removed 0) and now considering 493/493 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 180/180 places, 493/493 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 180/180 places, 493/493 transitions.
Applied a total of 0 rules in 10 ms. Remains 180 /180 variables (removed 0) and now considering 493/493 (removed 0) transitions.
[2024-06-02 22:00:23] [INFO ] Flow matrix only has 456 transitions (discarded 37 similar events)
[2024-06-02 22:00:23] [INFO ] Invariant cache hit.
[2024-06-02 22:00:23] [INFO ] Implicit Places using invariants in 138 ms returned []
[2024-06-02 22:00:23] [INFO ] Flow matrix only has 456 transitions (discarded 37 similar events)
[2024-06-02 22:00:23] [INFO ] Invariant cache hit.
[2024-06-02 22:00:23] [INFO ] State equation strengthened by 69 read => feed constraints.
[2024-06-02 22:00:23] [INFO ] Implicit Places using invariants and state equation in 330 ms returned []
Implicit Place search using SMT with State Equation took 473 ms to find 0 implicit places.
[2024-06-02 22:00:23] [INFO ] Redundant transitions in 29 ms returned []
Running 487 sub problems to find dead transitions.
[2024-06-02 22:00:23] [INFO ] Flow matrix only has 456 transitions (discarded 37 similar events)
[2024-06-02 22:00:23] [INFO ] Invariant cache hit.
[2024-06-02 22:00:23] [INFO ] State equation strengthened by 69 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/180 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 487 unsolved
[2024-06-02 22:00:26] [INFO ] Deduced a trap composed of 64 places in 114 ms of which 1 ms to minimize.
[2024-06-02 22:00:26] [INFO ] Deduced a trap composed of 67 places in 97 ms of which 2 ms to minimize.
[2024-06-02 22:00:26] [INFO ] Deduced a trap composed of 63 places in 101 ms of which 2 ms to minimize.
[2024-06-02 22:00:26] [INFO ] Deduced a trap composed of 32 places in 35 ms of which 0 ms to minimize.
[2024-06-02 22:00:26] [INFO ] Deduced a trap composed of 23 places in 92 ms of which 3 ms to minimize.
[2024-06-02 22:00:27] [INFO ] Deduced a trap composed of 17 places in 89 ms of which 1 ms to minimize.
[2024-06-02 22:00:27] [INFO ] Deduced a trap composed of 29 places in 87 ms of which 3 ms to minimize.
[2024-06-02 22:00:27] [INFO ] Deduced a trap composed of 32 places in 37 ms of which 1 ms to minimize.
[2024-06-02 22:00:28] [INFO ] Deduced a trap composed of 25 places in 86 ms of which 1 ms to minimize.
[2024-06-02 22:00:28] [INFO ] Deduced a trap composed of 32 places in 35 ms of which 1 ms to minimize.
[2024-06-02 22:00:29] [INFO ] Deduced a trap composed of 17 places in 77 ms of which 1 ms to minimize.
[2024-06-02 22:00:29] [INFO ] Deduced a trap composed of 113 places in 86 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/180 variables, 12/19 constraints. Problems are: Problem set: 0 solved, 487 unsolved
[2024-06-02 22:00:30] [INFO ] Deduced a trap composed of 17 places in 88 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/180 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 487 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/180 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 487 unsolved
At refinement iteration 4 (OVERLAPS) 456/636 variables, 180/200 constraints. Problems are: Problem set: 0 solved, 487 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/636 variables, 69/269 constraints. Problems are: Problem set: 0 solved, 487 unsolved
[2024-06-02 22:00:36] [INFO ] Deduced a trap composed of 40 places in 31 ms of which 1 ms to minimize.
[2024-06-02 22:00:38] [INFO ] Deduced a trap composed of 40 places in 38 ms of which 1 ms to minimize.
[2024-06-02 22:00:39] [INFO ] Deduced a trap composed of 40 places in 36 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/636 variables, 3/272 constraints. Problems are: Problem set: 0 solved, 487 unsolved
[2024-06-02 22:00:47] [INFO ] Deduced a trap composed of 43 places in 45 ms of which 1 ms to minimize.
[2024-06-02 22:00:47] [INFO ] Deduced a trap composed of 40 places in 40 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/636 variables, 2/274 constraints. Problems are: Problem set: 0 solved, 487 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/636 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 487 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 1.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 1.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 1.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 1.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 636/636 variables, and 274 constraints, problems are : Problem set: 0 solved, 487 unsolved in 30041 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 180/180 constraints, ReadFeed: 69/69 constraints, PredecessorRefiner: 487/487 constraints, Known Traps: 18/18 constraints]
Escalating to Integer solving :Problem set: 0 solved, 487 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/180 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 487 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/180 variables, 18/25 constraints. Problems are: Problem set: 0 solved, 487 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/180 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 487 unsolved
At refinement iteration 3 (OVERLAPS) 456/636 variables, 180/205 constraints. Problems are: Problem set: 0 solved, 487 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/636 variables, 69/274 constraints. Problems are: Problem set: 0 solved, 487 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/636 variables, 487/761 constraints. Problems are: Problem set: 0 solved, 487 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/636 variables, 0/761 constraints. Problems are: Problem set: 0 solved, 487 unsolved
[2024-06-02 22:01:17] [INFO ] Deduced a trap composed of 43 places in 49 ms of which 2 ms to minimize.
At refinement iteration 7 (OVERLAPS) 0/636 variables, 1/762 constraints. Problems are: Problem set: 0 solved, 487 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 636/636 variables, and 762 constraints, problems are : Problem set: 0 solved, 487 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 180/180 constraints, ReadFeed: 69/69 constraints, PredecessorRefiner: 487/487 constraints, Known Traps: 19/19 constraints]
After SMT, in 60623ms problems are : Problem set: 0 solved, 487 unsolved
Search for dead transitions found 0 dead transitions in 60629ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61157 ms. Remains : 180/180 places, 493/493 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 147 edges and 180 vertex of which 29 / 180 are part of one of the 4 SCC in 2 ms
Free SCC test removed 25 places
Drop transitions (Empty/Sink Transition effects.) removed 123 transitions
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 144 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 154 transition count 348
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 0 with 9 rules applied. Total rules applied 12 place count 154 transition count 339
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 153 transition count 338
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 15 place count 153 transition count 337
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 17 place count 152 transition count 336
Free-agglomeration rule applied 9 times with reduction of 6 identical transitions.
Iterating global reduction 0 with 9 rules applied. Total rules applied 26 place count 152 transition count 321
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 38 place count 143 transition count 318
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 44 place count 143 transition count 318
Applied a total of 44 rules in 65 ms. Remains 143 /180 variables (removed 37) and now considering 318/493 (removed 175) transitions.
Running SMT prover for 7 properties.
[2024-06-02 22:01:24] [INFO ] Flow matrix only has 316 transitions (discarded 2 similar events)
// Phase 1: matrix 316 rows 143 cols
[2024-06-02 22:01:24] [INFO ] Computed 7 invariants in 1 ms
[2024-06-02 22:01:24] [INFO ] [Real]Absence check using 7 positive place invariants in 1 ms returned sat
[2024-06-02 22:01:24] [INFO ] After 166ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2024-06-02 22:01:24] [INFO ] [Nat]Absence check using 7 positive place invariants in 1 ms returned sat
[2024-06-02 22:01:24] [INFO ] After 174ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
TRAPS : Iteration 0
[2024-06-02 22:01:24] [INFO ] Deduced a trap composed of 21 places in 46 ms of which 1 ms to minimize.
[2024-06-02 22:01:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 65 ms
[2024-06-02 22:01:25] [INFO ] Deduced a trap composed of 29 places in 35 ms of which 0 ms to minimize.
[2024-06-02 22:01:25] [INFO ] Deduced a trap composed of 21 places in 24 ms of which 0 ms to minimize.
[2024-06-02 22:01:25] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 85 ms
TRAPS : Iteration 1
[2024-06-02 22:01:25] [INFO ] After 629ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
[2024-06-02 22:01:25] [INFO ] After 812ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Over-approximation ignoring read arcs solved 0 properties in 1067 ms.
Successfully simplified 1 atomic propositions for a total of 12 simplifications.
FORMULA FireWire-PT-13-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 51 stabilizing places and 120 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((F(p0)||X(G((p1||X(G(p2))))))))'
Support contains 6 out of 194 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 194/194 places, 517/517 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 189 transition count 504
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 189 transition count 504
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 12 place count 189 transition count 502
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 15 place count 186 transition count 496
Iterating global reduction 1 with 3 rules applied. Total rules applied 18 place count 186 transition count 496
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 21 place count 183 transition count 487
Iterating global reduction 1 with 3 rules applied. Total rules applied 24 place count 183 transition count 487
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 27 place count 180 transition count 481
Iterating global reduction 1 with 3 rules applied. Total rules applied 30 place count 180 transition count 481
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 32 place count 178 transition count 475
Iterating global reduction 1 with 2 rules applied. Total rules applied 34 place count 178 transition count 475
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 36 place count 176 transition count 471
Iterating global reduction 1 with 2 rules applied. Total rules applied 38 place count 176 transition count 471
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 40 place count 174 transition count 465
Iterating global reduction 1 with 2 rules applied. Total rules applied 42 place count 174 transition count 465
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 44 place count 172 transition count 461
Iterating global reduction 1 with 2 rules applied. Total rules applied 46 place count 172 transition count 461
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 48 place count 170 transition count 455
Iterating global reduction 1 with 2 rules applied. Total rules applied 50 place count 170 transition count 455
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 52 place count 168 transition count 451
Iterating global reduction 1 with 2 rules applied. Total rules applied 54 place count 168 transition count 451
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 55 place count 167 transition count 449
Iterating global reduction 1 with 1 rules applied. Total rules applied 56 place count 167 transition count 449
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 57 place count 166 transition count 447
Iterating global reduction 1 with 1 rules applied. Total rules applied 58 place count 166 transition count 447
Applied a total of 58 rules in 23 ms. Remains 166 /194 variables (removed 28) and now considering 447/517 (removed 70) transitions.
[2024-06-02 22:01:25] [INFO ] Flow matrix only has 415 transitions (discarded 32 similar events)
// Phase 1: matrix 415 rows 166 cols
[2024-06-02 22:01:25] [INFO ] Computed 7 invariants in 6 ms
[2024-06-02 22:01:25] [INFO ] Implicit Places using invariants in 85 ms returned []
[2024-06-02 22:01:25] [INFO ] Flow matrix only has 415 transitions (discarded 32 similar events)
[2024-06-02 22:01:25] [INFO ] Invariant cache hit.
[2024-06-02 22:01:25] [INFO ] State equation strengthened by 59 read => feed constraints.
[2024-06-02 22:01:26] [INFO ] Implicit Places using invariants and state equation in 278 ms returned []
Implicit Place search using SMT with State Equation took 365 ms to find 0 implicit places.
Running 446 sub problems to find dead transitions.
[2024-06-02 22:01:26] [INFO ] Flow matrix only has 415 transitions (discarded 32 similar events)
[2024-06-02 22:01:26] [INFO ] Invariant cache hit.
[2024-06-02 22:01:26] [INFO ] State equation strengthened by 59 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/165 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 446 unsolved
At refinement iteration 1 (OVERLAPS) 1/166 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 446 unsolved
[2024-06-02 22:01:29] [INFO ] Deduced a trap composed of 55 places in 79 ms of which 2 ms to minimize.
[2024-06-02 22:01:29] [INFO ] Deduced a trap composed of 17 places in 73 ms of which 1 ms to minimize.
[2024-06-02 22:01:29] [INFO ] Deduced a trap composed of 25 places in 77 ms of which 1 ms to minimize.
[2024-06-02 22:01:29] [INFO ] Deduced a trap composed of 35 places in 34 ms of which 1 ms to minimize.
[2024-06-02 22:01:30] [INFO ] Deduced a trap composed of 26 places in 108 ms of which 1 ms to minimize.
[2024-06-02 22:01:30] [INFO ] Deduced a trap composed of 35 places in 28 ms of which 1 ms to minimize.
[2024-06-02 22:01:30] [INFO ] Deduced a trap composed of 24 places in 70 ms of which 3 ms to minimize.
[2024-06-02 22:01:30] [INFO ] Deduced a trap composed of 35 places in 37 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/166 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 446 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/166 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 446 unsolved
At refinement iteration 4 (OVERLAPS) 414/580 variables, 166/181 constraints. Problems are: Problem set: 0 solved, 446 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/580 variables, 58/239 constraints. Problems are: Problem set: 0 solved, 446 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/580 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 446 unsolved
At refinement iteration 7 (OVERLAPS) 1/581 variables, 1/240 constraints. Problems are: Problem set: 0 solved, 446 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/581 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 446 unsolved
At refinement iteration 9 (OVERLAPS) 0/581 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 446 unsolved
No progress, stopping.
After SMT solving in domain Real declared 581/581 variables, and 240 constraints, problems are : Problem set: 0 solved, 446 unsolved in 25387 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 166/166 constraints, ReadFeed: 59/59 constraints, PredecessorRefiner: 446/446 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 446 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/165 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 446 unsolved
At refinement iteration 1 (OVERLAPS) 1/166 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 446 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/166 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 446 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/166 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 446 unsolved
At refinement iteration 4 (OVERLAPS) 414/580 variables, 166/181 constraints. Problems are: Problem set: 0 solved, 446 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/580 variables, 58/239 constraints. Problems are: Problem set: 0 solved, 446 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/580 variables, 446/685 constraints. Problems are: Problem set: 0 solved, 446 unsolved
[2024-06-02 22:02:00] [INFO ] Deduced a trap composed of 43 places in 33 ms of which 0 ms to minimize.
[2024-06-02 22:02:05] [INFO ] Deduced a trap composed of 43 places in 46 ms of which 1 ms to minimize.
[2024-06-02 22:02:06] [INFO ] Deduced a trap composed of 37 places in 45 ms of which 1 ms to minimize.
[2024-06-02 22:02:07] [INFO ] Deduced a trap composed of 39 places in 51 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/580 variables, 4/689 constraints. Problems are: Problem set: 0 solved, 446 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/580 variables, 0/689 constraints. Problems are: Problem set: 0 solved, 446 unsolved
SMT process timed out in 55728ms, After SMT, problems are : Problem set: 0 solved, 446 unsolved
Search for dead transitions found 0 dead transitions in 55731ms
Starting structural reductions in LTL mode, iteration 1 : 166/194 places, 447/517 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 56132 ms. Remains : 166/194 places, 447/517 transitions.
Stuttering acceptance computed with spot in 342 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p0)]
Running random walk in product with property : FireWire-PT-13-LTLFireability-00
Product exploration explored 100000 steps with 50000 reset in 281 ms.
Product exploration explored 100000 steps with 50000 reset in 172 ms.
Computed a total of 25 stabilizing places and 56 stable transitions
Computed a total of 25 stabilizing places and 56 stable transitions
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1)), (X p0), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 6 factoid took 146 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-13-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FireWire-PT-13-LTLFireability-00 finished in 57156 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((F(G(p0))&&(p1||G(p2)))))'
Support contains 6 out of 194 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 194/194 places, 517/517 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 3 Pre rules applied. Total rules applied 0 place count 193 transition count 513
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 190 transition count 513
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 10 place count 186 transition count 502
Iterating global reduction 0 with 4 rules applied. Total rules applied 14 place count 186 transition count 502
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 15 place count 186 transition count 501
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 18 place count 183 transition count 495
Iterating global reduction 1 with 3 rules applied. Total rules applied 21 place count 183 transition count 495
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 24 place count 180 transition count 486
Iterating global reduction 1 with 3 rules applied. Total rules applied 27 place count 180 transition count 486
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 30 place count 177 transition count 480
Iterating global reduction 1 with 3 rules applied. Total rules applied 33 place count 177 transition count 480
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 36 place count 174 transition count 471
Iterating global reduction 1 with 3 rules applied. Total rules applied 39 place count 174 transition count 471
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 42 place count 171 transition count 465
Iterating global reduction 1 with 3 rules applied. Total rules applied 45 place count 171 transition count 465
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 48 place count 168 transition count 457
Iterating global reduction 1 with 3 rules applied. Total rules applied 51 place count 168 transition count 457
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 54 place count 165 transition count 451
Iterating global reduction 1 with 3 rules applied. Total rules applied 57 place count 165 transition count 451
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 59 place count 163 transition count 445
Iterating global reduction 1 with 2 rules applied. Total rules applied 61 place count 163 transition count 445
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 63 place count 161 transition count 441
Iterating global reduction 1 with 2 rules applied. Total rules applied 65 place count 161 transition count 441
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 67 place count 159 transition count 437
Iterating global reduction 1 with 2 rules applied. Total rules applied 69 place count 159 transition count 437
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 71 place count 157 transition count 433
Iterating global reduction 1 with 2 rules applied. Total rules applied 73 place count 157 transition count 433
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 79 place count 154 transition count 430
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 85 place count 151 transition count 436
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 91 place count 151 transition count 430
Applied a total of 91 rules in 88 ms. Remains 151 /194 variables (removed 43) and now considering 430/517 (removed 87) transitions.
[2024-06-02 22:02:23] [INFO ] Flow matrix only has 391 transitions (discarded 39 similar events)
// Phase 1: matrix 391 rows 151 cols
[2024-06-02 22:02:23] [INFO ] Computed 7 invariants in 1 ms
[2024-06-02 22:02:23] [INFO ] Implicit Places using invariants in 374 ms returned []
[2024-06-02 22:02:23] [INFO ] Flow matrix only has 391 transitions (discarded 39 similar events)
[2024-06-02 22:02:23] [INFO ] Invariant cache hit.
[2024-06-02 22:02:23] [INFO ] State equation strengthened by 56 read => feed constraints.
[2024-06-02 22:02:23] [INFO ] Implicit Places using invariants and state equation in 228 ms returned []
Implicit Place search using SMT with State Equation took 618 ms to find 0 implicit places.
[2024-06-02 22:02:23] [INFO ] Redundant transitions in 8 ms returned []
Running 423 sub problems to find dead transitions.
[2024-06-02 22:02:23] [INFO ] Flow matrix only has 391 transitions (discarded 39 similar events)
[2024-06-02 22:02:23] [INFO ] Invariant cache hit.
[2024-06-02 22:02:23] [INFO ] State equation strengthened by 56 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/151 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 423 unsolved
[2024-06-02 22:02:25] [INFO ] Deduced a trap composed of 60 places in 67 ms of which 1 ms to minimize.
[2024-06-02 22:02:25] [INFO ] Deduced a trap composed of 33 places in 37 ms of which 0 ms to minimize.
[2024-06-02 22:02:25] [INFO ] Deduced a trap composed of 28 places in 73 ms of which 1 ms to minimize.
[2024-06-02 22:02:25] [INFO ] Deduced a trap composed of 17 places in 71 ms of which 1 ms to minimize.
[2024-06-02 22:02:25] [INFO ] Deduced a trap composed of 34 places in 36 ms of which 1 ms to minimize.
[2024-06-02 22:02:26] [INFO ] Deduced a trap composed of 17 places in 72 ms of which 1 ms to minimize.
[2024-06-02 22:02:26] [INFO ] Deduced a trap composed of 29 places in 102 ms of which 1 ms to minimize.
[2024-06-02 22:02:26] [INFO ] Deduced a trap composed of 33 places in 32 ms of which 0 ms to minimize.
[2024-06-02 22:02:26] [INFO ] Deduced a trap composed of 27 places in 71 ms of which 1 ms to minimize.
[2024-06-02 22:02:26] [INFO ] Deduced a trap composed of 25 places in 79 ms of which 1 ms to minimize.
[2024-06-02 22:02:26] [INFO ] Deduced a trap composed of 23 places in 70 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/151 variables, 11/18 constraints. Problems are: Problem set: 0 solved, 423 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/151 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 423 unsolved
At refinement iteration 3 (OVERLAPS) 390/541 variables, 151/169 constraints. Problems are: Problem set: 0 solved, 423 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/541 variables, 56/225 constraints. Problems are: Problem set: 0 solved, 423 unsolved
[2024-06-02 22:02:31] [INFO ] Deduced a trap composed of 56 places in 81 ms of which 1 ms to minimize.
[2024-06-02 22:02:31] [INFO ] Deduced a trap composed of 53 places in 82 ms of which 1 ms to minimize.
[2024-06-02 22:02:34] [INFO ] Deduced a trap composed of 32 places in 44 ms of which 0 ms to minimize.
[2024-06-02 22:02:34] [INFO ] Deduced a trap composed of 32 places in 51 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/541 variables, 4/229 constraints. Problems are: Problem set: 0 solved, 423 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/541 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 423 unsolved
At refinement iteration 7 (OVERLAPS) 0/541 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 423 unsolved
No progress, stopping.
After SMT solving in domain Real declared 541/542 variables, and 229 constraints, problems are : Problem set: 0 solved, 423 unsolved in 20202 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 151/151 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 423/423 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 423 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/151 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 423 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/151 variables, 15/22 constraints. Problems are: Problem set: 0 solved, 423 unsolved
[2024-06-02 22:02:45] [INFO ] Deduced a trap composed of 17 places in 75 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/151 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 423 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/151 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 423 unsolved
At refinement iteration 4 (OVERLAPS) 390/541 variables, 151/174 constraints. Problems are: Problem set: 0 solved, 423 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/541 variables, 56/230 constraints. Problems are: Problem set: 0 solved, 423 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/541 variables, 423/653 constraints. Problems are: Problem set: 0 solved, 423 unsolved
[2024-06-02 22:02:51] [INFO ] Deduced a trap composed of 32 places in 64 ms of which 12 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/541 variables, 1/654 constraints. Problems are: Problem set: 0 solved, 423 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/541 variables, 0/654 constraints. Problems are: Problem set: 0 solved, 423 unsolved
At refinement iteration 9 (OVERLAPS) 0/541 variables, 0/654 constraints. Problems are: Problem set: 0 solved, 423 unsolved
No progress, stopping.
After SMT solving in domain Int declared 541/542 variables, and 654 constraints, problems are : Problem set: 0 solved, 423 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 151/151 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 423/423 constraints, Known Traps: 17/17 constraints]
After SMT, in 50547ms problems are : Problem set: 0 solved, 423 unsolved
Search for dead transitions found 0 dead transitions in 50551ms
Starting structural reductions in SI_LTL mode, iteration 1 : 151/194 places, 430/517 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 51279 ms. Remains : 151/194 places, 430/517 transitions.
Stuttering acceptance computed with spot in 216 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : FireWire-PT-13-LTLFireability-01
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA FireWire-PT-13-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-13-LTLFireability-01 finished in 51528 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' '!((p0 U (p1||X(p2))))'
Support contains 5 out of 194 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 194/194 places, 517/517 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 190 transition count 506
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 190 transition count 506
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 9 place count 190 transition count 505
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 12 place count 187 transition count 499
Iterating global reduction 1 with 3 rules applied. Total rules applied 15 place count 187 transition count 499
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 18 place count 184 transition count 490
Iterating global reduction 1 with 3 rules applied. Total rules applied 21 place count 184 transition count 490
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 24 place count 181 transition count 484
Iterating global reduction 1 with 3 rules applied. Total rules applied 27 place count 181 transition count 484
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 30 place count 178 transition count 475
Iterating global reduction 1 with 3 rules applied. Total rules applied 33 place count 178 transition count 475
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 36 place count 175 transition count 469
Iterating global reduction 1 with 3 rules applied. Total rules applied 39 place count 175 transition count 469
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 42 place count 172 transition count 461
Iterating global reduction 1 with 3 rules applied. Total rules applied 45 place count 172 transition count 461
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 48 place count 169 transition count 455
Iterating global reduction 1 with 3 rules applied. Total rules applied 51 place count 169 transition count 455
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 53 place count 167 transition count 449
Iterating global reduction 1 with 2 rules applied. Total rules applied 55 place count 167 transition count 449
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 57 place count 165 transition count 445
Iterating global reduction 1 with 2 rules applied. Total rules applied 59 place count 165 transition count 445
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 61 place count 163 transition count 441
Iterating global reduction 1 with 2 rules applied. Total rules applied 63 place count 163 transition count 441
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 65 place count 161 transition count 437
Iterating global reduction 1 with 2 rules applied. Total rules applied 67 place count 161 transition count 437
Applied a total of 67 rules in 64 ms. Remains 161 /194 variables (removed 33) and now considering 437/517 (removed 80) transitions.
[2024-06-02 22:03:14] [INFO ] Flow matrix only has 405 transitions (discarded 32 similar events)
// Phase 1: matrix 405 rows 161 cols
[2024-06-02 22:03:14] [INFO ] Computed 7 invariants in 1 ms
[2024-06-02 22:03:14] [INFO ] Implicit Places using invariants in 227 ms returned []
[2024-06-02 22:03:14] [INFO ] Flow matrix only has 405 transitions (discarded 32 similar events)
[2024-06-02 22:03:14] [INFO ] Invariant cache hit.
[2024-06-02 22:03:14] [INFO ] State equation strengthened by 58 read => feed constraints.
[2024-06-02 22:03:14] [INFO ] Implicit Places using invariants and state equation in 275 ms returned []
Implicit Place search using SMT with State Equation took 505 ms to find 0 implicit places.
Running 436 sub problems to find dead transitions.
[2024-06-02 22:03:15] [INFO ] Flow matrix only has 405 transitions (discarded 32 similar events)
[2024-06-02 22:03:15] [INFO ] Invariant cache hit.
[2024-06-02 22:03:15] [INFO ] State equation strengthened by 58 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/160 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 436 unsolved
At refinement iteration 1 (OVERLAPS) 1/161 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 436 unsolved
[2024-06-02 22:03:18] [INFO ] Deduced a trap composed of 56 places in 79 ms of which 1 ms to minimize.
[2024-06-02 22:03:18] [INFO ] Deduced a trap composed of 17 places in 85 ms of which 1 ms to minimize.
[2024-06-02 22:03:18] [INFO ] Deduced a trap composed of 29 places in 93 ms of which 1 ms to minimize.
[2024-06-02 22:03:18] [INFO ] Deduced a trap composed of 35 places in 40 ms of which 0 ms to minimize.
[2024-06-02 22:03:19] [INFO ] Deduced a trap composed of 35 places in 90 ms of which 1 ms to minimize.
[2024-06-02 22:03:19] [INFO ] Deduced a trap composed of 24 places in 95 ms of which 1 ms to minimize.
[2024-06-02 22:03:19] [INFO ] Deduced a trap composed of 27 places in 68 ms of which 2 ms to minimize.
[2024-06-02 22:03:19] [INFO ] Deduced a trap composed of 36 places in 54 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/161 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 436 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/161 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 436 unsolved
At refinement iteration 4 (OVERLAPS) 404/565 variables, 161/176 constraints. Problems are: Problem set: 0 solved, 436 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/565 variables, 57/233 constraints. Problems are: Problem set: 0 solved, 436 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/565 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 436 unsolved
At refinement iteration 7 (OVERLAPS) 1/566 variables, 1/234 constraints. Problems are: Problem set: 0 solved, 436 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/566 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 436 unsolved
At refinement iteration 9 (OVERLAPS) 0/566 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 436 unsolved
No progress, stopping.
After SMT solving in domain Real declared 566/566 variables, and 234 constraints, problems are : Problem set: 0 solved, 436 unsolved in 24183 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 161/161 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 436/436 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 436 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/160 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 436 unsolved
At refinement iteration 1 (OVERLAPS) 1/161 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 436 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/161 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 436 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/161 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 436 unsolved
At refinement iteration 4 (OVERLAPS) 404/565 variables, 161/176 constraints. Problems are: Problem set: 0 solved, 436 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/565 variables, 57/233 constraints. Problems are: Problem set: 0 solved, 436 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/565 variables, 436/669 constraints. Problems are: Problem set: 0 solved, 436 unsolved
[2024-06-02 22:03:49] [INFO ] Deduced a trap composed of 35 places in 50 ms of which 1 ms to minimize.
[2024-06-02 22:03:52] [INFO ] Deduced a trap composed of 56 places in 87 ms of which 1 ms to minimize.
[2024-06-02 22:03:52] [INFO ] Deduced a trap composed of 35 places in 36 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/565 variables, 3/672 constraints. Problems are: Problem set: 0 solved, 436 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/565 variables, 0/672 constraints. Problems are: Problem set: 0 solved, 436 unsolved
At refinement iteration 9 (OVERLAPS) 1/566 variables, 1/673 constraints. Problems are: Problem set: 0 solved, 436 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 566/566 variables, and 673 constraints, problems are : Problem set: 0 solved, 436 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 161/161 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 436/436 constraints, Known Traps: 11/11 constraints]
After SMT, in 54560ms problems are : Problem set: 0 solved, 436 unsolved
Search for dead transitions found 0 dead transitions in 54566ms
Starting structural reductions in LTL mode, iteration 1 : 161/194 places, 437/517 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 55136 ms. Remains : 161/194 places, 437/517 transitions.
Stuttering acceptance computed with spot in 120 ms :[true, (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : FireWire-PT-13-LTLFireability-03
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA FireWire-PT-13-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-13-LTLFireability-03 finished in 55277 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))||(F(!p0)&&X(p2)&&p1)) U X(p3)))'
Support contains 6 out of 194 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 194/194 places, 517/517 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 189 transition count 504
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 189 transition count 504
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 12 place count 189 transition count 502
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 15 place count 186 transition count 496
Iterating global reduction 1 with 3 rules applied. Total rules applied 18 place count 186 transition count 496
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 21 place count 183 transition count 487
Iterating global reduction 1 with 3 rules applied. Total rules applied 24 place count 183 transition count 487
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 27 place count 180 transition count 481
Iterating global reduction 1 with 3 rules applied. Total rules applied 30 place count 180 transition count 481
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 33 place count 177 transition count 472
Iterating global reduction 1 with 3 rules applied. Total rules applied 36 place count 177 transition count 472
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 38 place count 175 transition count 468
Iterating global reduction 1 with 2 rules applied. Total rules applied 40 place count 175 transition count 468
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 42 place count 173 transition count 463
Iterating global reduction 1 with 2 rules applied. Total rules applied 44 place count 173 transition count 463
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 46 place count 171 transition count 459
Iterating global reduction 1 with 2 rules applied. Total rules applied 48 place count 171 transition count 459
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 49 place count 170 transition count 456
Iterating global reduction 1 with 1 rules applied. Total rules applied 50 place count 170 transition count 456
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 51 place count 169 transition count 454
Iterating global reduction 1 with 1 rules applied. Total rules applied 52 place count 169 transition count 454
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 53 place count 168 transition count 452
Iterating global reduction 1 with 1 rules applied. Total rules applied 54 place count 168 transition count 452
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 55 place count 167 transition count 450
Iterating global reduction 1 with 1 rules applied. Total rules applied 56 place count 167 transition count 450
Applied a total of 56 rules in 24 ms. Remains 167 /194 variables (removed 27) and now considering 450/517 (removed 67) transitions.
[2024-06-02 22:04:09] [INFO ] Flow matrix only has 418 transitions (discarded 32 similar events)
// Phase 1: matrix 418 rows 167 cols
[2024-06-02 22:04:09] [INFO ] Computed 7 invariants in 2 ms
[2024-06-02 22:04:09] [INFO ] Implicit Places using invariants in 128 ms returned []
[2024-06-02 22:04:09] [INFO ] Flow matrix only has 418 transitions (discarded 32 similar events)
[2024-06-02 22:04:09] [INFO ] Invariant cache hit.
[2024-06-02 22:04:09] [INFO ] State equation strengthened by 60 read => feed constraints.
[2024-06-02 22:04:10] [INFO ] Implicit Places using invariants and state equation in 261 ms returned []
Implicit Place search using SMT with State Equation took 391 ms to find 0 implicit places.
Running 449 sub problems to find dead transitions.
[2024-06-02 22:04:10] [INFO ] Flow matrix only has 418 transitions (discarded 32 similar events)
[2024-06-02 22:04:10] [INFO ] Invariant cache hit.
[2024-06-02 22:04:10] [INFO ] State equation strengthened by 60 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/166 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 449 unsolved
At refinement iteration 1 (OVERLAPS) 1/167 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 449 unsolved
[2024-06-02 22:04:13] [INFO ] Deduced a trap composed of 60 places in 79 ms of which 1 ms to minimize.
[2024-06-02 22:04:13] [INFO ] Deduced a trap composed of 35 places in 27 ms of which 1 ms to minimize.
[2024-06-02 22:04:13] [INFO ] Deduced a trap composed of 17 places in 79 ms of which 1 ms to minimize.
[2024-06-02 22:04:13] [INFO ] Deduced a trap composed of 25 places in 82 ms of which 1 ms to minimize.
[2024-06-02 22:04:13] [INFO ] Deduced a trap composed of 35 places in 36 ms of which 1 ms to minimize.
[2024-06-02 22:04:14] [INFO ] Deduced a trap composed of 26 places in 81 ms of which 1 ms to minimize.
[2024-06-02 22:04:14] [INFO ] Deduced a trap composed of 35 places in 40 ms of which 1 ms to minimize.
[2024-06-02 22:04:14] [INFO ] Deduced a trap composed of 24 places in 76 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/167 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 449 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/167 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 449 unsolved
At refinement iteration 4 (OVERLAPS) 417/584 variables, 167/182 constraints. Problems are: Problem set: 0 solved, 449 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/584 variables, 59/241 constraints. Problems are: Problem set: 0 solved, 449 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/584 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 449 unsolved
At refinement iteration 7 (OVERLAPS) 1/585 variables, 1/242 constraints. Problems are: Problem set: 0 solved, 449 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/585 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 449 unsolved
At refinement iteration 9 (OVERLAPS) 0/585 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 449 unsolved
No progress, stopping.
After SMT solving in domain Real declared 585/585 variables, and 242 constraints, problems are : Problem set: 0 solved, 449 unsolved in 26069 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 167/167 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 449/449 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 449 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/166 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 449 unsolved
At refinement iteration 1 (OVERLAPS) 1/167 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 449 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/167 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 449 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/167 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 449 unsolved
At refinement iteration 4 (OVERLAPS) 417/584 variables, 167/182 constraints. Problems are: Problem set: 0 solved, 449 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/584 variables, 59/241 constraints. Problems are: Problem set: 0 solved, 449 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/584 variables, 449/690 constraints. Problems are: Problem set: 0 solved, 449 unsolved
[2024-06-02 22:04:44] [INFO ] Deduced a trap composed of 43 places in 39 ms of which 1 ms to minimize.
[2024-06-02 22:04:50] [INFO ] Deduced a trap composed of 35 places in 35 ms of which 1 ms to minimize.
[2024-06-02 22:04:50] [INFO ] Deduced a trap composed of 35 places in 36 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/584 variables, 3/693 constraints. Problems are: Problem set: 0 solved, 449 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/584 variables, 0/693 constraints. Problems are: Problem set: 0 solved, 449 unsolved
At refinement iteration 9 (OVERLAPS) 1/585 variables, 1/694 constraints. Problems are: Problem set: 0 solved, 449 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 585/585 variables, and 694 constraints, problems are : Problem set: 0 solved, 449 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 167/167 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 449/449 constraints, Known Traps: 11/11 constraints]
After SMT, in 56494ms problems are : Problem set: 0 solved, 449 unsolved
Search for dead transitions found 0 dead transitions in 56500ms
Starting structural reductions in LTL mode, iteration 1 : 167/194 places, 450/517 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 56916 ms. Remains : 167/194 places, 450/517 transitions.
Stuttering acceptance computed with spot in 271 ms :[(NOT p3), (NOT p0), (NOT p3), (NOT p3), (OR (NOT p3) (NOT p0))]
Running random walk in product with property : FireWire-PT-13-LTLFireability-04
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 1 ms.
FORMULA FireWire-PT-13-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-13-LTLFireability-04 finished in 57211 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(p0) U p1))'
Support contains 4 out of 194 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 194/194 places, 517/517 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 3 Pre rules applied. Total rules applied 0 place count 193 transition count 513
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 190 transition count 513
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 10 place count 186 transition count 503
Iterating global reduction 0 with 4 rules applied. Total rules applied 14 place count 186 transition count 503
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 16 place count 186 transition count 501
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 18 place count 184 transition count 497
Iterating global reduction 1 with 2 rules applied. Total rules applied 20 place count 184 transition count 497
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 22 place count 182 transition count 491
Iterating global reduction 1 with 2 rules applied. Total rules applied 24 place count 182 transition count 491
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 26 place count 180 transition count 487
Iterating global reduction 1 with 2 rules applied. Total rules applied 28 place count 180 transition count 487
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 30 place count 178 transition count 481
Iterating global reduction 1 with 2 rules applied. Total rules applied 32 place count 178 transition count 481
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 34 place count 176 transition count 477
Iterating global reduction 1 with 2 rules applied. Total rules applied 36 place count 176 transition count 477
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 38 place count 174 transition count 472
Iterating global reduction 1 with 2 rules applied. Total rules applied 40 place count 174 transition count 472
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 42 place count 172 transition count 468
Iterating global reduction 1 with 2 rules applied. Total rules applied 44 place count 172 transition count 468
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 45 place count 171 transition count 465
Iterating global reduction 1 with 1 rules applied. Total rules applied 46 place count 171 transition count 465
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 47 place count 170 transition count 463
Iterating global reduction 1 with 1 rules applied. Total rules applied 48 place count 170 transition count 463
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 49 place count 169 transition count 461
Iterating global reduction 1 with 1 rules applied. Total rules applied 50 place count 169 transition count 461
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 51 place count 168 transition count 459
Iterating global reduction 1 with 1 rules applied. Total rules applied 52 place count 168 transition count 459
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 58 place count 165 transition count 456
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 64 place count 162 transition count 462
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 70 place count 162 transition count 456
Applied a total of 70 rules in 67 ms. Remains 162 /194 variables (removed 32) and now considering 456/517 (removed 61) transitions.
[2024-06-02 22:05:06] [INFO ] Flow matrix only has 417 transitions (discarded 39 similar events)
// Phase 1: matrix 417 rows 162 cols
[2024-06-02 22:05:06] [INFO ] Computed 7 invariants in 2 ms
[2024-06-02 22:05:07] [INFO ] Implicit Places using invariants in 93 ms returned []
[2024-06-02 22:05:07] [INFO ] Flow matrix only has 417 transitions (discarded 39 similar events)
[2024-06-02 22:05:07] [INFO ] Invariant cache hit.
[2024-06-02 22:05:07] [INFO ] State equation strengthened by 61 read => feed constraints.
[2024-06-02 22:05:07] [INFO ] Implicit Places using invariants and state equation in 273 ms returned []
Implicit Place search using SMT with State Equation took 368 ms to find 0 implicit places.
[2024-06-02 22:05:07] [INFO ] Redundant transitions in 3 ms returned []
Running 449 sub problems to find dead transitions.
[2024-06-02 22:05:07] [INFO ] Flow matrix only has 417 transitions (discarded 39 similar events)
[2024-06-02 22:05:07] [INFO ] Invariant cache hit.
[2024-06-02 22:05:07] [INFO ] State equation strengthened by 61 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/162 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 449 unsolved
[2024-06-02 22:05:09] [INFO ] Deduced a trap composed of 62 places in 81 ms of which 2 ms to minimize.
[2024-06-02 22:05:09] [INFO ] Deduced a trap composed of 17 places in 95 ms of which 1 ms to minimize.
[2024-06-02 22:05:09] [INFO ] Deduced a trap composed of 27 places in 77 ms of which 1 ms to minimize.
[2024-06-02 22:05:09] [INFO ] Deduced a trap composed of 33 places in 37 ms of which 0 ms to minimize.
[2024-06-02 22:05:09] [INFO ] Deduced a trap composed of 25 places in 76 ms of which 1 ms to minimize.
[2024-06-02 22:05:09] [INFO ] Deduced a trap composed of 33 places in 36 ms of which 1 ms to minimize.
[2024-06-02 22:05:10] [INFO ] Deduced a trap composed of 64 places in 79 ms of which 2 ms to minimize.
[2024-06-02 22:05:10] [INFO ] Deduced a trap composed of 23 places in 82 ms of which 2 ms to minimize.
[2024-06-02 22:05:10] [INFO ] Deduced a trap composed of 33 places in 78 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/162 variables, 9/16 constraints. Problems are: Problem set: 0 solved, 449 unsolved
[2024-06-02 22:05:13] [INFO ] Deduced a trap composed of 17 places in 68 ms of which 1 ms to minimize.
[2024-06-02 22:05:13] [INFO ] Deduced a trap composed of 17 places in 69 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/162 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 449 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/162 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 449 unsolved
At refinement iteration 4 (OVERLAPS) 416/578 variables, 162/180 constraints. Problems are: Problem set: 0 solved, 449 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/578 variables, 61/241 constraints. Problems are: Problem set: 0 solved, 449 unsolved
[2024-06-02 22:05:17] [INFO ] Deduced a trap composed of 60 places in 86 ms of which 1 ms to minimize.
[2024-06-02 22:05:17] [INFO ] Deduced a trap composed of 58 places in 86 ms of which 1 ms to minimize.
[2024-06-02 22:05:20] [INFO ] Deduced a trap composed of 44 places in 42 ms of which 1 ms to minimize.
[2024-06-02 22:05:20] [INFO ] Deduced a trap composed of 32 places in 34 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/578 variables, 4/245 constraints. Problems are: Problem set: 0 solved, 449 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/578 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 449 unsolved
At refinement iteration 8 (OVERLAPS) 0/578 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 449 unsolved
No progress, stopping.
After SMT solving in domain Real declared 578/579 variables, and 245 constraints, problems are : Problem set: 0 solved, 449 unsolved in 23686 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 162/162 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 449/449 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 449 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/162 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 449 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/162 variables, 15/22 constraints. Problems are: Problem set: 0 solved, 449 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/162 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 449 unsolved
At refinement iteration 3 (OVERLAPS) 416/578 variables, 162/184 constraints. Problems are: Problem set: 0 solved, 449 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/578 variables, 61/245 constraints. Problems are: Problem set: 0 solved, 449 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/578 variables, 449/694 constraints. Problems are: Problem set: 0 solved, 449 unsolved
[2024-06-02 22:05:40] [INFO ] Deduced a trap composed of 41 places in 46 ms of which 1 ms to minimize.
[2024-06-02 22:05:42] [INFO ] Deduced a trap composed of 32 places in 45 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/578 variables, 2/696 constraints. Problems are: Problem set: 0 solved, 449 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/578 variables, 0/696 constraints. Problems are: Problem set: 0 solved, 449 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 578/579 variables, and 696 constraints, problems are : Problem set: 0 solved, 449 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 162/162 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 449/449 constraints, Known Traps: 17/17 constraints]
After SMT, in 54132ms problems are : Problem set: 0 solved, 449 unsolved
Search for dead transitions found 0 dead transitions in 54137ms
Starting structural reductions in SI_LTL mode, iteration 1 : 162/194 places, 456/517 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 54586 ms. Remains : 162/194 places, 456/517 transitions.
Stuttering acceptance computed with spot in 78 ms :[(NOT p1), (NOT p0)]
Running random walk in product with property : FireWire-PT-13-LTLFireability-06
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA FireWire-PT-13-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-13-LTLFireability-06 finished in 54678 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||X((G(F(p2))&&p1)))))))'
Support contains 6 out of 194 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 194/194 places, 517/517 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 190 transition count 507
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 190 transition count 507
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 10 place count 190 transition count 505
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 12 place count 188 transition count 501
Iterating global reduction 1 with 2 rules applied. Total rules applied 14 place count 188 transition count 501
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 16 place count 186 transition count 495
Iterating global reduction 1 with 2 rules applied. Total rules applied 18 place count 186 transition count 495
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 20 place count 184 transition count 491
Iterating global reduction 1 with 2 rules applied. Total rules applied 22 place count 184 transition count 491
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 24 place count 182 transition count 485
Iterating global reduction 1 with 2 rules applied. Total rules applied 26 place count 182 transition count 485
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 28 place count 180 transition count 481
Iterating global reduction 1 with 2 rules applied. Total rules applied 30 place count 180 transition count 481
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 32 place count 178 transition count 475
Iterating global reduction 1 with 2 rules applied. Total rules applied 34 place count 178 transition count 475
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 36 place count 176 transition count 471
Iterating global reduction 1 with 2 rules applied. Total rules applied 38 place count 176 transition count 471
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 40 place count 174 transition count 465
Iterating global reduction 1 with 2 rules applied. Total rules applied 42 place count 174 transition count 465
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 44 place count 172 transition count 461
Iterating global reduction 1 with 2 rules applied. Total rules applied 46 place count 172 transition count 461
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 48 place count 170 transition count 457
Iterating global reduction 1 with 2 rules applied. Total rules applied 50 place count 170 transition count 457
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 52 place count 168 transition count 453
Iterating global reduction 1 with 2 rules applied. Total rules applied 54 place count 168 transition count 453
Applied a total of 54 rules in 24 ms. Remains 168 /194 variables (removed 26) and now considering 453/517 (removed 64) transitions.
[2024-06-02 22:06:01] [INFO ] Flow matrix only has 421 transitions (discarded 32 similar events)
// Phase 1: matrix 421 rows 168 cols
[2024-06-02 22:06:01] [INFO ] Computed 7 invariants in 2 ms
[2024-06-02 22:06:01] [INFO ] Implicit Places using invariants in 104 ms returned []
[2024-06-02 22:06:01] [INFO ] Flow matrix only has 421 transitions (discarded 32 similar events)
[2024-06-02 22:06:01] [INFO ] Invariant cache hit.
[2024-06-02 22:06:01] [INFO ] State equation strengthened by 61 read => feed constraints.
[2024-06-02 22:06:02] [INFO ] Implicit Places using invariants and state equation in 291 ms returned []
Implicit Place search using SMT with State Equation took 415 ms to find 0 implicit places.
Running 452 sub problems to find dead transitions.
[2024-06-02 22:06:02] [INFO ] Flow matrix only has 421 transitions (discarded 32 similar events)
[2024-06-02 22:06:02] [INFO ] Invariant cache hit.
[2024-06-02 22:06:02] [INFO ] State equation strengthened by 61 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/167 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 452 unsolved
At refinement iteration 1 (OVERLAPS) 1/168 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 452 unsolved
[2024-06-02 22:06:05] [INFO ] Deduced a trap composed of 60 places in 91 ms of which 1 ms to minimize.
[2024-06-02 22:06:05] [INFO ] Deduced a trap composed of 17 places in 92 ms of which 1 ms to minimize.
[2024-06-02 22:06:05] [INFO ] Deduced a trap composed of 25 places in 96 ms of which 1 ms to minimize.
[2024-06-02 22:06:05] [INFO ] Deduced a trap composed of 35 places in 31 ms of which 4 ms to minimize.
[2024-06-02 22:06:06] [INFO ] Deduced a trap composed of 30 places in 87 ms of which 1 ms to minimize.
[2024-06-02 22:06:06] [INFO ] Deduced a trap composed of 26 places in 89 ms of which 1 ms to minimize.
[2024-06-02 22:06:06] [INFO ] Deduced a trap composed of 35 places in 42 ms of which 0 ms to minimize.
[2024-06-02 22:06:06] [INFO ] Deduced a trap composed of 63 places in 88 ms of which 1 ms to minimize.
[2024-06-02 22:06:06] [INFO ] Deduced a trap composed of 24 places in 70 ms of which 1 ms to minimize.
[2024-06-02 22:06:06] [INFO ] Deduced a trap composed of 26 places in 75 ms of which 1 ms to minimize.
[2024-06-02 22:06:07] [INFO ] Deduced a trap composed of 35 places in 54 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/168 variables, 11/18 constraints. Problems are: Problem set: 0 solved, 452 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/168 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 452 unsolved
At refinement iteration 4 (OVERLAPS) 420/588 variables, 168/186 constraints. Problems are: Problem set: 0 solved, 452 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/588 variables, 60/246 constraints. Problems are: Problem set: 0 solved, 452 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/588 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 452 unsolved
At refinement iteration 7 (OVERLAPS) 1/589 variables, 1/247 constraints. Problems are: Problem set: 0 solved, 452 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/589 variables, 0/247 constraints. Problems are: Problem set: 0 solved, 452 unsolved
At refinement iteration 9 (OVERLAPS) 0/589 variables, 0/247 constraints. Problems are: Problem set: 0 solved, 452 unsolved
No progress, stopping.
After SMT solving in domain Real declared 589/589 variables, and 247 constraints, problems are : Problem set: 0 solved, 452 unsolved in 26355 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 168/168 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 452/452 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 452 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/167 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 452 unsolved
At refinement iteration 1 (OVERLAPS) 1/168 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 452 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/168 variables, 11/18 constraints. Problems are: Problem set: 0 solved, 452 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/168 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 452 unsolved
At refinement iteration 4 (OVERLAPS) 420/588 variables, 168/186 constraints. Problems are: Problem set: 0 solved, 452 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/588 variables, 60/246 constraints. Problems are: Problem set: 0 solved, 452 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/588 variables, 452/698 constraints. Problems are: Problem set: 0 solved, 452 unsolved
[2024-06-02 22:06:44] [INFO ] Deduced a trap composed of 35 places in 43 ms of which 1 ms to minimize.
[2024-06-02 22:06:45] [INFO ] Deduced a trap composed of 43 places in 38 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/588 variables, 2/700 constraints. Problems are: Problem set: 0 solved, 452 unsolved
[2024-06-02 22:06:56] [INFO ] Deduced a trap composed of 43 places in 59 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/588 variables, 1/701 constraints. Problems are: Problem set: 0 solved, 452 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 588/589 variables, and 701 constraints, problems are : Problem set: 0 solved, 452 unsolved in 30040 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 168/168 constraints, ReadFeed: 60/61 constraints, PredecessorRefiner: 452/452 constraints, Known Traps: 14/14 constraints]
After SMT, in 56792ms problems are : Problem set: 0 solved, 452 unsolved
Search for dead transitions found 0 dead transitions in 56797ms
Starting structural reductions in LTL mode, iteration 1 : 168/194 places, 453/517 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 57237 ms. Remains : 168/194 places, 453/517 transitions.
Stuttering acceptance computed with spot in 261 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : FireWire-PT-13-LTLFireability-09
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 1 ms.
FORMULA FireWire-PT-13-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-13-LTLFireability-09 finished in 57519 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((p0||G((p1&&(F(p3)||p2))))))'
Support contains 4 out of 194 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 194/194 places, 517/517 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 3 Pre rules applied. Total rules applied 0 place count 193 transition count 513
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 190 transition count 513
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 10 place count 186 transition count 503
Iterating global reduction 0 with 4 rules applied. Total rules applied 14 place count 186 transition count 503
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 16 place count 186 transition count 501
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 18 place count 184 transition count 497
Iterating global reduction 1 with 2 rules applied. Total rules applied 20 place count 184 transition count 497
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 22 place count 182 transition count 491
Iterating global reduction 1 with 2 rules applied. Total rules applied 24 place count 182 transition count 491
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 26 place count 180 transition count 487
Iterating global reduction 1 with 2 rules applied. Total rules applied 28 place count 180 transition count 487
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 30 place count 178 transition count 481
Iterating global reduction 1 with 2 rules applied. Total rules applied 32 place count 178 transition count 481
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 34 place count 176 transition count 477
Iterating global reduction 1 with 2 rules applied. Total rules applied 36 place count 176 transition count 477
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 38 place count 174 transition count 472
Iterating global reduction 1 with 2 rules applied. Total rules applied 40 place count 174 transition count 472
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 42 place count 172 transition count 468
Iterating global reduction 1 with 2 rules applied. Total rules applied 44 place count 172 transition count 468
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 45 place count 171 transition count 465
Iterating global reduction 1 with 1 rules applied. Total rules applied 46 place count 171 transition count 465
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 47 place count 170 transition count 463
Iterating global reduction 1 with 1 rules applied. Total rules applied 48 place count 170 transition count 463
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 49 place count 169 transition count 461
Iterating global reduction 1 with 1 rules applied. Total rules applied 50 place count 169 transition count 461
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 51 place count 168 transition count 459
Iterating global reduction 1 with 1 rules applied. Total rules applied 52 place count 168 transition count 459
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 58 place count 165 transition count 456
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 64 place count 162 transition count 462
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 70 place count 162 transition count 456
Applied a total of 70 rules in 49 ms. Remains 162 /194 variables (removed 32) and now considering 456/517 (removed 61) transitions.
[2024-06-02 22:06:59] [INFO ] Flow matrix only has 417 transitions (discarded 39 similar events)
// Phase 1: matrix 417 rows 162 cols
[2024-06-02 22:06:59] [INFO ] Computed 7 invariants in 1 ms
[2024-06-02 22:06:59] [INFO ] Implicit Places using invariants in 175 ms returned []
[2024-06-02 22:06:59] [INFO ] Flow matrix only has 417 transitions (discarded 39 similar events)
[2024-06-02 22:06:59] [INFO ] Invariant cache hit.
[2024-06-02 22:06:59] [INFO ] State equation strengthened by 61 read => feed constraints.
[2024-06-02 22:06:59] [INFO ] Implicit Places using invariants and state equation in 259 ms returned []
Implicit Place search using SMT with State Equation took 442 ms to find 0 implicit places.
[2024-06-02 22:06:59] [INFO ] Redundant transitions in 3 ms returned []
Running 449 sub problems to find dead transitions.
[2024-06-02 22:06:59] [INFO ] Flow matrix only has 417 transitions (discarded 39 similar events)
[2024-06-02 22:06:59] [INFO ] Invariant cache hit.
[2024-06-02 22:06:59] [INFO ] State equation strengthened by 61 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/162 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 449 unsolved
[2024-06-02 22:07:01] [INFO ] Deduced a trap composed of 63 places in 84 ms of which 1 ms to minimize.
[2024-06-02 22:07:01] [INFO ] Deduced a trap composed of 33 places in 30 ms of which 1 ms to minimize.
[2024-06-02 22:07:01] [INFO ] Deduced a trap composed of 17 places in 85 ms of which 1 ms to minimize.
[2024-06-02 22:07:01] [INFO ] Deduced a trap composed of 23 places in 82 ms of which 2 ms to minimize.
[2024-06-02 22:07:02] [INFO ] Deduced a trap composed of 17 places in 77 ms of which 1 ms to minimize.
[2024-06-02 22:07:02] [INFO ] Deduced a trap composed of 33 places in 80 ms of which 2 ms to minimize.
[2024-06-02 22:07:03] [INFO ] Deduced a trap composed of 25 places in 72 ms of which 1 ms to minimize.
[2024-06-02 22:07:03] [INFO ] Deduced a trap composed of 33 places in 34 ms of which 1 ms to minimize.
[2024-06-02 22:07:03] [INFO ] Deduced a trap composed of 17 places in 72 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/162 variables, 9/16 constraints. Problems are: Problem set: 0 solved, 449 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/162 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 449 unsolved
At refinement iteration 3 (OVERLAPS) 416/578 variables, 162/178 constraints. Problems are: Problem set: 0 solved, 449 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/578 variables, 61/239 constraints. Problems are: Problem set: 0 solved, 449 unsolved
[2024-06-02 22:07:08] [INFO ] Deduced a trap composed of 59 places in 86 ms of which 2 ms to minimize.
[2024-06-02 22:07:09] [INFO ] Deduced a trap composed of 59 places in 83 ms of which 1 ms to minimize.
[2024-06-02 22:07:09] [INFO ] Deduced a trap composed of 58 places in 80 ms of which 2 ms to minimize.
[2024-06-02 22:07:12] [INFO ] Deduced a trap composed of 32 places in 37 ms of which 1 ms to minimize.
[2024-06-02 22:07:12] [INFO ] Deduced a trap composed of 32 places in 37 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/578 variables, 5/244 constraints. Problems are: Problem set: 0 solved, 449 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/578 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 449 unsolved
At refinement iteration 7 (OVERLAPS) 0/578 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 449 unsolved
No progress, stopping.
After SMT solving in domain Real declared 578/579 variables, and 244 constraints, problems are : Problem set: 0 solved, 449 unsolved in 23620 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 162/162 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 449/449 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 449 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/162 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 449 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/162 variables, 14/21 constraints. Problems are: Problem set: 0 solved, 449 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/162 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 449 unsolved
At refinement iteration 3 (OVERLAPS) 416/578 variables, 162/183 constraints. Problems are: Problem set: 0 solved, 449 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/578 variables, 61/244 constraints. Problems are: Problem set: 0 solved, 449 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/578 variables, 449/693 constraints. Problems are: Problem set: 0 solved, 449 unsolved
[2024-06-02 22:07:30] [INFO ] Deduced a trap composed of 41 places in 42 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/578 variables, 1/694 constraints. Problems are: Problem set: 0 solved, 449 unsolved
[2024-06-02 22:07:48] [INFO ] Deduced a trap composed of 44 places in 46 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/578 variables, 1/695 constraints. Problems are: Problem set: 0 solved, 449 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 578/579 variables, and 695 constraints, problems are : Problem set: 0 solved, 449 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 162/162 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 449/449 constraints, Known Traps: 16/16 constraints]
After SMT, in 54022ms problems are : Problem set: 0 solved, 449 unsolved
Search for dead transitions found 0 dead transitions in 54027ms
Starting structural reductions in SI_LTL mode, iteration 1 : 162/194 places, 456/517 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 54528 ms. Remains : 162/194 places, 456/517 transitions.
Stuttering acceptance computed with spot in 109 ms :[(OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3)))]
Running random walk in product with property : FireWire-PT-13-LTLFireability-10
Product exploration explored 100000 steps with 1 reset in 213 ms.
Product exploration explored 100000 steps with 1 reset in 117 ms.
Computed a total of 24 stabilizing places and 65 stable transitions
Computed a total of 24 stabilizing places and 65 stable transitions
Knowledge obtained : [(AND p1 (NOT p0) p2 p3), (X p2), (X p3), (X (NOT (OR (AND (NOT p1) (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))))), (X (AND p1 (NOT p0))), (X (NOT (AND p1 (NOT p0) (NOT p2) (NOT p3)))), (X (NOT (AND p1 (NOT p0) p2 (NOT p3)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p0)), (X p1), (X (X p2)), (X (X p3)), (X (X (NOT (OR (AND (NOT p1) (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3)))))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0) (NOT p2) (NOT p3))))), (X (X (NOT (AND p1 (NOT p0) p2 (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 19 factoid took 102 ms. Reduced automaton from 2 states, 5 edges and 4 AP (stutter insensitive) to 2 states, 5 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 75 ms :[(OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3)))]
Reduction of identical properties reduced properties to check from 9 to 8
RANDOM walk for 40000 steps (1233 resets) in 408 ms. (97 steps per ms) remains 3/8 properties
BEST_FIRST walk for 40004 steps (259 resets) in 155 ms. (256 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (288 resets) in 125 ms. (317 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (276 resets) in 31 ms. (1250 steps per ms) remains 3/3 properties
[2024-06-02 22:07:54] [INFO ] Flow matrix only has 417 transitions (discarded 39 similar events)
[2024-06-02 22:07:54] [INFO ] Invariant cache hit.
[2024-06-02 22:07:54] [INFO ] State equation strengthened by 61 read => feed constraints.
Problem apf4 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 100/104 variables, 3/3 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 362/466 variables, 104/107 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/466 variables, 41/148 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/466 variables, 0/148 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 100/566 variables, 50/198 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/566 variables, 3/201 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/566 variables, 20/221 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/566 variables, 0/221 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 11/577 variables, 7/228 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/577 variables, 1/229 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/577 variables, 0/229 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 1/578 variables, 1/230 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/578 variables, 0/230 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/578 variables, 0/230 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 578/579 variables, and 230 constraints, problems are : Problem set: 1 solved, 2 unsolved in 183 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 162/162 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 101/104 variables, 3/3 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 362/466 variables, 104/107 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/466 variables, 41/148 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/466 variables, 0/148 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 100/566 variables, 50/198 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/566 variables, 3/201 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/566 variables, 20/221 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/566 variables, 2/223 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/566 variables, 0/223 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 11/577 variables, 7/230 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/577 variables, 1/231 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/577 variables, 0/231 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 1/578 variables, 1/232 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/578 variables, 0/232 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 0/578 variables, 0/232 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 578/579 variables, and 232 constraints, problems are : Problem set: 1 solved, 2 unsolved in 318 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 162/162 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 2/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 515ms problems are : Problem set: 1 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 25 ms.
Support contains 3 out of 162 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 162/162 places, 456/456 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 162 transition count 450
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 1 with 3 rules applied. Total rules applied 9 place count 162 transition count 456
Reduce places removed 3 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 18 place count 159 transition count 450
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 2 with 6 rules applied. Total rules applied 24 place count 159 transition count 444
Applied a total of 24 rules in 16 ms. Remains 159 /162 variables (removed 3) and now considering 444/456 (removed 12) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 159/162 places, 444/456 transitions.
RANDOM walk for 40000 steps (1306 resets) in 105 ms. (377 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (279 resets) in 44 ms. (888 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (267 resets) in 40 ms. (975 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 823814 steps, run timeout after 3001 ms. (steps per millisecond=274 ) properties seen :0 out of 2
Probabilistic random walk after 823814 steps, saw 201355 distinct states, run finished after 3001 ms. (steps per millisecond=274 ) properties seen :0
[2024-06-02 22:07:58] [INFO ] Flow matrix only has 407 transitions (discarded 37 similar events)
// Phase 1: matrix 407 rows 159 cols
[2024-06-02 22:07:58] [INFO ] Computed 7 invariants in 4 ms
[2024-06-02 22:07:58] [INFO ] State equation strengthened by 61 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 99/102 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 355/457 variables, 102/105 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/457 variables, 41/146 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/457 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 97/554 variables, 49/195 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/554 variables, 3/198 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/554 variables, 20/218 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/554 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 11/565 variables, 7/225 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/565 variables, 1/226 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/565 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 1/566 variables, 1/227 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/566 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/566 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 566/566 variables, and 227 constraints, problems are : Problem set: 0 solved, 2 unsolved in 191 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 159/159 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 99/102 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 355/457 variables, 102/105 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/457 variables, 41/146 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/457 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 97/554 variables, 49/195 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/554 variables, 3/198 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/554 variables, 20/218 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/554 variables, 2/220 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/554 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 11/565 variables, 7/227 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/565 variables, 1/228 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/565 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 1/566 variables, 1/229 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/566 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 0/566 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 566/566 variables, and 229 constraints, problems are : Problem set: 0 solved, 2 unsolved in 292 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 159/159 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 498ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 67 ms.
Support contains 3 out of 159 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 159/159 places, 444/444 transitions.
Applied a total of 0 rules in 5 ms. Remains 159 /159 variables (removed 0) and now considering 444/444 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 159/159 places, 444/444 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 159/159 places, 444/444 transitions.
Applied a total of 0 rules in 5 ms. Remains 159 /159 variables (removed 0) and now considering 444/444 (removed 0) transitions.
[2024-06-02 22:07:58] [INFO ] Flow matrix only has 407 transitions (discarded 37 similar events)
[2024-06-02 22:07:58] [INFO ] Invariant cache hit.
[2024-06-02 22:07:58] [INFO ] Implicit Places using invariants in 81 ms returned []
[2024-06-02 22:07:58] [INFO ] Flow matrix only has 407 transitions (discarded 37 similar events)
[2024-06-02 22:07:58] [INFO ] Invariant cache hit.
[2024-06-02 22:07:58] [INFO ] State equation strengthened by 61 read => feed constraints.
[2024-06-02 22:07:59] [INFO ] Implicit Places using invariants and state equation in 254 ms returned []
Implicit Place search using SMT with State Equation took 337 ms to find 0 implicit places.
[2024-06-02 22:07:59] [INFO ] Redundant transitions in 4 ms returned []
Running 438 sub problems to find dead transitions.
[2024-06-02 22:07:59] [INFO ] Flow matrix only has 407 transitions (discarded 37 similar events)
[2024-06-02 22:07:59] [INFO ] Invariant cache hit.
[2024-06-02 22:07:59] [INFO ] State equation strengthened by 61 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/159 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 438 unsolved
[2024-06-02 22:08:00] [INFO ] Deduced a trap composed of 59 places in 81 ms of which 1 ms to minimize.
[2024-06-02 22:08:00] [INFO ] Deduced a trap composed of 17 places in 73 ms of which 1 ms to minimize.
[2024-06-02 22:08:01] [INFO ] Deduced a trap composed of 32 places in 33 ms of which 1 ms to minimize.
[2024-06-02 22:08:01] [INFO ] Deduced a trap composed of 23 places in 76 ms of which 2 ms to minimize.
[2024-06-02 22:08:01] [INFO ] Deduced a trap composed of 17 places in 68 ms of which 1 ms to minimize.
[2024-06-02 22:08:01] [INFO ] Deduced a trap composed of 25 places in 77 ms of which 1 ms to minimize.
[2024-06-02 22:08:01] [INFO ] Deduced a trap composed of 32 places in 35 ms of which 0 ms to minimize.
[2024-06-02 22:08:02] [INFO ] Deduced a trap composed of 32 places in 75 ms of which 1 ms to minimize.
[2024-06-02 22:08:02] [INFO ] Deduced a trap composed of 17 places in 70 ms of which 1 ms to minimize.
[2024-06-02 22:08:03] [INFO ] Deduced a trap composed of 103 places in 85 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/159 variables, 10/17 constraints. Problems are: Problem set: 0 solved, 438 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/159 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 438 unsolved
At refinement iteration 3 (OVERLAPS) 407/566 variables, 159/176 constraints. Problems are: Problem set: 0 solved, 438 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/566 variables, 61/237 constraints. Problems are: Problem set: 0 solved, 438 unsolved
[2024-06-02 22:08:08] [INFO ] Deduced a trap composed of 40 places in 39 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/566 variables, 1/238 constraints. Problems are: Problem set: 0 solved, 438 unsolved
[2024-06-02 22:08:14] [INFO ] Deduced a trap composed of 31 places in 31 ms of which 1 ms to minimize.
[2024-06-02 22:08:14] [INFO ] Deduced a trap composed of 31 places in 37 ms of which 1 ms to minimize.
[2024-06-02 22:08:14] [INFO ] Deduced a trap composed of 61 places in 82 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/566 variables, 3/241 constraints. Problems are: Problem set: 0 solved, 438 unsolved
[2024-06-02 22:08:18] [INFO ] Deduced a trap composed of 96 places in 87 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/566 variables, 1/242 constraints. Problems are: Problem set: 0 solved, 438 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/566 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 438 unsolved
At refinement iteration 9 (OVERLAPS) 0/566 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 438 unsolved
No progress, stopping.
After SMT solving in domain Real declared 566/566 variables, and 242 constraints, problems are : Problem set: 0 solved, 438 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 159/159 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 438/438 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 438 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/159 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 438 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/159 variables, 15/22 constraints. Problems are: Problem set: 0 solved, 438 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/159 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 438 unsolved
At refinement iteration 3 (OVERLAPS) 407/566 variables, 159/181 constraints. Problems are: Problem set: 0 solved, 438 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/566 variables, 61/242 constraints. Problems are: Problem set: 0 solved, 438 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/566 variables, 438/680 constraints. Problems are: Problem set: 0 solved, 438 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/566 variables, 0/680 constraints. Problems are: Problem set: 0 solved, 438 unsolved
At refinement iteration 7 (OVERLAPS) 0/566 variables, 0/680 constraints. Problems are: Problem set: 0 solved, 438 unsolved
No progress, stopping.
After SMT solving in domain Int declared 566/566 variables, and 680 constraints, problems are : Problem set: 0 solved, 438 unsolved in 28262 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 159/159 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 438/438 constraints, Known Traps: 15/15 constraints]
After SMT, in 58653ms problems are : Problem set: 0 solved, 438 unsolved
Search for dead transitions found 0 dead transitions in 58657ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 59013 ms. Remains : 159/159 places, 444/444 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 141 edges and 159 vertex of which 29 / 159 are part of one of the 4 SCC in 1 ms
Free SCC test removed 25 places
Drop transitions (Empty/Sink Transition effects.) removed 123 transitions
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 144 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 133 transition count 299
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 0 with 9 rules applied. Total rules applied 12 place count 133 transition count 290
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 132 transition count 289
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 15 place count 132 transition count 288
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 17 place count 131 transition count 287
Free-agglomeration rule applied 9 times with reduction of 6 identical transitions.
Iterating global reduction 0 with 9 rules applied. Total rules applied 26 place count 131 transition count 272
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 38 place count 122 transition count 269
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 44 place count 122 transition count 269
Applied a total of 44 rules in 47 ms. Remains 122 /159 variables (removed 37) and now considering 269/444 (removed 175) transitions.
Running SMT prover for 2 properties.
[2024-06-02 22:08:57] [INFO ] Flow matrix only has 267 transitions (discarded 2 similar events)
// Phase 1: matrix 267 rows 122 cols
[2024-06-02 22:08:57] [INFO ] Computed 7 invariants in 8 ms
[2024-06-02 22:08:57] [INFO ] After 74ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-06-02 22:08:57] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-02 22:08:58] [INFO ] After 87ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-06-02 22:08:58] [INFO ] After 118ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2024-06-02 22:08:58] [INFO ] After 204ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 344 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 (NOT p0) p2 p3), (X p2), (X p3), (X (NOT (OR (AND (NOT p1) (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))))), (X (AND p1 (NOT p0))), (X (NOT (AND p1 (NOT p0) (NOT p2) (NOT p3)))), (X (NOT (AND p1 (NOT p0) p2 (NOT p3)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p0)), (X p1), (X (X p2)), (X (X p3)), (X (X (NOT (OR (AND (NOT p1) (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3)))))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0) (NOT p2) (NOT p3))))), (X (X (NOT (AND p1 (NOT p0) p2 (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p0))), (X (X p1)), (G (OR p0 (NOT p1) p3 (NOT p2)))]
False Knowledge obtained : [(F (NOT (OR p0 (NOT p1) p3 p2))), (F p0), (F (NOT (AND (NOT p0) p1))), (F (NOT p2)), (F (NOT p3)), (F (NOT (AND (OR p0 p1 p3) (OR p0 p3 p2))))]
Knowledge based reduction with 20 factoid took 325 ms. Reduced automaton from 2 states, 5 edges and 4 AP (stutter insensitive) to 2 states, 4 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 91 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3))), (AND (NOT p0) (NOT p3))]
Stuttering acceptance computed with spot in 105 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3))), (AND (NOT p0) (NOT p3))]
Support contains 4 out of 162 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 162/162 places, 456/456 transitions.
Applied a total of 0 rules in 7 ms. Remains 162 /162 variables (removed 0) and now considering 456/456 (removed 0) transitions.
[2024-06-02 22:08:58] [INFO ] Flow matrix only has 417 transitions (discarded 39 similar events)
// Phase 1: matrix 417 rows 162 cols
[2024-06-02 22:08:58] [INFO ] Computed 7 invariants in 1 ms
[2024-06-02 22:08:58] [INFO ] Implicit Places using invariants in 114 ms returned []
[2024-06-02 22:08:58] [INFO ] Flow matrix only has 417 transitions (discarded 39 similar events)
[2024-06-02 22:08:58] [INFO ] Invariant cache hit.
[2024-06-02 22:08:58] [INFO ] State equation strengthened by 61 read => feed constraints.
[2024-06-02 22:08:59] [INFO ] Implicit Places using invariants and state equation in 283 ms returned []
Implicit Place search using SMT with State Equation took 399 ms to find 0 implicit places.
[2024-06-02 22:08:59] [INFO ] Redundant transitions in 5 ms returned []
Running 449 sub problems to find dead transitions.
[2024-06-02 22:08:59] [INFO ] Flow matrix only has 417 transitions (discarded 39 similar events)
[2024-06-02 22:08:59] [INFO ] Invariant cache hit.
[2024-06-02 22:08:59] [INFO ] State equation strengthened by 61 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/162 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 449 unsolved
[2024-06-02 22:09:00] [INFO ] Deduced a trap composed of 63 places in 82 ms of which 1 ms to minimize.
[2024-06-02 22:09:00] [INFO ] Deduced a trap composed of 33 places in 34 ms of which 2 ms to minimize.
[2024-06-02 22:09:01] [INFO ] Deduced a trap composed of 17 places in 80 ms of which 1 ms to minimize.
[2024-06-02 22:09:01] [INFO ] Deduced a trap composed of 23 places in 76 ms of which 1 ms to minimize.
[2024-06-02 22:09:01] [INFO ] Deduced a trap composed of 17 places in 76 ms of which 2 ms to minimize.
[2024-06-02 22:09:02] [INFO ] Deduced a trap composed of 33 places in 79 ms of which 2 ms to minimize.
[2024-06-02 22:09:02] [INFO ] Deduced a trap composed of 25 places in 82 ms of which 2 ms to minimize.
[2024-06-02 22:09:02] [INFO ] Deduced a trap composed of 33 places in 32 ms of which 1 ms to minimize.
[2024-06-02 22:09:02] [INFO ] Deduced a trap composed of 17 places in 75 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/162 variables, 9/16 constraints. Problems are: Problem set: 0 solved, 449 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/162 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 449 unsolved
At refinement iteration 3 (OVERLAPS) 416/578 variables, 162/178 constraints. Problems are: Problem set: 0 solved, 449 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/578 variables, 61/239 constraints. Problems are: Problem set: 0 solved, 449 unsolved
[2024-06-02 22:09:08] [INFO ] Deduced a trap composed of 59 places in 85 ms of which 1 ms to minimize.
[2024-06-02 22:09:08] [INFO ] Deduced a trap composed of 59 places in 80 ms of which 2 ms to minimize.
[2024-06-02 22:09:08] [INFO ] Deduced a trap composed of 58 places in 78 ms of which 1 ms to minimize.
[2024-06-02 22:09:11] [INFO ] Deduced a trap composed of 32 places in 37 ms of which 0 ms to minimize.
[2024-06-02 22:09:11] [INFO ] Deduced a trap composed of 32 places in 35 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/578 variables, 5/244 constraints. Problems are: Problem set: 0 solved, 449 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/578 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 449 unsolved
At refinement iteration 7 (OVERLAPS) 0/578 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 449 unsolved
No progress, stopping.
After SMT solving in domain Real declared 578/579 variables, and 244 constraints, problems are : Problem set: 0 solved, 449 unsolved in 23768 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 162/162 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 449/449 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 449 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/162 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 449 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/162 variables, 14/21 constraints. Problems are: Problem set: 0 solved, 449 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/162 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 449 unsolved
At refinement iteration 3 (OVERLAPS) 416/578 variables, 162/183 constraints. Problems are: Problem set: 0 solved, 449 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/578 variables, 61/244 constraints. Problems are: Problem set: 0 solved, 449 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/578 variables, 449/693 constraints. Problems are: Problem set: 0 solved, 449 unsolved
[2024-06-02 22:09:30] [INFO ] Deduced a trap composed of 41 places in 46 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/578 variables, 1/694 constraints. Problems are: Problem set: 0 solved, 449 unsolved
[2024-06-02 22:09:48] [INFO ] Deduced a trap composed of 44 places in 44 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/578 variables, 1/695 constraints. Problems are: Problem set: 0 solved, 449 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 578/579 variables, and 695 constraints, problems are : Problem set: 0 solved, 449 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 162/162 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 449/449 constraints, Known Traps: 16/16 constraints]
After SMT, in 54175ms problems are : Problem set: 0 solved, 449 unsolved
Search for dead transitions found 0 dead transitions in 54182ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 54604 ms. Remains : 162/162 places, 456/456 transitions.
Computed a total of 24 stabilizing places and 65 stable transitions
Computed a total of 24 stabilizing places and 65 stable transitions
Knowledge obtained : [(AND (NOT p0) p1 p3), (X p3), (X (NOT (AND (NOT p0) (NOT p3)))), (X (NOT (AND (NOT p0) p1 (NOT p3)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1)), (X (NOT p0)), (X p1), (X (X p3)), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (NOT (AND (NOT p0) p1 (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 15 factoid took 132 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter insensitive) to 2 states, 4 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 93 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3))), (AND (NOT p0) (NOT p3))]
RANDOM walk for 40000 steps (1260 resets) in 178 ms. (223 steps per ms) remains 2/7 properties
BEST_FIRST walk for 40003 steps (283 resets) in 29 ms. (1333 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (261 resets) in 30 ms. (1290 steps per ms) remains 2/2 properties
[2024-06-02 22:09:53] [INFO ] Flow matrix only has 417 transitions (discarded 39 similar events)
[2024-06-02 22:09:53] [INFO ] Invariant cache hit.
[2024-06-02 22:09:53] [INFO ] State equation strengthened by 61 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 101/104 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 362/466 variables, 104/107 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/466 variables, 41/148 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/466 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 100/566 variables, 50/198 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/566 variables, 3/201 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/566 variables, 20/221 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/566 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 11/577 variables, 7/228 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/577 variables, 1/229 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/577 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 1/578 variables, 1/230 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/578 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/578 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 578/579 variables, and 230 constraints, problems are : Problem set: 0 solved, 2 unsolved in 191 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 162/162 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 101/104 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 362/466 variables, 104/107 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/466 variables, 41/148 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/466 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 100/566 variables, 50/198 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/566 variables, 3/201 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/566 variables, 20/221 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/566 variables, 2/223 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/566 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 11/577 variables, 7/230 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/577 variables, 1/231 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/577 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 1/578 variables, 1/232 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/578 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 0/578 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 578/579 variables, and 232 constraints, problems are : Problem set: 0 solved, 2 unsolved in 303 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 162/162 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 505ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 47 ms.
Support contains 3 out of 162 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 162/162 places, 456/456 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 162 transition count 450
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 1 with 3 rules applied. Total rules applied 9 place count 162 transition count 456
Reduce places removed 3 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 18 place count 159 transition count 450
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 2 with 6 rules applied. Total rules applied 24 place count 159 transition count 444
Applied a total of 24 rules in 15 ms. Remains 159 /162 variables (removed 3) and now considering 444/456 (removed 12) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 159/162 places, 444/456 transitions.
RANDOM walk for 40000 steps (1259 resets) in 238 ms. (167 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (276 resets) in 48 ms. (816 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (282 resets) in 46 ms. (851 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 723171 steps, run timeout after 3001 ms. (steps per millisecond=240 ) properties seen :0 out of 2
Probabilistic random walk after 723171 steps, saw 178911 distinct states, run finished after 3001 ms. (steps per millisecond=240 ) properties seen :0
[2024-06-02 22:09:57] [INFO ] Flow matrix only has 407 transitions (discarded 37 similar events)
// Phase 1: matrix 407 rows 159 cols
[2024-06-02 22:09:57] [INFO ] Computed 7 invariants in 2 ms
[2024-06-02 22:09:57] [INFO ] State equation strengthened by 61 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 99/102 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 355/457 variables, 102/105 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/457 variables, 41/146 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/457 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 97/554 variables, 49/195 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/554 variables, 3/198 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/554 variables, 20/218 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/554 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 11/565 variables, 7/225 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/565 variables, 1/226 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/565 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 1/566 variables, 1/227 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/566 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/566 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 566/566 variables, and 227 constraints, problems are : Problem set: 0 solved, 2 unsolved in 194 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 159/159 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 99/102 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 355/457 variables, 102/105 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/457 variables, 41/146 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/457 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 97/554 variables, 49/195 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/554 variables, 3/198 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/554 variables, 20/218 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/554 variables, 2/220 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/554 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 11/565 variables, 7/227 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/565 variables, 1/228 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/565 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 1/566 variables, 1/229 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/566 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 0/566 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 566/566 variables, and 229 constraints, problems are : Problem set: 0 solved, 2 unsolved in 303 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 159/159 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 508ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 89 ms.
Support contains 3 out of 159 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 159/159 places, 444/444 transitions.
Applied a total of 0 rules in 4 ms. Remains 159 /159 variables (removed 0) and now considering 444/444 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 159/159 places, 444/444 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 159/159 places, 444/444 transitions.
Applied a total of 0 rules in 4 ms. Remains 159 /159 variables (removed 0) and now considering 444/444 (removed 0) transitions.
[2024-06-02 22:09:57] [INFO ] Flow matrix only has 407 transitions (discarded 37 similar events)
[2024-06-02 22:09:57] [INFO ] Invariant cache hit.
[2024-06-02 22:09:57] [INFO ] Implicit Places using invariants in 84 ms returned []
[2024-06-02 22:09:57] [INFO ] Flow matrix only has 407 transitions (discarded 37 similar events)
[2024-06-02 22:09:57] [INFO ] Invariant cache hit.
[2024-06-02 22:09:58] [INFO ] State equation strengthened by 61 read => feed constraints.
[2024-06-02 22:09:58] [INFO ] Implicit Places using invariants and state equation in 259 ms returned []
Implicit Place search using SMT with State Equation took 347 ms to find 0 implicit places.
[2024-06-02 22:09:58] [INFO ] Redundant transitions in 5 ms returned []
Running 438 sub problems to find dead transitions.
[2024-06-02 22:09:58] [INFO ] Flow matrix only has 407 transitions (discarded 37 similar events)
[2024-06-02 22:09:58] [INFO ] Invariant cache hit.
[2024-06-02 22:09:58] [INFO ] State equation strengthened by 61 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/159 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 438 unsolved
[2024-06-02 22:09:59] [INFO ] Deduced a trap composed of 59 places in 81 ms of which 1 ms to minimize.
[2024-06-02 22:10:00] [INFO ] Deduced a trap composed of 17 places in 76 ms of which 1 ms to minimize.
[2024-06-02 22:10:00] [INFO ] Deduced a trap composed of 32 places in 30 ms of which 1 ms to minimize.
[2024-06-02 22:10:00] [INFO ] Deduced a trap composed of 23 places in 74 ms of which 1 ms to minimize.
[2024-06-02 22:10:00] [INFO ] Deduced a trap composed of 17 places in 76 ms of which 1 ms to minimize.
[2024-06-02 22:10:00] [INFO ] Deduced a trap composed of 25 places in 77 ms of which 2 ms to minimize.
[2024-06-02 22:10:01] [INFO ] Deduced a trap composed of 32 places in 39 ms of which 1 ms to minimize.
[2024-06-02 22:10:01] [INFO ] Deduced a trap composed of 32 places in 77 ms of which 1 ms to minimize.
[2024-06-02 22:10:01] [INFO ] Deduced a trap composed of 17 places in 75 ms of which 1 ms to minimize.
[2024-06-02 22:10:02] [INFO ] Deduced a trap composed of 103 places in 83 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/159 variables, 10/17 constraints. Problems are: Problem set: 0 solved, 438 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/159 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 438 unsolved
At refinement iteration 3 (OVERLAPS) 407/566 variables, 159/176 constraints. Problems are: Problem set: 0 solved, 438 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/566 variables, 61/237 constraints. Problems are: Problem set: 0 solved, 438 unsolved
[2024-06-02 22:10:07] [INFO ] Deduced a trap composed of 40 places in 38 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/566 variables, 1/238 constraints. Problems are: Problem set: 0 solved, 438 unsolved
[2024-06-02 22:10:13] [INFO ] Deduced a trap composed of 31 places in 38 ms of which 1 ms to minimize.
[2024-06-02 22:10:13] [INFO ] Deduced a trap composed of 31 places in 41 ms of which 1 ms to minimize.
[2024-06-02 22:10:14] [INFO ] Deduced a trap composed of 61 places in 92 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/566 variables, 3/241 constraints. Problems are: Problem set: 0 solved, 438 unsolved
[2024-06-02 22:10:18] [INFO ] Deduced a trap composed of 96 places in 84 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/566 variables, 1/242 constraints. Problems are: Problem set: 0 solved, 438 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/566 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 438 unsolved
At refinement iteration 9 (OVERLAPS) 0/566 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 438 unsolved
No progress, stopping.
After SMT solving in domain Real declared 566/566 variables, and 242 constraints, problems are : Problem set: 0 solved, 438 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 159/159 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 438/438 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 438 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/159 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 438 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/159 variables, 15/22 constraints. Problems are: Problem set: 0 solved, 438 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/159 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 438 unsolved
At refinement iteration 3 (OVERLAPS) 407/566 variables, 159/181 constraints. Problems are: Problem set: 0 solved, 438 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/566 variables, 61/242 constraints. Problems are: Problem set: 0 solved, 438 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/566 variables, 438/680 constraints. Problems are: Problem set: 0 solved, 438 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/566 variables, 0/680 constraints. Problems are: Problem set: 0 solved, 438 unsolved
At refinement iteration 7 (OVERLAPS) 0/566 variables, 0/680 constraints. Problems are: Problem set: 0 solved, 438 unsolved
No progress, stopping.
After SMT solving in domain Int declared 566/566 variables, and 680 constraints, problems are : Problem set: 0 solved, 438 unsolved in 29138 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 159/159 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 438/438 constraints, Known Traps: 15/15 constraints]
After SMT, in 59516ms problems are : Problem set: 0 solved, 438 unsolved
Search for dead transitions found 0 dead transitions in 59521ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 59884 ms. Remains : 159/159 places, 444/444 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 141 edges and 159 vertex of which 29 / 159 are part of one of the 4 SCC in 1 ms
Free SCC test removed 25 places
Drop transitions (Empty/Sink Transition effects.) removed 123 transitions
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 144 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 133 transition count 299
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 0 with 9 rules applied. Total rules applied 12 place count 133 transition count 290
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 132 transition count 289
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 15 place count 132 transition count 288
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 17 place count 131 transition count 287
Free-agglomeration rule applied 9 times with reduction of 6 identical transitions.
Iterating global reduction 0 with 9 rules applied. Total rules applied 26 place count 131 transition count 272
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 38 place count 122 transition count 269
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 44 place count 122 transition count 269
Applied a total of 44 rules in 23 ms. Remains 122 /159 variables (removed 37) and now considering 269/444 (removed 175) transitions.
Running SMT prover for 2 properties.
[2024-06-02 22:10:57] [INFO ] Flow matrix only has 267 transitions (discarded 2 similar events)
// Phase 1: matrix 267 rows 122 cols
[2024-06-02 22:10:57] [INFO ] Computed 7 invariants in 3 ms
[2024-06-02 22:10:57] [INFO ] After 51ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-06-02 22:10:57] [INFO ] [Nat]Absence check using 7 positive place invariants in 1 ms returned sat
[2024-06-02 22:10:57] [INFO ] After 65ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-06-02 22:10:57] [INFO ] After 110ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2024-06-02 22:10:58] [INFO ] After 175ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 259 ms.
Knowledge obtained : [(AND (NOT p0) p1 p3), (X p3), (X (NOT (AND (NOT p0) (NOT p3)))), (X (NOT (AND (NOT p0) p1 (NOT p3)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1)), (X (NOT p0)), (X p1), (X (X p3)), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (NOT (AND (NOT p0) p1 (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) p1))), (F p0), (F (NOT p3)), (F (NOT (OR p0 p3 (NOT p1)))), (F (NOT (OR p0 p3)))]
Knowledge based reduction with 15 factoid took 254 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter insensitive) to 2 states, 4 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 147 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3))), (AND (NOT p0) (NOT p3))]
Stuttering acceptance computed with spot in 77 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3))), (AND (NOT p0) (NOT p3))]
Stuttering acceptance computed with spot in 98 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3))), (AND (NOT p0) (NOT p3))]
Product exploration explored 100000 steps with 5 reset in 92 ms.
Product exploration explored 100000 steps with 2 reset in 228 ms.
Built C files in :
/tmp/ltsmin9777620700191553215
[2024-06-02 22:10:58] [INFO ] Computing symmetric may disable matrix : 456 transitions.
[2024-06-02 22:10:58] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 22:10:58] [INFO ] Computing symmetric may enable matrix : 456 transitions.
[2024-06-02 22:10:58] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 22:10:59] [INFO ] Computing Do-Not-Accords matrix : 456 transitions.
[2024-06-02 22:10:59] [INFO ] Computation of Completed DNA matrix. took 14 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 22:10:59] [INFO ] Built C files in 94ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9777620700191553215
Running compilation step : cd /tmp/ltsmin9777620700191553215;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1345 ms.
Running link step : cd /tmp/ltsmin9777620700191553215;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 59 ms.
Running LTSmin : cd /tmp/ltsmin9777620700191553215;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased8811420427445979092.hoa' '--buchi-type=spotba'
LTSmin run took 3252 ms.
FORMULA FireWire-PT-13-LTLFireability-10 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property FireWire-PT-13-LTLFireability-10 finished in 244637 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((G((F(p2)&&p1))||p0)))'
Support contains 4 out of 194 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 194/194 places, 517/517 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 3 Pre rules applied. Total rules applied 0 place count 193 transition count 513
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 190 transition count 513
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 11 place count 185 transition count 500
Iterating global reduction 0 with 5 rules applied. Total rules applied 16 place count 185 transition count 500
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 18 place count 185 transition count 498
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 21 place count 182 transition count 492
Iterating global reduction 1 with 3 rules applied. Total rules applied 24 place count 182 transition count 492
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 27 place count 179 transition count 483
Iterating global reduction 1 with 3 rules applied. Total rules applied 30 place count 179 transition count 483
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 33 place count 176 transition count 477
Iterating global reduction 1 with 3 rules applied. Total rules applied 36 place count 176 transition count 477
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 39 place count 173 transition count 468
Iterating global reduction 1 with 3 rules applied. Total rules applied 42 place count 173 transition count 468
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 45 place count 170 transition count 462
Iterating global reduction 1 with 3 rules applied. Total rules applied 48 place count 170 transition count 462
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 51 place count 167 transition count 454
Iterating global reduction 1 with 3 rules applied. Total rules applied 54 place count 167 transition count 454
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 57 place count 164 transition count 448
Iterating global reduction 1 with 3 rules applied. Total rules applied 60 place count 164 transition count 448
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 62 place count 162 transition count 442
Iterating global reduction 1 with 2 rules applied. Total rules applied 64 place count 162 transition count 442
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 66 place count 160 transition count 438
Iterating global reduction 1 with 2 rules applied. Total rules applied 68 place count 160 transition count 438
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 70 place count 158 transition count 434
Iterating global reduction 1 with 2 rules applied. Total rules applied 72 place count 158 transition count 434
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 73 place count 157 transition count 432
Iterating global reduction 1 with 1 rules applied. Total rules applied 74 place count 157 transition count 432
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 80 place count 154 transition count 429
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 84 place count 152 transition count 433
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 1 with 4 rules applied. Total rules applied 88 place count 152 transition count 429
Applied a total of 88 rules in 42 ms. Remains 152 /194 variables (removed 42) and now considering 429/517 (removed 88) transitions.
[2024-06-02 22:11:03] [INFO ] Flow matrix only has 393 transitions (discarded 36 similar events)
// Phase 1: matrix 393 rows 152 cols
[2024-06-02 22:11:03] [INFO ] Computed 7 invariants in 3 ms
[2024-06-02 22:11:03] [INFO ] Implicit Places using invariants in 90 ms returned []
[2024-06-02 22:11:03] [INFO ] Flow matrix only has 393 transitions (discarded 36 similar events)
[2024-06-02 22:11:03] [INFO ] Invariant cache hit.
[2024-06-02 22:11:03] [INFO ] State equation strengthened by 56 read => feed constraints.
[2024-06-02 22:11:04] [INFO ] Implicit Places using invariants and state equation in 246 ms returned []
Implicit Place search using SMT with State Equation took 337 ms to find 0 implicit places.
[2024-06-02 22:11:04] [INFO ] Redundant transitions in 3 ms returned []
Running 422 sub problems to find dead transitions.
[2024-06-02 22:11:04] [INFO ] Flow matrix only has 393 transitions (discarded 36 similar events)
[2024-06-02 22:11:04] [INFO ] Invariant cache hit.
[2024-06-02 22:11:04] [INFO ] State equation strengthened by 56 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/152 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 422 unsolved
[2024-06-02 22:11:05] [INFO ] Deduced a trap composed of 60 places in 83 ms of which 3 ms to minimize.
[2024-06-02 22:11:05] [INFO ] Deduced a trap composed of 17 places in 75 ms of which 1 ms to minimize.
[2024-06-02 22:11:06] [INFO ] Deduced a trap composed of 62 places in 71 ms of which 1 ms to minimize.
[2024-06-02 22:11:06] [INFO ] Deduced a trap composed of 23 places in 71 ms of which 1 ms to minimize.
[2024-06-02 22:11:06] [INFO ] Deduced a trap composed of 33 places in 30 ms of which 1 ms to minimize.
[2024-06-02 22:11:06] [INFO ] Deduced a trap composed of 33 places in 71 ms of which 1 ms to minimize.
[2024-06-02 22:11:07] [INFO ] Deduced a trap composed of 17 places in 72 ms of which 1 ms to minimize.
[2024-06-02 22:11:07] [INFO ] Deduced a trap composed of 29 places in 75 ms of which 1 ms to minimize.
[2024-06-02 22:11:07] [INFO ] Deduced a trap composed of 34 places in 35 ms of which 0 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/152 variables, 9/16 constraints. Problems are: Problem set: 0 solved, 422 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/152 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 422 unsolved
At refinement iteration 3 (OVERLAPS) 392/544 variables, 152/168 constraints. Problems are: Problem set: 0 solved, 422 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/544 variables, 56/224 constraints. Problems are: Problem set: 0 solved, 422 unsolved
[2024-06-02 22:11:12] [INFO ] Deduced a trap composed of 57 places in 81 ms of which 1 ms to minimize.
[2024-06-02 22:11:12] [INFO ] Deduced a trap composed of 55 places in 67 ms of which 1 ms to minimize.
[2024-06-02 22:11:12] [INFO ] Deduced a trap composed of 54 places in 75 ms of which 1 ms to minimize.
[2024-06-02 22:11:12] [INFO ] Deduced a trap composed of 53 places in 77 ms of which 1 ms to minimize.
[2024-06-02 22:11:14] [INFO ] Deduced a trap composed of 33 places in 38 ms of which 1 ms to minimize.
[2024-06-02 22:11:15] [INFO ] Deduced a trap composed of 33 places in 39 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/544 variables, 6/230 constraints. Problems are: Problem set: 0 solved, 422 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/544 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 422 unsolved
At refinement iteration 7 (OVERLAPS) 0/544 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 422 unsolved
No progress, stopping.
After SMT solving in domain Real declared 544/545 variables, and 230 constraints, problems are : Problem set: 0 solved, 422 unsolved in 19916 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 152/152 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 422/422 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 422 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/152 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 422 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/152 variables, 15/22 constraints. Problems are: Problem set: 0 solved, 422 unsolved
[2024-06-02 22:11:26] [INFO ] Deduced a trap composed of 17 places in 92 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/152 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 422 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/152 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 422 unsolved
At refinement iteration 4 (OVERLAPS) 392/544 variables, 152/175 constraints. Problems are: Problem set: 0 solved, 422 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/544 variables, 56/231 constraints. Problems are: Problem set: 0 solved, 422 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/544 variables, 422/653 constraints. Problems are: Problem set: 0 solved, 422 unsolved
[2024-06-02 22:11:37] [INFO ] Deduced a trap composed of 32 places in 41 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/544 variables, 1/654 constraints. Problems are: Problem set: 0 solved, 422 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/544 variables, 0/654 constraints. Problems are: Problem set: 0 solved, 422 unsolved
[2024-06-02 22:11:53] [INFO ] Deduced a trap composed of 41 places in 41 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 544/545 variables, and 655 constraints, problems are : Problem set: 0 solved, 422 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 152/152 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 422/422 constraints, Known Traps: 18/18 constraints]
After SMT, in 50268ms problems are : Problem set: 0 solved, 422 unsolved
Search for dead transitions found 0 dead transitions in 50274ms
Starting structural reductions in SI_LTL mode, iteration 1 : 152/194 places, 429/517 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 50667 ms. Remains : 152/194 places, 429/517 transitions.
Stuttering acceptance computed with spot in 135 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), true, (NOT p2), (OR (NOT p2) (NOT p1))]
Running random walk in product with property : FireWire-PT-13-LTLFireability-11
Entered a terminal (fully accepting) state of product in 120 steps with 4 reset in 1 ms.
FORMULA FireWire-PT-13-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-13-LTLFireability-11 finished in 50823 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 4 out of 194 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 194/194 places, 517/517 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 3 Pre rules applied. Total rules applied 0 place count 193 transition count 513
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 190 transition count 513
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 11 place count 185 transition count 500
Iterating global reduction 0 with 5 rules applied. Total rules applied 16 place count 185 transition count 500
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 18 place count 185 transition count 498
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 21 place count 182 transition count 492
Iterating global reduction 1 with 3 rules applied. Total rules applied 24 place count 182 transition count 492
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 27 place count 179 transition count 483
Iterating global reduction 1 with 3 rules applied. Total rules applied 30 place count 179 transition count 483
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 33 place count 176 transition count 477
Iterating global reduction 1 with 3 rules applied. Total rules applied 36 place count 176 transition count 477
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 39 place count 173 transition count 468
Iterating global reduction 1 with 3 rules applied. Total rules applied 42 place count 173 transition count 468
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 45 place count 170 transition count 462
Iterating global reduction 1 with 3 rules applied. Total rules applied 48 place count 170 transition count 462
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 51 place count 167 transition count 454
Iterating global reduction 1 with 3 rules applied. Total rules applied 54 place count 167 transition count 454
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 57 place count 164 transition count 448
Iterating global reduction 1 with 3 rules applied. Total rules applied 60 place count 164 transition count 448
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 62 place count 162 transition count 442
Iterating global reduction 1 with 2 rules applied. Total rules applied 64 place count 162 transition count 442
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 66 place count 160 transition count 438
Iterating global reduction 1 with 2 rules applied. Total rules applied 68 place count 160 transition count 438
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 69 place count 159 transition count 436
Iterating global reduction 1 with 1 rules applied. Total rules applied 70 place count 159 transition count 436
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 71 place count 158 transition count 434
Iterating global reduction 1 with 1 rules applied. Total rules applied 72 place count 158 transition count 434
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 78 place count 155 transition count 431
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 84 place count 152 transition count 437
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 90 place count 152 transition count 431
Applied a total of 90 rules in 42 ms. Remains 152 /194 variables (removed 42) and now considering 431/517 (removed 86) transitions.
[2024-06-02 22:11:54] [INFO ] Flow matrix only has 392 transitions (discarded 39 similar events)
// Phase 1: matrix 392 rows 152 cols
[2024-06-02 22:11:54] [INFO ] Computed 7 invariants in 4 ms
[2024-06-02 22:11:54] [INFO ] Implicit Places using invariants in 76 ms returned []
[2024-06-02 22:11:54] [INFO ] Flow matrix only has 392 transitions (discarded 39 similar events)
[2024-06-02 22:11:54] [INFO ] Invariant cache hit.
[2024-06-02 22:11:54] [INFO ] State equation strengthened by 56 read => feed constraints.
[2024-06-02 22:11:54] [INFO ] Implicit Places using invariants and state equation in 273 ms returned []
Implicit Place search using SMT with State Equation took 351 ms to find 0 implicit places.
[2024-06-02 22:11:54] [INFO ] Redundant transitions in 2 ms returned []
Running 424 sub problems to find dead transitions.
[2024-06-02 22:11:54] [INFO ] Flow matrix only has 392 transitions (discarded 39 similar events)
[2024-06-02 22:11:54] [INFO ] Invariant cache hit.
[2024-06-02 22:11:54] [INFO ] State equation strengthened by 56 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/152 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 424 unsolved
[2024-06-02 22:11:56] [INFO ] Deduced a trap composed of 54 places in 82 ms of which 1 ms to minimize.
[2024-06-02 22:11:56] [INFO ] Deduced a trap composed of 33 places in 74 ms of which 1 ms to minimize.
[2024-06-02 22:11:56] [INFO ] Deduced a trap composed of 28 places in 71 ms of which 1 ms to minimize.
[2024-06-02 22:11:56] [INFO ] Deduced a trap composed of 17 places in 77 ms of which 1 ms to minimize.
[2024-06-02 22:11:56] [INFO ] Deduced a trap composed of 33 places in 34 ms of which 1 ms to minimize.
[2024-06-02 22:11:57] [INFO ] Deduced a trap composed of 17 places in 72 ms of which 1 ms to minimize.
[2024-06-02 22:11:57] [INFO ] Deduced a trap composed of 17 places in 61 ms of which 1 ms to minimize.
[2024-06-02 22:11:57] [INFO ] Deduced a trap composed of 29 places in 72 ms of which 2 ms to minimize.
[2024-06-02 22:11:57] [INFO ] Deduced a trap composed of 33 places in 35 ms of which 1 ms to minimize.
[2024-06-02 22:11:57] [INFO ] Deduced a trap composed of 23 places in 65 ms of which 1 ms to minimize.
[2024-06-02 22:11:58] [INFO ] Deduced a trap composed of 16 places in 72 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/152 variables, 11/18 constraints. Problems are: Problem set: 0 solved, 424 unsolved
[2024-06-02 22:11:58] [INFO ] Deduced a trap composed of 54 places in 79 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/152 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/152 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 4 (OVERLAPS) 391/543 variables, 152/171 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/543 variables, 56/227 constraints. Problems are: Problem set: 0 solved, 424 unsolved
[2024-06-02 22:12:06] [INFO ] Deduced a trap composed of 32 places in 44 ms of which 1 ms to minimize.
[2024-06-02 22:12:06] [INFO ] Deduced a trap composed of 32 places in 37 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/543 variables, 2/229 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/543 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 8 (OVERLAPS) 0/543 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 424 unsolved
No progress, stopping.
After SMT solving in domain Real declared 543/544 variables, and 229 constraints, problems are : Problem set: 0 solved, 424 unsolved in 19769 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 152/152 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 424/424 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 424 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/152 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/152 variables, 14/21 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/152 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 3 (OVERLAPS) 391/543 variables, 152/173 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/543 variables, 56/229 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/543 variables, 424/653 constraints. Problems are: Problem set: 0 solved, 424 unsolved
[2024-06-02 22:12:21] [INFO ] Deduced a trap composed of 41 places in 41 ms of which 1 ms to minimize.
[2024-06-02 22:12:23] [INFO ] Deduced a trap composed of 34 places in 42 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/543 variables, 2/655 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/543 variables, 0/655 constraints. Problems are: Problem set: 0 solved, 424 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 543/544 variables, and 655 constraints, problems are : Problem set: 0 solved, 424 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 152/152 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 424/424 constraints, Known Traps: 16/16 constraints]
After SMT, in 50092ms problems are : Problem set: 0 solved, 424 unsolved
Search for dead transitions found 0 dead transitions in 50097ms
Starting structural reductions in SI_LTL mode, iteration 1 : 152/194 places, 431/517 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 50500 ms. Remains : 152/194 places, 431/517 transitions.
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Running random walk in product with property : FireWire-PT-13-LTLFireability-12
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA FireWire-PT-13-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-13-LTLFireability-12 finished in 50558 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((!(F(G(p0)) U !p1)||F(X((G(p2)&&p3))))))'
Support contains 4 out of 194 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 194/194 places, 517/517 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 190 transition count 507
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 190 transition count 507
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 10 place count 190 transition count 505
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 12 place count 188 transition count 501
Iterating global reduction 1 with 2 rules applied. Total rules applied 14 place count 188 transition count 501
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 16 place count 186 transition count 495
Iterating global reduction 1 with 2 rules applied. Total rules applied 18 place count 186 transition count 495
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 20 place count 184 transition count 491
Iterating global reduction 1 with 2 rules applied. Total rules applied 22 place count 184 transition count 491
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 24 place count 182 transition count 485
Iterating global reduction 1 with 2 rules applied. Total rules applied 26 place count 182 transition count 485
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 28 place count 180 transition count 481
Iterating global reduction 1 with 2 rules applied. Total rules applied 30 place count 180 transition count 481
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 32 place count 178 transition count 475
Iterating global reduction 1 with 2 rules applied. Total rules applied 34 place count 178 transition count 475
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 36 place count 176 transition count 471
Iterating global reduction 1 with 2 rules applied. Total rules applied 38 place count 176 transition count 471
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 39 place count 175 transition count 468
Iterating global reduction 1 with 1 rules applied. Total rules applied 40 place count 175 transition count 468
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 41 place count 174 transition count 466
Iterating global reduction 1 with 1 rules applied. Total rules applied 42 place count 174 transition count 466
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 43 place count 173 transition count 464
Iterating global reduction 1 with 1 rules applied. Total rules applied 44 place count 173 transition count 464
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 45 place count 172 transition count 462
Iterating global reduction 1 with 1 rules applied. Total rules applied 46 place count 172 transition count 462
Applied a total of 46 rules in 18 ms. Remains 172 /194 variables (removed 22) and now considering 462/517 (removed 55) transitions.
[2024-06-02 22:12:45] [INFO ] Flow matrix only has 430 transitions (discarded 32 similar events)
// Phase 1: matrix 430 rows 172 cols
[2024-06-02 22:12:45] [INFO ] Computed 7 invariants in 2 ms
[2024-06-02 22:12:45] [INFO ] Implicit Places using invariants in 85 ms returned []
[2024-06-02 22:12:45] [INFO ] Flow matrix only has 430 transitions (discarded 32 similar events)
[2024-06-02 22:12:45] [INFO ] Invariant cache hit.
[2024-06-02 22:12:45] [INFO ] State equation strengthened by 62 read => feed constraints.
[2024-06-02 22:12:45] [INFO ] Implicit Places using invariants and state equation in 278 ms returned []
Implicit Place search using SMT with State Equation took 405 ms to find 0 implicit places.
Running 461 sub problems to find dead transitions.
[2024-06-02 22:12:45] [INFO ] Flow matrix only has 430 transitions (discarded 32 similar events)
[2024-06-02 22:12:45] [INFO ] Invariant cache hit.
[2024-06-02 22:12:45] [INFO ] State equation strengthened by 62 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/171 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 1 (OVERLAPS) 1/172 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 461 unsolved
[2024-06-02 22:12:48] [INFO ] Deduced a trap composed of 58 places in 87 ms of which 1 ms to minimize.
[2024-06-02 22:12:48] [INFO ] Deduced a trap composed of 35 places in 42 ms of which 0 ms to minimize.
[2024-06-02 22:12:48] [INFO ] Deduced a trap composed of 17 places in 88 ms of which 1 ms to minimize.
[2024-06-02 22:12:48] [INFO ] Deduced a trap composed of 26 places in 92 ms of which 1 ms to minimize.
[2024-06-02 22:12:49] [INFO ] Deduced a trap composed of 24 places in 95 ms of which 2 ms to minimize.
[2024-06-02 22:12:49] [INFO ] Deduced a trap composed of 35 places in 42 ms of which 0 ms to minimize.
[2024-06-02 22:12:50] [INFO ] Deduced a trap composed of 26 places in 98 ms of which 2 ms to minimize.
[2024-06-02 22:12:50] [INFO ] Deduced a trap composed of 35 places in 52 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/172 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/172 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 4 (OVERLAPS) 429/601 variables, 172/187 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/601 variables, 61/248 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/601 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 7 (OVERLAPS) 1/602 variables, 1/249 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/602 variables, 0/249 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 9 (OVERLAPS) 0/602 variables, 0/249 constraints. Problems are: Problem set: 0 solved, 461 unsolved
No progress, stopping.
After SMT solving in domain Real declared 602/602 variables, and 249 constraints, problems are : Problem set: 0 solved, 461 unsolved in 27041 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 172/172 constraints, ReadFeed: 62/62 constraints, PredecessorRefiner: 461/461 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 461 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/171 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 1 (OVERLAPS) 1/172 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/172 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/172 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 4 (OVERLAPS) 429/601 variables, 172/187 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/601 variables, 61/248 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/601 variables, 461/709 constraints. Problems are: Problem set: 0 solved, 461 unsolved
[2024-06-02 22:13:22] [INFO ] Deduced a trap composed of 43 places in 31 ms of which 1 ms to minimize.
[2024-06-02 22:13:29] [INFO ] Deduced a trap composed of 35 places in 54 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/601 variables, 2/711 constraints. Problems are: Problem set: 0 solved, 461 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 601/602 variables, and 711 constraints, problems are : Problem set: 0 solved, 461 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 172/172 constraints, ReadFeed: 61/62 constraints, PredecessorRefiner: 461/461 constraints, Known Traps: 10/10 constraints]
After SMT, in 57404ms problems are : Problem set: 0 solved, 461 unsolved
Search for dead transitions found 0 dead transitions in 57408ms
Starting structural reductions in LTL mode, iteration 1 : 172/194 places, 462/517 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 57832 ms. Remains : 172/194 places, 462/517 transitions.
Stuttering acceptance computed with spot in 356 ms :[(OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2))), (OR (AND p0 (NOT p1) (NOT p3)) (AND p0 (NOT p1) (NOT p2))), (OR (AND p0 (NOT p1) (NOT p3)) (AND p0 (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2))]
Running random walk in product with property : FireWire-PT-13-LTLFireability-13
Product exploration explored 100000 steps with 2 reset in 182 ms.
Product exploration explored 100000 steps with 7 reset in 225 ms.
Computed a total of 31 stabilizing places and 71 stable transitions
Computed a total of 31 stabilizing places and 71 stable transitions
Detected a total of 31/172 stabilizing places and 71/462 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/4 atomic propositions.
Knowledge obtained : [(AND (NOT p1) (NOT p0) p3 p2), (X p2), (X p3), (X (AND (NOT p1) p3 p2)), (X (NOT (OR (NOT p3) (NOT p2)))), (X (NOT (OR (AND p0 (NOT p1) (NOT p3)) (AND p0 (NOT p1) (NOT p2))))), (X (NOT (AND p0 (NOT p1) p3 p2))), (X (NOT (OR (AND p1 (NOT p3)) (AND p1 (NOT p2))))), (X (NOT (OR (AND p0 (NOT p3)) (AND p0 (NOT p2))))), (X (NOT (AND p0 p1 p3 p2))), (X (NOT (OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2))))), (X (NOT (OR (AND p0 p1 (NOT p3)) (AND p0 p1 (NOT p2))))), (X (AND p3 p2)), (X (NOT p0)), (X (NOT p1)), (X (NOT (AND p1 p3 p2))), (X (X p2)), (X (X p3)), (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND (NOT p1) p3 p2))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND p0 p1 p2)))), (X (X (NOT (OR (NOT p3) (NOT p2))))), (X (X (NOT (OR (AND p0 (NOT p1) (NOT p3)) (AND p0 (NOT p1) (NOT p2)))))), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND p0 (NOT p1) p3 p2)))), (X (X (NOT (OR (AND p1 (NOT p3)) (AND p1 (NOT p2)))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (OR (AND p0 (NOT p3)) (AND p0 (NOT p2)))))), (X (X (NOT (AND p0 p1 p3 p2)))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2)))))), (X (X (NOT (OR (AND p0 p1 (NOT p3)) (AND p0 p1 (NOT p2)))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (AND p3 p2))), (X (X (NOT p0))), (X (X (NOT p1))), (X (X (NOT (AND p1 p3 p2)))), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : []
Knowledge based reduction with 41 factoid took 159 ms. Reduced automaton from 7 states, 29 edges and 4 AP (stutter sensitive) to 7 states, 27 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 337 ms :[(OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2))), (OR (AND p0 (NOT p1) (NOT p3)) (AND p0 (NOT p1) (NOT p2))), (OR (AND p0 (NOT p1) (NOT p3)) (AND p0 (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2))]
Reduction of identical properties reduced properties to check from 24 to 23
RANDOM walk for 40000 steps (1163 resets) in 441 ms. (90 steps per ms) remains 19/23 properties
BEST_FIRST walk for 4004 steps (22 resets) in 10 ms. (364 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (23 resets) in 9 ms. (400 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (23 resets) in 8 ms. (444 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (24 resets) in 9 ms. (400 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (21 resets) in 9 ms. (400 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (22 resets) in 10 ms. (363 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (27 resets) in 60 ms. (65 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (24 resets) in 12 ms. (307 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (30 resets) in 9 ms. (400 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4002 steps (22 resets) in 10 ms. (363 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (27 resets) in 21 ms. (181 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (30 resets) in 12 ms. (308 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (20 resets) in 26 ms. (148 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4002 steps (16 resets) in 41 ms. (95 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4002 steps (23 resets) in 10 ms. (363 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (27 resets) in 9 ms. (400 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (21 resets) in 18 ms. (210 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (20 resets) in 9 ms. (400 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4002 steps (25 resets) in 9 ms. (400 steps per ms) remains 19/19 properties
[2024-06-02 22:13:44] [INFO ] Flow matrix only has 430 transitions (discarded 32 similar events)
[2024-06-02 22:13:44] [INFO ] Invariant cache hit.
[2024-06-02 22:13:44] [INFO ] State equation strengthened by 62 read => feed constraints.
Problem apf7 is UNSAT
Problem apf15 is UNSAT
Problem apf16 is UNSAT
Problem apf23 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 4 solved, 15 unsolved
At refinement iteration 1 (OVERLAPS) 104/108 variables, 3/3 constraints. Problems are: Problem set: 4 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 0/3 constraints. Problems are: Problem set: 4 solved, 15 unsolved
At refinement iteration 3 (OVERLAPS) 50/158 variables, 4/7 constraints. Problems are: Problem set: 4 solved, 15 unsolved
[2024-06-02 22:13:44] [INFO ] Deduced a trap composed of 35 places in 35 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/158 variables, 1/8 constraints. Problems are: Problem set: 4 solved, 15 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/158 variables, 0/8 constraints. Problems are: Problem set: 4 solved, 15 unsolved
At refinement iteration 6 (OVERLAPS) 418/576 variables, 158/166 constraints. Problems are: Problem set: 4 solved, 15 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/576 variables, 58/224 constraints. Problems are: Problem set: 4 solved, 15 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/576 variables, 0/224 constraints. Problems are: Problem set: 4 solved, 15 unsolved
At refinement iteration 9 (OVERLAPS) 25/601 variables, 14/238 constraints. Problems are: Problem set: 4 solved, 15 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/601 variables, 3/241 constraints. Problems are: Problem set: 4 solved, 15 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/601 variables, 0/241 constraints. Problems are: Problem set: 4 solved, 15 unsolved
At refinement iteration 12 (OVERLAPS) 1/602 variables, 1/242 constraints. Problems are: Problem set: 4 solved, 15 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/602 variables, 0/242 constraints. Problems are: Problem set: 4 solved, 15 unsolved
At refinement iteration 14 (OVERLAPS) 0/602 variables, 0/242 constraints. Problems are: Problem set: 4 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Real declared 602/602 variables, and 242 constraints, problems are : Problem set: 4 solved, 15 unsolved in 1337 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 172/172 constraints, ReadFeed: 62/62 constraints, PredecessorRefiner: 19/19 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 4 solved, 15 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 4 solved, 15 unsolved
Problem apf13 is UNSAT
Problem apf19 is UNSAT
At refinement iteration 1 (OVERLAPS) 104/108 variables, 3/3 constraints. Problems are: Problem set: 6 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 0/3 constraints. Problems are: Problem set: 6 solved, 13 unsolved
At refinement iteration 3 (OVERLAPS) 50/158 variables, 4/7 constraints. Problems are: Problem set: 6 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/158 variables, 1/8 constraints. Problems are: Problem set: 6 solved, 13 unsolved
[2024-06-02 22:13:46] [INFO ] Deduced a trap composed of 35 places in 32 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/158 variables, 1/9 constraints. Problems are: Problem set: 6 solved, 13 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/158 variables, 0/9 constraints. Problems are: Problem set: 6 solved, 13 unsolved
At refinement iteration 7 (OVERLAPS) 418/576 variables, 158/167 constraints. Problems are: Problem set: 6 solved, 13 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/576 variables, 58/225 constraints. Problems are: Problem set: 6 solved, 13 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/576 variables, 8/233 constraints. Problems are: Problem set: 6 solved, 13 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/576 variables, 0/233 constraints. Problems are: Problem set: 6 solved, 13 unsolved
Problem apf9 is UNSAT
At refinement iteration 11 (OVERLAPS) 25/601 variables, 14/247 constraints. Problems are: Problem set: 7 solved, 12 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/601 variables, 3/250 constraints. Problems are: Problem set: 7 solved, 12 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/601 variables, 4/254 constraints. Problems are: Problem set: 7 solved, 12 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/601 variables, 0/254 constraints. Problems are: Problem set: 7 solved, 12 unsolved
At refinement iteration 15 (OVERLAPS) 1/602 variables, 1/255 constraints. Problems are: Problem set: 7 solved, 12 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/602 variables, 0/255 constraints. Problems are: Problem set: 7 solved, 12 unsolved
At refinement iteration 17 (OVERLAPS) 0/602 variables, 0/255 constraints. Problems are: Problem set: 7 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Int declared 602/602 variables, and 255 constraints, problems are : Problem set: 7 solved, 12 unsolved in 1441 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 172/172 constraints, ReadFeed: 62/62 constraints, PredecessorRefiner: 12/19 constraints, Known Traps: 2/2 constraints]
After SMT, in 2796ms problems are : Problem set: 7 solved, 12 unsolved
Fused 12 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 690 ms.
Support contains 4 out of 172 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 172/172 places, 462/462 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 172 transition count 459
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 3 Pre rules applied. Total rules applied 3 place count 172 transition count 456
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 9 place count 169 transition count 456
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 13 place count 167 transition count 454
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 19 place count 164 transition count 460
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 25 place count 164 transition count 454
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 164 transition count 451
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 2 with 3 rules applied. Total rules applied 31 place count 164 transition count 457
Reduce places removed 3 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 40 place count 161 transition count 451
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 3 with 6 rules applied. Total rules applied 46 place count 161 transition count 445
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 47 place count 160 transition count 444
Applied a total of 47 rules in 27 ms. Remains 160 /172 variables (removed 12) and now considering 444/462 (removed 18) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27 ms. Remains : 160/172 places, 444/462 transitions.
RANDOM walk for 40000 steps (1281 resets) in 512 ms. (77 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (273 resets) in 176 ms. (226 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (293 resets) in 161 ms. (246 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (283 resets) in 130 ms. (305 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (260 resets) in 59 ms. (666 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (291 resets) in 266 ms. (149 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (271 resets) in 58 ms. (678 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (271 resets) in 222 ms. (179 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (261 resets) in 247 ms. (161 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (293 resets) in 180 ms. (221 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (278 resets) in 199 ms. (200 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (269 resets) in 119 ms. (333 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (289 resets) in 143 ms. (277 steps per ms) remains 12/12 properties
Interrupted probabilistic random walk after 312628 steps, run timeout after 3001 ms. (steps per millisecond=104 ) properties seen :0 out of 12
Probabilistic random walk after 312628 steps, saw 84140 distinct states, run finished after 3001 ms. (steps per millisecond=104 ) properties seen :0
[2024-06-02 22:13:52] [INFO ] Flow matrix only has 407 transitions (discarded 37 similar events)
// Phase 1: matrix 407 rows 160 cols
[2024-06-02 22:13:52] [INFO ] Computed 7 invariants in 1 ms
[2024-06-02 22:13:52] [INFO ] State equation strengthened by 60 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 99/103 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/103 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 356/459 variables, 103/106 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/459 variables, 40/146 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/459 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (OVERLAPS) 97/556 variables, 50/196 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/556 variables, 3/199 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/556 variables, 20/219 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/556 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 10 (OVERLAPS) 10/566 variables, 6/225 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/566 variables, 1/226 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/566 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 13 (OVERLAPS) 1/567 variables, 1/227 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/567 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 15 (OVERLAPS) 0/567 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Real declared 567/567 variables, and 227 constraints, problems are : Problem set: 0 solved, 12 unsolved in 1134 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 160/160 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 12 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 99/103 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/103 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 356/459 variables, 103/106 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/459 variables, 40/146 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/459 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (OVERLAPS) 97/556 variables, 50/196 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/556 variables, 3/199 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/556 variables, 20/219 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/556 variables, 12/231 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/556 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 11 (OVERLAPS) 10/566 variables, 6/237 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/566 variables, 1/238 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/566 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 14 (OVERLAPS) 1/567 variables, 1/239 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/567 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 16 (OVERLAPS) 0/567 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Int declared 567/567 variables, and 239 constraints, problems are : Problem set: 0 solved, 12 unsolved in 1152 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 160/160 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints]
After SMT, in 2323ms problems are : Problem set: 0 solved, 12 unsolved
Fused 12 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 924 ms.
Support contains 4 out of 160 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 160/160 places, 444/444 transitions.
Applied a total of 0 rules in 5 ms. Remains 160 /160 variables (removed 0) and now considering 444/444 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 160/160 places, 444/444 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 160/160 places, 444/444 transitions.
Applied a total of 0 rules in 4 ms. Remains 160 /160 variables (removed 0) and now considering 444/444 (removed 0) transitions.
[2024-06-02 22:13:55] [INFO ] Flow matrix only has 407 transitions (discarded 37 similar events)
[2024-06-02 22:13:55] [INFO ] Invariant cache hit.
[2024-06-02 22:13:55] [INFO ] Implicit Places using invariants in 85 ms returned []
[2024-06-02 22:13:55] [INFO ] Flow matrix only has 407 transitions (discarded 37 similar events)
[2024-06-02 22:13:55] [INFO ] Invariant cache hit.
[2024-06-02 22:13:55] [INFO ] State equation strengthened by 60 read => feed constraints.
[2024-06-02 22:13:55] [INFO ] Implicit Places using invariants and state equation in 264 ms returned []
Implicit Place search using SMT with State Equation took 350 ms to find 0 implicit places.
[2024-06-02 22:13:55] [INFO ] Redundant transitions in 4 ms returned []
Running 438 sub problems to find dead transitions.
[2024-06-02 22:13:55] [INFO ] Flow matrix only has 407 transitions (discarded 37 similar events)
[2024-06-02 22:13:55] [INFO ] Invariant cache hit.
[2024-06-02 22:13:55] [INFO ] State equation strengthened by 60 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/160 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 438 unsolved
[2024-06-02 22:13:57] [INFO ] Deduced a trap composed of 55 places in 104 ms of which 1 ms to minimize.
[2024-06-02 22:13:57] [INFO ] Deduced a trap composed of 59 places in 67 ms of which 1 ms to minimize.
[2024-06-02 22:13:57] [INFO ] Deduced a trap composed of 32 places in 30 ms of which 0 ms to minimize.
[2024-06-02 22:13:57] [INFO ] Deduced a trap composed of 58 places in 83 ms of which 1 ms to minimize.
[2024-06-02 22:13:57] [INFO ] Deduced a trap composed of 27 places in 78 ms of which 2 ms to minimize.
[2024-06-02 22:13:57] [INFO ] Deduced a trap composed of 23 places in 72 ms of which 1 ms to minimize.
[2024-06-02 22:13:58] [INFO ] Deduced a trap composed of 32 places in 43 ms of which 1 ms to minimize.
[2024-06-02 22:13:58] [INFO ] Deduced a trap composed of 29 places in 80 ms of which 1 ms to minimize.
[2024-06-02 22:13:58] [INFO ] Deduced a trap composed of 17 places in 76 ms of which 1 ms to minimize.
[2024-06-02 22:13:58] [INFO ] Deduced a trap composed of 32 places in 38 ms of which 1 ms to minimize.
[2024-06-02 22:13:59] [INFO ] Deduced a trap composed of 17 places in 84 ms of which 1 ms to minimize.
[2024-06-02 22:13:59] [INFO ] Deduced a trap composed of 51 places in 82 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/160 variables, 12/19 constraints. Problems are: Problem set: 0 solved, 438 unsolved
[2024-06-02 22:14:00] [INFO ] Deduced a trap composed of 54 places in 77 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/160 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 438 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/160 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 438 unsolved
At refinement iteration 4 (OVERLAPS) 407/567 variables, 160/180 constraints. Problems are: Problem set: 0 solved, 438 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/567 variables, 60/240 constraints. Problems are: Problem set: 0 solved, 438 unsolved
[2024-06-02 22:14:05] [INFO ] Deduced a trap composed of 40 places in 39 ms of which 1 ms to minimize.
[2024-06-02 22:14:07] [INFO ] Deduced a trap composed of 40 places in 43 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/567 variables, 2/242 constraints. Problems are: Problem set: 0 solved, 438 unsolved
[2024-06-02 22:14:13] [INFO ] Deduced a trap composed of 31 places in 28 ms of which 1 ms to minimize.
[2024-06-02 22:14:13] [INFO ] Deduced a trap composed of 40 places in 38 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/567 variables, 2/244 constraints. Problems are: Problem set: 0 solved, 438 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/567 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 438 unsolved
At refinement iteration 9 (OVERLAPS) 0/567 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 438 unsolved
No progress, stopping.
After SMT solving in domain Real declared 567/567 variables, and 244 constraints, problems are : Problem set: 0 solved, 438 unsolved in 29315 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 160/160 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 438/438 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 0 solved, 438 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/160 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 438 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/160 variables, 17/24 constraints. Problems are: Problem set: 0 solved, 438 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/160 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 438 unsolved
At refinement iteration 3 (OVERLAPS) 407/567 variables, 160/184 constraints. Problems are: Problem set: 0 solved, 438 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/567 variables, 60/244 constraints. Problems are: Problem set: 0 solved, 438 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/567 variables, 438/682 constraints. Problems are: Problem set: 0 solved, 438 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/567 variables, 0/682 constraints. Problems are: Problem set: 0 solved, 438 unsolved
At refinement iteration 7 (OVERLAPS) 0/567 variables, 0/682 constraints. Problems are: Problem set: 0 solved, 438 unsolved
No progress, stopping.
After SMT solving in domain Int declared 567/567 variables, and 682 constraints, problems are : Problem set: 0 solved, 438 unsolved in 30009 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 160/160 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 438/438 constraints, Known Traps: 17/17 constraints]
After SMT, in 59684ms problems are : Problem set: 0 solved, 438 unsolved
Search for dead transitions found 0 dead transitions in 59688ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60057 ms. Remains : 160/160 places, 444/444 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 140 edges and 160 vertex of which 29 / 160 are part of one of the 4 SCC in 0 ms
Free SCC test removed 25 places
Drop transitions (Empty/Sink Transition effects.) removed 123 transitions
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 144 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 134 transition count 299
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 0 with 9 rules applied. Total rules applied 12 place count 134 transition count 290
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 133 transition count 289
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 15 place count 133 transition count 288
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 17 place count 132 transition count 287
Free-agglomeration rule applied 9 times with reduction of 6 identical transitions.
Iterating global reduction 0 with 9 rules applied. Total rules applied 26 place count 132 transition count 272
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 38 place count 123 transition count 269
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 44 place count 123 transition count 269
Applied a total of 44 rules in 20 ms. Remains 123 /160 variables (removed 37) and now considering 269/444 (removed 175) transitions.
Running SMT prover for 12 properties.
[2024-06-02 22:14:55] [INFO ] Flow matrix only has 267 transitions (discarded 2 similar events)
// Phase 1: matrix 267 rows 123 cols
[2024-06-02 22:14:55] [INFO ] Computed 7 invariants in 1 ms
[2024-06-02 22:14:55] [INFO ] [Real]Absence check using 7 positive place invariants in 1 ms returned sat
[2024-06-02 22:14:55] [INFO ] After 136ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:12
[2024-06-02 22:14:55] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-02 22:14:55] [INFO ] After 165ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :12
TRAPS : Iteration 0
[2024-06-02 22:14:55] [INFO ] Deduced a trap composed of 21 places in 42 ms of which 1 ms to minimize.
[2024-06-02 22:14:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 62 ms
TRAPS : Iteration 1
[2024-06-02 22:14:56] [INFO ] After 603ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :12
[2024-06-02 22:14:56] [INFO ] After 806ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :12
Over-approximation ignoring read arcs solved 0 properties in 980 ms.
Found 7 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p0) p3 p2), (X p2), (X p3), (X (AND (NOT p1) p3 p2)), (X (NOT (OR (NOT p3) (NOT p2)))), (X (NOT (OR (AND p0 (NOT p1) (NOT p3)) (AND p0 (NOT p1) (NOT p2))))), (X (NOT (AND p0 (NOT p1) p3 p2))), (X (NOT (OR (AND p1 (NOT p3)) (AND p1 (NOT p2))))), (X (NOT (OR (AND p0 (NOT p3)) (AND p0 (NOT p2))))), (X (NOT (AND p0 p1 p3 p2))), (X (NOT (OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2))))), (X (NOT (OR (AND p0 p1 (NOT p3)) (AND p0 p1 (NOT p2))))), (X (AND p3 p2)), (X (NOT p0)), (X (NOT p1)), (X (NOT (AND p1 p3 p2))), (X (X p2)), (X (X p3)), (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND (NOT p1) p3 p2))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND p0 p1 p2)))), (X (X (NOT (OR (NOT p3) (NOT p2))))), (X (X (NOT (OR (AND p0 (NOT p1) (NOT p3)) (AND p0 (NOT p1) (NOT p2)))))), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND p0 (NOT p1) p3 p2)))), (X (X (NOT (OR (AND p1 (NOT p3)) (AND p1 (NOT p2)))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (OR (AND p0 (NOT p3)) (AND p0 (NOT p2)))))), (X (X (NOT (AND p0 p1 p3 p2)))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2)))))), (X (X (NOT (OR (AND p0 p1 (NOT p3)) (AND p0 p1 (NOT p2)))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (AND p3 p2))), (X (X (NOT p0))), (X (X (NOT p1))), (X (X (NOT (AND p1 p3 p2)))), (F (OR (G p3) (G (NOT p3)))), (G (OR (NOT p0) (NOT p1) (NOT p2))), (G (AND (OR (NOT p0) p1 p3) (OR (NOT p0) p1 p2))), (G (OR (NOT p0) (NOT p1) (NOT p3) (NOT p2))), (G (OR (NOT p0) p1 p2)), (G (OR (NOT p1) (NOT p3) (NOT p2))), (G (OR p1 p2)), (G (OR (NOT p1) (NOT p2)))]
False Knowledge obtained : [(F (NOT (AND p3 p2))), (F (NOT (AND (NOT p1) p3 p2))), (F (NOT (AND (OR p1 p3) (OR p1 p2)))), (F (NOT p3)), (F (NOT (AND p3 p2)))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 48 factoid took 315 ms. Reduced automaton from 7 states, 27 edges and 4 AP (stutter sensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 96 ms :[false, false, false]
Stuttering acceptance computed with spot in 90 ms :[false, false, false]
Support contains 3 out of 172 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 172/172 places, 462/462 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 3 Pre rules applied. Total rules applied 0 place count 171 transition count 458
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 168 transition count 458
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 10 place count 166 transition count 456
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 16 place count 163 transition count 462
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 0 with 6 rules applied. Total rules applied 22 place count 163 transition count 456
Applied a total of 22 rules in 17 ms. Remains 163 /172 variables (removed 9) and now considering 456/462 (removed 6) transitions.
[2024-06-02 22:14:56] [INFO ] Flow matrix only has 417 transitions (discarded 39 similar events)
// Phase 1: matrix 417 rows 163 cols
[2024-06-02 22:14:56] [INFO ] Computed 7 invariants in 2 ms
[2024-06-02 22:14:57] [INFO ] Implicit Places using invariants in 225 ms returned []
[2024-06-02 22:14:57] [INFO ] Flow matrix only has 417 transitions (discarded 39 similar events)
[2024-06-02 22:14:57] [INFO ] Invariant cache hit.
[2024-06-02 22:14:57] [INFO ] State equation strengthened by 60 read => feed constraints.
[2024-06-02 22:14:57] [INFO ] Implicit Places using invariants and state equation in 397 ms returned []
Implicit Place search using SMT with State Equation took 641 ms to find 0 implicit places.
[2024-06-02 22:14:57] [INFO ] Redundant transitions in 2 ms returned []
Running 449 sub problems to find dead transitions.
[2024-06-02 22:14:57] [INFO ] Flow matrix only has 417 transitions (discarded 39 similar events)
[2024-06-02 22:14:57] [INFO ] Invariant cache hit.
[2024-06-02 22:14:57] [INFO ] State equation strengthened by 60 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/163 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 449 unsolved
[2024-06-02 22:14:59] [INFO ] Deduced a trap composed of 57 places in 108 ms of which 1 ms to minimize.
[2024-06-02 22:14:59] [INFO ] Deduced a trap composed of 17 places in 84 ms of which 1 ms to minimize.
[2024-06-02 22:14:59] [INFO ] Deduced a trap composed of 23 places in 84 ms of which 1 ms to minimize.
[2024-06-02 22:14:59] [INFO ] Deduced a trap composed of 33 places in 52 ms of which 1 ms to minimize.
[2024-06-02 22:15:00] [INFO ] Deduced a trap composed of 17 places in 113 ms of which 1 ms to minimize.
[2024-06-02 22:15:00] [INFO ] Deduced a trap composed of 17 places in 85 ms of which 1 ms to minimize.
[2024-06-02 22:15:00] [INFO ] Deduced a trap composed of 25 places in 105 ms of which 1 ms to minimize.
[2024-06-02 22:15:00] [INFO ] Deduced a trap composed of 33 places in 36 ms of which 0 ms to minimize.
[2024-06-02 22:15:00] [INFO ] Deduced a trap composed of 25 places in 87 ms of which 1 ms to minimize.
[2024-06-02 22:15:01] [INFO ] Deduced a trap composed of 33 places in 43 ms of which 0 ms to minimize.
[2024-06-02 22:15:01] [INFO ] Deduced a trap composed of 14 places in 68 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/163 variables, 11/18 constraints. Problems are: Problem set: 0 solved, 449 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/163 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 449 unsolved
At refinement iteration 3 (OVERLAPS) 416/579 variables, 163/181 constraints. Problems are: Problem set: 0 solved, 449 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/579 variables, 60/241 constraints. Problems are: Problem set: 0 solved, 449 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/579 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 449 unsolved
[2024-06-02 22:15:13] [INFO ] Deduced a trap composed of 32 places in 41 ms of which 0 ms to minimize.
[2024-06-02 22:15:13] [INFO ] Deduced a trap composed of 41 places in 35 ms of which 2 ms to minimize.
At refinement iteration 6 (OVERLAPS) 0/579 variables, 2/243 constraints. Problems are: Problem set: 0 solved, 449 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/579 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 449 unsolved
At refinement iteration 8 (OVERLAPS) 0/579 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 449 unsolved
No progress, stopping.
After SMT solving in domain Real declared 579/580 variables, and 243 constraints, problems are : Problem set: 0 solved, 449 unsolved in 24192 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 163/163 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 449/449 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 0 solved, 449 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/163 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 449 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/163 variables, 13/20 constraints. Problems are: Problem set: 0 solved, 449 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/163 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 449 unsolved
At refinement iteration 3 (OVERLAPS) 416/579 variables, 163/183 constraints. Problems are: Problem set: 0 solved, 449 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/579 variables, 60/243 constraints. Problems are: Problem set: 0 solved, 449 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/579 variables, 449/692 constraints. Problems are: Problem set: 0 solved, 449 unsolved
[2024-06-02 22:15:33] [INFO ] Deduced a trap composed of 41 places in 46 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/579 variables, 1/693 constraints. Problems are: Problem set: 0 solved, 449 unsolved
[2024-06-02 22:15:39] [INFO ] Deduced a trap composed of 41 places in 40 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/579 variables, 1/694 constraints. Problems are: Problem set: 0 solved, 449 unsolved
[2024-06-02 22:15:49] [INFO ] Deduced a trap composed of 36 places in 45 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 579/580 variables, and 695 constraints, problems are : Problem set: 0 solved, 449 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 163/163 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 449/449 constraints, Known Traps: 16/16 constraints]
After SMT, in 54566ms problems are : Problem set: 0 solved, 449 unsolved
Search for dead transitions found 0 dead transitions in 54570ms
Starting structural reductions in SI_LTL mode, iteration 1 : 163/172 places, 456/462 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 55257 ms. Remains : 163/172 places, 456/462 transitions.
Computed a total of 25 stabilizing places and 65 stable transitions
Computed a total of 25 stabilizing places and 65 stable transitions
Knowledge obtained : [(AND p2 (NOT p0)), (X p2), (X (NOT (AND p0 (NOT p2)))), (X (NOT p0)), (X (NOT (AND p0 p2))), (X (X p2)), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT p0))), (X (X (NOT (AND p0 p2))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 118 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter insensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 136 ms :[false, false, false]
RANDOM walk for 40000 steps (1253 resets) in 581 ms. (68 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (273 resets) in 79 ms. (500 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (261 resets) in 116 ms. (341 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (283 resets) in 174 ms. (228 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (285 resets) in 100 ms. (396 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 495238 steps, run timeout after 3001 ms. (steps per millisecond=165 ) properties seen :0 out of 4
Probabilistic random walk after 495238 steps, saw 116198 distinct states, run finished after 3001 ms. (steps per millisecond=165 ) properties seen :0
[2024-06-02 22:15:55] [INFO ] Flow matrix only has 417 transitions (discarded 39 similar events)
[2024-06-02 22:15:55] [INFO ] Invariant cache hit.
[2024-06-02 22:15:55] [INFO ] State equation strengthened by 60 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 101/104 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 361/465 variables, 104/107 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/465 variables, 40/147 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/465 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 101/566 variables, 50/197 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/566 variables, 3/200 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/566 variables, 20/220 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/566 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 12/578 variables, 8/228 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/578 variables, 1/229 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/578 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 1/579 variables, 1/230 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/579 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 0/579 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 579/580 variables, and 230 constraints, problems are : Problem set: 0 solved, 4 unsolved in 371 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 163/163 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 101/104 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 361/465 variables, 104/107 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/465 variables, 40/147 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/465 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 101/566 variables, 50/197 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/566 variables, 3/200 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/566 variables, 20/220 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/566 variables, 4/224 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/566 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 12/578 variables, 8/232 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/578 variables, 1/233 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/578 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 1/579 variables, 1/234 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/579 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 0/579 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 579/580 variables, and 234 constraints, problems are : Problem set: 0 solved, 4 unsolved in 525 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 163/163 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 907ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 223 ms.
Support contains 3 out of 163 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 163/163 places, 456/456 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 163 transition count 450
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 8 place count 162 transition count 449
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 1 with 3 rules applied. Total rules applied 11 place count 162 transition count 455
Reduce places removed 3 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 20 place count 159 transition count 449
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 2 with 6 rules applied. Total rules applied 26 place count 159 transition count 443
Applied a total of 26 rules in 18 ms. Remains 159 /163 variables (removed 4) and now considering 443/456 (removed 13) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 159/163 places, 443/456 transitions.
RANDOM walk for 40000 steps (1255 resets) in 616 ms. (64 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (276 resets) in 124 ms. (320 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (267 resets) in 151 ms. (263 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (270 resets) in 174 ms. (228 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (294 resets) in 44 ms. (888 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 462660 steps, run timeout after 3001 ms. (steps per millisecond=154 ) properties seen :0 out of 4
Probabilistic random walk after 462660 steps, saw 117696 distinct states, run finished after 3001 ms. (steps per millisecond=154 ) properties seen :0
[2024-06-02 22:16:00] [INFO ] Flow matrix only has 406 transitions (discarded 37 similar events)
// Phase 1: matrix 406 rows 159 cols
[2024-06-02 22:16:00] [INFO ] Computed 7 invariants in 1 ms
[2024-06-02 22:16:00] [INFO ] State equation strengthened by 60 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 99/102 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 354/456 variables, 102/105 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/456 variables, 40/145 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/456 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 97/553 variables, 49/194 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/553 variables, 3/197 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/553 variables, 20/217 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/553 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 11/564 variables, 7/224 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/564 variables, 1/225 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/564 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 1/565 variables, 1/226 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/565 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (OVERLAPS) 0/565 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 565/565 variables, and 226 constraints, problems are : Problem set: 0 solved, 4 unsolved in 388 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 159/159 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 99/102 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 354/456 variables, 102/105 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/456 variables, 40/145 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/456 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 97/553 variables, 49/194 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/553 variables, 3/197 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/553 variables, 20/217 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/553 variables, 4/221 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/553 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 11/564 variables, 7/228 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/564 variables, 1/229 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/564 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 1/565 variables, 1/230 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/565 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 0/565 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 565/565 variables, and 230 constraints, problems are : Problem set: 0 solved, 4 unsolved in 524 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 159/159 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 927ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 262 ms.
Support contains 3 out of 159 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 159/159 places, 443/443 transitions.
Applied a total of 0 rules in 5 ms. Remains 159 /159 variables (removed 0) and now considering 443/443 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 159/159 places, 443/443 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 159/159 places, 443/443 transitions.
Applied a total of 0 rules in 5 ms. Remains 159 /159 variables (removed 0) and now considering 443/443 (removed 0) transitions.
[2024-06-02 22:16:01] [INFO ] Flow matrix only has 406 transitions (discarded 37 similar events)
[2024-06-02 22:16:01] [INFO ] Invariant cache hit.
[2024-06-02 22:16:01] [INFO ] Implicit Places using invariants in 80 ms returned []
[2024-06-02 22:16:01] [INFO ] Flow matrix only has 406 transitions (discarded 37 similar events)
[2024-06-02 22:16:01] [INFO ] Invariant cache hit.
[2024-06-02 22:16:01] [INFO ] State equation strengthened by 60 read => feed constraints.
[2024-06-02 22:16:01] [INFO ] Implicit Places using invariants and state equation in 251 ms returned []
Implicit Place search using SMT with State Equation took 331 ms to find 0 implicit places.
[2024-06-02 22:16:01] [INFO ] Redundant transitions in 4 ms returned []
Running 437 sub problems to find dead transitions.
[2024-06-02 22:16:01] [INFO ] Flow matrix only has 406 transitions (discarded 37 similar events)
[2024-06-02 22:16:01] [INFO ] Invariant cache hit.
[2024-06-02 22:16:01] [INFO ] State equation strengthened by 60 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/159 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 437 unsolved
[2024-06-02 22:16:03] [INFO ] Deduced a trap composed of 55 places in 71 ms of which 1 ms to minimize.
[2024-06-02 22:16:03] [INFO ] Deduced a trap composed of 58 places in 82 ms of which 1 ms to minimize.
[2024-06-02 22:16:03] [INFO ] Deduced a trap composed of 27 places in 85 ms of which 2 ms to minimize.
[2024-06-02 22:16:03] [INFO ] Deduced a trap composed of 32 places in 33 ms of which 6 ms to minimize.
[2024-06-02 22:16:04] [INFO ] Deduced a trap composed of 66 places in 86 ms of which 2 ms to minimize.
[2024-06-02 22:16:04] [INFO ] Deduced a trap composed of 23 places in 90 ms of which 1 ms to minimize.
[2024-06-02 22:16:04] [INFO ] Deduced a trap composed of 29 places in 69 ms of which 1 ms to minimize.
[2024-06-02 22:16:04] [INFO ] Deduced a trap composed of 17 places in 74 ms of which 1 ms to minimize.
[2024-06-02 22:16:04] [INFO ] Deduced a trap composed of 32 places in 37 ms of which 1 ms to minimize.
[2024-06-02 22:16:05] [INFO ] Deduced a trap composed of 25 places in 76 ms of which 1 ms to minimize.
[2024-06-02 22:16:05] [INFO ] Deduced a trap composed of 32 places in 32 ms of which 1 ms to minimize.
[2024-06-02 22:16:05] [INFO ] Deduced a trap composed of 51 places in 81 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/159 variables, 12/19 constraints. Problems are: Problem set: 0 solved, 437 unsolved
[2024-06-02 22:16:07] [INFO ] Deduced a trap composed of 17 places in 73 ms of which 1 ms to minimize.
[2024-06-02 22:16:07] [INFO ] Deduced a trap composed of 17 places in 69 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/159 variables, 2/21 constraints. Problems are: Problem set: 0 solved, 437 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/159 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 437 unsolved
At refinement iteration 4 (OVERLAPS) 406/565 variables, 159/180 constraints. Problems are: Problem set: 0 solved, 437 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/565 variables, 60/240 constraints. Problems are: Problem set: 0 solved, 437 unsolved
[2024-06-02 22:16:12] [INFO ] Deduced a trap composed of 40 places in 35 ms of which 0 ms to minimize.
[2024-06-02 22:16:14] [INFO ] Deduced a trap composed of 40 places in 32 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/565 variables, 2/242 constraints. Problems are: Problem set: 0 solved, 437 unsolved
[2024-06-02 22:16:19] [INFO ] Deduced a trap composed of 39 places in 40 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/565 variables, 1/243 constraints. Problems are: Problem set: 0 solved, 437 unsolved
[2024-06-02 22:16:23] [INFO ] Deduced a trap composed of 31 places in 41 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/565 variables, 1/244 constraints. Problems are: Problem set: 0 solved, 437 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/565 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 437 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 565/565 variables, and 244 constraints, problems are : Problem set: 0 solved, 437 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 159/159 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 437/437 constraints, Known Traps: 18/18 constraints]
Escalating to Integer solving :Problem set: 0 solved, 437 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/159 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 437 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/159 variables, 18/25 constraints. Problems are: Problem set: 0 solved, 437 unsolved
[2024-06-02 22:16:34] [INFO ] Deduced a trap composed of 94 places in 84 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/159 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 437 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/159 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 437 unsolved
At refinement iteration 4 (OVERLAPS) 406/565 variables, 159/185 constraints. Problems are: Problem set: 0 solved, 437 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/565 variables, 60/245 constraints. Problems are: Problem set: 0 solved, 437 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/565 variables, 437/682 constraints. Problems are: Problem set: 0 solved, 437 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/565 variables, 0/682 constraints. Problems are: Problem set: 0 solved, 437 unsolved
At refinement iteration 8 (OVERLAPS) 0/565 variables, 0/682 constraints. Problems are: Problem set: 0 solved, 437 unsolved
No progress, stopping.
After SMT solving in domain Int declared 565/565 variables, and 682 constraints, problems are : Problem set: 0 solved, 437 unsolved in 28301 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 159/159 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 437/437 constraints, Known Traps: 19/19 constraints]
After SMT, in 58671ms problems are : Problem set: 0 solved, 437 unsolved
Search for dead transitions found 0 dead transitions in 58676ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 59024 ms. Remains : 159/159 places, 443/443 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 140 edges and 159 vertex of which 29 / 159 are part of one of the 4 SCC in 0 ms
Free SCC test removed 25 places
Drop transitions (Empty/Sink Transition effects.) removed 123 transitions
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 144 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 133 transition count 298
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 0 with 9 rules applied. Total rules applied 12 place count 133 transition count 289
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 132 transition count 288
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 15 place count 132 transition count 287
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 17 place count 131 transition count 286
Free-agglomeration rule applied 9 times with reduction of 6 identical transitions.
Iterating global reduction 0 with 9 rules applied. Total rules applied 26 place count 131 transition count 271
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 38 place count 122 transition count 268
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 44 place count 122 transition count 268
Applied a total of 44 rules in 23 ms. Remains 122 /159 variables (removed 37) and now considering 268/443 (removed 175) transitions.
Running SMT prover for 4 properties.
[2024-06-02 22:17:00] [INFO ] Flow matrix only has 266 transitions (discarded 2 similar events)
// Phase 1: matrix 266 rows 122 cols
[2024-06-02 22:17:00] [INFO ] Computed 7 invariants in 1 ms
[2024-06-02 22:17:00] [INFO ] [Real]Absence check using 7 positive place invariants in 1 ms returned sat
[2024-06-02 22:17:00] [INFO ] After 106ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-06-02 22:17:00] [INFO ] [Nat]Absence check using 7 positive place invariants in 1 ms returned sat
[2024-06-02 22:17:00] [INFO ] After 92ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
TRAPS : Iteration 0
[2024-06-02 22:17:00] [INFO ] Deduced a trap composed of 21 places in 27 ms of which 1 ms to minimize.
[2024-06-02 22:17:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 47 ms
TRAPS : Iteration 1
[2024-06-02 22:17:00] [INFO ] After 259ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
[2024-06-02 22:17:01] [INFO ] After 346ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Over-approximation ignoring read arcs solved 0 properties in 484 ms.
Knowledge obtained : [(AND p2 (NOT p0)), (X p2), (X (NOT (AND p0 (NOT p2)))), (X (NOT p0)), (X (NOT (AND p0 p2))), (X (X p2)), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT p0))), (X (X (NOT (AND p0 p2))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 99 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter insensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 131 ms :[false, false, false]
Stuttering acceptance computed with spot in 116 ms :[false, false, false]
Stuttering acceptance computed with spot in 110 ms :[false, false, false]
Product exploration explored 100000 steps with 9 reset in 54 ms.
Product exploration explored 100000 steps with 2 reset in 54 ms.
Built C files in :
/tmp/ltsmin14470756053891688472
[2024-06-02 22:17:01] [INFO ] Computing symmetric may disable matrix : 456 transitions.
[2024-06-02 22:17:01] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 22:17:01] [INFO ] Computing symmetric may enable matrix : 456 transitions.
[2024-06-02 22:17:01] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 22:17:01] [INFO ] Computing Do-Not-Accords matrix : 456 transitions.
[2024-06-02 22:17:01] [INFO ] Computation of Completed DNA matrix. took 8 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 22:17:01] [INFO ] Built C files in 55ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14470756053891688472
Running compilation step : cd /tmp/ltsmin14470756053891688472;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1141 ms.
Running link step : cd /tmp/ltsmin14470756053891688472;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 44 ms.
Running LTSmin : cd /tmp/ltsmin14470756053891688472;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased5667214423503765937.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 163 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 163/163 places, 456/456 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 162 transition count 455
Applied a total of 2 rules in 17 ms. Remains 162 /163 variables (removed 1) and now considering 455/456 (removed 1) transitions.
[2024-06-02 22:17:16] [INFO ] Flow matrix only has 416 transitions (discarded 39 similar events)
// Phase 1: matrix 416 rows 162 cols
[2024-06-02 22:17:16] [INFO ] Computed 7 invariants in 3 ms
[2024-06-02 22:17:16] [INFO ] Implicit Places using invariants in 105 ms returned []
[2024-06-02 22:17:16] [INFO ] Flow matrix only has 416 transitions (discarded 39 similar events)
[2024-06-02 22:17:16] [INFO ] Invariant cache hit.
[2024-06-02 22:17:16] [INFO ] State equation strengthened by 60 read => feed constraints.
[2024-06-02 22:17:17] [INFO ] Implicit Places using invariants and state equation in 275 ms returned []
Implicit Place search using SMT with State Equation took 382 ms to find 0 implicit places.
[2024-06-02 22:17:17] [INFO ] Redundant transitions in 5 ms returned []
Running 448 sub problems to find dead transitions.
[2024-06-02 22:17:17] [INFO ] Flow matrix only has 416 transitions (discarded 39 similar events)
[2024-06-02 22:17:17] [INFO ] Invariant cache hit.
[2024-06-02 22:17:17] [INFO ] State equation strengthened by 60 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/162 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 448 unsolved
[2024-06-02 22:17:19] [INFO ] Deduced a trap composed of 57 places in 86 ms of which 1 ms to minimize.
[2024-06-02 22:17:19] [INFO ] Deduced a trap composed of 33 places in 36 ms of which 1 ms to minimize.
[2024-06-02 22:17:19] [INFO ] Deduced a trap composed of 17 places in 102 ms of which 1 ms to minimize.
[2024-06-02 22:17:19] [INFO ] Deduced a trap composed of 33 places in 54 ms of which 0 ms to minimize.
[2024-06-02 22:17:19] [INFO ] Deduced a trap composed of 23 places in 87 ms of which 1 ms to minimize.
[2024-06-02 22:17:19] [INFO ] Deduced a trap composed of 17 places in 85 ms of which 1 ms to minimize.
[2024-06-02 22:17:19] [INFO ] Deduced a trap composed of 17 places in 67 ms of which 1 ms to minimize.
[2024-06-02 22:17:20] [INFO ] Deduced a trap composed of 25 places in 100 ms of which 1 ms to minimize.
[2024-06-02 22:17:20] [INFO ] Deduced a trap composed of 33 places in 37 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/162 variables, 9/16 constraints. Problems are: Problem set: 0 solved, 448 unsolved
[2024-06-02 22:17:22] [INFO ] Deduced a trap composed of 14 places in 71 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/162 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 448 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/162 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 448 unsolved
At refinement iteration 4 (OVERLAPS) 415/577 variables, 162/179 constraints. Problems are: Problem set: 0 solved, 448 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/577 variables, 60/239 constraints. Problems are: Problem set: 0 solved, 448 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/577 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 448 unsolved
[2024-06-02 22:17:33] [INFO ] Deduced a trap composed of 32 places in 47 ms of which 0 ms to minimize.
[2024-06-02 22:17:33] [INFO ] Deduced a trap composed of 40 places in 42 ms of which 0 ms to minimize.
At refinement iteration 7 (OVERLAPS) 0/577 variables, 2/241 constraints. Problems are: Problem set: 0 solved, 448 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/577 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 448 unsolved
At refinement iteration 9 (OVERLAPS) 0/577 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 448 unsolved
No progress, stopping.
After SMT solving in domain Real declared 577/578 variables, and 241 constraints, problems are : Problem set: 0 solved, 448 unsolved in 26680 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 162/162 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 448/448 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 448 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/162 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 448 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/162 variables, 12/19 constraints. Problems are: Problem set: 0 solved, 448 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/162 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 448 unsolved
At refinement iteration 3 (OVERLAPS) 415/577 variables, 162/181 constraints. Problems are: Problem set: 0 solved, 448 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/577 variables, 60/241 constraints. Problems are: Problem set: 0 solved, 448 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/577 variables, 448/689 constraints. Problems are: Problem set: 0 solved, 448 unsolved
[2024-06-02 22:17:50] [INFO ] Deduced a trap composed of 41 places in 39 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/577 variables, 1/690 constraints. Problems are: Problem set: 0 solved, 448 unsolved
[2024-06-02 22:18:03] [INFO ] Deduced a trap composed of 41 places in 47 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/577 variables, 1/691 constraints. Problems are: Problem set: 0 solved, 448 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/577 variables, 0/691 constraints. Problems are: Problem set: 0 solved, 448 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 577/578 variables, and 691 constraints, problems are : Problem set: 0 solved, 448 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 162/162 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 448/448 constraints, Known Traps: 14/14 constraints]
After SMT, in 57034ms problems are : Problem set: 0 solved, 448 unsolved
Search for dead transitions found 0 dead transitions in 57038ms
Starting structural reductions in SI_LTL mode, iteration 1 : 162/163 places, 455/456 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 57451 ms. Remains : 162/163 places, 455/456 transitions.
Built C files in :
/tmp/ltsmin5496962942658851740
[2024-06-02 22:18:14] [INFO ] Computing symmetric may disable matrix : 455 transitions.
[2024-06-02 22:18:14] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 22:18:14] [INFO ] Computing symmetric may enable matrix : 455 transitions.
[2024-06-02 22:18:14] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 22:18:14] [INFO ] Computing Do-Not-Accords matrix : 455 transitions.
[2024-06-02 22:18:14] [INFO ] Computation of Completed DNA matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 22:18:14] [INFO ] Built C files in 49ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5496962942658851740
Running compilation step : cd /tmp/ltsmin5496962942658851740;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1105 ms.
Running link step : cd /tmp/ltsmin5496962942658851740;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin5496962942658851740;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased10201714036792740576.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-06-02 22:18:29] [INFO ] Flatten gal took : 27 ms
[2024-06-02 22:18:29] [INFO ] Flatten gal took : 24 ms
[2024-06-02 22:18:29] [INFO ] Time to serialize gal into /tmp/LTL2742925007144740691.gal : 6 ms
[2024-06-02 22:18:29] [INFO ] Time to serialize properties into /tmp/LTL14340882033560531770.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2742925007144740691.gal' '-t' 'CGAL' '-hoa' '/tmp/aut16217593855340561434.hoa' '-atoms' '/tmp/LTL14340882033560531770.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL14340882033560531770.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut16217593855340561434.hoa
Detected timeout of ITS tools.
[2024-06-02 22:18:44] [INFO ] Flatten gal took : 20 ms
[2024-06-02 22:18:44] [INFO ] Flatten gal took : 19 ms
[2024-06-02 22:18:44] [INFO ] Time to serialize gal into /tmp/LTL2215196481722707607.gal : 4 ms
[2024-06-02 22:18:44] [INFO ] Time to serialize properties into /tmp/LTL9416303419378911981.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2215196481722707607.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9416303419378911981.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((F((!((F(G("((p3==1)&&(p93==1))")))U(!("((p3==1)&&(p161==1))"))))||(F(X((G("((p3==0)||(p161==0))"))&&("(p83==0)")))))))
Formula 0 simplified : G((FG"((p3==1)&&(p93==1))" U !"((p3==1)&&(p161==1))") & XG(!"(p83==0)" | F!"((p3==0)||(p161==0))"))
Detected timeout of ITS tools.
[2024-06-02 22:18:59] [INFO ] Flatten gal took : 18 ms
[2024-06-02 22:18:59] [INFO ] Applying decomposition
[2024-06-02 22:18:59] [INFO ] Flatten gal took : 18 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph8364551106714857886.txt' '-o' '/tmp/graph8364551106714857886.bin' '-w' '/tmp/graph8364551106714857886.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph8364551106714857886.bin' '-l' '-1' '-v' '-w' '/tmp/graph8364551106714857886.weights' '-q' '0' '-e' '0.001'
[2024-06-02 22:18:59] [INFO ] Decomposing Gal with order
[2024-06-02 22:18:59] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 22:18:59] [INFO ] Removed a total of 686 redundant transitions.
[2024-06-02 22:18:59] [INFO ] Flatten gal took : 65 ms
[2024-06-02 22:18:59] [INFO ] Fuse similar labels procedure discarded/fused a total of 135 labels/synchronizations in 14 ms.
[2024-06-02 22:18:59] [INFO ] Time to serialize gal into /tmp/LTL14669878212805383456.gal : 5 ms
[2024-06-02 22:18:59] [INFO ] Time to serialize properties into /tmp/LTL3993895345877286270.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14669878212805383456.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3993895345877286270.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((F((!((F(G("((i0.u0.p3==1)&&(i0.u0.p93==1))")))U(!("((i0.u0.p3==1)&&(i0.u0.p161==1))"))))||(F(X((G("((i0.u0.p3==0)||(i0.u0.p161==0))...185
Formula 0 simplified : G((FG"((i0.u0.p3==1)&&(i0.u0.p93==1))" U !"((i0.u0.p3==1)&&(i0.u0.p161==1))") & XG(!"(i4.u22.p83==0)" | F!"((i0.u0.p3==0)||(i0.u0.p1...165
Detected timeout of ITS tools.
Treatment of property FireWire-PT-13-LTLFireability-13 finished in 389788 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 2 out of 194 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 194/194 places, 517/517 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 3 Pre rules applied. Total rules applied 0 place count 193 transition count 513
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 190 transition count 513
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 11 place count 185 transition count 500
Iterating global reduction 0 with 5 rules applied. Total rules applied 16 place count 185 transition count 500
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 18 place count 185 transition count 498
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 21 place count 182 transition count 492
Iterating global reduction 1 with 3 rules applied. Total rules applied 24 place count 182 transition count 492
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 27 place count 179 transition count 483
Iterating global reduction 1 with 3 rules applied. Total rules applied 30 place count 179 transition count 483
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 33 place count 176 transition count 477
Iterating global reduction 1 with 3 rules applied. Total rules applied 36 place count 176 transition count 477
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 39 place count 173 transition count 468
Iterating global reduction 1 with 3 rules applied. Total rules applied 42 place count 173 transition count 468
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 45 place count 170 transition count 462
Iterating global reduction 1 with 3 rules applied. Total rules applied 48 place count 170 transition count 462
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 51 place count 167 transition count 454
Iterating global reduction 1 with 3 rules applied. Total rules applied 54 place count 167 transition count 454
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 57 place count 164 transition count 448
Iterating global reduction 1 with 3 rules applied. Total rules applied 60 place count 164 transition count 448
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 62 place count 162 transition count 442
Iterating global reduction 1 with 2 rules applied. Total rules applied 64 place count 162 transition count 442
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 66 place count 160 transition count 438
Iterating global reduction 1 with 2 rules applied. Total rules applied 68 place count 160 transition count 438
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 70 place count 158 transition count 434
Iterating global reduction 1 with 2 rules applied. Total rules applied 72 place count 158 transition count 434
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 74 place count 156 transition count 430
Iterating global reduction 1 with 2 rules applied. Total rules applied 76 place count 156 transition count 430
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 82 place count 153 transition count 427
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 88 place count 150 transition count 433
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 94 place count 150 transition count 427
Applied a total of 94 rules in 32 ms. Remains 150 /194 variables (removed 44) and now considering 427/517 (removed 90) transitions.
[2024-06-02 22:19:14] [INFO ] Flow matrix only has 388 transitions (discarded 39 similar events)
// Phase 1: matrix 388 rows 150 cols
[2024-06-02 22:19:14] [INFO ] Computed 7 invariants in 2 ms
[2024-06-02 22:19:15] [INFO ] Implicit Places using invariants in 98 ms returned []
[2024-06-02 22:19:15] [INFO ] Flow matrix only has 388 transitions (discarded 39 similar events)
[2024-06-02 22:19:15] [INFO ] Invariant cache hit.
[2024-06-02 22:19:15] [INFO ] State equation strengthened by 56 read => feed constraints.
[2024-06-02 22:19:15] [INFO ] Implicit Places using invariants and state equation in 271 ms returned []
Implicit Place search using SMT with State Equation took 384 ms to find 0 implicit places.
[2024-06-02 22:19:15] [INFO ] Redundant transitions in 3 ms returned []
Running 420 sub problems to find dead transitions.
[2024-06-02 22:19:15] [INFO ] Flow matrix only has 388 transitions (discarded 39 similar events)
[2024-06-02 22:19:15] [INFO ] Invariant cache hit.
[2024-06-02 22:19:15] [INFO ] State equation strengthened by 56 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/150 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 420 unsolved
[2024-06-02 22:19:17] [INFO ] Deduced a trap composed of 59 places in 81 ms of which 1 ms to minimize.
[2024-06-02 22:19:17] [INFO ] Deduced a trap composed of 28 places in 76 ms of which 1 ms to minimize.
[2024-06-02 22:19:17] [INFO ] Deduced a trap composed of 33 places in 72 ms of which 1 ms to minimize.
[2024-06-02 22:19:17] [INFO ] Deduced a trap composed of 17 places in 72 ms of which 1 ms to minimize.
[2024-06-02 22:19:17] [INFO ] Deduced a trap composed of 17 places in 61 ms of which 1 ms to minimize.
[2024-06-02 22:19:17] [INFO ] Deduced a trap composed of 33 places in 36 ms of which 1 ms to minimize.
[2024-06-02 22:19:18] [INFO ] Deduced a trap composed of 27 places in 75 ms of which 1 ms to minimize.
[2024-06-02 22:19:18] [INFO ] Deduced a trap composed of 25 places in 73 ms of which 1 ms to minimize.
[2024-06-02 22:19:18] [INFO ] Deduced a trap composed of 58 places in 70 ms of which 1 ms to minimize.
[2024-06-02 22:19:18] [INFO ] Deduced a trap composed of 23 places in 72 ms of which 1 ms to minimize.
[2024-06-02 22:19:18] [INFO ] Deduced a trap composed of 29 places in 74 ms of which 1 ms to minimize.
[2024-06-02 22:19:18] [INFO ] Deduced a trap composed of 33 places in 34 ms of which 1 ms to minimize.
[2024-06-02 22:19:19] [INFO ] Deduced a trap composed of 17 places in 72 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/150 variables, 13/20 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/150 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 3 (OVERLAPS) 387/537 variables, 150/170 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/537 variables, 56/226 constraints. Problems are: Problem set: 0 solved, 420 unsolved
[2024-06-02 22:19:26] [INFO ] Deduced a trap composed of 32 places in 39 ms of which 1 ms to minimize.
[2024-06-02 22:19:26] [INFO ] Deduced a trap composed of 32 places in 43 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/537 variables, 2/228 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/537 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 7 (OVERLAPS) 0/537 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 420 unsolved
No progress, stopping.
After SMT solving in domain Real declared 537/538 variables, and 228 constraints, problems are : Problem set: 0 solved, 420 unsolved in 20313 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 150/150 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 420/420 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 420 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/150 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/150 variables, 15/22 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/150 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 3 (OVERLAPS) 387/537 variables, 150/172 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/537 variables, 56/228 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/537 variables, 420/648 constraints. Problems are: Problem set: 0 solved, 420 unsolved
[2024-06-02 22:19:42] [INFO ] Deduced a trap composed of 32 places in 39 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/537 variables, 1/649 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/537 variables, 0/649 constraints. Problems are: Problem set: 0 solved, 420 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 537/538 variables, and 649 constraints, problems are : Problem set: 0 solved, 420 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 150/150 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 420/420 constraints, Known Traps: 16/16 constraints]
After SMT, in 50642ms problems are : Problem set: 0 solved, 420 unsolved
Search for dead transitions found 0 dead transitions in 50647ms
Starting structural reductions in SI_LTL mode, iteration 1 : 150/194 places, 427/517 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 51073 ms. Remains : 150/194 places, 427/517 transitions.
Stuttering acceptance computed with spot in 56 ms :[(NOT p0)]
Running random walk in product with property : FireWire-PT-13-LTLFireability-15
Product exploration explored 100000 steps with 12 reset in 56 ms.
Product exploration explored 100000 steps with 2 reset in 55 ms.
Computed a total of 12 stabilizing places and 36 stable transitions
Computed a total of 12 stabilizing places and 36 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 81 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
RANDOM walk for 31676 steps (1061 resets) in 131 ms. (239 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 92 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
Support contains 2 out of 150 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 150/150 places, 427/427 transitions.
Applied a total of 0 rules in 8 ms. Remains 150 /150 variables (removed 0) and now considering 427/427 (removed 0) transitions.
[2024-06-02 22:20:06] [INFO ] Flow matrix only has 388 transitions (discarded 39 similar events)
[2024-06-02 22:20:06] [INFO ] Invariant cache hit.
[2024-06-02 22:20:06] [INFO ] Implicit Places using invariants in 102 ms returned []
[2024-06-02 22:20:06] [INFO ] Flow matrix only has 388 transitions (discarded 39 similar events)
[2024-06-02 22:20:06] [INFO ] Invariant cache hit.
[2024-06-02 22:20:06] [INFO ] State equation strengthened by 56 read => feed constraints.
[2024-06-02 22:20:06] [INFO ] Implicit Places using invariants and state equation in 258 ms returned []
Implicit Place search using SMT with State Equation took 368 ms to find 0 implicit places.
[2024-06-02 22:20:06] [INFO ] Redundant transitions in 4 ms returned []
Running 420 sub problems to find dead transitions.
[2024-06-02 22:20:06] [INFO ] Flow matrix only has 388 transitions (discarded 39 similar events)
[2024-06-02 22:20:06] [INFO ] Invariant cache hit.
[2024-06-02 22:20:06] [INFO ] State equation strengthened by 56 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/150 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 420 unsolved
[2024-06-02 22:20:08] [INFO ] Deduced a trap composed of 59 places in 79 ms of which 1 ms to minimize.
[2024-06-02 22:20:08] [INFO ] Deduced a trap composed of 28 places in 69 ms of which 1 ms to minimize.
[2024-06-02 22:20:08] [INFO ] Deduced a trap composed of 33 places in 79 ms of which 1 ms to minimize.
[2024-06-02 22:20:08] [INFO ] Deduced a trap composed of 17 places in 71 ms of which 1 ms to minimize.
[2024-06-02 22:20:08] [INFO ] Deduced a trap composed of 17 places in 65 ms of which 1 ms to minimize.
[2024-06-02 22:20:09] [INFO ] Deduced a trap composed of 33 places in 37 ms of which 0 ms to minimize.
[2024-06-02 22:20:09] [INFO ] Deduced a trap composed of 27 places in 73 ms of which 1 ms to minimize.
[2024-06-02 22:20:09] [INFO ] Deduced a trap composed of 25 places in 71 ms of which 1 ms to minimize.
[2024-06-02 22:20:09] [INFO ] Deduced a trap composed of 58 places in 71 ms of which 1 ms to minimize.
[2024-06-02 22:20:09] [INFO ] Deduced a trap composed of 23 places in 74 ms of which 1 ms to minimize.
[2024-06-02 22:20:10] [INFO ] Deduced a trap composed of 29 places in 75 ms of which 1 ms to minimize.
[2024-06-02 22:20:10] [INFO ] Deduced a trap composed of 33 places in 31 ms of which 0 ms to minimize.
[2024-06-02 22:20:10] [INFO ] Deduced a trap composed of 17 places in 71 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/150 variables, 13/20 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/150 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 3 (OVERLAPS) 387/537 variables, 150/170 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/537 variables, 56/226 constraints. Problems are: Problem set: 0 solved, 420 unsolved
[2024-06-02 22:20:17] [INFO ] Deduced a trap composed of 32 places in 39 ms of which 1 ms to minimize.
[2024-06-02 22:20:18] [INFO ] Deduced a trap composed of 32 places in 39 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/537 variables, 2/228 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/537 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 7 (OVERLAPS) 0/537 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 420 unsolved
No progress, stopping.
After SMT solving in domain Real declared 537/538 variables, and 228 constraints, problems are : Problem set: 0 solved, 420 unsolved in 20667 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 150/150 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 420/420 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 420 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/150 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/150 variables, 15/22 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/150 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 3 (OVERLAPS) 387/537 variables, 150/172 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/537 variables, 56/228 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/537 variables, 420/648 constraints. Problems are: Problem set: 0 solved, 420 unsolved
[2024-06-02 22:20:34] [INFO ] Deduced a trap composed of 32 places in 40 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/537 variables, 1/649 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/537 variables, 0/649 constraints. Problems are: Problem set: 0 solved, 420 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 537/538 variables, and 649 constraints, problems are : Problem set: 0 solved, 420 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 150/150 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 420/420 constraints, Known Traps: 16/16 constraints]
After SMT, in 51018ms problems are : Problem set: 0 solved, 420 unsolved
Search for dead transitions found 0 dead transitions in 51023ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 51410 ms. Remains : 150/150 places, 427/427 transitions.
Computed a total of 12 stabilizing places and 36 stable transitions
Computed a total of 12 stabilizing places and 36 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 82 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
RANDOM walk for 33522 steps (1072 resets) in 101 ms. (328 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 103 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 159 ms :[(NOT p0)]
Product exploration explored 100000 steps with 2 reset in 54 ms.
Product exploration explored 100000 steps with 1 reset in 55 ms.
Built C files in :
/tmp/ltsmin1449383187239141696
[2024-06-02 22:20:58] [INFO ] Computing symmetric may disable matrix : 427 transitions.
[2024-06-02 22:20:58] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 22:20:58] [INFO ] Computing symmetric may enable matrix : 427 transitions.
[2024-06-02 22:20:58] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 22:20:58] [INFO ] Computing Do-Not-Accords matrix : 427 transitions.
[2024-06-02 22:20:58] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 22:20:58] [INFO ] Built C files in 48ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1449383187239141696
Running compilation step : cd /tmp/ltsmin1449383187239141696;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1035 ms.
Running link step : cd /tmp/ltsmin1449383187239141696;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin1449383187239141696;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased16269193896344538868.hoa' '--buchi-type=spotba'
LTSmin run took 1006 ms.
FORMULA FireWire-PT-13-LTLFireability-15 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property FireWire-PT-13-LTLFireability-15 finished in 105849 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((!(F(G(p0)) U !p1)||F(X((G(p2)&&p3))))))'
Found a Shortening insensitive property : FireWire-PT-13-LTLFireability-13
Stuttering acceptance computed with spot in 336 ms :[(OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2))), (OR (AND p0 (NOT p1) (NOT p3)) (AND p0 (NOT p1) (NOT p2))), (OR (AND p0 (NOT p1) (NOT p3)) (AND p0 (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2))]
Support contains 4 out of 194 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 194/194 places, 517/517 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 3 Pre rules applied. Total rules applied 0 place count 193 transition count 513
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 190 transition count 513
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 10 place count 186 transition count 503
Iterating global reduction 0 with 4 rules applied. Total rules applied 14 place count 186 transition count 503
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 16 place count 186 transition count 501
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 18 place count 184 transition count 497
Iterating global reduction 1 with 2 rules applied. Total rules applied 20 place count 184 transition count 497
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 22 place count 182 transition count 491
Iterating global reduction 1 with 2 rules applied. Total rules applied 24 place count 182 transition count 491
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 26 place count 180 transition count 487
Iterating global reduction 1 with 2 rules applied. Total rules applied 28 place count 180 transition count 487
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 30 place count 178 transition count 481
Iterating global reduction 1 with 2 rules applied. Total rules applied 32 place count 178 transition count 481
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 34 place count 176 transition count 477
Iterating global reduction 1 with 2 rules applied. Total rules applied 36 place count 176 transition count 477
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 38 place count 174 transition count 471
Iterating global reduction 1 with 2 rules applied. Total rules applied 40 place count 174 transition count 471
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 42 place count 172 transition count 467
Iterating global reduction 1 with 2 rules applied. Total rules applied 44 place count 172 transition count 467
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 45 place count 171 transition count 464
Iterating global reduction 1 with 1 rules applied. Total rules applied 46 place count 171 transition count 464
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 47 place count 170 transition count 462
Iterating global reduction 1 with 1 rules applied. Total rules applied 48 place count 170 transition count 462
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 49 place count 169 transition count 460
Iterating global reduction 1 with 1 rules applied. Total rules applied 50 place count 169 transition count 460
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 51 place count 168 transition count 458
Iterating global reduction 1 with 1 rules applied. Total rules applied 52 place count 168 transition count 458
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 56 place count 166 transition count 456
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 62 place count 163 transition count 462
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 1 with 3 rules applied. Total rules applied 65 place count 163 transition count 459
Applied a total of 65 rules in 39 ms. Remains 163 /194 variables (removed 31) and now considering 459/517 (removed 58) transitions.
[2024-06-02 22:21:01] [INFO ] Flow matrix only has 420 transitions (discarded 39 similar events)
// Phase 1: matrix 420 rows 163 cols
[2024-06-02 22:21:01] [INFO ] Computed 7 invariants in 3 ms
[2024-06-02 22:21:01] [INFO ] Implicit Places using invariants in 134 ms returned []
[2024-06-02 22:21:01] [INFO ] Flow matrix only has 420 transitions (discarded 39 similar events)
[2024-06-02 22:21:01] [INFO ] Invariant cache hit.
[2024-06-02 22:21:01] [INFO ] State equation strengthened by 60 read => feed constraints.
[2024-06-02 22:21:01] [INFO ] Implicit Places using invariants and state equation in 298 ms returned []
Implicit Place search using SMT with State Equation took 433 ms to find 0 implicit places.
Running 452 sub problems to find dead transitions.
[2024-06-02 22:21:01] [INFO ] Flow matrix only has 420 transitions (discarded 39 similar events)
[2024-06-02 22:21:01] [INFO ] Invariant cache hit.
[2024-06-02 22:21:01] [INFO ] State equation strengthened by 60 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/163 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 452 unsolved
[2024-06-02 22:21:03] [INFO ] Deduced a trap composed of 57 places in 84 ms of which 1 ms to minimize.
[2024-06-02 22:21:03] [INFO ] Deduced a trap composed of 17 places in 81 ms of which 1 ms to minimize.
[2024-06-02 22:21:03] [INFO ] Deduced a trap composed of 33 places in 50 ms of which 0 ms to minimize.
[2024-06-02 22:21:04] [INFO ] Deduced a trap composed of 17 places in 98 ms of which 1 ms to minimize.
[2024-06-02 22:21:04] [INFO ] Deduced a trap composed of 17 places in 75 ms of which 1 ms to minimize.
[2024-06-02 22:21:04] [INFO ] Deduced a trap composed of 33 places in 33 ms of which 0 ms to minimize.
[2024-06-02 22:21:05] [INFO ] Deduced a trap composed of 27 places in 85 ms of which 1 ms to minimize.
[2024-06-02 22:21:05] [INFO ] Deduced a trap composed of 25 places in 76 ms of which 1 ms to minimize.
[2024-06-02 22:21:05] [INFO ] Deduced a trap composed of 33 places in 31 ms of which 0 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/163 variables, 9/16 constraints. Problems are: Problem set: 0 solved, 452 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/163 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 452 unsolved
At refinement iteration 3 (OVERLAPS) 419/582 variables, 163/179 constraints. Problems are: Problem set: 0 solved, 452 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/582 variables, 60/239 constraints. Problems are: Problem set: 0 solved, 452 unsolved
[2024-06-02 22:21:13] [INFO ] Deduced a trap composed of 32 places in 41 ms of which 1 ms to minimize.
[2024-06-02 22:21:13] [INFO ] Deduced a trap composed of 41 places in 42 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/582 variables, 2/241 constraints. Problems are: Problem set: 0 solved, 452 unsolved
[2024-06-02 22:21:14] [INFO ] Deduced a trap composed of 23 places in 75 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/582 variables, 1/242 constraints. Problems are: Problem set: 0 solved, 452 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/582 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 452 unsolved
At refinement iteration 8 (OVERLAPS) 0/582 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 452 unsolved
No progress, stopping.
After SMT solving in domain Real declared 582/583 variables, and 242 constraints, problems are : Problem set: 0 solved, 452 unsolved in 24030 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 163/163 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 452/452 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 452 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/163 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 452 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/163 variables, 12/19 constraints. Problems are: Problem set: 0 solved, 452 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/163 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 452 unsolved
At refinement iteration 3 (OVERLAPS) 419/582 variables, 163/182 constraints. Problems are: Problem set: 0 solved, 452 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/582 variables, 60/242 constraints. Problems are: Problem set: 0 solved, 452 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/582 variables, 452/694 constraints. Problems are: Problem set: 0 solved, 452 unsolved
[2024-06-02 22:21:32] [INFO ] Deduced a trap composed of 41 places in 53 ms of which 1 ms to minimize.
[2024-06-02 22:21:33] [INFO ] Deduced a trap composed of 41 places in 33 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/582 variables, 2/696 constraints. Problems are: Problem set: 0 solved, 452 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/582 variables, 0/696 constraints. Problems are: Problem set: 0 solved, 452 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 582/583 variables, and 696 constraints, problems are : Problem set: 0 solved, 452 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 163/163 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 452/452 constraints, Known Traps: 14/14 constraints]
After SMT, in 54390ms problems are : Problem set: 0 solved, 452 unsolved
Search for dead transitions found 0 dead transitions in 54397ms
Starting structural reductions in LI_LTL mode, iteration 1 : 163/194 places, 459/517 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 54871 ms. Remains : 163/194 places, 459/517 transitions.
Running random walk in product with property : FireWire-PT-13-LTLFireability-13
Product exploration explored 100000 steps with 2 reset in 84 ms.
Product exploration explored 100000 steps with 0 reset in 87 ms.
Computed a total of 25 stabilizing places and 65 stable transitions
Computed a total of 25 stabilizing places and 65 stable transitions
Detected a total of 25/163 stabilizing places and 65/459 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/4 atomic propositions.
Knowledge obtained : [(AND (NOT p1) (NOT p0) p3 p2), (X p2), (X p3), (X (AND (NOT p1) p3 p2)), (X (NOT (OR (NOT p3) (NOT p2)))), (X (NOT (OR (AND p0 (NOT p1) (NOT p3)) (AND p0 (NOT p1) (NOT p2))))), (X (NOT (AND p0 (NOT p1) p3 p2))), (X (NOT (OR (AND p1 (NOT p3)) (AND p1 (NOT p2))))), (X (NOT (OR (AND p0 (NOT p3)) (AND p0 (NOT p2))))), (X (NOT (AND p0 p1 p3 p2))), (X (NOT (OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2))))), (X (NOT (OR (AND p0 p1 (NOT p3)) (AND p0 p1 (NOT p2))))), (X (AND p3 p2)), (X (NOT p0)), (X (NOT p1)), (X (NOT (AND p1 p3 p2))), (X (X p2)), (X (X p3)), (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND (NOT p1) p3 p2))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND p0 p1 p2)))), (X (X (NOT (OR (NOT p3) (NOT p2))))), (X (X (NOT (OR (AND p0 (NOT p1) (NOT p3)) (AND p0 (NOT p1) (NOT p2)))))), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND p0 (NOT p1) p3 p2)))), (X (X (NOT (OR (AND p1 (NOT p3)) (AND p1 (NOT p2)))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (OR (AND p0 (NOT p3)) (AND p0 (NOT p2)))))), (X (X (NOT (AND p0 p1 p3 p2)))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2)))))), (X (X (NOT (OR (AND p0 p1 (NOT p3)) (AND p0 p1 (NOT p2)))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (AND p3 p2))), (X (X (NOT p0))), (X (X (NOT p1))), (X (X (NOT (AND p1 p3 p2)))), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : []
Knowledge based reduction with 41 factoid took 149 ms. Reduced automaton from 7 states, 29 edges and 4 AP (stutter sensitive) to 7 states, 27 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 355 ms :[(OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2))), (OR (AND p0 (NOT p1) (NOT p3)) (AND p0 (NOT p1) (NOT p2))), (OR (AND p0 (NOT p1) (NOT p3)) (AND p0 (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2))]
Reduction of identical properties reduced properties to check from 24 to 23
RANDOM walk for 40000 steps (1244 resets) in 380 ms. (104 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (26 resets) in 21 ms. (182 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (24 resets) in 32 ms. (121 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4001 steps (27 resets) in 33 ms. (117 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (24 resets) in 40 ms. (97 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (26 resets) in 27 ms. (143 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (22 resets) in 38 ms. (102 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (28 resets) in 43 ms. (91 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (28 resets) in 36 ms. (108 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (29 resets) in 34 ms. (114 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (22 resets) in 46 ms. (85 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (23 resets) in 37 ms. (105 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (29 resets) in 53 ms. (74 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (26 resets) in 21 ms. (181 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (28 resets) in 24 ms. (160 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (27 resets) in 23 ms. (166 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (24 resets) in 36 ms. (108 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (31 resets) in 37 ms. (105 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (25 resets) in 25 ms. (153 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (26 resets) in 27 ms. (142 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (29 resets) in 26 ms. (148 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (31 resets) in 21 ms. (182 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (29 resets) in 28 ms. (138 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (25 resets) in 27 ms. (143 steps per ms) remains 23/23 properties
Interrupted probabilistic random walk after 226234 steps, run timeout after 3001 ms. (steps per millisecond=75 ) properties seen :0 out of 23
Probabilistic random walk after 226234 steps, saw 55090 distinct states, run finished after 3001 ms. (steps per millisecond=75 ) properties seen :0
[2024-06-02 22:22:00] [INFO ] Flow matrix only has 420 transitions (discarded 39 similar events)
[2024-06-02 22:22:00] [INFO ] Invariant cache hit.
[2024-06-02 22:22:00] [INFO ] State equation strengthened by 60 read => feed constraints.
Problem apf7 is UNSAT
Problem apf15 is UNSAT
Problem apf16 is UNSAT
Problem apf23 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 4 solved, 19 unsolved
At refinement iteration 1 (OVERLAPS) 101/105 variables, 3/3 constraints. Problems are: Problem set: 4 solved, 19 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/105 variables, 0/3 constraints. Problems are: Problem set: 4 solved, 19 unsolved
At refinement iteration 3 (OVERLAPS) 366/471 variables, 105/108 constraints. Problems are: Problem set: 4 solved, 19 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/471 variables, 40/148 constraints. Problems are: Problem set: 4 solved, 19 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/471 variables, 0/148 constraints. Problems are: Problem set: 4 solved, 19 unsolved
At refinement iteration 6 (OVERLAPS) 100/571 variables, 51/199 constraints. Problems are: Problem set: 4 solved, 19 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/571 variables, 3/202 constraints. Problems are: Problem set: 4 solved, 19 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/571 variables, 20/222 constraints. Problems are: Problem set: 4 solved, 19 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/571 variables, 0/222 constraints. Problems are: Problem set: 4 solved, 19 unsolved
At refinement iteration 10 (OVERLAPS) 10/581 variables, 6/228 constraints. Problems are: Problem set: 4 solved, 19 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/581 variables, 1/229 constraints. Problems are: Problem set: 4 solved, 19 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/581 variables, 0/229 constraints. Problems are: Problem set: 4 solved, 19 unsolved
At refinement iteration 13 (OVERLAPS) 1/582 variables, 1/230 constraints. Problems are: Problem set: 4 solved, 19 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/582 variables, 0/230 constraints. Problems are: Problem set: 4 solved, 19 unsolved
At refinement iteration 15 (OVERLAPS) 0/582 variables, 0/230 constraints. Problems are: Problem set: 4 solved, 19 unsolved
No progress, stopping.
After SMT solving in domain Real declared 582/583 variables, and 230 constraints, problems are : Problem set: 4 solved, 19 unsolved in 1779 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 163/163 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 23/23 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 4 solved, 19 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 4 solved, 19 unsolved
Problem apf13 is UNSAT
Problem apf19 is UNSAT
At refinement iteration 1 (OVERLAPS) 101/105 variables, 3/3 constraints. Problems are: Problem set: 6 solved, 17 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/105 variables, 0/3 constraints. Problems are: Problem set: 6 solved, 17 unsolved
At refinement iteration 3 (OVERLAPS) 366/471 variables, 105/108 constraints. Problems are: Problem set: 6 solved, 17 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/471 variables, 40/148 constraints. Problems are: Problem set: 6 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/471 variables, 0/148 constraints. Problems are: Problem set: 6 solved, 17 unsolved
Problem apf9 is UNSAT
At refinement iteration 6 (OVERLAPS) 100/571 variables, 51/199 constraints. Problems are: Problem set: 7 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/571 variables, 3/202 constraints. Problems are: Problem set: 7 solved, 16 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/571 variables, 20/222 constraints. Problems are: Problem set: 7 solved, 16 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/571 variables, 16/238 constraints. Problems are: Problem set: 7 solved, 16 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/571 variables, 0/238 constraints. Problems are: Problem set: 7 solved, 16 unsolved
At refinement iteration 11 (OVERLAPS) 10/581 variables, 6/244 constraints. Problems are: Problem set: 7 solved, 16 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/581 variables, 1/245 constraints. Problems are: Problem set: 7 solved, 16 unsolved
[2024-06-02 22:22:03] [INFO ] Deduced a trap composed of 33 places in 37 ms of which 0 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/581 variables, 1/246 constraints. Problems are: Problem set: 7 solved, 16 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/581 variables, 0/246 constraints. Problems are: Problem set: 7 solved, 16 unsolved
At refinement iteration 15 (OVERLAPS) 1/582 variables, 1/247 constraints. Problems are: Problem set: 7 solved, 16 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/582 variables, 0/247 constraints. Problems are: Problem set: 7 solved, 16 unsolved
At refinement iteration 17 (OVERLAPS) 0/582 variables, 0/247 constraints. Problems are: Problem set: 7 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Int declared 582/583 variables, and 247 constraints, problems are : Problem set: 7 solved, 16 unsolved in 1967 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 163/163 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 16/23 constraints, Known Traps: 1/1 constraints]
After SMT, in 3774ms problems are : Problem set: 7 solved, 16 unsolved
Fused 16 Parikh solutions to 6 different solutions.
Parikh walk visited 0 properties in 163 ms.
Support contains 4 out of 163 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 163/163 places, 459/459 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 163 transition count 453
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 1 with 3 rules applied. Total rules applied 9 place count 163 transition count 450
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 1 with 3 rules applied. Total rules applied 12 place count 163 transition count 456
Reduce places removed 3 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 21 place count 160 transition count 450
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 2 with 6 rules applied. Total rules applied 27 place count 160 transition count 444
Applied a total of 27 rules in 21 ms. Remains 160 /163 variables (removed 3) and now considering 444/459 (removed 15) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 160/163 places, 444/459 transitions.
RANDOM walk for 40000 steps (1278 resets) in 760 ms. (52 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (25 resets) in 13 ms. (285 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (23 resets) in 11 ms. (333 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (33 resets) in 10 ms. (364 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (26 resets) in 11 ms. (333 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (28 resets) in 8 ms. (444 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (32 resets) in 11 ms. (333 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (22 resets) in 24 ms. (160 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (25 resets) in 17 ms. (222 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (24 resets) in 16 ms. (235 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (28 resets) in 20 ms. (190 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (33 resets) in 19 ms. (200 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (25 resets) in 27 ms. (143 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (25 resets) in 23 ms. (166 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (24 resets) in 20 ms. (190 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (22 resets) in 23 ms. (166 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4001 steps (27 resets) in 25 ms. (153 steps per ms) remains 16/16 properties
Interrupted probabilistic random walk after 244318 steps, run timeout after 3001 ms. (steps per millisecond=81 ) properties seen :0 out of 16
Probabilistic random walk after 244318 steps, saw 68743 distinct states, run finished after 3001 ms. (steps per millisecond=81 ) properties seen :0
[2024-06-02 22:22:07] [INFO ] Flow matrix only has 407 transitions (discarded 37 similar events)
// Phase 1: matrix 407 rows 160 cols
[2024-06-02 22:22:07] [INFO ] Computed 7 invariants in 1 ms
[2024-06-02 22:22:07] [INFO ] State equation strengthened by 60 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 99/103 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/103 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (OVERLAPS) 356/459 variables, 103/106 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/459 variables, 40/146 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/459 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (OVERLAPS) 97/556 variables, 50/196 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/556 variables, 3/199 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/556 variables, 20/219 constraints. Problems are: Problem set: 0 solved, 16 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/556 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 10 (OVERLAPS) 10/566 variables, 6/225 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/566 variables, 1/226 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/566 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 13 (OVERLAPS) 1/567 variables, 1/227 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/567 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 15 (OVERLAPS) 0/567 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Real declared 567/567 variables, and 227 constraints, problems are : Problem set: 0 solved, 16 unsolved in 1000 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 160/160 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 16 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 99/103 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/103 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (OVERLAPS) 356/459 variables, 103/106 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/459 variables, 40/146 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/459 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (OVERLAPS) 97/556 variables, 50/196 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/556 variables, 3/199 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/556 variables, 20/219 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/556 variables, 16/235 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/556 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 11 (OVERLAPS) 10/566 variables, 6/241 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/566 variables, 1/242 constraints. Problems are: Problem set: 0 solved, 16 unsolved
[2024-06-02 22:22:09] [INFO ] Deduced a trap composed of 32 places in 39 ms of which 0 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/566 variables, 1/243 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/566 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 15 (OVERLAPS) 1/567 variables, 1/244 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/567 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 17 (OVERLAPS) 0/567 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Int declared 567/567 variables, and 244 constraints, problems are : Problem set: 0 solved, 16 unsolved in 1964 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 160/160 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 1/1 constraints]
After SMT, in 2984ms problems are : Problem set: 0 solved, 16 unsolved
Fused 16 Parikh solutions to 7 different solutions.
Parikh walk visited 0 properties in 240 ms.
Support contains 4 out of 160 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 160/160 places, 444/444 transitions.
Applied a total of 0 rules in 6 ms. Remains 160 /160 variables (removed 0) and now considering 444/444 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 160/160 places, 444/444 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 160/160 places, 444/444 transitions.
Applied a total of 0 rules in 5 ms. Remains 160 /160 variables (removed 0) and now considering 444/444 (removed 0) transitions.
[2024-06-02 22:22:10] [INFO ] Flow matrix only has 407 transitions (discarded 37 similar events)
[2024-06-02 22:22:10] [INFO ] Invariant cache hit.
[2024-06-02 22:22:11] [INFO ] Implicit Places using invariants in 81 ms returned []
[2024-06-02 22:22:11] [INFO ] Flow matrix only has 407 transitions (discarded 37 similar events)
[2024-06-02 22:22:11] [INFO ] Invariant cache hit.
[2024-06-02 22:22:11] [INFO ] State equation strengthened by 60 read => feed constraints.
[2024-06-02 22:22:11] [INFO ] Implicit Places using invariants and state equation in 265 ms returned []
Implicit Place search using SMT with State Equation took 348 ms to find 0 implicit places.
[2024-06-02 22:22:11] [INFO ] Redundant transitions in 4 ms returned []
Running 438 sub problems to find dead transitions.
[2024-06-02 22:22:11] [INFO ] Flow matrix only has 407 transitions (discarded 37 similar events)
[2024-06-02 22:22:11] [INFO ] Invariant cache hit.
[2024-06-02 22:22:11] [INFO ] State equation strengthened by 60 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/160 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 438 unsolved
[2024-06-02 22:22:13] [INFO ] Deduced a trap composed of 55 places in 85 ms of which 1 ms to minimize.
[2024-06-02 22:22:13] [INFO ] Deduced a trap composed of 59 places in 74 ms of which 2 ms to minimize.
[2024-06-02 22:22:13] [INFO ] Deduced a trap composed of 32 places in 31 ms of which 0 ms to minimize.
[2024-06-02 22:22:13] [INFO ] Deduced a trap composed of 58 places in 77 ms of which 2 ms to minimize.
[2024-06-02 22:22:13] [INFO ] Deduced a trap composed of 27 places in 116 ms of which 1 ms to minimize.
[2024-06-02 22:22:13] [INFO ] Deduced a trap composed of 23 places in 74 ms of which 1 ms to minimize.
[2024-06-02 22:22:13] [INFO ] Deduced a trap composed of 32 places in 32 ms of which 1 ms to minimize.
[2024-06-02 22:22:14] [INFO ] Deduced a trap composed of 29 places in 83 ms of which 1 ms to minimize.
[2024-06-02 22:22:14] [INFO ] Deduced a trap composed of 17 places in 69 ms of which 1 ms to minimize.
[2024-06-02 22:22:14] [INFO ] Deduced a trap composed of 32 places in 33 ms of which 1 ms to minimize.
[2024-06-02 22:22:15] [INFO ] Deduced a trap composed of 17 places in 77 ms of which 1 ms to minimize.
[2024-06-02 22:22:15] [INFO ] Deduced a trap composed of 51 places in 79 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/160 variables, 12/19 constraints. Problems are: Problem set: 0 solved, 438 unsolved
[2024-06-02 22:22:15] [INFO ] Deduced a trap composed of 54 places in 85 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/160 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 438 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/160 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 438 unsolved
At refinement iteration 4 (OVERLAPS) 407/567 variables, 160/180 constraints. Problems are: Problem set: 0 solved, 438 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/567 variables, 60/240 constraints. Problems are: Problem set: 0 solved, 438 unsolved
[2024-06-02 22:22:21] [INFO ] Deduced a trap composed of 40 places in 42 ms of which 0 ms to minimize.
[2024-06-02 22:22:23] [INFO ] Deduced a trap composed of 40 places in 43 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/567 variables, 2/242 constraints. Problems are: Problem set: 0 solved, 438 unsolved
[2024-06-02 22:22:29] [INFO ] Deduced a trap composed of 31 places in 40 ms of which 1 ms to minimize.
[2024-06-02 22:22:30] [INFO ] Deduced a trap composed of 40 places in 42 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/567 variables, 2/244 constraints. Problems are: Problem set: 0 solved, 438 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/567 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 438 unsolved
At refinement iteration 9 (OVERLAPS) 0/567 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 438 unsolved
No progress, stopping.
After SMT solving in domain Real declared 567/567 variables, and 244 constraints, problems are : Problem set: 0 solved, 438 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 160/160 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 438/438 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 0 solved, 438 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/160 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 438 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/160 variables, 17/24 constraints. Problems are: Problem set: 0 solved, 438 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/160 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 438 unsolved
At refinement iteration 3 (OVERLAPS) 407/567 variables, 160/184 constraints. Problems are: Problem set: 0 solved, 438 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/567 variables, 60/244 constraints. Problems are: Problem set: 0 solved, 438 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/567 variables, 438/682 constraints. Problems are: Problem set: 0 solved, 438 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/567 variables, 0/682 constraints. Problems are: Problem set: 0 solved, 438 unsolved
At refinement iteration 7 (OVERLAPS) 0/567 variables, 0/682 constraints. Problems are: Problem set: 0 solved, 438 unsolved
No progress, stopping.
After SMT solving in domain Int declared 567/567 variables, and 682 constraints, problems are : Problem set: 0 solved, 438 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 160/160 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 438/438 constraints, Known Traps: 17/17 constraints]
After SMT, in 60365ms problems are : Problem set: 0 solved, 438 unsolved
Search for dead transitions found 0 dead transitions in 60371ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60738 ms. Remains : 160/160 places, 444/444 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 140 edges and 160 vertex of which 29 / 160 are part of one of the 4 SCC in 0 ms
Free SCC test removed 25 places
Drop transitions (Empty/Sink Transition effects.) removed 123 transitions
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 144 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 134 transition count 299
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 0 with 9 rules applied. Total rules applied 12 place count 134 transition count 290
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 133 transition count 289
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 15 place count 133 transition count 288
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 17 place count 132 transition count 287
Free-agglomeration rule applied 9 times with reduction of 6 identical transitions.
Iterating global reduction 0 with 9 rules applied. Total rules applied 26 place count 132 transition count 272
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 38 place count 123 transition count 269
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 44 place count 123 transition count 269
Applied a total of 44 rules in 18 ms. Remains 123 /160 variables (removed 37) and now considering 269/444 (removed 175) transitions.
Running SMT prover for 16 properties.
[2024-06-02 22:23:11] [INFO ] Flow matrix only has 267 transitions (discarded 2 similar events)
// Phase 1: matrix 267 rows 123 cols
[2024-06-02 22:23:11] [INFO ] Computed 7 invariants in 1 ms
[2024-06-02 22:23:11] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-02 22:23:11] [INFO ] After 194ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:16
[2024-06-02 22:23:12] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-02 22:23:12] [INFO ] After 241ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :16
TRAPS : Iteration 0
[2024-06-02 22:23:12] [INFO ] Deduced a trap composed of 21 places in 40 ms of which 1 ms to minimize.
[2024-06-02 22:23:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 62 ms
[2024-06-02 22:23:12] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 1 ms to minimize.
[2024-06-02 22:23:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 57 ms
[2024-06-02 22:23:12] [INFO ] Deduced a trap composed of 10 places in 78 ms of which 1 ms to minimize.
[2024-06-02 22:23:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 92 ms
TRAPS : Iteration 1
[2024-06-02 22:23:12] [INFO ] Deduced a trap composed of 57 places in 64 ms of which 1 ms to minimize.
[2024-06-02 22:23:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 79 ms
TRAPS : Iteration 2
[2024-06-02 22:23:13] [INFO ] Deduced a trap composed of 56 places in 54 ms of which 1 ms to minimize.
[2024-06-02 22:23:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 70 ms
TRAPS : Iteration 3
[2024-06-02 22:23:13] [INFO ] After 1603ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :16
[2024-06-02 22:23:13] [INFO ] After 1879ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :16
Over-approximation ignoring read arcs solved 0 properties in 2107 ms.
Found 7 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p0) p3 p2), (X p2), (X p3), (X (AND (NOT p1) p3 p2)), (X (NOT (OR (NOT p3) (NOT p2)))), (X (NOT (OR (AND p0 (NOT p1) (NOT p3)) (AND p0 (NOT p1) (NOT p2))))), (X (NOT (AND p0 (NOT p1) p3 p2))), (X (NOT (OR (AND p1 (NOT p3)) (AND p1 (NOT p2))))), (X (NOT (OR (AND p0 (NOT p3)) (AND p0 (NOT p2))))), (X (NOT (AND p0 p1 p3 p2))), (X (NOT (OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2))))), (X (NOT (OR (AND p0 p1 (NOT p3)) (AND p0 p1 (NOT p2))))), (X (AND p3 p2)), (X (NOT p0)), (X (NOT p1)), (X (NOT (AND p1 p3 p2))), (X (X p2)), (X (X p3)), (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND (NOT p1) p3 p2))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND p0 p1 p2)))), (X (X (NOT (OR (NOT p3) (NOT p2))))), (X (X (NOT (OR (AND p0 (NOT p1) (NOT p3)) (AND p0 (NOT p1) (NOT p2)))))), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND p0 (NOT p1) p3 p2)))), (X (X (NOT (OR (AND p1 (NOT p3)) (AND p1 (NOT p2)))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (OR (AND p0 (NOT p3)) (AND p0 (NOT p2)))))), (X (X (NOT (AND p0 p1 p3 p2)))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2)))))), (X (X (NOT (OR (AND p0 p1 (NOT p3)) (AND p0 p1 (NOT p2)))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (AND p3 p2))), (X (X (NOT p0))), (X (X (NOT p1))), (X (X (NOT (AND p1 p3 p2)))), (F (OR (G p3) (G (NOT p3)))), (G (OR (NOT p0) (NOT p1) (NOT p3) (NOT p2))), (G (OR (NOT p0) p1 p2)), (G (OR (NOT p1) (NOT p3) (NOT p2))), (G (OR p1 p2)), (G (OR (NOT p1) (NOT p2))), (G (OR (NOT p0) (NOT p1) (NOT p2))), (G (AND (OR (NOT p0) p1 p3) (OR (NOT p0) p1 p2)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 48 factoid took 142 ms. Reduced automaton from 7 states, 27 edges and 4 AP (stutter sensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 122 ms :[false, false, false]
Stuttering acceptance computed with spot in 103 ms :[false, false, false]
Support contains 3 out of 163 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 163/163 places, 459/459 transitions.
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 163 transition count 456
Applied a total of 3 rules in 10 ms. Remains 163 /163 variables (removed 0) and now considering 456/459 (removed 3) transitions.
[2024-06-02 22:23:14] [INFO ] Flow matrix only has 417 transitions (discarded 39 similar events)
// Phase 1: matrix 417 rows 163 cols
[2024-06-02 22:23:14] [INFO ] Computed 7 invariants in 6 ms
[2024-06-02 22:23:14] [INFO ] Implicit Places using invariants in 87 ms returned []
[2024-06-02 22:23:14] [INFO ] Flow matrix only has 417 transitions (discarded 39 similar events)
[2024-06-02 22:23:14] [INFO ] Invariant cache hit.
[2024-06-02 22:23:14] [INFO ] State equation strengthened by 60 read => feed constraints.
[2024-06-02 22:23:14] [INFO ] Implicit Places using invariants and state equation in 283 ms returned []
Implicit Place search using SMT with State Equation took 389 ms to find 0 implicit places.
[2024-06-02 22:23:14] [INFO ] Redundant transitions in 3 ms returned []
Running 449 sub problems to find dead transitions.
[2024-06-02 22:23:14] [INFO ] Flow matrix only has 417 transitions (discarded 39 similar events)
[2024-06-02 22:23:14] [INFO ] Invariant cache hit.
[2024-06-02 22:23:14] [INFO ] State equation strengthened by 60 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/163 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 449 unsolved
[2024-06-02 22:23:16] [INFO ] Deduced a trap composed of 57 places in 90 ms of which 1 ms to minimize.
[2024-06-02 22:23:16] [INFO ] Deduced a trap composed of 17 places in 95 ms of which 2 ms to minimize.
[2024-06-02 22:23:16] [INFO ] Deduced a trap composed of 23 places in 93 ms of which 1 ms to minimize.
[2024-06-02 22:23:16] [INFO ] Deduced a trap composed of 33 places in 45 ms of which 1 ms to minimize.
[2024-06-02 22:23:17] [INFO ] Deduced a trap composed of 17 places in 85 ms of which 1 ms to minimize.
[2024-06-02 22:23:17] [INFO ] Deduced a trap composed of 17 places in 88 ms of which 1 ms to minimize.
[2024-06-02 22:23:17] [INFO ] Deduced a trap composed of 25 places in 86 ms of which 1 ms to minimize.
[2024-06-02 22:23:17] [INFO ] Deduced a trap composed of 33 places in 44 ms of which 0 ms to minimize.
[2024-06-02 22:23:17] [INFO ] Deduced a trap composed of 25 places in 92 ms of which 1 ms to minimize.
[2024-06-02 22:23:18] [INFO ] Deduced a trap composed of 33 places in 30 ms of which 0 ms to minimize.
[2024-06-02 22:23:18] [INFO ] Deduced a trap composed of 14 places in 73 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/163 variables, 11/18 constraints. Problems are: Problem set: 0 solved, 449 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/163 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 449 unsolved
At refinement iteration 3 (OVERLAPS) 416/579 variables, 163/181 constraints. Problems are: Problem set: 0 solved, 449 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/579 variables, 60/241 constraints. Problems are: Problem set: 0 solved, 449 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/579 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 449 unsolved
[2024-06-02 22:23:29] [INFO ] Deduced a trap composed of 32 places in 35 ms of which 1 ms to minimize.
[2024-06-02 22:23:30] [INFO ] Deduced a trap composed of 41 places in 43 ms of which 1 ms to minimize.
At refinement iteration 6 (OVERLAPS) 0/579 variables, 2/243 constraints. Problems are: Problem set: 0 solved, 449 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/579 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 449 unsolved
At refinement iteration 8 (OVERLAPS) 0/579 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 449 unsolved
No progress, stopping.
After SMT solving in domain Real declared 579/580 variables, and 243 constraints, problems are : Problem set: 0 solved, 449 unsolved in 23879 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 163/163 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 449/449 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 0 solved, 449 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/163 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 449 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/163 variables, 13/20 constraints. Problems are: Problem set: 0 solved, 449 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/163 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 449 unsolved
At refinement iteration 3 (OVERLAPS) 416/579 variables, 163/183 constraints. Problems are: Problem set: 0 solved, 449 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/579 variables, 60/243 constraints. Problems are: Problem set: 0 solved, 449 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/579 variables, 449/692 constraints. Problems are: Problem set: 0 solved, 449 unsolved
[2024-06-02 22:23:50] [INFO ] Deduced a trap composed of 41 places in 50 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/579 variables, 1/693 constraints. Problems are: Problem set: 0 solved, 449 unsolved
[2024-06-02 22:23:56] [INFO ] Deduced a trap composed of 41 places in 41 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/579 variables, 1/694 constraints. Problems are: Problem set: 0 solved, 449 unsolved
[2024-06-02 22:24:07] [INFO ] Deduced a trap composed of 36 places in 41 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 579/580 variables, and 695 constraints, problems are : Problem set: 0 solved, 449 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 163/163 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 449/449 constraints, Known Traps: 16/16 constraints]
After SMT, in 54254ms problems are : Problem set: 0 solved, 449 unsolved
Search for dead transitions found 0 dead transitions in 54258ms
Starting structural reductions in SI_LTL mode, iteration 1 : 163/163 places, 456/459 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 54667 ms. Remains : 163/163 places, 456/459 transitions.
Computed a total of 25 stabilizing places and 65 stable transitions
Computed a total of 25 stabilizing places and 65 stable transitions
Knowledge obtained : [(AND p2 (NOT p0)), (X p2), (X (NOT (AND p0 (NOT p2)))), (X (NOT p0)), (X (NOT (AND p0 p2))), (X (X p2)), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT p0))), (X (X (NOT (AND p0 p2))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 115 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter insensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 119 ms :[false, false, false]
RANDOM walk for 40000 steps (1289 resets) in 379 ms. (105 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (313 resets) in 152 ms. (261 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (291 resets) in 157 ms. (253 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (265 resets) in 186 ms. (213 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (283 resets) in 161 ms. (246 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 498312 steps, run timeout after 3001 ms. (steps per millisecond=166 ) properties seen :0 out of 4
Probabilistic random walk after 498312 steps, saw 116726 distinct states, run finished after 3001 ms. (steps per millisecond=166 ) properties seen :0
[2024-06-02 22:24:12] [INFO ] Flow matrix only has 417 transitions (discarded 39 similar events)
[2024-06-02 22:24:12] [INFO ] Invariant cache hit.
[2024-06-02 22:24:12] [INFO ] State equation strengthened by 60 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 101/104 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 361/465 variables, 104/107 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/465 variables, 40/147 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/465 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 101/566 variables, 50/197 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/566 variables, 3/200 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/566 variables, 20/220 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/566 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 12/578 variables, 8/228 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/578 variables, 1/229 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/578 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 1/579 variables, 1/230 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/579 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 0/579 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 579/580 variables, and 230 constraints, problems are : Problem set: 0 solved, 4 unsolved in 325 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 163/163 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 101/104 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 361/465 variables, 104/107 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/465 variables, 40/147 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/465 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 101/566 variables, 50/197 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/566 variables, 3/200 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/566 variables, 20/220 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/566 variables, 4/224 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/566 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 12/578 variables, 8/232 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/578 variables, 1/233 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/578 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 1/579 variables, 1/234 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/579 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 0/579 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 579/580 variables, and 234 constraints, problems are : Problem set: 0 solved, 4 unsolved in 523 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 163/163 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 856ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 169 ms.
Support contains 3 out of 163 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 163/163 places, 456/456 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 163 transition count 450
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 8 place count 162 transition count 449
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 1 with 3 rules applied. Total rules applied 11 place count 162 transition count 455
Reduce places removed 3 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 20 place count 159 transition count 449
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 2 with 6 rules applied. Total rules applied 26 place count 159 transition count 443
Applied a total of 26 rules in 16 ms. Remains 159 /163 variables (removed 4) and now considering 443/456 (removed 13) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 159/163 places, 443/456 transitions.
RANDOM walk for 40000 steps (1291 resets) in 409 ms. (97 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (251 resets) in 136 ms. (291 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (281 resets) in 40 ms. (975 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (274 resets) in 105 ms. (377 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (288 resets) in 124 ms. (320 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 454468 steps, run timeout after 3001 ms. (steps per millisecond=151 ) properties seen :0 out of 4
Probabilistic random walk after 454468 steps, saw 117259 distinct states, run finished after 3002 ms. (steps per millisecond=151 ) properties seen :0
[2024-06-02 22:24:16] [INFO ] Flow matrix only has 406 transitions (discarded 37 similar events)
// Phase 1: matrix 406 rows 159 cols
[2024-06-02 22:24:16] [INFO ] Computed 7 invariants in 2 ms
[2024-06-02 22:24:16] [INFO ] State equation strengthened by 60 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 99/102 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 354/456 variables, 102/105 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/456 variables, 40/145 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/456 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 97/553 variables, 49/194 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/553 variables, 3/197 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/553 variables, 20/217 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/553 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 11/564 variables, 7/224 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/564 variables, 1/225 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/564 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 1/565 variables, 1/226 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/565 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (OVERLAPS) 0/565 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 565/565 variables, and 226 constraints, problems are : Problem set: 0 solved, 4 unsolved in 395 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 159/159 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 99/102 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 354/456 variables, 102/105 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/456 variables, 40/145 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/456 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 97/553 variables, 49/194 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/553 variables, 3/197 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/553 variables, 20/217 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/553 variables, 4/221 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/553 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 11/564 variables, 7/228 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/564 variables, 1/229 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/564 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 1/565 variables, 1/230 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/565 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 0/565 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 565/565 variables, and 230 constraints, problems are : Problem set: 0 solved, 4 unsolved in 501 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 159/159 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 908ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 166 ms.
Support contains 3 out of 159 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 159/159 places, 443/443 transitions.
Applied a total of 0 rules in 6 ms. Remains 159 /159 variables (removed 0) and now considering 443/443 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 159/159 places, 443/443 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 159/159 places, 443/443 transitions.
Applied a total of 0 rules in 4 ms. Remains 159 /159 variables (removed 0) and now considering 443/443 (removed 0) transitions.
[2024-06-02 22:24:17] [INFO ] Flow matrix only has 406 transitions (discarded 37 similar events)
[2024-06-02 22:24:17] [INFO ] Invariant cache hit.
[2024-06-02 22:24:18] [INFO ] Implicit Places using invariants in 87 ms returned []
[2024-06-02 22:24:18] [INFO ] Flow matrix only has 406 transitions (discarded 37 similar events)
[2024-06-02 22:24:18] [INFO ] Invariant cache hit.
[2024-06-02 22:24:18] [INFO ] State equation strengthened by 60 read => feed constraints.
[2024-06-02 22:24:18] [INFO ] Implicit Places using invariants and state equation in 234 ms returned []
Implicit Place search using SMT with State Equation took 321 ms to find 0 implicit places.
[2024-06-02 22:24:18] [INFO ] Redundant transitions in 4 ms returned []
Running 437 sub problems to find dead transitions.
[2024-06-02 22:24:18] [INFO ] Flow matrix only has 406 transitions (discarded 37 similar events)
[2024-06-02 22:24:18] [INFO ] Invariant cache hit.
[2024-06-02 22:24:18] [INFO ] State equation strengthened by 60 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/159 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 437 unsolved
[2024-06-02 22:24:20] [INFO ] Deduced a trap composed of 55 places in 76 ms of which 1 ms to minimize.
[2024-06-02 22:24:20] [INFO ] Deduced a trap composed of 58 places in 77 ms of which 1 ms to minimize.
[2024-06-02 22:24:20] [INFO ] Deduced a trap composed of 27 places in 80 ms of which 2 ms to minimize.
[2024-06-02 22:24:20] [INFO ] Deduced a trap composed of 32 places in 34 ms of which 0 ms to minimize.
[2024-06-02 22:24:20] [INFO ] Deduced a trap composed of 66 places in 81 ms of which 1 ms to minimize.
[2024-06-02 22:24:20] [INFO ] Deduced a trap composed of 23 places in 73 ms of which 1 ms to minimize.
[2024-06-02 22:24:20] [INFO ] Deduced a trap composed of 29 places in 77 ms of which 1 ms to minimize.
[2024-06-02 22:24:21] [INFO ] Deduced a trap composed of 17 places in 72 ms of which 1 ms to minimize.
[2024-06-02 22:24:21] [INFO ] Deduced a trap composed of 32 places in 33 ms of which 1 ms to minimize.
[2024-06-02 22:24:21] [INFO ] Deduced a trap composed of 25 places in 76 ms of which 1 ms to minimize.
[2024-06-02 22:24:21] [INFO ] Deduced a trap composed of 32 places in 39 ms of which 1 ms to minimize.
[2024-06-02 22:24:22] [INFO ] Deduced a trap composed of 51 places in 87 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/159 variables, 12/19 constraints. Problems are: Problem set: 0 solved, 437 unsolved
[2024-06-02 22:24:24] [INFO ] Deduced a trap composed of 17 places in 81 ms of which 1 ms to minimize.
[2024-06-02 22:24:24] [INFO ] Deduced a trap composed of 17 places in 68 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/159 variables, 2/21 constraints. Problems are: Problem set: 0 solved, 437 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/159 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 437 unsolved
At refinement iteration 4 (OVERLAPS) 406/565 variables, 159/180 constraints. Problems are: Problem set: 0 solved, 437 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/565 variables, 60/240 constraints. Problems are: Problem set: 0 solved, 437 unsolved
[2024-06-02 22:24:28] [INFO ] Deduced a trap composed of 40 places in 39 ms of which 0 ms to minimize.
[2024-06-02 22:24:30] [INFO ] Deduced a trap composed of 40 places in 40 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/565 variables, 2/242 constraints. Problems are: Problem set: 0 solved, 437 unsolved
[2024-06-02 22:24:35] [INFO ] Deduced a trap composed of 39 places in 40 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/565 variables, 1/243 constraints. Problems are: Problem set: 0 solved, 437 unsolved
[2024-06-02 22:24:39] [INFO ] Deduced a trap composed of 31 places in 40 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/565 variables, 1/244 constraints. Problems are: Problem set: 0 solved, 437 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/565 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 437 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 565/565 variables, and 244 constraints, problems are : Problem set: 0 solved, 437 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 159/159 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 437/437 constraints, Known Traps: 18/18 constraints]
Escalating to Integer solving :Problem set: 0 solved, 437 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/159 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 437 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/159 variables, 18/25 constraints. Problems are: Problem set: 0 solved, 437 unsolved
[2024-06-02 22:24:50] [INFO ] Deduced a trap composed of 94 places in 81 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/159 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 437 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/159 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 437 unsolved
At refinement iteration 4 (OVERLAPS) 406/565 variables, 159/185 constraints. Problems are: Problem set: 0 solved, 437 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/565 variables, 60/245 constraints. Problems are: Problem set: 0 solved, 437 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/565 variables, 437/682 constraints. Problems are: Problem set: 0 solved, 437 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/565 variables, 0/682 constraints. Problems are: Problem set: 0 solved, 437 unsolved
At refinement iteration 8 (OVERLAPS) 0/565 variables, 0/682 constraints. Problems are: Problem set: 0 solved, 437 unsolved
No progress, stopping.
After SMT solving in domain Int declared 565/565 variables, and 682 constraints, problems are : Problem set: 0 solved, 437 unsolved in 29012 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 159/159 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 437/437 constraints, Known Traps: 19/19 constraints]
After SMT, in 59387ms problems are : Problem set: 0 solved, 437 unsolved
Search for dead transitions found 0 dead transitions in 59394ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 59733 ms. Remains : 159/159 places, 443/443 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 140 edges and 159 vertex of which 29 / 159 are part of one of the 4 SCC in 1 ms
Free SCC test removed 25 places
Drop transitions (Empty/Sink Transition effects.) removed 123 transitions
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 144 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 133 transition count 298
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 0 with 9 rules applied. Total rules applied 12 place count 133 transition count 289
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 132 transition count 288
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 15 place count 132 transition count 287
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 17 place count 131 transition count 286
Free-agglomeration rule applied 9 times with reduction of 6 identical transitions.
Iterating global reduction 0 with 9 rules applied. Total rules applied 26 place count 131 transition count 271
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 38 place count 122 transition count 268
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 44 place count 122 transition count 268
Applied a total of 44 rules in 18 ms. Remains 122 /159 variables (removed 37) and now considering 268/443 (removed 175) transitions.
Running SMT prover for 4 properties.
[2024-06-02 22:25:17] [INFO ] Flow matrix only has 266 transitions (discarded 2 similar events)
// Phase 1: matrix 266 rows 122 cols
[2024-06-02 22:25:17] [INFO ] Computed 7 invariants in 1 ms
[2024-06-02 22:25:17] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-02 22:25:17] [INFO ] After 111ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-06-02 22:25:17] [INFO ] [Nat]Absence check using 7 positive place invariants in 1 ms returned sat
[2024-06-02 22:25:17] [INFO ] After 110ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
TRAPS : Iteration 0
[2024-06-02 22:25:18] [INFO ] Deduced a trap composed of 21 places in 27 ms of which 1 ms to minimize.
[2024-06-02 22:25:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 44 ms
TRAPS : Iteration 1
[2024-06-02 22:25:18] [INFO ] After 275ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
[2024-06-02 22:25:18] [INFO ] After 365ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Over-approximation ignoring read arcs solved 0 properties in 502 ms.
Knowledge obtained : [(AND p2 (NOT p0)), (X p2), (X (NOT (AND p0 (NOT p2)))), (X (NOT p0)), (X (NOT (AND p0 p2))), (X (X p2)), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT p0))), (X (X (NOT (AND p0 p2))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 114 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter insensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 129 ms :[false, false, false]
Stuttering acceptance computed with spot in 122 ms :[false, false, false]
Stuttering acceptance computed with spot in 138 ms :[false, false, false]
Product exploration explored 100000 steps with 1 reset in 55 ms.
Product exploration explored 100000 steps with 1 reset in 56 ms.
Built C files in :
/tmp/ltsmin11268178628846511885
[2024-06-02 22:25:18] [INFO ] Computing symmetric may disable matrix : 456 transitions.
[2024-06-02 22:25:18] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 22:25:18] [INFO ] Computing symmetric may enable matrix : 456 transitions.
[2024-06-02 22:25:18] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 22:25:18] [INFO ] Computing Do-Not-Accords matrix : 456 transitions.
[2024-06-02 22:25:18] [INFO ] Computation of Completed DNA matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 22:25:18] [INFO ] Built C files in 56ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11268178628846511885
Running compilation step : cd /tmp/ltsmin11268178628846511885;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1137 ms.
Running link step : cd /tmp/ltsmin11268178628846511885;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin11268178628846511885;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased8227972150288812978.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 163 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 163/163 places, 456/456 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 162 transition count 455
Applied a total of 2 rules in 7 ms. Remains 162 /163 variables (removed 1) and now considering 455/456 (removed 1) transitions.
[2024-06-02 22:25:33] [INFO ] Flow matrix only has 416 transitions (discarded 39 similar events)
// Phase 1: matrix 416 rows 162 cols
[2024-06-02 22:25:33] [INFO ] Computed 7 invariants in 1 ms
[2024-06-02 22:25:34] [INFO ] Implicit Places using invariants in 73 ms returned []
[2024-06-02 22:25:34] [INFO ] Flow matrix only has 416 transitions (discarded 39 similar events)
[2024-06-02 22:25:34] [INFO ] Invariant cache hit.
[2024-06-02 22:25:34] [INFO ] State equation strengthened by 60 read => feed constraints.
[2024-06-02 22:25:34] [INFO ] Implicit Places using invariants and state equation in 254 ms returned []
Implicit Place search using SMT with State Equation took 328 ms to find 0 implicit places.
[2024-06-02 22:25:34] [INFO ] Redundant transitions in 2 ms returned []
Running 448 sub problems to find dead transitions.
[2024-06-02 22:25:34] [INFO ] Flow matrix only has 416 transitions (discarded 39 similar events)
[2024-06-02 22:25:34] [INFO ] Invariant cache hit.
[2024-06-02 22:25:34] [INFO ] State equation strengthened by 60 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/162 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 448 unsolved
[2024-06-02 22:25:36] [INFO ] Deduced a trap composed of 57 places in 82 ms of which 1 ms to minimize.
[2024-06-02 22:25:36] [INFO ] Deduced a trap composed of 33 places in 32 ms of which 2 ms to minimize.
[2024-06-02 22:25:36] [INFO ] Deduced a trap composed of 17 places in 79 ms of which 2 ms to minimize.
[2024-06-02 22:25:36] [INFO ] Deduced a trap composed of 33 places in 29 ms of which 1 ms to minimize.
[2024-06-02 22:25:36] [INFO ] Deduced a trap composed of 23 places in 79 ms of which 1 ms to minimize.
[2024-06-02 22:25:37] [INFO ] Deduced a trap composed of 17 places in 74 ms of which 1 ms to minimize.
[2024-06-02 22:25:37] [INFO ] Deduced a trap composed of 17 places in 69 ms of which 1 ms to minimize.
[2024-06-02 22:25:37] [INFO ] Deduced a trap composed of 25 places in 78 ms of which 1 ms to minimize.
[2024-06-02 22:25:37] [INFO ] Deduced a trap composed of 33 places in 31 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/162 variables, 9/16 constraints. Problems are: Problem set: 0 solved, 448 unsolved
[2024-06-02 22:25:40] [INFO ] Deduced a trap composed of 14 places in 68 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/162 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 448 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/162 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 448 unsolved
At refinement iteration 4 (OVERLAPS) 415/577 variables, 162/179 constraints. Problems are: Problem set: 0 solved, 448 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/577 variables, 60/239 constraints. Problems are: Problem set: 0 solved, 448 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/577 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 448 unsolved
[2024-06-02 22:25:50] [INFO ] Deduced a trap composed of 32 places in 37 ms of which 1 ms to minimize.
[2024-06-02 22:25:50] [INFO ] Deduced a trap composed of 40 places in 39 ms of which 0 ms to minimize.
At refinement iteration 7 (OVERLAPS) 0/577 variables, 2/241 constraints. Problems are: Problem set: 0 solved, 448 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/577 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 448 unsolved
At refinement iteration 9 (OVERLAPS) 0/577 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 448 unsolved
No progress, stopping.
After SMT solving in domain Real declared 577/578 variables, and 241 constraints, problems are : Problem set: 0 solved, 448 unsolved in 26445 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 162/162 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 448/448 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 448 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/162 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 448 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/162 variables, 12/19 constraints. Problems are: Problem set: 0 solved, 448 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/162 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 448 unsolved
At refinement iteration 3 (OVERLAPS) 415/577 variables, 162/181 constraints. Problems are: Problem set: 0 solved, 448 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/577 variables, 60/241 constraints. Problems are: Problem set: 0 solved, 448 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/577 variables, 448/689 constraints. Problems are: Problem set: 0 solved, 448 unsolved
[2024-06-02 22:26:07] [INFO ] Deduced a trap composed of 41 places in 35 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/577 variables, 1/690 constraints. Problems are: Problem set: 0 solved, 448 unsolved
[2024-06-02 22:26:20] [INFO ] Deduced a trap composed of 41 places in 47 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/577 variables, 1/691 constraints. Problems are: Problem set: 0 solved, 448 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 577/578 variables, and 691 constraints, problems are : Problem set: 0 solved, 448 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 162/162 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 448/448 constraints, Known Traps: 14/14 constraints]
After SMT, in 56821ms problems are : Problem set: 0 solved, 448 unsolved
Search for dead transitions found 0 dead transitions in 56825ms
Starting structural reductions in SI_LTL mode, iteration 1 : 162/163 places, 455/456 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 57174 ms. Remains : 162/163 places, 455/456 transitions.
Built C files in :
/tmp/ltsmin15715518453781239810
[2024-06-02 22:26:31] [INFO ] Computing symmetric may disable matrix : 455 transitions.
[2024-06-02 22:26:31] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 22:26:31] [INFO ] Computing symmetric may enable matrix : 455 transitions.
[2024-06-02 22:26:31] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 22:26:31] [INFO ] Computing Do-Not-Accords matrix : 455 transitions.
[2024-06-02 22:26:31] [INFO ] Computation of Completed DNA matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 22:26:31] [INFO ] Built C files in 56ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15715518453781239810
Running compilation step : cd /tmp/ltsmin15715518453781239810;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1158 ms.
Running link step : cd /tmp/ltsmin15715518453781239810;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin15715518453781239810;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased14507949464093199262.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-06-02 22:26:46] [INFO ] Flatten gal took : 17 ms
[2024-06-02 22:26:46] [INFO ] Flatten gal took : 16 ms
[2024-06-02 22:26:46] [INFO ] Time to serialize gal into /tmp/LTL5375652429986534686.gal : 3 ms
[2024-06-02 22:26:46] [INFO ] Time to serialize properties into /tmp/LTL2463219654624264539.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5375652429986534686.gal' '-t' 'CGAL' '-hoa' '/tmp/aut4273523245046628747.hoa' '-atoms' '/tmp/LTL2463219654624264539.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL2463219654624264539.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut4273523245046628747.hoa
Detected timeout of ITS tools.
[2024-06-02 22:27:01] [INFO ] Flatten gal took : 19 ms
[2024-06-02 22:27:01] [INFO ] Flatten gal took : 17 ms
[2024-06-02 22:27:01] [INFO ] Time to serialize gal into /tmp/LTL5162353701794915610.gal : 3 ms
[2024-06-02 22:27:01] [INFO ] Time to serialize properties into /tmp/LTL2115062944129502860.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5162353701794915610.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2115062944129502860.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((F((!((F(G("((p3==1)&&(p93==1))")))U(!("((p3==1)&&(p161==1))"))))||(F(X((G("((p3==0)||(p161==0))"))&&("(p83==0)")))))))
Formula 0 simplified : G((FG"((p3==1)&&(p93==1))" U !"((p3==1)&&(p161==1))") & XG(!"(p83==0)" | F!"((p3==0)||(p161==0))"))
Detected timeout of ITS tools.
[2024-06-02 22:27:16] [INFO ] Flatten gal took : 20 ms
[2024-06-02 22:27:16] [INFO ] Applying decomposition
[2024-06-02 22:27:16] [INFO ] Flatten gal took : 14 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph8848158826841857131.txt' '-o' '/tmp/graph8848158826841857131.bin' '-w' '/tmp/graph8848158826841857131.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph8848158826841857131.bin' '-l' '-1' '-v' '-w' '/tmp/graph8848158826841857131.weights' '-q' '0' '-e' '0.001'
[2024-06-02 22:27:16] [INFO ] Decomposing Gal with order
[2024-06-02 22:27:16] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 22:27:16] [INFO ] Removed a total of 693 redundant transitions.
[2024-06-02 22:27:16] [INFO ] Flatten gal took : 31 ms
[2024-06-02 22:27:16] [INFO ] Fuse similar labels procedure discarded/fused a total of 137 labels/synchronizations in 11 ms.
[2024-06-02 22:27:16] [INFO ] Time to serialize gal into /tmp/LTL2968912393721189651.gal : 3 ms
[2024-06-02 22:27:16] [INFO ] Time to serialize properties into /tmp/LTL16848029994972248664.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2968912393721189651.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16848029994972248664.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((F((!((F(G("((i0.i0.u0.p3==1)&&(i0.i0.u1.p93==1))")))U(!("((i0.i0.u0.p3==1)&&(i0.i0.u46.p161==1))"))))||(F(X((G("((i0.i0.u0.p3==0)||...205
Formula 0 simplified : G((FG"((i0.i0.u0.p3==1)&&(i0.i0.u1.p93==1))" U !"((i0.i0.u0.p3==1)&&(i0.i0.u46.p161==1))") & XG(!"(i4.u23.p83==0)" | F!"((i0.i0.u0.p...185
Detected timeout of ITS tools.
Treatment of property FireWire-PT-13-LTLFireability-13 finished in 390882 ms.
[2024-06-02 22:27:31] [INFO ] Flatten gal took : 16 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin13274905590127849482
[2024-06-02 22:27:31] [INFO ] Applying decomposition
[2024-06-02 22:27:31] [INFO ] Computing symmetric may disable matrix : 517 transitions.
[2024-06-02 22:27:31] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 22:27:31] [INFO ] Computing symmetric may enable matrix : 517 transitions.
[2024-06-02 22:27:31] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 22:27:31] [INFO ] Flatten gal took : 15 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph17170797079505451718.txt' '-o' '/tmp/graph17170797079505451718.bin' '-w' '/tmp/graph17170797079505451718.weights'
[2024-06-02 22:27:31] [INFO ] Computing Do-Not-Accords matrix : 517 transitions.
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph17170797079505451718.bin' '-l' '-1' '-v' '-w' '/tmp/graph17170797079505451718.weights' '-q' '0' '-e' '0.001'
[2024-06-02 22:27:31] [INFO ] Decomposing Gal with order
[2024-06-02 22:27:31] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 22:27:31] [INFO ] Computation of Completed DNA matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 22:27:31] [INFO ] Built C files in 67ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13274905590127849482
Running compilation step : cd /tmp/ltsmin13274905590127849482;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2024-06-02 22:27:31] [INFO ] Removed a total of 868 redundant transitions.
[2024-06-02 22:27:31] [INFO ] Flatten gal took : 27 ms
[2024-06-02 22:27:31] [INFO ] Fuse similar labels procedure discarded/fused a total of 152 labels/synchronizations in 10 ms.
[2024-06-02 22:27:31] [INFO ] Time to serialize gal into /tmp/LTLFireability12031511886014267851.gal : 3 ms
[2024-06-02 22:27:31] [INFO ] Time to serialize properties into /tmp/LTLFireability5105554034805302744.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability12031511886014267851.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability5105554034805302744.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((F((!((F(G("((i0.u0.p3==1)&&(i0.u1.p93==1))")))U(!("((i0.u0.p3==1)&&(i6.u54.p161==1))"))))||(F(X((G("((i0.u0.p3==0)||(i6.u54.p161==0...187
Formula 0 simplified : G((FG"((i0.u0.p3==1)&&(i0.u1.p93==1))" U !"((i0.u0.p3==1)&&(i6.u54.p161==1))") & XG(!"(i5.u29.p83==0)" | F!"((i0.u0.p3==0)||(i6.u54....167
Compilation finished in 1308 ms.
Running link step : cd /tmp/ltsmin13274905590127849482;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin13274905590127849482;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>((!(<>([]((LTLAPp0==true))) U !(LTLAPp1==true))||<>(X(([]((LTLAPp2==true))&&(LTLAPp3==true))))))' '--buchi-type=spotba'
Reverse transition relation is NOT exact ! Due to transitions t6, t49, t52, t53, t63, t68, t72, t73, t78, t81, t83, t87, t95, t96, t97, t98, t101, t103, t1...1396
Computing Next relation with stutter on 1.52008e+06 deadlock states
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.002: Loading model from ./gal.so
pins2lts-mc-linux64( 2/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.028: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.028: LTL layer: formula: <>((!(<>([]((LTLAPp0==true))) U !(LTLAPp1==true))||<>(X(([]((LTLAPp2==true))&&(LTLAPp3==true))))))
pins2lts-mc-linux64( 2/ 8), 0.050: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.054: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.055: "<>((!(<>([]((LTLAPp0==true))) U !(LTLAPp1==true))||<>(X(([]((LTLAPp2==true))&&(LTLAPp3==true))))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 0/ 8), 0.055: Using Spin LTL semantics
pins2lts-mc-linux64( 7/ 8), 0.063: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.067: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.068: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.072: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.073: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.079: buchi has 10 states
pins2lts-mc-linux64( 0/ 8), 0.145: There are 522 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.145: State length is 195, there are 564 groups
pins2lts-mc-linux64( 0/ 8), 0.145: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.145: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.145: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 0.145: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 1/ 8), 0.162: [Blue] ~88 levels ~960 states ~2680 transitions
pins2lts-mc-linux64( 1/ 8), 0.170: [Blue] ~155 levels ~1920 states ~4568 transitions
pins2lts-mc-linux64( 7/ 8), 0.205: [Blue] ~154 levels ~3840 states ~9784 transitions
pins2lts-mc-linux64( 7/ 8), 0.254: [Blue] ~162 levels ~7680 states ~21480 transitions
pins2lts-mc-linux64( 7/ 8), 0.367: [Blue] ~183 levels ~15360 states ~46664 transitions
pins2lts-mc-linux64( 7/ 8), 0.583: [Blue] ~183 levels ~30720 states ~103568 transitions
pins2lts-mc-linux64( 7/ 8), 1.020: [Blue] ~230 levels ~61440 states ~209968 transitions
pins2lts-mc-linux64( 4/ 8), 1.869: [Blue] ~1156 levels ~122880 states ~403416 transitions
pins2lts-mc-linux64( 5/ 8), 3.385: [Blue] ~299 levels ~245760 states ~912096 transitions
pins2lts-mc-linux64( 4/ 8), 6.092: [Blue] ~1617 levels ~491520 states ~1969120 transitions
pins2lts-mc-linux64( 3/ 8), 10.841: [Blue] ~291 levels ~983040 states ~3580776 transitions
pins2lts-mc-linux64( 5/ 8), 20.053: [Blue] ~327 levels ~1966080 states ~7378936 transitions
pins2lts-mc-linux64( 6/ 8), 37.951: [Blue] ~4215 levels ~3932160 states ~14999920 transitions
pins2lts-mc-linux64( 3/ 8), 74.097: [Blue] ~3658 levels ~7864320 states ~30612848 transitions
pins2lts-mc-linux64( 6/ 8), 146.149: [Blue] ~4215 levels ~15728640 states ~63209688 transitions
pins2lts-mc-linux64( 6/ 8), 290.369: [Blue] ~4215 levels ~31457280 states ~126031960 transitions
pins2lts-mc-linux64( 6/ 8), 577.486: [Blue] ~4215 levels ~62914560 states ~248670312 transitions
pins2lts-mc-linux64( 6/ 8), 1173.978: [Blue] ~4234 levels ~125829120 states ~526213736 transitions
pins2lts-mc-linux64( 5/ 8), 1329.285: Error: tree roots table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 1329.329:
pins2lts-mc-linux64( 0/ 8), 1329.329: Explored 137134713 states 637534615 transitions, fanout: 4.649
pins2lts-mc-linux64( 0/ 8), 1329.329: Total exploration time 1329.180 sec (1329.110 sec minimum, 1329.136 sec on average)
pins2lts-mc-linux64( 0/ 8), 1329.329: States per second: 103172, Transitions per second: 479645
pins2lts-mc-linux64( 0/ 8), 1329.329:
pins2lts-mc-linux64( 0/ 8), 1329.329: State space has 134217351 states, 194 are accepting
pins2lts-mc-linux64( 0/ 8), 1329.329: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 1329.329: blue states: 137134713 (102.17%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 1329.329: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 1329.329: all-red states: 13739 (0.01%), bogus 115 (0.00%)
pins2lts-mc-linux64( 0/ 8), 1329.329:
pins2lts-mc-linux64( 0/ 8), 1329.329: Total memory used for local state coloring: 4.6MB
pins2lts-mc-linux64( 0/ 8), 1329.329:
pins2lts-mc-linux64( 0/ 8), 1329.329: Queue width: 8B, total height: 301184, memory: 2.30MB
pins2lts-mc-linux64( 0/ 8), 1329.329: Tree memory: 1038.6MB, 8.1 B/state, compr.: 1.0%
pins2lts-mc-linux64( 0/ 8), 1329.329: Tree fill ratio (roots/leafs): 99.0%/5.0%
pins2lts-mc-linux64( 0/ 8), 1329.329: Stored 574 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 1329.329: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 1329.329: Est. total memory use: 1040.9MB (~1026.3MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin13274905590127849482;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>((!(<>([]((LTLAPp0==true))) U !(LTLAPp1==true))||<>(X(([]((LTLAPp2==true))&&(LTLAPp3==true))))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin13274905590127849482;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>((!(<>([]((LTLAPp0==true))) U !(LTLAPp1==true))||<>(X(([]((LTLAPp2==true))&&(LTLAPp3==true))))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:241)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:176)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:114)
at java.base/java.lang.Thread.run(Thread.java:840)
Detected timeout of ITS tools.
[2024-06-02 22:56:43] [INFO ] Applying decomposition
[2024-06-02 22:56:43] [INFO ] Flatten gal took : 15 ms
[2024-06-02 22:56:43] [INFO ] Decomposing Gal with order
[2024-06-02 22:56:43] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 22:56:43] [INFO ] Removed a total of 673 redundant transitions.
[2024-06-02 22:56:43] [INFO ] Flatten gal took : 40 ms
[2024-06-02 22:56:43] [INFO ] Fuse similar labels procedure discarded/fused a total of 201 labels/synchronizations in 4 ms.
[2024-06-02 22:56:43] [INFO ] Time to serialize gal into /tmp/LTLFireability7564423157401208.gal : 2 ms
[2024-06-02 22:56:43] [INFO ] Time to serialize properties into /tmp/LTLFireability10996850058137765996.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability7564423157401208.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability10996850058137765996.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...274
Read 1 LTL properties
Checking formula 0 : !((F((!((F(G("((u1.p3==1)&&(u9.p93==1))")))U(!("((u1.p3==1)&&(u13.p161==1))"))))||(F(X((G("((u1.p3==0)||(u13.p161==0))"))&&("(u8.p83==...165
Formula 0 simplified : G((FG"((u1.p3==1)&&(u9.p93==1))" U !"((u1.p3==1)&&(u13.p161==1))") & XG(!"(u8.p83==0)" | F!"((u1.p3==0)||(u13.p161==0))"))
Reverse transition relation is NOT exact ! Due to transitions t63, t75, t76, t85, t109, t239, t283, t284, t291, t293, t334, t407, t421, t433, t434, t465, t...617
Computing Next relation with stutter on 1.52008e+06 deadlock states
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="FireWire-PT-13"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool itstools"
echo " Input is FireWire-PT-13, 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 r550-tall-171734899000268"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/FireWire-PT-13.tgz
mv FireWire-PT-13 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 ;