About the Execution of ITS-Tools for FireWire-PT-20
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 2210.771 | 1615702.00 | 1976927.00 | 3507.60 | FFFFFTFFTFFFFFFF | 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-171734899100324.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-20, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r550-tall-171734899100324
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 592K
-rw-r--r-- 1 mcc users 5.8K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 58K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 6.5K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 60K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.2K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 59K 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 247K 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-20-LTLFireability-00
FORMULA_NAME FireWire-PT-20-LTLFireability-01
FORMULA_NAME FireWire-PT-20-LTLFireability-02
FORMULA_NAME FireWire-PT-20-LTLFireability-03
FORMULA_NAME FireWire-PT-20-LTLFireability-04
FORMULA_NAME FireWire-PT-20-LTLFireability-05
FORMULA_NAME FireWire-PT-20-LTLFireability-06
FORMULA_NAME FireWire-PT-20-LTLFireability-07
FORMULA_NAME FireWire-PT-20-LTLFireability-08
FORMULA_NAME FireWire-PT-20-LTLFireability-09
FORMULA_NAME FireWire-PT-20-LTLFireability-10
FORMULA_NAME FireWire-PT-20-LTLFireability-11
FORMULA_NAME FireWire-PT-20-LTLFireability-12
FORMULA_NAME FireWire-PT-20-LTLFireability-13
FORMULA_NAME FireWire-PT-20-LTLFireability-14
FORMULA_NAME FireWire-PT-20-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1717373954177
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-20
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202405141337
[2024-06-03 00:19:15] [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-03 00:19:15] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-03 00:19:15] [INFO ] Load time of PNML (sax parser for PT used): 104 ms
[2024-06-03 00:19:15] [INFO ] Transformed 626 places.
[2024-06-03 00:19:15] [INFO ] Transformed 1031 transitions.
[2024-06-03 00:19:15] [INFO ] Found NUPN structural information;
[2024-06-03 00:19:15] [INFO ] Parsed PT model containing 626 places and 1031 transitions and 3196 arcs in 203 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 1 formulas.
FORMULA FireWire-PT-20-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Initial state reduction rules removed 1 formulas.
FORMULA FireWire-PT-20-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 36 out of 626 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 626/626 places, 1031/1031 transitions.
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 611 transition count 1031
Discarding 133 places :
Symmetric choice reduction at 1 with 133 rule applications. Total rules 148 place count 478 transition count 898
Iterating global reduction 1 with 133 rules applied. Total rules applied 281 place count 478 transition count 898
Discarding 34 places :
Symmetric choice reduction at 1 with 34 rule applications. Total rules 315 place count 444 transition count 764
Iterating global reduction 1 with 34 rules applied. Total rules applied 349 place count 444 transition count 764
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 350 place count 444 transition count 763
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 360 place count 434 transition count 747
Iterating global reduction 2 with 10 rules applied. Total rules applied 370 place count 434 transition count 747
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 373 place count 434 transition count 744
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 376 place count 431 transition count 735
Iterating global reduction 3 with 3 rules applied. Total rules applied 379 place count 431 transition count 735
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 382 place count 428 transition count 729
Iterating global reduction 3 with 3 rules applied. Total rules applied 385 place count 428 transition count 729
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 388 place count 425 transition count 720
Iterating global reduction 3 with 3 rules applied. Total rules applied 391 place count 425 transition count 720
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 393 place count 423 transition count 716
Iterating global reduction 3 with 2 rules applied. Total rules applied 395 place count 423 transition count 716
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 397 place count 421 transition count 710
Iterating global reduction 3 with 2 rules applied. Total rules applied 399 place count 421 transition count 710
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 401 place count 419 transition count 706
Iterating global reduction 3 with 2 rules applied. Total rules applied 403 place count 419 transition count 706
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 405 place count 417 transition count 700
Iterating global reduction 3 with 2 rules applied. Total rules applied 407 place count 417 transition count 700
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 408 place count 416 transition count 698
Iterating global reduction 3 with 1 rules applied. Total rules applied 409 place count 416 transition count 698
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 410 place count 415 transition count 695
Iterating global reduction 3 with 1 rules applied. Total rules applied 411 place count 415 transition count 695
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 412 place count 414 transition count 693
Iterating global reduction 3 with 1 rules applied. Total rules applied 413 place count 414 transition count 693
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 414 place count 413 transition count 691
Iterating global reduction 3 with 1 rules applied. Total rules applied 415 place count 413 transition count 691
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 416 place count 412 transition count 689
Iterating global reduction 3 with 1 rules applied. Total rules applied 417 place count 412 transition count 689
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 418 place count 411 transition count 688
Iterating global reduction 3 with 1 rules applied. Total rules applied 419 place count 411 transition count 688
Applied a total of 419 rules in 221 ms. Remains 411 /626 variables (removed 215) and now considering 688/1031 (removed 343) transitions.
// Phase 1: matrix 688 rows 411 cols
[2024-06-03 00:19:16] [INFO ] Computed 10 invariants in 23 ms
[2024-06-03 00:19:16] [INFO ] Implicit Places using invariants in 485 ms returned []
[2024-06-03 00:19:16] [INFO ] Invariant cache hit.
[2024-06-03 00:19:17] [INFO ] Implicit Places using invariants and state equation in 568 ms returned []
Implicit Place search using SMT with State Equation took 1266 ms to find 0 implicit places.
Running 687 sub problems to find dead transitions.
[2024-06-03 00:19:17] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/410 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 687 unsolved
At refinement iteration 1 (OVERLAPS) 1/411 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 687 unsolved
[2024-06-03 00:19:26] [INFO ] Deduced a trap composed of 226 places in 192 ms of which 24 ms to minimize.
[2024-06-03 00:19:26] [INFO ] Deduced a trap composed of 84 places in 102 ms of which 1 ms to minimize.
[2024-06-03 00:19:26] [INFO ] Deduced a trap composed of 87 places in 120 ms of which 1 ms to minimize.
[2024-06-03 00:19:26] [INFO ] Deduced a trap composed of 103 places in 81 ms of which 1 ms to minimize.
[2024-06-03 00:19:27] [INFO ] Deduced a trap composed of 81 places in 190 ms of which 2 ms to minimize.
[2024-06-03 00:19:27] [INFO ] Deduced a trap composed of 92 places in 231 ms of which 1 ms to minimize.
[2024-06-03 00:19:28] [INFO ] Deduced a trap composed of 232 places in 245 ms of which 3 ms to minimize.
[2024-06-03 00:19:29] [INFO ] Deduced a trap composed of 79 places in 71 ms of which 2 ms to minimize.
[2024-06-03 00:19:29] [INFO ] Deduced a trap composed of 80 places in 60 ms of which 5 ms to minimize.
[2024-06-03 00:19:30] [INFO ] Deduced a trap composed of 79 places in 70 ms of which 1 ms to minimize.
[2024-06-03 00:19:30] [INFO ] Deduced a trap composed of 78 places in 73 ms of which 1 ms to minimize.
[2024-06-03 00:19:30] [INFO ] Deduced a trap composed of 92 places in 65 ms of which 1 ms to minimize.
[2024-06-03 00:19:31] [INFO ] Deduced a trap composed of 58 places in 177 ms of which 2 ms to minimize.
[2024-06-03 00:19:31] [INFO ] Deduced a trap composed of 57 places in 154 ms of which 2 ms to minimize.
[2024-06-03 00:19:31] [INFO ] Deduced a trap composed of 45 places in 145 ms of which 2 ms to minimize.
[2024-06-03 00:19:33] [INFO ] Deduced a trap composed of 70 places in 138 ms of which 3 ms to minimize.
[2024-06-03 00:19:34] [INFO ] Deduced a trap composed of 65 places in 139 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/411 variables, 17/27 constraints. Problems are: Problem set: 0 solved, 687 unsolved
[2024-06-03 00:19:40] [INFO ] Deduced a trap composed of 58 places in 179 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/411 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 687 unsolved
[2024-06-03 00:19:46] [INFO ] Deduced a trap composed of 80 places in 152 ms of which 2 ms to minimize.
[2024-06-03 00:19:46] [INFO ] Deduced a trap composed of 238 places in 149 ms of which 3 ms to minimize.
[2024-06-03 00:19:46] [INFO ] Deduced a trap composed of 81 places in 94 ms of which 1 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 1.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 1.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 1.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 1.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 411/1099 variables, and 31 constraints, problems are : Problem set: 0 solved, 687 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 0/411 constraints, PredecessorRefiner: 687/687 constraints, Known Traps: 21/21 constraints]
Escalating to Integer solving :Problem set: 0 solved, 687 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/410 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 687 unsolved
At refinement iteration 1 (OVERLAPS) 1/411 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 687 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/411 variables, 21/31 constraints. Problems are: Problem set: 0 solved, 687 unsolved
[2024-06-03 00:19:53] [INFO ] Deduced a trap composed of 103 places in 89 ms of which 2 ms to minimize.
[2024-06-03 00:19:55] [INFO ] Deduced a trap composed of 101 places in 71 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/411 variables, 2/33 constraints. Problems are: Problem set: 0 solved, 687 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/411 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 687 unsolved
At refinement iteration 5 (OVERLAPS) 688/1099 variables, 411/444 constraints. Problems are: Problem set: 0 solved, 687 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1099 variables, 687/1131 constraints. Problems are: Problem set: 0 solved, 687 unsolved
[2024-06-03 00:20:13] [INFO ] Deduced a trap composed of 24 places in 112 ms of which 3 ms to minimize.
[2024-06-03 00:20:14] [INFO ] Deduced a trap composed of 120 places in 158 ms of which 2 ms to minimize.
[2024-06-03 00:20:17] [INFO ] Deduced a trap composed of 256 places in 154 ms of which 2 ms to minimize.
SMT process timed out in 60613ms, After SMT, problems are : Problem set: 0 solved, 687 unsolved
Search for dead transitions found 0 dead transitions in 60649ms
Starting structural reductions in LTL mode, iteration 1 : 411/626 places, 688/1031 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62163 ms. Remains : 411/626 places, 688/1031 transitions.
Support contains 36 out of 411 places after structural reductions.
[2024-06-03 00:20:18] [INFO ] Flatten gal took : 121 ms
[2024-06-03 00:20:18] [INFO ] Flatten gal took : 40 ms
[2024-06-03 00:20:18] [INFO ] Input system was already deterministic with 688 transitions.
Support contains 35 out of 411 places (down from 36) after GAL structural reductions.
RANDOM walk for 40000 steps (22 resets) in 2285 ms. (17 steps per ms) remains 18/28 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 10 ms. (363 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 10 ms. (363 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 9 ms. (400 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 18/18 properties
[2024-06-03 00:20:19] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 18 unsolved
Problem AtomicPropp18 is UNSAT
At refinement iteration 1 (OVERLAPS) 301/323 variables, 5/5 constraints. Problems are: Problem set: 1 solved, 17 unsolved
[2024-06-03 00:20:20] [INFO ] Deduced a trap composed of 101 places in 88 ms of which 1 ms to minimize.
[2024-06-03 00:20:20] [INFO ] Deduced a trap composed of 65 places in 131 ms of which 2 ms to minimize.
[2024-06-03 00:20:20] [INFO ] Deduced a trap composed of 58 places in 201 ms of which 6 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/323 variables, 3/8 constraints. Problems are: Problem set: 1 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/323 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 17 unsolved
At refinement iteration 4 (OVERLAPS) 47/370 variables, 5/13 constraints. Problems are: Problem set: 1 solved, 17 unsolved
[2024-06-03 00:20:21] [INFO ] Deduced a trap composed of 92 places in 79 ms of which 1 ms to minimize.
[2024-06-03 00:20:21] [INFO ] Deduced a trap composed of 79 places in 495 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/370 variables, 2/15 constraints. Problems are: Problem set: 1 solved, 17 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/370 variables, 0/15 constraints. Problems are: Problem set: 1 solved, 17 unsolved
At refinement iteration 7 (OVERLAPS) 648/1018 variables, 370/385 constraints. Problems are: Problem set: 1 solved, 17 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1018 variables, 0/385 constraints. Problems are: Problem set: 1 solved, 17 unsolved
At refinement iteration 9 (OVERLAPS) 39/1057 variables, 19/404 constraints. Problems are: Problem set: 1 solved, 17 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1057 variables, 0/404 constraints. Problems are: Problem set: 1 solved, 17 unsolved
At refinement iteration 11 (OVERLAPS) 28/1085 variables, 11/415 constraints. Problems are: Problem set: 1 solved, 17 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1085 variables, 0/415 constraints. Problems are: Problem set: 1 solved, 17 unsolved
At refinement iteration 13 (OVERLAPS) 14/1099 variables, 11/426 constraints. Problems are: Problem set: 1 solved, 17 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1099 variables, 0/426 constraints. Problems are: Problem set: 1 solved, 17 unsolved
[2024-06-03 00:20:23] [INFO ] Deduced a trap composed of 79 places in 80 ms of which 1 ms to minimize.
At refinement iteration 15 (OVERLAPS) 0/1099 variables, 1/427 constraints. Problems are: Problem set: 1 solved, 17 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1099 variables, 0/427 constraints. Problems are: Problem set: 1 solved, 17 unsolved
At refinement iteration 17 (OVERLAPS) 0/1099 variables, 0/427 constraints. Problems are: Problem set: 1 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1099/1099 variables, and 427 constraints, problems are : Problem set: 1 solved, 17 unsolved in 4324 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 411/411 constraints, PredecessorRefiner: 18/18 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 1 solved, 17 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 17 unsolved
At refinement iteration 1 (OVERLAPS) 302/323 variables, 5/5 constraints. Problems are: Problem set: 1 solved, 17 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/323 variables, 3/8 constraints. Problems are: Problem set: 1 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/323 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 17 unsolved
At refinement iteration 4 (OVERLAPS) 47/370 variables, 5/13 constraints. Problems are: Problem set: 1 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/370 variables, 3/16 constraints. Problems are: Problem set: 1 solved, 17 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/370 variables, 0/16 constraints. Problems are: Problem set: 1 solved, 17 unsolved
At refinement iteration 7 (OVERLAPS) 648/1018 variables, 370/386 constraints. Problems are: Problem set: 1 solved, 17 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1018 variables, 17/403 constraints. Problems are: Problem set: 1 solved, 17 unsolved
[2024-06-03 00:20:24] [INFO ] Deduced a trap composed of 45 places in 150 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/1018 variables, 1/404 constraints. Problems are: Problem set: 1 solved, 17 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1018 variables, 0/404 constraints. Problems are: Problem set: 1 solved, 17 unsolved
At refinement iteration 11 (OVERLAPS) 39/1057 variables, 19/423 constraints. Problems are: Problem set: 1 solved, 17 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1057 variables, 0/423 constraints. Problems are: Problem set: 1 solved, 17 unsolved
At refinement iteration 13 (OVERLAPS) 28/1085 variables, 11/434 constraints. Problems are: Problem set: 1 solved, 17 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1085 variables, 0/434 constraints. Problems are: Problem set: 1 solved, 17 unsolved
At refinement iteration 15 (OVERLAPS) 14/1099 variables, 11/445 constraints. Problems are: Problem set: 1 solved, 17 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1099 variables, 0/445 constraints. Problems are: Problem set: 1 solved, 17 unsolved
At refinement iteration 17 (OVERLAPS) 0/1099 variables, 0/445 constraints. Problems are: Problem set: 1 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1099/1099 variables, and 445 constraints, problems are : Problem set: 1 solved, 17 unsolved in 4175 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 411/411 constraints, PredecessorRefiner: 17/18 constraints, Known Traps: 7/7 constraints]
After SMT, in 8527ms problems are : Problem set: 1 solved, 17 unsolved
Parikh walk visited 0 properties in 2865 ms.
Support contains 21 out of 411 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 411/411 places, 688/688 transitions.
Graph (trivial) has 280 edges and 411 vertex of which 11 / 411 are part of one of the 3 SCC in 3 ms
Free SCC test removed 8 places
Drop transitions (Empty/Sink Transition effects.) removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 57 transitions
Trivial Post-agglo rules discarded 57 transitions
Performed 57 trivial Post agglomeration. Transition count delta: 57
Iterating post reduction 0 with 57 rules applied. Total rules applied 58 place count 403 transition count 616
Reduce places removed 57 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 61 rules applied. Total rules applied 119 place count 346 transition count 612
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 120 place count 345 transition count 612
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 32 Pre rules applied. Total rules applied 120 place count 345 transition count 580
Deduced a syphon composed of 32 places in 2 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 3 with 64 rules applied. Total rules applied 184 place count 313 transition count 580
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 188 place count 309 transition count 575
Iterating global reduction 3 with 4 rules applied. Total rules applied 192 place count 309 transition count 575
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 193 place count 309 transition count 574
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 193 place count 309 transition count 573
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 195 place count 308 transition count 573
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 196 place count 307 transition count 571
Iterating global reduction 4 with 1 rules applied. Total rules applied 197 place count 307 transition count 571
Performed 42 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 42 places in 1 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 4 with 84 rules applied. Total rules applied 281 place count 265 transition count 528
Performed 40 Post agglomeration using F-continuation condition with reduction of 9 identical transitions.
Deduced a syphon composed of 40 places in 1 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 4 with 80 rules applied. Total rules applied 361 place count 225 transition count 617
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 364 place count 225 transition count 614
Free-agglomeration rule applied 20 times.
Iterating global reduction 4 with 20 rules applied. Total rules applied 384 place count 225 transition count 594
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 4 with 20 rules applied. Total rules applied 404 place count 205 transition count 594
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 409 place count 200 transition count 589
Iterating global reduction 5 with 5 rules applied. Total rules applied 414 place count 200 transition count 589
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 420 place count 200 transition count 583
Applied a total of 420 rules in 164 ms. Remains 200 /411 variables (removed 211) and now considering 583/688 (removed 105) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 164 ms. Remains : 200/411 places, 583/688 transitions.
RANDOM walk for 40000 steps (1279 resets) in 520 ms. (76 steps per ms) remains 11/17 properties
BEST_FIRST walk for 40003 steps (21 resets) in 159 ms. (250 steps per ms) remains 10/11 properties
BEST_FIRST walk for 40004 steps (271 resets) in 90 ms. (439 steps per ms) remains 8/10 properties
BEST_FIRST walk for 40003 steps (270 resets) in 92 ms. (430 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (272 resets) in 69 ms. (571 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (277 resets) in 93 ms. (425 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (261 resets) in 117 ms. (339 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (278 resets) in 98 ms. (404 steps per ms) remains 7/8 properties
BEST_FIRST walk for 40003 steps (272 resets) in 105 ms. (377 steps per ms) remains 7/7 properties
[2024-06-03 00:20:31] [INFO ] Flow matrix only has 562 transitions (discarded 21 similar events)
// Phase 1: matrix 562 rows 200 cols
[2024-06-03 00:20:31] [INFO ] Computed 10 invariants in 3 ms
[2024-06-03 00:20:31] [INFO ] State equation strengthened by 15 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 116/126 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 62/188 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-06-03 00:20:31] [INFO ] Deduced a trap composed of 61 places in 38 ms of which 1 ms to minimize.
[2024-06-03 00:20:32] [INFO ] Deduced a trap composed of 28 places in 94 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/188 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/188 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 562/750 variables, 188/200 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/750 variables, 15/215 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-06-03 00:20:32] [INFO ] Deduced a trap composed of 50 places in 43 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/750 variables, 1/216 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/750 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (OVERLAPS) 12/762 variables, 12/228 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/762 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (OVERLAPS) 0/762 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 762/762 variables, and 228 constraints, problems are : Problem set: 0 solved, 7 unsolved in 1066 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 200/200 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 116/126 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 62/188 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/188 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/188 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 562/750 variables, 188/201 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/750 variables, 15/216 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/750 variables, 7/223 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/750 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (OVERLAPS) 12/762 variables, 12/235 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/762 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (OVERLAPS) 0/762 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 762/762 variables, and 235 constraints, problems are : Problem set: 0 solved, 7 unsolved in 852 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 200/200 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 3/3 constraints]
After SMT, in 1942ms problems are : Problem set: 0 solved, 7 unsolved
Parikh walk visited 1 properties in 2400 ms.
Support contains 8 out of 200 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 200/200 places, 583/583 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 200 transition count 579
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 196 transition count 579
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 8 place count 196 transition count 577
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 12 place count 194 transition count 577
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 13 place count 193 transition count 574
Iterating global reduction 2 with 1 rules applied. Total rules applied 14 place count 193 transition count 574
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 15 place count 192 transition count 572
Iterating global reduction 2 with 1 rules applied. Total rules applied 16 place count 192 transition count 572
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 17 place count 191 transition count 570
Iterating global reduction 2 with 1 rules applied. Total rules applied 18 place count 191 transition count 570
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 19 place count 190 transition count 568
Iterating global reduction 2 with 1 rules applied. Total rules applied 20 place count 190 transition count 568
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 24 place count 188 transition count 566
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 2 with 6 rules applied. Total rules applied 30 place count 185 transition count 569
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 32 place count 185 transition count 567
Reduce places removed 2 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 43 place count 183 transition count 558
Drop transitions (Redundant composition of simpler transitions.) removed 28 transitions
Redundant transition composition rules discarded 28 transitions
Iterating global reduction 3 with 28 rules applied. Total rules applied 71 place count 183 transition count 530
Applied a total of 71 rules in 78 ms. Remains 183 /200 variables (removed 17) and now considering 530/583 (removed 53) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 78 ms. Remains : 183/200 places, 530/583 transitions.
RANDOM walk for 40000 steps (1328 resets) in 203 ms. (196 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (257 resets) in 67 ms. (588 steps per ms) remains 5/6 properties
BEST_FIRST walk for 40003 steps (254 resets) in 73 ms. (540 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (265 resets) in 81 ms. (487 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (254 resets) in 86 ms. (459 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (258 resets) in 62 ms. (634 steps per ms) remains 5/5 properties
[2024-06-03 00:20:36] [INFO ] Flow matrix only has 519 transitions (discarded 11 similar events)
// Phase 1: matrix 519 rows 183 cols
[2024-06-03 00:20:36] [INFO ] Computed 10 invariants in 2 ms
[2024-06-03 00:20:36] [INFO ] State equation strengthened by 67 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 62/69 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/69 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 102/171 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-03 00:20:36] [INFO ] Deduced a trap composed of 46 places in 40 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/171 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/171 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 519/690 variables, 171/182 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/690 variables, 67/249 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/690 variables, 0/249 constraints. Problems are: Problem set: 0 solved, 5 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 12/702 variables, 12/261 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/702 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 0/702 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 702/702 variables, and 261 constraints, problems are : Problem set: 0 solved, 5 unsolved in 430 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 183/183 constraints, ReadFeed: 67/67 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 62/69 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/69 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 102/171 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/171 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-03 00:20:36] [INFO ] Deduced a trap composed of 29 places in 89 ms of which 1 ms to minimize.
[2024-06-03 00:20:37] [INFO ] Deduced a trap composed of 35 places in 80 ms of which 2 ms to minimize.
[2024-06-03 00:20:37] [INFO ] Deduced a trap composed of 38 places in 94 ms of which 2 ms to minimize.
[2024-06-03 00:20:37] [INFO ] Deduced a trap composed of 27 places in 86 ms of which 1 ms to minimize.
[2024-06-03 00:20:37] [INFO ] Deduced a trap composed of 35 places in 33 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/171 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/171 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 519/690 variables, 171/187 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/690 variables, 67/254 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/690 variables, 5/259 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/690 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 12/702 variables, 12/271 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/702 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 0/702 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 702/702 variables, and 271 constraints, problems are : Problem set: 0 solved, 5 unsolved in 1058 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 183/183 constraints, ReadFeed: 67/67 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 6/6 constraints]
After SMT, in 1501ms problems are : Problem set: 0 solved, 5 unsolved
Parikh walk visited 0 properties in 1919 ms.
Support contains 7 out of 183 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 183/183 places, 530/530 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 182 transition count 529
Applied a total of 2 rules in 14 ms. Remains 182 /183 variables (removed 1) and now considering 529/530 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 182/183 places, 529/530 transitions.
RANDOM walk for 40000 steps (1323 resets) in 193 ms. (206 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (257 resets) in 75 ms. (526 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (277 resets) in 53 ms. (740 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (259 resets) in 48 ms. (816 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (269 resets) in 84 ms. (470 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (253 resets) in 77 ms. (512 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 396559 steps, run timeout after 3001 ms. (steps per millisecond=132 ) properties seen :0 out of 5
Probabilistic random walk after 396559 steps, saw 131806 distinct states, run finished after 3018 ms. (steps per millisecond=131 ) properties seen :0
[2024-06-03 00:20:43] [INFO ] Flow matrix only has 518 transitions (discarded 11 similar events)
// Phase 1: matrix 518 rows 182 cols
[2024-06-03 00:20:43] [INFO ] Computed 10 invariants in 4 ms
[2024-06-03 00:20:43] [INFO ] State equation strengthened by 67 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 62/69 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/69 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 101/170 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-03 00:20:43] [INFO ] Deduced a trap composed of 46 places in 46 ms of which 1 ms to minimize.
[2024-06-03 00:20:43] [INFO ] Deduced a trap composed of 37 places in 49 ms of which 1 ms to minimize.
[2024-06-03 00:20:43] [INFO ] Deduced a trap composed of 35 places in 32 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/170 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/170 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 518/688 variables, 170/183 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/688 variables, 67/250 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/688 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 5 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 12/700 variables, 12/262 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/700 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 0/700 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 700/700 variables, and 262 constraints, problems are : Problem set: 0 solved, 5 unsolved in 531 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 182/182 constraints, ReadFeed: 67/67 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 62/69 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/69 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 101/170 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/170 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-03 00:20:43] [INFO ] Deduced a trap composed of 29 places in 94 ms of which 1 ms to minimize.
[2024-06-03 00:20:43] [INFO ] Deduced a trap composed of 64 places in 92 ms of which 1 ms to minimize.
[2024-06-03 00:20:43] [INFO ] Deduced a trap composed of 26 places in 94 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/170 variables, 3/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/170 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 518/688 variables, 170/186 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/688 variables, 67/253 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/688 variables, 5/258 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/688 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 12/700 variables, 12/270 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/700 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 0/700 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 700/700 variables, and 270 constraints, problems are : Problem set: 0 solved, 5 unsolved in 955 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 182/182 constraints, ReadFeed: 67/67 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 6/6 constraints]
After SMT, in 1501ms problems are : Problem set: 0 solved, 5 unsolved
Parikh walk visited 0 properties in 1974 ms.
Support contains 7 out of 182 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 182/182 places, 529/529 transitions.
Applied a total of 0 rules in 12 ms. Remains 182 /182 variables (removed 0) and now considering 529/529 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 182/182 places, 529/529 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 182/182 places, 529/529 transitions.
Applied a total of 0 rules in 14 ms. Remains 182 /182 variables (removed 0) and now considering 529/529 (removed 0) transitions.
[2024-06-03 00:20:46] [INFO ] Flow matrix only has 518 transitions (discarded 11 similar events)
[2024-06-03 00:20:46] [INFO ] Invariant cache hit.
[2024-06-03 00:20:46] [INFO ] Implicit Places using invariants in 114 ms returned []
[2024-06-03 00:20:46] [INFO ] Flow matrix only has 518 transitions (discarded 11 similar events)
[2024-06-03 00:20:46] [INFO ] Invariant cache hit.
[2024-06-03 00:20:46] [INFO ] State equation strengthened by 67 read => feed constraints.
[2024-06-03 00:20:47] [INFO ] Implicit Places using invariants and state equation in 396 ms returned []
Implicit Place search using SMT with State Equation took 512 ms to find 0 implicit places.
[2024-06-03 00:20:47] [INFO ] Redundant transitions in 43 ms returned [514, 517, 518]
Found 3 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 3 transitions
Redundant transitions reduction (with SMT) removed 3 transitions.
Running 518 sub problems to find dead transitions.
[2024-06-03 00:20:47] [INFO ] Flow matrix only has 515 transitions (discarded 11 similar events)
// Phase 1: matrix 515 rows 182 cols
[2024-06-03 00:20:47] [INFO ] Computed 10 invariants in 3 ms
[2024-06-03 00:20:47] [INFO ] State equation strengthened by 67 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/181 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 518 unsolved
At refinement iteration 1 (OVERLAPS) 1/182 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 518 unsolved
[2024-06-03 00:20:51] [INFO ] Deduced a trap composed of 37 places in 43 ms of which 1 ms to minimize.
[2024-06-03 00:20:51] [INFO ] Deduced a trap composed of 46 places in 39 ms of which 0 ms to minimize.
[2024-06-03 00:20:51] [INFO ] Deduced a trap composed of 29 places in 95 ms of which 1 ms to minimize.
[2024-06-03 00:20:51] [INFO ] Deduced a trap composed of 30 places in 86 ms of which 1 ms to minimize.
[2024-06-03 00:20:51] [INFO ] Deduced a trap composed of 26 places in 94 ms of which 1 ms to minimize.
[2024-06-03 00:20:51] [INFO ] Deduced a trap composed of 35 places in 38 ms of which 0 ms to minimize.
[2024-06-03 00:20:52] [INFO ] Deduced a trap composed of 35 places in 36 ms of which 1 ms to minimize.
[2024-06-03 00:20:52] [INFO ] Deduced a trap composed of 99 places in 91 ms of which 2 ms to minimize.
[2024-06-03 00:20:52] [INFO ] Deduced a trap composed of 100 places in 85 ms of which 2 ms to minimize.
[2024-06-03 00:20:53] [INFO ] Deduced a trap composed of 135 places in 90 ms of which 2 ms to minimize.
[2024-06-03 00:20:53] [INFO ] Deduced a trap composed of 19 places in 95 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/182 variables, 11/21 constraints. Problems are: Problem set: 0 solved, 518 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/182 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 518 unsolved
At refinement iteration 4 (OVERLAPS) 515/697 variables, 182/203 constraints. Problems are: Problem set: 0 solved, 518 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/697 variables, 67/270 constraints. Problems are: Problem set: 0 solved, 518 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/697 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 518 unsolved
At refinement iteration 7 (OVERLAPS) 0/697 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 518 unsolved
No progress, stopping.
After SMT solving in domain Real declared 697/697 variables, and 270 constraints, problems are : Problem set: 0 solved, 518 unsolved in 21651 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 182/182 constraints, ReadFeed: 67/67 constraints, PredecessorRefiner: 518/518 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 518 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/181 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 518 unsolved
At refinement iteration 1 (OVERLAPS) 1/182 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 518 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/182 variables, 11/21 constraints. Problems are: Problem set: 0 solved, 518 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/182 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 518 unsolved
At refinement iteration 4 (OVERLAPS) 515/697 variables, 182/203 constraints. Problems are: Problem set: 0 solved, 518 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/697 variables, 67/270 constraints. Problems are: Problem set: 0 solved, 518 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/697 variables, 518/788 constraints. Problems are: Problem set: 0 solved, 518 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/697 variables, 0/788 constraints. Problems are: Problem set: 0 solved, 518 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 697/697 variables, and 788 constraints, problems are : Problem set: 0 solved, 518 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 182/182 constraints, ReadFeed: 67/67 constraints, PredecessorRefiner: 518/518 constraints, Known Traps: 11/11 constraints]
After SMT, in 52451ms problems are : Problem set: 0 solved, 518 unsolved
Search for dead transitions found 0 dead transitions in 52458ms
Starting structural reductions in REACHABILITY mode, iteration 1 : 182/182 places, 526/529 transitions.
Applied a total of 0 rules in 9 ms. Remains 182 /182 variables (removed 0) and now considering 526/526 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 53047 ms. Remains : 182/182 places, 526/529 transitions.
RANDOM walk for 40000 steps (1275 resets) in 152 ms. (261 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (253 resets) in 83 ms. (476 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (261 resets) in 52 ms. (754 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (250 resets) in 60 ms. (655 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (279 resets) in 51 ms. (769 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (272 resets) in 47 ms. (833 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 433828 steps, run timeout after 3001 ms. (steps per millisecond=144 ) properties seen :0 out of 5
Probabilistic random walk after 433828 steps, saw 142977 distinct states, run finished after 3001 ms. (steps per millisecond=144 ) properties seen :0
[2024-06-03 00:21:42] [INFO ] Flow matrix only has 515 transitions (discarded 11 similar events)
[2024-06-03 00:21:42] [INFO ] Invariant cache hit.
[2024-06-03 00:21:42] [INFO ] State equation strengthened by 67 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 62/69 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/69 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 101/170 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-03 00:21:42] [INFO ] Deduced a trap composed of 46 places in 91 ms of which 1 ms to minimize.
[2024-06-03 00:21:43] [INFO ] Deduced a trap composed of 37 places in 105 ms of which 1 ms to minimize.
[2024-06-03 00:21:43] [INFO ] Deduced a trap composed of 35 places in 96 ms of which 2 ms to minimize.
[2024-06-03 00:21:43] [INFO ] Deduced a trap composed of 26 places in 88 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/170 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/170 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 515/685 variables, 170/184 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/685 variables, 67/251 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/685 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 5 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 12/697 variables, 12/263 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/697 variables, 0/263 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 0/697 variables, 0/263 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 697/697 variables, and 263 constraints, problems are : Problem set: 0 solved, 5 unsolved in 859 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 182/182 constraints, ReadFeed: 67/67 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 62/69 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/69 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 101/170 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/170 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-03 00:21:43] [INFO ] Deduced a trap composed of 35 places in 91 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/170 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/170 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 515/685 variables, 170/185 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/685 variables, 67/252 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/685 variables, 5/257 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/685 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 12/697 variables, 12/269 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/697 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 0/697 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 697/697 variables, and 269 constraints, problems are : Problem set: 0 solved, 5 unsolved in 650 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 182/182 constraints, ReadFeed: 67/67 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 5/5 constraints]
After SMT, in 1520ms problems are : Problem set: 0 solved, 5 unsolved
Parikh walk visited 0 properties in 1126 ms.
Support contains 7 out of 182 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 182/182 places, 526/526 transitions.
Applied a total of 0 rules in 7 ms. Remains 182 /182 variables (removed 0) and now considering 526/526 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 182/182 places, 526/526 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 182/182 places, 526/526 transitions.
Applied a total of 0 rules in 7 ms. Remains 182 /182 variables (removed 0) and now considering 526/526 (removed 0) transitions.
[2024-06-03 00:21:45] [INFO ] Flow matrix only has 515 transitions (discarded 11 similar events)
[2024-06-03 00:21:45] [INFO ] Invariant cache hit.
[2024-06-03 00:21:45] [INFO ] Implicit Places using invariants in 95 ms returned []
[2024-06-03 00:21:45] [INFO ] Flow matrix only has 515 transitions (discarded 11 similar events)
[2024-06-03 00:21:45] [INFO ] Invariant cache hit.
[2024-06-03 00:21:45] [INFO ] State equation strengthened by 67 read => feed constraints.
[2024-06-03 00:21:45] [INFO ] Implicit Places using invariants and state equation in 425 ms returned []
Implicit Place search using SMT with State Equation took 522 ms to find 0 implicit places.
[2024-06-03 00:21:46] [INFO ] Redundant transitions in 5 ms returned []
Running 518 sub problems to find dead transitions.
[2024-06-03 00:21:46] [INFO ] Flow matrix only has 515 transitions (discarded 11 similar events)
[2024-06-03 00:21:46] [INFO ] Invariant cache hit.
[2024-06-03 00:21:46] [INFO ] State equation strengthened by 67 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/181 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 518 unsolved
At refinement iteration 1 (OVERLAPS) 1/182 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 518 unsolved
[2024-06-03 00:21:49] [INFO ] Deduced a trap composed of 37 places in 42 ms of which 1 ms to minimize.
[2024-06-03 00:21:49] [INFO ] Deduced a trap composed of 46 places in 38 ms of which 1 ms to minimize.
[2024-06-03 00:21:49] [INFO ] Deduced a trap composed of 29 places in 92 ms of which 1 ms to minimize.
[2024-06-03 00:21:49] [INFO ] Deduced a trap composed of 30 places in 84 ms of which 2 ms to minimize.
[2024-06-03 00:21:50] [INFO ] Deduced a trap composed of 26 places in 88 ms of which 1 ms to minimize.
[2024-06-03 00:21:50] [INFO ] Deduced a trap composed of 35 places in 39 ms of which 1 ms to minimize.
[2024-06-03 00:21:50] [INFO ] Deduced a trap composed of 35 places in 36 ms of which 0 ms to minimize.
[2024-06-03 00:21:50] [INFO ] Deduced a trap composed of 99 places in 84 ms of which 1 ms to minimize.
[2024-06-03 00:21:50] [INFO ] Deduced a trap composed of 100 places in 78 ms of which 1 ms to minimize.
[2024-06-03 00:21:51] [INFO ] Deduced a trap composed of 135 places in 91 ms of which 1 ms to minimize.
[2024-06-03 00:21:52] [INFO ] Deduced a trap composed of 19 places in 95 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/182 variables, 11/21 constraints. Problems are: Problem set: 0 solved, 518 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/182 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 518 unsolved
At refinement iteration 4 (OVERLAPS) 515/697 variables, 182/203 constraints. Problems are: Problem set: 0 solved, 518 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/697 variables, 67/270 constraints. Problems are: Problem set: 0 solved, 518 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/697 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 518 unsolved
At refinement iteration 7 (OVERLAPS) 0/697 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 518 unsolved
No progress, stopping.
After SMT solving in domain Real declared 697/697 variables, and 270 constraints, problems are : Problem set: 0 solved, 518 unsolved in 21392 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 182/182 constraints, ReadFeed: 67/67 constraints, PredecessorRefiner: 518/518 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 518 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/181 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 518 unsolved
At refinement iteration 1 (OVERLAPS) 1/182 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 518 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/182 variables, 11/21 constraints. Problems are: Problem set: 0 solved, 518 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/182 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 518 unsolved
At refinement iteration 4 (OVERLAPS) 515/697 variables, 182/203 constraints. Problems are: Problem set: 0 solved, 518 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/697 variables, 67/270 constraints. Problems are: Problem set: 0 solved, 518 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/697 variables, 518/788 constraints. Problems are: Problem set: 0 solved, 518 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/697 variables, 0/788 constraints. Problems are: Problem set: 0 solved, 518 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 697/697 variables, and 788 constraints, problems are : Problem set: 0 solved, 518 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 182/182 constraints, ReadFeed: 67/67 constraints, PredecessorRefiner: 518/518 constraints, Known Traps: 11/11 constraints]
After SMT, in 52032ms problems are : Problem set: 0 solved, 518 unsolved
Search for dead transitions found 0 dead transitions in 52038ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 52578 ms. Remains : 182/182 places, 526/526 transitions.
FORMULA FireWire-PT-20-LTLFireability-03 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 13 simplifications.
Computed a total of 107 stabilizing places and 149 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' '!(G((X((X((F(p0) U p0)) U p1)) U p0)))'
Support contains 4 out of 411 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 411/411 places, 688/688 transitions.
Graph (trivial) has 300 edges and 411 vertex of which 11 / 411 are part of one of the 3 SCC in 1 ms
Free SCC test removed 8 places
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 61 transitions
Trivial Post-agglo rules discarded 61 transitions
Performed 61 trivial Post agglomeration. Transition count delta: 61
Iterating post reduction 0 with 61 rules applied. Total rules applied 62 place count 402 transition count 617
Reduce places removed 61 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 65 rules applied. Total rules applied 127 place count 341 transition count 613
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 128 place count 340 transition count 613
Performed 34 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 34 Pre rules applied. Total rules applied 128 place count 340 transition count 579
Deduced a syphon composed of 34 places in 1 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 3 with 68 rules applied. Total rules applied 196 place count 306 transition count 579
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 205 place count 297 transition count 566
Iterating global reduction 3 with 9 rules applied. Total rules applied 214 place count 297 transition count 566
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 215 place count 297 transition count 565
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 4 Pre rules applied. Total rules applied 215 place count 297 transition count 561
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 223 place count 293 transition count 561
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 225 place count 291 transition count 556
Iterating global reduction 4 with 2 rules applied. Total rules applied 227 place count 291 transition count 556
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 228 place count 290 transition count 554
Iterating global reduction 4 with 1 rules applied. Total rules applied 229 place count 290 transition count 554
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 230 place count 289 transition count 552
Iterating global reduction 4 with 1 rules applied. Total rules applied 231 place count 289 transition count 552
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 232 place count 288 transition count 550
Iterating global reduction 4 with 1 rules applied. Total rules applied 233 place count 288 transition count 550
Performed 38 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 38 places in 0 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 4 with 76 rules applied. Total rules applied 309 place count 250 transition count 511
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 310 place count 249 transition count 509
Iterating global reduction 4 with 1 rules applied. Total rules applied 311 place count 249 transition count 509
Performed 45 Post agglomeration using F-continuation condition with reduction of 9 identical transitions.
Deduced a syphon composed of 45 places in 1 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 4 with 90 rules applied. Total rules applied 401 place count 204 transition count 608
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 404 place count 204 transition count 605
Applied a total of 404 rules in 79 ms. Remains 204 /411 variables (removed 207) and now considering 605/688 (removed 83) transitions.
[2024-06-03 00:22:38] [INFO ] Flow matrix only has 579 transitions (discarded 26 similar events)
// Phase 1: matrix 579 rows 204 cols
[2024-06-03 00:22:38] [INFO ] Computed 10 invariants in 2 ms
[2024-06-03 00:22:38] [INFO ] Implicit Places using invariants in 109 ms returned []
[2024-06-03 00:22:38] [INFO ] Flow matrix only has 579 transitions (discarded 26 similar events)
[2024-06-03 00:22:38] [INFO ] Invariant cache hit.
[2024-06-03 00:22:38] [INFO ] State equation strengthened by 12 read => feed constraints.
[2024-06-03 00:22:39] [INFO ] Implicit Places using invariants and state equation in 417 ms returned []
Implicit Place search using SMT with State Equation took 530 ms to find 0 implicit places.
[2024-06-03 00:22:39] [INFO ] Redundant transitions in 8 ms returned []
Running 596 sub problems to find dead transitions.
[2024-06-03 00:22:39] [INFO ] Flow matrix only has 579 transitions (discarded 26 similar events)
[2024-06-03 00:22:39] [INFO ] Invariant cache hit.
[2024-06-03 00:22:39] [INFO ] State equation strengthened by 12 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/203 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 596 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/203 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 596 unsolved
At refinement iteration 2 (OVERLAPS) 1/204 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 596 unsolved
[2024-06-03 00:22:44] [INFO ] Deduced a trap composed of 67 places in 109 ms of which 2 ms to minimize.
[2024-06-03 00:22:44] [INFO ] Deduced a trap composed of 34 places in 99 ms of which 1 ms to minimize.
[2024-06-03 00:22:45] [INFO ] Deduced a trap composed of 34 places in 105 ms of which 1 ms to minimize.
[2024-06-03 00:22:45] [INFO ] Deduced a trap composed of 30 places in 108 ms of which 1 ms to minimize.
[2024-06-03 00:22:45] [INFO ] Deduced a trap composed of 49 places in 42 ms of which 0 ms to minimize.
[2024-06-03 00:22:46] [INFO ] Deduced a trap composed of 134 places in 92 ms of which 1 ms to minimize.
[2024-06-03 00:22:46] [INFO ] Deduced a trap composed of 41 places in 38 ms of which 0 ms to minimize.
[2024-06-03 00:22:46] [INFO ] Deduced a trap composed of 26 places in 110 ms of which 1 ms to minimize.
[2024-06-03 00:22:46] [INFO ] Deduced a trap composed of 125 places in 107 ms of which 1 ms to minimize.
[2024-06-03 00:22:46] [INFO ] Deduced a trap composed of 125 places in 101 ms of which 1 ms to minimize.
[2024-06-03 00:22:46] [INFO ] Deduced a trap composed of 140 places in 106 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/204 variables, 11/21 constraints. Problems are: Problem set: 0 solved, 596 unsolved
[2024-06-03 00:22:51] [INFO ] Deduced a trap composed of 39 places in 110 ms of which 2 ms to minimize.
[2024-06-03 00:22:51] [INFO ] Deduced a trap composed of 134 places in 103 ms of which 2 ms to minimize.
[2024-06-03 00:22:52] [INFO ] Deduced a trap composed of 146 places in 96 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/204 variables, 3/24 constraints. Problems are: Problem set: 0 solved, 596 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/204 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 596 unsolved
At refinement iteration 6 (OVERLAPS) 578/782 variables, 204/228 constraints. Problems are: Problem set: 0 solved, 596 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/782 variables, 12/240 constraints. Problems are: Problem set: 0 solved, 596 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/782 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 596 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 782/783 variables, and 240 constraints, problems are : Problem set: 0 solved, 596 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 204/204 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 596/596 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 596 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/203 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 596 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/203 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 596 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/203 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 596 unsolved
At refinement iteration 3 (OVERLAPS) 1/204 variables, 9/19 constraints. Problems are: Problem set: 0 solved, 596 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/204 variables, 5/24 constraints. Problems are: Problem set: 0 solved, 596 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/204 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 596 unsolved
At refinement iteration 6 (OVERLAPS) 578/782 variables, 204/228 constraints. Problems are: Problem set: 0 solved, 596 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/782 variables, 12/240 constraints. Problems are: Problem set: 0 solved, 596 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/782 variables, 596/836 constraints. Problems are: Problem set: 0 solved, 596 unsolved
[2024-06-03 00:23:24] [INFO ] Deduced a trap composed of 40 places in 55 ms of which 0 ms to minimize.
[2024-06-03 00:23:29] [INFO ] Deduced a trap composed of 40 places in 49 ms of which 1 ms to minimize.
[2024-06-03 00:23:30] [INFO ] Deduced a trap composed of 26 places in 122 ms of which 1 ms to minimize.
[2024-06-03 00:23:31] [INFO ] Deduced a trap composed of 59 places in 102 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 782/783 variables, and 840 constraints, problems are : Problem set: 0 solved, 596 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 204/204 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 596/596 constraints, Known Traps: 18/18 constraints]
After SMT, in 60708ms problems are : Problem set: 0 solved, 596 unsolved
Search for dead transitions found 0 dead transitions in 60713ms
Starting structural reductions in SI_LTL mode, iteration 1 : 204/411 places, 605/688 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61342 ms. Remains : 204/411 places, 605/688 transitions.
Stuttering acceptance computed with spot in 300 ms :[(NOT p0), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : FireWire-PT-20-LTLFireability-00
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA FireWire-PT-20-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-20-LTLFireability-00 finished in 61713 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0||G(F(p1))))))'
Support contains 3 out of 411 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 411/411 places, 688/688 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 398 transition count 672
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 398 transition count 672
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 32 place count 392 transition count 660
Iterating global reduction 0 with 6 rules applied. Total rules applied 38 place count 392 transition count 660
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 41 place count 389 transition count 655
Iterating global reduction 0 with 3 rules applied. Total rules applied 44 place count 389 transition count 655
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 46 place count 387 transition count 650
Iterating global reduction 0 with 2 rules applied. Total rules applied 48 place count 387 transition count 650
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 50 place count 385 transition count 646
Iterating global reduction 0 with 2 rules applied. Total rules applied 52 place count 385 transition count 646
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 54 place count 383 transition count 642
Iterating global reduction 0 with 2 rules applied. Total rules applied 56 place count 383 transition count 642
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 57 place count 382 transition count 640
Iterating global reduction 0 with 1 rules applied. Total rules applied 58 place count 382 transition count 640
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 59 place count 381 transition count 638
Iterating global reduction 0 with 1 rules applied. Total rules applied 60 place count 381 transition count 638
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 61 place count 380 transition count 636
Iterating global reduction 0 with 1 rules applied. Total rules applied 62 place count 380 transition count 636
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 63 place count 379 transition count 635
Iterating global reduction 0 with 1 rules applied. Total rules applied 64 place count 379 transition count 635
Applied a total of 64 rules in 43 ms. Remains 379 /411 variables (removed 32) and now considering 635/688 (removed 53) transitions.
// Phase 1: matrix 635 rows 379 cols
[2024-06-03 00:23:40] [INFO ] Computed 10 invariants in 3 ms
[2024-06-03 00:23:40] [INFO ] Implicit Places using invariants in 193 ms returned []
[2024-06-03 00:23:40] [INFO ] Invariant cache hit.
[2024-06-03 00:23:40] [INFO ] Implicit Places using invariants and state equation in 425 ms returned []
Implicit Place search using SMT with State Equation took 621 ms to find 0 implicit places.
Running 634 sub problems to find dead transitions.
[2024-06-03 00:23:40] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/378 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 634 unsolved
At refinement iteration 1 (OVERLAPS) 1/379 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 634 unsolved
[2024-06-03 00:23:47] [INFO ] Deduced a trap composed of 218 places in 127 ms of which 3 ms to minimize.
[2024-06-03 00:23:48] [INFO ] Deduced a trap composed of 77 places in 47 ms of which 1 ms to minimize.
[2024-06-03 00:23:48] [INFO ] Deduced a trap composed of 76 places in 48 ms of which 1 ms to minimize.
[2024-06-03 00:23:49] [INFO ] Deduced a trap composed of 78 places in 53 ms of which 1 ms to minimize.
[2024-06-03 00:23:49] [INFO ] Deduced a trap composed of 77 places in 47 ms of which 3 ms to minimize.
[2024-06-03 00:23:49] [INFO ] Deduced a trap composed of 78 places in 44 ms of which 1 ms to minimize.
[2024-06-03 00:23:49] [INFO ] Deduced a trap composed of 77 places in 43 ms of which 1 ms to minimize.
[2024-06-03 00:23:50] [INFO ] Deduced a trap composed of 44 places in 103 ms of which 2 ms to minimize.
[2024-06-03 00:23:50] [INFO ] Deduced a trap composed of 57 places in 114 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/379 variables, 9/19 constraints. Problems are: Problem set: 0 solved, 634 unsolved
[2024-06-03 00:23:54] [INFO ] Deduced a trap composed of 214 places in 122 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/379 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 634 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/379 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 634 unsolved
At refinement iteration 5 (OVERLAPS) 635/1014 variables, 379/399 constraints. Problems are: Problem set: 0 solved, 634 unsolved
[2024-06-03 00:24:10] [INFO ] Deduced a trap composed of 111 places in 134 ms of which 2 ms to minimize.
[2024-06-03 00:24:10] [INFO ] Deduced a trap composed of 42 places in 127 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1014/1014 variables, and 401 constraints, problems are : Problem set: 0 solved, 634 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 379/379 constraints, PredecessorRefiner: 634/634 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 634 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/378 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 634 unsolved
At refinement iteration 1 (OVERLAPS) 1/379 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 634 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/379 variables, 12/22 constraints. Problems are: Problem set: 0 solved, 634 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/379 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 634 unsolved
At refinement iteration 4 (OVERLAPS) 635/1014 variables, 379/401 constraints. Problems are: Problem set: 0 solved, 634 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1014 variables, 634/1035 constraints. Problems are: Problem set: 0 solved, 634 unsolved
[2024-06-03 00:24:24] [INFO ] Deduced a trap composed of 23 places in 143 ms of which 2 ms to minimize.
[2024-06-03 00:24:25] [INFO ] Deduced a trap composed of 122 places in 130 ms of which 3 ms to minimize.
[2024-06-03 00:24:25] [INFO ] Deduced a trap composed of 239 places in 135 ms of which 2 ms to minimize.
[2024-06-03 00:24:28] [INFO ] Deduced a trap composed of 232 places in 151 ms of which 3 ms to minimize.
[2024-06-03 00:24:28] [INFO ] Deduced a trap composed of 229 places in 140 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1014/1014 variables, and 1040 constraints, problems are : Problem set: 0 solved, 634 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 379/379 constraints, PredecessorRefiner: 634/634 constraints, Known Traps: 17/17 constraints]
After SMT, in 60270ms problems are : Problem set: 0 solved, 634 unsolved
Search for dead transitions found 0 dead transitions in 60277ms
Starting structural reductions in LTL mode, iteration 1 : 379/411 places, 635/688 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60946 ms. Remains : 379/411 places, 635/688 transitions.
Stuttering acceptance computed with spot in 130 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : FireWire-PT-20-LTLFireability-01
Stuttering criterion allowed to conclude after 121 steps with 0 reset in 5 ms.
FORMULA FireWire-PT-20-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-20-LTLFireability-01 finished in 61096 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 411 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 411/411 places, 688/688 transitions.
Graph (trivial) has 301 edges and 411 vertex of which 11 / 411 are part of one of the 3 SCC in 1 ms
Free SCC test removed 8 places
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 61 transitions
Trivial Post-agglo rules discarded 61 transitions
Performed 61 trivial Post agglomeration. Transition count delta: 61
Iterating post reduction 0 with 61 rules applied. Total rules applied 62 place count 402 transition count 617
Reduce places removed 61 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 65 rules applied. Total rules applied 127 place count 341 transition count 613
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 128 place count 340 transition count 613
Performed 35 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 35 Pre rules applied. Total rules applied 128 place count 340 transition count 578
Deduced a syphon composed of 35 places in 1 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 3 with 70 rules applied. Total rules applied 198 place count 305 transition count 578
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 207 place count 296 transition count 564
Iterating global reduction 3 with 9 rules applied. Total rules applied 216 place count 296 transition count 564
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 217 place count 296 transition count 563
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 217 place count 296 transition count 560
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 223 place count 293 transition count 560
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 226 place count 290 transition count 552
Iterating global reduction 4 with 3 rules applied. Total rules applied 229 place count 290 transition count 552
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 231 place count 288 transition count 548
Iterating global reduction 4 with 2 rules applied. Total rules applied 233 place count 288 transition count 548
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 235 place count 286 transition count 543
Iterating global reduction 4 with 2 rules applied. Total rules applied 237 place count 286 transition count 543
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 239 place count 284 transition count 539
Iterating global reduction 4 with 2 rules applied. Total rules applied 241 place count 284 transition count 539
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 242 place count 283 transition count 536
Iterating global reduction 4 with 1 rules applied. Total rules applied 243 place count 283 transition count 536
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 244 place count 282 transition count 534
Iterating global reduction 4 with 1 rules applied. Total rules applied 245 place count 282 transition count 534
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 246 place count 281 transition count 532
Iterating global reduction 4 with 1 rules applied. Total rules applied 247 place count 281 transition count 532
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 248 place count 280 transition count 530
Iterating global reduction 4 with 1 rules applied. Total rules applied 249 place count 280 transition count 530
Performed 39 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 39 places in 0 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 4 with 78 rules applied. Total rules applied 327 place count 241 transition count 490
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 328 place count 240 transition count 488
Iterating global reduction 4 with 1 rules applied. Total rules applied 329 place count 240 transition count 488
Performed 45 Post agglomeration using F-continuation condition with reduction of 9 identical transitions.
Deduced a syphon composed of 45 places in 0 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 4 with 90 rules applied. Total rules applied 419 place count 195 transition count 587
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 422 place count 195 transition count 584
Applied a total of 422 rules in 123 ms. Remains 195 /411 variables (removed 216) and now considering 584/688 (removed 104) transitions.
[2024-06-03 00:24:41] [INFO ] Flow matrix only has 555 transitions (discarded 29 similar events)
// Phase 1: matrix 555 rows 195 cols
[2024-06-03 00:24:41] [INFO ] Computed 10 invariants in 7 ms
[2024-06-03 00:24:41] [INFO ] Implicit Places using invariants in 199 ms returned []
[2024-06-03 00:24:41] [INFO ] Flow matrix only has 555 transitions (discarded 29 similar events)
[2024-06-03 00:24:41] [INFO ] Invariant cache hit.
[2024-06-03 00:24:41] [INFO ] State equation strengthened by 12 read => feed constraints.
[2024-06-03 00:24:42] [INFO ] Implicit Places using invariants and state equation in 476 ms returned []
Implicit Place search using SMT with State Equation took 678 ms to find 0 implicit places.
[2024-06-03 00:24:42] [INFO ] Redundant transitions in 7 ms returned []
Running 575 sub problems to find dead transitions.
[2024-06-03 00:24:42] [INFO ] Flow matrix only has 555 transitions (discarded 29 similar events)
[2024-06-03 00:24:42] [INFO ] Invariant cache hit.
[2024-06-03 00:24:42] [INFO ] State equation strengthened by 12 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/194 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 575 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/194 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 575 unsolved
At refinement iteration 2 (OVERLAPS) 1/195 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 575 unsolved
[2024-06-03 00:24:47] [INFO ] Deduced a trap composed of 30 places in 102 ms of which 2 ms to minimize.
[2024-06-03 00:24:47] [INFO ] Deduced a trap composed of 34 places in 101 ms of which 1 ms to minimize.
[2024-06-03 00:24:48] [INFO ] Deduced a trap composed of 40 places in 34 ms of which 1 ms to minimize.
[2024-06-03 00:24:48] [INFO ] Deduced a trap composed of 26 places in 100 ms of which 2 ms to minimize.
[2024-06-03 00:24:48] [INFO ] Deduced a trap composed of 26 places in 98 ms of which 2 ms to minimize.
[2024-06-03 00:24:48] [INFO ] Deduced a trap composed of 26 places in 96 ms of which 1 ms to minimize.
[2024-06-03 00:24:48] [INFO ] Deduced a trap composed of 62 places in 98 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/195 variables, 7/17 constraints. Problems are: Problem set: 0 solved, 575 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/195 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 575 unsolved
At refinement iteration 5 (OVERLAPS) 554/749 variables, 195/212 constraints. Problems are: Problem set: 0 solved, 575 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/749 variables, 12/224 constraints. Problems are: Problem set: 0 solved, 575 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/749 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 575 unsolved
At refinement iteration 8 (OVERLAPS) 0/749 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 575 unsolved
No progress, stopping.
After SMT solving in domain Real declared 749/750 variables, and 224 constraints, problems are : Problem set: 0 solved, 575 unsolved in 24438 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 195/195 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 575/575 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 575 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/194 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 575 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/194 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 575 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/194 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 575 unsolved
At refinement iteration 3 (OVERLAPS) 1/195 variables, 9/13 constraints. Problems are: Problem set: 0 solved, 575 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/195 variables, 4/17 constraints. Problems are: Problem set: 0 solved, 575 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/195 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 575 unsolved
At refinement iteration 6 (OVERLAPS) 554/749 variables, 195/212 constraints. Problems are: Problem set: 0 solved, 575 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/749 variables, 12/224 constraints. Problems are: Problem set: 0 solved, 575 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/749 variables, 575/799 constraints. Problems are: Problem set: 0 solved, 575 unsolved
[2024-06-03 00:25:23] [INFO ] Deduced a trap composed of 132 places in 100 ms of which 1 ms to minimize.
[2024-06-03 00:25:23] [INFO ] Deduced a trap composed of 138 places in 98 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/749 variables, 2/801 constraints. Problems are: Problem set: 0 solved, 575 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 749/750 variables, and 801 constraints, problems are : Problem set: 0 solved, 575 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 195/195 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 575/575 constraints, Known Traps: 9/9 constraints]
After SMT, in 55101ms problems are : Problem set: 0 solved, 575 unsolved
Search for dead transitions found 0 dead transitions in 55106ms
Starting structural reductions in SI_LTL mode, iteration 1 : 195/411 places, 584/688 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 55925 ms. Remains : 195/411 places, 584/688 transitions.
Stuttering acceptance computed with spot in 50 ms :[(NOT p0)]
Running random walk in product with property : FireWire-PT-20-LTLFireability-02
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA FireWire-PT-20-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-20-LTLFireability-02 finished in 55992 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||G(p1)))'
Support contains 2 out of 411 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 411/411 places, 688/688 transitions.
Graph (trivial) has 299 edges and 411 vertex of which 11 / 411 are part of one of the 3 SCC in 4 ms
Free SCC test removed 8 places
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 60 transitions
Trivial Post-agglo rules discarded 60 transitions
Performed 60 trivial Post agglomeration. Transition count delta: 60
Iterating post reduction 0 with 60 rules applied. Total rules applied 61 place count 402 transition count 618
Reduce places removed 60 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 64 rules applied. Total rules applied 125 place count 342 transition count 614
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 126 place count 341 transition count 614
Performed 35 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 35 Pre rules applied. Total rules applied 126 place count 341 transition count 579
Deduced a syphon composed of 35 places in 1 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 3 with 70 rules applied. Total rules applied 196 place count 306 transition count 579
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 206 place count 296 transition count 564
Iterating global reduction 3 with 10 rules applied. Total rules applied 216 place count 296 transition count 564
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 217 place count 296 transition count 563
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 4 Pre rules applied. Total rules applied 217 place count 296 transition count 559
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 225 place count 292 transition count 559
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 228 place count 289 transition count 551
Iterating global reduction 4 with 3 rules applied. Total rules applied 231 place count 289 transition count 551
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 233 place count 287 transition count 547
Iterating global reduction 4 with 2 rules applied. Total rules applied 235 place count 287 transition count 547
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 237 place count 285 transition count 542
Iterating global reduction 4 with 2 rules applied. Total rules applied 239 place count 285 transition count 542
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 241 place count 283 transition count 538
Iterating global reduction 4 with 2 rules applied. Total rules applied 243 place count 283 transition count 538
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 244 place count 282 transition count 535
Iterating global reduction 4 with 1 rules applied. Total rules applied 245 place count 282 transition count 535
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 246 place count 281 transition count 533
Iterating global reduction 4 with 1 rules applied. Total rules applied 247 place count 281 transition count 533
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 248 place count 280 transition count 531
Iterating global reduction 4 with 1 rules applied. Total rules applied 249 place count 280 transition count 531
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 250 place count 279 transition count 529
Iterating global reduction 4 with 1 rules applied. Total rules applied 251 place count 279 transition count 529
Performed 37 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 37 places in 1 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 4 with 74 rules applied. Total rules applied 325 place count 242 transition count 491
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 326 place count 241 transition count 489
Iterating global reduction 4 with 1 rules applied. Total rules applied 327 place count 241 transition count 489
Performed 44 Post agglomeration using F-continuation condition with reduction of 9 identical transitions.
Deduced a syphon composed of 44 places in 0 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 4 with 88 rules applied. Total rules applied 415 place count 197 transition count 587
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 418 place count 197 transition count 584
Applied a total of 418 rules in 92 ms. Remains 197 /411 variables (removed 214) and now considering 584/688 (removed 104) transitions.
[2024-06-03 00:25:37] [INFO ] Flow matrix only has 555 transitions (discarded 29 similar events)
// Phase 1: matrix 555 rows 197 cols
[2024-06-03 00:25:37] [INFO ] Computed 10 invariants in 6 ms
[2024-06-03 00:25:37] [INFO ] Implicit Places using invariants in 109 ms returned []
[2024-06-03 00:25:37] [INFO ] Flow matrix only has 555 transitions (discarded 29 similar events)
[2024-06-03 00:25:37] [INFO ] Invariant cache hit.
[2024-06-03 00:25:37] [INFO ] State equation strengthened by 12 read => feed constraints.
[2024-06-03 00:25:37] [INFO ] Implicit Places using invariants and state equation in 422 ms returned []
Implicit Place search using SMT with State Equation took 533 ms to find 0 implicit places.
[2024-06-03 00:25:37] [INFO ] Redundant transitions in 4 ms returned []
Running 575 sub problems to find dead transitions.
[2024-06-03 00:25:37] [INFO ] Flow matrix only has 555 transitions (discarded 29 similar events)
[2024-06-03 00:25:37] [INFO ] Invariant cache hit.
[2024-06-03 00:25:37] [INFO ] State equation strengthened by 12 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/196 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 575 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/196 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 575 unsolved
At refinement iteration 2 (OVERLAPS) 1/197 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 575 unsolved
[2024-06-03 00:25:42] [INFO ] Deduced a trap composed of 31 places in 104 ms of which 1 ms to minimize.
[2024-06-03 00:25:43] [INFO ] Deduced a trap composed of 63 places in 107 ms of which 1 ms to minimize.
[2024-06-03 00:25:43] [INFO ] Deduced a trap composed of 34 places in 101 ms of which 2 ms to minimize.
[2024-06-03 00:25:43] [INFO ] Deduced a trap composed of 35 places in 94 ms of which 1 ms to minimize.
[2024-06-03 00:25:44] [INFO ] Deduced a trap composed of 37 places in 97 ms of which 2 ms to minimize.
[2024-06-03 00:25:44] [INFO ] Deduced a trap composed of 141 places in 92 ms of which 2 ms to minimize.
[2024-06-03 00:25:44] [INFO ] Deduced a trap composed of 138 places in 85 ms of which 2 ms to minimize.
[2024-06-03 00:25:44] [INFO ] Deduced a trap composed of 40 places in 114 ms of which 1 ms to minimize.
[2024-06-03 00:25:44] [INFO ] Deduced a trap composed of 42 places in 90 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/197 variables, 9/19 constraints. Problems are: Problem set: 0 solved, 575 unsolved
[2024-06-03 00:25:49] [INFO ] Deduced a trap composed of 33 places in 104 ms of which 1 ms to minimize.
[2024-06-03 00:25:49] [INFO ] Deduced a trap composed of 31 places in 95 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/197 variables, 2/21 constraints. Problems are: Problem set: 0 solved, 575 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/197 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 575 unsolved
At refinement iteration 6 (OVERLAPS) 554/751 variables, 197/218 constraints. Problems are: Problem set: 0 solved, 575 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/751 variables, 12/230 constraints. Problems are: Problem set: 0 solved, 575 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/751 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 575 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 9 (OVERLAPS) 0/751 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 575 unsolved
No progress, stopping.
After SMT solving in domain Real declared 751/752 variables, and 230 constraints, problems are : Problem set: 0 solved, 575 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 197/197 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 575/575 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 575 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/196 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 575 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/196 variables, 7/8 constraints. Problems are: Problem set: 0 solved, 575 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/196 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 575 unsolved
At refinement iteration 3 (OVERLAPS) 1/197 variables, 9/17 constraints. Problems are: Problem set: 0 solved, 575 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/197 variables, 4/21 constraints. Problems are: Problem set: 0 solved, 575 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/197 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 575 unsolved
At refinement iteration 6 (OVERLAPS) 554/751 variables, 197/218 constraints. Problems are: Problem set: 0 solved, 575 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/751 variables, 12/230 constraints. Problems are: Problem set: 0 solved, 575 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/751 variables, 575/805 constraints. Problems are: Problem set: 0 solved, 575 unsolved
[2024-06-03 00:26:22] [INFO ] Deduced a trap composed of 40 places in 47 ms of which 1 ms to minimize.
[2024-06-03 00:26:25] [INFO ] Deduced a trap composed of 27 places in 100 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/751 variables, 2/807 constraints. Problems are: Problem set: 0 solved, 575 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 751/752 variables, and 807 constraints, problems are : Problem set: 0 solved, 575 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 197/197 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 575/575 constraints, Known Traps: 13/13 constraints]
After SMT, in 60604ms problems are : Problem set: 0 solved, 575 unsolved
Search for dead transitions found 0 dead transitions in 60609ms
Starting structural reductions in SI_LTL mode, iteration 1 : 197/411 places, 584/688 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61249 ms. Remains : 197/411 places, 584/688 transitions.
Stuttering acceptance computed with spot in 142 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : FireWire-PT-20-LTLFireability-04
Product exploration explored 100000 steps with 1 reset in 142 ms.
Product exploration explored 100000 steps with 1 reset in 106 ms.
Computed a total of 31 stabilizing places and 56 stable transitions
Computed a total of 31 stabilizing places and 56 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 p1)), (X p1), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 (NOT p1)))), (X p0), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 p1))), (X (X p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 127 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter insensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 118 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0)]
RANDOM walk for 40000 steps (1455 resets) in 604 ms. (66 steps per ms) remains 1/6 properties
BEST_FIRST walk for 40004 steps (262 resets) in 106 ms. (373 steps per ms) remains 1/1 properties
[2024-06-03 00:26:39] [INFO ] Flow matrix only has 555 transitions (discarded 29 similar events)
[2024-06-03 00:26:39] [INFO ] Invariant cache hit.
[2024-06-03 00:26:39] [INFO ] State equation strengthened by 12 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 66/68 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/68 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 117/185 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-03 00:26:39] [INFO ] Deduced a trap composed of 30 places in 101 ms of which 1 ms to minimize.
[2024-06-03 00:26:39] [INFO ] Deduced a trap composed of 50 places in 104 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/185 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/185 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 554/739 variables, 185/197 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/739 variables, 12/209 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/739 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 12/751 variables, 12/221 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/751 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/751 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 751/752 variables, and 221 constraints, problems are : Problem set: 0 solved, 1 unsolved in 421 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 197/197 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 66/68 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/68 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 117/185 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/185 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/185 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 554/739 variables, 185/197 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/739 variables, 12/209 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/739 variables, 1/210 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/739 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 12/751 variables, 12/222 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/751 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/751 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 751/752 variables, and 222 constraints, problems are : Problem set: 0 solved, 1 unsolved in 204 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 197/197 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
After SMT, in 633ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 5 ms.
Support contains 2 out of 197 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 197/197 places, 584/584 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 197 transition count 581
Free-agglomeration rule applied 21 times.
Iterating global reduction 1 with 21 rules applied. Total rules applied 24 place count 197 transition count 560
Reduce places removed 21 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 30 rules applied. Total rules applied 54 place count 176 transition count 551
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 60 place count 170 transition count 545
Iterating global reduction 2 with 6 rules applied. Total rules applied 66 place count 170 transition count 545
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 75 place count 170 transition count 536
Drop transitions (Redundant composition of simpler transitions.) removed 27 transitions
Redundant transition composition rules discarded 27 transitions
Iterating global reduction 3 with 27 rules applied. Total rules applied 102 place count 170 transition count 509
Applied a total of 102 rules in 29 ms. Remains 170 /197 variables (removed 27) and now considering 509/584 (removed 75) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30 ms. Remains : 170/197 places, 509/584 transitions.
RANDOM walk for 40000 steps (1259 resets) in 107 ms. (370 steps per ms) remains 1/1 properties
BEST_FIRST walk for 36654 steps (236 resets) in 36 ms. (990 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 p1)), (X p1), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 (NOT p1)))), (X p0), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 p1))), (X (X p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0))]
False Knowledge obtained : [(F (NOT (OR (NOT p0) p1))), (F (NOT (OR p0 (NOT p1)))), (F (NOT p0)), (F (NOT (OR p0 p1))), (F (NOT p1)), (F (NOT (AND p0 p1)))]
Property proved to be false thanks to negative knowledge :(F (NOT (OR p0 p1)))
Knowledge based reduction with 13 factoid took 234 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA FireWire-PT-20-LTLFireability-04 FALSE TECHNIQUES KNOWLEDGE
Treatment of property FireWire-PT-20-LTLFireability-04 finished in 63112 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))||G(p1)) U p2)))'
Support contains 5 out of 411 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 411/411 places, 688/688 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 397 transition count 669
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 397 transition count 669
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 29 place count 397 transition count 668
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 34 place count 392 transition count 657
Iterating global reduction 1 with 5 rules applied. Total rules applied 39 place count 392 transition count 657
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 42 place count 389 transition count 652
Iterating global reduction 1 with 3 rules applied. Total rules applied 45 place count 389 transition count 652
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 47 place count 387 transition count 647
Iterating global reduction 1 with 2 rules applied. Total rules applied 49 place count 387 transition count 647
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 51 place count 385 transition count 643
Iterating global reduction 1 with 2 rules applied. Total rules applied 53 place count 385 transition count 643
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 55 place count 383 transition count 639
Iterating global reduction 1 with 2 rules applied. Total rules applied 57 place count 383 transition count 639
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 58 place count 382 transition count 637
Iterating global reduction 1 with 1 rules applied. Total rules applied 59 place count 382 transition count 637
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 60 place count 381 transition count 635
Iterating global reduction 1 with 1 rules applied. Total rules applied 61 place count 381 transition count 635
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 62 place count 380 transition count 633
Iterating global reduction 1 with 1 rules applied. Total rules applied 63 place count 380 transition count 633
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 64 place count 379 transition count 632
Iterating global reduction 1 with 1 rules applied. Total rules applied 65 place count 379 transition count 632
Applied a total of 65 rules in 46 ms. Remains 379 /411 variables (removed 32) and now considering 632/688 (removed 56) transitions.
// Phase 1: matrix 632 rows 379 cols
[2024-06-03 00:26:40] [INFO ] Computed 10 invariants in 6 ms
[2024-06-03 00:26:40] [INFO ] Implicit Places using invariants in 124 ms returned []
[2024-06-03 00:26:40] [INFO ] Invariant cache hit.
[2024-06-03 00:26:40] [INFO ] Implicit Places using invariants and state equation in 355 ms returned []
Implicit Place search using SMT with State Equation took 483 ms to find 0 implicit places.
Running 631 sub problems to find dead transitions.
[2024-06-03 00:26:40] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/378 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 631 unsolved
At refinement iteration 1 (OVERLAPS) 1/379 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 631 unsolved
[2024-06-03 00:26:48] [INFO ] Deduced a trap composed of 243 places in 141 ms of which 3 ms to minimize.
[2024-06-03 00:26:48] [INFO ] Deduced a trap composed of 114 places in 128 ms of which 2 ms to minimize.
[2024-06-03 00:26:48] [INFO ] Deduced a trap composed of 77 places in 53 ms of which 1 ms to minimize.
[2024-06-03 00:26:48] [INFO ] Deduced a trap composed of 76 places in 46 ms of which 1 ms to minimize.
[2024-06-03 00:26:49] [INFO ] Deduced a trap composed of 79 places in 51 ms of which 1 ms to minimize.
[2024-06-03 00:26:49] [INFO ] Deduced a trap composed of 77 places in 49 ms of which 1 ms to minimize.
[2024-06-03 00:26:50] [INFO ] Deduced a trap composed of 78 places in 50 ms of which 1 ms to minimize.
[2024-06-03 00:26:50] [INFO ] Deduced a trap composed of 43 places in 108 ms of which 2 ms to minimize.
[2024-06-03 00:26:51] [INFO ] Deduced a trap composed of 65 places in 134 ms of which 4 ms to minimize.
[2024-06-03 00:26:52] [INFO ] Deduced a trap composed of 77 places in 120 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/379 variables, 10/20 constraints. Problems are: Problem set: 0 solved, 631 unsolved
[2024-06-03 00:26:54] [INFO ] Deduced a trap composed of 227 places in 122 ms of which 2 ms to minimize.
[2024-06-03 00:26:54] [INFO ] Deduced a trap composed of 41 places in 135 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/379 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 631 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/379 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 631 unsolved
At refinement iteration 5 (OVERLAPS) 632/1011 variables, 379/401 constraints. Problems are: Problem set: 0 solved, 631 unsolved
[2024-06-03 00:27:10] [INFO ] Deduced a trap composed of 108 places in 113 ms of which 2 ms to minimize.
[2024-06-03 00:27:10] [INFO ] Deduced a trap composed of 71 places in 100 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1011/1011 variables, and 403 constraints, problems are : Problem set: 0 solved, 631 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 379/379 constraints, PredecessorRefiner: 631/631 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 631 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/378 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 631 unsolved
At refinement iteration 1 (OVERLAPS) 1/379 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 631 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/379 variables, 14/24 constraints. Problems are: Problem set: 0 solved, 631 unsolved
[2024-06-03 00:27:17] [INFO ] Deduced a trap composed of 63 places in 130 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/379 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 631 unsolved
[2024-06-03 00:27:20] [INFO ] Deduced a trap composed of 78 places in 46 ms of which 1 ms to minimize.
[2024-06-03 00:27:20] [INFO ] Deduced a trap composed of 91 places in 46 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/379 variables, 2/27 constraints. Problems are: Problem set: 0 solved, 631 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/379 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 631 unsolved
At refinement iteration 6 (OVERLAPS) 632/1011 variables, 379/406 constraints. Problems are: Problem set: 0 solved, 631 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1011 variables, 631/1037 constraints. Problems are: Problem set: 0 solved, 631 unsolved
[2024-06-03 00:27:36] [INFO ] Deduced a trap composed of 244 places in 153 ms of which 2 ms to minimize.
[2024-06-03 00:27:37] [INFO ] Deduced a trap composed of 24 places in 93 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1011/1011 variables, and 1039 constraints, problems are : Problem set: 0 solved, 631 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 379/379 constraints, PredecessorRefiner: 631/631 constraints, Known Traps: 19/19 constraints]
After SMT, in 60254ms problems are : Problem set: 0 solved, 631 unsolved
Search for dead transitions found 0 dead transitions in 60260ms
Starting structural reductions in LTL mode, iteration 1 : 379/411 places, 632/688 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60795 ms. Remains : 379/411 places, 632/688 transitions.
Stuttering acceptance computed with spot in 173 ms :[(NOT p2), (NOT p2), (NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : FireWire-PT-20-LTLFireability-05
Product exploration explored 100000 steps with 50000 reset in 160 ms.
Product exploration explored 100000 steps with 50000 reset in 220 ms.
Computed a total of 86 stabilizing places and 110 stable transitions
Computed a total of 86 stabilizing places and 110 stable transitions
Detected a total of 86/379 stabilizing places and 110/632 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p2 (NOT p1) (NOT p0)), (X (NOT (AND (NOT p2) p1))), (X (NOT (AND (NOT p2) (NOT p1)))), (X p2), (X (NOT p1)), (X (X (NOT p0))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p2)), (X (X (NOT p1))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 13 factoid took 18 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FireWire-PT-20-LTLFireability-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FireWire-PT-20-LTLFireability-05 finished in 61426 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((G(p0)||X(p1)))))'
Support contains 2 out of 411 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 411/411 places, 688/688 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 397 transition count 670
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 397 transition count 670
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 29 place count 397 transition count 669
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 35 place count 391 transition count 657
Iterating global reduction 1 with 6 rules applied. Total rules applied 41 place count 391 transition count 657
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 44 place count 388 transition count 652
Iterating global reduction 1 with 3 rules applied. Total rules applied 47 place count 388 transition count 652
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 49 place count 386 transition count 647
Iterating global reduction 1 with 2 rules applied. Total rules applied 51 place count 386 transition count 647
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 53 place count 384 transition count 643
Iterating global reduction 1 with 2 rules applied. Total rules applied 55 place count 384 transition count 643
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 57 place count 382 transition count 639
Iterating global reduction 1 with 2 rules applied. Total rules applied 59 place count 382 transition count 639
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 60 place count 381 transition count 637
Iterating global reduction 1 with 1 rules applied. Total rules applied 61 place count 381 transition count 637
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 62 place count 380 transition count 635
Iterating global reduction 1 with 1 rules applied. Total rules applied 63 place count 380 transition count 635
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 64 place count 379 transition count 633
Iterating global reduction 1 with 1 rules applied. Total rules applied 65 place count 379 transition count 633
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 66 place count 378 transition count 632
Iterating global reduction 1 with 1 rules applied. Total rules applied 67 place count 378 transition count 632
Applied a total of 67 rules in 37 ms. Remains 378 /411 variables (removed 33) and now considering 632/688 (removed 56) transitions.
// Phase 1: matrix 632 rows 378 cols
[2024-06-03 00:27:41] [INFO ] Computed 10 invariants in 3 ms
[2024-06-03 00:27:41] [INFO ] Implicit Places using invariants in 185 ms returned []
[2024-06-03 00:27:41] [INFO ] Invariant cache hit.
[2024-06-03 00:27:42] [INFO ] Implicit Places using invariants and state equation in 502 ms returned []
Implicit Place search using SMT with State Equation took 707 ms to find 0 implicit places.
Running 631 sub problems to find dead transitions.
[2024-06-03 00:27:42] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/377 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 631 unsolved
At refinement iteration 1 (OVERLAPS) 1/378 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 631 unsolved
[2024-06-03 00:27:49] [INFO ] Deduced a trap composed of 244 places in 128 ms of which 3 ms to minimize.
[2024-06-03 00:27:49] [INFO ] Deduced a trap composed of 252 places in 139 ms of which 2 ms to minimize.
[2024-06-03 00:27:50] [INFO ] Deduced a trap composed of 78 places in 65 ms of which 1 ms to minimize.
[2024-06-03 00:27:50] [INFO ] Deduced a trap composed of 77 places in 63 ms of which 1 ms to minimize.
[2024-06-03 00:27:51] [INFO ] Deduced a trap composed of 78 places in 62 ms of which 1 ms to minimize.
[2024-06-03 00:27:51] [INFO ] Deduced a trap composed of 77 places in 62 ms of which 1 ms to minimize.
[2024-06-03 00:27:52] [INFO ] Deduced a trap composed of 78 places in 54 ms of which 1 ms to minimize.
[2024-06-03 00:27:52] [INFO ] Deduced a trap composed of 43 places in 130 ms of which 2 ms to minimize.
[2024-06-03 00:27:53] [INFO ] Deduced a trap composed of 63 places in 152 ms of which 2 ms to minimize.
[2024-06-03 00:27:54] [INFO ] Deduced a trap composed of 77 places in 109 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/378 variables, 10/20 constraints. Problems are: Problem set: 0 solved, 631 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/378 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 631 unsolved
At refinement iteration 4 (OVERLAPS) 632/1010 variables, 378/398 constraints. Problems are: Problem set: 0 solved, 631 unsolved
[2024-06-03 00:28:06] [INFO ] Deduced a trap composed of 76 places in 128 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1010/1010 variables, and 399 constraints, problems are : Problem set: 0 solved, 631 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 378/378 constraints, PredecessorRefiner: 631/631 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 631 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/377 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 631 unsolved
At refinement iteration 1 (OVERLAPS) 1/378 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 631 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/378 variables, 11/21 constraints. Problems are: Problem set: 0 solved, 631 unsolved
[2024-06-03 00:28:16] [INFO ] Deduced a trap composed of 79 places in 50 ms of which 1 ms to minimize.
[2024-06-03 00:28:17] [INFO ] Deduced a trap composed of 79 places in 45 ms of which 1 ms to minimize.
[2024-06-03 00:28:17] [INFO ] Deduced a trap composed of 79 places in 46 ms of which 1 ms to minimize.
[2024-06-03 00:28:17] [INFO ] Deduced a trap composed of 92 places in 57 ms of which 1 ms to minimize.
[2024-06-03 00:28:18] [INFO ] Deduced a trap composed of 96 places in 42 ms of which 1 ms to minimize.
[2024-06-03 00:28:20] [INFO ] Deduced a trap composed of 56 places in 123 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/378 variables, 6/27 constraints. Problems are: Problem set: 0 solved, 631 unsolved
[2024-06-03 00:28:22] [INFO ] Deduced a trap composed of 96 places in 74 ms of which 3 ms to minimize.
[2024-06-03 00:28:22] [INFO ] Deduced a trap composed of 92 places in 45 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/378 variables, 2/29 constraints. Problems are: Problem set: 0 solved, 631 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/378 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 631 unsolved
At refinement iteration 6 (OVERLAPS) 632/1010 variables, 378/407 constraints. Problems are: Problem set: 0 solved, 631 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1010 variables, 631/1038 constraints. Problems are: Problem set: 0 solved, 631 unsolved
[2024-06-03 00:28:38] [INFO ] Deduced a trap composed of 125 places in 139 ms of which 3 ms to minimize.
[2024-06-03 00:28:42] [INFO ] Deduced a trap composed of 222 places in 148 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1010/1010 variables, and 1040 constraints, problems are : Problem set: 0 solved, 631 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 378/378 constraints, PredecessorRefiner: 631/631 constraints, Known Traps: 21/21 constraints]
After SMT, in 60276ms problems are : Problem set: 0 solved, 631 unsolved
Search for dead transitions found 0 dead transitions in 60281ms
Starting structural reductions in LTL mode, iteration 1 : 378/411 places, 632/688 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61028 ms. Remains : 378/411 places, 632/688 transitions.
Stuttering acceptance computed with spot in 205 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : FireWire-PT-20-LTLFireability-06
Product exploration explored 100000 steps with 5 reset in 110 ms.
Product exploration explored 100000 steps with 5 reset in 102 ms.
Computed a total of 84 stabilizing places and 108 stable transitions
Computed a total of 84 stabilizing places and 108 stable transitions
Detected a total of 84/378 stabilizing places and 108/632 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p1 p0), (X p0), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p1))), (X (X p1)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
Knowledge based reduction with 6 factoid took 504 ms. Reduced automaton from 6 states, 13 edges and 2 AP (stutter sensitive) to 6 states, 12 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 194 ms :[true, (NOT p1), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
RANDOM walk for 40000 steps (19 resets) in 201 ms. (198 steps per ms) remains 3/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 48 ms. (816 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40001 steps (32 resets) in 147 ms. (270 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40001 steps (29 resets) in 233 ms. (170 steps per ms) remains 3/3 properties
[2024-06-03 00:28:44] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 305/307 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/307 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 35/342 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/342 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 596/938 variables, 342/352 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/938 variables, 0/352 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 36/974 variables, 18/370 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/974 variables, 0/370 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 24/998 variables, 9/379 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/998 variables, 0/379 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 12/1010 variables, 9/388 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1010 variables, 0/388 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 0/1010 variables, 0/388 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1010/1010 variables, and 388 constraints, problems are : Problem set: 0 solved, 3 unsolved in 552 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 378/378 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem apf2 is UNSAT
At refinement iteration 1 (OVERLAPS) 305/307 variables, 9/9 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/307 variables, 0/9 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 35/342 variables, 1/10 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/342 variables, 0/10 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 596/938 variables, 342/352 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/938 variables, 2/354 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/938 variables, 0/354 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 36/974 variables, 18/372 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/974 variables, 0/372 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 24/998 variables, 9/381 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/998 variables, 0/381 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 12/1010 variables, 9/390 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1010 variables, 0/390 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/1010 variables, 0/390 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1010/1010 variables, and 390 constraints, problems are : Problem set: 1 solved, 2 unsolved in 424 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 378/378 constraints, PredecessorRefiner: 2/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 994ms problems are : Problem set: 1 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 149 ms.
Support contains 2 out of 378 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 378/378 places, 632/632 transitions.
Graph (trivial) has 281 edges and 378 vertex of which 11 / 378 are part of one of the 3 SCC in 0 ms
Free SCC test removed 8 places
Drop transitions (Empty/Sink Transition effects.) removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 53 transitions
Trivial Post-agglo rules discarded 53 transitions
Performed 53 trivial Post agglomeration. Transition count delta: 53
Iterating post reduction 0 with 53 rules applied. Total rules applied 54 place count 370 transition count 564
Reduce places removed 53 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 60 rules applied. Total rules applied 114 place count 317 transition count 557
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 117 place count 314 transition count 557
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 40 Pre rules applied. Total rules applied 117 place count 314 transition count 517
Deduced a syphon composed of 40 places in 0 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 3 with 80 rules applied. Total rules applied 197 place count 274 transition count 517
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 33
Deduced a syphon composed of 33 places in 0 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 3 with 66 rules applied. Total rules applied 263 place count 241 transition count 484
Performed 44 Post agglomeration using F-continuation condition with reduction of 9 identical transitions.
Deduced a syphon composed of 44 places in 0 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 3 with 88 rules applied. Total rules applied 351 place count 197 transition count 579
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 354 place count 197 transition count 576
Free-agglomeration rule applied 22 times.
Iterating global reduction 3 with 22 rules applied. Total rules applied 376 place count 197 transition count 554
Reduce places removed 22 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 3 with 31 rules applied. Total rules applied 407 place count 175 transition count 545
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 413 place count 169 transition count 539
Iterating global reduction 4 with 6 rules applied. Total rules applied 419 place count 169 transition count 539
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 4 with 9 rules applied. Total rules applied 428 place count 169 transition count 530
Drop transitions (Redundant composition of simpler transitions.) removed 27 transitions
Redundant transition composition rules discarded 27 transitions
Iterating global reduction 5 with 27 rules applied. Total rules applied 455 place count 169 transition count 503
Applied a total of 455 rules in 39 ms. Remains 169 /378 variables (removed 209) and now considering 503/632 (removed 129) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 39 ms. Remains : 169/378 places, 503/632 transitions.
RANDOM walk for 1148 steps (36 resets) in 14 ms. (76 steps per ms) remains 0/2 properties
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 p0), (X p0), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (F (OR (G p1) (G (NOT p1)))), (G (OR p1 p0))]
False Knowledge obtained : [(X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p1))), (X (X p1)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (F (NOT p0)), (F (NOT (OR (NOT p1) p0))), (F (NOT (OR p1 (NOT p0)))), (F (NOT p1)), (F (NOT (AND p1 p0)))]
Knowledge based reduction with 7 factoid took 682 ms. Reduced automaton from 6 states, 12 edges and 2 AP (stutter sensitive) to 6 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 278 ms :[true, (NOT p1), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 185 ms :[true, (NOT p1), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 2 out of 378 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 378/378 places, 632/632 transitions.
Applied a total of 0 rules in 3 ms. Remains 378 /378 variables (removed 0) and now considering 632/632 (removed 0) transitions.
[2024-06-03 00:28:46] [INFO ] Invariant cache hit.
[2024-06-03 00:28:46] [INFO ] Implicit Places using invariants in 122 ms returned []
[2024-06-03 00:28:46] [INFO ] Invariant cache hit.
[2024-06-03 00:28:47] [INFO ] Implicit Places using invariants and state equation in 379 ms returned []
Implicit Place search using SMT with State Equation took 542 ms to find 0 implicit places.
Running 631 sub problems to find dead transitions.
[2024-06-03 00:28:47] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/377 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 631 unsolved
At refinement iteration 1 (OVERLAPS) 1/378 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 631 unsolved
[2024-06-03 00:28:54] [INFO ] Deduced a trap composed of 244 places in 211 ms of which 3 ms to minimize.
[2024-06-03 00:28:54] [INFO ] Deduced a trap composed of 252 places in 139 ms of which 2 ms to minimize.
[2024-06-03 00:28:54] [INFO ] Deduced a trap composed of 78 places in 65 ms of which 0 ms to minimize.
[2024-06-03 00:28:55] [INFO ] Deduced a trap composed of 77 places in 66 ms of which 1 ms to minimize.
[2024-06-03 00:28:55] [INFO ] Deduced a trap composed of 78 places in 54 ms of which 1 ms to minimize.
[2024-06-03 00:28:55] [INFO ] Deduced a trap composed of 77 places in 64 ms of which 0 ms to minimize.
[2024-06-03 00:28:56] [INFO ] Deduced a trap composed of 78 places in 59 ms of which 1 ms to minimize.
[2024-06-03 00:28:57] [INFO ] Deduced a trap composed of 43 places in 134 ms of which 2 ms to minimize.
[2024-06-03 00:28:57] [INFO ] Deduced a trap composed of 63 places in 129 ms of which 2 ms to minimize.
[2024-06-03 00:28:58] [INFO ] Deduced a trap composed of 77 places in 112 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/378 variables, 10/20 constraints. Problems are: Problem set: 0 solved, 631 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/378 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 631 unsolved
At refinement iteration 4 (OVERLAPS) 632/1010 variables, 378/398 constraints. Problems are: Problem set: 0 solved, 631 unsolved
[2024-06-03 00:29:11] [INFO ] Deduced a trap composed of 76 places in 142 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1010/1010 variables, and 399 constraints, problems are : Problem set: 0 solved, 631 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 378/378 constraints, PredecessorRefiner: 631/631 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 631 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/377 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 631 unsolved
At refinement iteration 1 (OVERLAPS) 1/378 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 631 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/378 variables, 11/21 constraints. Problems are: Problem set: 0 solved, 631 unsolved
[2024-06-03 00:29:21] [INFO ] Deduced a trap composed of 79 places in 45 ms of which 1 ms to minimize.
[2024-06-03 00:29:21] [INFO ] Deduced a trap composed of 79 places in 51 ms of which 1 ms to minimize.
[2024-06-03 00:29:22] [INFO ] Deduced a trap composed of 79 places in 51 ms of which 1 ms to minimize.
[2024-06-03 00:29:22] [INFO ] Deduced a trap composed of 92 places in 46 ms of which 1 ms to minimize.
[2024-06-03 00:29:22] [INFO ] Deduced a trap composed of 96 places in 45 ms of which 0 ms to minimize.
[2024-06-03 00:29:25] [INFO ] Deduced a trap composed of 56 places in 126 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/378 variables, 6/27 constraints. Problems are: Problem set: 0 solved, 631 unsolved
[2024-06-03 00:29:27] [INFO ] Deduced a trap composed of 96 places in 48 ms of which 1 ms to minimize.
[2024-06-03 00:29:27] [INFO ] Deduced a trap composed of 92 places in 43 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/378 variables, 2/29 constraints. Problems are: Problem set: 0 solved, 631 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/378 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 631 unsolved
At refinement iteration 6 (OVERLAPS) 632/1010 variables, 378/407 constraints. Problems are: Problem set: 0 solved, 631 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1010 variables, 631/1038 constraints. Problems are: Problem set: 0 solved, 631 unsolved
[2024-06-03 00:29:43] [INFO ] Deduced a trap composed of 125 places in 144 ms of which 2 ms to minimize.
[2024-06-03 00:29:46] [INFO ] Deduced a trap composed of 222 places in 140 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1010/1010 variables, and 1040 constraints, problems are : Problem set: 0 solved, 631 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 378/378 constraints, PredecessorRefiner: 631/631 constraints, Known Traps: 21/21 constraints]
After SMT, in 60246ms problems are : Problem set: 0 solved, 631 unsolved
Search for dead transitions found 0 dead transitions in 60252ms
Finished structural reductions in LTL mode , in 1 iterations and 60798 ms. Remains : 378/378 places, 632/632 transitions.
Computed a total of 84 stabilizing places and 108 stable transitions
Computed a total of 84 stabilizing places and 108 stable transitions
Detected a total of 84/378 stabilizing places and 108/632 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p1 p0), (X (X p0)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (X (X (AND p1 p0))), (X (X (NOT (AND p1 p0))))]
Knowledge based reduction with 3 factoid took 278 ms. Reduced automaton from 6 states, 11 edges and 2 AP (stutter sensitive) to 6 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 219 ms :[true, (NOT p1), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
RANDOM walk for 40000 steps (55 resets) in 102 ms. (388 steps per ms) remains 2/4 properties
BEST_FIRST walk for 32856 steps (25 resets) in 48 ms. (670 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND p1 p0), (X (X p0)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (X (X (AND p1 p0))), (X (X (NOT (AND p1 p0)))), (F (NOT p0)), (F (NOT (AND p0 p1))), (F (NOT (OR p0 (NOT p1)))), (F (NOT p1))]
Knowledge based reduction with 3 factoid took 298 ms. Reduced automaton from 6 states, 11 edges and 2 AP (stutter sensitive) to 6 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 233 ms :[true, (NOT p1), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 217 ms :[true, (NOT p1), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 212 ms :[true, (NOT p1), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 3 reset in 93 ms.
Product exploration explored 100000 steps with 1 reset in 101 ms.
Applying partial POR strategy [true, false, true, false, false, false]
Stuttering acceptance computed with spot in 217 ms :[true, (NOT p1), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 2 out of 378 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 378/378 places, 632/632 transitions.
Graph (trivial) has 281 edges and 378 vertex of which 11 / 378 are part of one of the 3 SCC in 1 ms
Free SCC test removed 8 places
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Performed 53 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 53 rules applied. Total rules applied 54 place count 370 transition count 623
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 58 place count 370 transition count 619
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 24 Pre rules applied. Total rules applied 58 place count 370 transition count 652
Deduced a syphon composed of 77 places in 1 ms
Iterating global reduction 2 with 24 rules applied. Total rules applied 82 place count 370 transition count 652
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 88 place count 364 transition count 646
Deduced a syphon composed of 71 places in 1 ms
Iterating global reduction 2 with 6 rules applied. Total rules applied 94 place count 364 transition count 646
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 119 places in 1 ms
Iterating global reduction 2 with 48 rules applied. Total rules applied 142 place count 364 transition count 665
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 158 place count 348 transition count 649
Deduced a syphon composed of 103 places in 1 ms
Iterating global reduction 2 with 16 rules applied. Total rules applied 174 place count 348 transition count 649
Performed 48 Post agglomeration using F-continuation condition with reduction of 9 identical transitions.
Deduced a syphon composed of 151 places in 0 ms
Iterating global reduction 2 with 48 rules applied. Total rules applied 222 place count 348 transition count 931
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 225 place count 348 transition count 928
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 232 place count 341 transition count 914
Deduced a syphon composed of 144 places in 1 ms
Iterating global reduction 3 with 7 rules applied. Total rules applied 239 place count 341 transition count 914
Deduced a syphon composed of 144 places in 0 ms
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 242 place count 341 transition count 911
Deduced a syphon composed of 144 places in 0 ms
Applied a total of 242 rules in 68 ms. Remains 341 /378 variables (removed 37) and now considering 911/632 (removed -279) transitions.
[2024-06-03 00:29:49] [INFO ] Redundant transitions in 50 ms returned []
Running 910 sub problems to find dead transitions.
[2024-06-03 00:29:49] [INFO ] Flow matrix only has 882 transitions (discarded 29 similar events)
// Phase 1: matrix 882 rows 341 cols
[2024-06-03 00:29:49] [INFO ] Computed 10 invariants in 5 ms
[2024-06-03 00:29:49] [INFO ] State equation strengthened by 13 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/340 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 910 unsolved
At refinement iteration 1 (OVERLAPS) 1/341 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 910 unsolved
[2024-06-03 00:29:59] [INFO ] Deduced a trap composed of 49 places in 51 ms of which 1 ms to minimize.
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
[2024-06-03 00:29:59] [INFO ] Deduced a trap composed of 8 places in 42 ms of which 1 ms to minimize.
Problem TDEAD28 is UNSAT
Problem TDEAD30 is UNSAT
[2024-06-03 00:29:59] [INFO ] Deduced a trap composed of 5 places in 29 ms of which 1 ms to minimize.
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
[2024-06-03 00:30:00] [INFO ] Deduced a trap composed of 47 places in 54 ms of which 1 ms to minimize.
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
[2024-06-03 00:30:00] [INFO ] Deduced a trap composed of 8 places in 37 ms of which 0 ms to minimize.
Problem TDEAD65 is UNSAT
Problem TDEAD67 is UNSAT
[2024-06-03 00:30:00] [INFO ] Deduced a trap composed of 5 places in 27 ms of which 1 ms to minimize.
Problem TDEAD68 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD70 is UNSAT
[2024-06-03 00:30:00] [INFO ] Deduced a trap composed of 47 places in 60 ms of which 0 ms to minimize.
Problem TDEAD78 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD101 is UNSAT
[2024-06-03 00:30:00] [INFO ] Deduced a trap composed of 8 places in 43 ms of which 1 ms to minimize.
Problem TDEAD102 is UNSAT
Problem TDEAD104 is UNSAT
[2024-06-03 00:30:00] [INFO ] Deduced a trap composed of 5 places in 28 ms of which 1 ms to minimize.
Problem TDEAD105 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD107 is UNSAT
[2024-06-03 00:30:00] [INFO ] Deduced a trap composed of 20 places in 149 ms of which 2 ms to minimize.
Problem TDEAD113 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD125 is UNSAT
[2024-06-03 00:30:00] [INFO ] Deduced a trap composed of 67 places in 146 ms of which 2 ms to minimize.
Problem TDEAD128 is UNSAT
Problem TDEAD129 is UNSAT
[2024-06-03 00:30:01] [INFO ] Deduced a trap composed of 35 places in 146 ms of which 3 ms to minimize.
Problem TDEAD157 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD171 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD186 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD231 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD240 is UNSAT
Problem TDEAD241 is UNSAT
Problem TDEAD244 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD273 is UNSAT
Problem TDEAD278 is UNSAT
Problem TDEAD281 is UNSAT
Problem TDEAD285 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD302 is UNSAT
Problem TDEAD303 is UNSAT
Problem TDEAD304 is UNSAT
Problem TDEAD305 is UNSAT
Problem TDEAD306 is UNSAT
Problem TDEAD307 is UNSAT
Problem TDEAD309 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD311 is UNSAT
Problem TDEAD312 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD315 is UNSAT
Problem TDEAD316 is UNSAT
Problem TDEAD318 is UNSAT
Problem TDEAD319 is UNSAT
Problem TDEAD320 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD323 is UNSAT
Problem TDEAD324 is UNSAT
[2024-06-03 00:30:02] [INFO ] Deduced a trap composed of 41 places in 54 ms of which 3 ms to minimize.
[2024-06-03 00:30:02] [INFO ] Deduced a trap composed of 41 places in 48 ms of which 1 ms to minimize.
[2024-06-03 00:30:02] [INFO ] Deduced a trap composed of 43 places in 40 ms of which 1 ms to minimize.
[2024-06-03 00:30:02] [INFO ] Deduced a trap composed of 23 places in 141 ms of which 2 ms to minimize.
Problem TDEAD369 is UNSAT
Problem TDEAD370 is UNSAT
Problem TDEAD371 is UNSAT
Problem TDEAD373 is UNSAT
Problem TDEAD374 is UNSAT
Problem TDEAD375 is UNSAT
Problem TDEAD376 is UNSAT
[2024-06-03 00:30:02] [INFO ] Deduced a trap composed of 53 places in 131 ms of which 2 ms to minimize.
Problem TDEAD385 is UNSAT
Problem TDEAD386 is UNSAT
Problem TDEAD387 is UNSAT
Problem TDEAD388 is UNSAT
Problem TDEAD389 is UNSAT
Problem TDEAD396 is UNSAT
Problem TDEAD397 is UNSAT
Problem TDEAD398 is UNSAT
Problem TDEAD404 is UNSAT
Problem TDEAD405 is UNSAT
Problem TDEAD406 is UNSAT
Problem TDEAD408 is UNSAT
Problem TDEAD409 is UNSAT
Problem TDEAD410 is UNSAT
Problem TDEAD411 is UNSAT
Problem TDEAD420 is UNSAT
Problem TDEAD421 is UNSAT
Problem TDEAD422 is UNSAT
Problem TDEAD423 is UNSAT
Problem TDEAD424 is UNSAT
Problem TDEAD431 is UNSAT
Problem TDEAD432 is UNSAT
Problem TDEAD433 is UNSAT
Problem TDEAD439 is UNSAT
Problem TDEAD440 is UNSAT
Problem TDEAD441 is UNSAT
Problem TDEAD443 is UNSAT
Problem TDEAD445 is UNSAT
Problem TDEAD446 is UNSAT
Problem TDEAD447 is UNSAT
Problem TDEAD457 is UNSAT
Problem TDEAD458 is UNSAT
Problem TDEAD459 is UNSAT
Problem TDEAD460 is UNSAT
Problem TDEAD461 is UNSAT
Problem TDEAD468 is UNSAT
Problem TDEAD469 is UNSAT
Problem TDEAD470 is UNSAT
Problem TDEAD484 is UNSAT
Problem TDEAD485 is UNSAT
Problem TDEAD486 is UNSAT
Problem TDEAD487 is UNSAT
Problem TDEAD488 is UNSAT
Problem TDEAD489 is UNSAT
Problem TDEAD490 is UNSAT
Problem TDEAD494 is UNSAT
Problem TDEAD495 is UNSAT
Problem TDEAD496 is UNSAT
Problem TDEAD500 is UNSAT
Problem TDEAD501 is UNSAT
Problem TDEAD502 is UNSAT
Problem TDEAD503 is UNSAT
Problem TDEAD510 is UNSAT
Problem TDEAD511 is UNSAT
Problem TDEAD512 is UNSAT
Problem TDEAD513 is UNSAT
[2024-06-03 00:30:03] [INFO ] Deduced a trap composed of 33 places in 128 ms of which 2 ms to minimize.
[2024-06-03 00:30:03] [INFO ] Deduced a trap composed of 31 places in 137 ms of which 2 ms to minimize.
Problem TDEAD542 is UNSAT
Problem TDEAD543 is UNSAT
Problem TDEAD544 is UNSAT
Problem TDEAD545 is UNSAT
Problem TDEAD546 is UNSAT
Problem TDEAD547 is UNSAT
Problem TDEAD580 is UNSAT
Problem TDEAD581 is UNSAT
Problem TDEAD582 is UNSAT
Problem TDEAD583 is UNSAT
Problem TDEAD602 is UNSAT
Problem TDEAD603 is UNSAT
Problem TDEAD604 is UNSAT
Problem TDEAD605 is UNSAT
Problem TDEAD606 is UNSAT
Problem TDEAD607 is UNSAT
Problem TDEAD608 is UNSAT
Problem TDEAD609 is UNSAT
Problem TDEAD610 is UNSAT
Problem TDEAD611 is UNSAT
Problem TDEAD612 is UNSAT
Problem TDEAD613 is UNSAT
Problem TDEAD626 is UNSAT
Problem TDEAD627 is UNSAT
Problem TDEAD628 is UNSAT
Problem TDEAD629 is UNSAT
Problem TDEAD630 is UNSAT
Problem TDEAD631 is UNSAT
Problem TDEAD632 is UNSAT
Problem TDEAD633 is UNSAT
Problem TDEAD634 is UNSAT
Problem TDEAD635 is UNSAT
Problem TDEAD636 is UNSAT
Problem TDEAD640 is UNSAT
Problem TDEAD641 is UNSAT
Problem TDEAD642 is UNSAT
Problem TDEAD646 is UNSAT
Problem TDEAD647 is UNSAT
Problem TDEAD648 is UNSAT
Problem TDEAD649 is UNSAT
Problem TDEAD656 is UNSAT
Problem TDEAD657 is UNSAT
Problem TDEAD658 is UNSAT
Problem TDEAD659 is UNSAT
Problem TDEAD688 is UNSAT
Problem TDEAD689 is UNSAT
Problem TDEAD690 is UNSAT
Problem TDEAD691 is UNSAT
Problem TDEAD692 is UNSAT
Problem TDEAD693 is UNSAT
Problem TDEAD726 is UNSAT
Problem TDEAD727 is UNSAT
Problem TDEAD728 is UNSAT
Problem TDEAD729 is UNSAT
Problem TDEAD748 is UNSAT
Problem TDEAD749 is UNSAT
Problem TDEAD750 is UNSAT
Problem TDEAD751 is UNSAT
Problem TDEAD752 is UNSAT
Problem TDEAD753 is UNSAT
Problem TDEAD754 is UNSAT
Problem TDEAD755 is UNSAT
Problem TDEAD756 is UNSAT
Problem TDEAD757 is UNSAT
Problem TDEAD758 is UNSAT
Problem TDEAD759 is UNSAT
Problem TDEAD772 is UNSAT
Problem TDEAD773 is UNSAT
Problem TDEAD774 is UNSAT
Problem TDEAD775 is UNSAT
[2024-06-03 00:30:05] [INFO ] Deduced a trap composed of 122 places in 153 ms of which 2 ms to minimize.
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD128 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD171 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD186 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD231 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD240 is UNSAT
Problem TDEAD241 is UNSAT
Problem TDEAD244 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD273 is UNSAT
Problem TDEAD278 is UNSAT
Problem TDEAD281 is UNSAT
Problem TDEAD285 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD302 is UNSAT
Problem TDEAD303 is UNSAT
Problem TDEAD304 is UNSAT
Problem TDEAD305 is UNSAT
Problem TDEAD306 is UNSAT
Problem TDEAD307 is UNSAT
Problem TDEAD309 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD311 is UNSAT
Problem TDEAD312 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD315 is UNSAT
Problem TDEAD316 is UNSAT
Problem TDEAD318 is UNSAT
Problem TDEAD319 is UNSAT
Problem TDEAD320 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD323 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD369 is UNSAT
Problem TDEAD370 is UNSAT
Problem TDEAD371 is UNSAT
Problem TDEAD373 is UNSAT
Problem TDEAD374 is UNSAT
Problem TDEAD375 is UNSAT
Problem TDEAD376 is UNSAT
Problem TDEAD385 is UNSAT
Problem TDEAD386 is UNSAT
Problem TDEAD387 is UNSAT
Problem TDEAD388 is UNSAT
Problem TDEAD389 is UNSAT
Problem TDEAD396 is UNSAT
Problem TDEAD397 is UNSAT
Problem TDEAD398 is UNSAT
Problem TDEAD404 is UNSAT
Problem TDEAD405 is UNSAT
Problem TDEAD406 is UNSAT
Problem TDEAD408 is UNSAT
Problem TDEAD409 is UNSAT
Problem TDEAD410 is UNSAT
Problem TDEAD411 is UNSAT
Problem TDEAD420 is UNSAT
Problem TDEAD421 is UNSAT
Problem TDEAD422 is UNSAT
Problem TDEAD423 is UNSAT
Problem TDEAD424 is UNSAT
Problem TDEAD431 is UNSAT
Problem TDEAD432 is UNSAT
Problem TDEAD433 is UNSAT
Problem TDEAD439 is UNSAT
Problem TDEAD440 is UNSAT
Problem TDEAD441 is UNSAT
Problem TDEAD443 is UNSAT
Problem TDEAD445 is UNSAT
Problem TDEAD446 is UNSAT
Problem TDEAD447 is UNSAT
Problem TDEAD457 is UNSAT
Problem TDEAD458 is UNSAT
Problem TDEAD459 is UNSAT
Problem TDEAD460 is UNSAT
Problem TDEAD461 is UNSAT
Problem TDEAD468 is UNSAT
Problem TDEAD469 is UNSAT
Problem TDEAD470 is UNSAT
Problem TDEAD484 is UNSAT
Problem TDEAD485 is UNSAT
Problem TDEAD486 is UNSAT
Problem TDEAD487 is UNSAT
Problem TDEAD488 is UNSAT
Problem TDEAD489 is UNSAT
Problem TDEAD490 is UNSAT
Problem TDEAD494 is UNSAT
Problem TDEAD495 is UNSAT
Problem TDEAD496 is UNSAT
Problem TDEAD500 is UNSAT
Problem TDEAD501 is UNSAT
Problem TDEAD502 is UNSAT
Problem TDEAD503 is UNSAT
Problem TDEAD510 is UNSAT
Problem TDEAD511 is UNSAT
Problem TDEAD512 is UNSAT
Problem TDEAD513 is UNSAT
Problem TDEAD542 is UNSAT
Problem TDEAD543 is UNSAT
Problem TDEAD544 is UNSAT
Problem TDEAD545 is UNSAT
Problem TDEAD546 is UNSAT
Problem TDEAD547 is UNSAT
Problem TDEAD580 is UNSAT
Problem TDEAD581 is UNSAT
Problem TDEAD582 is UNSAT
Problem TDEAD583 is UNSAT
Problem TDEAD602 is UNSAT
Problem TDEAD603 is UNSAT
Problem TDEAD604 is UNSAT
Problem TDEAD605 is UNSAT
Problem TDEAD606 is UNSAT
Problem TDEAD607 is UNSAT
Problem TDEAD608 is UNSAT
Problem TDEAD609 is UNSAT
Problem TDEAD610 is UNSAT
Problem TDEAD611 is UNSAT
Problem TDEAD612 is UNSAT
Problem TDEAD613 is UNSAT
Problem TDEAD626 is UNSAT
Problem TDEAD627 is UNSAT
Problem TDEAD628 is UNSAT
Problem TDEAD629 is UNSAT
Problem TDEAD630 is UNSAT
Problem TDEAD631 is UNSAT
Problem TDEAD632 is UNSAT
Problem TDEAD633 is UNSAT
Problem TDEAD634 is UNSAT
Problem TDEAD635 is UNSAT
Problem TDEAD636 is UNSAT
Problem TDEAD640 is UNSAT
Problem TDEAD641 is UNSAT
Problem TDEAD642 is UNSAT
Problem TDEAD646 is UNSAT
Problem TDEAD647 is UNSAT
Problem TDEAD648 is UNSAT
Problem TDEAD649 is UNSAT
Problem TDEAD656 is UNSAT
Problem TDEAD657 is UNSAT
Problem TDEAD658 is UNSAT
Problem TDEAD659 is UNSAT
Problem TDEAD688 is UNSAT
Problem TDEAD689 is UNSAT
Problem TDEAD690 is UNSAT
Problem TDEAD691 is UNSAT
Problem TDEAD692 is UNSAT
Problem TDEAD693 is UNSAT
Problem TDEAD726 is UNSAT
Problem TDEAD727 is UNSAT
Problem TDEAD728 is UNSAT
Problem TDEAD729 is UNSAT
Problem TDEAD748 is UNSAT
Problem TDEAD749 is UNSAT
Problem TDEAD750 is UNSAT
Problem TDEAD751 is UNSAT
Problem TDEAD752 is UNSAT
Problem TDEAD753 is UNSAT
Problem TDEAD754 is UNSAT
Problem TDEAD755 is UNSAT
Problem TDEAD756 is UNSAT
Problem TDEAD757 is UNSAT
Problem TDEAD758 is UNSAT
Problem TDEAD759 is UNSAT
Problem TDEAD772 is UNSAT
Problem TDEAD773 is UNSAT
Problem TDEAD774 is UNSAT
Problem TDEAD775 is UNSAT
Problem TDEAD784 is UNSAT
Problem TDEAD785 is UNSAT
Problem TDEAD786 is UNSAT
Problem TDEAD790 is UNSAT
Problem TDEAD791 is UNSAT
Problem TDEAD792 is UNSAT
Problem TDEAD796 is UNSAT
Problem TDEAD797 is UNSAT
Problem TDEAD804 is UNSAT
Problem TDEAD805 is UNSAT
Problem TDEAD806 is UNSAT
Problem TDEAD807 is UNSAT
Problem TDEAD836 is UNSAT
Problem TDEAD837 is UNSAT
Problem TDEAD838 is UNSAT
Problem TDEAD839 is UNSAT
Problem TDEAD840 is UNSAT
Problem TDEAD841 is UNSAT
Problem TDEAD865 is UNSAT
Problem TDEAD866 is UNSAT
Problem TDEAD867 is UNSAT
Problem TDEAD868 is UNSAT
Problem TDEAD887 is UNSAT
Problem TDEAD888 is UNSAT
Problem TDEAD889 is UNSAT
Problem TDEAD890 is UNSAT
Problem TDEAD891 is UNSAT
Problem TDEAD892 is UNSAT
Problem TDEAD893 is UNSAT
Problem TDEAD894 is UNSAT
Problem TDEAD895 is UNSAT
Problem TDEAD896 is UNSAT
Problem TDEAD897 is UNSAT
Problem TDEAD898 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/341 variables, 20/30 constraints. Problems are: Problem set: 308 solved, 602 unsolved
[2024-06-03 00:30:09] [INFO ] Deduced a trap composed of 129 places in 155 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/341 variables, 1/31 constraints. Problems are: Problem set: 308 solved, 602 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/341 variables, 0/31 constraints. Problems are: Problem set: 308 solved, 602 unsolved
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD329 is UNSAT
Problem TDEAD337 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD368 is UNSAT
Problem TDEAD403 is UNSAT
Problem TDEAD438 is UNSAT
At refinement iteration 5 (OVERLAPS) 881/1222 variables, 341/372 constraints. Problems are: Problem set: 329 solved, 581 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1222 variables, 12/384 constraints. Problems are: Problem set: 329 solved, 581 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1222/1223 variables, and 384 constraints, problems are : Problem set: 329 solved, 581 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 341/341 constraints, ReadFeed: 12/13 constraints, PredecessorRefiner: 910/910 constraints, Known Traps: 21/21 constraints]
Escalating to Integer solving :Problem set: 329 solved, 581 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/196 variables, 0/0 constraints. Problems are: Problem set: 329 solved, 581 unsolved
At refinement iteration 1 (OVERLAPS) 133/329 variables, 10/10 constraints. Problems are: Problem set: 329 solved, 581 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/329 variables, 21/31 constraints. Problems are: Problem set: 329 solved, 581 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/329 variables, 0/31 constraints. Problems are: Problem set: 329 solved, 581 unsolved
At refinement iteration 4 (OVERLAPS) 878/1207 variables, 329/360 constraints. Problems are: Problem set: 329 solved, 581 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1207 variables, 12/372 constraints. Problems are: Problem set: 329 solved, 581 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1207 variables, 581/953 constraints. Problems are: Problem set: 329 solved, 581 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1207/1223 variables, and 953 constraints, problems are : Problem set: 329 solved, 581 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 329/341 constraints, ReadFeed: 12/13 constraints, PredecessorRefiner: 581/910 constraints, Known Traps: 21/21 constraints]
After SMT, in 60882ms problems are : Problem set: 329 solved, 581 unsolved
Search for dead transitions found 329 dead transitions in 60892ms
Found 329 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 329 transitions
Dead transitions reduction (with SMT) removed 329 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 341/378 places, 582/632 transitions.
Graph (complete) has 1051 edges and 341 vertex of which 197 are kept as prefixes of interest. Removing 144 places using SCC suffix rule.2 ms
Discarding 144 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 13 ms. Remains 197 /341 variables (removed 144) and now considering 582/582 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 197/378 places, 582/632 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 61032 ms. Remains : 197/378 places, 582/632 transitions.
Built C files in :
/tmp/ltsmin9301939052409035905
[2024-06-03 00:30:50] [INFO ] Built C files in 40ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9301939052409035905
Running compilation step : cd /tmp/ltsmin9301939052409035905;'/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 1376 ms.
Running link step : cd /tmp/ltsmin9301939052409035905;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin9301939052409035905;'/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' '--hoa' '/tmp/stateBased12444023080067508161.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 378 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 378/378 places, 632/632 transitions.
Applied a total of 0 rules in 4 ms. Remains 378 /378 variables (removed 0) and now considering 632/632 (removed 0) transitions.
// Phase 1: matrix 632 rows 378 cols
[2024-06-03 00:31:05] [INFO ] Computed 10 invariants in 2 ms
[2024-06-03 00:31:05] [INFO ] Implicit Places using invariants in 244 ms returned []
[2024-06-03 00:31:05] [INFO ] Invariant cache hit.
[2024-06-03 00:31:06] [INFO ] Implicit Places using invariants and state equation in 426 ms returned []
Implicit Place search using SMT with State Equation took 685 ms to find 0 implicit places.
Running 631 sub problems to find dead transitions.
[2024-06-03 00:31:06] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/377 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 631 unsolved
At refinement iteration 1 (OVERLAPS) 1/378 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 631 unsolved
[2024-06-03 00:31:13] [INFO ] Deduced a trap composed of 244 places in 133 ms of which 2 ms to minimize.
[2024-06-03 00:31:13] [INFO ] Deduced a trap composed of 252 places in 136 ms of which 3 ms to minimize.
[2024-06-03 00:31:14] [INFO ] Deduced a trap composed of 78 places in 61 ms of which 1 ms to minimize.
[2024-06-03 00:31:14] [INFO ] Deduced a trap composed of 77 places in 65 ms of which 1 ms to minimize.
[2024-06-03 00:31:14] [INFO ] Deduced a trap composed of 78 places in 61 ms of which 1 ms to minimize.
[2024-06-03 00:31:14] [INFO ] Deduced a trap composed of 77 places in 55 ms of which 1 ms to minimize.
[2024-06-03 00:31:15] [INFO ] Deduced a trap composed of 78 places in 56 ms of which 1 ms to minimize.
[2024-06-03 00:31:16] [INFO ] Deduced a trap composed of 43 places in 131 ms of which 2 ms to minimize.
[2024-06-03 00:31:16] [INFO ] Deduced a trap composed of 63 places in 121 ms of which 2 ms to minimize.
[2024-06-03 00:31:17] [INFO ] Deduced a trap composed of 77 places in 100 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/378 variables, 10/20 constraints. Problems are: Problem set: 0 solved, 631 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/378 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 631 unsolved
At refinement iteration 4 (OVERLAPS) 632/1010 variables, 378/398 constraints. Problems are: Problem set: 0 solved, 631 unsolved
[2024-06-03 00:31:30] [INFO ] Deduced a trap composed of 76 places in 115 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/1010 variables, 1/399 constraints. Problems are: Problem set: 0 solved, 631 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1010/1010 variables, and 399 constraints, problems are : Problem set: 0 solved, 631 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 378/378 constraints, PredecessorRefiner: 631/631 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 631 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/377 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 631 unsolved
At refinement iteration 1 (OVERLAPS) 1/378 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 631 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/378 variables, 11/21 constraints. Problems are: Problem set: 0 solved, 631 unsolved
[2024-06-03 00:31:40] [INFO ] Deduced a trap composed of 79 places in 49 ms of which 1 ms to minimize.
[2024-06-03 00:31:40] [INFO ] Deduced a trap composed of 79 places in 72 ms of which 1 ms to minimize.
[2024-06-03 00:31:41] [INFO ] Deduced a trap composed of 79 places in 64 ms of which 1 ms to minimize.
[2024-06-03 00:31:41] [INFO ] Deduced a trap composed of 92 places in 59 ms of which 1 ms to minimize.
[2024-06-03 00:31:41] [INFO ] Deduced a trap composed of 96 places in 58 ms of which 3 ms to minimize.
[2024-06-03 00:31:44] [INFO ] Deduced a trap composed of 56 places in 156 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/378 variables, 6/27 constraints. Problems are: Problem set: 0 solved, 631 unsolved
[2024-06-03 00:31:46] [INFO ] Deduced a trap composed of 96 places in 61 ms of which 1 ms to minimize.
[2024-06-03 00:31:46] [INFO ] Deduced a trap composed of 92 places in 67 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/378 variables, 2/29 constraints. Problems are: Problem set: 0 solved, 631 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/378 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 631 unsolved
At refinement iteration 6 (OVERLAPS) 632/1010 variables, 378/407 constraints. Problems are: Problem set: 0 solved, 631 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1010 variables, 631/1038 constraints. Problems are: Problem set: 0 solved, 631 unsolved
[2024-06-03 00:32:02] [INFO ] Deduced a trap composed of 125 places in 149 ms of which 3 ms to minimize.
[2024-06-03 00:32:05] [INFO ] Deduced a trap composed of 222 places in 141 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1010/1010 variables, and 1040 constraints, problems are : Problem set: 0 solved, 631 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 378/378 constraints, PredecessorRefiner: 631/631 constraints, Known Traps: 21/21 constraints]
After SMT, in 60233ms problems are : Problem set: 0 solved, 631 unsolved
Search for dead transitions found 0 dead transitions in 60239ms
Finished structural reductions in LTL mode , in 1 iterations and 60929 ms. Remains : 378/378 places, 632/632 transitions.
Built C files in :
/tmp/ltsmin1791777763200638274
[2024-06-03 00:32:06] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1791777763200638274
Running compilation step : cd /tmp/ltsmin1791777763200638274;'/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 1055 ms.
Running link step : cd /tmp/ltsmin1791777763200638274;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin1791777763200638274;'/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' '--hoa' '/tmp/stateBased17607242841826887972.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-06-03 00:32:21] [INFO ] Flatten gal took : 29 ms
[2024-06-03 00:32:21] [INFO ] Flatten gal took : 26 ms
[2024-06-03 00:32:21] [INFO ] Time to serialize gal into /tmp/LTL8355916664070429116.gal : 7 ms
[2024-06-03 00:32:21] [INFO ] Time to serialize properties into /tmp/LTL6297272093669019263.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/LTL8355916664070429116.gal' '-t' 'CGAL' '-hoa' '/tmp/aut14210113115620178808.hoa' '-atoms' '/tmp/LTL6297272093669019263.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...318
Loading property file /tmp/LTL6297272093669019263.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut14210113115620178808.hoa
Detected timeout of ITS tools.
[2024-06-03 00:32:36] [INFO ] Flatten gal took : 24 ms
[2024-06-03 00:32:36] [INFO ] Flatten gal took : 23 ms
[2024-06-03 00:32:36] [INFO ] Time to serialize gal into /tmp/LTL10542577298649652916.gal : 7 ms
[2024-06-03 00:32:36] [INFO ] Time to serialize properties into /tmp/LTL10284481901809392994.ltl : 3 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/LTL10542577298649652916.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10284481901809392994.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...277
Read 1 LTL properties
Checking formula 0 : !((X(G((G("(p563==0)"))||(X("(p60==0)"))))))
Formula 0 simplified : XF(F!"(p563==0)" & X!"(p60==0)")
Detected timeout of ITS tools.
[2024-06-03 00:32:52] [INFO ] Flatten gal took : 26 ms
[2024-06-03 00:32:52] [INFO ] Applying decomposition
[2024-06-03 00:32:52] [INFO ] Flatten gal took : 20 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/graph6024014308255219735.txt' '-o' '/tmp/graph6024014308255219735.bin' '-w' '/tmp/graph6024014308255219735.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph6024014308255219735.bin' '-l' '-1' '-v' '-w' '/tmp/graph6024014308255219735.weights' '-q' '0' '-e' '0.001'
[2024-06-03 00:32:52] [INFO ] Decomposing Gal with order
[2024-06-03 00:32:52] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-03 00:32:52] [INFO ] Removed a total of 686 redundant transitions.
[2024-06-03 00:32:52] [INFO ] Flatten gal took : 83 ms
[2024-06-03 00:32:52] [INFO ] Fuse similar labels procedure discarded/fused a total of 10 labels/synchronizations in 11 ms.
[2024-06-03 00:32:52] [INFO ] Time to serialize gal into /tmp/LTL17221602546962653420.gal : 12 ms
[2024-06-03 00:32:52] [INFO ] Time to serialize properties into /tmp/LTL15958200418797932246.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/LTL17221602546962653420.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15958200418797932246.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...256
Read 1 LTL properties
Checking formula 0 : !((X(G((G("(i13.u124.p563==0)"))||(X("(i4.i0.u11.p60==0)"))))))
Formula 0 simplified : XF(F!"(i13.u124.p563==0)" & X!"(i4.i0.u11.p60==0)")
Detected timeout of ITS tools.
Treatment of property FireWire-PT-20-LTLFireability-06 finished in 325730 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(p0)&&F(p1))))'
Support contains 3 out of 411 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 411/411 places, 688/688 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 397 transition count 669
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 397 transition count 669
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 29 place count 397 transition count 668
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 35 place count 391 transition count 656
Iterating global reduction 1 with 6 rules applied. Total rules applied 41 place count 391 transition count 656
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 44 place count 388 transition count 651
Iterating global reduction 1 with 3 rules applied. Total rules applied 47 place count 388 transition count 651
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 49 place count 386 transition count 646
Iterating global reduction 1 with 2 rules applied. Total rules applied 51 place count 386 transition count 646
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 53 place count 384 transition count 642
Iterating global reduction 1 with 2 rules applied. Total rules applied 55 place count 384 transition count 642
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 57 place count 382 transition count 638
Iterating global reduction 1 with 2 rules applied. Total rules applied 59 place count 382 transition count 638
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 60 place count 381 transition count 636
Iterating global reduction 1 with 1 rules applied. Total rules applied 61 place count 381 transition count 636
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 62 place count 380 transition count 634
Iterating global reduction 1 with 1 rules applied. Total rules applied 63 place count 380 transition count 634
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 64 place count 379 transition count 632
Iterating global reduction 1 with 1 rules applied. Total rules applied 65 place count 379 transition count 632
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 66 place count 378 transition count 631
Iterating global reduction 1 with 1 rules applied. Total rules applied 67 place count 378 transition count 631
Applied a total of 67 rules in 39 ms. Remains 378 /411 variables (removed 33) and now considering 631/688 (removed 57) transitions.
// Phase 1: matrix 631 rows 378 cols
[2024-06-03 00:33:07] [INFO ] Computed 10 invariants in 7 ms
[2024-06-03 00:33:07] [INFO ] Implicit Places using invariants in 151 ms returned []
[2024-06-03 00:33:07] [INFO ] Invariant cache hit.
[2024-06-03 00:33:08] [INFO ] Implicit Places using invariants and state equation in 419 ms returned []
Implicit Place search using SMT with State Equation took 574 ms to find 0 implicit places.
Running 630 sub problems to find dead transitions.
[2024-06-03 00:33:08] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/377 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 630 unsolved
At refinement iteration 1 (OVERLAPS) 1/378 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 630 unsolved
[2024-06-03 00:33:15] [INFO ] Deduced a trap composed of 244 places in 125 ms of which 4 ms to minimize.
[2024-06-03 00:33:15] [INFO ] Deduced a trap composed of 78 places in 59 ms of which 0 ms to minimize.
[2024-06-03 00:33:15] [INFO ] Deduced a trap composed of 77 places in 50 ms of which 1 ms to minimize.
[2024-06-03 00:33:16] [INFO ] Deduced a trap composed of 78 places in 51 ms of which 0 ms to minimize.
[2024-06-03 00:33:16] [INFO ] Deduced a trap composed of 77 places in 47 ms of which 1 ms to minimize.
[2024-06-03 00:33:17] [INFO ] Deduced a trap composed of 77 places in 51 ms of which 1 ms to minimize.
[2024-06-03 00:33:17] [INFO ] Deduced a trap composed of 78 places in 53 ms of which 1 ms to minimize.
[2024-06-03 00:33:17] [INFO ] Deduced a trap composed of 43 places in 100 ms of which 2 ms to minimize.
[2024-06-03 00:33:18] [INFO ] Deduced a trap composed of 87 places in 53 ms of which 1 ms to minimize.
[2024-06-03 00:33:18] [INFO ] Deduced a trap composed of 56 places in 118 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/378 variables, 10/20 constraints. Problems are: Problem set: 0 solved, 630 unsolved
[2024-06-03 00:33:21] [INFO ] Deduced a trap composed of 239 places in 132 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/378 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 630 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/378 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 630 unsolved
At refinement iteration 5 (OVERLAPS) 631/1009 variables, 378/399 constraints. Problems are: Problem set: 0 solved, 630 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1009/1009 variables, and 399 constraints, problems are : Problem set: 0 solved, 630 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 378/378 constraints, PredecessorRefiner: 630/630 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 630 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/377 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 630 unsolved
At refinement iteration 1 (OVERLAPS) 1/378 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 630 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/378 variables, 11/21 constraints. Problems are: Problem set: 0 solved, 630 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/378 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 630 unsolved
At refinement iteration 4 (OVERLAPS) 631/1009 variables, 378/399 constraints. Problems are: Problem set: 0 solved, 630 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1009 variables, 630/1029 constraints. Problems are: Problem set: 0 solved, 630 unsolved
[2024-06-03 00:33:53] [INFO ] Deduced a trap composed of 221 places in 149 ms of which 3 ms to minimize.
[2024-06-03 00:33:54] [INFO ] Deduced a trap composed of 71 places in 130 ms of which 3 ms to minimize.
[2024-06-03 00:33:55] [INFO ] Deduced a trap composed of 24 places in 104 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1009/1009 variables, and 1032 constraints, problems are : Problem set: 0 solved, 630 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 378/378 constraints, PredecessorRefiner: 630/630 constraints, Known Traps: 14/14 constraints]
After SMT, in 60289ms problems are : Problem set: 0 solved, 630 unsolved
Search for dead transitions found 0 dead transitions in 60296ms
Starting structural reductions in LTL mode, iteration 1 : 378/411 places, 631/688 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60911 ms. Remains : 378/411 places, 631/688 transitions.
Stuttering acceptance computed with spot in 171 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), true]
Running random walk in product with property : FireWire-PT-20-LTLFireability-07
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA FireWire-PT-20-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-20-LTLFireability-07 finished in 61106 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(X(F(p0)))))'
Support contains 2 out of 411 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 411/411 places, 688/688 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 396 transition count 668
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 396 transition count 668
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 31 place count 396 transition count 667
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 36 place count 391 transition count 658
Iterating global reduction 1 with 5 rules applied. Total rules applied 41 place count 391 transition count 658
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 43 place count 389 transition count 655
Iterating global reduction 1 with 2 rules applied. Total rules applied 45 place count 389 transition count 655
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 46 place count 388 transition count 652
Iterating global reduction 1 with 1 rules applied. Total rules applied 47 place count 388 transition count 652
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 48 place count 387 transition count 650
Iterating global reduction 1 with 1 rules applied. Total rules applied 49 place count 387 transition count 650
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 50 place count 386 transition count 647
Iterating global reduction 1 with 1 rules applied. Total rules applied 51 place count 386 transition count 647
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 52 place count 385 transition count 645
Iterating global reduction 1 with 1 rules applied. Total rules applied 53 place count 385 transition count 645
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 54 place count 384 transition count 643
Iterating global reduction 1 with 1 rules applied. Total rules applied 55 place count 384 transition count 643
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 56 place count 383 transition count 641
Iterating global reduction 1 with 1 rules applied. Total rules applied 57 place count 383 transition count 641
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 58 place count 382 transition count 640
Iterating global reduction 1 with 1 rules applied. Total rules applied 59 place count 382 transition count 640
Applied a total of 59 rules in 42 ms. Remains 382 /411 variables (removed 29) and now considering 640/688 (removed 48) transitions.
// Phase 1: matrix 640 rows 382 cols
[2024-06-03 00:34:08] [INFO ] Computed 10 invariants in 5 ms
[2024-06-03 00:34:08] [INFO ] Implicit Places using invariants in 136 ms returned []
[2024-06-03 00:34:08] [INFO ] Invariant cache hit.
[2024-06-03 00:34:09] [INFO ] Implicit Places using invariants and state equation in 338 ms returned []
Implicit Place search using SMT with State Equation took 474 ms to find 0 implicit places.
Running 639 sub problems to find dead transitions.
[2024-06-03 00:34:09] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/381 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 639 unsolved
At refinement iteration 1 (OVERLAPS) 1/382 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 639 unsolved
[2024-06-03 00:34:16] [INFO ] Deduced a trap composed of 270 places in 136 ms of which 3 ms to minimize.
[2024-06-03 00:34:16] [INFO ] Deduced a trap composed of 233 places in 124 ms of which 2 ms to minimize.
[2024-06-03 00:34:16] [INFO ] Deduced a trap composed of 43 places in 126 ms of which 2 ms to minimize.
[2024-06-03 00:34:17] [INFO ] Deduced a trap composed of 77 places in 50 ms of which 1 ms to minimize.
[2024-06-03 00:34:17] [INFO ] Deduced a trap composed of 76 places in 48 ms of which 4 ms to minimize.
[2024-06-03 00:34:18] [INFO ] Deduced a trap composed of 79 places in 60 ms of which 1 ms to minimize.
[2024-06-03 00:34:18] [INFO ] Deduced a trap composed of 77 places in 52 ms of which 1 ms to minimize.
[2024-06-03 00:34:18] [INFO ] Deduced a trap composed of 89 places in 48 ms of which 1 ms to minimize.
[2024-06-03 00:34:19] [INFO ] Deduced a trap composed of 56 places in 108 ms of which 2 ms to minimize.
[2024-06-03 00:34:21] [INFO ] Deduced a trap composed of 77 places in 126 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/382 variables, 10/20 constraints. Problems are: Problem set: 0 solved, 639 unsolved
[2024-06-03 00:34:22] [INFO ] Deduced a trap composed of 79 places in 78 ms of which 1 ms to minimize.
[2024-06-03 00:34:24] [INFO ] Deduced a trap composed of 78 places in 52 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/382 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 639 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/382 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 639 unsolved
At refinement iteration 5 (OVERLAPS) 640/1022 variables, 382/404 constraints. Problems are: Problem set: 0 solved, 639 unsolved
[2024-06-03 00:34:38] [INFO ] Deduced a trap composed of 88 places in 143 ms of which 3 ms to minimize.
[2024-06-03 00:34:39] [INFO ] Deduced a trap composed of 102 places in 110 ms of which 2 ms to minimize.
SMT process timed out in 30349ms, After SMT, problems are : Problem set: 0 solved, 639 unsolved
Search for dead transitions found 0 dead transitions in 30355ms
Starting structural reductions in LTL mode, iteration 1 : 382/411 places, 640/688 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30875 ms. Remains : 382/411 places, 640/688 transitions.
Stuttering acceptance computed with spot in 154 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : FireWire-PT-20-LTLFireability-08
Product exploration explored 100000 steps with 25000 reset in 125 ms.
Product exploration explored 100000 steps with 25000 reset in 134 ms.
Computed a total of 89 stabilizing places and 118 stable transitions
Computed a total of 89 stabilizing places and 118 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 71 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 157 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (12 resets) in 79 ms. (500 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40000 steps (19 resets) in 38 ms. (1025 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1331651 steps, run timeout after 3001 ms. (steps per millisecond=443 ) properties seen :0 out of 1
Probabilistic random walk after 1331651 steps, saw 216199 distinct states, run finished after 3001 ms. (steps per millisecond=443 ) properties seen :0
[2024-06-03 00:34:43] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 123/125 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 221/346 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/346 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 604/950 variables, 346/356 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/950 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 36/986 variables, 18/374 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/986 variables, 0/374 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 24/1010 variables, 9/383 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1010 variables, 0/383 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 12/1022 variables, 9/392 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1022 variables, 0/392 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/1022 variables, 0/392 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1022/1022 variables, and 392 constraints, problems are : Problem set: 0 solved, 1 unsolved in 248 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 382/382 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 123/125 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 221/346 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/346 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 604/950 variables, 346/356 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/950 variables, 1/357 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/950 variables, 0/357 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 36/986 variables, 18/375 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/986 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 24/1010 variables, 9/384 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1010 variables, 0/384 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 12/1022 variables, 9/393 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1022 variables, 0/393 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/1022 variables, 0/393 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1022/1022 variables, and 393 constraints, problems are : Problem set: 0 solved, 1 unsolved in 330 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 382/382 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 585ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 14 ms.
Support contains 2 out of 382 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 382/382 places, 640/640 transitions.
Graph (trivial) has 282 edges and 382 vertex of which 11 / 382 are part of one of the 3 SCC in 1 ms
Free SCC test removed 8 places
Drop transitions (Empty/Sink Transition effects.) removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 53 transitions
Trivial Post-agglo rules discarded 53 transitions
Performed 53 trivial Post agglomeration. Transition count delta: 53
Iterating post reduction 0 with 53 rules applied. Total rules applied 54 place count 374 transition count 572
Reduce places removed 53 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 60 rules applied. Total rules applied 114 place count 321 transition count 565
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 117 place count 318 transition count 565
Performed 41 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 41 Pre rules applied. Total rules applied 117 place count 318 transition count 524
Deduced a syphon composed of 41 places in 1 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 3 with 82 rules applied. Total rules applied 199 place count 277 transition count 524
Performed 34 Post agglomeration using F-continuation condition.Transition count delta: 34
Deduced a syphon composed of 34 places in 1 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 3 with 68 rules applied. Total rules applied 267 place count 243 transition count 490
Performed 45 Post agglomeration using F-continuation condition with reduction of 9 identical transitions.
Deduced a syphon composed of 45 places in 0 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 3 with 90 rules applied. Total rules applied 357 place count 198 transition count 589
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 360 place count 198 transition count 586
Free-agglomeration rule applied 20 times.
Iterating global reduction 3 with 20 rules applied. Total rules applied 380 place count 198 transition count 566
Reduce places removed 20 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 3 with 29 rules applied. Total rules applied 409 place count 178 transition count 557
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 415 place count 172 transition count 551
Iterating global reduction 4 with 6 rules applied. Total rules applied 421 place count 172 transition count 551
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 4 with 9 rules applied. Total rules applied 430 place count 172 transition count 542
Drop transitions (Redundant composition of simpler transitions.) removed 27 transitions
Redundant transition composition rules discarded 27 transitions
Iterating global reduction 5 with 27 rules applied. Total rules applied 457 place count 172 transition count 515
Applied a total of 457 rules in 44 ms. Remains 172 /382 variables (removed 210) and now considering 515/640 (removed 125) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44 ms. Remains : 172/382 places, 515/640 transitions.
RANDOM walk for 30817 steps (1001 resets) in 99 ms. (308 steps per ms) remains 0/1 properties
Knowledge obtained : [p0]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 1 factoid took 79 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 131 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 126 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 382 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 382/382 places, 640/640 transitions.
Applied a total of 0 rules in 7 ms. Remains 382 /382 variables (removed 0) and now considering 640/640 (removed 0) transitions.
[2024-06-03 00:34:44] [INFO ] Invariant cache hit.
[2024-06-03 00:34:44] [INFO ] Implicit Places using invariants in 139 ms returned []
[2024-06-03 00:34:44] [INFO ] Invariant cache hit.
[2024-06-03 00:34:44] [INFO ] Implicit Places using invariants and state equation in 348 ms returned []
Implicit Place search using SMT with State Equation took 488 ms to find 0 implicit places.
Running 639 sub problems to find dead transitions.
[2024-06-03 00:34:44] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/381 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 639 unsolved
At refinement iteration 1 (OVERLAPS) 1/382 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 639 unsolved
[2024-06-03 00:34:52] [INFO ] Deduced a trap composed of 270 places in 142 ms of which 2 ms to minimize.
[2024-06-03 00:34:52] [INFO ] Deduced a trap composed of 233 places in 146 ms of which 2 ms to minimize.
[2024-06-03 00:34:52] [INFO ] Deduced a trap composed of 43 places in 149 ms of which 2 ms to minimize.
[2024-06-03 00:34:52] [INFO ] Deduced a trap composed of 77 places in 62 ms of which 1 ms to minimize.
[2024-06-03 00:34:52] [INFO ] Deduced a trap composed of 76 places in 58 ms of which 1 ms to minimize.
[2024-06-03 00:34:53] [INFO ] Deduced a trap composed of 79 places in 60 ms of which 1 ms to minimize.
[2024-06-03 00:34:54] [INFO ] Deduced a trap composed of 77 places in 64 ms of which 0 ms to minimize.
[2024-06-03 00:34:54] [INFO ] Deduced a trap composed of 89 places in 63 ms of which 0 ms to minimize.
[2024-06-03 00:34:55] [INFO ] Deduced a trap composed of 56 places in 121 ms of which 2 ms to minimize.
[2024-06-03 00:34:57] [INFO ] Deduced a trap composed of 77 places in 131 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/382 variables, 10/20 constraints. Problems are: Problem set: 0 solved, 639 unsolved
[2024-06-03 00:34:58] [INFO ] Deduced a trap composed of 79 places in 117 ms of which 2 ms to minimize.
[2024-06-03 00:35:00] [INFO ] Deduced a trap composed of 78 places in 72 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/382 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 639 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/382 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 639 unsolved
At refinement iteration 5 (OVERLAPS) 640/1022 variables, 382/404 constraints. Problems are: Problem set: 0 solved, 639 unsolved
[2024-06-03 00:35:13] [INFO ] Deduced a trap composed of 88 places in 146 ms of which 2 ms to minimize.
[2024-06-03 00:35:14] [INFO ] Deduced a trap composed of 102 places in 127 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1022/1022 variables, and 406 constraints, problems are : Problem set: 0 solved, 639 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 382/382 constraints, PredecessorRefiner: 639/639 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 639 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/381 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 639 unsolved
At refinement iteration 1 (OVERLAPS) 1/382 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 639 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/382 variables, 14/24 constraints. Problems are: Problem set: 0 solved, 639 unsolved
[2024-06-03 00:35:20] [INFO ] Deduced a trap composed of 97 places in 52 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/382 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 639 unsolved
[2024-06-03 00:35:24] [INFO ] Deduced a trap composed of 61 places in 128 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/382 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 639 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/382 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 639 unsolved
At refinement iteration 6 (OVERLAPS) 640/1022 variables, 382/408 constraints. Problems are: Problem set: 0 solved, 639 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1022 variables, 639/1047 constraints. Problems are: Problem set: 0 solved, 639 unsolved
[2024-06-03 00:35:40] [INFO ] Deduced a trap composed of 113 places in 171 ms of which 3 ms to minimize.
[2024-06-03 00:35:40] [INFO ] Deduced a trap composed of 111 places in 146 ms of which 2 ms to minimize.
[2024-06-03 00:35:41] [INFO ] Deduced a trap composed of 30 places in 101 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1022/1022 variables, and 1050 constraints, problems are : Problem set: 0 solved, 639 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 382/382 constraints, PredecessorRefiner: 639/639 constraints, Known Traps: 19/19 constraints]
After SMT, in 60263ms problems are : Problem set: 0 solved, 639 unsolved
Search for dead transitions found 0 dead transitions in 60269ms
Finished structural reductions in LTL mode , in 1 iterations and 60767 ms. Remains : 382/382 places, 640/640 transitions.
Computed a total of 89 stabilizing places and 118 stable transitions
Computed a total of 89 stabilizing places and 118 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 91 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 134 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (41 resets) in 70 ms. (563 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40000 steps (10 resets) in 61 ms. (645 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1309687 steps, run timeout after 3001 ms. (steps per millisecond=436 ) properties seen :0 out of 1
Probabilistic random walk after 1309687 steps, saw 212772 distinct states, run finished after 3001 ms. (steps per millisecond=436 ) properties seen :0
[2024-06-03 00:35:48] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 123/125 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 221/346 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/346 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 604/950 variables, 346/356 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/950 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 36/986 variables, 18/374 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/986 variables, 0/374 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 24/1010 variables, 9/383 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1010 variables, 0/383 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 12/1022 variables, 9/392 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1022 variables, 0/392 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/1022 variables, 0/392 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1022/1022 variables, and 392 constraints, problems are : Problem set: 0 solved, 1 unsolved in 267 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 382/382 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 123/125 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 221/346 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/346 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 604/950 variables, 346/356 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/950 variables, 1/357 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/950 variables, 0/357 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 36/986 variables, 18/375 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/986 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 24/1010 variables, 9/384 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1010 variables, 0/384 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 12/1022 variables, 9/393 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1022 variables, 0/393 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/1022 variables, 0/393 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1022/1022 variables, and 393 constraints, problems are : Problem set: 0 solved, 1 unsolved in 302 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 382/382 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 597ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 12 ms.
Support contains 2 out of 382 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 382/382 places, 640/640 transitions.
Graph (trivial) has 282 edges and 382 vertex of which 11 / 382 are part of one of the 3 SCC in 0 ms
Free SCC test removed 8 places
Drop transitions (Empty/Sink Transition effects.) removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 53 transitions
Trivial Post-agglo rules discarded 53 transitions
Performed 53 trivial Post agglomeration. Transition count delta: 53
Iterating post reduction 0 with 53 rules applied. Total rules applied 54 place count 374 transition count 572
Reduce places removed 53 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 60 rules applied. Total rules applied 114 place count 321 transition count 565
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 117 place count 318 transition count 565
Performed 41 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 41 Pre rules applied. Total rules applied 117 place count 318 transition count 524
Deduced a syphon composed of 41 places in 0 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 3 with 82 rules applied. Total rules applied 199 place count 277 transition count 524
Performed 34 Post agglomeration using F-continuation condition.Transition count delta: 34
Deduced a syphon composed of 34 places in 1 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 3 with 68 rules applied. Total rules applied 267 place count 243 transition count 490
Performed 45 Post agglomeration using F-continuation condition with reduction of 9 identical transitions.
Deduced a syphon composed of 45 places in 0 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 3 with 90 rules applied. Total rules applied 357 place count 198 transition count 589
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 360 place count 198 transition count 586
Free-agglomeration rule applied 20 times.
Iterating global reduction 3 with 20 rules applied. Total rules applied 380 place count 198 transition count 566
Reduce places removed 20 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 3 with 29 rules applied. Total rules applied 409 place count 178 transition count 557
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 415 place count 172 transition count 551
Iterating global reduction 4 with 6 rules applied. Total rules applied 421 place count 172 transition count 551
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 4 with 9 rules applied. Total rules applied 430 place count 172 transition count 542
Drop transitions (Redundant composition of simpler transitions.) removed 27 transitions
Redundant transition composition rules discarded 27 transitions
Iterating global reduction 5 with 27 rules applied. Total rules applied 457 place count 172 transition count 515
Applied a total of 457 rules in 40 ms. Remains 172 /382 variables (removed 210) and now considering 515/640 (removed 125) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40 ms. Remains : 172/382 places, 515/640 transitions.
RANDOM walk for 40000 steps (1292 resets) in 135 ms. (294 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (243 resets) in 32 ms. (1212 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 329593 steps, run visited all 1 properties in 974 ms. (steps per millisecond=338 )
Probabilistic random walk after 329593 steps, saw 106119 distinct states, run finished after 979 ms. (steps per millisecond=336 ) properties seen :1
Knowledge obtained : [p0]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 1 factoid took 96 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 142 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 133 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 212 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 25000 reset in 118 ms.
Product exploration explored 100000 steps with 25000 reset in 126 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 159 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 382 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 382/382 places, 640/640 transitions.
Graph (trivial) has 282 edges and 382 vertex of which 11 / 382 are part of one of the 3 SCC in 0 ms
Free SCC test removed 8 places
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Performed 53 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 53 rules applied. Total rules applied 54 place count 374 transition count 631
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 58 place count 374 transition count 627
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 25 Pre rules applied. Total rules applied 58 place count 374 transition count 661
Deduced a syphon composed of 78 places in 1 ms
Iterating global reduction 2 with 25 rules applied. Total rules applied 83 place count 374 transition count 661
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 89 place count 368 transition count 655
Deduced a syphon composed of 72 places in 0 ms
Iterating global reduction 2 with 6 rules applied. Total rules applied 95 place count 368 transition count 655
Performed 49 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 121 places in 1 ms
Iterating global reduction 2 with 49 rules applied. Total rules applied 144 place count 368 transition count 674
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 160 place count 352 transition count 658
Deduced a syphon composed of 105 places in 0 ms
Iterating global reduction 2 with 16 rules applied. Total rules applied 176 place count 352 transition count 658
Performed 49 Post agglomeration using F-continuation condition with reduction of 9 identical transitions.
Deduced a syphon composed of 154 places in 1 ms
Iterating global reduction 2 with 49 rules applied. Total rules applied 225 place count 352 transition count 954
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 228 place count 352 transition count 951
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 235 place count 345 transition count 937
Deduced a syphon composed of 147 places in 0 ms
Iterating global reduction 3 with 7 rules applied. Total rules applied 242 place count 345 transition count 937
Deduced a syphon composed of 147 places in 1 ms
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 245 place count 345 transition count 934
Deduced a syphon composed of 147 places in 0 ms
Applied a total of 245 rules in 52 ms. Remains 345 /382 variables (removed 37) and now considering 934/640 (removed -294) transitions.
[2024-06-03 00:35:51] [INFO ] Redundant transitions in 12 ms returned []
Running 926 sub problems to find dead transitions.
[2024-06-03 00:35:51] [INFO ] Flow matrix only has 905 transitions (discarded 29 similar events)
// Phase 1: matrix 905 rows 345 cols
[2024-06-03 00:35:51] [INFO ] Computed 10 invariants in 12 ms
[2024-06-03 00:35:51] [INFO ] State equation strengthened by 13 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/344 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 926 unsolved
At refinement iteration 1 (OVERLAPS) 1/345 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 926 unsolved
[2024-06-03 00:36:01] [INFO ] Deduced a trap composed of 46 places in 53 ms of which 1 ms to minimize.
Problem TDEAD2 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
[2024-06-03 00:36:01] [INFO ] Deduced a trap composed of 7 places in 34 ms of which 1 ms to minimize.
Problem TDEAD26 is UNSAT
Problem TDEAD28 is UNSAT
[2024-06-03 00:36:01] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 1 ms to minimize.
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
[2024-06-03 00:36:01] [INFO ] Deduced a trap composed of 46 places in 53 ms of which 1 ms to minimize.
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD62 is UNSAT
[2024-06-03 00:36:01] [INFO ] Deduced a trap composed of 7 places in 35 ms of which 1 ms to minimize.
Problem TDEAD63 is UNSAT
Problem TDEAD65 is UNSAT
[2024-06-03 00:36:01] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
Problem TDEAD66 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD68 is UNSAT
[2024-06-03 00:36:02] [INFO ] Deduced a trap composed of 49 places in 54 ms of which 1 ms to minimize.
[2024-06-03 00:36:02] [INFO ] Deduced a trap composed of 50 places in 58 ms of which 1 ms to minimize.
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD99 is UNSAT
[2024-06-03 00:36:02] [INFO ] Deduced a trap composed of 7 places in 46 ms of which 1 ms to minimize.
Problem TDEAD100 is UNSAT
Problem TDEAD102 is UNSAT
[2024-06-03 00:36:02] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 1 ms to minimize.
Problem TDEAD103 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD105 is UNSAT
[2024-06-03 00:36:02] [INFO ] Deduced a trap composed of 68 places in 128 ms of which 2 ms to minimize.
[2024-06-03 00:36:02] [INFO ] Deduced a trap composed of 20 places in 128 ms of which 2 ms to minimize.
Problem TDEAD111 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD127 is UNSAT
[2024-06-03 00:36:02] [INFO ] Deduced a trap composed of 31 places in 144 ms of which 2 ms to minimize.
Problem TDEAD155 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD176 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD244 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD248 is UNSAT
Problem TDEAD249 is UNSAT
Problem TDEAD277 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD285 is UNSAT
Problem TDEAD289 is UNSAT
Problem TDEAD294 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD302 is UNSAT
Problem TDEAD304 is UNSAT
Problem TDEAD305 is UNSAT
Problem TDEAD306 is UNSAT
Problem TDEAD307 is UNSAT
Problem TDEAD308 is UNSAT
Problem TDEAD309 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD311 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD315 is UNSAT
Problem TDEAD316 is UNSAT
Problem TDEAD317 is UNSAT
Problem TDEAD318 is UNSAT
Problem TDEAD319 is UNSAT
Problem TDEAD320 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD323 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD325 is UNSAT
Problem TDEAD326 is UNSAT
Problem TDEAD327 is UNSAT
Problem TDEAD328 is UNSAT
[2024-06-03 00:36:04] [INFO ] Deduced a trap composed of 40 places in 54 ms of which 1 ms to minimize.
[2024-06-03 00:36:04] [INFO ] Deduced a trap composed of 40 places in 62 ms of which 1 ms to minimize.
[2024-06-03 00:36:04] [INFO ] Deduced a trap composed of 40 places in 65 ms of which 1 ms to minimize.
[2024-06-03 00:36:04] [INFO ] Deduced a trap composed of 23 places in 159 ms of which 2 ms to minimize.
Problem TDEAD375 is UNSAT
Problem TDEAD376 is UNSAT
Problem TDEAD377 is UNSAT
Problem TDEAD379 is UNSAT
Problem TDEAD380 is UNSAT
Problem TDEAD381 is UNSAT
Problem TDEAD382 is UNSAT
[2024-06-03 00:36:04] [INFO ] Deduced a trap composed of 54 places in 138 ms of which 1 ms to minimize.
Problem TDEAD391 is UNSAT
Problem TDEAD392 is UNSAT
Problem TDEAD393 is UNSAT
Problem TDEAD394 is UNSAT
Problem TDEAD395 is UNSAT
Problem TDEAD402 is UNSAT
Problem TDEAD403 is UNSAT
Problem TDEAD404 is UNSAT
Problem TDEAD410 is UNSAT
Problem TDEAD411 is UNSAT
Problem TDEAD412 is UNSAT
Problem TDEAD414 is UNSAT
Problem TDEAD415 is UNSAT
Problem TDEAD416 is UNSAT
Problem TDEAD417 is UNSAT
Problem TDEAD426 is UNSAT
Problem TDEAD427 is UNSAT
Problem TDEAD428 is UNSAT
Problem TDEAD429 is UNSAT
Problem TDEAD430 is UNSAT
Problem TDEAD437 is UNSAT
Problem TDEAD438 is UNSAT
Problem TDEAD439 is UNSAT
Problem TDEAD445 is UNSAT
Problem TDEAD446 is UNSAT
Problem TDEAD447 is UNSAT
Problem TDEAD449 is UNSAT
Problem TDEAD450 is UNSAT
Problem TDEAD451 is UNSAT
Problem TDEAD452 is UNSAT
Problem TDEAD461 is UNSAT
Problem TDEAD462 is UNSAT
Problem TDEAD463 is UNSAT
Problem TDEAD464 is UNSAT
Problem TDEAD465 is UNSAT
Problem TDEAD472 is UNSAT
Problem TDEAD473 is UNSAT
Problem TDEAD474 is UNSAT
Problem TDEAD488 is UNSAT
Problem TDEAD489 is UNSAT
Problem TDEAD490 is UNSAT
Problem TDEAD491 is UNSAT
Problem TDEAD492 is UNSAT
Problem TDEAD493 is UNSAT
Problem TDEAD494 is UNSAT
Problem TDEAD498 is UNSAT
Problem TDEAD499 is UNSAT
Problem TDEAD500 is UNSAT
Problem TDEAD504 is UNSAT
Problem TDEAD505 is UNSAT
Problem TDEAD506 is UNSAT
Problem TDEAD507 is UNSAT
Problem TDEAD514 is UNSAT
Problem TDEAD515 is UNSAT
Problem TDEAD516 is UNSAT
Problem TDEAD517 is UNSAT
Problem TDEAD546 is UNSAT
Problem TDEAD547 is UNSAT
Problem TDEAD548 is UNSAT
Problem TDEAD549 is UNSAT
Problem TDEAD550 is UNSAT
Problem TDEAD551 is UNSAT
Problem TDEAD584 is UNSAT
Problem TDEAD585 is UNSAT
Problem TDEAD586 is UNSAT
Problem TDEAD587 is UNSAT
Problem TDEAD606 is UNSAT
Problem TDEAD607 is UNSAT
Problem TDEAD608 is UNSAT
Problem TDEAD609 is UNSAT
Problem TDEAD610 is UNSAT
Problem TDEAD611 is UNSAT
Problem TDEAD612 is UNSAT
Problem TDEAD613 is UNSAT
Problem TDEAD614 is UNSAT
Problem TDEAD615 is UNSAT
Problem TDEAD616 is UNSAT
Problem TDEAD617 is UNSAT
Problem TDEAD630 is UNSAT
Problem TDEAD631 is UNSAT
Problem TDEAD632 is UNSAT
Problem TDEAD633 is UNSAT
Problem TDEAD634 is UNSAT
Problem TDEAD635 is UNSAT
Problem TDEAD636 is UNSAT
Problem TDEAD637 is UNSAT
Problem TDEAD638 is UNSAT
Problem TDEAD639 is UNSAT
Problem TDEAD640 is UNSAT
Problem TDEAD644 is UNSAT
Problem TDEAD645 is UNSAT
Problem TDEAD646 is UNSAT
Problem TDEAD650 is UNSAT
Problem TDEAD651 is UNSAT
Problem TDEAD652 is UNSAT
Problem TDEAD653 is UNSAT
Problem TDEAD660 is UNSAT
Problem TDEAD661 is UNSAT
Problem TDEAD662 is UNSAT
Problem TDEAD663 is UNSAT
Problem TDEAD692 is UNSAT
Problem TDEAD693 is UNSAT
Problem TDEAD694 is UNSAT
Problem TDEAD695 is UNSAT
Problem TDEAD696 is UNSAT
Problem TDEAD697 is UNSAT
Problem TDEAD730 is UNSAT
Problem TDEAD731 is UNSAT
Problem TDEAD732 is UNSAT
Problem TDEAD733 is UNSAT
Problem TDEAD752 is UNSAT
Problem TDEAD753 is UNSAT
Problem TDEAD754 is UNSAT
Problem TDEAD755 is UNSAT
Problem TDEAD756 is UNSAT
Problem TDEAD757 is UNSAT
Problem TDEAD758 is UNSAT
Problem TDEAD759 is UNSAT
Problem TDEAD760 is UNSAT
Problem TDEAD761 is UNSAT
Problem TDEAD762 is UNSAT
Problem TDEAD763 is UNSAT
Problem TDEAD776 is UNSAT
Problem TDEAD777 is UNSAT
Problem TDEAD778 is UNSAT
Problem TDEAD779 is UNSAT
Problem TDEAD780 is UNSAT
Problem TDEAD781 is UNSAT
Problem TDEAD782 is UNSAT
Problem TDEAD783 is UNSAT
Problem TDEAD784 is UNSAT
Problem TDEAD785 is UNSAT
Problem TDEAD786 is UNSAT
Problem TDEAD787 is UNSAT
Problem TDEAD796 is UNSAT
Problem TDEAD797 is UNSAT
Problem TDEAD798 is UNSAT
Problem TDEAD802 is UNSAT
Problem TDEAD803 is UNSAT
Problem TDEAD804 is UNSAT
Problem TDEAD808 is UNSAT
Problem TDEAD809 is UNSAT
Problem TDEAD810 is UNSAT
Problem TDEAD811 is UNSAT
Problem TDEAD818 is UNSAT
Problem TDEAD819 is UNSAT
Problem TDEAD820 is UNSAT
Problem TDEAD821 is UNSAT
Problem TDEAD850 is UNSAT
Problem TDEAD851 is UNSAT
Problem TDEAD852 is UNSAT
Problem TDEAD853 is UNSAT
Problem TDEAD854 is UNSAT
Problem TDEAD855 is UNSAT
Problem TDEAD888 is UNSAT
Problem TDEAD889 is UNSAT
Problem TDEAD890 is UNSAT
Problem TDEAD891 is UNSAT
Problem TDEAD910 is UNSAT
Problem TDEAD911 is UNSAT
Problem TDEAD912 is UNSAT
Problem TDEAD913 is UNSAT
Problem TDEAD914 is UNSAT
Problem TDEAD915 is UNSAT
Problem TDEAD916 is UNSAT
Problem TDEAD917 is UNSAT
Problem TDEAD918 is UNSAT
Problem TDEAD919 is UNSAT
Problem TDEAD920 is UNSAT
Problem TDEAD921 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/345 variables, 18/28 constraints. Problems are: Problem set: 321 solved, 605 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/345 variables, 0/28 constraints. Problems are: Problem set: 321 solved, 605 unsolved
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD351 is UNSAT
Problem TDEAD374 is UNSAT
Problem TDEAD409 is UNSAT
Problem TDEAD444 is UNSAT
At refinement iteration 4 (OVERLAPS) 904/1249 variables, 345/373 constraints. Problems are: Problem set: 342 solved, 584 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1249 variables, 12/385 constraints. Problems are: Problem set: 342 solved, 584 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1249/1250 variables, and 385 constraints, problems are : Problem set: 342 solved, 584 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 345/345 constraints, ReadFeed: 12/13 constraints, PredecessorRefiner: 926/926 constraints, Known Traps: 18/18 constraints]
Escalating to Integer solving :Problem set: 342 solved, 584 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/197 variables, 0/0 constraints. Problems are: Problem set: 342 solved, 584 unsolved
At refinement iteration 1 (OVERLAPS) 136/333 variables, 10/10 constraints. Problems are: Problem set: 342 solved, 584 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/333 variables, 18/28 constraints. Problems are: Problem set: 342 solved, 584 unsolved
[2024-06-03 00:36:26] [INFO ] Deduced a trap composed of 25 places in 146 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/333 variables, 1/29 constraints. Problems are: Problem set: 342 solved, 584 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/333 variables, 0/29 constraints. Problems are: Problem set: 342 solved, 584 unsolved
At refinement iteration 5 (OVERLAPS) 901/1234 variables, 333/362 constraints. Problems are: Problem set: 342 solved, 584 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1234 variables, 12/374 constraints. Problems are: Problem set: 342 solved, 584 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1234 variables, 584/958 constraints. Problems are: Problem set: 342 solved, 584 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1234/1250 variables, and 958 constraints, problems are : Problem set: 342 solved, 584 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 333/345 constraints, ReadFeed: 12/13 constraints, PredecessorRefiner: 584/926 constraints, Known Traps: 19/19 constraints]
After SMT, in 61082ms problems are : Problem set: 342 solved, 584 unsolved
Search for dead transitions found 342 dead transitions in 61091ms
Found 342 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 342 transitions
Dead transitions reduction (with SMT) removed 342 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 345/382 places, 592/640 transitions.
Graph (complete) has 1067 edges and 345 vertex of which 198 are kept as prefixes of interest. Removing 147 places using SCC suffix rule.0 ms
Discarding 147 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 11 ms. Remains 198 /345 variables (removed 147) and now considering 592/592 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 198/382 places, 592/640 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 61177 ms. Remains : 198/382 places, 592/640 transitions.
Built C files in :
/tmp/ltsmin11059818139138310279
[2024-06-03 00:36:52] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11059818139138310279
Running compilation step : cd /tmp/ltsmin11059818139138310279;'/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 1090 ms.
Running link step : cd /tmp/ltsmin11059818139138310279;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin11059818139138310279;'/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' '--hoa' '/tmp/stateBased10146904245499438177.hoa' '--buchi-type=spotba'
LTSmin run took 830 ms.
FORMULA FireWire-PT-20-LTLFireability-08 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property FireWire-PT-20-LTLFireability-08 finished in 165621 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 U (p1&&X(!p1))))))'
Support contains 2 out of 411 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 411/411 places, 688/688 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 397 transition count 669
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 397 transition count 669
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 29 place count 397 transition count 668
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 35 place count 391 transition count 656
Iterating global reduction 1 with 6 rules applied. Total rules applied 41 place count 391 transition count 656
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 44 place count 388 transition count 651
Iterating global reduction 1 with 3 rules applied. Total rules applied 47 place count 388 transition count 651
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 49 place count 386 transition count 646
Iterating global reduction 1 with 2 rules applied. Total rules applied 51 place count 386 transition count 646
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 53 place count 384 transition count 642
Iterating global reduction 1 with 2 rules applied. Total rules applied 55 place count 384 transition count 642
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 57 place count 382 transition count 638
Iterating global reduction 1 with 2 rules applied. Total rules applied 59 place count 382 transition count 638
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 60 place count 381 transition count 636
Iterating global reduction 1 with 1 rules applied. Total rules applied 61 place count 381 transition count 636
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 62 place count 380 transition count 634
Iterating global reduction 1 with 1 rules applied. Total rules applied 63 place count 380 transition count 634
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 64 place count 379 transition count 632
Iterating global reduction 1 with 1 rules applied. Total rules applied 65 place count 379 transition count 632
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 66 place count 378 transition count 631
Iterating global reduction 1 with 1 rules applied. Total rules applied 67 place count 378 transition count 631
Applied a total of 67 rules in 33 ms. Remains 378 /411 variables (removed 33) and now considering 631/688 (removed 57) transitions.
// Phase 1: matrix 631 rows 378 cols
[2024-06-03 00:36:54] [INFO ] Computed 10 invariants in 2 ms
[2024-06-03 00:36:54] [INFO ] Implicit Places using invariants in 236 ms returned []
[2024-06-03 00:36:54] [INFO ] Invariant cache hit.
[2024-06-03 00:36:54] [INFO ] Implicit Places using invariants and state equation in 372 ms returned []
Implicit Place search using SMT with State Equation took 636 ms to find 0 implicit places.
Running 630 sub problems to find dead transitions.
[2024-06-03 00:36:54] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/377 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 630 unsolved
At refinement iteration 1 (OVERLAPS) 1/378 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 630 unsolved
[2024-06-03 00:37:01] [INFO ] Deduced a trap composed of 252 places in 153 ms of which 2 ms to minimize.
[2024-06-03 00:37:02] [INFO ] Deduced a trap composed of 43 places in 142 ms of which 2 ms to minimize.
[2024-06-03 00:37:02] [INFO ] Deduced a trap composed of 76 places in 70 ms of which 1 ms to minimize.
[2024-06-03 00:37:02] [INFO ] Deduced a trap composed of 77 places in 73 ms of which 1 ms to minimize.
[2024-06-03 00:37:03] [INFO ] Deduced a trap composed of 78 places in 58 ms of which 0 ms to minimize.
[2024-06-03 00:37:03] [INFO ] Deduced a trap composed of 77 places in 60 ms of which 0 ms to minimize.
[2024-06-03 00:37:04] [INFO ] Deduced a trap composed of 79 places in 60 ms of which 1 ms to minimize.
[2024-06-03 00:37:05] [INFO ] Deduced a trap composed of 96 places in 124 ms of which 2 ms to minimize.
[2024-06-03 00:37:05] [INFO ] Deduced a trap composed of 56 places in 136 ms of which 2 ms to minimize.
[2024-06-03 00:37:06] [INFO ] Deduced a trap composed of 66 places in 123 ms of which 2 ms to minimize.
[2024-06-03 00:37:06] [INFO ] Deduced a trap composed of 78 places in 65 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/378 variables, 11/21 constraints. Problems are: Problem set: 0 solved, 630 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/378 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 630 unsolved
At refinement iteration 4 (OVERLAPS) 631/1009 variables, 378/399 constraints. Problems are: Problem set: 0 solved, 630 unsolved
[2024-06-03 00:37:18] [INFO ] Deduced a trap composed of 108 places in 107 ms of which 2 ms to minimize.
[2024-06-03 00:37:18] [INFO ] Deduced a trap composed of 71 places in 129 ms of which 2 ms to minimize.
[2024-06-03 00:37:19] [INFO ] Deduced a trap composed of 41 places in 130 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/1009 variables, 3/402 constraints. Problems are: Problem set: 0 solved, 630 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1009/1009 variables, and 402 constraints, problems are : Problem set: 0 solved, 630 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 378/378 constraints, PredecessorRefiner: 630/630 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 630 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/377 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 630 unsolved
At refinement iteration 1 (OVERLAPS) 1/378 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 630 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/378 variables, 14/24 constraints. Problems are: Problem set: 0 solved, 630 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/378 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 630 unsolved
At refinement iteration 4 (OVERLAPS) 631/1009 variables, 378/402 constraints. Problems are: Problem set: 0 solved, 630 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1009 variables, 630/1032 constraints. Problems are: Problem set: 0 solved, 630 unsolved
[2024-06-03 00:37:38] [INFO ] Deduced a trap composed of 23 places in 109 ms of which 2 ms to minimize.
[2024-06-03 00:37:39] [INFO ] Deduced a trap composed of 264 places in 139 ms of which 3 ms to minimize.
[2024-06-03 00:37:39] [INFO ] Deduced a trap composed of 254 places in 140 ms of which 3 ms to minimize.
[2024-06-03 00:37:41] [INFO ] Deduced a trap composed of 122 places in 137 ms of which 2 ms to minimize.
[2024-06-03 00:37:44] [INFO ] Deduced a trap composed of 241 places in 134 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1009/1009 variables, and 1037 constraints, problems are : Problem set: 0 solved, 630 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 378/378 constraints, PredecessorRefiner: 630/630 constraints, Known Traps: 19/19 constraints]
After SMT, in 60228ms problems are : Problem set: 0 solved, 630 unsolved
Search for dead transitions found 0 dead transitions in 60233ms
Starting structural reductions in LTL mode, iteration 1 : 378/411 places, 631/688 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60903 ms. Remains : 378/411 places, 631/688 transitions.
Stuttering acceptance computed with spot in 182 ms :[true, true, p1, p1]
Running random walk in product with property : FireWire-PT-20-LTLFireability-11
Stuttering criterion allowed to conclude after 153 steps with 0 reset in 1 ms.
FORMULA FireWire-PT-20-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-20-LTLFireability-11 finished in 61102 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)&&(p1||G(p2)))))'
Support contains 5 out of 411 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 411/411 places, 688/688 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 396 transition count 668
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 396 transition count 668
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 31 place count 396 transition count 667
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 37 place count 390 transition count 655
Iterating global reduction 1 with 6 rules applied. Total rules applied 43 place count 390 transition count 655
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 46 place count 387 transition count 650
Iterating global reduction 1 with 3 rules applied. Total rules applied 49 place count 387 transition count 650
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 51 place count 385 transition count 645
Iterating global reduction 1 with 2 rules applied. Total rules applied 53 place count 385 transition count 645
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 54 place count 384 transition count 643
Iterating global reduction 1 with 1 rules applied. Total rules applied 55 place count 384 transition count 643
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 56 place count 383 transition count 642
Iterating global reduction 1 with 1 rules applied. Total rules applied 57 place count 383 transition count 642
Applied a total of 57 rules in 29 ms. Remains 383 /411 variables (removed 28) and now considering 642/688 (removed 46) transitions.
// Phase 1: matrix 642 rows 383 cols
[2024-06-03 00:37:55] [INFO ] Computed 10 invariants in 5 ms
[2024-06-03 00:37:55] [INFO ] Implicit Places using invariants in 122 ms returned []
[2024-06-03 00:37:55] [INFO ] Invariant cache hit.
[2024-06-03 00:37:55] [INFO ] Implicit Places using invariants and state equation in 324 ms returned []
Implicit Place search using SMT with State Equation took 448 ms to find 0 implicit places.
Running 641 sub problems to find dead transitions.
[2024-06-03 00:37:55] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/382 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 641 unsolved
At refinement iteration 1 (OVERLAPS) 1/383 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 641 unsolved
[2024-06-03 00:38:03] [INFO ] Deduced a trap composed of 237 places in 140 ms of which 2 ms to minimize.
[2024-06-03 00:38:03] [INFO ] Deduced a trap composed of 43 places in 134 ms of which 2 ms to minimize.
[2024-06-03 00:38:03] [INFO ] Deduced a trap composed of 220 places in 133 ms of which 2 ms to minimize.
[2024-06-03 00:38:03] [INFO ] Deduced a trap composed of 79 places in 126 ms of which 2 ms to minimize.
[2024-06-03 00:38:03] [INFO ] Deduced a trap composed of 78 places in 123 ms of which 2 ms to minimize.
[2024-06-03 00:38:03] [INFO ] Deduced a trap composed of 221 places in 123 ms of which 2 ms to minimize.
[2024-06-03 00:38:04] [INFO ] Deduced a trap composed of 223 places in 130 ms of which 2 ms to minimize.
[2024-06-03 00:38:04] [INFO ] Deduced a trap composed of 229 places in 128 ms of which 2 ms to minimize.
[2024-06-03 00:38:04] [INFO ] Deduced a trap composed of 77 places in 76 ms of which 1 ms to minimize.
[2024-06-03 00:38:04] [INFO ] Deduced a trap composed of 76 places in 77 ms of which 2 ms to minimize.
[2024-06-03 00:38:04] [INFO ] Deduced a trap composed of 218 places in 119 ms of which 2 ms to minimize.
[2024-06-03 00:38:05] [INFO ] Deduced a trap composed of 88 places in 138 ms of which 2 ms to minimize.
[2024-06-03 00:38:05] [INFO ] Deduced a trap composed of 217 places in 121 ms of which 2 ms to minimize.
[2024-06-03 00:38:06] [INFO ] Deduced a trap composed of 222 places in 126 ms of which 2 ms to minimize.
[2024-06-03 00:38:07] [INFO ] Deduced a trap composed of 219 places in 115 ms of which 2 ms to minimize.
[2024-06-03 00:38:07] [INFO ] Deduced a trap composed of 226 places in 124 ms of which 2 ms to minimize.
[2024-06-03 00:38:07] [INFO ] Deduced a trap composed of 78 places in 129 ms of which 3 ms to minimize.
[2024-06-03 00:38:07] [INFO ] Deduced a trap composed of 223 places in 123 ms of which 2 ms to minimize.
[2024-06-03 00:38:07] [INFO ] Deduced a trap composed of 222 places in 124 ms of which 2 ms to minimize.
[2024-06-03 00:38:08] [INFO ] Deduced a trap composed of 77 places in 127 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/383 variables, 20/30 constraints. Problems are: Problem set: 0 solved, 641 unsolved
[2024-06-03 00:38:08] [INFO ] Deduced a trap composed of 230 places in 125 ms of which 3 ms to minimize.
[2024-06-03 00:38:08] [INFO ] Deduced a trap composed of 225 places in 124 ms of which 2 ms to minimize.
[2024-06-03 00:38:09] [INFO ] Deduced a trap composed of 222 places in 129 ms of which 2 ms to minimize.
[2024-06-03 00:38:09] [INFO ] Deduced a trap composed of 78 places in 44 ms of which 1 ms to minimize.
[2024-06-03 00:38:10] [INFO ] Deduced a trap composed of 79 places in 46 ms of which 1 ms to minimize.
[2024-06-03 00:38:10] [INFO ] Deduced a trap composed of 220 places in 123 ms of which 2 ms to minimize.
[2024-06-03 00:38:11] [INFO ] Deduced a trap composed of 246 places in 118 ms of which 2 ms to minimize.
[2024-06-03 00:38:11] [INFO ] Deduced a trap composed of 106 places in 122 ms of which 2 ms to minimize.
[2024-06-03 00:38:11] [INFO ] Deduced a trap composed of 61 places in 118 ms of which 2 ms to minimize.
[2024-06-03 00:38:13] [INFO ] Deduced a trap composed of 56 places in 121 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/383 variables, 10/40 constraints. Problems are: Problem set: 0 solved, 641 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/383 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 641 unsolved
At refinement iteration 5 (OVERLAPS) 642/1025 variables, 383/423 constraints. Problems are: Problem set: 0 solved, 641 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1025/1025 variables, and 423 constraints, problems are : Problem set: 0 solved, 641 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 383/383 constraints, PredecessorRefiner: 641/641 constraints, Known Traps: 30/30 constraints]
Escalating to Integer solving :Problem set: 0 solved, 641 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/382 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 641 unsolved
At refinement iteration 1 (OVERLAPS) 1/383 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 641 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/383 variables, 30/40 constraints. Problems are: Problem set: 0 solved, 641 unsolved
[2024-06-03 00:38:32] [INFO ] Deduced a trap composed of 92 places in 127 ms of which 2 ms to minimize.
[2024-06-03 00:38:32] [INFO ] Deduced a trap composed of 92 places in 116 ms of which 2 ms to minimize.
[2024-06-03 00:38:32] [INFO ] Deduced a trap composed of 218 places in 122 ms of which 2 ms to minimize.
[2024-06-03 00:38:33] [INFO ] Deduced a trap composed of 225 places in 113 ms of which 2 ms to minimize.
[2024-06-03 00:38:33] [INFO ] Deduced a trap composed of 219 places in 121 ms of which 2 ms to minimize.
[2024-06-03 00:38:33] [INFO ] Deduced a trap composed of 95 places in 115 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/383 variables, 6/46 constraints. Problems are: Problem set: 0 solved, 641 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/383 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 641 unsolved
At refinement iteration 5 (OVERLAPS) 642/1025 variables, 383/429 constraints. Problems are: Problem set: 0 solved, 641 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1025 variables, 641/1070 constraints. Problems are: Problem set: 0 solved, 641 unsolved
[2024-06-03 00:38:47] [INFO ] Deduced a trap composed of 23 places in 107 ms of which 3 ms to minimize.
[2024-06-03 00:38:52] [INFO ] Deduced a trap composed of 24 places in 90 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1025/1025 variables, and 1072 constraints, problems are : Problem set: 0 solved, 641 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 383/383 constraints, PredecessorRefiner: 641/641 constraints, Known Traps: 38/38 constraints]
After SMT, in 60243ms problems are : Problem set: 0 solved, 641 unsolved
Search for dead transitions found 0 dead transitions in 60248ms
Starting structural reductions in LTL mode, iteration 1 : 383/411 places, 642/688 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60727 ms. Remains : 383/411 places, 642/688 transitions.
Stuttering acceptance computed with spot in 183 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), true, (NOT p0), (NOT p2)]
Running random walk in product with property : FireWire-PT-20-LTLFireability-12
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA FireWire-PT-20-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-20-LTLFireability-12 finished in 60931 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||X(X(p1))))))'
Support contains 3 out of 411 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 411/411 places, 688/688 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 396 transition count 668
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 396 transition count 668
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 31 place count 396 transition count 667
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 37 place count 390 transition count 655
Iterating global reduction 1 with 6 rules applied. Total rules applied 43 place count 390 transition count 655
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 46 place count 387 transition count 650
Iterating global reduction 1 with 3 rules applied. Total rules applied 49 place count 387 transition count 650
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 51 place count 385 transition count 645
Iterating global reduction 1 with 2 rules applied. Total rules applied 53 place count 385 transition count 645
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 55 place count 383 transition count 641
Iterating global reduction 1 with 2 rules applied. Total rules applied 57 place count 383 transition count 641
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 59 place count 381 transition count 637
Iterating global reduction 1 with 2 rules applied. Total rules applied 61 place count 381 transition count 637
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 62 place count 380 transition count 635
Iterating global reduction 1 with 1 rules applied. Total rules applied 63 place count 380 transition count 635
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 64 place count 379 transition count 633
Iterating global reduction 1 with 1 rules applied. Total rules applied 65 place count 379 transition count 633
Applied a total of 65 rules in 34 ms. Remains 379 /411 variables (removed 32) and now considering 633/688 (removed 55) transitions.
// Phase 1: matrix 633 rows 379 cols
[2024-06-03 00:38:56] [INFO ] Computed 10 invariants in 5 ms
[2024-06-03 00:38:56] [INFO ] Implicit Places using invariants in 134 ms returned []
[2024-06-03 00:38:56] [INFO ] Invariant cache hit.
[2024-06-03 00:38:56] [INFO ] Implicit Places using invariants and state equation in 377 ms returned []
Implicit Place search using SMT with State Equation took 512 ms to find 0 implicit places.
Running 632 sub problems to find dead transitions.
[2024-06-03 00:38:56] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/378 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 632 unsolved
At refinement iteration 1 (OVERLAPS) 1/379 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 632 unsolved
[2024-06-03 00:39:04] [INFO ] Deduced a trap composed of 246 places in 129 ms of which 2 ms to minimize.
[2024-06-03 00:39:04] [INFO ] Deduced a trap composed of 253 places in 120 ms of which 2 ms to minimize.
[2024-06-03 00:39:04] [INFO ] Deduced a trap composed of 77 places in 49 ms of which 1 ms to minimize.
[2024-06-03 00:39:04] [INFO ] Deduced a trap composed of 76 places in 48 ms of which 1 ms to minimize.
[2024-06-03 00:39:04] [INFO ] Deduced a trap composed of 88 places in 40 ms of which 1 ms to minimize.
[2024-06-03 00:39:05] [INFO ] Deduced a trap composed of 78 places in 54 ms of which 0 ms to minimize.
[2024-06-03 00:39:05] [INFO ] Deduced a trap composed of 77 places in 51 ms of which 1 ms to minimize.
[2024-06-03 00:39:06] [INFO ] Deduced a trap composed of 77 places in 43 ms of which 0 ms to minimize.
[2024-06-03 00:39:06] [INFO ] Deduced a trap composed of 78 places in 52 ms of which 1 ms to minimize.
[2024-06-03 00:39:06] [INFO ] Deduced a trap composed of 43 places in 105 ms of which 1 ms to minimize.
[2024-06-03 00:39:07] [INFO ] Deduced a trap composed of 56 places in 125 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/379 variables, 11/21 constraints. Problems are: Problem set: 0 solved, 632 unsolved
[2024-06-03 00:39:10] [INFO ] Deduced a trap composed of 226 places in 123 ms of which 2 ms to minimize.
[2024-06-03 00:39:10] [INFO ] Deduced a trap composed of 79 places in 118 ms of which 2 ms to minimize.
[2024-06-03 00:39:10] [INFO ] Deduced a trap composed of 223 places in 121 ms of which 2 ms to minimize.
[2024-06-03 00:39:10] [INFO ] Deduced a trap composed of 228 places in 123 ms of which 2 ms to minimize.
[2024-06-03 00:39:11] [INFO ] Deduced a trap composed of 216 places in 120 ms of which 2 ms to minimize.
[2024-06-03 00:39:11] [INFO ] Deduced a trap composed of 216 places in 124 ms of which 2 ms to minimize.
[2024-06-03 00:39:13] [INFO ] Deduced a trap composed of 108 places in 128 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/379 variables, 7/28 constraints. Problems are: Problem set: 0 solved, 632 unsolved
[2024-06-03 00:39:20] [INFO ] Deduced a trap composed of 224 places in 128 ms of which 2 ms to minimize.
[2024-06-03 00:39:21] [INFO ] Deduced a trap composed of 221 places in 128 ms of which 2 ms to minimize.
[2024-06-03 00:39:22] [INFO ] Deduced a trap composed of 79 places in 67 ms of which 1 ms to minimize.
[2024-06-03 00:39:22] [INFO ] Deduced a trap composed of 220 places in 126 ms of which 2 ms to minimize.
[2024-06-03 00:39:23] [INFO ] Deduced a trap composed of 78 places in 126 ms of which 2 ms to minimize.
[2024-06-03 00:39:23] [INFO ] Deduced a trap composed of 223 places in 120 ms of which 2 ms to minimize.
[2024-06-03 00:39:23] [INFO ] Deduced a trap composed of 227 places in 127 ms of which 2 ms to minimize.
[2024-06-03 00:39:23] [INFO ] Deduced a trap composed of 92 places in 119 ms of which 2 ms to minimize.
[2024-06-03 00:39:23] [INFO ] Deduced a trap composed of 239 places in 125 ms of which 3 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 1.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 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.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 1.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 1.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 1.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 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 379/1012 variables, and 37 constraints, problems are : Problem set: 0 solved, 632 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 0/379 constraints, PredecessorRefiner: 632/632 constraints, Known Traps: 27/27 constraints]
Escalating to Integer solving :Problem set: 0 solved, 632 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/378 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 632 unsolved
At refinement iteration 1 (OVERLAPS) 1/379 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 632 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/379 variables, 27/37 constraints. Problems are: Problem set: 0 solved, 632 unsolved
[2024-06-03 00:39:30] [INFO ] Deduced a trap composed of 223 places in 124 ms of which 2 ms to minimize.
[2024-06-03 00:39:32] [INFO ] Deduced a trap composed of 221 places in 127 ms of which 2 ms to minimize.
[2024-06-03 00:39:32] [INFO ] Deduced a trap composed of 221 places in 124 ms of which 2 ms to minimize.
[2024-06-03 00:39:32] [INFO ] Deduced a trap composed of 219 places in 125 ms of which 2 ms to minimize.
[2024-06-03 00:39:33] [INFO ] Deduced a trap composed of 93 places in 125 ms of which 2 ms to minimize.
[2024-06-03 00:39:33] [INFO ] Deduced a trap composed of 92 places in 135 ms of which 2 ms to minimize.
[2024-06-03 00:39:33] [INFO ] Deduced a trap composed of 216 places in 129 ms of which 2 ms to minimize.
[2024-06-03 00:39:34] [INFO ] Deduced a trap composed of 230 places in 113 ms of which 3 ms to minimize.
[2024-06-03 00:39:34] [INFO ] Deduced a trap composed of 217 places in 114 ms of which 2 ms to minimize.
[2024-06-03 00:39:34] [INFO ] Deduced a trap composed of 217 places in 117 ms of which 2 ms to minimize.
[2024-06-03 00:39:34] [INFO ] Deduced a trap composed of 216 places in 116 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/379 variables, 11/48 constraints. Problems are: Problem set: 0 solved, 632 unsolved
[2024-06-03 00:39:37] [INFO ] Deduced a trap composed of 238 places in 125 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/379 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 632 unsolved
[2024-06-03 00:39:43] [INFO ] Deduced a trap composed of 246 places in 123 ms of which 2 ms to minimize.
[2024-06-03 00:39:43] [INFO ] Deduced a trap composed of 242 places in 122 ms of which 2 ms to minimize.
[2024-06-03 00:39:45] [INFO ] Deduced a trap composed of 96 places in 52 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/379 variables, 3/52 constraints. Problems are: Problem set: 0 solved, 632 unsolved
[2024-06-03 00:39:49] [INFO ] Deduced a trap composed of 93 places in 131 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/379 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 632 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 379/1012 variables, and 53 constraints, problems are : Problem set: 0 solved, 632 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 0/379 constraints, PredecessorRefiner: 0/632 constraints, Known Traps: 43/43 constraints]
After SMT, in 60235ms problems are : Problem set: 0 solved, 632 unsolved
Search for dead transitions found 0 dead transitions in 60242ms
Starting structural reductions in LTL mode, iteration 1 : 379/411 places, 633/688 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60789 ms. Remains : 379/411 places, 633/688 transitions.
Stuttering acceptance computed with spot in 130 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : FireWire-PT-20-LTLFireability-13
Product exploration explored 100000 steps with 0 reset in 106 ms.
Stack based approach found an accepted trace after 6 steps with 0 reset with depth 7 and stack size 7 in 0 ms.
FORMULA FireWire-PT-20-LTLFireability-13 FALSE TECHNIQUES STACK_TEST
Treatment of property FireWire-PT-20-LTLFireability-13 finished in 61048 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 411 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 411/411 places, 688/688 transitions.
Graph (trivial) has 300 edges and 411 vertex of which 11 / 411 are part of one of the 3 SCC in 0 ms
Free SCC test removed 8 places
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 60 transitions
Trivial Post-agglo rules discarded 60 transitions
Performed 60 trivial Post agglomeration. Transition count delta: 60
Iterating post reduction 0 with 60 rules applied. Total rules applied 61 place count 402 transition count 618
Reduce places removed 60 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 64 rules applied. Total rules applied 125 place count 342 transition count 614
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 126 place count 341 transition count 614
Performed 35 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 35 Pre rules applied. Total rules applied 126 place count 341 transition count 579
Deduced a syphon composed of 35 places in 1 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 3 with 70 rules applied. Total rules applied 196 place count 306 transition count 579
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 206 place count 296 transition count 564
Iterating global reduction 3 with 10 rules applied. Total rules applied 216 place count 296 transition count 564
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 217 place count 296 transition count 563
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 4 Pre rules applied. Total rules applied 217 place count 296 transition count 559
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 225 place count 292 transition count 559
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 228 place count 289 transition count 551
Iterating global reduction 4 with 3 rules applied. Total rules applied 231 place count 289 transition count 551
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 233 place count 287 transition count 547
Iterating global reduction 4 with 2 rules applied. Total rules applied 235 place count 287 transition count 547
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 237 place count 285 transition count 542
Iterating global reduction 4 with 2 rules applied. Total rules applied 239 place count 285 transition count 542
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 241 place count 283 transition count 538
Iterating global reduction 4 with 2 rules applied. Total rules applied 243 place count 283 transition count 538
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 244 place count 282 transition count 535
Iterating global reduction 4 with 1 rules applied. Total rules applied 245 place count 282 transition count 535
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 246 place count 281 transition count 533
Iterating global reduction 4 with 1 rules applied. Total rules applied 247 place count 281 transition count 533
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 248 place count 280 transition count 531
Iterating global reduction 4 with 1 rules applied. Total rules applied 249 place count 280 transition count 531
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 250 place count 279 transition count 529
Iterating global reduction 4 with 1 rules applied. Total rules applied 251 place count 279 transition count 529
Performed 38 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 38 places in 1 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 4 with 76 rules applied. Total rules applied 327 place count 241 transition count 490
Performed 45 Post agglomeration using F-continuation condition with reduction of 9 identical transitions.
Deduced a syphon composed of 45 places in 0 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 4 with 90 rules applied. Total rules applied 417 place count 196 transition count 586
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 420 place count 196 transition count 583
Applied a total of 420 rules in 61 ms. Remains 196 /411 variables (removed 215) and now considering 583/688 (removed 105) transitions.
[2024-06-03 00:39:57] [INFO ] Flow matrix only has 557 transitions (discarded 26 similar events)
// Phase 1: matrix 557 rows 196 cols
[2024-06-03 00:39:57] [INFO ] Computed 10 invariants in 4 ms
[2024-06-03 00:39:57] [INFO ] Implicit Places using invariants in 120 ms returned []
[2024-06-03 00:39:57] [INFO ] Flow matrix only has 557 transitions (discarded 26 similar events)
[2024-06-03 00:39:57] [INFO ] Invariant cache hit.
[2024-06-03 00:39:57] [INFO ] State equation strengthened by 12 read => feed constraints.
[2024-06-03 00:39:57] [INFO ] Implicit Places using invariants and state equation in 296 ms returned []
Implicit Place search using SMT with State Equation took 418 ms to find 0 implicit places.
[2024-06-03 00:39:57] [INFO ] Redundant transitions in 6 ms returned []
Running 574 sub problems to find dead transitions.
[2024-06-03 00:39:57] [INFO ] Flow matrix only has 557 transitions (discarded 26 similar events)
[2024-06-03 00:39:57] [INFO ] Invariant cache hit.
[2024-06-03 00:39:57] [INFO ] State equation strengthened by 12 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/195 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 574 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/195 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 574 unsolved
At refinement iteration 2 (OVERLAPS) 1/196 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 574 unsolved
[2024-06-03 00:40:02] [INFO ] Deduced a trap composed of 33 places in 102 ms of which 2 ms to minimize.
[2024-06-03 00:40:03] [INFO ] Deduced a trap composed of 30 places in 97 ms of which 1 ms to minimize.
[2024-06-03 00:40:03] [INFO ] Deduced a trap composed of 40 places in 40 ms of which 1 ms to minimize.
[2024-06-03 00:40:04] [INFO ] Deduced a trap composed of 75 places in 99 ms of which 1 ms to minimize.
[2024-06-03 00:40:04] [INFO ] Deduced a trap composed of 34 places in 98 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/196 variables, 5/15 constraints. Problems are: Problem set: 0 solved, 574 unsolved
[2024-06-03 00:40:09] [INFO ] Deduced a trap composed of 118 places in 101 ms of which 1 ms to minimize.
[2024-06-03 00:40:09] [INFO ] Deduced a trap composed of 111 places in 98 ms of which 1 ms to minimize.
[2024-06-03 00:40:09] [INFO ] Deduced a trap composed of 111 places in 94 ms of which 1 ms to minimize.
[2024-06-03 00:40:09] [INFO ] Deduced a trap composed of 111 places in 90 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/196 variables, 4/19 constraints. Problems are: Problem set: 0 solved, 574 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/196 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 574 unsolved
At refinement iteration 6 (OVERLAPS) 556/752 variables, 196/215 constraints. Problems are: Problem set: 0 solved, 574 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/752 variables, 12/227 constraints. Problems are: Problem set: 0 solved, 574 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/752 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 574 unsolved
At refinement iteration 9 (OVERLAPS) 0/752 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 574 unsolved
No progress, stopping.
After SMT solving in domain Real declared 752/753 variables, and 227 constraints, problems are : Problem set: 0 solved, 574 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 196/196 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 574/574 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 574 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/195 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 574 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/195 variables, 7/8 constraints. Problems are: Problem set: 0 solved, 574 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/195 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 574 unsolved
At refinement iteration 3 (OVERLAPS) 1/196 variables, 9/17 constraints. Problems are: Problem set: 0 solved, 574 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/196 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 574 unsolved
[2024-06-03 00:40:32] [INFO ] Deduced a trap composed of 67 places in 109 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/196 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 574 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/196 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 574 unsolved
At refinement iteration 7 (OVERLAPS) 556/752 variables, 196/216 constraints. Problems are: Problem set: 0 solved, 574 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/752 variables, 12/228 constraints. Problems are: Problem set: 0 solved, 574 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/752 variables, 574/802 constraints. Problems are: Problem set: 0 solved, 574 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/752 variables, 0/802 constraints. Problems are: Problem set: 0 solved, 574 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 752/753 variables, and 802 constraints, problems are : Problem set: 0 solved, 574 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 196/196 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 574/574 constraints, Known Traps: 10/10 constraints]
After SMT, in 60663ms problems are : Problem set: 0 solved, 574 unsolved
Search for dead transitions found 0 dead transitions in 60669ms
Starting structural reductions in SI_LTL mode, iteration 1 : 196/411 places, 583/688 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61160 ms. Remains : 196/411 places, 583/688 transitions.
Stuttering acceptance computed with spot in 54 ms :[(NOT p0)]
Running random walk in product with property : FireWire-PT-20-LTLFireability-14
Product exploration explored 100000 steps with 1 reset in 59 ms.
Product exploration explored 100000 steps with 0 reset in 49 ms.
Computed a total of 31 stabilizing places and 56 stable transitions
Computed a total of 31 stabilizing places and 56 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 90 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 40 ms :[(NOT p0)]
RANDOM walk for 29492 steps (1120 resets) in 60 ms. (483 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 98 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 45 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Support contains 1 out of 196 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 196/196 places, 583/583 transitions.
Applied a total of 0 rules in 12 ms. Remains 196 /196 variables (removed 0) and now considering 583/583 (removed 0) transitions.
[2024-06-03 00:40:58] [INFO ] Flow matrix only has 557 transitions (discarded 26 similar events)
[2024-06-03 00:40:58] [INFO ] Invariant cache hit.
[2024-06-03 00:40:59] [INFO ] Implicit Places using invariants in 111 ms returned []
[2024-06-03 00:40:59] [INFO ] Flow matrix only has 557 transitions (discarded 26 similar events)
[2024-06-03 00:40:59] [INFO ] Invariant cache hit.
[2024-06-03 00:40:59] [INFO ] State equation strengthened by 12 read => feed constraints.
[2024-06-03 00:40:59] [INFO ] Implicit Places using invariants and state equation in 311 ms returned []
Implicit Place search using SMT with State Equation took 424 ms to find 0 implicit places.
[2024-06-03 00:40:59] [INFO ] Redundant transitions in 5 ms returned []
Running 574 sub problems to find dead transitions.
[2024-06-03 00:40:59] [INFO ] Flow matrix only has 557 transitions (discarded 26 similar events)
[2024-06-03 00:40:59] [INFO ] Invariant cache hit.
[2024-06-03 00:40:59] [INFO ] State equation strengthened by 12 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/195 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 574 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/195 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 574 unsolved
At refinement iteration 2 (OVERLAPS) 1/196 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 574 unsolved
[2024-06-03 00:41:04] [INFO ] Deduced a trap composed of 33 places in 108 ms of which 1 ms to minimize.
[2024-06-03 00:41:04] [INFO ] Deduced a trap composed of 30 places in 99 ms of which 2 ms to minimize.
[2024-06-03 00:41:05] [INFO ] Deduced a trap composed of 40 places in 39 ms of which 1 ms to minimize.
[2024-06-03 00:41:05] [INFO ] Deduced a trap composed of 75 places in 101 ms of which 1 ms to minimize.
[2024-06-03 00:41:06] [INFO ] Deduced a trap composed of 34 places in 103 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/196 variables, 5/15 constraints. Problems are: Problem set: 0 solved, 574 unsolved
[2024-06-03 00:41:10] [INFO ] Deduced a trap composed of 118 places in 104 ms of which 1 ms to minimize.
[2024-06-03 00:41:10] [INFO ] Deduced a trap composed of 111 places in 101 ms of which 2 ms to minimize.
[2024-06-03 00:41:10] [INFO ] Deduced a trap composed of 111 places in 106 ms of which 1 ms to minimize.
[2024-06-03 00:41:10] [INFO ] Deduced a trap composed of 111 places in 98 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/196 variables, 4/19 constraints. Problems are: Problem set: 0 solved, 574 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/196 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 574 unsolved
At refinement iteration 6 (OVERLAPS) 556/752 variables, 196/215 constraints. Problems are: Problem set: 0 solved, 574 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/752 variables, 12/227 constraints. Problems are: Problem set: 0 solved, 574 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/752 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 574 unsolved
At refinement iteration 9 (OVERLAPS) 0/752 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 574 unsolved
No progress, stopping.
After SMT solving in domain Real declared 752/753 variables, and 227 constraints, problems are : Problem set: 0 solved, 574 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 196/196 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 574/574 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 574 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/195 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 574 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/195 variables, 7/8 constraints. Problems are: Problem set: 0 solved, 574 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/195 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 574 unsolved
At refinement iteration 3 (OVERLAPS) 1/196 variables, 9/17 constraints. Problems are: Problem set: 0 solved, 574 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/196 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 574 unsolved
[2024-06-03 00:41:34] [INFO ] Deduced a trap composed of 67 places in 107 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/196 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 574 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/196 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 574 unsolved
At refinement iteration 7 (OVERLAPS) 556/752 variables, 196/216 constraints. Problems are: Problem set: 0 solved, 574 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/752 variables, 12/228 constraints. Problems are: Problem set: 0 solved, 574 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/752 variables, 574/802 constraints. Problems are: Problem set: 0 solved, 574 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/752 variables, 0/802 constraints. Problems are: Problem set: 0 solved, 574 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 752/753 variables, and 802 constraints, problems are : Problem set: 0 solved, 574 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 196/196 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 574/574 constraints, Known Traps: 10/10 constraints]
After SMT, in 60652ms problems are : Problem set: 0 solved, 574 unsolved
Search for dead transitions found 0 dead transitions in 60659ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 61110 ms. Remains : 196/196 places, 583/583 transitions.
Computed a total of 31 stabilizing places and 56 stable transitions
Computed a total of 31 stabilizing places and 56 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 73 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 36 ms :[(NOT p0)]
RANDOM walk for 40000 steps (1510 resets) in 75 ms. (526 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (257 resets) in 23 ms. (1666 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 25332 steps, run visited all 1 properties in 59 ms. (steps per millisecond=429 )
Probabilistic random walk after 25332 steps, saw 5306 distinct states, run finished after 60 ms. (steps per millisecond=422 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 94 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 40 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Product exploration explored 100000 steps with 2 reset in 42 ms.
Product exploration explored 100000 steps with 2 reset in 49 ms.
Built C files in :
/tmp/ltsmin9288177631759032188
[2024-06-03 00:42:00] [INFO ] Computing symmetric may disable matrix : 583 transitions.
[2024-06-03 00:42:00] [INFO ] Computation of Complete disable matrix. took 10 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-03 00:42:00] [INFO ] Computing symmetric may enable matrix : 583 transitions.
[2024-06-03 00:42:00] [INFO ] Computation of Complete enable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-03 00:42:00] [INFO ] Computing Do-Not-Accords matrix : 583 transitions.
[2024-06-03 00:42:00] [INFO ] Computation of Completed DNA matrix. took 19 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-03 00:42:00] [INFO ] Built C files in 135ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9288177631759032188
Running compilation step : cd /tmp/ltsmin9288177631759032188;'/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 1595 ms.
Running link step : cd /tmp/ltsmin9288177631759032188;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 46 ms.
Running LTSmin : cd /tmp/ltsmin9288177631759032188;'/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/stateBased9550589071895760451.hoa' '--buchi-type=spotba'
LTSmin run took 2263 ms.
FORMULA FireWire-PT-20-LTLFireability-14 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property FireWire-PT-20-LTLFireability-14 finished in 127415 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 3 out of 411 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 411/411 places, 688/688 transitions.
Graph (trivial) has 300 edges and 411 vertex of which 11 / 411 are part of one of the 3 SCC in 0 ms
Free SCC test removed 8 places
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 61 transitions
Trivial Post-agglo rules discarded 61 transitions
Performed 61 trivial Post agglomeration. Transition count delta: 61
Iterating post reduction 0 with 61 rules applied. Total rules applied 62 place count 402 transition count 617
Reduce places removed 61 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 65 rules applied. Total rules applied 127 place count 341 transition count 613
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 128 place count 340 transition count 613
Performed 35 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 35 Pre rules applied. Total rules applied 128 place count 340 transition count 578
Deduced a syphon composed of 35 places in 0 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 3 with 70 rules applied. Total rules applied 198 place count 305 transition count 578
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 206 place count 297 transition count 566
Iterating global reduction 3 with 8 rules applied. Total rules applied 214 place count 297 transition count 566
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 215 place count 297 transition count 565
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 215 place count 297 transition count 562
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 221 place count 294 transition count 562
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 223 place count 292 transition count 557
Iterating global reduction 4 with 2 rules applied. Total rules applied 225 place count 292 transition count 557
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 226 place count 291 transition count 555
Iterating global reduction 4 with 1 rules applied. Total rules applied 227 place count 291 transition count 555
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 228 place count 290 transition count 552
Iterating global reduction 4 with 1 rules applied. Total rules applied 229 place count 290 transition count 552
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 230 place count 289 transition count 550
Iterating global reduction 4 with 1 rules applied. Total rules applied 231 place count 289 transition count 550
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 232 place count 288 transition count 547
Iterating global reduction 4 with 1 rules applied. Total rules applied 233 place count 288 transition count 547
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 234 place count 287 transition count 545
Iterating global reduction 4 with 1 rules applied. Total rules applied 235 place count 287 transition count 545
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 236 place count 286 transition count 543
Iterating global reduction 4 with 1 rules applied. Total rules applied 237 place count 286 transition count 543
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 238 place count 285 transition count 541
Iterating global reduction 4 with 1 rules applied. Total rules applied 239 place count 285 transition count 541
Performed 39 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 39 places in 0 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 4 with 78 rules applied. Total rules applied 317 place count 246 transition count 501
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 318 place count 245 transition count 499
Iterating global reduction 4 with 1 rules applied. Total rules applied 319 place count 245 transition count 499
Performed 45 Post agglomeration using F-continuation condition with reduction of 9 identical transitions.
Deduced a syphon composed of 45 places in 1 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 4 with 90 rules applied. Total rules applied 409 place count 200 transition count 598
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 412 place count 200 transition count 595
Applied a total of 412 rules in 80 ms. Remains 200 /411 variables (removed 211) and now considering 595/688 (removed 93) transitions.
[2024-06-03 00:42:04] [INFO ] Flow matrix only has 566 transitions (discarded 29 similar events)
// Phase 1: matrix 566 rows 200 cols
[2024-06-03 00:42:04] [INFO ] Computed 10 invariants in 2 ms
[2024-06-03 00:42:04] [INFO ] Implicit Places using invariants in 139 ms returned []
[2024-06-03 00:42:04] [INFO ] Flow matrix only has 566 transitions (discarded 29 similar events)
[2024-06-03 00:42:04] [INFO ] Invariant cache hit.
[2024-06-03 00:42:05] [INFO ] State equation strengthened by 12 read => feed constraints.
[2024-06-03 00:42:05] [INFO ] Implicit Places using invariants and state equation in 425 ms returned []
Implicit Place search using SMT with State Equation took 569 ms to find 0 implicit places.
[2024-06-03 00:42:05] [INFO ] Redundant transitions in 4 ms returned []
Running 586 sub problems to find dead transitions.
[2024-06-03 00:42:05] [INFO ] Flow matrix only has 566 transitions (discarded 29 similar events)
[2024-06-03 00:42:05] [INFO ] Invariant cache hit.
[2024-06-03 00:42:05] [INFO ] State equation strengthened by 12 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/199 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 586 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/199 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 586 unsolved
At refinement iteration 2 (OVERLAPS) 1/200 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 586 unsolved
[2024-06-03 00:42:10] [INFO ] Deduced a trap composed of 49 places in 43 ms of which 1 ms to minimize.
[2024-06-03 00:42:10] [INFO ] Deduced a trap composed of 34 places in 100 ms of which 1 ms to minimize.
[2024-06-03 00:42:10] [INFO ] Deduced a trap composed of 34 places in 103 ms of which 1 ms to minimize.
[2024-06-03 00:42:11] [INFO ] Deduced a trap composed of 33 places in 99 ms of which 1 ms to minimize.
[2024-06-03 00:42:11] [INFO ] Deduced a trap composed of 49 places in 43 ms of which 1 ms to minimize.
[2024-06-03 00:42:11] [INFO ] Deduced a trap composed of 40 places in 78 ms of which 2 ms to minimize.
[2024-06-03 00:42:12] [INFO ] Deduced a trap composed of 78 places in 95 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/200 variables, 7/17 constraints. Problems are: Problem set: 0 solved, 586 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/200 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 586 unsolved
At refinement iteration 5 (OVERLAPS) 565/765 variables, 200/217 constraints. Problems are: Problem set: 0 solved, 586 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/765 variables, 12/229 constraints. Problems are: Problem set: 0 solved, 586 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/765 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 586 unsolved
At refinement iteration 8 (OVERLAPS) 0/765 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 586 unsolved
No progress, stopping.
After SMT solving in domain Real declared 765/766 variables, and 229 constraints, problems are : Problem set: 0 solved, 586 unsolved in 24061 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 200/200 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 586/586 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 586 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/199 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 586 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/199 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 586 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/199 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 586 unsolved
At refinement iteration 3 (OVERLAPS) 1/200 variables, 9/11 constraints. Problems are: Problem set: 0 solved, 586 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/200 variables, 6/17 constraints. Problems are: Problem set: 0 solved, 586 unsolved
[2024-06-03 00:42:33] [INFO ] Deduced a trap composed of 30 places in 99 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/200 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 586 unsolved
[2024-06-03 00:42:36] [INFO ] Deduced a trap composed of 119 places in 109 ms of which 1 ms to minimize.
[2024-06-03 00:42:37] [INFO ] Deduced a trap composed of 125 places in 106 ms of which 1 ms to minimize.
[2024-06-03 00:42:37] [INFO ] Deduced a trap composed of 131 places in 102 ms of which 1 ms to minimize.
[2024-06-03 00:42:37] [INFO ] Deduced a trap composed of 61 places in 112 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/200 variables, 4/22 constraints. Problems are: Problem set: 0 solved, 586 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/200 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 586 unsolved
At refinement iteration 8 (OVERLAPS) 565/765 variables, 200/222 constraints. Problems are: Problem set: 0 solved, 586 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/765 variables, 12/234 constraints. Problems are: Problem set: 0 solved, 586 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/765 variables, 586/820 constraints. Problems are: Problem set: 0 solved, 586 unsolved
[2024-06-03 00:42:52] [INFO ] Deduced a trap composed of 41 places in 45 ms of which 0 ms to minimize.
[2024-06-03 00:42:53] [INFO ] Deduced a trap composed of 26 places in 115 ms of which 1 ms to minimize.
[2024-06-03 00:42:54] [INFO ] Deduced a trap composed of 128 places in 122 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 765/766 variables, and 823 constraints, problems are : Problem set: 0 solved, 586 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 200/200 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 586/586 constraints, Known Traps: 15/15 constraints]
After SMT, in 54770ms problems are : Problem set: 0 solved, 586 unsolved
Search for dead transitions found 0 dead transitions in 54776ms
Starting structural reductions in SI_LTL mode, iteration 1 : 200/411 places, 595/688 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 55438 ms. Remains : 200/411 places, 595/688 transitions.
Stuttering acceptance computed with spot in 124 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : FireWire-PT-20-LTLFireability-15
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA FireWire-PT-20-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-20-LTLFireability-15 finished in 55576 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((G(p0)||X(p1)))))'
Found a Lengthening insensitive property : FireWire-PT-20-LTLFireability-06
Stuttering acceptance computed with spot in 213 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Support contains 2 out of 411 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 411/411 places, 688/688 transitions.
Graph (trivial) has 299 edges and 411 vertex of which 11 / 411 are part of one of the 3 SCC in 1 ms
Free SCC test removed 8 places
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 61 transitions
Trivial Post-agglo rules discarded 61 transitions
Performed 61 trivial Post agglomeration. Transition count delta: 61
Iterating post reduction 0 with 61 rules applied. Total rules applied 62 place count 403 transition count 618
Reduce places removed 61 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 65 rules applied. Total rules applied 127 place count 342 transition count 614
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 128 place count 341 transition count 614
Performed 35 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 35 Pre rules applied. Total rules applied 128 place count 341 transition count 579
Deduced a syphon composed of 35 places in 0 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 3 with 70 rules applied. Total rules applied 198 place count 306 transition count 579
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 207 place count 297 transition count 566
Iterating global reduction 3 with 9 rules applied. Total rules applied 216 place count 297 transition count 566
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 217 place count 297 transition count 565
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 4 Pre rules applied. Total rules applied 217 place count 297 transition count 561
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 225 place count 293 transition count 561
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 228 place count 290 transition count 553
Iterating global reduction 4 with 3 rules applied. Total rules applied 231 place count 290 transition count 553
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 233 place count 288 transition count 549
Iterating global reduction 4 with 2 rules applied. Total rules applied 235 place count 288 transition count 549
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 237 place count 286 transition count 544
Iterating global reduction 4 with 2 rules applied. Total rules applied 239 place count 286 transition count 544
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 241 place count 284 transition count 540
Iterating global reduction 4 with 2 rules applied. Total rules applied 243 place count 284 transition count 540
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 244 place count 283 transition count 537
Iterating global reduction 4 with 1 rules applied. Total rules applied 245 place count 283 transition count 537
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 246 place count 282 transition count 535
Iterating global reduction 4 with 1 rules applied. Total rules applied 247 place count 282 transition count 535
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 248 place count 281 transition count 533
Iterating global reduction 4 with 1 rules applied. Total rules applied 249 place count 281 transition count 533
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 250 place count 280 transition count 531
Iterating global reduction 4 with 1 rules applied. Total rules applied 251 place count 280 transition count 531
Performed 38 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 38 places in 1 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 4 with 76 rules applied. Total rules applied 327 place count 242 transition count 492
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 328 place count 241 transition count 490
Iterating global reduction 4 with 1 rules applied. Total rules applied 329 place count 241 transition count 490
Performed 44 Post agglomeration using F-continuation condition with reduction of 9 identical transitions.
Deduced a syphon composed of 44 places in 0 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 4 with 88 rules applied. Total rules applied 417 place count 197 transition count 585
Applied a total of 417 rules in 64 ms. Remains 197 /411 variables (removed 214) and now considering 585/688 (removed 103) transitions.
[2024-06-03 00:43:00] [INFO ] Flow matrix only has 556 transitions (discarded 29 similar events)
// Phase 1: matrix 556 rows 197 cols
[2024-06-03 00:43:00] [INFO ] Computed 10 invariants in 4 ms
[2024-06-03 00:43:00] [INFO ] Implicit Places using invariants in 108 ms returned []
[2024-06-03 00:43:00] [INFO ] Flow matrix only has 556 transitions (discarded 29 similar events)
[2024-06-03 00:43:00] [INFO ] Invariant cache hit.
[2024-06-03 00:43:00] [INFO ] State equation strengthened by 13 read => feed constraints.
[2024-06-03 00:43:01] [INFO ] Implicit Places using invariants and state equation in 304 ms returned []
Implicit Place search using SMT with State Equation took 414 ms to find 0 implicit places.
Running 584 sub problems to find dead transitions.
[2024-06-03 00:43:01] [INFO ] Flow matrix only has 556 transitions (discarded 29 similar events)
[2024-06-03 00:43:01] [INFO ] Invariant cache hit.
[2024-06-03 00:43:01] [INFO ] State equation strengthened by 13 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/196 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 584 unsolved
At refinement iteration 1 (OVERLAPS) 1/197 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 584 unsolved
[2024-06-03 00:43:05] [INFO ] Deduced a trap composed of 34 places in 95 ms of which 1 ms to minimize.
[2024-06-03 00:43:06] [INFO ] Deduced a trap composed of 32 places in 100 ms of which 1 ms to minimize.
[2024-06-03 00:43:06] [INFO ] Deduced a trap composed of 31 places in 125 ms of which 2 ms to minimize.
[2024-06-03 00:43:06] [INFO ] Deduced a trap composed of 41 places in 98 ms of which 1 ms to minimize.
[2024-06-03 00:43:07] [INFO ] Deduced a trap composed of 120 places in 91 ms of which 1 ms to minimize.
[2024-06-03 00:43:07] [INFO ] Deduced a trap composed of 123 places in 100 ms of which 1 ms to minimize.
[2024-06-03 00:43:08] [INFO ] Deduced a trap composed of 155 places in 98 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/197 variables, 7/17 constraints. Problems are: Problem set: 0 solved, 584 unsolved
[2024-06-03 00:43:10] [INFO ] Deduced a trap composed of 41 places in 112 ms of which 2 ms to minimize.
[2024-06-03 00:43:11] [INFO ] Deduced a trap composed of 114 places in 103 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/197 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 584 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/197 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 584 unsolved
At refinement iteration 5 (OVERLAPS) 555/752 variables, 197/216 constraints. Problems are: Problem set: 0 solved, 584 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/752 variables, 12/228 constraints. Problems are: Problem set: 0 solved, 584 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/752 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 584 unsolved
At refinement iteration 8 (OVERLAPS) 1/753 variables, 1/229 constraints. Problems are: Problem set: 0 solved, 584 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/753 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 584 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 753/753 variables, and 229 constraints, problems are : Problem set: 0 solved, 584 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 197/197 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 584/584 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 584 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/196 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 584 unsolved
At refinement iteration 1 (OVERLAPS) 1/197 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 584 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/197 variables, 9/19 constraints. Problems are: Problem set: 0 solved, 584 unsolved
[2024-06-03 00:43:35] [INFO ] Deduced a trap composed of 81 places in 118 ms of which 1 ms to minimize.
[2024-06-03 00:43:35] [INFO ] Deduced a trap composed of 58 places in 102 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/197 variables, 2/21 constraints. Problems are: Problem set: 0 solved, 584 unsolved
[2024-06-03 00:43:38] [INFO ] Deduced a trap composed of 63 places in 94 ms of which 1 ms to minimize.
[2024-06-03 00:43:38] [INFO ] Deduced a trap composed of 52 places in 82 ms of which 1 ms to minimize.
[2024-06-03 00:43:38] [INFO ] Deduced a trap composed of 43 places in 32 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/197 variables, 3/24 constraints. Problems are: Problem set: 0 solved, 584 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/197 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 584 unsolved
At refinement iteration 6 (OVERLAPS) 555/752 variables, 197/221 constraints. Problems are: Problem set: 0 solved, 584 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/752 variables, 12/233 constraints. Problems are: Problem set: 0 solved, 584 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/752 variables, 584/817 constraints. Problems are: Problem set: 0 solved, 584 unsolved
[2024-06-03 00:43:57] [INFO ] Deduced a trap composed of 24 places in 97 ms of which 1 ms to minimize.
[2024-06-03 00:43:57] [INFO ] Deduced a trap composed of 23 places in 98 ms of which 1 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 752/753 variables, and 819 constraints, problems are : Problem set: 0 solved, 584 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 197/197 constraints, ReadFeed: 12/13 constraints, PredecessorRefiner: 584/584 constraints, Known Traps: 16/16 constraints]
After SMT, in 60700ms problems are : Problem set: 0 solved, 584 unsolved
Search for dead transitions found 0 dead transitions in 60706ms
Starting structural reductions in LI_LTL mode, iteration 1 : 197/411 places, 585/688 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 61185 ms. Remains : 197/411 places, 585/688 transitions.
Running random walk in product with property : FireWire-PT-20-LTLFireability-06
Product exploration explored 100000 steps with 4 reset in 58 ms.
Product exploration explored 100000 steps with 0 reset in 64 ms.
Computed a total of 32 stabilizing places and 57 stable transitions
Computed a total of 32 stabilizing places and 57 stable transitions
Detected a total of 32/197 stabilizing places and 57/585 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p1 p0), (X p0), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 153 ms. Reduced automaton from 6 states, 13 edges and 2 AP (stutter sensitive) to 6 states, 12 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 201 ms :[true, (NOT p1), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
RANDOM walk for 40000 steps (1461 resets) in 118 ms. (336 steps per ms) remains 1/6 properties
BEST_FIRST walk for 40003 steps (255 resets) in 24 ms. (1600 steps per ms) remains 1/1 properties
[2024-06-03 00:44:02] [INFO ] Flow matrix only has 556 transitions (discarded 29 similar events)
[2024-06-03 00:44:02] [INFO ] Invariant cache hit.
[2024-06-03 00:44:02] [INFO ] State equation strengthened by 13 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 164/166 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/166 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 19/185 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/185 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 555/740 variables, 185/195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/740 variables, 12/207 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/740 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 12/752 variables, 12/219 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/752 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/753 variables, 1/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/753 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/753 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 753/753 variables, and 220 constraints, problems are : Problem set: 0 solved, 1 unsolved in 176 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 197/197 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf2 is UNSAT
After SMT solving in domain Int declared 166/753 variables, and 9 constraints, problems are : Problem set: 1 solved, 0 unsolved in 40 ms.
Refiners :[Positive P Invariants (semi-flows): 9/10 constraints, State Equation: 0/197 constraints, ReadFeed: 0/13 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 252ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 p0), (X p0), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (F (OR (G p1) (G (NOT p1)))), (G (OR p1 p0))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (OR (NOT p1) p0))), (F (NOT (OR p1 (NOT p0)))), (F (NOT p1)), (F (NOT (AND p1 p0)))]
Knowledge based reduction with 10 factoid took 433 ms. Reduced automaton from 6 states, 12 edges and 2 AP (stutter sensitive) to 6 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 200 ms :[true, (NOT p1), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 225 ms :[true, (NOT p1), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 2 out of 197 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 197/197 places, 585/585 transitions.
Applied a total of 0 rules in 2 ms. Remains 197 /197 variables (removed 0) and now considering 585/585 (removed 0) transitions.
[2024-06-03 00:44:03] [INFO ] Flow matrix only has 556 transitions (discarded 29 similar events)
[2024-06-03 00:44:03] [INFO ] Invariant cache hit.
[2024-06-03 00:44:03] [INFO ] Implicit Places using invariants in 104 ms returned []
[2024-06-03 00:44:03] [INFO ] Flow matrix only has 556 transitions (discarded 29 similar events)
[2024-06-03 00:44:03] [INFO ] Invariant cache hit.
[2024-06-03 00:44:03] [INFO ] State equation strengthened by 13 read => feed constraints.
[2024-06-03 00:44:03] [INFO ] Implicit Places using invariants and state equation in 315 ms returned []
Implicit Place search using SMT with State Equation took 424 ms to find 0 implicit places.
Running 584 sub problems to find dead transitions.
[2024-06-03 00:44:03] [INFO ] Flow matrix only has 556 transitions (discarded 29 similar events)
[2024-06-03 00:44:03] [INFO ] Invariant cache hit.
[2024-06-03 00:44:03] [INFO ] State equation strengthened by 13 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/196 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 584 unsolved
At refinement iteration 1 (OVERLAPS) 1/197 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 584 unsolved
[2024-06-03 00:44:08] [INFO ] Deduced a trap composed of 34 places in 93 ms of which 2 ms to minimize.
[2024-06-03 00:44:08] [INFO ] Deduced a trap composed of 32 places in 101 ms of which 1 ms to minimize.
[2024-06-03 00:44:09] [INFO ] Deduced a trap composed of 31 places in 107 ms of which 1 ms to minimize.
[2024-06-03 00:44:09] [INFO ] Deduced a trap composed of 41 places in 98 ms of which 1 ms to minimize.
[2024-06-03 00:44:10] [INFO ] Deduced a trap composed of 120 places in 100 ms of which 2 ms to minimize.
[2024-06-03 00:44:10] [INFO ] Deduced a trap composed of 123 places in 93 ms of which 1 ms to minimize.
[2024-06-03 00:44:11] [INFO ] Deduced a trap composed of 155 places in 99 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/197 variables, 7/17 constraints. Problems are: Problem set: 0 solved, 584 unsolved
[2024-06-03 00:44:13] [INFO ] Deduced a trap composed of 41 places in 94 ms of which 2 ms to minimize.
[2024-06-03 00:44:14] [INFO ] Deduced a trap composed of 114 places in 106 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/197 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 584 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/197 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 584 unsolved
At refinement iteration 5 (OVERLAPS) 555/752 variables, 197/216 constraints. Problems are: Problem set: 0 solved, 584 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/752 variables, 12/228 constraints. Problems are: Problem set: 0 solved, 584 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/752 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 584 unsolved
At refinement iteration 8 (OVERLAPS) 1/753 variables, 1/229 constraints. Problems are: Problem set: 0 solved, 584 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/753 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 584 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 753/753 variables, and 229 constraints, problems are : Problem set: 0 solved, 584 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 197/197 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 584/584 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 584 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/196 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 584 unsolved
At refinement iteration 1 (OVERLAPS) 1/197 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 584 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/197 variables, 9/19 constraints. Problems are: Problem set: 0 solved, 584 unsolved
[2024-06-03 00:44:37] [INFO ] Deduced a trap composed of 81 places in 91 ms of which 2 ms to minimize.
[2024-06-03 00:44:37] [INFO ] Deduced a trap composed of 58 places in 86 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/197 variables, 2/21 constraints. Problems are: Problem set: 0 solved, 584 unsolved
[2024-06-03 00:44:40] [INFO ] Deduced a trap composed of 63 places in 94 ms of which 2 ms to minimize.
[2024-06-03 00:44:40] [INFO ] Deduced a trap composed of 52 places in 92 ms of which 1 ms to minimize.
[2024-06-03 00:44:41] [INFO ] Deduced a trap composed of 43 places in 39 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/197 variables, 3/24 constraints. Problems are: Problem set: 0 solved, 584 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/197 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 584 unsolved
At refinement iteration 6 (OVERLAPS) 555/752 variables, 197/221 constraints. Problems are: Problem set: 0 solved, 584 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/752 variables, 12/233 constraints. Problems are: Problem set: 0 solved, 584 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/752 variables, 584/817 constraints. Problems are: Problem set: 0 solved, 584 unsolved
[2024-06-03 00:45:00] [INFO ] Deduced a trap composed of 24 places in 112 ms of which 1 ms to minimize.
[2024-06-03 00:45:00] [INFO ] Deduced a trap composed of 23 places in 105 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 752/753 variables, and 819 constraints, problems are : Problem set: 0 solved, 584 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 197/197 constraints, ReadFeed: 12/13 constraints, PredecessorRefiner: 584/584 constraints, Known Traps: 16/16 constraints]
After SMT, in 60619ms problems are : Problem set: 0 solved, 584 unsolved
Search for dead transitions found 0 dead transitions in 60628ms
Finished structural reductions in LTL mode , in 1 iterations and 61055 ms. Remains : 197/197 places, 585/585 transitions.
Computed a total of 32 stabilizing places and 57 stable transitions
Computed a total of 32 stabilizing places and 57 stable transitions
Detected a total of 32/197 stabilizing places and 57/585 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p1 p0), (X (X p0)), (X (X p1)), (X (X (AND p1 p0))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 114 ms. Reduced automaton from 6 states, 11 edges and 2 AP (stutter sensitive) to 6 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 232 ms :[true, (NOT p1), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
RANDOM walk for 25460 steps (927 resets) in 81 ms. (310 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p1 p0), (X (X p0)), (X (X p1)), (X (X (AND p1 p0))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (AND p0 p1))), (F (NOT (OR p0 (NOT p1)))), (F (NOT p1))]
Knowledge based reduction with 5 factoid took 281 ms. Reduced automaton from 6 states, 11 edges and 2 AP (stutter sensitive) to 6 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 206 ms :[true, (NOT p1), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 202 ms :[true, (NOT p1), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 198 ms :[true, (NOT p1), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 1 reset in 56 ms.
Product exploration explored 100000 steps with 3 reset in 75 ms.
Applying partial POR strategy [true, false, true, false, false, false]
Stuttering acceptance computed with spot in 207 ms :[true, (NOT p1), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 2 out of 197 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 197/197 places, 585/585 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 197 transition count 582
Applied a total of 3 rules in 17 ms. Remains 197 /197 variables (removed 0) and now considering 582/585 (removed 3) transitions.
[2024-06-03 00:45:06] [INFO ] Redundant transitions in 4 ms returned []
Running 581 sub problems to find dead transitions.
[2024-06-03 00:45:06] [INFO ] Flow matrix only has 553 transitions (discarded 29 similar events)
// Phase 1: matrix 553 rows 197 cols
[2024-06-03 00:45:06] [INFO ] Computed 10 invariants in 4 ms
[2024-06-03 00:45:06] [INFO ] State equation strengthened by 13 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/196 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 581 unsolved
At refinement iteration 1 (OVERLAPS) 1/197 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 581 unsolved
[2024-06-03 00:45:10] [INFO ] Deduced a trap composed of 34 places in 99 ms of which 1 ms to minimize.
[2024-06-03 00:45:11] [INFO ] Deduced a trap composed of 31 places in 96 ms of which 2 ms to minimize.
[2024-06-03 00:45:11] [INFO ] Deduced a trap composed of 41 places in 85 ms of which 1 ms to minimize.
[2024-06-03 00:45:12] [INFO ] Deduced a trap composed of 81 places in 94 ms of which 1 ms to minimize.
[2024-06-03 00:45:13] [INFO ] Deduced a trap composed of 155 places in 96 ms of which 1 ms to minimize.
[2024-06-03 00:45:13] [INFO ] Deduced a trap composed of 122 places in 89 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/197 variables, 6/16 constraints. Problems are: Problem set: 0 solved, 581 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/197 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 581 unsolved
At refinement iteration 4 (OVERLAPS) 552/749 variables, 197/213 constraints. Problems are: Problem set: 0 solved, 581 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/749 variables, 12/225 constraints. Problems are: Problem set: 0 solved, 581 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/749 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 581 unsolved
At refinement iteration 7 (OVERLAPS) 1/750 variables, 1/226 constraints. Problems are: Problem set: 0 solved, 581 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/750 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 581 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 750/750 variables, and 226 constraints, problems are : Problem set: 0 solved, 581 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 197/197 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 581/581 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 581 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/196 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 581 unsolved
At refinement iteration 1 (OVERLAPS) 1/197 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 581 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/197 variables, 6/16 constraints. Problems are: Problem set: 0 solved, 581 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/197 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 581 unsolved
At refinement iteration 4 (OVERLAPS) 552/749 variables, 197/213 constraints. Problems are: Problem set: 0 solved, 581 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/749 variables, 12/225 constraints. Problems are: Problem set: 0 solved, 581 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/749 variables, 581/806 constraints. Problems are: Problem set: 0 solved, 581 unsolved
[2024-06-03 00:45:50] [INFO ] Deduced a trap composed of 41 places in 44 ms of which 0 ms to minimize.
[2024-06-03 00:45:51] [INFO ] Deduced a trap composed of 43 places in 38 ms of which 0 ms to minimize.
[2024-06-03 00:45:56] [INFO ] Deduced a trap composed of 120 places in 110 ms of which 1 ms to minimize.
[2024-06-03 00:45:56] [INFO ] Deduced a trap composed of 120 places in 109 ms of which 1 ms to minimize.
[2024-06-03 00:45:56] [INFO ] Deduced a trap composed of 58 places in 102 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/749 variables, 5/811 constraints. Problems are: Problem set: 0 solved, 581 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 749/750 variables, and 811 constraints, problems are : Problem set: 0 solved, 581 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 197/197 constraints, ReadFeed: 12/13 constraints, PredecessorRefiner: 581/581 constraints, Known Traps: 11/11 constraints]
After SMT, in 60612ms problems are : Problem set: 0 solved, 581 unsolved
Search for dead transitions found 0 dead transitions in 60618ms
Starting structural reductions in SI_LTL mode, iteration 1 : 197/197 places, 582/585 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 60648 ms. Remains : 197/197 places, 582/585 transitions.
Built C files in :
/tmp/ltsmin525085735624463164
[2024-06-03 00:46:06] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin525085735624463164
Running compilation step : cd /tmp/ltsmin525085735624463164;'/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 1053 ms.
Running link step : cd /tmp/ltsmin525085735624463164;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin525085735624463164;'/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' '--hoa' '/tmp/stateBased15418647355720220706.hoa' '--buchi-type=spotba'
LTSmin run took 1783 ms.
Treatment of property FireWire-PT-20-LTLFireability-06 finished in 189544 ms.
FORMULA FireWire-PT-20-LTLFireability-06 FALSE TECHNIQUES LENGTHENING_INSENSITIVE
[2024-06-03 00:46:09] [INFO ] Flatten gal took : 23 ms
All properties solved without resorting to exhaustive model-checking.
Total runtime 1614538 ms.
BK_STOP 1717375569879
--------------------
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-20"
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-20, 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-171734899100324"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/FireWire-PT-20.tgz
mv FireWire-PT-20 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 ;