About the Execution of LTSMin+red for EisenbergMcGuire-PT-10
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 14078.588 | 1674725.00 | 2984058.00 | 3523.40 | FFF?FFFFTFFTFFFF | 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.r492-smll-171636266400204.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 ltsminxred
Input is EisenbergMcGuire-PT-10, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r492-smll-171636266400204
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.5M
-rw-r--r-- 1 mcc users 7.7K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 40K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K May 19 07:09 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 19 15:52 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Apr 22 14:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 22 14:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 120K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.5K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 51K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 19 07:11 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 19 15:25 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 3.1M May 18 16:42 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 EisenbergMcGuire-PT-10-LTLFireability-00
FORMULA_NAME EisenbergMcGuire-PT-10-LTLFireability-01
FORMULA_NAME EisenbergMcGuire-PT-10-LTLFireability-02
FORMULA_NAME EisenbergMcGuire-PT-10-LTLFireability-03
FORMULA_NAME EisenbergMcGuire-PT-10-LTLFireability-04
FORMULA_NAME EisenbergMcGuire-PT-10-LTLFireability-05
FORMULA_NAME EisenbergMcGuire-PT-10-LTLFireability-06
FORMULA_NAME EisenbergMcGuire-PT-10-LTLFireability-07
FORMULA_NAME EisenbergMcGuire-PT-10-LTLFireability-08
FORMULA_NAME EisenbergMcGuire-PT-10-LTLFireability-09
FORMULA_NAME EisenbergMcGuire-PT-10-LTLFireability-10
FORMULA_NAME EisenbergMcGuire-PT-10-LTLFireability-11
FORMULA_NAME EisenbergMcGuire-PT-10-LTLFireability-12
FORMULA_NAME EisenbergMcGuire-PT-10-LTLFireability-13
FORMULA_NAME EisenbergMcGuire-PT-10-LTLFireability-14
FORMULA_NAME EisenbergMcGuire-PT-10-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1717235735276
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=EisenbergMcGuire-PT-10
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 09:55:37] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 09:55:37] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 09:55:39] [INFO ] Load time of PNML (sax parser for PT used): 691 ms
[2024-06-01 09:55:39] [INFO ] Transformed 1090 places.
[2024-06-01 09:55:39] [INFO ] Transformed 5200 transitions.
[2024-06-01 09:55:39] [INFO ] Found NUPN structural information;
[2024-06-01 09:55:39] [INFO ] Parsed PT model containing 1090 places and 5200 transitions and 25400 arcs in 1200 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 25 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA EisenbergMcGuire-PT-10-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EisenbergMcGuire-PT-10-LTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EisenbergMcGuire-PT-10-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 51 out of 1090 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1090/1090 places, 5200/5200 transitions.
Discarding 84 places :
Symmetric choice reduction at 0 with 84 rule applications. Total rules 84 place count 1006 transition count 4360
Iterating global reduction 0 with 84 rules applied. Total rules applied 168 place count 1006 transition count 4360
Applied a total of 168 rules in 397 ms. Remains 1006 /1090 variables (removed 84) and now considering 4360/5200 (removed 840) transitions.
[2024-06-01 09:55:40] [INFO ] Flow matrix only has 1490 transitions (discarded 2870 similar events)
// Phase 1: matrix 1490 rows 1006 cols
[2024-06-01 09:55:40] [INFO ] Computed 31 invariants in 56 ms
[2024-06-01 09:55:42] [INFO ] Implicit Places using invariants in 1983 ms returned []
[2024-06-01 09:55:42] [INFO ] Flow matrix only has 1490 transitions (discarded 2870 similar events)
[2024-06-01 09:55:42] [INFO ] Invariant cache hit.
[2024-06-01 09:55:43] [INFO ] State equation strengthened by 490 read => feed constraints.
[2024-06-01 09:55:55] [INFO ] Implicit Places using invariants and state equation in 13420 ms returned []
Implicit Place search using SMT with State Equation took 15466 ms to find 0 implicit places.
Running 4350 sub problems to find dead transitions.
[2024-06-01 09:55:55] [INFO ] Flow matrix only has 1490 transitions (discarded 2870 similar events)
[2024-06-01 09:55:55] [INFO ] Invariant cache hit.
[2024-06-01 09:55:55] [INFO ] State equation strengthened by 490 read => feed constraints.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1006 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 4350 unsolved
SMT process timed out in 35203ms, After SMT, problems are : Problem set: 0 solved, 4350 unsolved
Search for dead transitions found 0 dead transitions in 35357ms
Starting structural reductions in LTL mode, iteration 1 : 1006/1090 places, 4360/5200 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 51304 ms. Remains : 1006/1090 places, 4360/5200 transitions.
Support contains 51 out of 1006 places after structural reductions.
[2024-06-01 09:56:31] [INFO ] Flatten gal took : 501 ms
[2024-06-01 09:56:32] [INFO ] Flatten gal took : 212 ms
[2024-06-01 09:56:32] [INFO ] Input system was already deterministic with 4360 transitions.
Reduction of identical properties reduced properties to check from 30 to 29
RANDOM walk for 40000 steps (8 resets) in 1964 ms. (20 steps per ms) remains 23/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 58 ms. (67 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 41 ms. (95 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 23/23 properties
[2024-06-01 09:56:33] [INFO ] Flow matrix only has 1490 transitions (discarded 2870 similar events)
[2024-06-01 09:56:33] [INFO ] Invariant cache hit.
[2024-06-01 09:56:33] [INFO ] State equation strengthened by 490 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/46 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 2 (OVERLAPS) 950/996 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/996 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/996 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 5 (OVERLAPS) 10/1006 variables, 8/31 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1006 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 7 (OVERLAPS) 1490/2496 variables, 1006/1037 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2496 variables, 490/1527 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2496 variables, 0/1527 constraints. Problems are: Problem set: 0 solved, 23 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 1.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 (/ 11.0 12.0))
(s11 (/ 1.0 12.0))
(s12 0.0)
(s13 1.0)
(s14 0.0)
(s15 0.0)
(s16 1.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 1.0)
(s21 0.0)
(s22 (/ 1.0 12.0))
(s23 0.0)
(s24 (/ 11.0 12.0))
(s25 (/ 1.0 12.0))
(s26 0.0)
(s27 (/ 11.0 12.0))
(s28 0.0)
(s29 1.0)
(s30 0.0)
(s31 (/ 1.0 12.0))
(s32 0.0)
(s33 (/ 11.0 12.0))
(s34 0.0)
(s35 0.0)
(s36 1.0)
(s37 0.0)
(s38 1.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 (/ 1.0 12.0))
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 1.0)
(s252 0.0)
(s253 1.0)
(s254 0.0)
(s255 1.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 0.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 0.0)
(s352 0.0)
(s353 0.0)
(s354 0.0)
(s355 0.0)
(s356 0.0)
(s357 0.0)
(s358 0.0)
(s359 0.0)
(s360 0.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 0.0)
(s369 0.0)
(s370 0.0)
(s371 0.0)
(s372 0.0)
(s373 0.0)
(s374 0.0)
(s375 0.0)
(s376 0.0)
(s377 0.0)
(s378 0.0)
(s379 0.0)
(s380 0.0)
(s381 0.0)
(s382 0.0)
(s383 0.0)
(s384 0.0)
(s385 0.0)
(s386 0.0)
(s387 0.0)
(s388 0.0)
(s389 0.0)
(s390 0.0)
(s391 0.0)
(s392 0.0)
(s393 0.0)
(s394 0.0)
(s395 0.0)
(s396 0.0)
(s397 0.0)
(s398 0.0)
(s399 0.0)
(s400 0.0)
(s401 0.0)
(s402 0.0)
(s403 0.0)
(s404 0.0)
(s405 0.0)
(s406 0.0)
(s407 0.0)
(s408 0.0)
(s409 0.0)
(s410 0.0)
(s411 0.0)
(s412 0.0)
(s413 0.0)
(s414 0.0)
(s415 0.0)
(s416 0.0)
(s417 0.0)
(s418 0.0)
(s419 0.0)
(s420 0.0)
(s421 0.0)
(s422 0.0)
(s423 0.0)
(s424 0.0)
(s425 0.0)
(s426 0.0)
(s427 0.0)
(s428 0.0)
(s429 0.0)
(s430 0.0)
(s431 0.0)
(s432 0.0)
(s433 0.0)
(s434 0.0)
(s435 0.0)
(s436 0.0)
(s437 0.0)
(s438 0.0)
(s439 0.0)
(s440 0.0)
(s441 0.0)
(s442 0.0)
(s443 0.0)
(s444 0.0)
(s445 0.0)
(s446 0.0)
(s447 0.0)
(s448 0.0)
(s449 0.0)
(s450 0.0)
(s451 (/ 1.0 12.0))
(s452 0.0)
(s453 0.0)
(s454 0.0)
(s455 0.0)
(s456 0.0)
(s457 0.0)
(s458 0.0)
(s459 0.0)
(s460 0.0)
(s461 0.0)
(s462 0.0)
(s463 0.0)
(s464 0.0)
(s465 0.0)
(s466 0.0)
(s467 0.0)
(s468 0.0)
(s469 0.0)
(s470 0.0)
(s471 0.0)
(s472 0.0)
(s473 0.0)
(s474 0.0)
(s475 0.0)
(s476 0.0)
(s477 0.0)
(s478 0.0)
(s479 0.0)
(s480 0.0)
(s481 0.0)
(s482 0.0)
(s483 0.0)
(s484 0.0)
(s485 0.0)
(s486 0.0)
(s487 0.0)
(s488 0.0)
(s489 0.0)
(s490 0.0)
(s491 0.0)
(s492 0.0)
(s493 0.0)
(s494 0.0)
(s495 0.0)
(s496 0.0)
(s497 0.0)
(s498 0.0)
(s499 0.0)
(s500 0.0)
(s501 0.0)
(s502 0.0)
(s503 0.0)
(s504 0.0)
(s505 0.0)
(s506 0.0)
(s507 0.0)
(s508 0.0)
(s509 0.0)
(s510 0.0)
(s511 0.0)
(s512 0.0)
(s513 0.0)
(s514 0.0)
(s515 0.0)
(s516 0.0)
(s517 0.0)
(s518 0.0)
(s519 0.0)
(s520 0.0)
(s521 0.0)
(s522 0.0)
(s523 0.0)
(s524 0.0)
(s525 0.0)
(s526 0.0)
(s527 0.0)
(s528 0.0)
(s529 0.0)
(s530 0.0)
(s531 0.0)
(s532 0.0)
(s533 0.0)
(s534 0.0)
(s535 0.0)
(s536 0.0)
(s537 0.0)
(s538 0.0)
(s539 0.0)
(s540 0.0)
(s541 0.0)
(s542 0.0)
(s543 0.0)
(s544 0.0)
(s545 0.0)
(s546 0.0)
(s547 0.0)
(s548 0.0)
(s549 0.0)
(s550 0.0)
(s551 0.0)
(s552 0.0)
(s553 0.0)
(s554 0.0)
(s555 0.0)
(s556 0.0)
(s557 0.0)
(s558 0.0)
(s559 0.0)
(s560 0.0)
(s561 0.0)
(s562 0.0)
(s563 0.0)
(s564 0.0)
(s565 0.0)
(s566 0.0)
(s567 0.0)
(s568 0.0)
(s569 0.0)
(s570 0.0)
(s571 0.0)
(s572 0.0)
(s573 0.0)
(s574 0.0)
(s575 0.0)
(s576 0.0)
(s577 0.0)
(s578 0.0)
(s579 0.0)
(s580 0.0)
(s581 0.0)
(s582 0.0)
(s583 0.0)
(s584 0.0)
(s585 0.0)
(s586 0.0)
(s587 0.0)
(s588 0.0)
(s589 0.0)
(s590 0.0)
(s591 0.0)
(s592 0.0)
(s593 0.0)
(s594 0.0)
(s595 0.0)
(s596 0.0)
(s597 0.0)
(s598 0.0)
(s599 0.0)
(s600 0.0)
(s601 0.0)
(s602 0.0)
(s603 0.0)
(s604 0.0)
(s605 0.0)
(s606 0.0)
(s607 0.0)
(s608 0.0)
(s609 0.0)
(s610 0.0)
(s611 0.0)
(s612 0.0)
(s613 0.0)
(s614 0.0)
(s615 0.0)
(s616 0.0)
(s617 0.0)
(s618 0.0)
(s619 0.0)
(s620 0.0)
(s621 0.0)
(s622 0.0)
(s623 0.0)
(s624 0.0)
(s625 0.0)
(s626 0.0)
(s627 0.0)
(s628 0.0)
(s629 0.0)
(s630 0.0)
(s631 0.0)
(s632 0.0)
(s633 0.0)
(s634 0.0)
(s635 0.0)
(s636 0.0)
(s637 0.0)
(s638 0.0)
(s639 0.0)
(s640 0.0)
(s641 0.0)
(s642 0.0)
(s643 0.0)
(s644 0.0)
(s645 0.0)
(s646 0.0)
(s647 0.0)
(s648 0.0)
(s649 0.0)
(s650 0.0)
(s651 0.0)
(s652 0.0)
(s653 0.0)
(s654 0.0)
(s655 0.0)
(s656 0.0)
(s657 0.0)
(s658 0.0)
(s659 0.0)
(s660 0.0)
(s661 0.0)
(s662 0.0)
(s663 0.0)
(s664 0.0)
(s665 0.0)
(s666 0.0)
(s667 0.0)
(s668 0.0)
(s669 (/ 11.0 12.0))
(s670 0.0)
(s671 0.0)
(s672 0.0)
(s673 0.0)
(s674 0.0)
(s675 0.0)
(s676 0.0)
(s677 0.0)
(s678 0.0)
(s679 0.0)
(s680 0.0)
(s681 0.0)
(s682 0.0)
(s683 1.0)
(s684 0.0)
(s685 0.0)
(s686 0.0)
(s687 0.0)
(s688 0.0)
(s689 0.0)
(s690 0.0)
(s691 1.0)
(s692 0.0)
(s693 0.0)
(s694 0.0)
(s695 0.0)
(s696 0.0)
(s697 0.0)
(s698 0.0)
(s699 0.0)
(s700 0.0)
(s701 0.0)
(s702 0.0)
(s703 0.0)
(s704 0.0)
(s705 0.0)
(s706 0.0)
(s707 1.0)
(s708 0.0)
(s709 0.0)
(s710 0.0)
(s711 0.0)
(s712 0.0)
(s713 0.0)
(s714 0.0)
(s715 0.0)
(s716 0.0)
(s717 0.0)
(s718 0.0)
(s719 0.0)
(s720 0.0)
(s721 0.0)
(s722 0.0)
(s723 0.0)
(s724 0.0)
(s725 0.0)
(s726 0.0)
(s727 0.0)
(s728 0.0)
(s729 0.0)
(s730 0.0)
(s731 0.0)
(s732 0.0)
(s733 0.0)
(s734 0.0)
(s735 0.0)
(s736 0.0)
(s737 0.0)
(s738 0.0)
(s739 0.0)
(s740 0.0)
(s741 0.0)
(s742 0.0)
(s743 0.0)
(s744 1.0)
(s745 0.0)
(s746 0.0)
(s747 0.0)
(s748 0.0)
(s749 0.0)
(s750 0.0)
(s751 0.0)
(s752 0.0)
(s753 0.0)
(s754 0.0)
(s755 0.0)
(s756 0.0)
(s757 0.0)
(s758 0.0)
(s759 0.0)
(s760 0.0)
(s761 0.0)
(s762 0.0)
(s763 0.0)
(s764 0.0)
(s765 0.0)
(s766 0.0)
(s767 0.0)
(s768 0.0)
(s769 0.0)
(s770 0.0)
(s771 0.0)
(s772 0.0)
(s773 0.0)
(s774 0.0)
(s775 0.0)
(s776 0.0)
(s777 0.0)
(s778 0.0)
(s779 0.0)
(s780 0.0)
(s781 0.0)
(s782 0.0)
(s783 0.0)
(s784 0.0)
(s785 0.0)
(s786 0.0)
(s787 0.0)
(s788 0.0)
(s789 0.0)
(s790 0.0)
(s791 0.0)
(s792 0.0)
(s793 0.0)
(s794 0.0)
(s795 0.0)
(s796 0.0)
(s797 0.0)
(s798 0.0)
(s799 0.0)
(s800 0.0)
(s801 0.0)
(s802 0.0)
(s803 0.0)
(s804 0.0)
(s805 0.0)
(s806 0.0)
(s807 0.0)
(s808 0.0)
(s809 0.0)
(s810 0.0)
(s811 0.0)
(s812 0.0)
(s813 0.0)
(s814 0.0)
(s815 0.0)
(s816 0.0)
(s817 0.0)
(s818 0.0)
(s819 0.0)
(s820 0.0)
(s821 0.0)
(s822 0.0)
(s823 0.0)
(s824 0.0)
(s825 0.0)
(s826 0.0)
(s827 0.0)
(s828 0.0)
(s829 0.0)
(s830 0.0)
(s831 0.0)
(s832 0.0)
(s833 0.0)
(s834 0.0)
(s835 0.0)
(s836 0.0)
(s837 0.0)
(s838 0.0)
(s839 0.0)
(s840 0.0)
(s841 0.0)
(s842 0.0)
(s843 0.0)
(s844 0.0)
(s845 0.0)
(s846 0.0)
(s847 0.0)
(s848 0.0)
(s849 0.0)
(s850 0.0)
(s851 0.0)
(s852 0.0)
(s853 0.0)
(s854 0.0)
(s855 0.0)
(s856 0.0)
(s857 0.0)
(s858 0.0)
(s859 0.0)
(s860 0.0)
(s861 0.0)
(s862 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2496/2496 variables, and 1527 constraints, problems are : Problem set: 0 solved, 23 unsolved in 5022 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 1006/1006 constraints, ReadFeed: 490/490 constraints, PredecessorRefiner: 23/23 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 23 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/46 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 2 (OVERLAPS) 950/996 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/996 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 23 unsolved
[2024-06-01 09:56:40] [INFO ] Deduced a trap composed of 3 places in 1287 ms of which 139 ms to minimize.
[2024-06-01 09:56:42] [INFO ] Deduced a trap composed of 157 places in 1458 ms of which 19 ms to minimize.
[2024-06-01 09:56:43] [INFO ] Deduced a trap composed of 3 places in 131 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 996/2496 variables, and 26 constraints, problems are : Problem set: 0 solved, 23 unsolved in 5013 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 2/10 constraints, State Equation: 0/1006 constraints, ReadFeed: 0/490 constraints, PredecessorRefiner: 0/23 constraints, Known Traps: 3/3 constraints]
After SMT, in 10142ms problems are : Problem set: 0 solved, 23 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 46 out of 1006 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1006/1006 places, 4360/4360 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 1006 transition count 4353
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 14 place count 999 transition count 4353
Performed 307 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 307 Pre rules applied. Total rules applied 14 place count 999 transition count 4046
Deduced a syphon composed of 307 places in 6 ms
Reduce places removed 307 places and 0 transitions.
Iterating global reduction 2 with 614 rules applied. Total rules applied 628 place count 692 transition count 4046
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 629 place count 691 transition count 4036
Iterating global reduction 2 with 1 rules applied. Total rules applied 630 place count 691 transition count 4036
Performed 90 Post agglomeration using F-continuation condition.Transition count delta: 90
Deduced a syphon composed of 90 places in 14 ms
Reduce places removed 90 places and 0 transitions.
Iterating global reduction 2 with 180 rules applied. Total rules applied 810 place count 601 transition count 3946
Applied a total of 810 rules in 732 ms. Remains 601 /1006 variables (removed 405) and now considering 3946/4360 (removed 414) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 733 ms. Remains : 601/1006 places, 3946/4360 transitions.
RANDOM walk for 40000 steps (8 resets) in 886 ms. (45 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 23/23 properties
Interrupted probabilistic random walk after 115676 steps, run timeout after 3001 ms. (steps per millisecond=38 ) properties seen :2 out of 23
Probabilistic random walk after 115676 steps, saw 84713 distinct states, run finished after 3007 ms. (steps per millisecond=38 ) properties seen :2
[2024-06-01 09:56:47] [INFO ] Flow matrix only has 1076 transitions (discarded 2870 similar events)
// Phase 1: matrix 1076 rows 601 cols
[2024-06-01 09:56:47] [INFO ] Computed 31 invariants in 7 ms
[2024-06-01 09:56:47] [INFO ] State equation strengthened by 481 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/44 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 2 (OVERLAPS) 547/591 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/591 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/591 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 5 (OVERLAPS) 10/601 variables, 8/31 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/601 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 7 (OVERLAPS) 1076/1677 variables, 601/632 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1677 variables, 481/1113 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1677 variables, 0/1113 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 10 (OVERLAPS) 0/1677 variables, 0/1113 constraints. Problems are: Problem set: 0 solved, 21 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1677/1677 variables, and 1113 constraints, problems are : Problem set: 0 solved, 21 unsolved in 3872 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 601/601 constraints, ReadFeed: 481/481 constraints, PredecessorRefiner: 21/21 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 21 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/44 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 2 (OVERLAPS) 547/591 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/591 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 21 unsolved
[2024-06-01 09:56:52] [INFO ] Deduced a trap composed of 96 places in 696 ms of which 6 ms to minimize.
[2024-06-01 09:56:53] [INFO ] Deduced a trap composed of 3 places in 105 ms of which 2 ms to minimize.
[2024-06-01 09:56:53] [INFO ] Deduced a trap composed of 113 places in 523 ms of which 4 ms to minimize.
[2024-06-01 09:56:54] [INFO ] Deduced a trap composed of 3 places in 105 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/591 variables, 4/27 constraints. Problems are: Problem set: 0 solved, 21 unsolved
[2024-06-01 09:56:55] [INFO ] Deduced a trap composed of 133 places in 877 ms of which 10 ms to minimize.
[2024-06-01 09:56:56] [INFO ] Deduced a trap composed of 166 places in 987 ms of which 9 ms to minimize.
[2024-06-01 09:56:57] [INFO ] Deduced a trap composed of 164 places in 1077 ms of which 8 ms to minimize.
[2024-06-01 09:56:58] [INFO ] Deduced a trap composed of 144 places in 1060 ms of which 8 ms to minimize.
[2024-06-01 09:56:59] [INFO ] Deduced a trap composed of 32 places in 1063 ms of which 9 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/591 variables, 5/32 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/591 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 7 (OVERLAPS) 10/601 variables, 8/40 constraints. Problems are: Problem set: 0 solved, 21 unsolved
[2024-06-01 09:57:03] [INFO ] Deduced a trap composed of 105 places in 1047 ms of which 10 ms to minimize.
[2024-06-01 09:57:04] [INFO ] Deduced a trap composed of 3 places in 1152 ms of which 10 ms to minimize.
[2024-06-01 09:57:05] [INFO ] Deduced a trap composed of 93 places in 1166 ms of which 9 ms to minimize.
[2024-06-01 09:57:06] [INFO ] Deduced a trap composed of 21 places in 1052 ms of which 8 ms to minimize.
[2024-06-01 09:57:07] [INFO ] Deduced a trap composed of 36 places in 1051 ms of which 9 ms to minimize.
[2024-06-01 09:57:08] [INFO ] Deduced a trap composed of 99 places in 1036 ms of which 9 ms to minimize.
[2024-06-01 09:57:09] [INFO ] Deduced a trap composed of 92 places in 1015 ms of which 9 ms to minimize.
[2024-06-01 09:57:10] [INFO ] Deduced a trap composed of 86 places in 1004 ms of which 9 ms to minimize.
[2024-06-01 09:57:11] [INFO ] Deduced a trap composed of 57 places in 948 ms of which 8 ms to minimize.
[2024-06-01 09:57:12] [INFO ] Deduced a trap composed of 87 places in 1097 ms of which 9 ms to minimize.
[2024-06-01 09:57:13] [INFO ] Deduced a trap composed of 3 places in 1024 ms of which 8 ms to minimize.
[2024-06-01 09:57:13] [INFO ] Deduced a trap composed of 3 places in 126 ms of which 2 ms to minimize.
[2024-06-01 09:57:14] [INFO ] Deduced a trap composed of 15 places in 452 ms of which 5 ms to minimize.
[2024-06-01 09:57:15] [INFO ] Deduced a trap composed of 117 places in 1114 ms of which 9 ms to minimize.
[2024-06-01 09:57:16] [INFO ] Deduced a trap composed of 71 places in 1153 ms of which 10 ms to minimize.
[2024-06-01 09:57:17] [INFO ] Deduced a trap composed of 43 places in 308 ms of which 3 ms to minimize.
[2024-06-01 09:57:17] [INFO ] Deduced a trap composed of 39 places in 194 ms of which 2 ms to minimize.
[2024-06-01 09:57:17] [INFO ] Deduced a trap composed of 3 places in 376 ms of which 4 ms to minimize.
[2024-06-01 09:57:18] [INFO ] Deduced a trap composed of 35 places in 196 ms of which 3 ms to minimize.
[2024-06-01 09:57:18] [INFO ] Deduced a trap composed of 3 places in 130 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/601 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 21 unsolved
[2024-06-01 09:57:19] [INFO ] Deduced a trap composed of 119 places in 1076 ms of which 11 ms to minimize.
[2024-06-01 09:57:20] [INFO ] Deduced a trap composed of 38 places in 1065 ms of which 9 ms to minimize.
[2024-06-01 09:57:21] [INFO ] Deduced a trap composed of 26 places in 1093 ms of which 8 ms to minimize.
[2024-06-01 09:57:22] [INFO ] Deduced a trap composed of 53 places in 982 ms of which 8 ms to minimize.
[2024-06-01 09:57:22] [INFO ] Deduced a trap composed of 3 places in 159 ms of which 2 ms to minimize.
[2024-06-01 09:57:24] [INFO ] Deduced a trap composed of 88 places in 1023 ms of which 8 ms to minimize.
[2024-06-01 09:57:24] [INFO ] Deduced a trap composed of 67 places in 408 ms of which 5 ms to minimize.
[2024-06-01 09:57:25] [INFO ] Deduced a trap composed of 50 places in 392 ms of which 6 ms to minimize.
[2024-06-01 09:57:25] [INFO ] Deduced a trap composed of 52 places in 452 ms of which 4 ms to minimize.
[2024-06-01 09:57:26] [INFO ] Deduced a trap composed of 51 places in 373 ms of which 4 ms to minimize.
[2024-06-01 09:57:26] [INFO ] Deduced a trap composed of 29 places in 334 ms of which 4 ms to minimize.
[2024-06-01 09:57:26] [INFO ] Deduced a trap composed of 31 places in 205 ms of which 2 ms to minimize.
[2024-06-01 09:57:27] [INFO ] Deduced a trap composed of 23 places in 291 ms of which 4 ms to minimize.
[2024-06-01 09:57:27] [INFO ] Deduced a trap composed of 11 places in 750 ms of which 7 ms to minimize.
[2024-06-01 09:57:28] [INFO ] Deduced a trap composed of 13 places in 542 ms of which 6 ms to minimize.
[2024-06-01 09:57:28] [INFO ] Deduced a trap composed of 3 places in 117 ms of which 1 ms to minimize.
[2024-06-01 09:57:29] [INFO ] Deduced a trap composed of 107 places in 1148 ms of which 9 ms to minimize.
[2024-06-01 09:57:31] [INFO ] Deduced a trap composed of 37 places in 1085 ms of which 9 ms to minimize.
[2024-06-01 09:57:31] [INFO ] Deduced a trap composed of 73 places in 794 ms of which 6 ms to minimize.
[2024-06-01 09:57:32] [INFO ] Deduced a trap composed of 80 places in 828 ms of which 9 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/601 variables, 20/80 constraints. Problems are: Problem set: 0 solved, 21 unsolved
[2024-06-01 09:57:33] [INFO ] Deduced a trap composed of 131 places in 860 ms of which 8 ms to minimize.
[2024-06-01 09:57:34] [INFO ] Deduced a trap composed of 108 places in 973 ms of which 9 ms to minimize.
[2024-06-01 09:57:35] [INFO ] Deduced a trap composed of 106 places in 930 ms of which 8 ms to minimize.
[2024-06-01 09:57:36] [INFO ] Deduced a trap composed of 107 places in 958 ms of which 9 ms to minimize.
[2024-06-01 09:57:37] [INFO ] Deduced a trap composed of 113 places in 790 ms of which 6 ms to minimize.
SMT process timed out in 49542ms, After SMT, problems are : Problem set: 0 solved, 21 unsolved
Fused 21 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 44 out of 601 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 601/601 places, 3946/3946 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 601 transition count 3945
Deduced a syphon composed of 1 places in 7 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 600 transition count 3945
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 599 transition count 3935
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 599 transition count 3935
Applied a total of 4 rules in 384 ms. Remains 599 /601 variables (removed 2) and now considering 3935/3946 (removed 11) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 384 ms. Remains : 599/601 places, 3935/3946 transitions.
RANDOM walk for 40000 steps (8 resets) in 638 ms. (62 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 21/21 properties
Interrupted probabilistic random walk after 103136 steps, run timeout after 3001 ms. (steps per millisecond=34 ) properties seen :0 out of 21
Probabilistic random walk after 103136 steps, saw 76476 distinct states, run finished after 3004 ms. (steps per millisecond=34 ) properties seen :0
[2024-06-01 09:57:41] [INFO ] Flow matrix only has 1065 transitions (discarded 2870 similar events)
// Phase 1: matrix 1065 rows 599 cols
[2024-06-01 09:57:41] [INFO ] Computed 31 invariants in 6 ms
[2024-06-01 09:57:41] [INFO ] State equation strengthened by 472 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/44 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 2 (OVERLAPS) 545/589 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/589 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/589 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 5 (OVERLAPS) 10/599 variables, 8/31 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/599 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 7 (OVERLAPS) 1065/1664 variables, 599/630 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1664 variables, 472/1102 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1664 variables, 0/1102 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 10 (OVERLAPS) 0/1664 variables, 0/1102 constraints. Problems are: Problem set: 0 solved, 21 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1664/1664 variables, and 1102 constraints, problems are : Problem set: 0 solved, 21 unsolved in 3748 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 599/599 constraints, ReadFeed: 472/472 constraints, PredecessorRefiner: 21/21 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 21 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/44 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 2 (OVERLAPS) 545/589 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/589 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 21 unsolved
[2024-06-01 09:57:46] [INFO ] Deduced a trap composed of 96 places in 947 ms of which 8 ms to minimize.
[2024-06-01 09:57:46] [INFO ] Deduced a trap composed of 3 places in 120 ms of which 2 ms to minimize.
[2024-06-01 09:57:47] [INFO ] Deduced a trap composed of 101 places in 937 ms of which 8 ms to minimize.
[2024-06-01 09:57:48] [INFO ] Deduced a trap composed of 3 places in 123 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/589 variables, 4/27 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/589 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 6 (OVERLAPS) 10/599 variables, 8/35 constraints. Problems are: Problem set: 0 solved, 21 unsolved
[2024-06-01 09:57:50] [INFO ] Deduced a trap composed of 13 places in 1117 ms of which 9 ms to minimize.
[2024-06-01 09:57:51] [INFO ] Deduced a trap composed of 3 places in 1103 ms of which 9 ms to minimize.
[2024-06-01 09:57:52] [INFO ] Deduced a trap composed of 116 places in 1086 ms of which 9 ms to minimize.
[2024-06-01 09:57:54] [INFO ] Deduced a trap composed of 145 places in 1059 ms of which 10 ms to minimize.
[2024-06-01 09:57:54] [INFO ] Deduced a trap composed of 50 places in 862 ms of which 9 ms to minimize.
[2024-06-01 09:57:56] [INFO ] Deduced a trap composed of 162 places in 1075 ms of which 9 ms to minimize.
[2024-06-01 09:57:57] [INFO ] Deduced a trap composed of 147 places in 985 ms of which 9 ms to minimize.
[2024-06-01 09:57:58] [INFO ] Deduced a trap composed of 158 places in 982 ms of which 9 ms to minimize.
[2024-06-01 09:57:59] [INFO ] Deduced a trap composed of 119 places in 1004 ms of which 9 ms to minimize.
[2024-06-01 09:58:00] [INFO ] Deduced a trap composed of 119 places in 964 ms of which 9 ms to minimize.
[2024-06-01 09:58:01] [INFO ] Deduced a trap composed of 34 places in 982 ms of which 9 ms to minimize.
[2024-06-01 09:58:02] [INFO ] Deduced a trap composed of 32 places in 1062 ms of which 9 ms to minimize.
[2024-06-01 09:58:03] [INFO ] Deduced a trap composed of 135 places in 1049 ms of which 9 ms to minimize.
[2024-06-01 09:58:04] [INFO ] Deduced a trap composed of 140 places in 997 ms of which 9 ms to minimize.
[2024-06-01 09:58:05] [INFO ] Deduced a trap composed of 99 places in 1054 ms of which 9 ms to minimize.
[2024-06-01 09:58:06] [INFO ] Deduced a trap composed of 50 places in 1164 ms of which 9 ms to minimize.
[2024-06-01 09:58:07] [INFO ] Deduced a trap composed of 114 places in 1076 ms of which 8 ms to minimize.
[2024-06-01 09:58:08] [INFO ] Deduced a trap composed of 89 places in 1045 ms of which 9 ms to minimize.
[2024-06-01 09:58:09] [INFO ] Deduced a trap composed of 28 places in 1056 ms of which 9 ms to minimize.
[2024-06-01 09:58:10] [INFO ] Deduced a trap composed of 64 places in 1104 ms of which 8 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/599 variables, 20/55 constraints. Problems are: Problem set: 0 solved, 21 unsolved
[2024-06-01 09:58:11] [INFO ] Deduced a trap composed of 27 places in 986 ms of which 8 ms to minimize.
[2024-06-01 09:58:12] [INFO ] Deduced a trap composed of 24 places in 1011 ms of which 9 ms to minimize.
[2024-06-01 09:58:13] [INFO ] Deduced a trap composed of 100 places in 966 ms of which 9 ms to minimize.
[2024-06-01 09:58:14] [INFO ] Deduced a trap composed of 109 places in 970 ms of which 8 ms to minimize.
[2024-06-01 09:58:15] [INFO ] Deduced a trap composed of 46 places in 1016 ms of which 8 ms to minimize.
[2024-06-01 09:58:16] [INFO ] Deduced a trap composed of 33 places in 366 ms of which 4 ms to minimize.
[2024-06-01 09:58:16] [INFO ] Deduced a trap composed of 32 places in 361 ms of which 4 ms to minimize.
[2024-06-01 09:58:16] [INFO ] Deduced a trap composed of 3 places in 119 ms of which 1 ms to minimize.
[2024-06-01 09:58:17] [INFO ] Deduced a trap composed of 39 places in 210 ms of which 2 ms to minimize.
[2024-06-01 09:58:17] [INFO ] Deduced a trap composed of 3 places in 104 ms of which 1 ms to minimize.
[2024-06-01 09:58:17] [INFO ] Deduced a trap composed of 15 places in 277 ms of which 3 ms to minimize.
[2024-06-01 09:58:18] [INFO ] Deduced a trap composed of 3 places in 205 ms of which 2 ms to minimize.
[2024-06-01 09:58:18] [INFO ] Deduced a trap composed of 67 places in 373 ms of which 3 ms to minimize.
[2024-06-01 09:58:18] [INFO ] Deduced a trap composed of 3 places in 73 ms of which 1 ms to minimize.
[2024-06-01 09:58:18] [INFO ] Deduced a trap composed of 51 places in 218 ms of which 3 ms to minimize.
[2024-06-01 09:58:19] [INFO ] Deduced a trap composed of 39 places in 169 ms of which 2 ms to minimize.
[2024-06-01 09:58:19] [INFO ] Deduced a trap composed of 23 places in 249 ms of which 3 ms to minimize.
[2024-06-01 09:58:19] [INFO ] Deduced a trap composed of 57 places in 181 ms of which 2 ms to minimize.
[2024-06-01 09:58:19] [INFO ] Deduced a trap composed of 27 places in 169 ms of which 2 ms to minimize.
[2024-06-01 09:58:20] [INFO ] Deduced a trap composed of 11 places in 419 ms of which 5 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/599 variables, 20/75 constraints. Problems are: Problem set: 0 solved, 21 unsolved
[2024-06-01 09:58:20] [INFO ] Deduced a trap composed of 35 places in 190 ms of which 2 ms to minimize.
[2024-06-01 09:58:21] [INFO ] Deduced a trap composed of 43 places in 934 ms of which 8 ms to minimize.
[2024-06-01 09:58:22] [INFO ] Deduced a trap composed of 38 places in 984 ms of which 9 ms to minimize.
[2024-06-01 09:58:23] [INFO ] Deduced a trap composed of 3 places in 1046 ms of which 8 ms to minimize.
[2024-06-01 09:58:24] [INFO ] Deduced a trap composed of 37 places in 1071 ms of which 9 ms to minimize.
[2024-06-01 09:58:25] [INFO ] Deduced a trap composed of 97 places in 1070 ms of which 9 ms to minimize.
[2024-06-01 09:58:26] [INFO ] Deduced a trap composed of 31 places in 301 ms of which 3 ms to minimize.
[2024-06-01 09:58:26] [INFO ] Deduced a trap composed of 37 places in 283 ms of which 3 ms to minimize.
[2024-06-01 09:58:27] [INFO ] Deduced a trap composed of 23 places in 286 ms of which 3 ms to minimize.
[2024-06-01 09:58:27] [INFO ] Deduced a trap composed of 13 places in 454 ms of which 4 ms to minimize.
[2024-06-01 09:58:28] [INFO ] Deduced a trap composed of 48 places in 473 ms of which 5 ms to minimize.
[2024-06-01 09:58:28] [INFO ] Deduced a trap composed of 3 places in 114 ms of which 1 ms to minimize.
[2024-06-01 09:58:29] [INFO ] Deduced a trap composed of 87 places in 1069 ms of which 9 ms to minimize.
[2024-06-01 09:58:30] [INFO ] Deduced a trap composed of 74 places in 939 ms of which 8 ms to minimize.
[2024-06-01 09:58:31] [INFO ] Deduced a trap composed of 27 places in 308 ms of which 3 ms to minimize.
[2024-06-01 09:58:31] [INFO ] Deduced a trap composed of 25 places in 368 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/599 variables, 16/91 constraints. Problems are: Problem set: 0 solved, 21 unsolved
[2024-06-01 09:58:32] [INFO ] Deduced a trap composed of 118 places in 1082 ms of which 9 ms to minimize.
[2024-06-01 09:58:33] [INFO ] Deduced a trap composed of 104 places in 1050 ms of which 9 ms to minimize.
[2024-06-01 09:58:35] [INFO ] Deduced a trap composed of 107 places in 1129 ms of which 9 ms to minimize.
[2024-06-01 09:58:36] [INFO ] Deduced a trap composed of 170 places in 1053 ms of which 9 ms to minimize.
[2024-06-01 09:58:37] [INFO ] Deduced a trap composed of 114 places in 1062 ms of which 9 ms to minimize.
[2024-06-01 09:58:38] [INFO ] Deduced a trap composed of 125 places in 1053 ms of which 9 ms to minimize.
[2024-06-01 09:58:39] [INFO ] Deduced a trap composed of 94 places in 1064 ms of which 8 ms to minimize.
[2024-06-01 09:58:40] [INFO ] Deduced a trap composed of 86 places in 967 ms of which 9 ms to minimize.
[2024-06-01 09:58:41] [INFO ] Deduced a trap composed of 109 places in 957 ms of which 8 ms to minimize.
[2024-06-01 09:58:42] [INFO ] Deduced a trap composed of 95 places in 893 ms of which 8 ms to minimize.
[2024-06-01 09:58:44] [INFO ] Deduced a trap composed of 78 places in 1058 ms of which 8 ms to minimize.
[2024-06-01 09:58:45] [INFO ] Deduced a trap composed of 149 places in 1091 ms of which 9 ms to minimize.
[2024-06-01 09:58:46] [INFO ] Deduced a trap composed of 94 places in 1052 ms of which 9 ms to minimize.
[2024-06-01 09:58:47] [INFO ] Deduced a trap composed of 109 places in 1069 ms of which 9 ms to minimize.
[2024-06-01 09:58:48] [INFO ] Deduced a trap composed of 31 places in 1020 ms of which 8 ms to minimize.
[2024-06-01 09:58:49] [INFO ] Deduced a trap composed of 62 places in 1083 ms of which 8 ms to minimize.
[2024-06-01 09:58:50] [INFO ] Deduced a trap composed of 97 places in 730 ms of which 5 ms to minimize.
[2024-06-01 09:58:51] [INFO ] Deduced a trap composed of 68 places in 744 ms of which 7 ms to minimize.
[2024-06-01 09:58:51] [INFO ] Deduced a trap composed of 60 places in 658 ms of which 5 ms to minimize.
[2024-06-01 09:58:52] [INFO ] Deduced a trap composed of 95 places in 533 ms of which 5 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/599 variables, 20/111 constraints. Problems are: Problem set: 0 solved, 21 unsolved
[2024-06-01 09:58:53] [INFO ] Deduced a trap composed of 105 places in 514 ms of which 5 ms to minimize.
[2024-06-01 09:58:54] [INFO ] Deduced a trap composed of 92 places in 547 ms of which 4 ms to minimize.
[2024-06-01 09:58:54] [INFO ] Deduced a trap composed of 21 places in 108 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/599 variables, 3/114 constraints. Problems are: Problem set: 0 solved, 21 unsolved
[2024-06-01 09:58:55] [INFO ] Deduced a trap composed of 106 places in 611 ms of which 5 ms to minimize.
[2024-06-01 09:58:55] [INFO ] Deduced a trap composed of 102 places in 599 ms of which 5 ms to minimize.
[2024-06-01 09:58:56] [INFO ] Deduced a trap composed of 98 places in 585 ms of which 5 ms to minimize.
[2024-06-01 09:58:57] [INFO ] Deduced a trap composed of 92 places in 656 ms of which 6 ms to minimize.
[2024-06-01 09:58:57] [INFO ] Deduced a trap composed of 120 places in 653 ms of which 5 ms to minimize.
[2024-06-01 09:58:58] [INFO ] Deduced a trap composed of 109 places in 623 ms of which 5 ms to minimize.
[2024-06-01 09:58:59] [INFO ] Deduced a trap composed of 114 places in 640 ms of which 5 ms to minimize.
[2024-06-01 09:58:59] [INFO ] Deduced a trap composed of 121 places in 655 ms of which 5 ms to minimize.
[2024-06-01 09:59:00] [INFO ] Deduced a trap composed of 145 places in 646 ms of which 5 ms to minimize.
SMT process timed out in 79145ms, After SMT, problems are : Problem set: 0 solved, 21 unsolved
Fused 21 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 44 out of 599 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 599/599 places, 3935/3935 transitions.
Applied a total of 0 rules in 190 ms. Remains 599 /599 variables (removed 0) and now considering 3935/3935 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 191 ms. Remains : 599/599 places, 3935/3935 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 599/599 places, 3935/3935 transitions.
Applied a total of 0 rules in 183 ms. Remains 599 /599 variables (removed 0) and now considering 3935/3935 (removed 0) transitions.
[2024-06-01 09:59:00] [INFO ] Flow matrix only has 1065 transitions (discarded 2870 similar events)
[2024-06-01 09:59:00] [INFO ] Invariant cache hit.
[2024-06-01 09:59:01] [INFO ] Implicit Places using invariants in 867 ms returned []
[2024-06-01 09:59:01] [INFO ] Flow matrix only has 1065 transitions (discarded 2870 similar events)
[2024-06-01 09:59:01] [INFO ] Invariant cache hit.
[2024-06-01 09:59:02] [INFO ] State equation strengthened by 472 read => feed constraints.
[2024-06-01 09:59:06] [INFO ] Implicit Places using invariants and state equation in 4473 ms returned []
Implicit Place search using SMT with State Equation took 5343 ms to find 0 implicit places.
[2024-06-01 09:59:06] [INFO ] Redundant transitions in 338 ms returned []
Running 3925 sub problems to find dead transitions.
[2024-06-01 09:59:06] [INFO ] Flow matrix only has 1065 transitions (discarded 2870 similar events)
[2024-06-01 09:59:06] [INFO ] Invariant cache hit.
[2024-06-01 09:59:06] [INFO ] State equation strengthened by 472 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/599 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 3925 unsolved
SMT process timed out in 33752ms, After SMT, problems are : Problem set: 0 solved, 3925 unsolved
Search for dead transitions found 0 dead transitions in 33804ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 39689 ms. Remains : 599/599 places, 3935/3935 transitions.
FORMULA EisenbergMcGuire-PT-10-LTLFireability-10 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 0 stabilizing places and 0 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' '!(F((X(G(p0))&&F(p1))))'
Support contains 3 out of 1006 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1006/1006 places, 4360/4360 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 1006 transition count 4350
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 20 place count 996 transition count 4350
Performed 310 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 310 Pre rules applied. Total rules applied 20 place count 996 transition count 4040
Deduced a syphon composed of 310 places in 4 ms
Reduce places removed 310 places and 0 transitions.
Iterating global reduction 2 with 620 rules applied. Total rules applied 640 place count 686 transition count 4040
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 646 place count 680 transition count 3980
Iterating global reduction 2 with 6 rules applied. Total rules applied 652 place count 680 transition count 3980
Performed 90 Post agglomeration using F-continuation condition.Transition count delta: 90
Deduced a syphon composed of 90 places in 4 ms
Reduce places removed 90 places and 0 transitions.
Iterating global reduction 2 with 180 rules applied. Total rules applied 832 place count 590 transition count 3890
Applied a total of 832 rules in 1006 ms. Remains 590 /1006 variables (removed 416) and now considering 3890/4360 (removed 470) transitions.
[2024-06-01 09:59:41] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
// Phase 1: matrix 1020 rows 590 cols
[2024-06-01 09:59:41] [INFO ] Computed 31 invariants in 11 ms
[2024-06-01 09:59:42] [INFO ] Implicit Places using invariants in 925 ms returned []
[2024-06-01 09:59:42] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2024-06-01 09:59:42] [INFO ] Invariant cache hit.
[2024-06-01 09:59:42] [INFO ] State equation strengthened by 436 read => feed constraints.
[2024-06-01 09:59:47] [INFO ] Implicit Places using invariants and state equation in 5349 ms returned []
Implicit Place search using SMT with State Equation took 6283 ms to find 0 implicit places.
[2024-06-01 09:59:48] [INFO ] Redundant transitions in 370 ms returned []
Running 3880 sub problems to find dead transitions.
[2024-06-01 09:59:48] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2024-06-01 09:59:48] [INFO ] Invariant cache hit.
[2024-06-01 09:59:48] [INFO ] State equation strengthened by 436 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/590 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 3880 unsolved
SMT process timed out in 33795ms, After SMT, problems are : Problem set: 0 solved, 3880 unsolved
Search for dead transitions found 0 dead transitions in 33845ms
Starting structural reductions in SI_LTL mode, iteration 1 : 590/1006 places, 3890/4360 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 41521 ms. Remains : 590/1006 places, 3890/4360 transitions.
Stuttering acceptance computed with spot in 400 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Running random walk in product with property : EisenbergMcGuire-PT-10-LTLFireability-00
Product exploration explored 100000 steps with 0 reset in 691 ms.
Product exploration explored 100000 steps with 0 reset in 511 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X (NOT p1)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 110 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 5 states, 12 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 192 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), false, false]
RANDOM walk for 40000 steps (8 resets) in 266 ms. (149 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 155 ms. (256 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 298 ms. (133 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 95 ms. (416 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 109 ms. (363 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 113 ms. (350 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 158400 steps, run timeout after 3001 ms. (steps per millisecond=52 ) properties seen :0 out of 5
Probabilistic random walk after 158400 steps, saw 111431 distinct states, run finished after 3001 ms. (steps per millisecond=52 ) properties seen :0
[2024-06-01 10:00:27] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2024-06-01 10:00:27] [INFO ] Invariant cache hit.
[2024-06-01 10:00:27] [INFO ] State equation strengthened by 436 read => feed constraints.
Problem apf1 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 108/111 variables, 4/4 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/111 variables, 0/4 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 11/122 variables, 1/5 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/122 variables, 0/5 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 4/126 variables, 2/7 constraints. Problems are: Problem set: 1 solved, 4 unsolved
[2024-06-01 10:00:27] [INFO ] Deduced a trap composed of 3 places in 77 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/126 variables, 1/8 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/126 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 348/474 variables, 126/134 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/474 variables, 32/166 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/474 variables, 0/166 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 208/682 variables, 96/262 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/682 variables, 40/302 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/682 variables, 0/302 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 352/1034 variables, 16/318 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1034 variables, 0/318 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 16/1050 variables, 8/326 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1050 variables, 0/326 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 18 (OVERLAPS) 560/1610 variables, 368/694 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1610 variables, 364/1058 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1610 variables, 0/1058 constraints. Problems are: Problem set: 1 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 21 (OVERLAPS) 0/1610 variables, 0/1058 constraints. Problems are: Problem set: 1 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1610/1610 variables, and 1058 constraints, problems are : Problem set: 1 solved, 4 unsolved in 1893 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 590/590 constraints, ReadFeed: 436/436 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 1 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 4 unsolved
Problem apf4 is UNSAT
At refinement iteration 1 (OVERLAPS) 108/111 variables, 4/4 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/111 variables, 0/4 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 11/122 variables, 1/5 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/122 variables, 0/5 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 4/126 variables, 2/7 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/126 variables, 1/8 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/126 variables, 0/8 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 348/474 variables, 126/134 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/474 variables, 32/166 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/474 variables, 0/166 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 208/682 variables, 96/262 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/682 variables, 40/302 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/682 variables, 0/302 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 352/1034 variables, 16/318 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1034 variables, 0/318 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 16/1050 variables, 8/326 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1050 variables, 3/329 constraints. Problems are: Problem set: 2 solved, 3 unsolved
[2024-06-01 10:00:30] [INFO ] Deduced a trap composed of 3 places in 446 ms of which 3 ms to minimize.
[2024-06-01 10:00:30] [INFO ] Deduced a trap composed of 3 places in 430 ms of which 3 ms to minimize.
[2024-06-01 10:00:31] [INFO ] Deduced a trap composed of 4 places in 444 ms of which 3 ms to minimize.
[2024-06-01 10:00:31] [INFO ] Deduced a trap composed of 46 places in 501 ms of which 4 ms to minimize.
[2024-06-01 10:00:32] [INFO ] Deduced a trap composed of 3 places in 482 ms of which 4 ms to minimize.
[2024-06-01 10:00:32] [INFO ] Deduced a trap composed of 3 places in 399 ms of which 3 ms to minimize.
[2024-06-01 10:00:33] [INFO ] Deduced a trap composed of 13 places in 389 ms of which 4 ms to minimize.
[2024-06-01 10:00:33] [INFO ] Deduced a trap composed of 17 places in 405 ms of which 4 ms to minimize.
[2024-06-01 10:00:34] [INFO ] Deduced a trap composed of 34 places in 411 ms of which 4 ms to minimize.
[2024-06-01 10:00:34] [INFO ] Deduced a trap composed of 43 places in 345 ms of which 3 ms to minimize.
SMT process timed out in 7069ms, After SMT, problems are : Problem set: 2 solved, 3 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 3 out of 590 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 3890/3890 transitions.
Applied a total of 0 rules in 176 ms. Remains 590 /590 variables (removed 0) and now considering 3890/3890 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 177 ms. Remains : 590/590 places, 3890/3890 transitions.
RANDOM walk for 40000 steps (8 resets) in 325 ms. (122 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 125 ms. (317 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 77 ms. (512 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 68 ms. (579 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 163361 steps, run timeout after 3001 ms. (steps per millisecond=54 ) properties seen :0 out of 3
Probabilistic random walk after 163361 steps, saw 114919 distinct states, run finished after 3001 ms. (steps per millisecond=54 ) properties seen :0
[2024-06-01 10:00:37] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2024-06-01 10:00:37] [INFO ] Invariant cache hit.
[2024-06-01 10:00:37] [INFO ] State equation strengthened by 436 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 108/111 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/111 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 11/122 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/122 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 4/126 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 10:00:38] [INFO ] Deduced a trap composed of 3 places in 65 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/126 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/126 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 348/474 variables, 126/134 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/474 variables, 32/166 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/474 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 208/682 variables, 96/262 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/682 variables, 40/302 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/682 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 352/1034 variables, 16/318 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1034 variables, 0/318 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 16/1050 variables, 8/326 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1050 variables, 0/326 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (OVERLAPS) 560/1610 variables, 368/694 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1610 variables, 364/1058 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1610 variables, 0/1058 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 21 (OVERLAPS) 0/1610 variables, 0/1058 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1610/1610 variables, and 1058 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1397 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 590/590 constraints, ReadFeed: 436/436 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 108/111 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/111 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 11/122 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/122 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 4/126 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/126 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/126 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 348/474 variables, 126/134 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/474 variables, 32/166 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/474 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 208/682 variables, 96/262 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/682 variables, 40/302 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/682 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 352/1034 variables, 16/318 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1034 variables, 0/318 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 16/1050 variables, 8/326 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1050 variables, 3/329 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 10:00:40] [INFO ] Deduced a trap composed of 3 places in 265 ms of which 3 ms to minimize.
[2024-06-01 10:00:40] [INFO ] Deduced a trap composed of 3 places in 420 ms of which 3 ms to minimize.
[2024-06-01 10:00:40] [INFO ] Deduced a trap composed of 3 places in 411 ms of which 3 ms to minimize.
[2024-06-01 10:00:41] [INFO ] Deduced a trap composed of 3 places in 390 ms of which 4 ms to minimize.
[2024-06-01 10:00:41] [INFO ] Deduced a trap composed of 42 places in 417 ms of which 3 ms to minimize.
[2024-06-01 10:00:42] [INFO ] Deduced a trap composed of 64 places in 435 ms of which 3 ms to minimize.
[2024-06-01 10:00:42] [INFO ] Deduced a trap composed of 7 places in 359 ms of which 3 ms to minimize.
[2024-06-01 10:00:43] [INFO ] Deduced a trap composed of 40 places in 434 ms of which 4 ms to minimize.
[2024-06-01 10:00:43] [INFO ] Deduced a trap composed of 27 places in 394 ms of which 4 ms to minimize.
[2024-06-01 10:00:43] [INFO ] Deduced a trap composed of 4 places in 394 ms of which 3 ms to minimize.
[2024-06-01 10:00:44] [INFO ] Deduced a trap composed of 24 places in 386 ms of which 4 ms to minimize.
[2024-06-01 10:00:44] [INFO ] Deduced a trap composed of 45 places in 418 ms of which 4 ms to minimize.
[2024-06-01 10:00:45] [INFO ] Deduced a trap composed of 33 places in 411 ms of which 4 ms to minimize.
[2024-06-01 10:00:45] [INFO ] Deduced a trap composed of 64 places in 350 ms of which 3 ms to minimize.
[2024-06-01 10:00:45] [INFO ] Deduced a trap composed of 34 places in 360 ms of which 4 ms to minimize.
[2024-06-01 10:00:46] [INFO ] Deduced a trap composed of 26 places in 301 ms of which 2 ms to minimize.
[2024-06-01 10:00:46] [INFO ] Deduced a trap composed of 47 places in 313 ms of which 3 ms to minimize.
[2024-06-01 10:00:46] [INFO ] Deduced a trap composed of 31 places in 266 ms of which 3 ms to minimize.
[2024-06-01 10:00:47] [INFO ] Deduced a trap composed of 119 places in 569 ms of which 5 ms to minimize.
[2024-06-01 10:00:47] [INFO ] Deduced a trap composed of 40 places in 261 ms of which 3 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/1050 variables, 20/349 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 10:00:48] [INFO ] Deduced a trap composed of 39 places in 262 ms of which 3 ms to minimize.
[2024-06-01 10:00:48] [INFO ] Deduced a trap composed of 29 places in 187 ms of which 2 ms to minimize.
[2024-06-01 10:00:48] [INFO ] Deduced a trap composed of 34 places in 264 ms of which 3 ms to minimize.
[2024-06-01 10:00:49] [INFO ] Deduced a trap composed of 35 places in 628 ms of which 5 ms to minimize.
[2024-06-01 10:00:49] [INFO ] Deduced a trap composed of 58 places in 644 ms of which 5 ms to minimize.
[2024-06-01 10:00:50] [INFO ] Deduced a trap composed of 58 places in 585 ms of which 5 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/1050 variables, 6/355 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1050 variables, 0/355 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (OVERLAPS) 560/1610 variables, 368/723 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1610 variables, 364/1087 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1610 variables, 0/1087 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 24 (OVERLAPS) 0/1610 variables, 0/1087 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1610/1610 variables, and 1087 constraints, problems are : Problem set: 0 solved, 3 unsolved in 12489 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 590/590 constraints, ReadFeed: 436/436 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 27/27 constraints]
After SMT, in 13915ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Finished Parikh walk after 30020 steps, including 514 resets, run visited all 3 properties in 642 ms. (steps per millisecond=46 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 3 properties in 662 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X (NOT p1)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X (NOT p1))), (G (OR p0 p1)), (G (OR (NOT p0) (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT (OR p0 (NOT p1)))), (F (NOT p0))]
Knowledge based reduction with 9 factoid took 228 ms. Reduced automaton from 5 states, 12 edges and 2 AP (stutter insensitive) to 4 states, 8 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 140 ms :[true, p1, (NOT p1), false]
Stuttering acceptance computed with spot in 137 ms :[true, p1, (NOT p1), false]
[2024-06-01 10:00:52] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2024-06-01 10:00:52] [INFO ] Invariant cache hit.
Proved EG true
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X (NOT p1)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X (NOT p1))), (G (OR p0 p1)), (G (OR (NOT p0) (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT (OR p0 (NOT p1)))), (F (NOT p0)), true]
Knowledge based reduction with 9 factoid took 257 ms. Reduced automaton from 4 states, 8 edges and 1 AP (stutter insensitive) to 4 states, 8 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 143 ms :[true, p1, (NOT p1), false]
Support contains 3 out of 590 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 590/590 places, 3890/3890 transitions.
Applied a total of 0 rules in 174 ms. Remains 590 /590 variables (removed 0) and now considering 3890/3890 (removed 0) transitions.
[2024-06-01 10:00:56] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2024-06-01 10:00:56] [INFO ] Invariant cache hit.
[2024-06-01 10:00:57] [INFO ] Implicit Places using invariants in 1095 ms returned []
[2024-06-01 10:00:57] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2024-06-01 10:00:57] [INFO ] Invariant cache hit.
[2024-06-01 10:00:58] [INFO ] State equation strengthened by 436 read => feed constraints.
[2024-06-01 10:01:02] [INFO ] Implicit Places using invariants and state equation in 5006 ms returned []
Implicit Place search using SMT with State Equation took 6103 ms to find 0 implicit places.
[2024-06-01 10:01:02] [INFO ] Redundant transitions in 176 ms returned []
Running 3880 sub problems to find dead transitions.
[2024-06-01 10:01:02] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2024-06-01 10:01:02] [INFO ] Invariant cache hit.
[2024-06-01 10:01:02] [INFO ] State equation strengthened by 436 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/590 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 3880 unsolved
SMT process timed out in 33794ms, After SMT, problems are : Problem set: 0 solved, 3880 unsolved
Search for dead transitions found 0 dead transitions in 33839ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 40315 ms. Remains : 590/590 places, 3890/3890 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p1), (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 167 ms. Reduced automaton from 4 states, 8 edges and 1 AP (stutter insensitive) to 4 states, 8 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 137 ms :[true, p1, (NOT p1), false]
RANDOM walk for 40000 steps (8 resets) in 309 ms. (129 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 76 ms. (519 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 291291 steps, run timeout after 3001 ms. (steps per millisecond=97 ) properties seen :0 out of 1
Probabilistic random walk after 291291 steps, saw 196573 distinct states, run finished after 3001 ms. (steps per millisecond=97 ) properties seen :0
[2024-06-01 10:01:40] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2024-06-01 10:01:40] [INFO ] Invariant cache hit.
[2024-06-01 10:01:40] [INFO ] State equation strengthened by 436 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 108/111 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/111 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 11/122 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/122 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 4/126 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/126 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 348/474 variables, 126/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/474 variables, 32/165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/474 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 208/682 variables, 96/261 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/682 variables, 40/301 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/682 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 352/1034 variables, 16/317 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1034 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 16/1050 variables, 8/325 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1050 variables, 0/325 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 560/1610 variables, 368/693 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 18 (INCLUDED_ONLY) 0/1610 variables, 364/1057 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1610 variables, 0/1057 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/1610 variables, 0/1057 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1610/1610 variables, and 1057 constraints, problems are : Problem set: 0 solved, 1 unsolved in 753 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 590/590 constraints, ReadFeed: 436/436 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/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 108/111 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/111 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 11/122 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/122 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 4/126 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 10:01:41] [INFO ] Deduced a trap composed of 3 places in 66 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/126 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/126 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 348/474 variables, 126/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/474 variables, 32/166 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/474 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 208/682 variables, 96/262 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/682 variables, 40/302 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/682 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 352/1034 variables, 16/318 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1034 variables, 0/318 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 16/1050 variables, 8/326 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1050 variables, 1/327 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 10:01:41] [INFO ] Deduced a trap composed of 3 places in 335 ms of which 3 ms to minimize.
[2024-06-01 10:01:42] [INFO ] Deduced a trap composed of 3 places in 425 ms of which 3 ms to minimize.
[2024-06-01 10:01:42] [INFO ] Deduced a trap composed of 3 places in 425 ms of which 3 ms to minimize.
[2024-06-01 10:01:43] [INFO ] Deduced a trap composed of 3 places in 422 ms of which 3 ms to minimize.
[2024-06-01 10:01:43] [INFO ] Deduced a trap composed of 42 places in 426 ms of which 4 ms to minimize.
[2024-06-01 10:01:43] [INFO ] Deduced a trap composed of 64 places in 418 ms of which 4 ms to minimize.
[2024-06-01 10:01:44] [INFO ] Deduced a trap composed of 7 places in 358 ms of which 3 ms to minimize.
[2024-06-01 10:01:44] [INFO ] Deduced a trap composed of 3 places in 383 ms of which 3 ms to minimize.
[2024-06-01 10:01:45] [INFO ] Deduced a trap composed of 17 places in 380 ms of which 3 ms to minimize.
[2024-06-01 10:01:45] [INFO ] Deduced a trap composed of 34 places in 329 ms of which 3 ms to minimize.
[2024-06-01 10:01:45] [INFO ] Deduced a trap composed of 50 places in 271 ms of which 3 ms to minimize.
[2024-06-01 10:01:46] [INFO ] Deduced a trap composed of 23 places in 223 ms of which 2 ms to minimize.
SMT process timed out in 5904ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 3 out of 590 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 3890/3890 transitions.
Applied a total of 0 rules in 168 ms. Remains 590 /590 variables (removed 0) and now considering 3890/3890 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 169 ms. Remains : 590/590 places, 3890/3890 transitions.
RANDOM walk for 40000 steps (8 resets) in 178 ms. (223 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 83 ms. (476 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 283987 steps, run timeout after 3001 ms. (steps per millisecond=94 ) properties seen :0 out of 1
Probabilistic random walk after 283987 steps, saw 192292 distinct states, run finished after 3001 ms. (steps per millisecond=94 ) properties seen :0
[2024-06-01 10:01:49] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2024-06-01 10:01:49] [INFO ] Invariant cache hit.
[2024-06-01 10:01:49] [INFO ] State equation strengthened by 436 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 108/111 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/111 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 11/122 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/122 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 4/126 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/126 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 348/474 variables, 126/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/474 variables, 32/165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/474 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 208/682 variables, 96/261 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/682 variables, 40/301 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/682 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 352/1034 variables, 16/317 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1034 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 16/1050 variables, 8/325 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1050 variables, 0/325 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 560/1610 variables, 368/693 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 18 (INCLUDED_ONLY) 0/1610 variables, 364/1057 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1610 variables, 0/1057 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/1610 variables, 0/1057 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1610/1610 variables, and 1057 constraints, problems are : Problem set: 0 solved, 1 unsolved in 729 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 590/590 constraints, ReadFeed: 436/436 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/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 108/111 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/111 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 11/122 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/122 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 4/126 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 10:01:50] [INFO ] Deduced a trap composed of 3 places in 65 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/126 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/126 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 348/474 variables, 126/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/474 variables, 32/166 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/474 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 208/682 variables, 96/262 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/682 variables, 40/302 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/682 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 352/1034 variables, 16/318 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1034 variables, 0/318 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 16/1050 variables, 8/326 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1050 variables, 1/327 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 10:01:50] [INFO ] Deduced a trap composed of 3 places in 343 ms of which 2 ms to minimize.
[2024-06-01 10:01:51] [INFO ] Deduced a trap composed of 3 places in 436 ms of which 3 ms to minimize.
[2024-06-01 10:01:51] [INFO ] Deduced a trap composed of 3 places in 435 ms of which 3 ms to minimize.
[2024-06-01 10:01:52] [INFO ] Deduced a trap composed of 3 places in 434 ms of which 3 ms to minimize.
[2024-06-01 10:01:52] [INFO ] Deduced a trap composed of 42 places in 428 ms of which 3 ms to minimize.
[2024-06-01 10:01:53] [INFO ] Deduced a trap composed of 64 places in 440 ms of which 4 ms to minimize.
[2024-06-01 10:01:53] [INFO ] Deduced a trap composed of 7 places in 364 ms of which 3 ms to minimize.
[2024-06-01 10:01:53] [INFO ] Deduced a trap composed of 3 places in 403 ms of which 4 ms to minimize.
[2024-06-01 10:01:54] [INFO ] Deduced a trap composed of 17 places in 411 ms of which 3 ms to minimize.
[2024-06-01 10:01:54] [INFO ] Deduced a trap composed of 34 places in 338 ms of which 3 ms to minimize.
[2024-06-01 10:01:55] [INFO ] Deduced a trap composed of 50 places in 276 ms of which 3 ms to minimize.
[2024-06-01 10:01:55] [INFO ] Deduced a trap composed of 23 places in 241 ms of which 2 ms to minimize.
[2024-06-01 10:01:55] [INFO ] Deduced a trap composed of 25 places in 192 ms of which 2 ms to minimize.
[2024-06-01 10:01:55] [INFO ] Deduced a trap composed of 21 places in 214 ms of which 2 ms to minimize.
[2024-06-01 10:01:55] [INFO ] Deduced a trap composed of 25 places in 137 ms of which 2 ms to minimize.
[2024-06-01 10:01:56] [INFO ] Deduced a trap composed of 23 places in 289 ms of which 3 ms to minimize.
[2024-06-01 10:01:56] [INFO ] Deduced a trap composed of 27 places in 221 ms of which 2 ms to minimize.
[2024-06-01 10:01:56] [INFO ] Deduced a trap composed of 31 places in 249 ms of which 2 ms to minimize.
[2024-06-01 10:01:57] [INFO ] Deduced a trap composed of 25 places in 244 ms of which 3 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/1050 variables, 19/346 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1050 variables, 0/346 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 560/1610 variables, 368/714 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1610 variables, 364/1078 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1610 variables, 0/1078 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/1610 variables, 0/1078 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1610/1610 variables, and 1078 constraints, problems are : Problem set: 0 solved, 1 unsolved in 7536 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 590/590 constraints, ReadFeed: 436/436 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 20/20 constraints]
After SMT, in 8291ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 18298 steps, including 334 resets, run visited all 1 properties in 114 ms. (steps per millisecond=160 )
Parikh walk visited 1 properties in 115 ms.
Knowledge obtained : [(NOT p1), (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 3 factoid took 107 ms. Reduced automaton from 4 states, 8 edges and 1 AP (stutter insensitive) to 4 states, 8 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 141 ms :[true, p1, (NOT p1), false]
Stuttering acceptance computed with spot in 139 ms :[true, p1, (NOT p1), false]
[2024-06-01 10:01:58] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2024-06-01 10:01:58] [INFO ] Invariant cache hit.
Proved EG true
Knowledge obtained : [(NOT p1), (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), true]
Knowledge based reduction with 3 factoid took 135 ms. Reduced automaton from 4 states, 8 edges and 1 AP (stutter insensitive) to 4 states, 8 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 144 ms :[true, p1, (NOT p1), false]
Stuttering acceptance computed with spot in 138 ms :[true, p1, (NOT p1), false]
Product exploration explored 100000 steps with 0 reset in 369 ms.
Product exploration explored 100000 steps with 0 reset in 458 ms.
Support contains 3 out of 590 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 590/590 places, 3890/3890 transitions.
Applied a total of 0 rules in 171 ms. Remains 590 /590 variables (removed 0) and now considering 3890/3890 (removed 0) transitions.
[2024-06-01 10:02:03] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2024-06-01 10:02:03] [INFO ] Invariant cache hit.
[2024-06-01 10:02:04] [INFO ] Implicit Places using invariants in 1296 ms returned []
[2024-06-01 10:02:04] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2024-06-01 10:02:04] [INFO ] Invariant cache hit.
[2024-06-01 10:02:04] [INFO ] State equation strengthened by 436 read => feed constraints.
[2024-06-01 10:02:09] [INFO ] Implicit Places using invariants and state equation in 5324 ms returned []
Implicit Place search using SMT with State Equation took 6623 ms to find 0 implicit places.
[2024-06-01 10:02:09] [INFO ] Redundant transitions in 174 ms returned []
Running 3880 sub problems to find dead transitions.
[2024-06-01 10:02:09] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2024-06-01 10:02:09] [INFO ] Invariant cache hit.
[2024-06-01 10:02:09] [INFO ] State equation strengthened by 436 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/590 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 3880 unsolved
SMT process timed out in 33690ms, After SMT, problems are : Problem set: 0 solved, 3880 unsolved
Search for dead transitions found 0 dead transitions in 33735ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 40718 ms. Remains : 590/590 places, 3890/3890 transitions.
Treatment of property EisenbergMcGuire-PT-10-LTLFireability-00 finished in 183632 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0 U (G(p0)||(G(p2)&&p1))))))'
Support contains 7 out of 1006 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1006/1006 places, 4360/4360 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 1006 transition count 4350
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 20 place count 996 transition count 4350
Performed 308 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 308 Pre rules applied. Total rules applied 20 place count 996 transition count 4042
Deduced a syphon composed of 308 places in 5 ms
Reduce places removed 308 places and 0 transitions.
Iterating global reduction 2 with 616 rules applied. Total rules applied 636 place count 688 transition count 4042
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 642 place count 682 transition count 3982
Iterating global reduction 2 with 6 rules applied. Total rules applied 648 place count 682 transition count 3982
Performed 90 Post agglomeration using F-continuation condition.Transition count delta: 90
Deduced a syphon composed of 90 places in 4 ms
Reduce places removed 90 places and 0 transitions.
Iterating global reduction 2 with 180 rules applied. Total rules applied 828 place count 592 transition count 3892
Applied a total of 828 rules in 333 ms. Remains 592 /1006 variables (removed 414) and now considering 3892/4360 (removed 468) transitions.
[2024-06-01 10:02:44] [INFO ] Flow matrix only has 1022 transitions (discarded 2870 similar events)
// Phase 1: matrix 1022 rows 592 cols
[2024-06-01 10:02:44] [INFO ] Computed 31 invariants in 5 ms
[2024-06-01 10:02:45] [INFO ] Implicit Places using invariants in 1110 ms returned []
[2024-06-01 10:02:45] [INFO ] Flow matrix only has 1022 transitions (discarded 2870 similar events)
[2024-06-01 10:02:45] [INFO ] Invariant cache hit.
[2024-06-01 10:02:46] [INFO ] State equation strengthened by 436 read => feed constraints.
[2024-06-01 10:02:50] [INFO ] Implicit Places using invariants and state equation in 4785 ms returned []
Implicit Place search using SMT with State Equation took 5899 ms to find 0 implicit places.
[2024-06-01 10:02:50] [INFO ] Redundant transitions in 196 ms returned []
Running 3882 sub problems to find dead transitions.
[2024-06-01 10:02:50] [INFO ] Flow matrix only has 1022 transitions (discarded 2870 similar events)
[2024-06-01 10:02:50] [INFO ] Invariant cache hit.
[2024-06-01 10:02:50] [INFO ] State equation strengthened by 436 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/592 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 3882 unsolved
SMT process timed out in 33677ms, After SMT, problems are : Problem set: 0 solved, 3882 unsolved
Search for dead transitions found 0 dead transitions in 33722ms
Starting structural reductions in SI_LTL mode, iteration 1 : 592/1006 places, 3892/4360 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 40167 ms. Remains : 592/1006 places, 3892/4360 transitions.
Stuttering acceptance computed with spot in 133 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : EisenbergMcGuire-PT-10-LTLFireability-01
Product exploration explored 100000 steps with 0 reset in 451 ms.
Stack based approach found an accepted trace after 8 steps with 0 reset with depth 9 and stack size 9 in 1 ms.
FORMULA EisenbergMcGuire-PT-10-LTLFireability-01 FALSE TECHNIQUES STACK_TEST
Treatment of property EisenbergMcGuire-PT-10-LTLFireability-01 finished in 40792 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(G(!p0)) U (X(p2)&&p1))))'
Support contains 6 out of 1006 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1006/1006 places, 4360/4360 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 1000 transition count 4300
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 1000 transition count 4300
Applied a total of 12 rules in 58 ms. Remains 1000 /1006 variables (removed 6) and now considering 4300/4360 (removed 60) transitions.
[2024-06-01 10:03:24] [INFO ] Flow matrix only has 1430 transitions (discarded 2870 similar events)
// Phase 1: matrix 1430 rows 1000 cols
[2024-06-01 10:03:24] [INFO ] Computed 31 invariants in 7 ms
[2024-06-01 10:03:26] [INFO ] Implicit Places using invariants in 1259 ms returned []
[2024-06-01 10:03:26] [INFO ] Flow matrix only has 1430 transitions (discarded 2870 similar events)
[2024-06-01 10:03:26] [INFO ] Invariant cache hit.
[2024-06-01 10:03:26] [INFO ] State equation strengthened by 436 read => feed constraints.
[2024-06-01 10:03:37] [INFO ] Implicit Places using invariants and state equation in 10872 ms returned []
Implicit Place search using SMT with State Equation took 12142 ms to find 0 implicit places.
Running 4290 sub problems to find dead transitions.
[2024-06-01 10:03:37] [INFO ] Flow matrix only has 1430 transitions (discarded 2870 similar events)
[2024-06-01 10:03:37] [INFO ] Invariant cache hit.
[2024-06-01 10:03:37] [INFO ] State equation strengthened by 436 read => feed constraints.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1000 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 4290 unsolved
SMT process timed out in 34342ms, After SMT, problems are : Problem set: 0 solved, 4290 unsolved
Search for dead transitions found 0 dead transitions in 34391ms
Starting structural reductions in LTL mode, iteration 1 : 1000/1006 places, 4300/4360 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 46602 ms. Remains : 1000/1006 places, 4300/4360 transitions.
Stuttering acceptance computed with spot in 182 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), p0, (NOT p2), true]
Running random walk in product with property : EisenbergMcGuire-PT-10-LTLFireability-02
Product exploration explored 100000 steps with 0 reset in 386 ms.
Product exploration explored 100000 steps with 0 reset in 541 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT p1))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (AND (NOT p1) (NOT p0) (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 128 ms. Reduced automaton from 5 states, 11 edges and 3 AP (stutter sensitive) to 5 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 185 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), p0, (NOT p2), true]
RANDOM walk for 40000 steps (8 resets) in 514 ms. (77 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 45 ms. (869 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 51 ms. (769 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 94 ms. (421 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 82 ms. (481 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 93 ms. (425 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 411 ms. (97 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 160 ms. (248 steps per ms) remains 7/7 properties
Interrupted probabilistic random walk after 92081 steps, run timeout after 3001 ms. (steps per millisecond=30 ) properties seen :0 out of 7
Probabilistic random walk after 92081 steps, saw 75323 distinct states, run finished after 3001 ms. (steps per millisecond=30 ) properties seen :0
[2024-06-01 10:04:16] [INFO ] Flow matrix only has 1430 transitions (discarded 2870 similar events)
[2024-06-01 10:04:16] [INFO ] Invariant cache hit.
[2024-06-01 10:04:16] [INFO ] State equation strengthened by 436 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 363/369 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/369 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 30/399 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/399 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 7/406 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-06-01 10:04:16] [INFO ] Deduced a trap composed of 3 places in 81 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/406 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/406 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (OVERLAPS) 680/1086 variables, 406/420 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1086 variables, 92/512 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-06-01 10:04:17] [INFO ] Deduced a trap composed of 3 places in 90 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/1086 variables, 1/513 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1086 variables, 0/513 constraints. Problems are: Problem set: 0 solved, 7 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 156/1242 variables, 72/585 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1242 variables, 34/619 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1242 variables, 0/619 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 15 (OVERLAPS) 509/1751 variables, 11/630 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1751 variables, 0/630 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 17 (OVERLAPS) 2/1753 variables, 1/631 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1753 variables, 0/631 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 19 (OVERLAPS) 11/1764 variables, 6/637 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1764 variables, 0/637 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 21 (OVERLAPS) 666/2430 variables, 522/1159 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/2430 variables, 310/1469 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/2430 variables, 0/1469 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 24 (OVERLAPS) 0/2430 variables, 0/1469 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2430/2430 variables, and 1469 constraints, problems are : Problem set: 0 solved, 7 unsolved in 3878 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 1000/1000 constraints, ReadFeed: 436/436 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 363/369 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/369 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 30/399 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/399 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 7/406 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/406 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-06-01 10:04:21] [INFO ] Deduced a trap composed of 44 places in 229 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/406 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/406 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (OVERLAPS) 680/1086 variables, 406/422 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1086 variables, 92/514 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-06-01 10:04:21] [INFO ] Deduced a trap composed of 3 places in 91 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/1086 variables, 1/515 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1086 variables, 0/515 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (OVERLAPS) 156/1242 variables, 72/587 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1242 variables, 34/621 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1242 variables, 0/621 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 16 (OVERLAPS) 509/1751 variables, 11/632 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1751 variables, 0/632 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 18 (OVERLAPS) 2/1753 variables, 1/633 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1753 variables, 0/633 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 20 (OVERLAPS) 11/1764 variables, 6/639 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1764 variables, 7/646 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-06-01 10:04:24] [INFO ] Deduced a trap composed of 4 places in 682 ms of which 6 ms to minimize.
[2024-06-01 10:04:24] [INFO ] Deduced a trap composed of 3 places in 681 ms of which 7 ms to minimize.
[2024-06-01 10:04:25] [INFO ] Deduced a trap composed of 3 places in 536 ms of which 5 ms to minimize.
SMT process timed out in 9055ms, After SMT, problems are : Problem set: 0 solved, 7 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 6 out of 1000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1000/1000 places, 4300/4300 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 1000 transition count 4290
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 20 place count 990 transition count 4290
Performed 309 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 309 Pre rules applied. Total rules applied 20 place count 990 transition count 3981
Deduced a syphon composed of 309 places in 4 ms
Reduce places removed 309 places and 0 transitions.
Iterating global reduction 2 with 618 rules applied. Total rules applied 638 place count 681 transition count 3981
Performed 90 Post agglomeration using F-continuation condition.Transition count delta: 90
Deduced a syphon composed of 90 places in 4 ms
Reduce places removed 90 places and 0 transitions.
Iterating global reduction 2 with 180 rules applied. Total rules applied 818 place count 591 transition count 3891
Applied a total of 818 rules in 291 ms. Remains 591 /1000 variables (removed 409) and now considering 3891/4300 (removed 409) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 292 ms. Remains : 591/1000 places, 3891/4300 transitions.
RANDOM walk for 40000 steps (8 resets) in 1622 ms. (24 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 148 ms. (268 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 134 ms. (296 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 120 ms. (330 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 127 ms. (312 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 176 ms. (226 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 139 ms. (285 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 148 ms. (268 steps per ms) remains 7/7 properties
Interrupted probabilistic random walk after 97570 steps, run timeout after 3001 ms. (steps per millisecond=32 ) properties seen :0 out of 7
Probabilistic random walk after 97570 steps, saw 71613 distinct states, run finished after 3001 ms. (steps per millisecond=32 ) properties seen :0
[2024-06-01 10:04:29] [INFO ] Flow matrix only has 1021 transitions (discarded 2870 similar events)
// Phase 1: matrix 1021 rows 591 cols
[2024-06-01 10:04:29] [INFO ] Computed 31 invariants in 5 ms
[2024-06-01 10:04:29] [INFO ] State equation strengthened by 436 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 219/225 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/225 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 11/236 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/236 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 7/243 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-06-01 10:04:30] [INFO ] Deduced a trap composed of 3 places in 215 ms of which 2 ms to minimize.
[2024-06-01 10:04:30] [INFO ] Deduced a trap composed of 3 places in 172 ms of which 2 ms to minimize.
[2024-06-01 10:04:30] [INFO ] Deduced a trap composed of 3 places in 117 ms of which 2 ms to minimize.
[2024-06-01 10:04:30] [INFO ] Deduced a trap composed of 3 places in 69 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/243 variables, 4/17 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/243 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (OVERLAPS) 517/760 variables, 243/260 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/760 variables, 92/352 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/760 variables, 0/352 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (OVERLAPS) 156/916 variables, 72/424 constraints. Problems are: Problem set: 0 solved, 7 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/916 variables, 39/463 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/916 variables, 0/463 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 14 (OVERLAPS) 264/1180 variables, 12/475 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1180 variables, 0/475 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 16 (OVERLAPS) 12/1192 variables, 6/481 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1192 variables, 0/481 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 18 (OVERLAPS) 420/1612 variables, 276/757 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1612 variables, 305/1062 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1612 variables, 0/1062 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 21 (OVERLAPS) 0/1612 variables, 0/1062 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1612/1612 variables, and 1062 constraints, problems are : Problem set: 0 solved, 7 unsolved in 2544 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 591/591 constraints, ReadFeed: 436/436 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 219/225 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/225 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 11/236 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/236 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 7/243 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/243 variables, 4/17 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/243 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (OVERLAPS) 517/760 variables, 243/260 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/760 variables, 92/352 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/760 variables, 0/352 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (OVERLAPS) 156/916 variables, 72/424 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/916 variables, 39/463 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/916 variables, 0/463 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 14 (OVERLAPS) 264/1180 variables, 12/475 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1180 variables, 0/475 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 16 (OVERLAPS) 12/1192 variables, 6/481 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1192 variables, 7/488 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-06-01 10:04:34] [INFO ] Deduced a trap composed of 4 places in 534 ms of which 6 ms to minimize.
[2024-06-01 10:04:34] [INFO ] Deduced a trap composed of 3 places in 502 ms of which 5 ms to minimize.
[2024-06-01 10:04:35] [INFO ] Deduced a trap composed of 3 places in 428 ms of which 3 ms to minimize.
[2024-06-01 10:04:35] [INFO ] Deduced a trap composed of 3 places in 357 ms of which 3 ms to minimize.
[2024-06-01 10:04:35] [INFO ] Deduced a trap composed of 3 places in 294 ms of which 3 ms to minimize.
[2024-06-01 10:04:36] [INFO ] Deduced a trap composed of 59 places in 218 ms of which 3 ms to minimize.
[2024-06-01 10:04:36] [INFO ] Deduced a trap composed of 73 places in 226 ms of which 3 ms to minimize.
[2024-06-01 10:04:36] [INFO ] Deduced a trap composed of 41 places in 235 ms of which 3 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/1192 variables, 8/496 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1192 variables, 0/496 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 20 (OVERLAPS) 420/1612 variables, 276/772 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1612 variables, 305/1077 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1612 variables, 0/1077 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 23 (OVERLAPS) 0/1612 variables, 0/1077 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1612/1612 variables, and 1077 constraints, problems are : Problem set: 0 solved, 7 unsolved in 6422 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 591/591 constraints, ReadFeed: 436/436 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 12/12 constraints]
After SMT, in 9007ms problems are : Problem set: 0 solved, 7 unsolved
Fused 7 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 3145 ms.
Support contains 6 out of 591 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 591/591 places, 3891/3891 transitions.
Applied a total of 0 rules in 170 ms. Remains 591 /591 variables (removed 0) and now considering 3891/3891 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 171 ms. Remains : 591/591 places, 3891/3891 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 591/591 places, 3891/3891 transitions.
Applied a total of 0 rules in 170 ms. Remains 591 /591 variables (removed 0) and now considering 3891/3891 (removed 0) transitions.
[2024-06-01 10:04:42] [INFO ] Flow matrix only has 1021 transitions (discarded 2870 similar events)
[2024-06-01 10:04:42] [INFO ] Invariant cache hit.
[2024-06-01 10:04:43] [INFO ] Implicit Places using invariants in 1153 ms returned []
[2024-06-01 10:04:43] [INFO ] Flow matrix only has 1021 transitions (discarded 2870 similar events)
[2024-06-01 10:04:43] [INFO ] Invariant cache hit.
[2024-06-01 10:04:43] [INFO ] State equation strengthened by 436 read => feed constraints.
[2024-06-01 10:04:48] [INFO ] Implicit Places using invariants and state equation in 5231 ms returned []
Implicit Place search using SMT with State Equation took 6393 ms to find 0 implicit places.
[2024-06-01 10:04:48] [INFO ] Redundant transitions in 188 ms returned []
Running 3881 sub problems to find dead transitions.
[2024-06-01 10:04:48] [INFO ] Flow matrix only has 1021 transitions (discarded 2870 similar events)
[2024-06-01 10:04:48] [INFO ] Invariant cache hit.
[2024-06-01 10:04:48] [INFO ] State equation strengthened by 436 read => feed constraints.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/591 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 3881 unsolved
SMT process timed out in 33715ms, After SMT, problems are : Problem set: 0 solved, 3881 unsolved
Search for dead transitions found 0 dead transitions in 33760ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40525 ms. Remains : 591/591 places, 3891/3891 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 3613 edges and 591 vertex of which 100 / 591 are part of one of the 10 SCC in 5 ms
Free SCC test removed 90 places
Drop transitions (Empty/Sink Transition effects.) removed 350 transitions
Ensure Unique test removed 2790 transitions
Reduce isomorphic transitions removed 3140 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 117 transitions
Trivial Post-agglo rules discarded 117 transitions
Performed 117 trivial Post agglomeration. Transition count delta: 117
Iterating post reduction 0 with 117 rules applied. Total rules applied 118 place count 501 transition count 634
Reduce places removed 117 places and 0 transitions.
Iterating post reduction 1 with 117 rules applied. Total rules applied 235 place count 384 transition count 634
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 21 Pre rules applied. Total rules applied 235 place count 384 transition count 613
Deduced a syphon composed of 21 places in 0 ms
Ensure Unique test removed 10 places
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 2 with 52 rules applied. Total rules applied 287 place count 353 transition count 613
Performed 177 Post agglomeration using F-continuation condition.Transition count delta: 177
Deduced a syphon composed of 177 places in 0 ms
Reduce places removed 177 places and 0 transitions.
Iterating global reduction 2 with 354 rules applied. Total rules applied 641 place count 176 transition count 436
Ensure Unique test removed 86 transitions
Reduce isomorphic transitions removed 86 transitions.
Iterating post reduction 2 with 86 rules applied. Total rules applied 727 place count 176 transition count 350
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 745 place count 167 transition count 350
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 754 place count 167 transition count 341
Drop transitions (Redundant composition of simpler transitions.) removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 4 with 11 rules applied. Total rules applied 765 place count 167 transition count 330
Free-agglomeration rule applied 89 times.
Iterating global reduction 4 with 89 rules applied. Total rules applied 854 place count 167 transition count 241
Reduce places removed 89 places and 0 transitions.
Iterating post reduction 4 with 89 rules applied. Total rules applied 943 place count 78 transition count 241
Partial Free-agglomeration rule applied 9 times.
Drop transitions (Partial Free agglomeration) removed 9 transitions
Iterating global reduction 5 with 9 rules applied. Total rules applied 952 place count 78 transition count 241
Applied a total of 952 rules in 128 ms. Remains 78 /591 variables (removed 513) and now considering 241/3891 (removed 3650) transitions.
Running SMT prover for 7 properties.
// Phase 1: matrix 241 rows 78 cols
[2024-06-01 10:05:22] [INFO ] Computed 21 invariants in 1 ms
[2024-06-01 10:05:22] [INFO ] [Real]Absence check using 21 positive place invariants in 6 ms returned sat
[2024-06-01 10:05:23] [INFO ] After 398ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2024-06-01 10:05:23] [INFO ] [Nat]Absence check using 21 positive place invariants in 6 ms returned sat
[2024-06-01 10:05:23] [INFO ] After 159ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2024-06-01 10:05:23] [INFO ] State equation strengthened by 9 read => feed constraints.
[2024-06-01 10:05:23] [INFO ] After 92ms SMT Verify possible using 9 Read/Feed constraints in natural domain returned unsat :0 sat :7
TRAPS : Iteration 0
[2024-06-01 10:05:23] [INFO ] Deduced a trap composed of 2 places in 19 ms of which 1 ms to minimize.
[2024-06-01 10:05:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 36 ms
TRAPS : Iteration 1
[2024-06-01 10:05:23] [INFO ] Deduced a trap composed of 2 places in 19 ms of which 1 ms to minimize.
[2024-06-01 10:05:23] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2024-06-01 10:05:23] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 62 ms
TRAPS : Iteration 2
[2024-06-01 10:05:23] [INFO ] After 574ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
[2024-06-01 10:05:24] [INFO ] After 907ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Over-approximation ignoring read arcs solved 0 properties in 1468 ms.
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT p1))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (AND (NOT p1) (NOT p0) (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 128 ms. Reduced automaton from 5 states, 11 edges and 3 AP (stutter sensitive) to 5 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 179 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), p0, (NOT p2), true]
Stuttering acceptance computed with spot in 187 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), p0, (NOT p2), true]
[2024-06-01 10:05:24] [INFO ] Flow matrix only has 1430 transitions (discarded 2870 similar events)
// Phase 1: matrix 1430 rows 1000 cols
[2024-06-01 10:05:24] [INFO ] Computed 31 invariants in 8 ms
[2024-06-01 10:05:28] [INFO ] [Real]Absence check using 21 positive place invariants in 42 ms returned sat
[2024-06-01 10:05:28] [INFO ] [Real]Absence check using 21 positive and 10 generalized place invariants in 95 ms returned unsat
Proved EG (NOT p1)
[2024-06-01 10:05:28] [INFO ] Flow matrix only has 1430 transitions (discarded 2870 similar events)
[2024-06-01 10:05:28] [INFO ] Invariant cache hit.
[2024-06-01 10:05:32] [INFO ] [Real]Absence check using 21 positive place invariants in 40 ms returned sat
[2024-06-01 10:05:32] [INFO ] [Real]Absence check using 21 positive and 10 generalized place invariants in 82 ms returned sat
[2024-06-01 10:05:36] [INFO ] [Real]Absence check using state equation in 3151 ms returned sat
[2024-06-01 10:05:36] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 10:05:39] [INFO ] [Nat]Absence check using 21 positive place invariants in 42 ms returned sat
[2024-06-01 10:05:40] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 24 ms returned sat
[2024-06-01 10:05:42] [INFO ] [Nat]Absence check using state equation in 2583 ms returned sat
[2024-06-01 10:05:42] [INFO ] State equation strengthened by 436 read => feed constraints.
[2024-06-01 10:05:43] [INFO ] [Nat]Added 436 Read/Feed constraints in 499 ms returned sat
[2024-06-01 10:05:44] [INFO ] Deduced a trap composed of 39 places in 1097 ms of which 9 ms to minimize.
[2024-06-01 10:05:45] [INFO ] Deduced a trap composed of 70 places in 1173 ms of which 9 ms to minimize.
[2024-06-01 10:05:46] [INFO ] Deduced a trap composed of 94 places in 1103 ms of which 9 ms to minimize.
[2024-06-01 10:05:48] [INFO ] Deduced a trap composed of 3 places in 1009 ms of which 9 ms to minimize.
[2024-06-01 10:05:49] [INFO ] Deduced a trap composed of 3 places in 875 ms of which 9 ms to minimize.
[2024-06-01 10:05:49] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 5 trap constraints in 5929 ms
Proved EG (NOT p2)
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT p1))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (AND (NOT p1) (NOT p0) (NOT p2))))]
False Knowledge obtained : [(G (NOT p1)), (G (NOT p2))]
Property proved to be false thanks to negative knowledge :(G (NOT p1))
Knowledge based reduction with 9 factoid took 162 ms. Reduced automaton from 5 states, 11 edges and 3 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA EisenbergMcGuire-PT-10-LTLFireability-02 FALSE TECHNIQUES KNOWLEDGE
Treatment of property EisenbergMcGuire-PT-10-LTLFireability-02 finished in 144388 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)&&(F(p2)||p1))))'
Support contains 9 out of 1006 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1006/1006 places, 4360/4360 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 1000 transition count 4300
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 1000 transition count 4300
Applied a total of 12 rules in 135 ms. Remains 1000 /1006 variables (removed 6) and now considering 4300/4360 (removed 60) transitions.
[2024-06-01 10:05:49] [INFO ] Flow matrix only has 1430 transitions (discarded 2870 similar events)
[2024-06-01 10:05:49] [INFO ] Invariant cache hit.
[2024-06-01 10:05:50] [INFO ] Implicit Places using invariants in 1165 ms returned []
[2024-06-01 10:05:50] [INFO ] Flow matrix only has 1430 transitions (discarded 2870 similar events)
[2024-06-01 10:05:50] [INFO ] Invariant cache hit.
[2024-06-01 10:05:51] [INFO ] State equation strengthened by 436 read => feed constraints.
[2024-06-01 10:06:00] [INFO ] Implicit Places using invariants and state equation in 10255 ms returned []
Implicit Place search using SMT with State Equation took 11427 ms to find 0 implicit places.
Running 4290 sub problems to find dead transitions.
[2024-06-01 10:06:00] [INFO ] Flow matrix only has 1430 transitions (discarded 2870 similar events)
[2024-06-01 10:06:00] [INFO ] Invariant cache hit.
[2024-06-01 10:06:00] [INFO ] State equation strengthened by 436 read => feed constraints.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 1.0)
(s8 0.0)
(s9 0.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 0.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 0.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 0.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 0.0)
(s352 0.0)
(s353 0.0)
(s354 0.0)
(s355 0.0)
(s356 0.0)
(s357 0.0)
(s358 0.0)
(s359 0.0)
(s360 0.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 0.0)
(s369 0.0)
(s370 0.0)
(s371 0.0)
(s372 0.0)
(s373 0.0)
(s374 0.0)
(s375 0.0)
(s376 0.0)
(s377 0.0)
(s378 0.0)
(s379 0.0)
(s380 0.0)
(s381 0.0)
(s382 0.0)
(s383 0.0)
(s384 0.0)
(s385 0.0)
(s386 0.0)
(s387 0.0)
(s388 0.0)
(s389 0.0)
(s390 0.0)
(s391 0.0)
(s392 0.0)
(s393 0.0)
(s394 0.0)
(s395 0.0)
(s396 0.0)
(s397 0.0)
(s398 0.0)
(s399 0.0)
(s400 0.0)
(s401 0.0)
(s402 0.0)
(s403 0.0)
(s404 0.0)
(s405 0.0)
(s406 0.0)
(s407 0.0)
(s408 0.0)
(s409 0.0)
(s410 0.0)
(s411 0.0)
(s412 0.0)
(s413 0.0)
(s414 0.0)
(s415 0.0)
(s416 0.0)
(s417 0.0)
(s418 0.0)
(s419 0.0)
(s420 0.0)
(s421 0.0)
(s422 0.0)
(s423 0.0)
(s424 0.0)
(s425 0.0)
(s426 0.0)
(s427 0.0)
(s428 0.0)
(s429 0.0)
(s430 1.0)
(s431 0.0)
(s432 1.0)
(s433 1.0)
(s434 1.0)
(s435 1.0)
(s436 0.0)
(s437 1.0)
(s438 1.0)
(s439 1.0)
(s440 0.0)
(s441 0.0)
(s442 0.0)
(s443 0.0)
(s444 0.0)
(s445 0.0)
(s446 0.0)
(s447 0.0)
(s448 0.0)
(s449 0.0)
(s450 0.0)
(s451 0.0)
(s452 0.0)
(s453 0.0)
(s454 0.0)
(s455 0.0)
(s456 0.0)
(s457 0.0)
(s458 0.0)
(s459 0.0)
(s460 0.0)
(s461 0.0)
(s462 0.0)
(s463 0.0)
(s464 0.0)
(s465 0.0)
(s466 0.0)
(s467 0.0)
(s468 0.0)
(s469 0.0)
(s470 0.0)
(s471 0.0)
(s472 0.0)
(s473 0.0)
(s474 0.0)
(s475 0.0)
(s476 0.0)
(s477 0.0)
(s478 0.0)
(s479 0.0)
(s480 0.0)
(s481 0.0)
(s482 0.0)
(s483 0.0)
(s484 0.0)
(s485 0.0)
(s486 0.0)
(s487 0.0)
(s488 0.0)
(s489 0.0)
(s490 0.0)
(s491 0.0)
(s492 0.0)
(s493 0.0)
(s494 0.0)
(s495 0.0)
(s496 0.0)
(s497 0.0)
(s498 0.0)
(s499 0.0)
(s500 0.0)
(s501 0.0)
(s502 0.0)
(s503 0.0)
(s504 0.0)
(s505 0.0)
(s506 0.0)
(s507 0.0)
(s508 0.0)
(s509 0.0)
(s510 0.0)
(s511 0.0)
(s512 0.0)
(s513 0.0)
(s514 0.0)
(s515 0.0)
(s516 0.0)
(s517 0.0)
(s518 0.0)
(s519 0.0)
(s520 0.0)
(s521 0.0)
(s522 0.0)
(s523 0.0)
(s524 0.0)
(s525 0.0)
(s526 0.0)
(s527 0.0)
(s528 0.0)
(s529 0.0)
(s530 0.0)
(s531 0.0)
(s532 0.0)
(s533 0.0)
(s534 0.0)
(s535 0.0)
(s536 0.0)
(s537 0.0)
(s538 0.0)
(s539 0.0)
(s540 0.0)
(s541 0.0)
(s542 0.0)
(s543 0.0)
(s544 0.0)
(s545 0.0)
(s546 0.0)
(s547 0.0)
(s548 0.0)
(s549 0.0)
(s550 0.0)
(s551 0.0)
(s552 0.0)
(s553 0.0)
(s554 0.0)
(s555 0.0)
(s556 0.0)
(s557 0.0)
(s558 0.0)
(s559 0.0)
(s560 0.0)
(s561 0.0)
(s562 0.0)
(s563 0.0)
(s564 0.0)
(s565 0.0)
(s566 0.0)
(s567 0.0)
(s568 0.0)
(s569 0.0)
(s570 0.0)
(s571 0.0)
(s572 0.0)
(s573 0.0)
(s574 0.0)
(s575 0.0)
(s576 0.0)
(s577 0.0)
(s578 0.0)
(s579 0.0)
(s580 0.0)
(s581 0.0)
(s582 0.0)
(s583 0.0)
(s584 0.0)
(s585 0.0)
(s586 0.0)
(s587 0.0)
(s588 0.0)
(s589 0.0)
(s590 0.0)
(s591 0.0)
(s592 0.0)
(s593 0.0)
(s594 0.0)
(s595 0.0)
(s596 0.0)
(s597 0.0)
(s598 0.0)
(s599 0.0)
(s600 0.0)
(s601 0.0)
(s602 0.0)
(s603 0.0)
(s604 0.0)
(s605 0.0)
(s606 0.0)
(s607 0.0)
(s608 0.0)
(s609 0.0)
(s610 0.0)
(s611 0.0)
(s612 0.0)
(s613 0.0)
(s614 0.0)
(s615 0.0)
(s616 0.0)
(s617 0.0)
(s618 0.0)
(s619 0.0)
(s620 0.0)
(s621 0.0)
(s622 0.0)
(s623 0.0)
(s624 0.0)
(s625 0.0)
(s626 0.0)
(s627 0.0)
(s628 0.0)
(s629 0.0)
(s630 0.0)
(s631 0.0)
(s632 0.0)
(s633 0.0)
(s634 0.0)
(s635 0.0)
(s636 0.0)
(s637 0.0)
(s638 0.0)
(s639 0.0)
(s640 0.0)
(s641 0.0)
(s642 0.0)
(s643 0.0)
(s644 0.0)
(s645 0.0)
(s646 0.0)
(s647 0.0)
(s648 0.0)
(s649 0.0)
(s650 0.0)
(s651 0.0)
(s652 0.0)
(s653 0.0)
(s654 0.0)
(s655 0.0)
(s656 0.0)
(s657 0.0)
(s658 0.0)
(s659 0.0)
(s660 0.0)
(s661 0.0)
(s662 0.0)
(s663 0.0)
(s664 0.0)
(s665 0.0)
(s666 0.0)
(s667 0.0)
(s668 0.0)
(s669 0.0)
(s670 0.0)
(s671 0.0)
(s672 1.0)
(s673 0.0)
(s674 0.0)
(s675 0.0)
(s676 0.0)
(s677 0.0)
(s678 0.0)
(s679 0.0)
(s680 0.0)
(s681 0.0)
(s682 0.0)
(s683 0.0)
(s684 0.0)
(s685 0.0)
(s686 0.0)
(s687 0.0)
(s688 0.0)
(s689 0.0)
(s690 0.0)
(s691 0.0)
(s692 0.0)
(s693 0.0)
(s694 0.0)
(s695 0.0)
(s696 0.0)
(s697 0.0)
(s698 0.0)
(s699 0.0)
(s700 0.0)
(s701 0.0)
(s702 0.0)
(s703 0.0)
(s704 0.0)
(s705 0.0)
(s706 0.0)
(s707 0.0)
(s708 0.0)
(s709 0.0)
(s710 0.0)
(s711 0.0)
(s712 0.0)
(s713 0.0)
(s714 0.0)
(s715 0.0)
(s716 0.0)
(s717 0.0)
(s718 0.0)
(s719 0.0)
(s720 0.0)
(s721 0.0)
(s722 0.0)
(s723 0.0)
(s724 0.0)
(s725 0.0)
(s726 0.0)
(s727 0.0)
(s728 0.0)
(s729 1.0)
(s730 0.0)
(s731 0.0)
(s732 0.0)
(s733 0.0)
(s734 0.0)
(s735 0.0)
(s736 0.0)
(s737 0.0)
(s738 0.0)
(s739 0.0)
(s740 0.0)
(s741 0.0)
(s742 0.0)
(s743 0.0)
(s744 0.0)
(s745 0.0)
(s746 0.0)
(s747 0.0)
(s748 0.0)
(s749 0.0)
(s750 0.0)
(s751 0.0)
(s752 0.0)
(s753 0.0)
(s754 0.0)
(s755 0.0)
(s756 0.0)
(s757 0.0)
(s758 0.0)
(s759 0.0)
(s760 0.0)
(s761 0.0)
(s762 0.0)
(s763 0.0)
(s764 0.0)
(s765 0.0)
(s766 0.0)
(s767 timeout
0.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1000 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 4290 unsolved
SMT process timed out in 33971ms, After SMT, problems are : Problem set: 0 solved, 4290 unsolved
Search for dead transitions found 0 dead transitions in 34026ms
Starting structural reductions in LTL mode, iteration 1 : 1000/1006 places, 4300/4360 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 45597 ms. Remains : 1000/1006 places, 4300/4360 transitions.
Stuttering acceptance computed with spot in 177 ms :[(NOT p0), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (NOT p2)), true, (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : EisenbergMcGuire-PT-10-LTLFireability-03
Product exploration explored 100000 steps with 0 reset in 367 ms.
Product exploration explored 100000 steps with 0 reset in 414 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X (NOT p2)), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (OR (AND p0 p1) (AND p0 p2))), (X p0), (X p1), (X (X (NOT p2))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 p2)))), (X (X p0))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 10 factoid took 120 ms. Reduced automaton from 5 states, 10 edges and 3 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 45 ms :[true, (NOT p0)]
RANDOM walk for 40000 steps (8 resets) in 251 ms. (158 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 39 ms. (1000 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 267333 steps, run timeout after 3001 ms. (steps per millisecond=89 ) properties seen :0 out of 1
Probabilistic random walk after 267333 steps, saw 208384 distinct states, run finished after 3004 ms. (steps per millisecond=88 ) properties seen :0
[2024-06-01 10:06:39] [INFO ] Flow matrix only has 1430 transitions (discarded 2870 similar events)
[2024-06-01 10:06:39] [INFO ] Invariant cache hit.
[2024-06-01 10:06:39] [INFO ] State equation strengthened by 436 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 105/108 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 69/177 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/177 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 31/208 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/208 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 430/638 variables, 208/215 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/638 variables, 34/249 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/638 variables, 0/249 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 208/846 variables, 96/345 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/846 variables, 30/375 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/846 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 679/1525 variables, 15/390 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1525 variables, 0/390 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 2/1527 variables, 1/391 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1527 variables, 0/391 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 15/1542 variables, 8/399 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1542 variables, 0/399 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 888/2430 variables, 696/1095 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/2430 variables, 372/1467 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/2430 variables, 0/1467 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/2430 variables, 0/1467 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2430/2430 variables, and 1467 constraints, problems are : Problem set: 0 solved, 1 unsolved in 989 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 1000/1000 constraints, ReadFeed: 436/436 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/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 105/108 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 69/177 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/177 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 31/208 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 10:06:40] [INFO ] Deduced a trap composed of 3 places in 89 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/208 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/208 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 430/638 variables, 208/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/638 variables, 34/250 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/638 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 208/846 variables, 96/346 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/846 variables, 30/376 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/846 variables, 0/376 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 679/1525 variables, 15/391 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1525 variables, 0/391 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 2/1527 variables, 1/392 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1527 variables, 0/392 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 15/1542 variables, 8/400 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1542 variables, 1/401 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 10:06:41] [INFO ] Deduced a trap composed of 3 places in 598 ms of which 6 ms to minimize.
[2024-06-01 10:06:41] [INFO ] Deduced a trap composed of 3 places in 508 ms of which 5 ms to minimize.
[2024-06-01 10:06:42] [INFO ] Deduced a trap composed of 3 places in 397 ms of which 4 ms to minimize.
[2024-06-01 10:06:42] [INFO ] Deduced a trap composed of 3 places in 321 ms of which 3 ms to minimize.
[2024-06-01 10:06:42] [INFO ] Deduced a trap composed of 3 places in 222 ms of which 2 ms to minimize.
[2024-06-01 10:06:43] [INFO ] Deduced a trap composed of 3 places in 153 ms of which 2 ms to minimize.
[2024-06-01 10:06:43] [INFO ] Deduced a trap composed of 3 places in 83 ms of which 2 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/1542 variables, 7/408 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1542 variables, 0/408 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 888/2430 variables, 696/1104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/2430 variables, 372/1476 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 10:06:43] [INFO ] Deduced a trap composed of 3 places in 107 ms of which 3 ms to minimize.
At refinement iteration 24 (INCLUDED_ONLY) 0/2430 variables, 1/1477 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/2430 variables, 0/1477 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 0/2430 variables, 0/1477 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2430/2430 variables, and 1477 constraints, problems are : Problem set: 0 solved, 1 unsolved in 4085 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 1000/1000 constraints, ReadFeed: 436/436 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 9/9 constraints]
After SMT, in 5101ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 201 ms.
Support contains 3 out of 1000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1000/1000 places, 4300/4300 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 1000 transition count 4290
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 20 place count 990 transition count 4290
Performed 310 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 310 Pre rules applied. Total rules applied 20 place count 990 transition count 3980
Deduced a syphon composed of 310 places in 4 ms
Reduce places removed 310 places and 0 transitions.
Iterating global reduction 2 with 620 rules applied. Total rules applied 640 place count 680 transition count 3980
Performed 90 Post agglomeration using F-continuation condition.Transition count delta: 90
Deduced a syphon composed of 90 places in 4 ms
Reduce places removed 90 places and 0 transitions.
Iterating global reduction 2 with 180 rules applied. Total rules applied 820 place count 590 transition count 3890
Applied a total of 820 rules in 389 ms. Remains 590 /1000 variables (removed 410) and now considering 3890/4300 (removed 410) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 393 ms. Remains : 590/1000 places, 3890/4300 transitions.
RANDOM walk for 40000 steps (8 resets) in 209 ms. (190 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 52 ms. (754 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 285395 steps, run timeout after 3001 ms. (steps per millisecond=95 ) properties seen :0 out of 1
Probabilistic random walk after 285395 steps, saw 193231 distinct states, run finished after 3001 ms. (steps per millisecond=95 ) properties seen :0
[2024-06-01 10:06:47] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
// Phase 1: matrix 1020 rows 590 cols
[2024-06-01 10:06:47] [INFO ] Computed 31 invariants in 4 ms
[2024-06-01 10:06:47] [INFO ] State equation strengthened by 436 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 64/67 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/67 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 47/114 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/114 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 12/126 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/126 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 348/474 variables, 126/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/474 variables, 34/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/474 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 208/682 variables, 96/263 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/682 variables, 37/300 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/682 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 352/1034 variables, 16/316 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1034 variables, 0/316 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 16/1050 variables, 8/324 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1050 variables, 0/324 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 560/1610 variables, 368/692 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1610 variables, 365/1057 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1610 variables, 0/1057 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/1610 variables, 0/1057 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1610/1610 variables, and 1057 constraints, problems are : Problem set: 0 solved, 1 unsolved in 638 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 590/590 constraints, ReadFeed: 436/436 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/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 64/67 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/67 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 47/114 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 10:06:48] [INFO ] Deduced a trap composed of 3 places in 61 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/114 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/114 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 12/126 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 10:06:48] [INFO ] Deduced a trap composed of 3 places in 69 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/126 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/126 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 348/474 variables, 126/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/474 variables, 34/169 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/474 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 208/682 variables, 96/265 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/682 variables, 37/302 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/682 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 352/1034 variables, 16/318 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1034 variables, 0/318 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 16/1050 variables, 8/326 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1050 variables, 1/327 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 10:06:49] [INFO ] Deduced a trap composed of 3 places in 418 ms of which 3 ms to minimize.
[2024-06-01 10:06:49] [INFO ] Deduced a trap composed of 39 places in 413 ms of which 3 ms to minimize.
[2024-06-01 10:06:50] [INFO ] Deduced a trap composed of 3 places in 465 ms of which 4 ms to minimize.
[2024-06-01 10:06:50] [INFO ] Deduced a trap composed of 37 places in 397 ms of which 3 ms to minimize.
[2024-06-01 10:06:51] [INFO ] Deduced a trap composed of 16 places in 326 ms of which 3 ms to minimize.
[2024-06-01 10:06:51] [INFO ] Deduced a trap composed of 3 places in 298 ms of which 3 ms to minimize.
[2024-06-01 10:06:51] [INFO ] Deduced a trap composed of 27 places in 275 ms of which 2 ms to minimize.
[2024-06-01 10:06:52] [INFO ] Deduced a trap composed of 3 places in 359 ms of which 3 ms to minimize.
[2024-06-01 10:06:52] [INFO ] Deduced a trap composed of 3 places in 350 ms of which 3 ms to minimize.
[2024-06-01 10:06:52] [INFO ] Deduced a trap composed of 55 places in 380 ms of which 4 ms to minimize.
[2024-06-01 10:06:53] [INFO ] Deduced a trap composed of 34 places in 302 ms of which 3 ms to minimize.
[2024-06-01 10:06:53] [INFO ] Deduced a trap composed of 23 places in 332 ms of which 3 ms to minimize.
[2024-06-01 10:06:54] [INFO ] Deduced a trap composed of 3 places in 318 ms of which 3 ms to minimize.
[2024-06-01 10:06:54] [INFO ] Deduced a trap composed of 29 places in 278 ms of which 3 ms to minimize.
[2024-06-01 10:06:54] [INFO ] Deduced a trap composed of 24 places in 196 ms of which 2 ms to minimize.
[2024-06-01 10:06:54] [INFO ] Deduced a trap composed of 21 places in 144 ms of which 2 ms to minimize.
[2024-06-01 10:06:54] [INFO ] Deduced a trap composed of 36 places in 237 ms of which 2 ms to minimize.
[2024-06-01 10:06:55] [INFO ] Deduced a trap composed of 15 places in 167 ms of which 2 ms to minimize.
[2024-06-01 10:06:55] [INFO ] Deduced a trap composed of 19 places in 108 ms of which 2 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/1050 variables, 19/346 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1050 variables, 0/346 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 560/1610 variables, 368/714 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1610 variables, 365/1079 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1610 variables, 0/1079 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/1610 variables, 0/1079 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1610/1610 variables, and 1079 constraints, problems are : Problem set: 0 solved, 1 unsolved in 7202 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 590/590 constraints, ReadFeed: 436/436 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 21/21 constraints]
After SMT, in 7868ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 223 ms.
Support contains 3 out of 590 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 3890/3890 transitions.
Applied a total of 0 rules in 183 ms. Remains 590 /590 variables (removed 0) and now considering 3890/3890 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 184 ms. Remains : 590/590 places, 3890/3890 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 3890/3890 transitions.
Applied a total of 0 rules in 186 ms. Remains 590 /590 variables (removed 0) and now considering 3890/3890 (removed 0) transitions.
[2024-06-01 10:06:56] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2024-06-01 10:06:56] [INFO ] Invariant cache hit.
[2024-06-01 10:06:57] [INFO ] Implicit Places using invariants in 1130 ms returned []
[2024-06-01 10:06:57] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2024-06-01 10:06:57] [INFO ] Invariant cache hit.
[2024-06-01 10:06:58] [INFO ] State equation strengthened by 436 read => feed constraints.
[2024-06-01 10:07:02] [INFO ] Implicit Places using invariants and state equation in 5127 ms returned []
Implicit Place search using SMT with State Equation took 6264 ms to find 0 implicit places.
[2024-06-01 10:07:02] [INFO ] Redundant transitions in 186 ms returned []
Running 3880 sub problems to find dead transitions.
[2024-06-01 10:07:02] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2024-06-01 10:07:02] [INFO ] Invariant cache hit.
[2024-06-01 10:07:02] [INFO ] State equation strengthened by 436 read => feed constraints.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/590 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 3880 unsolved
SMT process timed out in 33430ms, After SMT, problems are : Problem set: 0 solved, 3880 unsolved
Search for dead transitions found 0 dead transitions in 33473ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40125 ms. Remains : 590/590 places, 3890/3890 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 3642 edges and 590 vertex of which 100 / 590 are part of one of the 10 SCC in 2 ms
Free SCC test removed 90 places
Drop transitions (Empty/Sink Transition effects.) removed 350 transitions
Ensure Unique test removed 2790 transitions
Reduce isomorphic transitions removed 3140 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 118 transitions
Trivial Post-agglo rules discarded 118 transitions
Performed 118 trivial Post agglomeration. Transition count delta: 118
Iterating post reduction 0 with 118 rules applied. Total rules applied 119 place count 500 transition count 632
Reduce places removed 118 places and 0 transitions.
Iterating post reduction 1 with 118 rules applied. Total rules applied 237 place count 382 transition count 632
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 21 Pre rules applied. Total rules applied 237 place count 382 transition count 611
Deduced a syphon composed of 21 places in 1 ms
Ensure Unique test removed 10 places
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 2 with 52 rules applied. Total rules applied 289 place count 351 transition count 611
Performed 179 Post agglomeration using F-continuation condition.Transition count delta: 179
Deduced a syphon composed of 179 places in 0 ms
Reduce places removed 179 places and 0 transitions.
Iterating global reduction 2 with 358 rules applied. Total rules applied 647 place count 172 transition count 432
Ensure Unique test removed 88 transitions
Reduce isomorphic transitions removed 88 transitions.
Iterating post reduction 2 with 88 rules applied. Total rules applied 735 place count 172 transition count 344
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 755 place count 162 transition count 344
Drop transitions (Empty/Sink Transition effects.) removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 765 place count 162 transition count 334
Drop transitions (Redundant composition of simpler transitions.) removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 4 with 11 rules applied. Total rules applied 776 place count 162 transition count 323
Free-agglomeration rule applied 91 times.
Iterating global reduction 4 with 91 rules applied. Total rules applied 867 place count 162 transition count 232
Reduce places removed 91 places and 0 transitions.
Iterating post reduction 4 with 91 rules applied. Total rules applied 958 place count 71 transition count 232
Partial Free-agglomeration rule applied 10 times.
Drop transitions (Partial Free agglomeration) removed 10 transitions
Iterating global reduction 5 with 10 rules applied. Total rules applied 968 place count 71 transition count 232
Applied a total of 968 rules in 60 ms. Remains 71 /590 variables (removed 519) and now considering 232/3890 (removed 3658) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 232 rows 71 cols
[2024-06-01 10:07:36] [INFO ] Computed 21 invariants in 1 ms
[2024-06-01 10:07:36] [INFO ] After 32ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-01 10:07:36] [INFO ] [Nat]Absence check using 21 positive place invariants in 6 ms returned sat
[2024-06-01 10:07:36] [INFO ] After 77ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-06-01 10:07:36] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-06-01 10:07:36] [INFO ] After 16ms SMT Verify possible using 10 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-01 10:07:36] [INFO ] Deduced a trap composed of 2 places in 23 ms of which 1 ms to minimize.
[2024-06-01 10:07:36] [INFO ] Deduced a trap composed of 2 places in 19 ms of which 0 ms to minimize.
[2024-06-01 10:07:36] [INFO ] Deduced a trap composed of 2 places in 18 ms of which 1 ms to minimize.
[2024-06-01 10:07:36] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 93 ms
TRAPS : Iteration 1
[2024-06-01 10:07:36] [INFO ] After 138ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-01 10:07:36] [INFO ] After 268ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 372 ms.
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X (NOT p2)), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (OR (AND p0 p1) (AND p0 p2))), (X p0), (X p1), (X (X (NOT p2))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 p2)))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 124 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 47 ms :[true, (NOT p0)]
Stuttering acceptance computed with spot in 46 ms :[true, (NOT p0)]
Support contains 3 out of 1000 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 1000/1000 places, 4300/4300 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 1000 transition count 4290
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 20 place count 990 transition count 4290
Performed 310 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 310 Pre rules applied. Total rules applied 20 place count 990 transition count 3980
Deduced a syphon composed of 310 places in 5 ms
Reduce places removed 310 places and 0 transitions.
Iterating global reduction 2 with 620 rules applied. Total rules applied 640 place count 680 transition count 3980
Performed 90 Post agglomeration using F-continuation condition.Transition count delta: 90
Deduced a syphon composed of 90 places in 4 ms
Reduce places removed 90 places and 0 transitions.
Iterating global reduction 2 with 180 rules applied. Total rules applied 820 place count 590 transition count 3890
Applied a total of 820 rules in 283 ms. Remains 590 /1000 variables (removed 410) and now considering 3890/4300 (removed 410) transitions.
[2024-06-01 10:07:37] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
// Phase 1: matrix 1020 rows 590 cols
[2024-06-01 10:07:37] [INFO ] Computed 31 invariants in 3 ms
[2024-06-01 10:07:38] [INFO ] Implicit Places using invariants in 1096 ms returned []
[2024-06-01 10:07:38] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2024-06-01 10:07:38] [INFO ] Invariant cache hit.
[2024-06-01 10:07:38] [INFO ] State equation strengthened by 436 read => feed constraints.
[2024-06-01 10:07:43] [INFO ] Implicit Places using invariants and state equation in 5451 ms returned []
Implicit Place search using SMT with State Equation took 6550 ms to find 0 implicit places.
[2024-06-01 10:07:43] [INFO ] Redundant transitions in 193 ms returned []
Running 3880 sub problems to find dead transitions.
[2024-06-01 10:07:44] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2024-06-01 10:07:44] [INFO ] Invariant cache hit.
[2024-06-01 10:07:44] [INFO ] State equation strengthened by 436 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/590 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 3880 unsolved
SMT process timed out in 33708ms, After SMT, problems are : Problem set: 0 solved, 3880 unsolved
Search for dead transitions found 0 dead transitions in 33751ms
Starting structural reductions in SI_LTL mode, iteration 1 : 590/1000 places, 3890/4300 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 40793 ms. Remains : 590/1000 places, 3890/4300 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 77 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 50 ms :[true, (NOT p0)]
RANDOM walk for 40000 steps (8 resets) in 182 ms. (218 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 41 ms. (952 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 290730 steps, run timeout after 3001 ms. (steps per millisecond=96 ) properties seen :0 out of 1
Probabilistic random walk after 290730 steps, saw 196243 distinct states, run finished after 3001 ms. (steps per millisecond=96 ) properties seen :0
[2024-06-01 10:08:20] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2024-06-01 10:08:20] [INFO ] Invariant cache hit.
[2024-06-01 10:08:20] [INFO ] State equation strengthened by 436 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 64/67 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/67 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 47/114 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/114 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 12/126 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/126 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 348/474 variables, 126/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/474 variables, 34/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/474 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 208/682 variables, 96/263 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/682 variables, 37/300 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/682 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 352/1034 variables, 16/316 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1034 variables, 0/316 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 16/1050 variables, 8/324 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1050 variables, 0/324 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 560/1610 variables, 368/692 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1610 variables, 365/1057 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1610 variables, 0/1057 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/1610 variables, 0/1057 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1610/1610 variables, and 1057 constraints, problems are : Problem set: 0 solved, 1 unsolved in 666 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 590/590 constraints, ReadFeed: 436/436 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/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 64/67 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/67 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 47/114 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/114 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 12/126 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 10:08:21] [INFO ] Deduced a trap composed of 3 places in 70 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/126 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/126 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 348/474 variables, 126/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/474 variables, 34/168 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/474 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 208/682 variables, 96/264 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/682 variables, 37/301 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/682 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 352/1034 variables, 16/317 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1034 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 16/1050 variables, 8/325 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1050 variables, 1/326 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 10:08:22] [INFO ] Deduced a trap composed of 3 places in 430 ms of which 4 ms to minimize.
[2024-06-01 10:08:22] [INFO ] Deduced a trap composed of 3 places in 393 ms of which 4 ms to minimize.
[2024-06-01 10:08:23] [INFO ] Deduced a trap composed of 3 places in 295 ms of which 3 ms to minimize.
[2024-06-01 10:08:23] [INFO ] Deduced a trap composed of 5 places in 246 ms of which 3 ms to minimize.
[2024-06-01 10:08:23] [INFO ] Deduced a trap composed of 3 places in 248 ms of which 3 ms to minimize.
[2024-06-01 10:08:23] [INFO ] Deduced a trap composed of 3 places in 158 ms of which 1 ms to minimize.
[2024-06-01 10:08:24] [INFO ] Deduced a trap composed of 3 places in 120 ms of which 1 ms to minimize.
[2024-06-01 10:08:24] [INFO ] Deduced a trap composed of 3 places in 68 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/1050 variables, 8/334 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1050 variables, 0/334 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 560/1610 variables, 368/702 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1610 variables, 365/1067 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 10:08:24] [INFO ] Deduced a trap composed of 3 places in 68 ms of which 1 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/1610 variables, 1/1068 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1610 variables, 0/1068 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/1610 variables, 0/1068 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1610/1610 variables, and 1068 constraints, problems are : Problem set: 0 solved, 1 unsolved in 3166 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 590/590 constraints, ReadFeed: 436/436 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 10/10 constraints]
After SMT, in 3857ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 168 ms.
Support contains 3 out of 590 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 3890/3890 transitions.
Applied a total of 0 rules in 168 ms. Remains 590 /590 variables (removed 0) and now considering 3890/3890 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 168 ms. Remains : 590/590 places, 3890/3890 transitions.
RANDOM walk for 40000 steps (8 resets) in 247 ms. (161 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 48 ms. (816 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 289564 steps, run timeout after 3001 ms. (steps per millisecond=96 ) properties seen :0 out of 1
Probabilistic random walk after 289564 steps, saw 195518 distinct states, run finished after 3001 ms. (steps per millisecond=96 ) properties seen :0
[2024-06-01 10:08:28] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2024-06-01 10:08:28] [INFO ] Invariant cache hit.
[2024-06-01 10:08:28] [INFO ] State equation strengthened by 436 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 64/67 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/67 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 47/114 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/114 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 12/126 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/126 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 348/474 variables, 126/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/474 variables, 34/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/474 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 208/682 variables, 96/263 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/682 variables, 37/300 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/682 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 352/1034 variables, 16/316 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1034 variables, 0/316 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 16/1050 variables, 8/324 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1050 variables, 0/324 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 560/1610 variables, 368/692 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1610 variables, 365/1057 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1610 variables, 0/1057 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/1610 variables, 0/1057 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1610/1610 variables, and 1057 constraints, problems are : Problem set: 0 solved, 1 unsolved in 654 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 590/590 constraints, ReadFeed: 436/436 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/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 64/67 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/67 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 47/114 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/114 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 12/126 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 10:08:29] [INFO ] Deduced a trap composed of 3 places in 68 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/126 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/126 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 348/474 variables, 126/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/474 variables, 34/168 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/474 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 208/682 variables, 96/264 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/682 variables, 37/301 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/682 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 352/1034 variables, 16/317 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1034 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 16/1050 variables, 8/325 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1050 variables, 1/326 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 10:08:29] [INFO ] Deduced a trap composed of 3 places in 463 ms of which 4 ms to minimize.
[2024-06-01 10:08:30] [INFO ] Deduced a trap composed of 3 places in 383 ms of which 4 ms to minimize.
[2024-06-01 10:08:30] [INFO ] Deduced a trap composed of 3 places in 305 ms of which 3 ms to minimize.
[2024-06-01 10:08:30] [INFO ] Deduced a trap composed of 5 places in 239 ms of which 2 ms to minimize.
[2024-06-01 10:08:31] [INFO ] Deduced a trap composed of 3 places in 247 ms of which 2 ms to minimize.
[2024-06-01 10:08:31] [INFO ] Deduced a trap composed of 3 places in 183 ms of which 3 ms to minimize.
[2024-06-01 10:08:31] [INFO ] Deduced a trap composed of 3 places in 120 ms of which 1 ms to minimize.
[2024-06-01 10:08:31] [INFO ] Deduced a trap composed of 3 places in 68 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/1050 variables, 8/334 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1050 variables, 0/334 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 560/1610 variables, 368/702 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1610 variables, 365/1067 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 10:08:31] [INFO ] Deduced a trap composed of 3 places in 68 ms of which 1 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/1610 variables, 1/1068 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1610 variables, 0/1068 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/1610 variables, 0/1068 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1610/1610 variables, and 1068 constraints, problems are : Problem set: 0 solved, 1 unsolved in 3216 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 590/590 constraints, ReadFeed: 436/436 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 10/10 constraints]
After SMT, in 3908ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 87 ms.
Support contains 3 out of 590 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 3890/3890 transitions.
Applied a total of 0 rules in 166 ms. Remains 590 /590 variables (removed 0) and now considering 3890/3890 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 166 ms. Remains : 590/590 places, 3890/3890 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 3890/3890 transitions.
Applied a total of 0 rules in 164 ms. Remains 590 /590 variables (removed 0) and now considering 3890/3890 (removed 0) transitions.
[2024-06-01 10:08:32] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2024-06-01 10:08:32] [INFO ] Invariant cache hit.
[2024-06-01 10:08:33] [INFO ] Implicit Places using invariants in 1190 ms returned []
[2024-06-01 10:08:33] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2024-06-01 10:08:33] [INFO ] Invariant cache hit.
[2024-06-01 10:08:34] [INFO ] State equation strengthened by 436 read => feed constraints.
[2024-06-01 10:08:39] [INFO ] Implicit Places using invariants and state equation in 5365 ms returned []
Implicit Place search using SMT with State Equation took 6560 ms to find 0 implicit places.
[2024-06-01 10:08:39] [INFO ] Redundant transitions in 179 ms returned []
Running 3880 sub problems to find dead transitions.
[2024-06-01 10:08:39] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2024-06-01 10:08:39] [INFO ] Invariant cache hit.
[2024-06-01 10:08:39] [INFO ] State equation strengthened by 436 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/590 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 3880 unsolved
SMT process timed out in 34134ms, After SMT, problems are : Problem set: 0 solved, 3880 unsolved
Search for dead transitions found 0 dead transitions in 34177ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41095 ms. Remains : 590/590 places, 3890/3890 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 3642 edges and 590 vertex of which 100 / 590 are part of one of the 10 SCC in 1 ms
Free SCC test removed 90 places
Drop transitions (Empty/Sink Transition effects.) removed 350 transitions
Ensure Unique test removed 2790 transitions
Reduce isomorphic transitions removed 3140 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 118 transitions
Trivial Post-agglo rules discarded 118 transitions
Performed 118 trivial Post agglomeration. Transition count delta: 118
Iterating post reduction 0 with 118 rules applied. Total rules applied 119 place count 500 transition count 632
Reduce places removed 118 places and 0 transitions.
Iterating post reduction 1 with 118 rules applied. Total rules applied 237 place count 382 transition count 632
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 21 Pre rules applied. Total rules applied 237 place count 382 transition count 611
Deduced a syphon composed of 21 places in 1 ms
Ensure Unique test removed 10 places
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 2 with 52 rules applied. Total rules applied 289 place count 351 transition count 611
Performed 179 Post agglomeration using F-continuation condition.Transition count delta: 179
Deduced a syphon composed of 179 places in 0 ms
Reduce places removed 179 places and 0 transitions.
Iterating global reduction 2 with 358 rules applied. Total rules applied 647 place count 172 transition count 432
Ensure Unique test removed 88 transitions
Reduce isomorphic transitions removed 88 transitions.
Iterating post reduction 2 with 88 rules applied. Total rules applied 735 place count 172 transition count 344
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 755 place count 162 transition count 344
Drop transitions (Empty/Sink Transition effects.) removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 765 place count 162 transition count 334
Drop transitions (Redundant composition of simpler transitions.) removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 4 with 11 rules applied. Total rules applied 776 place count 162 transition count 323
Free-agglomeration rule applied 91 times.
Iterating global reduction 4 with 91 rules applied. Total rules applied 867 place count 162 transition count 232
Reduce places removed 91 places and 0 transitions.
Iterating post reduction 4 with 91 rules applied. Total rules applied 958 place count 71 transition count 232
Partial Free-agglomeration rule applied 10 times.
Drop transitions (Partial Free agglomeration) removed 10 transitions
Iterating global reduction 5 with 10 rules applied. Total rules applied 968 place count 71 transition count 232
Applied a total of 968 rules in 44 ms. Remains 71 /590 variables (removed 519) and now considering 232/3890 (removed 3658) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 232 rows 71 cols
[2024-06-01 10:09:13] [INFO ] Computed 21 invariants in 0 ms
[2024-06-01 10:09:13] [INFO ] After 29ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-01 10:09:13] [INFO ] [Nat]Absence check using 21 positive place invariants in 7 ms returned sat
[2024-06-01 10:09:13] [INFO ] After 78ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-06-01 10:09:13] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-06-01 10:09:13] [INFO ] After 15ms SMT Verify possible using 10 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-01 10:09:13] [INFO ] Deduced a trap composed of 2 places in 17 ms of which 1 ms to minimize.
[2024-06-01 10:09:13] [INFO ] Deduced a trap composed of 2 places in 18 ms of which 1 ms to minimize.
[2024-06-01 10:09:13] [INFO ] Deduced a trap composed of 2 places in 16 ms of which 0 ms to minimize.
[2024-06-01 10:09:13] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 85 ms
TRAPS : Iteration 1
[2024-06-01 10:09:13] [INFO ] After 127ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-01 10:09:13] [INFO ] After 255ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 340 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 74 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 47 ms :[true, (NOT p0)]
Stuttering acceptance computed with spot in 45 ms :[true, (NOT p0)]
Stuttering acceptance computed with spot in 44 ms :[true, (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 346 ms.
Product exploration explored 100000 steps with 0 reset in 548 ms.
Support contains 3 out of 590 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 590/590 places, 3890/3890 transitions.
Applied a total of 0 rules in 167 ms. Remains 590 /590 variables (removed 0) and now considering 3890/3890 (removed 0) transitions.
[2024-06-01 10:09:15] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
// Phase 1: matrix 1020 rows 590 cols
[2024-06-01 10:09:15] [INFO ] Computed 31 invariants in 3 ms
[2024-06-01 10:09:16] [INFO ] Implicit Places using invariants in 1246 ms returned []
[2024-06-01 10:09:16] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2024-06-01 10:09:16] [INFO ] Invariant cache hit.
[2024-06-01 10:09:16] [INFO ] State equation strengthened by 436 read => feed constraints.
[2024-06-01 10:09:21] [INFO ] Implicit Places using invariants and state equation in 5357 ms returned []
Implicit Place search using SMT with State Equation took 6606 ms to find 0 implicit places.
[2024-06-01 10:09:21] [INFO ] Redundant transitions in 178 ms returned []
Running 3880 sub problems to find dead transitions.
[2024-06-01 10:09:21] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2024-06-01 10:09:21] [INFO ] Invariant cache hit.
[2024-06-01 10:09:22] [INFO ] State equation strengthened by 436 read => feed constraints.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/590 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 3880 unsolved
SMT process timed out in 33753ms, After SMT, problems are : Problem set: 0 solved, 3880 unsolved
Search for dead transitions found 0 dead transitions in 33797ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 40762 ms. Remains : 590/590 places, 3890/3890 transitions.
Treatment of property EisenbergMcGuire-PT-10-LTLFireability-03 finished in 246687 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((p0 U (G(p1) U X(p2))))||G(p3)))'
Support contains 8 out of 1006 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1006/1006 places, 4360/4360 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 1001 transition count 4310
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 1001 transition count 4310
Applied a total of 10 rules in 59 ms. Remains 1001 /1006 variables (removed 5) and now considering 4310/4360 (removed 50) transitions.
[2024-06-01 10:09:56] [INFO ] Flow matrix only has 1440 transitions (discarded 2870 similar events)
// Phase 1: matrix 1440 rows 1001 cols
[2024-06-01 10:09:56] [INFO ] Computed 31 invariants in 5 ms
[2024-06-01 10:09:57] [INFO ] Implicit Places using invariants in 1339 ms returned []
[2024-06-01 10:09:57] [INFO ] Flow matrix only has 1440 transitions (discarded 2870 similar events)
[2024-06-01 10:09:57] [INFO ] Invariant cache hit.
[2024-06-01 10:09:58] [INFO ] State equation strengthened by 445 read => feed constraints.
[2024-06-01 10:10:07] [INFO ] Implicit Places using invariants and state equation in 10437 ms returned []
Implicit Place search using SMT with State Equation took 11778 ms to find 0 implicit places.
Running 4300 sub problems to find dead transitions.
[2024-06-01 10:10:07] [INFO ] Flow matrix only has 1440 transitions (discarded 2870 similar events)
[2024-06-01 10:10:07] [INFO ] Invariant cache hit.
[2024-06-01 10:10:07] [INFO ] State equation strengthened by 445 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1001 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 4300 unsolved
SMT process timed out in 34119ms, After SMT, problems are : Problem set: 0 solved, 4300 unsolved
Search for dead transitions found 0 dead transitions in 34168ms
Starting structural reductions in LTL mode, iteration 1 : 1001/1006 places, 4310/4360 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 46014 ms. Remains : 1001/1006 places, 4310/4360 transitions.
Stuttering acceptance computed with spot in 484 ms :[(AND (NOT p2) (NOT p3)), (NOT p2), (AND (NOT p2) (NOT p3)), (NOT p2), (NOT p2), (NOT p2), true, (AND (NOT p3) (NOT p2)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (NOT p1), (NOT p3), (AND (NOT p1) (NOT p3))]
Running random walk in product with property : EisenbergMcGuire-PT-10-LTLFireability-04
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA EisenbergMcGuire-PT-10-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property EisenbergMcGuire-PT-10-LTLFireability-04 finished in 46544 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0||X(G(p0)))))'
Support contains 2 out of 1006 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1006/1006 places, 4360/4360 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 1001 transition count 4310
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 1001 transition count 4310
Applied a total of 10 rules in 58 ms. Remains 1001 /1006 variables (removed 5) and now considering 4310/4360 (removed 50) transitions.
[2024-06-01 10:10:42] [INFO ] Flow matrix only has 1440 transitions (discarded 2870 similar events)
// Phase 1: matrix 1440 rows 1001 cols
[2024-06-01 10:10:42] [INFO ] Computed 31 invariants in 5 ms
[2024-06-01 10:10:43] [INFO ] Implicit Places using invariants in 1257 ms returned []
[2024-06-01 10:10:43] [INFO ] Flow matrix only has 1440 transitions (discarded 2870 similar events)
[2024-06-01 10:10:43] [INFO ] Invariant cache hit.
[2024-06-01 10:10:44] [INFO ] State equation strengthened by 445 read => feed constraints.
[2024-06-01 10:10:53] [INFO ] Implicit Places using invariants and state equation in 9959 ms returned []
Implicit Place search using SMT with State Equation took 11220 ms to find 0 implicit places.
Running 4300 sub problems to find dead transitions.
[2024-06-01 10:10:53] [INFO ] Flow matrix only has 1440 transitions (discarded 2870 similar events)
[2024-06-01 10:10:53] [INFO ] Invariant cache hit.
[2024-06-01 10:10:53] [INFO ] State equation strengthened by 445 read => feed constraints.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1001 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 4300 unsolved
SMT process timed out in 34965ms, After SMT, problems are : Problem set: 0 solved, 4300 unsolved
Search for dead transitions found 0 dead transitions in 35014ms
Starting structural reductions in LTL mode, iteration 1 : 1001/1006 places, 4310/4360 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 46298 ms. Remains : 1001/1006 places, 4310/4360 transitions.
Stuttering acceptance computed with spot in 83 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : EisenbergMcGuire-PT-10-LTLFireability-06
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA EisenbergMcGuire-PT-10-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property EisenbergMcGuire-PT-10-LTLFireability-06 finished in 46407 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)) U (X((p1||X(p0))) U (p2||F(p3)))))'
Support contains 10 out of 1006 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1006/1006 places, 4360/4360 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 1001 transition count 4310
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 1001 transition count 4310
Applied a total of 10 rules in 58 ms. Remains 1001 /1006 variables (removed 5) and now considering 4310/4360 (removed 50) transitions.
[2024-06-01 10:11:28] [INFO ] Flow matrix only has 1440 transitions (discarded 2870 similar events)
// Phase 1: matrix 1440 rows 1001 cols
[2024-06-01 10:11:28] [INFO ] Computed 31 invariants in 5 ms
[2024-06-01 10:11:30] [INFO ] Implicit Places using invariants in 1310 ms returned []
[2024-06-01 10:11:30] [INFO ] Flow matrix only has 1440 transitions (discarded 2870 similar events)
[2024-06-01 10:11:30] [INFO ] Invariant cache hit.
[2024-06-01 10:11:31] [INFO ] State equation strengthened by 445 read => feed constraints.
[2024-06-01 10:11:41] [INFO ] Implicit Places using invariants and state equation in 11746 ms returned []
Implicit Place search using SMT with State Equation took 13058 ms to find 0 implicit places.
Running 4300 sub problems to find dead transitions.
[2024-06-01 10:11:42] [INFO ] Flow matrix only has 1440 transitions (discarded 2870 similar events)
[2024-06-01 10:11:42] [INFO ] Invariant cache hit.
[2024-06-01 10:11:42] [INFO ] State equation strengthened by 445 read => feed constraints.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 0.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 0.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 0.0)
(s352 0.0)
(s353 0.0)
(s354 0.0)
(s355 0.0)
(s356 0.0)
(s357 0.0)
(s358 0.0)
(s359 0.0)
(s360 0.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 0.0)
(s369 0.0)
(s370 0.0)
(s371 0.0)
(s372 0.0)
(s373 0.0)
(s374 0.0)
(s375 0.0)
(s376 0.0)
(s377 0.0)
(s378 0.0)
(s379 0.0)
(s380 0.0)
(s381 0.0)
(s382 0.0)
(s383 0.0)
(s384 0.0)
(s385 0.0)
(s386 0.0)
(s387 0.0)
(s388 0.0)
(s389 0.0)
(s390 0.0)
(s391 0.0)
(s392 0.0)
(s393 0.0)
(s394 0.0)
(s395 0.0)
(s396 0.0)
(s397 0.0)
(s398 0.0)
(s399 0.0)
(s400 0.0)
(s401 0.0)
(s402 0.0)
(s403 0.0)
(s404 0.0)
(s405 0.0)
(s406 0.0)
(s407 0.0)
(s408 0.0)
(s409 0.0)
(s410 0.0)
(s411 0.0)
(s412 0.0)
(s413 0.0)
(s414 0.0)
(s415 0.0)
(s416 0.0)
(s417 0.0)
(s418 0.0)
(s419 0.0)
(s420 0.0)
(s421 0.0)
(s422 0.0)
(s423 0.0)
(s424 0.0)
(s425 0.0)
(s426 0.0)
(s427 0.0)
(s428 0.0)
(s429 0.0)
(s430 0.0)
(s431 1.0)
(s432 0.0)
(s433 1.0)
(s434 1.0)
(s435 1.0)
(s436 1.0)
(s437 1.0)
(s438 1.0)
(s439 1.0)
(s440 1.0)
(s441 0.0)
(s442 0.0)
(s443 0.0)
(s444 0.0)
(s445 0.0)
(s446 0.0)
(s447 0.0)
(s448 0.0)
(s449 0.0)
(s450 0.0)
(s451 0.0)
(s452 0.0)
(s453 0.0)
(s454 0.0)
(s455 0.0)
(s456 0.0)
(s457 0.0)
(s458 0.0)
(s459 0.0)
(s460 0.0)
(s461 0.0)
(s462 0.0)
(s463 0.0)
(s464 0.0)
(s465 0.0)
(s466 0.0)
(s467 0.0)
(s468 0.0)
(s469 0.0)
(s470 0.0)
(s471 0.0)
(s472 0.0)
(s473 0.0)
(s474 0.0)
(s475 0.0)
(s476 0.0)
(s477 0.0)
(s478 0.0)
(s479 0.0)
(s480 0.0)
(s481 0.0)
(s482 0.0)
(s483 0.0)
(s484 0.0)
(s485 0.0)
(s486 0.0)
(s487 0.0)
(s488 0.0)
(s489 0.0)
(s490 0.0)
(s491 timeout
0.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1001 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 4300 unsolved
SMT process timed out in 33948ms, After SMT, problems are : Problem set: 0 solved, 4300 unsolved
Search for dead transitions found 0 dead transitions in 34068ms
Starting structural reductions in LTL mode, iteration 1 : 1001/1006 places, 4310/4360 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 47188 ms. Remains : 1001/1006 places, 4310/4360 transitions.
Stuttering acceptance computed with spot in 121 ms :[(AND (NOT p2) (NOT p3)), (AND (NOT p3) (NOT p1) (NOT p0)), (AND (NOT p3) (NOT p0))]
Running random walk in product with property : EisenbergMcGuire-PT-10-LTLFireability-07
Product exploration explored 100000 steps with 0 reset in 421 ms.
Stack based approach found an accepted trace after 272 steps with 0 reset with depth 273 and stack size 273 in 2 ms.
FORMULA EisenbergMcGuire-PT-10-LTLFireability-07 FALSE TECHNIQUES STACK_TEST
Treatment of property EisenbergMcGuire-PT-10-LTLFireability-07 finished in 47769 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(p0)&&F(p1)))'
Support contains 5 out of 1006 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1006/1006 places, 4360/4360 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 1001 transition count 4310
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 1001 transition count 4310
Applied a total of 10 rules in 59 ms. Remains 1001 /1006 variables (removed 5) and now considering 4310/4360 (removed 50) transitions.
[2024-06-01 10:12:16] [INFO ] Flow matrix only has 1440 transitions (discarded 2870 similar events)
// Phase 1: matrix 1440 rows 1001 cols
[2024-06-01 10:12:16] [INFO ] Computed 31 invariants in 5 ms
[2024-06-01 10:12:17] [INFO ] Implicit Places using invariants in 1130 ms returned []
[2024-06-01 10:12:17] [INFO ] Flow matrix only has 1440 transitions (discarded 2870 similar events)
[2024-06-01 10:12:17] [INFO ] Invariant cache hit.
[2024-06-01 10:12:18] [INFO ] State equation strengthened by 445 read => feed constraints.
[2024-06-01 10:12:29] [INFO ] Implicit Places using invariants and state equation in 12071 ms returned []
Implicit Place search using SMT with State Equation took 13201 ms to find 0 implicit places.
Running 4300 sub problems to find dead transitions.
[2024-06-01 10:12:29] [INFO ] Flow matrix only has 1440 transitions (discarded 2870 similar events)
[2024-06-01 10:12:29] [INFO ] Invariant cache hit.
[2024-06-01 10:12:29] [INFO ] State equation strengthened by 445 read => feed constraints.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 1.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 0.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 0.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 0.0)
(s352 0.0)
(s353 0.0)
(s354 0.0)
(s355 0.0)
(s356 0.0)
(s357 0.0)
(s358 0.0)
(s359 0.0)
(s360 0.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 0.0)
(s369 0.0)
(s370 0.0)
(s371 0.0)
(s372 0.0)
(s373 0.0)
(s374 0.0)
(s375 0.0)
(s376 0.0)
(s377 0.0)
(s378 0.0)
(s379 0.0)
(s380 0.0)
(s381 0.0)
(s382 0.0)
(s383 0.0)
(s384 0.0)
(s385 0.0)
(s386 0.0)
(s387 0.0)
(s388 0.0)
(s389 0.0)
(s390 0.0)
(s391 0.0)
(s392 0.0)
(s393 0.0)
(s394 0.0)
(s395 0.0)
(s396 0.0)
(s397 0.0)
(s398 0.0)
(s399 0.0)
(s400 0.0)
(s401 0.0)
(s402 0.0)
(s403 0.0)
(s404 0.0)
(s405 0.0)
(s406 0.0)
(s407 0.0)
(s408 0.0)
(s409 0.0)
(s410 0.0)
(s411 0.0)
(s412 0.0)
(s413 0.0)
(s414 0.0)
(s415 0.0)
(s416 0.0)
(s417 0.0)
(s418 0.0)
(s419 0.0)
(s420 0.0)
(s421 0.0)
(s422 0.0)
(s423 0.0)
(s424 0.0)
(s425 0.0)
(s426 0.0)
(s427 0.0)
(s428 0.0)
(s429 0.0)
(s430 0.0)
(s431 1.0)
(s432 0.0)
(s433 1.0)
(s434 1.0)
(s435 1.0)
(s436 1.0)
(s437 1.0)
(s438 1.0)
(s439 1.0)
(s440 1.0)
(s441 0.0)
(s442 0.0)
(s443 0.0)
(s444 0.0)
(s445 0.0)
(s446 0.0)
(s447 0.0)
(s448 0.0)
(s449 0.0)
(s450 0.0)
(s451 0.0)
(s452 0.0)
(s453 0.0)
(s454 0.0)
(s455 0.0)
(s456 0.0)
(s457 0.0)
(s458 0.0)
(s459 0.0)
(s460 0.0)
(s461 0.0)
(s462 0.0)
(s463 0.0)
(s464 0.0)
(s465 0.0)
(s466 0.0)
(s467 0.0)
(s468 0.0)
(s469 0.0)
(s470 0.0)
(s471 0.0)
(s472 0.0)
(s473 0.0)
(s474 0.0)
(s475 0.0)
(s476 0.0)
(s477 0.0)
(s478 0.0)
(s479 0.0)
(s480 0.0)
(s481 0.0)
(s482 0.0)
(s483 0.0)
(s484 0.0)
(s485 0.0)
(s486 0.0)
(s487 0.0)
(s488 0.0)
(s489 0.0)
(s490 0.0)
(s491 0.0)
(s492 0.0)
(s493 0.0)
(s494 0.0)
(s495 0.0)
(s496 0.0)
(s497 0.0)
(s498 0.0)
(s499 0.0)
(s500 0.0)
(s501 0.0)
(s502 0.0)
(s503 0.0)
(s504 0.0)
(s505 0.0)
(s506 0.0)
(s507 0.0)
(s508 0.0)
(s509 0.0)
(s510 0.0)
(s511 0.0)
(s512 0.0)
(s513 0.0)
(s514 0.0)
(s515 0.0)
(s516 0.0)
(s517 0.0)
(s518 0.0)
(s519 0.0)
(s520 0.0)
(s521 0.0)
(s522 0.0)
(s523 0.0)
(s524 0.0)
(s525 0.0)
(s526 0.0)
(s527 0.0)
(s528 0.0)
(s529 0.0)
(s530 0.0)
(s531 0.0)
(s532 0.0)
(s533 0.0)
(s534 0.0)
(s535 0.0)
(s536 0.0)
(s537 0.0)
(s538 0.0)
(s539 0.0)
(s540 0.0)
(s541 0.0)
(s542 0.0)
(s543 0.0)
(s544 0.0)
(s545 0.0)
(s546 0.0)
(s547 0.0)
(s548 0.0)
(s549 0.0)
(s550 0.0)
(s551 0.0)
(s552 0.0)
(s553 0.0)
(s554 0.0)
(s555 0.0)
(s556 0.0)
(s557 0.0)
(s558 0.0)
(s559 0.0)
(s560 0.0)
(s561 0.0)
(s562 0.0)
(s563 0.0)
(s564 0.0)
(s565 0.0)
(s566 0.0)
(s567 0.0)
(s568 0.0)
(s569 0.0)
(s570 0.0)
(s571 0.0)
(s572 0.0)
(s573 0.0)
(s574 0.0)
(s575 0.0)
(s576 0.0)
(s577 0.0)
(s578 0.0)
(s579 0.0)
(s580 0.0)
(s581 0.0)
(s582 0.0)
(s583 0.0)
(s584 0.0)
(s585 0.0)
(s586 0.0)
(s587 0.0)
(s588 0.0)
(s589 0.0)
(s590 0.0)
(s591 0.0)
(s592 0.0)
(s593 0.0)
(s594 0.0)
(s595 0.0)
(s596 0.0)
(s597 0.0)
(s598 0.0)
(s599 0.0)
(s600 0.0)
(s601 0.0)
(s602 0.0)
(s603 0.0)
(s604 0.0)
(s605 0.0)
(s606 0.0)
(s607 0.0)
(s608 0.0)
(s609 0.0)
(s610 0.0)
(s611 0.0)
(s612 0.0)
(s613 0.0)
(s614 0.0)
(s615 0.0)
(s616 0.0)
(s617 0.0)
(s618 0.0)
(s619 0.0)
(s620 0.0)
(s621 0.0)
(s622 0.0)
(s623 0.0)
(s624 0.0)
(s625 0.0)
(s626 0.0)
(s627 0.0)
(s628 0.0)
(s629 0.0)
(s630 0.0)
(s631 0.0)
(s632 0.0)
(s633 0.0)
(s634 0.0)
(s635 0.0)
(s636 0.0)
(s637 0.0)
(s638 0.0)
(s639 0.0)
(s640 0.0)
(s641 0.0)
(s642 0.0)
(s643 0.0)
(s644 0.0)
(s645 0.0)
(s646 0.0)
(s647 0.0)
(s648 0.0)
(s649 0.0)
(s650 0.0)
(s651 0.0)
(s652 0.0)
(s653 0.0)
(s654 0.0)
(s655 0.0)
(s656 0.0)
(s657 0.0)
(s658 0.0)
(s659 0.0)
(s660 0.0)
(s661 0.0)
(s662 0.0)
(s663 0.0)
(s664 0.0)
(s665 0.0)
(s666 0.0)
(s667 0.0)
(s668 0.0)
(s669 0.0)
(s670 0.0)
(s671 0.0)
(s672 1.0)
(s673 0.0)
(s674 0.0)
(s675 0.0)
(s676 0.0)
(s677 0.0)
(s678 0.0)
(s679 0.0)
(s680 0.0)
(s681 0.0)
(s682 0.0)
(s683 0.0)
(s684 0.0)
(s685 0.0)
(s686 0.0)
(s687 0.0)
(s688 0.0)
(s689 0.0)
(s690 0.0)
(s691 0.0)
(s692 0.0)
(s693 0.0)
(s694 0.0)
(s695 0.0)
(s696 0.0)
(s697 0.0)
(s698 0.0)
(s699 0.0)
(s700 0.0)
(s701 0.0)
(s702 0.0)
(s703 0.0)
(s704 0.0)
(s705 0.0)
(s706 0.0)
(s707 0.0)
(s708 0.0)
(s709 0.0)
(s710 0.0)
(s711 0.0)
(s712 0.0)
(s713 0.0)
(s714 0.0)
(s715 0.0)
(s716 0.0)
(s717 0.0)
(s718 0.0)
(s719 0.0)
(s720 0.0)
(s721 0.0)
(s722 0.0)
(s723 0.0)
(s724 0.0)
(s725 0.0)
(s726 0.0)
(s727 0.0)
(s728 0.0)
(s729 0.0)
(s730 0.0)
(s731 0.0)
(s732 0.0)
(s733 0.0)
(s734 0.0)
(s735 0.0)
(s736 0.0)
(s737 0.0)
(s738 0.0)
(s739 0.0)
(s740 0.0)
(s741 0.0)
(s742 0.0)
(s743 0.0)
(s744 0.0)
(s745 0.0)
(s746 0.0)
(s747 0.0)
(s748 0.0)
(s749 0.0)
(s750 0.0)
(s751 0.0)
(s752 0.0)
(s753 0.0)
(s754 0.0)
(s755 0.0)
(s756 0.0)
(s757 0.0)
(s758 0.0)
(s759 0.0)
(s760 0.0)
(s761 0.0)
(s762 0.0)
(s763 0.0)
(s764 0.0)
(s765 0.0)
(s766 0.0)
(s767 0.0)
(s768 0.0)
(s769 0.0)
(s770 0.0)
(s771 0.0)
(s772 0.0)
(s773 0.0)
(s774 0.0)
(s775 0.0)
(s776 0.0)
(s777 0.0)
(s778 0.0)
(s779 0.0)
(s780 0.0)
(s781 0.0)
(s782 0.0)
(s783 0.0)
(s784 0.0)
(s785 0.0)
(s786 0.0)
(s787 0.0)
(s788 0.0)
(s789 0.0)
(s790 0.0)
(s791 0.0)
(s792 0.0)
(s793 0.0)
(s794 0.0)
(s795 0.0)
(s796 0.0)
(s797 0.0)
(s798 0.0)
(s799 0.0)
(s800 0.0)
(s801 0.0)
(s802 0.0)
(s803 0.0)
(s804 0.0)
(s805 0.0)
(s806 0.0)
(s807 0.0)
(s808 0.0)
(s809 0.0)
(s810 0.0)
(s811 0.0)
(s812 0.0)
(s813 0.0)
(s814 0.0)
(s815 0.0)
(s816 0.0)
(s817 0.0)
(s818 0.0)
(s819 0.0)
(s820 0.0)
(s821 0.0)
(s822 0.0)
(s823 0.0)
(s824 0.0)
(s825 0.0)
(s826 0.0)
(s827 0.0)
(s828 0.0)
(s829 0.0)
(s830 0.0)
(s831 0.0)
(s832 0.0)
(s833 0.0)
(s834 0.0)
(s835 0.0)
(s836 0.0)
(s837 0.0)
(s838 0.0)
(s839 0.0)
(s840 0.0)
(s841 0.0)
(s842 0.0)
(s843 0.0)
(s844 0.0)
(s845 0.0)
(s846 0.0)
(s847 0.0)
(s848 0.0)
(s849 0.0)
(s850 0.0)
(s851 0.0)
(s852 0.0)
(s853 0.0)
(s854 0.0)
(s855 0.0)
(s856 0.0)
(s857 0.0)
(s858 0.0)
(s859 0.0)
(s860 0.0)
(s861 0.0)
(s862 0.0)
(s863 0.0)
(s864 0.0)
(s865 0.0)
(s866 0.0)
(s867 0.0)
(s868 0.0)
(s869 0.0)
(s870 0.0)
(s871 0.0)
(s872 0.0)
(s873 0.0)
(s874 0.0)
(s875 0.0)
(s876 0.0)
(s877 0.0)
(s878 0.0)
(s879 0.0)
(s880 0.0)
(s881 0.0)
(s882 0.0)
(s883 0.0)
(s884 0.0)
(s885 0.0)
(s886 0.0)
(s887 0.0)
(s888 0.0)
(s889 0.0)
(s890 0.0)
(s891 0.0)
(s892 0.0)
(s893 0.0)
(s894 0.0)
(s895 0.0)
(s896 0.0)
(s897 0.0)
(s898 0.0)
(s899 0.0)
(s900 0.0)
(s901 0.0)
(s902 0.0)
(s903 0.0)
(s904 0.0)
(s905 0.0)
(s906 0.0)
(s907 0.0)
(s908 0.0)
(s909 0.0)
(s910 0.0)
(s911 0.0)
(s912 0.0)
(s913 0.0)
(s914 0.0)
(s915 0.0)
(s916 0.0)
(s917 0.0)
(s918 0.0)
(s919 0.0)
(s920 0.0)
(s921 0.0)
(s922 0.0)
(s923 0.0)
(s924 0.0)
(s925 0.0)
(s926 0.0)
(s927 0.0)
(s928 0.0)
(s929 0.0)
(s930 0.0)
(s931 0.0)
(s932 0.0)
(s933 0.0)
(s934 0.0)
(s935 0.0)
(s936 0.0)
(s937 0.0)
(s938 0.0)
(s939 0.0)
(s940 0.0)
(s941 0.0)
(s942 0.0)
(s943 0.0)
(s944 0.0)
(s945 0.0)
(s946 0.0)
(s947 0.0)
(s948 0.0)
(s949 0.0)
(s950 0.0)
(s951 0.0)
(s952 0.0)
(s953 0.0)
(s954 0.0)
(s955 0.0)
(s956 0.0)
(s957 0.0)
(s958 0.0)
(s959 0.0)
(s960 0.0)
(s961 0.0)
(s962 0.0)
(s963 0.0)
(s964 0.0)
(s965 0.0)
(s966 0.0)
(s967 0.0)
(s968 0.0)
(s969 0.0)
(s970 0.0)
(s971 0.0)
(s972 0.0)
(s973 0.0)
(s974 0.0)timeout
(s975 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1001 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 4300 unsolved
SMT process timed out in 34325ms, After SMT, problems are : Problem set: 0 solved, 4300 unsolved
Search for dead transitions found 0 dead transitions in 34370ms
Starting structural reductions in LTL mode, iteration 1 : 1001/1006 places, 4310/4360 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 47637 ms. Remains : 1001/1006 places, 4310/4360 transitions.
Stuttering acceptance computed with spot in 123 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), true]
Running random walk in product with property : EisenbergMcGuire-PT-10-LTLFireability-08
Product exploration explored 100000 steps with 50000 reset in 1404 ms.
Product exploration explored 100000 steps with 50000 reset in 1010 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p0), (X p0), (X p1), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 14 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA EisenbergMcGuire-PT-10-LTLFireability-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property EisenbergMcGuire-PT-10-LTLFireability-08 finished in 50223 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((p0||(p1 U X(G(p1)))))))'
Support contains 4 out of 1006 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1006/1006 places, 4360/4360 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 1000 transition count 4300
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 1000 transition count 4300
Applied a total of 12 rules in 60 ms. Remains 1000 /1006 variables (removed 6) and now considering 4300/4360 (removed 60) transitions.
[2024-06-01 10:13:06] [INFO ] Flow matrix only has 1430 transitions (discarded 2870 similar events)
// Phase 1: matrix 1430 rows 1000 cols
[2024-06-01 10:13:06] [INFO ] Computed 31 invariants in 5 ms
[2024-06-01 10:13:08] [INFO ] Implicit Places using invariants in 1340 ms returned []
[2024-06-01 10:13:08] [INFO ] Flow matrix only has 1430 transitions (discarded 2870 similar events)
[2024-06-01 10:13:08] [INFO ] Invariant cache hit.
[2024-06-01 10:13:09] [INFO ] State equation strengthened by 436 read => feed constraints.
[2024-06-01 10:13:18] [INFO ] Implicit Places using invariants and state equation in 10532 ms returned []
Implicit Place search using SMT with State Equation took 11876 ms to find 0 implicit places.
Running 4290 sub problems to find dead transitions.
[2024-06-01 10:13:18] [INFO ] Flow matrix only has 1430 transitions (discarded 2870 similar events)
[2024-06-01 10:13:18] [INFO ] Invariant cache hit.
[2024-06-01 10:13:18] [INFO ] State equation strengthened by 436 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1000 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 4290 unsolved
SMT process timed out in 34093ms, After SMT, problems are : Problem set: 0 solved, 4290 unsolved
Search for dead transitions found 0 dead transitions in 34138ms
Starting structural reductions in LTL mode, iteration 1 : 1000/1006 places, 4300/4360 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 46079 ms. Remains : 1000/1006 places, 4300/4360 transitions.
Stuttering acceptance computed with spot in 188 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : EisenbergMcGuire-PT-10-LTLFireability-09
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA EisenbergMcGuire-PT-10-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property EisenbergMcGuire-PT-10-LTLFireability-09 finished in 46293 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 3 out of 1006 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1006/1006 places, 4360/4360 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 1006 transition count 4351
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 18 place count 997 transition count 4351
Performed 310 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 310 Pre rules applied. Total rules applied 18 place count 997 transition count 4041
Deduced a syphon composed of 310 places in 4 ms
Reduce places removed 310 places and 0 transitions.
Iterating global reduction 2 with 620 rules applied. Total rules applied 638 place count 687 transition count 4041
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 644 place count 681 transition count 3981
Iterating global reduction 2 with 6 rules applied. Total rules applied 650 place count 681 transition count 3981
Performed 90 Post agglomeration using F-continuation condition.Transition count delta: 90
Deduced a syphon composed of 90 places in 4 ms
Reduce places removed 90 places and 0 transitions.
Iterating global reduction 2 with 180 rules applied. Total rules applied 830 place count 591 transition count 3891
Applied a total of 830 rules in 470 ms. Remains 591 /1006 variables (removed 415) and now considering 3891/4360 (removed 469) transitions.
[2024-06-01 10:13:53] [INFO ] Flow matrix only has 1021 transitions (discarded 2870 similar events)
// Phase 1: matrix 1021 rows 591 cols
[2024-06-01 10:13:53] [INFO ] Computed 31 invariants in 3 ms
[2024-06-01 10:13:54] [INFO ] Implicit Places using invariants in 1057 ms returned []
[2024-06-01 10:13:54] [INFO ] Flow matrix only has 1021 transitions (discarded 2870 similar events)
[2024-06-01 10:13:54] [INFO ] Invariant cache hit.
[2024-06-01 10:13:55] [INFO ] State equation strengthened by 436 read => feed constraints.
[2024-06-01 10:13:59] [INFO ] Implicit Places using invariants and state equation in 5293 ms returned []
Implicit Place search using SMT with State Equation took 6352 ms to find 0 implicit places.
[2024-06-01 10:14:00] [INFO ] Redundant transitions in 186 ms returned []
Running 3881 sub problems to find dead transitions.
[2024-06-01 10:14:00] [INFO ] Flow matrix only has 1021 transitions (discarded 2870 similar events)
[2024-06-01 10:14:00] [INFO ] Invariant cache hit.
[2024-06-01 10:14:00] [INFO ] State equation strengthened by 436 read => feed constraints.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 1.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 0.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 1.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 1.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 1.0)
(s89 0.0)
(s90 1.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 1.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 1.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 1.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 1.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 timeout
0.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/591 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 3881 unsolved
SMT process timed out in 34007ms, After SMT, problems are : Problem set: 0 solved, 3881 unsolved
Search for dead transitions found 0 dead transitions in 34048ms
Starting structural reductions in SI_LTL mode, iteration 1 : 591/1006 places, 3891/4360 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 41067 ms. Remains : 591/1006 places, 3891/4360 transitions.
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
Running random walk in product with property : EisenbergMcGuire-PT-10-LTLFireability-12
Product exploration explored 100000 steps with 0 reset in 397 ms.
Stack based approach found an accepted trace after 10 steps with 0 reset with depth 11 and stack size 11 in 0 ms.
FORMULA EisenbergMcGuire-PT-10-LTLFireability-12 FALSE TECHNIQUES STACK_TEST
Treatment of property EisenbergMcGuire-PT-10-LTLFireability-12 finished in 41530 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)))'
Support contains 5 out of 1006 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1006/1006 places, 4360/4360 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 1006 transition count 4350
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 20 place count 996 transition count 4350
Performed 310 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 310 Pre rules applied. Total rules applied 20 place count 996 transition count 4040
Deduced a syphon composed of 310 places in 5 ms
Reduce places removed 310 places and 0 transitions.
Iterating global reduction 2 with 620 rules applied. Total rules applied 640 place count 686 transition count 4040
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 645 place count 681 transition count 3990
Iterating global reduction 2 with 5 rules applied. Total rules applied 650 place count 681 transition count 3990
Performed 90 Post agglomeration using F-continuation condition.Transition count delta: 90
Deduced a syphon composed of 90 places in 4 ms
Reduce places removed 90 places and 0 transitions.
Iterating global reduction 2 with 180 rules applied. Total rules applied 830 place count 591 transition count 3900
Applied a total of 830 rules in 301 ms. Remains 591 /1006 variables (removed 415) and now considering 3900/4360 (removed 460) transitions.
[2024-06-01 10:14:34] [INFO ] Flow matrix only has 1030 transitions (discarded 2870 similar events)
// Phase 1: matrix 1030 rows 591 cols
[2024-06-01 10:14:34] [INFO ] Computed 31 invariants in 2 ms
[2024-06-01 10:14:36] [INFO ] Implicit Places using invariants in 1203 ms returned []
[2024-06-01 10:14:36] [INFO ] Flow matrix only has 1030 transitions (discarded 2870 similar events)
[2024-06-01 10:14:36] [INFO ] Invariant cache hit.
[2024-06-01 10:14:36] [INFO ] State equation strengthened by 445 read => feed constraints.
[2024-06-01 10:14:41] [INFO ] Implicit Places using invariants and state equation in 5380 ms returned []
Implicit Place search using SMT with State Equation took 6585 ms to find 0 implicit places.
[2024-06-01 10:14:41] [INFO ] Redundant transitions in 203 ms returned []
Running 3890 sub problems to find dead transitions.
[2024-06-01 10:14:41] [INFO ] Flow matrix only has 1030 transitions (discarded 2870 similar events)
[2024-06-01 10:14:41] [INFO ] Invariant cache hit.
[2024-06-01 10:14:41] [INFO ] State equation strengthened by 445 read => feed constraints.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 1.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 0.0)
(s36 1.0)
(s37 1.0)
(s38 0.0)
(s39 1.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 1.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 1.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 1.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 1.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 1.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 1.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 1.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 1.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 timeout
0.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/591 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 3890 unsolved
SMT process timed out in 33708ms, After SMT, problems are : Problem set: 0 solved, 3890 unsolved
Search for dead transitions found 0 dead transitions in 33749ms
Starting structural reductions in SI_LTL mode, iteration 1 : 591/1006 places, 3900/4360 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 40850 ms. Remains : 591/1006 places, 3900/4360 transitions.
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : EisenbergMcGuire-PT-10-LTLFireability-14
Product exploration explored 100000 steps with 0 reset in 458 ms.
Stack based approach found an accepted trace after 54 steps with 0 reset with depth 55 and stack size 55 in 1 ms.
FORMULA EisenbergMcGuire-PT-10-LTLFireability-14 FALSE TECHNIQUES STACK_TEST
Treatment of property EisenbergMcGuire-PT-10-LTLFireability-14 finished in 41406 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((!p0||X(F(p1)))) U X(G(p0))))'
Support contains 4 out of 1006 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1006/1006 places, 4360/4360 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 1001 transition count 4310
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 1001 transition count 4310
Applied a total of 10 rules in 58 ms. Remains 1001 /1006 variables (removed 5) and now considering 4310/4360 (removed 50) transitions.
[2024-06-01 10:15:16] [INFO ] Flow matrix only has 1440 transitions (discarded 2870 similar events)
// Phase 1: matrix 1440 rows 1001 cols
[2024-06-01 10:15:16] [INFO ] Computed 31 invariants in 4 ms
[2024-06-01 10:15:17] [INFO ] Implicit Places using invariants in 1324 ms returned []
[2024-06-01 10:15:17] [INFO ] Flow matrix only has 1440 transitions (discarded 2870 similar events)
[2024-06-01 10:15:17] [INFO ] Invariant cache hit.
[2024-06-01 10:15:18] [INFO ] State equation strengthened by 445 read => feed constraints.
[2024-06-01 10:15:28] [INFO ] Implicit Places using invariants and state equation in 11134 ms returned []
Implicit Place search using SMT with State Equation took 12460 ms to find 0 implicit places.
Running 4300 sub problems to find dead transitions.
[2024-06-01 10:15:28] [INFO ] Flow matrix only has 1440 transitions (discarded 2870 similar events)
[2024-06-01 10:15:28] [INFO ] Invariant cache hit.
[2024-06-01 10:15:28] [INFO ] State equation strengthened by 445 read => feed constraints.
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 1.0)
(s9 0.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 0.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 0.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 0.0)
(s352 0.0)
(s353 0.0)
(s354 0.0)
(s355 0.0)
(s356 0.0)
(s357 0.0)
(s358 0.0)
(s359 0.0)
(s360 0.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 0.0)
(s369 0.0)
(s370 0.0)
(s371 0.0)
(s372 0.0)
(s373 0.0)
(s374 0.0)
(s375 0.0)
(s376 0.0)
(s377 0.0)
(s378 0.0)
(s379 0.0)
(s380 0.0)
(s381 0.0)
(s382 0.0)
(s383 0.0)
(s384 0.0)
(s385 0.0)
(s386 0.0)
(s387 0.0)
(s388 0.0)
(s389 0.0)
(s390 0.0)
(s391 0.0)
(s392 0.0)
(s393 0.0)
(s394 0.0)
(s395 0.0)
(s396 0.0)
(s397 0.0)
(s398 0.0)
(s399 0.0)
(s400 0.0)
(s401 0.0)
(s402 0.0)
(s403 0.0)
(s404 0.0)
(s405 0.0)
(s406 0.0)
(s407 0.0)
(s408 0.0)
(s409 0.0)
(s410 0.0)
(s411 0.0)
(s412 0.0)
(s413 0.0)
(s414 0.0)
(s415 0.0)
(s416 0.0)
(s417 0.0)
(s418 0.0)
(s419 0.0)
(s420 0.0)
(s421 0.0)
(s422 0.0)
(s423 0.0)
(s424 0.0)
(s425 0.0)
(s426 0.0)
(s427 0.0)
(s428 0.0)
(s429 0.0)
(s430 0.0)
(s431 1.0)
(s432 0.0)
(s433 1.0)
(s434 1.0)
(s435 1.0)
(s436 1.0)
(s437 1.0)
(s438 1.0)
(s439 1.0)
(s440 1.0)
(s441 0.0)
(s442 0.0)
(s443 0.0)
(s444 0.0)
(s445 0.0)
(s446 0.0)
(s447 0.0)
(s448 0.0)
(s449 0.0)
(s450 0.0)
(s451 0.0)
(s452 0.0)
(s453 0.0)
(s454 0.0)
(s455 0.0)
(s456 0.0)
(s457 0.0)
(s458 0.0)
(s459 0.0)
(s460 0.0)
(s461 0.0)
(s462 0.0)
(s463 0.0)
(s464 0.0)
(s465 0.0)
(s466 0.0)
(s467 0.0)
(s468 0.0)
(s469 0.0)
(s470 0.0)
(s471 0.0)
(s472 0.0)
(s473 0.0)
(s474 0.0)
(s475 0.0)
(s476 0.0)
(s477 0.0)
(s478 0.0)
(s479 0.0)
(s480 0.0)
(s481 0.0)
(s482 0.0)
(s483 0.0)
(s484 0.0)
(s485 0.0)
(s486 0.0)
(s487 0.0)
(s488 0.0)
(s489 0.0)
(s490 0.0)
(s491 0.0)
(s492 0.0)
(s493 0.0)
(s494 0.0)
(s495 0.0)
(s496 0.0)
(s497 0.0)
(s498 0.0)
(s499 0.0)
(s500 0.0)
(s501 0.0)
(s502 0.0)
(s503 0.0)
(s504 0.0)
(s505 0.0)
(s506 0.0)
(s507 0.0)
(s508 0.0)
(s509 0.0)
(s510 0.0)
(s511 0.0)
(s512 0.0)
(s513 0.0)
(s514 0.0)
(s515 0.0)
(s516 0.0)
(s517 0.0)
(s518 0.0)
(s519 0.0)
(s520 0.0)
(s521 0.0)
(s522 0.0)
(s523 0.0)
(s524 0.0)
(s525 0.0)
(s526 0.0)
(s527 0.0)
(s528 0.0)
(s529 0.0)
(s530 0.0)
(s531 0.0)
(s532 0.0)
(s533 0.0)
(s534 0.0)
(s535 0.0)
(s536 0.0)
(s537 0.0)
(s538 0.0)
(s539 0.0)
(s540 0.0)
(s541 0.0)
(s542 0.0)
(s543 0.0)
(s544 0.0)
(s545 0.0)
(s546 0.0)
(s547 0.0)
(s548 0.0)
(s549 0.0)
(s550 0.0)
(s551 0.0)
(s552 0.0)
(s553 0.0)
(s554 0.0)
(s555 0.0)
(s556 0.0)
(s557 0.0)
(s558 0.0)
(s559 0.0)
(s560 0.0)
(s561 0.0)
(s562 0.0)
(s563 0.0)
(s564 0.0)
(s565 0.0)
(s566 0.0)
(s567 0.0)
(s568 0.0)
(s569 0.0)
(s570 0.0)
(s571 0.0)
(s572 0.0)
(s573 0.0)
(s574 0.0)
(s575 0.0)
(s576 0.0)
(s577 0.0)
(s578 0.0)
(s579 0.0)
(s580 0.0)
(s581 0.0)
(s582 0.0)
(s583 0.0)
(s584 0.0)
(s585 0.0)
(s586 0.0)
(s587 0.0)
(s588 0.0)
(s589 0.0)
(s590 0.0)
(s591 0.0)
(s592 0.0)
(s593 0.0)
(s594 0.0)
(s595 0.0)
(s596 0.0)
(s597 0.0)
(s598 0.0)
(s599 0.0)
(s600 0.0)
(s601 0.0)
(s602 0.0)
(s603 0.0)
(s604 0.0)
(s605 0.0)
(s606 0.0)
(s607 0.0)
(s608 0.0)
(s609 0.0)
(s610 0.0)
(s611 0.0)
(s612 0.0)
(s613 0.0)
(s614 0.0)
(s615 0.0)
(s616 0.0)
(s617 0.0)
(s618 0.0)
(s619 0.0)
(s620 0.0)
(s621 0.0)
(s622 0.0)
(s623 0.0)
(s624 0.0)
(s625 0.0)
(s626 0.0)
(s627 0.0)
(s628 0.0)
(s629 0.0)
(s630 0.0)
(s631 0.0)
(s632 0.0)
(s633 0.0)
(s634 0.0)
(s635 0.0)
(s636 0.0)
(s637 0.0)
(s638 0.0)
(s639 0.0)
(s640 0.0)
(s641 0.0)
(s642 0.0)
(s643 0.0)
(s644 0.0)
(s645 0.0)
(s646 0.0)
(s647 0.0)
(s648 0.0)
(s649 0.0)
(s650 0.0)
(s651 0.0)
(s652 0.0)
(s653 0.0)
(s654 0.0)
(s655 0.0)
(s656 0.0)
(s657 0.0)
(s658 0.0)
(s659 0.0)
(s660 0.0)
(s661 0.0)
(s662 0.0)
(s663 0.0)
(s664 0.0)
(s665 0.0)
(s666 0.0)
(s667 0.0)
(s668 0.0)
(s669 0.0)
(s670 0.0)
(s671 0.0)
(s672 0.0)
(s673 1.0)
(s674 0.0)
(s675 0.0)
(s676 0.0)
(s677 0.0)
(s678 0.0)
(s679 0.0)
(s680 0.0)
(s681 0.0)
(s682 0.0)
(s683 0.0)
(s684 0.0)
(s685 0.0)
(s686 0.0)
(s687 0.0)
(s688 0.0)
(s689 0.0)
(s690 0.0)
(s691 0.0)
(s692 0.0)
(s693 0.0)
(s694 0.0)
(s695 0.0)
(s696 0.0)
(s697 0.0)
(s698 0.0)
(s699 0.0)
(s700 0.0)
(s701 0.0)
(s702 0.0)
(s703 0.0)
(s704 0.0)
(s705 0.0)
(s706 0.0)
(s707 0.0)
(s708 0.0)
(s709 0.0)
(s710 0.0)
(s711 0.0)
(s712 0.0)
(s713 0.0)
(s714 0.0)
(s715 0.0)
(s716 0.0)
(s717 0.0)
(s718 0.0)
(s719 0.0)
(s720 0.0)
(s721 0.0)
(s722 0.0)
(s723 0.0)
(s724 0.0)
(s725 0.0)
(s726 0.0)
(s727 0.0)
(s728 0.0)
(s729 0.0)
(s730 0.0)
(s731 0.0)
(s732 0.0)
(s733 0.0)
(s734 0.0)
(s735 0.0)
(s736 0.0)
(s737 0.0)
(s738 0.0)
(s739 0.0)
(s740 0.0)
(s741 0.0)
(s742 0.0)
(s743 0.0)
(s744 0.0)
(s745 0.0)
(s746 0.0)
(s747 0.0)
(s748 0.0)
(s749 0.0)
(s750 0.0)
(s751 0.0)
(s752 0.0)
(s753 0.0)
(s754 0.0)
(s755 0.0)
(s756 0.0)
(s757 0.0)
(s758 0.0)
(s759 0.0)
(s760 0.0)
(s761 0.0)
(s762 0.0)
(s763 0.0)
(s764 0.0)
(s765 0.0)
(s766 0.0)
(s767 0.0)
(s768 0.0)
(s769 0.0)
(s770 0.0)
(s771 0.0)
(s772 0.0)
(s773 0.0)
(s774 0.0)
(s775 0.0)
(s776 0.0)
(s777 0.0)
(s778 0.0)
(s779 0.0)
(s780 0.0)
(s781 0.0)
(s782 0.0)
(s783 0.0)
(s784 0.0)
(s785 0.0)
(s786 0.0)
(s787 0.0)
(s788 0.0)
(s789 0.0)
(s790 0.0)
(s791 0.0)
(s792 0.0)
(s793 0.0)
(s794 0.0)
(s795 0.0)
(s796 0.0)
(s797 0.0)
(s798 0.0)
(s799 0.0)
(s800 0.0)
(s801 0.0)
(s802 0.0)
(s803 0.0)
(s804 0.0)
(s805 0.0)
(s806 0.0)
(s807 0.0)
(s808 0.0)
(s809 0.0)
(s810 0.0)
(s811 0.0)
(s812 0.0)
(s813 0.0)
(s814 0.0)
(s815 0.0)
(s816 0.0)
(s817 0.0)
(s818 0.0)
(s819 0.0)
(s820 0.0)
(s821 0.0)
(s822 0.0)
(s823 0.0)
(s824 0.0)
(s825 0.0)
(s826 0.0)
(s827 0.0)
(s828 0.0)
(s829 0.0)
(s830 0.0)
(s831 0.0)
(s832 0.0)
(s833 0.0)
(s834 0.0)
(s835 0.0)
(s836 0.0)
(s837 0.0)
(s838 0.0)
(s839 0.0)
(s840 0.0)
(s841 0.0)
(s842 0.0)
(s843 0.0)
(s844 0.0)
(s845 0.0)
(s846 0.0)
(s847 0.0)
(s848 0.0)
(s849 0.0)
(s850 0.0)
(s851 0.0)
(s852 0.0)
(s853 0.0)
(s854 0.0)
(s855 0.0)
(s856 0.0)
(s857 0.0)
(s858 0.0)
(s859 0.0)
(s860 0.0)
(s861 0.0)
(s862 0.0)
(s863 0.0)
(s864 0.0)
(s865 0.0)
(s866 0.0)
(s867 0.0)
(s868 0.0)
(s869 0.0)
(s870 0.0)
(s871 0.0)
(s872 0.0)
(s873 0.0)
(s874 0.0)
(s875 0.0)
(s876 0.0)
(s877 0.0)
(s878 0.0)
(s879 0.0)
(s880 0.0)
(s881 0.0)
(s882 0.0)
(s883 0.0)
(s884 0.0)
(s885 0.0)
(s886 0.0)
(s887 0.0)
(s888 0.0)
(s889 0.0)
(s890 0.0)
(s891 0.0)
(s892 0.0)
(s893 0.0)
(s894 0.0)
(s895 0.0)
(s896 0.0)
(s897 0.0)
(s898 0.0)
(s899 0.0)
(s900 0.0)
(s901 0.0)
(s902 0.0)
(s903 0.0)
(s904 0.0)
(s905 0.0)
(s906 0.0)
(s907 0.0)
(s908 0.0)
(s909 0.0)
(s910 0.0)
(s911 0.0)
(s912 0.0)
(s913 0.0)
(s914 0.0)
(s915 0.0)
(s916 0.0)
(s917 0.0)
(s918 0.0)
(s919 0.0)
(s920 0.0)
(s921 0.0)
(s922 0.0)
(s923 0.0)
(s924 0.0)
(s925 0.0)
(s926 0.0)
(s927 0.0)
(s928 0.0)
(s929 0.0)
(s930 0.0)
(s931 0.0)
(s932 0.0)
(s933 0.0)
(s934 0.0)
(s935 0.0)
(s936 0.0)
(s937 0.0)
(s938 0.0)
(s939 0.0)
(s940 0.0)
(s941 0.0)
(s942 0.0)
(s943 0.0)
(s944 0.0)
(s945 0.0)
(s946 0.0)
(s947 0.0)
(s948 0.0)
(s949 0.0)
(s950 0.0)
(s951 0.0)
(s952 0.0)
(s953 0.0)
(s954 0.0)
(s955 0.0)
(s956 0.0)
(s957 0.0)
(s958 0.0)
(s959 0.0)
(s960 0.0)
(s961 0.0)
(s962 0.0)
(s963 0.0)
(s964 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1001 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 4300 unsolved
SMT process timed out in 33932ms, After SMT, problems are : Problem set: 0 solved, 4300 unsolved
Search for dead transitions found 0 dead transitions in 33976ms
Starting structural reductions in LTL mode, iteration 1 : 1001/1006 places, 4310/4360 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 46498 ms. Remains : 1001/1006 places, 4310/4360 transitions.
Stuttering acceptance computed with spot in 174 ms :[false, (NOT p0), (AND (NOT p1) (NOT p0)), (AND p0 (NOT p1)), (NOT p1)]
Running random walk in product with property : EisenbergMcGuire-PT-10-LTLFireability-15
Product exploration explored 100000 steps with 24964 reset in 1177 ms.
Product exploration explored 100000 steps with 25035 reset in 922 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (AND (NOT p0) (NOT p1))), (X (NOT p1)), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 7 factoid took 96 ms. Reduced automaton from 5 states, 9 edges and 2 AP (stutter sensitive) to 4 states, 8 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 138 ms :[(NOT p0), (AND (NOT p1) (NOT p0)), (AND p0 (NOT p1)), (NOT p1)]
RANDOM walk for 40000 steps (8 resets) in 241 ms. (165 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 84 ms. (470 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 48 ms. (816 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 62 ms. (634 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 266486 steps, run timeout after 3001 ms. (steps per millisecond=88 ) properties seen :2 out of 3
Probabilistic random walk after 266486 steps, saw 207227 distinct states, run finished after 3001 ms. (steps per millisecond=88 ) properties seen :2
[2024-06-01 10:16:08] [INFO ] Flow matrix only has 1440 transitions (discarded 2870 similar events)
[2024-06-01 10:16:08] [INFO ] Invariant cache hit.
[2024-06-01 10:16:08] [INFO ] State equation strengthened by 445 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) 105/107 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1/108 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/108 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2/110 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/110 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 315/425 variables, 110/114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/425 variables, 23/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/425 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 234/659 variables, 108/245 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/659 variables, 25/270 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/659 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 765/1424 variables, 18/288 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1424 variables, 0/288 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 18/1442 variables, 9/297 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1442 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 999/2441 variables, 783/1080 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 18 (INCLUDED_ONLY) 0/2441 variables, 397/1477 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/2441 variables, 0/1477 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/2441 variables, 0/1477 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2441/2441 variables, and 1477 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1003 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 1001/1001 constraints, ReadFeed: 445/445 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) 105/107 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1/108 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/108 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2/110 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/110 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 315/425 variables, 110/114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/425 variables, 23/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/425 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 234/659 variables, 108/245 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/659 variables, 25/270 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/659 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 765/1424 variables, 18/288 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1424 variables, 0/288 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 18/1442 variables, 9/297 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1442 variables, 1/298 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 10:16:10] [INFO ] Deduced a trap composed of 61 places in 710 ms of which 6 ms to minimize.
[2024-06-01 10:16:11] [INFO ] Deduced a trap composed of 3 places in 800 ms of which 7 ms to minimize.
[2024-06-01 10:16:12] [INFO ] Deduced a trap composed of 42 places in 677 ms of which 7 ms to minimize.
[2024-06-01 10:16:12] [INFO ] Deduced a trap composed of 42 places in 732 ms of which 8 ms to minimize.
[2024-06-01 10:16:13] [INFO ] Deduced a trap composed of 4 places in 601 ms of which 5 ms to minimize.
[2024-06-01 10:16:14] [INFO ] Deduced a trap composed of 27 places in 811 ms of which 6 ms to minimize.
[2024-06-01 10:16:14] [INFO ] Deduced a trap composed of 3 places in 552 ms of which 6 ms to minimize.
SMT process timed out in 6549ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 2 out of 1001 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1001/1001 places, 4310/4310 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 1001 transition count 4300
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 20 place count 991 transition count 4300
Performed 310 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 310 Pre rules applied. Total rules applied 20 place count 991 transition count 3990
Deduced a syphon composed of 310 places in 5 ms
Reduce places removed 310 places and 0 transitions.
Iterating global reduction 2 with 620 rules applied. Total rules applied 640 place count 681 transition count 3990
Performed 90 Post agglomeration using F-continuation condition.Transition count delta: 90
Deduced a syphon composed of 90 places in 3 ms
Reduce places removed 90 places and 0 transitions.
Iterating global reduction 2 with 180 rules applied. Total rules applied 820 place count 591 transition count 3900
Applied a total of 820 rules in 266 ms. Remains 591 /1001 variables (removed 410) and now considering 3900/4310 (removed 410) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 266 ms. Remains : 591/1001 places, 3900/4310 transitions.
RANDOM walk for 40000 steps (8 resets) in 192 ms. (207 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 36 ms. (1081 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 290686 steps, run timeout after 3001 ms. (steps per millisecond=96 ) properties seen :0 out of 1
Probabilistic random walk after 290686 steps, saw 197250 distinct states, run finished after 3001 ms. (steps per millisecond=96 ) properties seen :0
[2024-06-01 10:16:18] [INFO ] Flow matrix only has 1030 transitions (discarded 2870 similar events)
// Phase 1: matrix 1030 rows 591 cols
[2024-06-01 10:16:18] [INFO ] Computed 31 invariants in 3 ms
[2024-06-01 10:16:18] [INFO ] State equation strengthened by 445 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) 64/66 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1/67 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/67 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2/69 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/69 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 274/343 variables, 69/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/343 variables, 23/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/343 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 234/577 variables, 108/204 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/577 variables, 33/237 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/577 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 396/973 variables, 18/255 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/973 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 18/991 variables, 9/264 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/991 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 630/1621 variables, 414/678 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 18 (INCLUDED_ONLY) 0/1621 variables, 389/1067 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1621 variables, 0/1067 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/1621 variables, 0/1067 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1621/1621 variables, and 1067 constraints, problems are : Problem set: 0 solved, 1 unsolved in 684 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 591/591 constraints, ReadFeed: 445/445 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) 64/66 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1/67 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/67 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2/69 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/69 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 274/343 variables, 69/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/343 variables, 23/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/343 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 234/577 variables, 108/204 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/577 variables, 33/237 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/577 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 396/973 variables, 18/255 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/973 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 18/991 variables, 9/264 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/991 variables, 1/265 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 10:16:19] [INFO ] Deduced a trap composed of 48 places in 401 ms of which 3 ms to minimize.
[2024-06-01 10:16:20] [INFO ] Deduced a trap composed of 3 places in 342 ms of which 3 ms to minimize.
[2024-06-01 10:16:20] [INFO ] Deduced a trap composed of 23 places in 327 ms of which 4 ms to minimize.
[2024-06-01 10:16:20] [INFO ] Deduced a trap composed of 3 places in 424 ms of which 3 ms to minimize.
[2024-06-01 10:16:21] [INFO ] Deduced a trap composed of 3 places in 440 ms of which 4 ms to minimize.
[2024-06-01 10:16:21] [INFO ] Deduced a trap composed of 3 places in 364 ms of which 3 ms to minimize.
[2024-06-01 10:16:22] [INFO ] Deduced a trap composed of 91 places in 440 ms of which 3 ms to minimize.
[2024-06-01 10:16:22] [INFO ] Deduced a trap composed of 3 places in 290 ms of which 2 ms to minimize.
[2024-06-01 10:16:22] [INFO ] Deduced a trap composed of 27 places in 244 ms of which 3 ms to minimize.
[2024-06-01 10:16:22] [INFO ] Deduced a trap composed of 31 places in 89 ms of which 1 ms to minimize.
[2024-06-01 10:16:23] [INFO ] Deduced a trap composed of 3 places in 296 ms of which 3 ms to minimize.
[2024-06-01 10:16:23] [INFO ] Deduced a trap composed of 43 places in 186 ms of which 2 ms to minimize.
[2024-06-01 10:16:23] [INFO ] Deduced a trap composed of 31 places in 185 ms of which 2 ms to minimize.
[2024-06-01 10:16:23] [INFO ] Deduced a trap composed of 37 places in 140 ms of which 2 ms to minimize.
[2024-06-01 10:16:23] [INFO ] Deduced a trap composed of 21 places in 262 ms of which 2 ms to minimize.
[2024-06-01 10:16:24] [INFO ] Deduced a trap composed of 34 places in 201 ms of which 2 ms to minimize.
[2024-06-01 10:16:24] [INFO ] Deduced a trap composed of 23 places in 183 ms of which 2 ms to minimize.
[2024-06-01 10:16:24] [INFO ] Deduced a trap composed of 25 places in 233 ms of which 3 ms to minimize.
[2024-06-01 10:16:24] [INFO ] Deduced a trap composed of 23 places in 259 ms of which 2 ms to minimize.
[2024-06-01 10:16:25] [INFO ] Deduced a trap composed of 33 places in 191 ms of which 2 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/991 variables, 20/285 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 10:16:25] [INFO ] Deduced a trap composed of 19 places in 196 ms of which 5 ms to minimize.
[2024-06-01 10:16:25] [INFO ] Deduced a trap composed of 54 places in 207 ms of which 2 ms to minimize.
[2024-06-01 10:16:25] [INFO ] Deduced a trap composed of 29 places in 203 ms of which 2 ms to minimize.
[2024-06-01 10:16:26] [INFO ] Deduced a trap composed of 36 places in 189 ms of which 2 ms to minimize.
[2024-06-01 10:16:26] [INFO ] Deduced a trap composed of 39 places in 207 ms of which 2 ms to minimize.
[2024-06-01 10:16:26] [INFO ] Deduced a trap composed of 21 places in 222 ms of which 2 ms to minimize.
[2024-06-01 10:16:26] [INFO ] Deduced a trap composed of 3 places in 60 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/991 variables, 7/292 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/991 variables, 0/292 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 630/1621 variables, 414/706 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1621 variables, 389/1095 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 10:16:27] [INFO ] Deduced a trap composed of 41 places in 96 ms of which 1 ms to minimize.
[2024-06-01 10:16:27] [INFO ] Deduced a trap composed of 3 places in 66 ms of which 1 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/1621 variables, 2/1097 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1621 variables, 0/1097 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/1621 variables, 0/1097 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1621/1621 variables, and 1097 constraints, problems are : Problem set: 0 solved, 1 unsolved in 8557 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 591/591 constraints, ReadFeed: 445/445 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 29/29 constraints]
After SMT, in 9269ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 318 ms.
Support contains 2 out of 591 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 591/591 places, 3900/3900 transitions.
Applied a total of 0 rules in 162 ms. Remains 591 /591 variables (removed 0) and now considering 3900/3900 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 162 ms. Remains : 591/591 places, 3900/3900 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 591/591 places, 3900/3900 transitions.
Applied a total of 0 rules in 163 ms. Remains 591 /591 variables (removed 0) and now considering 3900/3900 (removed 0) transitions.
[2024-06-01 10:16:28] [INFO ] Flow matrix only has 1030 transitions (discarded 2870 similar events)
[2024-06-01 10:16:28] [INFO ] Invariant cache hit.
[2024-06-01 10:16:29] [INFO ] Implicit Places using invariants in 1347 ms returned []
[2024-06-01 10:16:29] [INFO ] Flow matrix only has 1030 transitions (discarded 2870 similar events)
[2024-06-01 10:16:29] [INFO ] Invariant cache hit.
[2024-06-01 10:16:29] [INFO ] State equation strengthened by 445 read => feed constraints.
[2024-06-01 10:16:35] [INFO ] Implicit Places using invariants and state equation in 5835 ms returned []
Implicit Place search using SMT with State Equation took 7185 ms to find 0 implicit places.
[2024-06-01 10:16:35] [INFO ] Redundant transitions in 184 ms returned []
Running 3890 sub problems to find dead transitions.
[2024-06-01 10:16:35] [INFO ] Flow matrix only has 1030 transitions (discarded 2870 similar events)
[2024-06-01 10:16:35] [INFO ] Invariant cache hit.
[2024-06-01 10:16:35] [INFO ] State equation strengthened by 445 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/591 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 3890 unsolved
SMT process timed out in 33325ms, After SMT, problems are : Problem set: 0 solved, 3890 unsolved
Search for dead transitions found 0 dead transitions in 33366ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40918 ms. Remains : 591/591 places, 3900/3900 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 3668 edges and 591 vertex of which 100 / 591 are part of one of the 10 SCC in 1 ms
Free SCC test removed 90 places
Drop transitions (Empty/Sink Transition effects.) removed 348 transitions
Ensure Unique test removed 2799 transitions
Reduce isomorphic transitions removed 3147 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 119 transitions
Trivial Post-agglo rules discarded 119 transitions
Performed 119 trivial Post agglomeration. Transition count delta: 119
Iterating post reduction 0 with 119 rules applied. Total rules applied 120 place count 501 transition count 634
Reduce places removed 119 places and 0 transitions.
Iterating post reduction 1 with 119 rules applied. Total rules applied 239 place count 382 transition count 634
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 20 Pre rules applied. Total rules applied 239 place count 382 transition count 614
Deduced a syphon composed of 20 places in 0 ms
Ensure Unique test removed 9 places
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 2 with 49 rules applied. Total rules applied 288 place count 353 transition count 614
Performed 180 Post agglomeration using F-continuation condition.Transition count delta: 180
Deduced a syphon composed of 180 places in 0 ms
Reduce places removed 180 places and 0 transitions.
Iterating global reduction 2 with 360 rules applied. Total rules applied 648 place count 173 transition count 434
Ensure Unique test removed 90 transitions
Reduce isomorphic transitions removed 90 transitions.
Iterating post reduction 2 with 90 rules applied. Total rules applied 738 place count 173 transition count 344
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 756 place count 164 transition count 344
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 765 place count 164 transition count 335
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 4 with 10 rules applied. Total rules applied 775 place count 164 transition count 325
Free-agglomeration rule applied 91 times.
Iterating global reduction 4 with 91 rules applied. Total rules applied 866 place count 164 transition count 234
Reduce places removed 91 places and 0 transitions.
Iterating post reduction 4 with 91 rules applied. Total rules applied 957 place count 73 transition count 234
Partial Free-agglomeration rule applied 10 times.
Drop transitions (Partial Free agglomeration) removed 10 transitions
Iterating global reduction 5 with 10 rules applied. Total rules applied 967 place count 73 transition count 234
Applied a total of 967 rules in 39 ms. Remains 73 /591 variables (removed 518) and now considering 234/3900 (removed 3666) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 234 rows 73 cols
[2024-06-01 10:17:08] [INFO ] Computed 22 invariants in 1 ms
[2024-06-01 10:17:08] [INFO ] [Real]Absence check using 21 positive place invariants in 7 ms returned sat
[2024-06-01 10:17:08] [INFO ] [Real]Absence check using 21 positive and 1 generalized place invariants in 1 ms returned sat
[2024-06-01 10:17:09] [INFO ] After 118ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-01 10:17:09] [INFO ] [Nat]Absence check using 21 positive place invariants in 6 ms returned sat
[2024-06-01 10:17:09] [INFO ] [Nat]Absence check using 21 positive and 1 generalized place invariants in 0 ms returned sat
[2024-06-01 10:17:09] [INFO ] After 76ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-06-01 10:17:09] [INFO ] State equation strengthened by 9 read => feed constraints.
[2024-06-01 10:17:09] [INFO ] After 13ms SMT Verify possible using 9 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-01 10:17:09] [INFO ] Deduced a trap composed of 2 places in 15 ms of which 1 ms to minimize.
[2024-06-01 10:17:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 30 ms
TRAPS : Iteration 1
[2024-06-01 10:17:09] [INFO ] After 69ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-01 10:17:09] [INFO ] After 197ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 366 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (AND (NOT p0) (NOT p1))), (X (NOT p1)), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) (NOT p0)))), (F p1)]
Knowledge based reduction with 7 factoid took 147 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter insensitive) to 4 states, 8 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 140 ms :[(NOT p0), (AND (NOT p1) (NOT p0)), (AND p0 (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 146 ms :[(NOT p0), (AND (NOT p1) (NOT p0)), (AND p0 (NOT p1)), (NOT p1)]
[2024-06-01 10:17:09] [INFO ] Flow matrix only has 1440 transitions (discarded 2870 similar events)
// Phase 1: matrix 1440 rows 1001 cols
[2024-06-01 10:17:09] [INFO ] Computed 31 invariants in 8 ms
[2024-06-01 10:17:13] [INFO ] [Real]Absence check using 21 positive place invariants in 44 ms returned sat
[2024-06-01 10:17:13] [INFO ] [Real]Absence check using 21 positive and 10 generalized place invariants in 128 ms returned sat
[2024-06-01 10:17:16] [INFO ] [Real]Absence check using state equation in 2274 ms returned sat
[2024-06-01 10:17:16] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 10:17:20] [INFO ] [Nat]Absence check using 21 positive place invariants in 43 ms returned sat
[2024-06-01 10:17:20] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 105 ms returned sat
[2024-06-01 10:17:22] [INFO ] [Nat]Absence check using state equation in 1997 ms returned sat
[2024-06-01 10:17:22] [INFO ] State equation strengthened by 445 read => feed constraints.
[2024-06-01 10:17:22] [INFO ] [Nat]Added 445 Read/Feed constraints in 272 ms returned sat
[2024-06-01 10:17:23] [INFO ] Deduced a trap composed of 3 places in 1081 ms of which 9 ms to minimize.
[2024-06-01 10:17:25] [INFO ] Deduced a trap composed of 68 places in 1184 ms of which 8 ms to minimize.
[2024-06-01 10:17:26] [INFO ] Deduced a trap composed of 3 places in 885 ms of which 9 ms to minimize.
[2024-06-01 10:17:26] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 3 trap constraints in 3476 ms
Proved EG (NOT p0)
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (AND (NOT p0) (NOT p1))), (X (NOT p1)), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) (NOT p0)))), (F p1), (G (NOT p0))]
Property proved to be false thanks to negative knowledge :(G (NOT p0))
Knowledge based reduction with 7 factoid took 170 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA EisenbergMcGuire-PT-10-LTLFireability-15 FALSE TECHNIQUES KNOWLEDGE
Treatment of property EisenbergMcGuire-PT-10-LTLFireability-15 finished in 130225 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(G(p0))&&F(p1))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)&&(F(p2)||p1))))'
[2024-06-01 10:17:27] [INFO ] Flatten gal took : 234 ms
[2024-06-01 10:17:27] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLFireability.sr.xml took 3 ms.
[2024-06-01 10:17:27] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1006 places, 4360 transitions and 22040 arcs took 40 ms.
Total runtime 1309283 ms.
There are residual formulas that ITS could not solve within timeout
FORMULA EisenbergMcGuire-PT-10-LTLFireability-00 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
Could not compute solution for formula : EisenbergMcGuire-PT-10-LTLFireability-03
BK_STOP 1717237410001
--------------------
content from stderr:
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
mcc2024
ltl formula name EisenbergMcGuire-PT-10-LTLFireability-00
ltl formula formula --ltl=/tmp/2692/ltl_0_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 1006 places, 4360 transitions and 22040 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.510 real 0.180 user 0.180 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2692/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2692/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2692/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2692/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4): There are 1007 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 1007, there are 4491 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Accepting cycle FOUND at depth ~9!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 32
pnml2lts-mc( 0/ 4): unique transitions count: 400
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 1
pnml2lts-mc( 0/ 4): - claim success count: 37
pnml2lts-mc( 0/ 4): - cum. max stack depth: 37
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 37 states 514 transitions, fanout: 13.892
pnml2lts-mc( 0/ 4): Total exploration time 0.020 sec (0.010 sec minimum, 0.015 sec on average)
pnml2lts-mc( 0/ 4): States per second: 1850, Transitions per second: 25700
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 60.0 B/state, compr.: 1.5%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 4479 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.0MB (~256.0MB paged-in)
ltl formula name EisenbergMcGuire-PT-10-LTLFireability-03
ltl formula formula --ltl=/tmp/2692/ltl_1_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 1006 places, 4360 transitions and 22040 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.550 real 0.160 user 0.170 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2692/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2692/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2692/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2692/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 5 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 1008 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 1007, there are 4566 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 1/ 4): ~2500 levels ~10000 states ~273204 transitions
pnml2lts-mc( 1/ 4): ~5000 levels ~20000 states ~573204 transitions
pnml2lts-mc( 1/ 4): ~10000 levels ~40000 states ~1173204 transitions
pnml2lts-mc( 1/ 4): ~20000 levels ~80000 states ~2373204 transitions
pnml2lts-mc( 1/ 4): ~40000 levels ~160000 states ~4773204 transitions
pnml2lts-mc( 1/ 4): ~80000 levels ~320000 states ~9573204 transitions
pnml2lts-mc( 0/ 4): ~160000 levels ~640000 states ~17990284 transitions
pnml2lts-mc( 0/ 4): ~319988 levels ~1280000 states ~36054404 transitions
pnml2lts-mc( 1/ 4): Error: tree leafs table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 2242706
pnml2lts-mc( 0/ 4): unique transitions count: 64881190
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 20906209
pnml2lts-mc( 0/ 4): - claim success count: 2242714
pnml2lts-mc( 0/ 4): - cum. max stack depth: 2242595
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 2242714 states 64881408 transitions, fanout: 28.930
pnml2lts-mc( 0/ 4): Total exploration time 359.440 sec (359.130 sec minimum, 359.225 sec on average)
pnml2lts-mc( 0/ 4): States per second: 6239, Transitions per second: 180507
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 124.0MB, 16.5 B/state, compr.: 0.4%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 23.0%/99.0%
pnml2lts-mc( 0/ 4): Stored 4479 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 124.0MB (~256.0MB paged-in)
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="EisenbergMcGuire-PT-10"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is EisenbergMcGuire-PT-10, 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 r492-smll-171636266400204"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/EisenbergMcGuire-PT-10.tgz
mv EisenbergMcGuire-PT-10 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 ;