About the Execution of LoLa+red for DoubleExponent-PT-010
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 1050.239 | 434944.00 | 579274.00 | 1991.70 | F?FTFFFTTFFF?FFT | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2023-input.r135-smll-167819414500476.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool lolaxred
Input is DoubleExponent-PT-010, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r135-smll-167819414500476
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 604K
-rw-r--r-- 1 mcc users 7.2K Feb 26 13:29 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K Feb 26 13:29 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K Feb 26 13:28 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K Feb 26 13:28 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:01 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Feb 25 16:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:01 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 16:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.2K Feb 26 13:30 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 95K Feb 26 13:30 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.3K Feb 26 13:29 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 83K Feb 26 13:29 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:01 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:01 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 169K Mar 5 18:22 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 DoubleExponent-PT-010-LTLFireability-00
FORMULA_NAME DoubleExponent-PT-010-LTLFireability-01
FORMULA_NAME DoubleExponent-PT-010-LTLFireability-02
FORMULA_NAME DoubleExponent-PT-010-LTLFireability-03
FORMULA_NAME DoubleExponent-PT-010-LTLFireability-04
FORMULA_NAME DoubleExponent-PT-010-LTLFireability-05
FORMULA_NAME DoubleExponent-PT-010-LTLFireability-06
FORMULA_NAME DoubleExponent-PT-010-LTLFireability-07
FORMULA_NAME DoubleExponent-PT-010-LTLFireability-08
FORMULA_NAME DoubleExponent-PT-010-LTLFireability-09
FORMULA_NAME DoubleExponent-PT-010-LTLFireability-10
FORMULA_NAME DoubleExponent-PT-010-LTLFireability-11
FORMULA_NAME DoubleExponent-PT-010-LTLFireability-12
FORMULA_NAME DoubleExponent-PT-010-LTLFireability-13
FORMULA_NAME DoubleExponent-PT-010-LTLFireability-14
FORMULA_NAME DoubleExponent-PT-010-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1678343768982
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=lolaxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DoubleExponent-PT-010
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-09 06:36:11] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-09 06:36:11] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-09 06:36:11] [INFO ] Load time of PNML (sax parser for PT used): 107 ms
[2023-03-09 06:36:11] [INFO ] Transformed 534 places.
[2023-03-09 06:36:11] [INFO ] Transformed 498 transitions.
[2023-03-09 06:36:11] [INFO ] Parsed PT model containing 534 places and 498 transitions and 1404 arcs in 221 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA DoubleExponent-PT-010-LTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-010-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-010-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-010-LTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 33 out of 534 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 534/534 places, 498/498 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 530 transition count 498
Applied a total of 4 rules in 82 ms. Remains 530 /534 variables (removed 4) and now considering 498/498 (removed 0) transitions.
// Phase 1: matrix 498 rows 530 cols
[2023-03-09 06:36:12] [INFO ] Computed 51 place invariants in 85 ms
[2023-03-09 06:36:12] [INFO ] Implicit Places using invariants in 715 ms returned [437, 439]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 765 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 528/534 places, 498/498 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 527 transition count 497
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 527 transition count 497
Applied a total of 2 rules in 68 ms. Remains 527 /528 variables (removed 1) and now considering 497/498 (removed 1) transitions.
// Phase 1: matrix 497 rows 527 cols
[2023-03-09 06:36:13] [INFO ] Computed 49 place invariants in 43 ms
[2023-03-09 06:36:13] [INFO ] Implicit Places using invariants in 370 ms returned []
[2023-03-09 06:36:13] [INFO ] Invariant cache hit.
[2023-03-09 06:36:16] [INFO ] Implicit Places using invariants and state equation in 2649 ms returned []
Implicit Place search using SMT with State Equation took 3030 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 527/534 places, 497/498 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 3946 ms. Remains : 527/534 places, 497/498 transitions.
Support contains 33 out of 527 places after structural reductions.
[2023-03-09 06:36:16] [INFO ] Flatten gal took : 99 ms
[2023-03-09 06:36:16] [INFO ] Flatten gal took : 44 ms
[2023-03-09 06:36:16] [INFO ] Input system was already deterministic with 497 transitions.
Incomplete random walk after 10000 steps, including 337 resets, run finished after 682 ms. (steps per millisecond=14 ) properties (out of 22) seen :2
Incomplete Best-First random walk after 1000 steps, including 29 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 28 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 27 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 27 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 28 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 31 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 30 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 31 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 27 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 26 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 26 resets, run finished after 27 ms. (steps per millisecond=37 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 29 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 28 resets, run finished after 13 ms. (steps per millisecond=76 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 27 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 28 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 26 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 27 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 27 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 29 resets, run finished after 36 ms. (steps per millisecond=27 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 29 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 20) seen :0
Interrupted probabilistic random walk after 120531 steps, run timeout after 3001 ms. (steps per millisecond=40 ) properties seen :{6=1, 11=1, 14=1, 17=1}
Probabilistic random walk after 120531 steps, saw 60277 distinct states, run finished after 3003 ms. (steps per millisecond=40 ) properties seen :4
Running SMT prover for 16 properties.
[2023-03-09 06:36:20] [INFO ] Invariant cache hit.
[2023-03-09 06:36:21] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-09 06:36:21] [INFO ] [Real]Absence check using 2 positive and 47 generalized place invariants in 35 ms returned sat
[2023-03-09 06:36:21] [INFO ] After 821ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:14
[2023-03-09 06:36:22] [INFO ] After 1008ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:16
[2023-03-09 06:36:22] [INFO ] After 1526ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:16
[2023-03-09 06:36:22] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-09 06:36:22] [INFO ] [Nat]Absence check using 2 positive and 47 generalized place invariants in 21 ms returned sat
[2023-03-09 06:36:23] [INFO ] After 1097ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :16
[2023-03-09 06:36:24] [INFO ] Deduced a trap composed of 53 places in 146 ms of which 6 ms to minimize.
[2023-03-09 06:36:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 223 ms
[2023-03-09 06:36:24] [INFO ] Deduced a trap composed of 55 places in 211 ms of which 1 ms to minimize.
[2023-03-09 06:36:25] [INFO ] Deduced a trap composed of 59 places in 168 ms of which 1 ms to minimize.
[2023-03-09 06:36:25] [INFO ] Deduced a trap composed of 79 places in 137 ms of which 2 ms to minimize.
[2023-03-09 06:36:25] [INFO ] Deduced a trap composed of 77 places in 140 ms of which 1 ms to minimize.
[2023-03-09 06:36:25] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 817 ms
[2023-03-09 06:36:25] [INFO ] Deduced a trap composed of 61 places in 151 ms of which 1 ms to minimize.
[2023-03-09 06:36:25] [INFO ] Deduced a trap composed of 65 places in 160 ms of which 1 ms to minimize.
[2023-03-09 06:36:26] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 396 ms
[2023-03-09 06:36:26] [INFO ] Deduced a trap composed of 89 places in 113 ms of which 1 ms to minimize.
[2023-03-09 06:36:26] [INFO ] Deduced a trap composed of 91 places in 122 ms of which 0 ms to minimize.
[2023-03-09 06:36:26] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 324 ms
[2023-03-09 06:36:26] [INFO ] After 4114ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :16
Attempting to minimize the solution found.
Minimization took 978 ms.
[2023-03-09 06:36:27] [INFO ] After 5651ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :16
Parikh walk visited 0 properties in 9202 ms.
Support contains 25 out of 527 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 527/527 places, 497/497 transitions.
Graph (complete) has 895 edges and 527 vertex of which 525 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.5 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 92 transitions
Trivial Post-agglo rules discarded 92 transitions
Performed 92 trivial Post agglomeration. Transition count delta: 92
Iterating post reduction 0 with 93 rules applied. Total rules applied 94 place count 525 transition count 403
Reduce places removed 92 places and 0 transitions.
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Iterating post reduction 1 with 103 rules applied. Total rules applied 197 place count 433 transition count 392
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 208 place count 422 transition count 392
Performed 26 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 26 Pre rules applied. Total rules applied 208 place count 422 transition count 366
Deduced a syphon composed of 26 places in 3 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 3 with 52 rules applied. Total rules applied 260 place count 396 transition count 366
Performed 74 Post agglomeration using F-continuation condition.Transition count delta: 74
Deduced a syphon composed of 74 places in 2 ms
Reduce places removed 74 places and 0 transitions.
Iterating global reduction 3 with 148 rules applied. Total rules applied 408 place count 322 transition count 292
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 16 places in 3 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 32 rules applied. Total rules applied 440 place count 306 transition count 292
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 442 place count 306 transition count 290
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 444 place count 304 transition count 290
Free-agglomeration rule (complex) applied 49 times.
Iterating global reduction 4 with 49 rules applied. Total rules applied 493 place count 304 transition count 241
Reduce places removed 49 places and 0 transitions.
Iterating post reduction 4 with 49 rules applied. Total rules applied 542 place count 255 transition count 241
Partial Free-agglomeration rule applied 37 times.
Drop transitions removed 37 transitions
Iterating global reduction 5 with 37 rules applied. Total rules applied 579 place count 255 transition count 241
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 580 place count 254 transition count 240
Applied a total of 580 rules in 188 ms. Remains 254 /527 variables (removed 273) and now considering 240/497 (removed 257) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 189 ms. Remains : 254/527 places, 240/497 transitions.
Incomplete random walk after 10000 steps, including 1289 resets, run finished after 417 ms. (steps per millisecond=23 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 72 resets, run finished after 38 ms. (steps per millisecond=26 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 86 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 90 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 84 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 86 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 88 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 76 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 84 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 93 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 83 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 84 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 91 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 86 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 84 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 81 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 81 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 16) seen :0
Interrupted probabilistic random walk after 149713 steps, run timeout after 3001 ms. (steps per millisecond=49 ) properties seen :{0=1, 11=1}
Probabilistic random walk after 149713 steps, saw 75383 distinct states, run finished after 3001 ms. (steps per millisecond=49 ) properties seen :2
Running SMT prover for 14 properties.
// Phase 1: matrix 240 rows 254 cols
[2023-03-09 06:36:41] [INFO ] Computed 49 place invariants in 26 ms
[2023-03-09 06:36:41] [INFO ] [Real]Absence check using 6 positive place invariants in 10 ms returned sat
[2023-03-09 06:36:41] [INFO ] [Real]Absence check using 6 positive and 43 generalized place invariants in 31 ms returned sat
[2023-03-09 06:36:41] [INFO ] After 311ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:13
[2023-03-09 06:36:41] [INFO ] State equation strengthened by 25 read => feed constraints.
[2023-03-09 06:36:41] [INFO ] After 230ms SMT Verify possible using 25 Read/Feed constraints in real domain returned unsat :0 sat :1 real:13
[2023-03-09 06:36:41] [INFO ] After 254ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1 real:13
Attempting to minimize the solution found.
Minimization took 15 ms.
[2023-03-09 06:36:41] [INFO ] After 810ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:14
[2023-03-09 06:36:42] [INFO ] [Nat]Absence check using 6 positive place invariants in 8 ms returned sat
[2023-03-09 06:36:42] [INFO ] [Nat]Absence check using 6 positive and 43 generalized place invariants in 28 ms returned sat
[2023-03-09 06:36:42] [INFO ] After 459ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :14
[2023-03-09 06:36:43] [INFO ] After 453ms SMT Verify possible using 25 Read/Feed constraints in natural domain returned unsat :0 sat :14
[2023-03-09 06:36:43] [INFO ] Deduced a trap composed of 14 places in 91 ms of which 1 ms to minimize.
[2023-03-09 06:36:43] [INFO ] Deduced a trap composed of 24 places in 99 ms of which 1 ms to minimize.
[2023-03-09 06:36:43] [INFO ] Deduced a trap composed of 35 places in 93 ms of which 1 ms to minimize.
[2023-03-09 06:36:43] [INFO ] Deduced a trap composed of 53 places in 92 ms of which 0 ms to minimize.
[2023-03-09 06:36:43] [INFO ] Deduced a trap composed of 35 places in 92 ms of which 1 ms to minimize.
[2023-03-09 06:36:43] [INFO ] Deduced a trap composed of 32 places in 91 ms of which 0 ms to minimize.
[2023-03-09 06:36:43] [INFO ] Deduced a trap composed of 34 places in 86 ms of which 0 ms to minimize.
[2023-03-09 06:36:43] [INFO ] Deduced a trap composed of 35 places in 105 ms of which 1 ms to minimize.
[2023-03-09 06:36:44] [INFO ] Deduced a trap composed of 39 places in 96 ms of which 0 ms to minimize.
[2023-03-09 06:36:44] [INFO ] Deduced a trap composed of 36 places in 92 ms of which 1 ms to minimize.
[2023-03-09 06:36:44] [INFO ] Deduced a trap composed of 40 places in 96 ms of which 1 ms to minimize.
[2023-03-09 06:36:44] [INFO ] Deduced a trap composed of 55 places in 90 ms of which 1 ms to minimize.
[2023-03-09 06:36:44] [INFO ] Deduced a trap composed of 37 places in 92 ms of which 1 ms to minimize.
[2023-03-09 06:36:44] [INFO ] Deduced a trap composed of 39 places in 97 ms of which 1 ms to minimize.
[2023-03-09 06:36:44] [INFO ] Deduced a trap composed of 55 places in 95 ms of which 0 ms to minimize.
[2023-03-09 06:36:44] [INFO ] Deduced a trap composed of 13 places in 90 ms of which 1 ms to minimize.
[2023-03-09 06:36:44] [INFO ] Deduced a trap composed of 16 places in 84 ms of which 1 ms to minimize.
[2023-03-09 06:36:45] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 1941 ms
[2023-03-09 06:36:45] [INFO ] Deduced a trap composed of 19 places in 79 ms of which 0 ms to minimize.
[2023-03-09 06:36:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 109 ms
[2023-03-09 06:36:45] [INFO ] Deduced a trap composed of 52 places in 58 ms of which 1 ms to minimize.
[2023-03-09 06:36:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 99 ms
[2023-03-09 06:36:45] [INFO ] Deduced a trap composed of 23 places in 78 ms of which 1 ms to minimize.
[2023-03-09 06:36:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 113 ms
[2023-03-09 06:36:45] [INFO ] Deduced a trap composed of 30 places in 68 ms of which 1 ms to minimize.
[2023-03-09 06:36:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 101 ms
[2023-03-09 06:36:46] [INFO ] After 3609ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :14
Attempting to minimize the solution found.
Minimization took 677 ms.
[2023-03-09 06:36:46] [INFO ] After 4983ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :14
Parikh walk visited 0 properties in 9247 ms.
Support contains 23 out of 254 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 254/254 places, 240/240 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 252 transition count 238
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 5 place count 252 transition count 238
Applied a total of 5 rules in 35 ms. Remains 252 /254 variables (removed 2) and now considering 238/240 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35 ms. Remains : 252/254 places, 238/240 transitions.
Incomplete random walk after 10000 steps, including 1285 resets, run finished after 325 ms. (steps per millisecond=30 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 856 resets, run finished after 270 ms. (steps per millisecond=37 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 860 resets, run finished after 184 ms. (steps per millisecond=54 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 847 resets, run finished after 189 ms. (steps per millisecond=52 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 849 resets, run finished after 193 ms. (steps per millisecond=51 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 839 resets, run finished after 193 ms. (steps per millisecond=51 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 856 resets, run finished after 229 ms. (steps per millisecond=43 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 835 resets, run finished after 250 ms. (steps per millisecond=40 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 847 resets, run finished after 256 ms. (steps per millisecond=39 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 853 resets, run finished after 228 ms. (steps per millisecond=43 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 862 resets, run finished after 219 ms. (steps per millisecond=45 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 842 resets, run finished after 220 ms. (steps per millisecond=45 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 838 resets, run finished after 226 ms. (steps per millisecond=44 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 858 resets, run finished after 232 ms. (steps per millisecond=43 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 857 resets, run finished after 214 ms. (steps per millisecond=46 ) properties (out of 14) seen :0
Interrupted probabilistic random walk after 475013 steps, run timeout after 9001 ms. (steps per millisecond=52 ) properties seen :{1=1, 2=1, 11=1}
Probabilistic random walk after 475013 steps, saw 238253 distinct states, run finished after 9002 ms. (steps per millisecond=52 ) properties seen :3
Running SMT prover for 11 properties.
// Phase 1: matrix 238 rows 252 cols
[2023-03-09 06:37:08] [INFO ] Computed 49 place invariants in 24 ms
[2023-03-09 06:37:08] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-09 06:37:08] [INFO ] [Real]Absence check using 2 positive and 47 generalized place invariants in 32 ms returned sat
[2023-03-09 06:37:08] [INFO ] After 363ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2023-03-09 06:37:09] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 06:37:09] [INFO ] [Nat]Absence check using 2 positive and 47 generalized place invariants in 28 ms returned sat
[2023-03-09 06:37:09] [INFO ] After 445ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :11
[2023-03-09 06:37:09] [INFO ] State equation strengthened by 26 read => feed constraints.
[2023-03-09 06:37:10] [INFO ] After 401ms SMT Verify possible using 26 Read/Feed constraints in natural domain returned unsat :0 sat :11
[2023-03-09 06:37:10] [INFO ] Deduced a trap composed of 13 places in 92 ms of which 1 ms to minimize.
[2023-03-09 06:37:10] [INFO ] Deduced a trap composed of 11 places in 103 ms of which 4 ms to minimize.
[2023-03-09 06:37:10] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 242 ms
[2023-03-09 06:37:10] [INFO ] After 1072ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :11
Attempting to minimize the solution found.
Minimization took 269 ms.
[2023-03-09 06:37:10] [INFO ] After 1987ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :11
Parikh walk visited 0 properties in 13146 ms.
Support contains 19 out of 252 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 252/252 places, 238/238 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 252 transition count 237
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 251 transition count 237
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 6 place count 249 transition count 235
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 7 place count 249 transition count 235
Applied a total of 7 rules in 35 ms. Remains 249 /252 variables (removed 3) and now considering 235/238 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35 ms. Remains : 249/252 places, 235/238 transitions.
Incomplete random walk after 10000 steps, including 1303 resets, run finished after 252 ms. (steps per millisecond=39 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 836 resets, run finished after 195 ms. (steps per millisecond=51 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 829 resets, run finished after 174 ms. (steps per millisecond=57 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 851 resets, run finished after 164 ms. (steps per millisecond=60 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 849 resets, run finished after 196 ms. (steps per millisecond=51 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 842 resets, run finished after 166 ms. (steps per millisecond=60 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 878 resets, run finished after 166 ms. (steps per millisecond=60 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 835 resets, run finished after 156 ms. (steps per millisecond=64 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 875 resets, run finished after 167 ms. (steps per millisecond=59 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 835 resets, run finished after 165 ms. (steps per millisecond=60 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 837 resets, run finished after 188 ms. (steps per millisecond=53 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 833 resets, run finished after 204 ms. (steps per millisecond=49 ) properties (out of 11) seen :0
Interrupted probabilistic random walk after 349057 steps, run timeout after 6001 ms. (steps per millisecond=58 ) properties seen :{}
Probabilistic random walk after 349057 steps, saw 175270 distinct states, run finished after 6004 ms. (steps per millisecond=58 ) properties seen :0
Running SMT prover for 11 properties.
// Phase 1: matrix 235 rows 249 cols
[2023-03-09 06:37:32] [INFO ] Computed 49 place invariants in 16 ms
[2023-03-09 06:37:32] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 06:37:32] [INFO ] [Real]Absence check using 2 positive and 47 generalized place invariants in 28 ms returned sat
[2023-03-09 06:37:32] [INFO ] After 250ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:10
[2023-03-09 06:37:32] [INFO ] State equation strengthened by 28 read => feed constraints.
[2023-03-09 06:37:33] [INFO ] After 275ms SMT Verify possible using 28 Read/Feed constraints in real domain returned unsat :0 sat :0 real:11
[2023-03-09 06:37:33] [INFO ] After 700ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2023-03-09 06:37:33] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-09 06:37:33] [INFO ] [Nat]Absence check using 2 positive and 47 generalized place invariants in 26 ms returned sat
[2023-03-09 06:37:33] [INFO ] After 388ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :11
[2023-03-09 06:37:34] [INFO ] After 477ms SMT Verify possible using 28 Read/Feed constraints in natural domain returned unsat :0 sat :11
[2023-03-09 06:37:34] [INFO ] Deduced a trap composed of 13 places in 87 ms of which 1 ms to minimize.
[2023-03-09 06:37:34] [INFO ] Deduced a trap composed of 14 places in 84 ms of which 0 ms to minimize.
[2023-03-09 06:37:34] [INFO ] Deduced a trap composed of 17 places in 91 ms of which 1 ms to minimize.
[2023-03-09 06:37:34] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 320 ms
[2023-03-09 06:37:34] [INFO ] Deduced a trap composed of 85 places in 123 ms of which 1 ms to minimize.
[2023-03-09 06:37:35] [INFO ] Deduced a trap composed of 81 places in 129 ms of which 0 ms to minimize.
[2023-03-09 06:37:35] [INFO ] Deduced a trap composed of 78 places in 122 ms of which 0 ms to minimize.
[2023-03-09 06:37:35] [INFO ] Deduced a trap composed of 76 places in 129 ms of which 1 ms to minimize.
[2023-03-09 06:37:35] [INFO ] Deduced a trap composed of 64 places in 134 ms of which 0 ms to minimize.
[2023-03-09 06:37:35] [INFO ] Deduced a trap composed of 84 places in 133 ms of which 0 ms to minimize.
[2023-03-09 06:37:35] [INFO ] Deduced a trap composed of 77 places in 131 ms of which 1 ms to minimize.
[2023-03-09 06:37:35] [INFO ] Deduced a trap composed of 30 places in 129 ms of which 0 ms to minimize.
[2023-03-09 06:37:36] [INFO ] Deduced a trap composed of 4 places in 124 ms of which 1 ms to minimize.
[2023-03-09 06:37:36] [INFO ] Deduced a trap composed of 70 places in 120 ms of which 1 ms to minimize.
[2023-03-09 06:37:36] [INFO ] Deduced a trap composed of 12 places in 132 ms of which 0 ms to minimize.
[2023-03-09 06:37:36] [INFO ] Deduced a trap composed of 73 places in 124 ms of which 1 ms to minimize.
[2023-03-09 06:37:36] [INFO ] Deduced a trap composed of 76 places in 129 ms of which 0 ms to minimize.
[2023-03-09 06:37:36] [INFO ] Deduced a trap composed of 22 places in 130 ms of which 0 ms to minimize.
[2023-03-09 06:37:36] [INFO ] Deduced a trap composed of 74 places in 129 ms of which 1 ms to minimize.
[2023-03-09 06:37:37] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 2267 ms
[2023-03-09 06:37:37] [INFO ] Deduced a trap composed of 71 places in 120 ms of which 1 ms to minimize.
[2023-03-09 06:37:37] [INFO ] Deduced a trap composed of 78 places in 135 ms of which 3 ms to minimize.
[2023-03-09 06:37:37] [INFO ] Deduced a trap composed of 81 places in 137 ms of which 1 ms to minimize.
[2023-03-09 06:37:37] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 456 ms
[2023-03-09 06:37:37] [INFO ] After 3983ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :11
Attempting to minimize the solution found.
Minimization took 457 ms.
[2023-03-09 06:37:38] [INFO ] After 5027ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :11
Parikh walk visited 0 properties in 11265 ms.
Support contains 19 out of 249 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 249/249 places, 235/235 transitions.
Applied a total of 0 rules in 13 ms. Remains 249 /249 variables (removed 0) and now considering 235/235 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 249/249 places, 235/235 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 249/249 places, 235/235 transitions.
Applied a total of 0 rules in 11 ms. Remains 249 /249 variables (removed 0) and now considering 235/235 (removed 0) transitions.
[2023-03-09 06:37:49] [INFO ] Invariant cache hit.
[2023-03-09 06:37:49] [INFO ] Implicit Places using invariants in 598 ms returned [21, 27, 49, 57, 80, 86, 107, 114, 136, 142, 143, 165, 171, 193, 199, 206, 240, 246]
Discarding 18 places :
Implicit Place search using SMT only with invariants took 600 ms to find 18 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 231/249 places, 235/235 transitions.
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 231 transition count 229
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 12 place count 225 transition count 229
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 225 transition count 229
Applied a total of 13 rules in 27 ms. Remains 225 /231 variables (removed 6) and now considering 229/235 (removed 6) transitions.
// Phase 1: matrix 229 rows 225 cols
[2023-03-09 06:37:50] [INFO ] Computed 31 place invariants in 17 ms
[2023-03-09 06:37:50] [INFO ] Implicit Places using invariants in 252 ms returned []
[2023-03-09 06:37:50] [INFO ] Invariant cache hit.
[2023-03-09 06:37:50] [INFO ] State equation strengthened by 28 read => feed constraints.
[2023-03-09 06:37:51] [INFO ] Implicit Places using invariants and state equation in 1325 ms returned []
Implicit Place search using SMT with State Equation took 1583 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 225/249 places, 229/235 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 2222 ms. Remains : 225/249 places, 229/235 transitions.
Incomplete random walk after 10000 steps, including 1444 resets, run finished after 260 ms. (steps per millisecond=38 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 893 resets, run finished after 195 ms. (steps per millisecond=51 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 927 resets, run finished after 194 ms. (steps per millisecond=51 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 869 resets, run finished after 200 ms. (steps per millisecond=50 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 928 resets, run finished after 199 ms. (steps per millisecond=50 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 952 resets, run finished after 197 ms. (steps per millisecond=50 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 928 resets, run finished after 195 ms. (steps per millisecond=51 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 930 resets, run finished after 193 ms. (steps per millisecond=51 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 931 resets, run finished after 185 ms. (steps per millisecond=54 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 934 resets, run finished after 152 ms. (steps per millisecond=65 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 920 resets, run finished after 151 ms. (steps per millisecond=66 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 895 resets, run finished after 150 ms. (steps per millisecond=66 ) properties (out of 11) seen :0
Interrupted probabilistic random walk after 361572 steps, run timeout after 6001 ms. (steps per millisecond=60 ) properties seen :{}
Probabilistic random walk after 361572 steps, saw 180931 distinct states, run finished after 6001 ms. (steps per millisecond=60 ) properties seen :0
Running SMT prover for 11 properties.
[2023-03-09 06:37:59] [INFO ] Invariant cache hit.
[2023-03-09 06:37:59] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 06:37:59] [INFO ] [Real]Absence check using 2 positive and 29 generalized place invariants in 25 ms returned sat
[2023-03-09 06:38:00] [INFO ] After 315ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2023-03-09 06:38:00] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-09 06:38:00] [INFO ] [Nat]Absence check using 2 positive and 29 generalized place invariants in 23 ms returned sat
[2023-03-09 06:38:00] [INFO ] After 391ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :11
[2023-03-09 06:38:00] [INFO ] State equation strengthened by 28 read => feed constraints.
[2023-03-09 06:38:01] [INFO ] After 515ms SMT Verify possible using 28 Read/Feed constraints in natural domain returned unsat :0 sat :11
[2023-03-09 06:38:01] [INFO ] Deduced a trap composed of 14 places in 104 ms of which 1 ms to minimize.
[2023-03-09 06:38:01] [INFO ] Deduced a trap composed of 14 places in 111 ms of which 0 ms to minimize.
[2023-03-09 06:38:01] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 260 ms
[2023-03-09 06:38:01] [INFO ] Deduced a trap composed of 16 places in 65 ms of which 1 ms to minimize.
[2023-03-09 06:38:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 105 ms
[2023-03-09 06:38:01] [INFO ] Deduced a trap composed of 69 places in 102 ms of which 0 ms to minimize.
[2023-03-09 06:38:02] [INFO ] Deduced a trap composed of 23 places in 109 ms of which 0 ms to minimize.
[2023-03-09 06:38:02] [INFO ] Deduced a trap composed of 75 places in 108 ms of which 1 ms to minimize.
[2023-03-09 06:38:02] [INFO ] Deduced a trap composed of 74 places in 111 ms of which 0 ms to minimize.
[2023-03-09 06:38:02] [INFO ] Deduced a trap composed of 83 places in 107 ms of which 2 ms to minimize.
[2023-03-09 06:38:02] [INFO ] Deduced a trap composed of 19 places in 112 ms of which 2 ms to minimize.
[2023-03-09 06:38:02] [INFO ] Deduced a trap composed of 83 places in 114 ms of which 5 ms to minimize.
[2023-03-09 06:38:02] [INFO ] Deduced a trap composed of 80 places in 106 ms of which 1 ms to minimize.
[2023-03-09 06:38:02] [INFO ] Deduced a trap composed of 78 places in 111 ms of which 0 ms to minimize.
[2023-03-09 06:38:03] [INFO ] Deduced a trap composed of 81 places in 107 ms of which 0 ms to minimize.
[2023-03-09 06:38:03] [INFO ] Deduced a trap composed of 84 places in 101 ms of which 0 ms to minimize.
[2023-03-09 06:38:03] [INFO ] Deduced a trap composed of 79 places in 106 ms of which 1 ms to minimize.
[2023-03-09 06:38:03] [INFO ] Deduced a trap composed of 78 places in 98 ms of which 0 ms to minimize.
[2023-03-09 06:38:03] [INFO ] Deduced a trap composed of 79 places in 108 ms of which 1 ms to minimize.
[2023-03-09 06:38:03] [INFO ] Deduced a trap composed of 81 places in 107 ms of which 1 ms to minimize.
[2023-03-09 06:38:03] [INFO ] Deduced a trap composed of 80 places in 109 ms of which 0 ms to minimize.
[2023-03-09 06:38:03] [INFO ] Deduced a trap composed of 83 places in 109 ms of which 1 ms to minimize.
[2023-03-09 06:38:04] [INFO ] Deduced a trap composed of 85 places in 106 ms of which 1 ms to minimize.
[2023-03-09 06:38:04] [INFO ] Deduced a trap composed of 74 places in 106 ms of which 1 ms to minimize.
[2023-03-09 06:38:04] [INFO ] Deduced a trap composed of 78 places in 106 ms of which 0 ms to minimize.
[2023-03-09 06:38:04] [INFO ] Deduced a trap composed of 76 places in 104 ms of which 0 ms to minimize.
[2023-03-09 06:38:04] [INFO ] Deduced a trap composed of 76 places in 104 ms of which 1 ms to minimize.
[2023-03-09 06:38:04] [INFO ] Deduced a trap composed of 76 places in 107 ms of which 0 ms to minimize.
[2023-03-09 06:38:04] [INFO ] Deduced a trap composed of 83 places in 103 ms of which 1 ms to minimize.
[2023-03-09 06:38:04] [INFO ] Deduced a trap composed of 84 places in 105 ms of which 1 ms to minimize.
[2023-03-09 06:38:05] [INFO ] Deduced a trap composed of 80 places in 105 ms of which 1 ms to minimize.
[2023-03-09 06:38:05] [INFO ] Deduced a trap composed of 75 places in 104 ms of which 0 ms to minimize.
[2023-03-09 06:38:05] [INFO ] Deduced a trap composed of 80 places in 107 ms of which 1 ms to minimize.
[2023-03-09 06:38:05] [INFO ] Deduced a trap composed of 75 places in 102 ms of which 1 ms to minimize.
[2023-03-09 06:38:05] [INFO ] Deduced a trap composed of 80 places in 103 ms of which 0 ms to minimize.
[2023-03-09 06:38:05] [INFO ] Deduced a trap composed of 81 places in 101 ms of which 1 ms to minimize.
[2023-03-09 06:38:05] [INFO ] Deduced a trap composed of 75 places in 104 ms of which 0 ms to minimize.
[2023-03-09 06:38:05] [INFO ] Deduced a trap composed of 79 places in 103 ms of which 1 ms to minimize.
[2023-03-09 06:38:06] [INFO ] Deduced a trap composed of 85 places in 100 ms of which 0 ms to minimize.
[2023-03-09 06:38:06] [INFO ] Deduced a trap composed of 82 places in 102 ms of which 0 ms to minimize.
[2023-03-09 06:38:06] [INFO ] Deduced a trap composed of 83 places in 95 ms of which 0 ms to minimize.
[2023-03-09 06:38:06] [INFO ] Deduced a trap composed of 76 places in 104 ms of which 0 ms to minimize.
[2023-03-09 06:38:06] [INFO ] Deduced a trap composed of 76 places in 104 ms of which 1 ms to minimize.
[2023-03-09 06:38:06] [INFO ] Deduced a trap composed of 76 places in 102 ms of which 1 ms to minimize.
[2023-03-09 06:38:06] [INFO ] Deduced a trap composed of 73 places in 101 ms of which 0 ms to minimize.
[2023-03-09 06:38:06] [INFO ] Deduced a trap composed of 81 places in 102 ms of which 0 ms to minimize.
[2023-03-09 06:38:07] [INFO ] Deduced a trap composed of 27 places in 98 ms of which 0 ms to minimize.
[2023-03-09 06:38:07] [INFO ] Deduced a trap composed of 49 places in 100 ms of which 1 ms to minimize.
[2023-03-09 06:38:07] [INFO ] Deduced a trap composed of 67 places in 100 ms of which 1 ms to minimize.
[2023-03-09 06:38:07] [INFO ] Deduced a trap composed of 79 places in 98 ms of which 0 ms to minimize.
[2023-03-09 06:38:07] [INFO ] Deduced a trap composed of 71 places in 102 ms of which 0 ms to minimize.
[2023-03-09 06:38:07] [INFO ] Deduced a trap composed of 78 places in 101 ms of which 0 ms to minimize.
[2023-03-09 06:38:07] [INFO ] Deduced a trap composed of 72 places in 103 ms of which 1 ms to minimize.
[2023-03-09 06:38:07] [INFO ] Deduced a trap composed of 23 places in 100 ms of which 0 ms to minimize.
[2023-03-09 06:38:08] [INFO ] Trap strengthening (SAT) tested/added 50/49 trap constraints in 6267 ms
[2023-03-09 06:38:08] [INFO ] Deduced a trap composed of 76 places in 99 ms of which 0 ms to minimize.
[2023-03-09 06:38:08] [INFO ] Deduced a trap composed of 74 places in 106 ms of which 1 ms to minimize.
[2023-03-09 06:38:08] [INFO ] Deduced a trap composed of 77 places in 113 ms of which 1 ms to minimize.
[2023-03-09 06:38:08] [INFO ] Deduced a trap composed of 79 places in 104 ms of which 0 ms to minimize.
[2023-03-09 06:38:08] [INFO ] Deduced a trap composed of 72 places in 97 ms of which 0 ms to minimize.
[2023-03-09 06:38:08] [INFO ] Deduced a trap composed of 72 places in 104 ms of which 1 ms to minimize.
[2023-03-09 06:38:09] [INFO ] Deduced a trap composed of 71 places in 104 ms of which 0 ms to minimize.
[2023-03-09 06:38:09] [INFO ] Deduced a trap composed of 68 places in 104 ms of which 0 ms to minimize.
[2023-03-09 06:38:09] [INFO ] Deduced a trap composed of 69 places in 102 ms of which 0 ms to minimize.
[2023-03-09 06:38:09] [INFO ] Deduced a trap composed of 72 places in 109 ms of which 0 ms to minimize.
[2023-03-09 06:38:09] [INFO ] Deduced a trap composed of 71 places in 109 ms of which 1 ms to minimize.
[2023-03-09 06:38:09] [INFO ] Deduced a trap composed of 71 places in 114 ms of which 0 ms to minimize.
[2023-03-09 06:38:09] [INFO ] Deduced a trap composed of 69 places in 111 ms of which 1 ms to minimize.
[2023-03-09 06:38:09] [INFO ] Deduced a trap composed of 30 places in 116 ms of which 1 ms to minimize.
[2023-03-09 06:38:10] [INFO ] Deduced a trap composed of 76 places in 110 ms of which 1 ms to minimize.
[2023-03-09 06:38:10] [INFO ] Deduced a trap composed of 77 places in 111 ms of which 1 ms to minimize.
[2023-03-09 06:38:10] [INFO ] Deduced a trap composed of 67 places in 112 ms of which 0 ms to minimize.
[2023-03-09 06:38:10] [INFO ] Deduced a trap composed of 73 places in 107 ms of which 1 ms to minimize.
[2023-03-09 06:38:10] [INFO ] Deduced a trap composed of 32 places in 109 ms of which 0 ms to minimize.
[2023-03-09 06:38:10] [INFO ] Deduced a trap composed of 70 places in 109 ms of which 1 ms to minimize.
[2023-03-09 06:38:10] [INFO ] Deduced a trap composed of 77 places in 111 ms of which 1 ms to minimize.
[2023-03-09 06:38:10] [INFO ] Deduced a trap composed of 24 places in 109 ms of which 1 ms to minimize.
[2023-03-09 06:38:11] [INFO ] Deduced a trap composed of 74 places in 101 ms of which 1 ms to minimize.
[2023-03-09 06:38:11] [INFO ] Deduced a trap composed of 75 places in 115 ms of which 0 ms to minimize.
[2023-03-09 06:38:11] [INFO ] Deduced a trap composed of 63 places in 123 ms of which 0 ms to minimize.
[2023-03-09 06:38:11] [INFO ] Deduced a trap composed of 71 places in 116 ms of which 0 ms to minimize.
[2023-03-09 06:38:11] [INFO ] Deduced a trap composed of 32 places in 110 ms of which 0 ms to minimize.
[2023-03-09 06:38:11] [INFO ] Deduced a trap composed of 32 places in 110 ms of which 1 ms to minimize.
[2023-03-09 06:38:11] [INFO ] Deduced a trap composed of 65 places in 111 ms of which 0 ms to minimize.
[2023-03-09 06:38:12] [INFO ] Deduced a trap composed of 69 places in 116 ms of which 0 ms to minimize.
[2023-03-09 06:38:12] [INFO ] Deduced a trap composed of 68 places in 109 ms of which 1 ms to minimize.
[2023-03-09 06:38:12] [INFO ] Deduced a trap composed of 64 places in 113 ms of which 1 ms to minimize.
[2023-03-09 06:38:12] [INFO ] Deduced a trap composed of 68 places in 110 ms of which 1 ms to minimize.
[2023-03-09 06:38:12] [INFO ] Deduced a trap composed of 70 places in 109 ms of which 1 ms to minimize.
[2023-03-09 06:38:12] [INFO ] Deduced a trap composed of 71 places in 113 ms of which 0 ms to minimize.
[2023-03-09 06:38:12] [INFO ] Deduced a trap composed of 74 places in 102 ms of which 0 ms to minimize.
[2023-03-09 06:38:12] [INFO ] Deduced a trap composed of 67 places in 114 ms of which 0 ms to minimize.
[2023-03-09 06:38:13] [INFO ] Deduced a trap composed of 78 places in 140 ms of which 1 ms to minimize.
[2023-03-09 06:38:13] [INFO ] Deduced a trap composed of 68 places in 169 ms of which 1 ms to minimize.
[2023-03-09 06:38:13] [INFO ] Deduced a trap composed of 32 places in 160 ms of which 1 ms to minimize.
[2023-03-09 06:38:13] [INFO ] Deduced a trap composed of 65 places in 112 ms of which 0 ms to minimize.
[2023-03-09 06:38:13] [INFO ] Deduced a trap composed of 78 places in 112 ms of which 1 ms to minimize.
[2023-03-09 06:38:13] [INFO ] Deduced a trap composed of 69 places in 108 ms of which 1 ms to minimize.
[2023-03-09 06:38:14] [INFO ] Deduced a trap composed of 73 places in 117 ms of which 1 ms to minimize.
[2023-03-09 06:38:14] [INFO ] Deduced a trap composed of 72 places in 108 ms of which 1 ms to minimize.
[2023-03-09 06:38:14] [INFO ] Deduced a trap composed of 74 places in 115 ms of which 0 ms to minimize.
[2023-03-09 06:38:14] [INFO ] Deduced a trap composed of 34 places in 108 ms of which 1 ms to minimize.
[2023-03-09 06:38:14] [INFO ] Deduced a trap composed of 72 places in 110 ms of which 1 ms to minimize.
[2023-03-09 06:38:14] [INFO ] Deduced a trap composed of 77 places in 110 ms of which 1 ms to minimize.
[2023-03-09 06:38:14] [INFO ] Deduced a trap composed of 36 places in 107 ms of which 0 ms to minimize.
[2023-03-09 06:38:14] [INFO ] Deduced a trap composed of 77 places in 109 ms of which 1 ms to minimize.
[2023-03-09 06:38:15] [INFO ] Deduced a trap composed of 34 places in 116 ms of which 1 ms to minimize.
[2023-03-09 06:38:15] [INFO ] Deduced a trap composed of 78 places in 107 ms of which 0 ms to minimize.
[2023-03-09 06:38:15] [INFO ] Deduced a trap composed of 74 places in 111 ms of which 1 ms to minimize.
[2023-03-09 06:38:15] [INFO ] Deduced a trap composed of 70 places in 112 ms of which 0 ms to minimize.
[2023-03-09 06:38:15] [INFO ] Deduced a trap composed of 67 places in 108 ms of which 1 ms to minimize.
[2023-03-09 06:38:15] [INFO ] Deduced a trap composed of 75 places in 108 ms of which 1 ms to minimize.
[2023-03-09 06:38:15] [INFO ] Deduced a trap composed of 54 places in 109 ms of which 1 ms to minimize.
[2023-03-09 06:38:15] [INFO ] Deduced a trap composed of 56 places in 109 ms of which 0 ms to minimize.
[2023-03-09 06:38:16] [INFO ] Deduced a trap composed of 67 places in 112 ms of which 0 ms to minimize.
[2023-03-09 06:38:16] [INFO ] Deduced a trap composed of 84 places in 109 ms of which 0 ms to minimize.
[2023-03-09 06:38:16] [INFO ] Deduced a trap composed of 54 places in 112 ms of which 0 ms to minimize.
[2023-03-09 06:38:16] [INFO ] Deduced a trap composed of 58 places in 115 ms of which 0 ms to minimize.
[2023-03-09 06:38:16] [INFO ] Deduced a trap composed of 73 places in 101 ms of which 0 ms to minimize.
[2023-03-09 06:38:16] [INFO ] Deduced a trap composed of 70 places in 112 ms of which 0 ms to minimize.
[2023-03-09 06:38:16] [INFO ] Deduced a trap composed of 76 places in 111 ms of which 1 ms to minimize.
[2023-03-09 06:38:17] [INFO ] Deduced a trap composed of 24 places in 111 ms of which 1 ms to minimize.
[2023-03-09 06:38:17] [INFO ] Trap strengthening (SAT) tested/added 68/67 trap constraints in 9221 ms
[2023-03-09 06:38:17] [INFO ] After 17113ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :11
Attempting to minimize the solution found.
Minimization took 1374 ms.
[2023-03-09 06:38:19] [INFO ] After 19058ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :11
Parikh walk visited 0 properties in 7816 ms.
Support contains 19 out of 225 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 225/225 places, 229/229 transitions.
Applied a total of 0 rules in 9 ms. Remains 225 /225 variables (removed 0) and now considering 229/229 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 225/225 places, 229/229 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 225/225 places, 229/229 transitions.
Applied a total of 0 rules in 7 ms. Remains 225 /225 variables (removed 0) and now considering 229/229 (removed 0) transitions.
[2023-03-09 06:38:27] [INFO ] Invariant cache hit.
[2023-03-09 06:38:27] [INFO ] Implicit Places using invariants in 250 ms returned []
[2023-03-09 06:38:27] [INFO ] Invariant cache hit.
[2023-03-09 06:38:27] [INFO ] State equation strengthened by 28 read => feed constraints.
[2023-03-09 06:38:29] [INFO ] Implicit Places using invariants and state equation in 1928 ms returned []
Implicit Place search using SMT with State Equation took 2179 ms to find 0 implicit places.
[2023-03-09 06:38:29] [INFO ] Redundant transitions in 15 ms returned []
[2023-03-09 06:38:29] [INFO ] Invariant cache hit.
[2023-03-09 06:38:29] [INFO ] Dead Transitions using invariants and state equation in 252 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2460 ms. Remains : 225/225 places, 229/229 transitions.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 895 edges and 527 vertex of which 525 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.7 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 527 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 527/527 places, 497/497 transitions.
Graph (complete) has 895 edges and 527 vertex of which 526 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 122 transitions
Trivial Post-agglo rules discarded 122 transitions
Performed 122 trivial Post agglomeration. Transition count delta: 122
Iterating post reduction 0 with 122 rules applied. Total rules applied 123 place count 525 transition count 373
Reduce places removed 122 places and 0 transitions.
Iterating post reduction 1 with 122 rules applied. Total rules applied 245 place count 403 transition count 373
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 20 Pre rules applied. Total rules applied 245 place count 403 transition count 353
Deduced a syphon composed of 20 places in 3 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 285 place count 383 transition count 353
Performed 92 Post agglomeration using F-continuation condition.Transition count delta: 92
Deduced a syphon composed of 92 places in 1 ms
Reduce places removed 92 places and 0 transitions.
Iterating global reduction 2 with 184 rules applied. Total rules applied 469 place count 291 transition count 261
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 505 place count 273 transition count 261
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 506 place count 272 transition count 260
Applied a total of 506 rules in 54 ms. Remains 272 /527 variables (removed 255) and now considering 260/497 (removed 237) transitions.
// Phase 1: matrix 260 rows 272 cols
[2023-03-09 06:38:29] [INFO ] Computed 49 place invariants in 11 ms
[2023-03-09 06:38:30] [INFO ] Implicit Places using invariants in 231 ms returned []
[2023-03-09 06:38:30] [INFO ] Invariant cache hit.
[2023-03-09 06:38:30] [INFO ] State equation strengthened by 18 read => feed constraints.
[2023-03-09 06:38:31] [INFO ] Implicit Places using invariants and state equation in 1634 ms returned []
Implicit Place search using SMT with State Equation took 1873 ms to find 0 implicit places.
[2023-03-09 06:38:31] [INFO ] Redundant transitions in 16 ms returned []
[2023-03-09 06:38:31] [INFO ] Invariant cache hit.
[2023-03-09 06:38:31] [INFO ] Dead Transitions using invariants and state equation in 204 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 272/527 places, 260/497 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2158 ms. Remains : 272/527 places, 260/497 transitions.
Stuttering acceptance computed with spot in 392 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DoubleExponent-PT-010-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GEQ s29 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 8 steps with 0 reset in 2 ms.
FORMULA DoubleExponent-PT-010-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-010-LTLFireability-00 finished in 2631 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 527 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 527/527 places, 497/497 transitions.
Graph (complete) has 895 edges and 527 vertex of which 526 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 122 transitions
Trivial Post-agglo rules discarded 122 transitions
Performed 122 trivial Post agglomeration. Transition count delta: 122
Iterating post reduction 0 with 122 rules applied. Total rules applied 123 place count 525 transition count 373
Reduce places removed 122 places and 0 transitions.
Iterating post reduction 1 with 122 rules applied. Total rules applied 245 place count 403 transition count 373
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 19 Pre rules applied. Total rules applied 245 place count 403 transition count 354
Deduced a syphon composed of 19 places in 2 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 38 rules applied. Total rules applied 283 place count 384 transition count 354
Performed 93 Post agglomeration using F-continuation condition.Transition count delta: 93
Deduced a syphon composed of 93 places in 1 ms
Reduce places removed 93 places and 0 transitions.
Iterating global reduction 2 with 186 rules applied. Total rules applied 469 place count 291 transition count 261
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 503 place count 274 transition count 261
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 504 place count 273 transition count 260
Applied a total of 504 rules in 54 ms. Remains 273 /527 variables (removed 254) and now considering 260/497 (removed 237) transitions.
// Phase 1: matrix 260 rows 273 cols
[2023-03-09 06:38:32] [INFO ] Computed 49 place invariants in 14 ms
[2023-03-09 06:38:32] [INFO ] Implicit Places using invariants in 244 ms returned []
[2023-03-09 06:38:32] [INFO ] Invariant cache hit.
[2023-03-09 06:38:32] [INFO ] State equation strengthened by 18 read => feed constraints.
[2023-03-09 06:38:34] [INFO ] Implicit Places using invariants and state equation in 1920 ms returned []
Implicit Place search using SMT with State Equation took 2168 ms to find 0 implicit places.
[2023-03-09 06:38:34] [INFO ] Redundant transitions in 5 ms returned []
[2023-03-09 06:38:34] [INFO ] Invariant cache hit.
[2023-03-09 06:38:34] [INFO ] Dead Transitions using invariants and state equation in 337 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 273/527 places, 260/497 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2577 ms. Remains : 273/527 places, 260/497 transitions.
Stuttering acceptance computed with spot in 53 ms :[(NOT p0)]
Running random walk in product with property : DoubleExponent-PT-010-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LT s100 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 9736 reset in 547 ms.
Product exploration explored 100000 steps with 9685 reset in 285 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 852 edges and 273 vertex of which 272 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
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 172 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
Finished random walk after 3 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=3 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 171 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 53 ms :[(NOT p0)]
Support contains 1 out of 273 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 273/273 places, 260/260 transitions.
Applied a total of 0 rules in 8 ms. Remains 273 /273 variables (removed 0) and now considering 260/260 (removed 0) transitions.
[2023-03-09 06:38:36] [INFO ] Invariant cache hit.
[2023-03-09 06:38:36] [INFO ] Implicit Places using invariants in 263 ms returned []
[2023-03-09 06:38:36] [INFO ] Invariant cache hit.
[2023-03-09 06:38:36] [INFO ] State equation strengthened by 18 read => feed constraints.
[2023-03-09 06:38:38] [INFO ] Implicit Places using invariants and state equation in 2084 ms returned []
Implicit Place search using SMT with State Equation took 2357 ms to find 0 implicit places.
[2023-03-09 06:38:38] [INFO ] Redundant transitions in 6 ms returned []
[2023-03-09 06:38:38] [INFO ] Invariant cache hit.
[2023-03-09 06:38:39] [INFO ] Dead Transitions using invariants and state equation in 298 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2705 ms. Remains : 273/273 places, 260/260 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 852 edges and 273 vertex of which 272 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
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 116 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Finished random walk after 3 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=3 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 133 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Product exploration explored 100000 steps with 9673 reset in 157 ms.
Product exploration explored 100000 steps with 9686 reset in 173 ms.
Support contains 1 out of 273 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 273/273 places, 260/260 transitions.
Applied a total of 0 rules in 7 ms. Remains 273 /273 variables (removed 0) and now considering 260/260 (removed 0) transitions.
[2023-03-09 06:38:39] [INFO ] Invariant cache hit.
[2023-03-09 06:38:40] [INFO ] Implicit Places using invariants in 264 ms returned []
[2023-03-09 06:38:40] [INFO ] Invariant cache hit.
[2023-03-09 06:38:40] [INFO ] State equation strengthened by 18 read => feed constraints.
[2023-03-09 06:38:41] [INFO ] Implicit Places using invariants and state equation in 1530 ms returned []
Implicit Place search using SMT with State Equation took 1796 ms to find 0 implicit places.
[2023-03-09 06:38:41] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-09 06:38:41] [INFO ] Invariant cache hit.
[2023-03-09 06:38:41] [INFO ] Dead Transitions using invariants and state equation in 210 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2024 ms. Remains : 273/273 places, 260/260 transitions.
Treatment of property DoubleExponent-PT-010-LTLFireability-01 finished in 9613 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(!p0) U (p1 U p2)))'
Support contains 5 out of 527 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 527/527 places, 497/497 transitions.
Graph (complete) has 895 edges and 527 vertex of which 526 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 114 transitions
Trivial Post-agglo rules discarded 114 transitions
Performed 114 trivial Post agglomeration. Transition count delta: 114
Iterating post reduction 0 with 114 rules applied. Total rules applied 115 place count 525 transition count 381
Reduce places removed 114 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 117 rules applied. Total rules applied 232 place count 411 transition count 378
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 235 place count 408 transition count 378
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 22 Pre rules applied. Total rules applied 235 place count 408 transition count 356
Deduced a syphon composed of 22 places in 3 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 3 with 44 rules applied. Total rules applied 279 place count 386 transition count 356
Performed 91 Post agglomeration using F-continuation condition.Transition count delta: 91
Deduced a syphon composed of 91 places in 1 ms
Reduce places removed 91 places and 0 transitions.
Iterating global reduction 3 with 182 rules applied. Total rules applied 461 place count 295 transition count 265
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 495 place count 278 transition count 265
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 496 place count 277 transition count 264
Applied a total of 496 rules in 51 ms. Remains 277 /527 variables (removed 250) and now considering 264/497 (removed 233) transitions.
// Phase 1: matrix 264 rows 277 cols
[2023-03-09 06:38:41] [INFO ] Computed 49 place invariants in 10 ms
[2023-03-09 06:38:42] [INFO ] Implicit Places using invariants in 340 ms returned []
[2023-03-09 06:38:42] [INFO ] Invariant cache hit.
[2023-03-09 06:38:42] [INFO ] State equation strengthened by 16 read => feed constraints.
[2023-03-09 06:38:44] [INFO ] Implicit Places using invariants and state equation in 2293 ms returned []
Implicit Place search using SMT with State Equation took 2636 ms to find 0 implicit places.
[2023-03-09 06:38:44] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-09 06:38:44] [INFO ] Invariant cache hit.
[2023-03-09 06:38:44] [INFO ] Dead Transitions using invariants and state equation in 351 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 277/527 places, 264/497 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3049 ms. Remains : 277/527 places, 264/497 transitions.
Stuttering acceptance computed with spot in 203 ms :[(NOT p2), true, p0, (NOT p2)]
Running random walk in product with property : DoubleExponent-PT-010-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={0} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 2}, { cond=(AND (NOT p2) p1 p0), acceptance={0} source=0 dest: 3}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=p0, acceptance={} source=2 dest: 1}, { cond=(NOT p0), acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p2:(AND (GEQ s41 1) (GEQ s48 1)), p0:(AND (GEQ s40 1) (GEQ s59 1)), p1:(GEQ s47 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 55 steps with 8 reset in 2 ms.
FORMULA DoubleExponent-PT-010-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-010-LTLFireability-02 finished in 3275 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||X(G(p1)))))'
Support contains 4 out of 527 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 527/527 places, 497/497 transitions.
Applied a total of 0 rules in 17 ms. Remains 527 /527 variables (removed 0) and now considering 497/497 (removed 0) transitions.
// Phase 1: matrix 497 rows 527 cols
[2023-03-09 06:38:45] [INFO ] Computed 49 place invariants in 31 ms
[2023-03-09 06:38:45] [INFO ] Implicit Places using invariants in 389 ms returned []
[2023-03-09 06:38:45] [INFO ] Invariant cache hit.
[2023-03-09 06:38:50] [INFO ] Implicit Places using invariants and state equation in 4696 ms returned []
Implicit Place search using SMT with State Equation took 5087 ms to find 0 implicit places.
[2023-03-09 06:38:50] [INFO ] Invariant cache hit.
[2023-03-09 06:38:50] [INFO ] Dead Transitions using invariants and state equation in 604 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5712 ms. Remains : 527/527 places, 497/497 transitions.
Stuttering acceptance computed with spot in 286 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DoubleExponent-PT-010-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 1}, { cond=(AND p0 p1), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=p0, acceptance={} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=(NOT p0), acceptance={} source=5 dest: 1}, { cond=p0, acceptance={} source=5 dest: 2}]], initial=4, aps=[p1:(AND (GEQ s72 1) (GEQ s107 1)), p0:(AND (GEQ s426 1) (GEQ s445 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA DoubleExponent-PT-010-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-010-LTLFireability-06 finished in 6031 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0&&X(F(p0))))))'
Support contains 1 out of 527 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 527/527 places, 497/497 transitions.
Applied a total of 0 rules in 20 ms. Remains 527 /527 variables (removed 0) and now considering 497/497 (removed 0) transitions.
[2023-03-09 06:38:51] [INFO ] Invariant cache hit.
[2023-03-09 06:38:51] [INFO ] Implicit Places using invariants in 465 ms returned []
[2023-03-09 06:38:51] [INFO ] Invariant cache hit.
[2023-03-09 06:38:54] [INFO ] Implicit Places using invariants and state equation in 2857 ms returned []
Implicit Place search using SMT with State Equation took 3323 ms to find 0 implicit places.
[2023-03-09 06:38:54] [INFO ] Invariant cache hit.
[2023-03-09 06:38:54] [INFO ] Dead Transitions using invariants and state equation in 329 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3676 ms. Remains : 527/527 places, 497/497 transitions.
Stuttering acceptance computed with spot in 112 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DoubleExponent-PT-010-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={0} source=2 dest: 0}, { cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(LT s345 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 489 ms.
Product exploration explored 100000 steps with 33333 reset in 432 ms.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 895 edges and 527 vertex of which 525 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.5 ms
Computed a total of 7 stabilizing places and 7 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p0))
Knowledge based reduction with 3 factoid took 87 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DoubleExponent-PT-010-LTLFireability-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DoubleExponent-PT-010-LTLFireability-07 finished in 4835 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 527 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 527/527 places, 497/497 transitions.
Applied a total of 0 rules in 22 ms. Remains 527 /527 variables (removed 0) and now considering 497/497 (removed 0) transitions.
[2023-03-09 06:38:56] [INFO ] Invariant cache hit.
[2023-03-09 06:38:56] [INFO ] Implicit Places using invariants in 479 ms returned []
[2023-03-09 06:38:56] [INFO ] Invariant cache hit.
[2023-03-09 06:38:59] [INFO ] Implicit Places using invariants and state equation in 2978 ms returned []
Implicit Place search using SMT with State Equation took 3459 ms to find 0 implicit places.
[2023-03-09 06:38:59] [INFO ] Invariant cache hit.
[2023-03-09 06:38:59] [INFO ] Dead Transitions using invariants and state equation in 382 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3866 ms. Remains : 527/527 places, 497/497 transitions.
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DoubleExponent-PT-010-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s480 1) (GEQ s520 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 28 steps with 0 reset in 0 ms.
FORMULA DoubleExponent-PT-010-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-010-LTLFireability-09 finished in 3965 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(F((!p0 U (p1||G(!p0))))) U G(p2))))'
Support contains 5 out of 527 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 527/527 places, 497/497 transitions.
Applied a total of 0 rules in 19 ms. Remains 527 /527 variables (removed 0) and now considering 497/497 (removed 0) transitions.
[2023-03-09 06:39:00] [INFO ] Invariant cache hit.
[2023-03-09 06:39:00] [INFO ] Implicit Places using invariants in 467 ms returned []
[2023-03-09 06:39:00] [INFO ] Invariant cache hit.
[2023-03-09 06:39:04] [INFO ] Implicit Places using invariants and state equation in 3811 ms returned []
Implicit Place search using SMT with State Equation took 4281 ms to find 0 implicit places.
[2023-03-09 06:39:04] [INFO ] Invariant cache hit.
[2023-03-09 06:39:04] [INFO ] Dead Transitions using invariants and state equation in 625 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4928 ms. Remains : 527/527 places, 497/497 transitions.
Stuttering acceptance computed with spot in 224 ms :[(NOT p2), (NOT p2), (AND (NOT p1) p0), (AND (NOT p1) p0 p2)]
Running random walk in product with property : DoubleExponent-PT-010-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p2, acceptance={} source=1 dest: 1}, { cond=(NOT p2), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=1 dest: 2}, { cond=(NOT p2), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 2}], [{ cond=(AND p2 (NOT p1) p0), acceptance={} source=3 dest: 2}, { cond=p2, acceptance={} source=3 dest: 3}]], initial=0, aps=[p2:(GEQ s108 1), p1:(AND (NOT (AND (GEQ s368 1) (GEQ s388 1))) (NOT (AND (GEQ s186 1) (GEQ s292 1)))), p0:(AND (GEQ s186 1) (GEQ s292 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 25040 reset in 583 ms.
Product exploration explored 100000 steps with 25037 reset in 460 ms.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 895 edges and 527 vertex of which 525 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.3 ms
Computed a total of 7 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND (NOT p2) p1 (NOT p0)), (X (NOT p2)), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p2 (NOT p1) p0)))), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 8 factoid took 430 ms. Reduced automaton from 4 states, 9 edges and 3 AP (stutter sensitive) to 4 states, 10 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 241 ms :[(OR (NOT p2) (AND p0 (NOT p1))), (NOT p2), (AND p0 (NOT p1)), (AND p0 (NOT p1) p2)]
Incomplete random walk after 10000 steps, including 335 resets, run finished after 352 ms. (steps per millisecond=28 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 285 resets, run finished after 213 ms. (steps per millisecond=46 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 285 resets, run finished after 121 ms. (steps per millisecond=82 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 285 resets, run finished after 166 ms. (steps per millisecond=60 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 280 resets, run finished after 118 ms. (steps per millisecond=84 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 278 resets, run finished after 119 ms. (steps per millisecond=84 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 179481 steps, run timeout after 3001 ms. (steps per millisecond=59 ) properties seen :{}
Probabilistic random walk after 179481 steps, saw 89762 distinct states, run finished after 3001 ms. (steps per millisecond=59 ) properties seen :0
Running SMT prover for 5 properties.
[2023-03-09 06:39:11] [INFO ] Invariant cache hit.
[2023-03-09 06:39:11] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-09 06:39:11] [INFO ] [Real]Absence check using 2 positive and 47 generalized place invariants in 31 ms returned sat
[2023-03-09 06:39:11] [INFO ] After 548ms SMT Verify possible using state equation in real domain returned unsat :1 sat :1 real:3
[2023-03-09 06:39:11] [INFO ] After 663ms SMT Verify possible using trap constraints in real domain returned unsat :1 sat :1 real:3
Attempting to minimize the solution found.
Minimization took 39 ms.
[2023-03-09 06:39:12] [INFO ] After 965ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :1 real:3
[2023-03-09 06:39:12] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-09 06:39:12] [INFO ] [Nat]Absence check using 2 positive and 47 generalized place invariants in 30 ms returned sat
[2023-03-09 06:39:13] [INFO ] After 1087ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :4
[2023-03-09 06:39:13] [INFO ] Deduced a trap composed of 101 places in 227 ms of which 1 ms to minimize.
[2023-03-09 06:39:13] [INFO ] Deduced a trap composed of 89 places in 229 ms of which 1 ms to minimize.
[2023-03-09 06:39:14] [INFO ] Deduced a trap composed of 77 places in 225 ms of which 1 ms to minimize.
[2023-03-09 06:39:14] [INFO ] Deduced a trap composed of 79 places in 230 ms of which 1 ms to minimize.
[2023-03-09 06:39:14] [INFO ] Deduced a trap composed of 61 places in 245 ms of which 1 ms to minimize.
[2023-03-09 06:39:15] [INFO ] Deduced a trap composed of 65 places in 227 ms of which 1 ms to minimize.
[2023-03-09 06:39:15] [INFO ] Deduced a trap composed of 90 places in 259 ms of which 1 ms to minimize.
[2023-03-09 06:39:15] [INFO ] Deduced a trap composed of 58 places in 252 ms of which 1 ms to minimize.
[2023-03-09 06:39:15] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 2285 ms
[2023-03-09 06:39:16] [INFO ] Deduced a trap composed of 59 places in 206 ms of which 1 ms to minimize.
[2023-03-09 06:39:16] [INFO ] Deduced a trap composed of 60 places in 251 ms of which 1 ms to minimize.
[2023-03-09 06:39:16] [INFO ] Deduced a trap composed of 103 places in 177 ms of which 1 ms to minimize.
[2023-03-09 06:39:16] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 871 ms
[2023-03-09 06:39:17] [INFO ] Deduced a trap composed of 83 places in 207 ms of which 1 ms to minimize.
[2023-03-09 06:39:17] [INFO ] Deduced a trap composed of 67 places in 245 ms of which 1 ms to minimize.
[2023-03-09 06:39:17] [INFO ] Deduced a trap composed of 53 places in 254 ms of which 1 ms to minimize.
[2023-03-09 06:39:18] [INFO ] Deduced a trap composed of 55 places in 236 ms of which 1 ms to minimize.
[2023-03-09 06:39:18] [INFO ] Deduced a trap composed of 41 places in 281 ms of which 1 ms to minimize.
[2023-03-09 06:39:18] [INFO ] Deduced a trap composed of 94 places in 209 ms of which 1 ms to minimize.
[2023-03-09 06:39:18] [INFO ] Deduced a trap composed of 91 places in 194 ms of which 1 ms to minimize.
[2023-03-09 06:39:19] [INFO ] Deduced a trap composed of 127 places in 127 ms of which 1 ms to minimize.
[2023-03-09 06:39:19] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 2270 ms
[2023-03-09 06:39:19] [INFO ] After 7182ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :4
Attempting to minimize the solution found.
Minimization took 852 ms.
[2023-03-09 06:39:20] [INFO ] After 8321ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :4
Fused 5 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 1706 ms.
Support contains 5 out of 527 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 527/527 places, 497/497 transitions.
Graph (complete) has 895 edges and 527 vertex of which 525 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 114 transitions
Trivial Post-agglo rules discarded 114 transitions
Performed 114 trivial Post agglomeration. Transition count delta: 114
Iterating post reduction 0 with 115 rules applied. Total rules applied 116 place count 525 transition count 381
Reduce places removed 114 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 117 rules applied. Total rules applied 233 place count 411 transition count 378
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 236 place count 408 transition count 378
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 22 Pre rules applied. Total rules applied 236 place count 408 transition count 356
Deduced a syphon composed of 22 places in 2 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 3 with 44 rules applied. Total rules applied 280 place count 386 transition count 356
Performed 89 Post agglomeration using F-continuation condition.Transition count delta: 89
Deduced a syphon composed of 89 places in 1 ms
Reduce places removed 89 places and 0 transitions.
Iterating global reduction 3 with 178 rules applied. Total rules applied 458 place count 297 transition count 267
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 492 place count 280 transition count 267
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 493 place count 280 transition count 266
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 494 place count 279 transition count 266
Free-agglomeration rule (complex) applied 42 times.
Iterating global reduction 4 with 42 rules applied. Total rules applied 536 place count 279 transition count 224
Reduce places removed 42 places and 0 transitions.
Iterating post reduction 4 with 42 rules applied. Total rules applied 578 place count 237 transition count 224
Partial Free-agglomeration rule applied 40 times.
Drop transitions removed 40 transitions
Iterating global reduction 5 with 40 rules applied. Total rules applied 618 place count 237 transition count 224
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 619 place count 236 transition count 223
Applied a total of 619 rules in 75 ms. Remains 236 /527 variables (removed 291) and now considering 223/497 (removed 274) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 77 ms. Remains : 236/527 places, 223/497 transitions.
Incomplete random walk after 10000 steps, including 1292 resets, run finished after 199 ms. (steps per millisecond=50 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 844 resets, run finished after 142 ms. (steps per millisecond=70 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 844 resets, run finished after 191 ms. (steps per millisecond=52 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 854 resets, run finished after 187 ms. (steps per millisecond=53 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 874 resets, run finished after 188 ms. (steps per millisecond=53 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 192161 steps, run timeout after 3001 ms. (steps per millisecond=64 ) properties seen :{}
Probabilistic random walk after 192161 steps, saw 96134 distinct states, run finished after 3001 ms. (steps per millisecond=64 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 223 rows 236 cols
[2023-03-09 06:39:26] [INFO ] Computed 49 place invariants in 10 ms
[2023-03-09 06:39:26] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 06:39:26] [INFO ] [Real]Absence check using 2 positive and 47 generalized place invariants in 21 ms returned sat
[2023-03-09 06:39:26] [INFO ] After 140ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:3
[2023-03-09 06:39:26] [INFO ] State equation strengthened by 36 read => feed constraints.
[2023-03-09 06:39:26] [INFO ] After 121ms SMT Verify possible using 36 Read/Feed constraints in real domain returned unsat :0 sat :1 real:3
[2023-03-09 06:39:26] [INFO ] Deduced a trap composed of 4 places in 133 ms of which 1 ms to minimize.
[2023-03-09 06:39:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 168 ms
[2023-03-09 06:39:26] [INFO ] After 305ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-09 06:39:26] [INFO ] After 544ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-09 06:39:26] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-09 06:39:26] [INFO ] [Nat]Absence check using 2 positive and 47 generalized place invariants in 32 ms returned sat
[2023-03-09 06:39:27] [INFO ] After 334ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-09 06:39:27] [INFO ] After 236ms SMT Verify possible using 36 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-09 06:39:27] [INFO ] Deduced a trap composed of 19 places in 134 ms of which 1 ms to minimize.
[2023-03-09 06:39:27] [INFO ] Deduced a trap composed of 13 places in 134 ms of which 1 ms to minimize.
[2023-03-09 06:39:27] [INFO ] Deduced a trap composed of 7 places in 160 ms of which 1 ms to minimize.
[2023-03-09 06:39:27] [INFO ] Deduced a trap composed of 16 places in 113 ms of which 1 ms to minimize.
[2023-03-09 06:39:28] [INFO ] Deduced a trap composed of 30 places in 59 ms of which 1 ms to minimize.
[2023-03-09 06:39:28] [INFO ] Deduced a trap composed of 33 places in 57 ms of which 1 ms to minimize.
[2023-03-09 06:39:28] [INFO ] Deduced a trap composed of 28 places in 59 ms of which 0 ms to minimize.
[2023-03-09 06:39:28] [INFO ] Deduced a trap composed of 30 places in 74 ms of which 0 ms to minimize.
[2023-03-09 06:39:28] [INFO ] Deduced a trap composed of 34 places in 61 ms of which 1 ms to minimize.
[2023-03-09 06:39:28] [INFO ] Deduced a trap composed of 31 places in 58 ms of which 1 ms to minimize.
[2023-03-09 06:39:28] [INFO ] Deduced a trap composed of 32 places in 64 ms of which 0 ms to minimize.
[2023-03-09 06:39:28] [INFO ] Deduced a trap composed of 27 places in 81 ms of which 0 ms to minimize.
[2023-03-09 06:39:28] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 1378 ms
[2023-03-09 06:39:28] [INFO ] Deduced a trap composed of 17 places in 100 ms of which 1 ms to minimize.
[2023-03-09 06:39:29] [INFO ] Deduced a trap composed of 22 places in 91 ms of which 3 ms to minimize.
[2023-03-09 06:39:29] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 258 ms
[2023-03-09 06:39:29] [INFO ] Deduced a trap composed of 21 places in 67 ms of which 0 ms to minimize.
[2023-03-09 06:39:29] [INFO ] Deduced a trap composed of 24 places in 65 ms of which 1 ms to minimize.
[2023-03-09 06:39:29] [INFO ] Deduced a trap composed of 27 places in 64 ms of which 0 ms to minimize.
[2023-03-09 06:39:29] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 327 ms
[2023-03-09 06:39:29] [INFO ] After 2426ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 173 ms.
[2023-03-09 06:39:29] [INFO ] After 3104ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 2847 ms.
Support contains 5 out of 236 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 236/236 places, 223/223 transitions.
Applied a total of 0 rules in 16 ms. Remains 236 /236 variables (removed 0) and now considering 223/223 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 236/236 places, 223/223 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 236/236 places, 223/223 transitions.
Applied a total of 0 rules in 5 ms. Remains 236 /236 variables (removed 0) and now considering 223/223 (removed 0) transitions.
[2023-03-09 06:39:32] [INFO ] Invariant cache hit.
[2023-03-09 06:39:33] [INFO ] Implicit Places using invariants in 517 ms returned [20, 26, 46, 52, 74, 79, 99, 106, 127, 132, 133, 153, 158, 180, 186, 193, 227, 233]
Discarding 18 places :
Implicit Place search using SMT only with invariants took 518 ms to find 18 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 218/236 places, 223/223 transitions.
Free-agglomeration rule (complex) applied 8 times.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 218 transition count 215
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 16 place count 210 transition count 215
Applied a total of 16 rules in 10 ms. Remains 210 /218 variables (removed 8) and now considering 215/223 (removed 8) transitions.
// Phase 1: matrix 215 rows 210 cols
[2023-03-09 06:39:33] [INFO ] Computed 31 place invariants in 13 ms
[2023-03-09 06:39:33] [INFO ] Implicit Places using invariants in 213 ms returned []
[2023-03-09 06:39:33] [INFO ] Invariant cache hit.
[2023-03-09 06:39:33] [INFO ] State equation strengthened by 36 read => feed constraints.
[2023-03-09 06:39:35] [INFO ] Implicit Places using invariants and state equation in 1951 ms returned []
Implicit Place search using SMT with State Equation took 2167 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 210/236 places, 215/223 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 2701 ms. Remains : 210/236 places, 215/223 transitions.
Incomplete random walk after 10000 steps, including 1458 resets, run finished after 224 ms. (steps per millisecond=44 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 957 resets, run finished after 198 ms. (steps per millisecond=50 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 941 resets, run finished after 199 ms. (steps per millisecond=50 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 919 resets, run finished after 170 ms. (steps per millisecond=58 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 906 resets, run finished after 133 ms. (steps per millisecond=75 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 211603 steps, run timeout after 3001 ms. (steps per millisecond=70 ) properties seen :{}
Probabilistic random walk after 211603 steps, saw 105819 distinct states, run finished after 3001 ms. (steps per millisecond=70 ) properties seen :0
Running SMT prover for 4 properties.
[2023-03-09 06:39:39] [INFO ] Invariant cache hit.
[2023-03-09 06:39:39] [INFO ] [Real]Absence check using 13 positive place invariants in 17 ms returned sat
[2023-03-09 06:39:39] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 6 ms returned sat
[2023-03-09 06:39:39] [INFO ] After 139ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:3
[2023-03-09 06:39:39] [INFO ] State equation strengthened by 36 read => feed constraints.
[2023-03-09 06:39:39] [INFO ] After 132ms SMT Verify possible using 36 Read/Feed constraints in real domain returned unsat :0 sat :1 real:3
[2023-03-09 06:39:39] [INFO ] After 152ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1 real:3
Attempting to minimize the solution found.
Minimization took 13 ms.
[2023-03-09 06:39:39] [INFO ] After 394ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1 real:3
[2023-03-09 06:39:39] [INFO ] [Nat]Absence check using 13 positive place invariants in 16 ms returned sat
[2023-03-09 06:39:39] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 5 ms returned sat
[2023-03-09 06:39:39] [INFO ] After 251ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-09 06:39:40] [INFO ] After 333ms SMT Verify possible using 36 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-09 06:39:40] [INFO ] After 739ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 218 ms.
[2023-03-09 06:39:40] [INFO ] After 1312ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 1989 ms.
Support contains 5 out of 210 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 210/210 places, 215/215 transitions.
Applied a total of 0 rules in 7 ms. Remains 210 /210 variables (removed 0) and now considering 215/215 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 210/210 places, 215/215 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 210/210 places, 215/215 transitions.
Applied a total of 0 rules in 6 ms. Remains 210 /210 variables (removed 0) and now considering 215/215 (removed 0) transitions.
[2023-03-09 06:39:42] [INFO ] Invariant cache hit.
[2023-03-09 06:39:43] [INFO ] Implicit Places using invariants in 246 ms returned []
[2023-03-09 06:39:43] [INFO ] Invariant cache hit.
[2023-03-09 06:39:43] [INFO ] State equation strengthened by 36 read => feed constraints.
[2023-03-09 06:39:45] [INFO ] Implicit Places using invariants and state equation in 2101 ms returned []
Implicit Place search using SMT with State Equation took 2364 ms to find 0 implicit places.
[2023-03-09 06:39:45] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-09 06:39:45] [INFO ] Invariant cache hit.
[2023-03-09 06:39:45] [INFO ] Dead Transitions using invariants and state equation in 234 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2615 ms. Remains : 210/210 places, 215/215 transitions.
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 16 Pre rules applied. Total rules applied 0 place count 210 transition count 199
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 0 with 32 rules applied. Total rules applied 32 place count 194 transition count 199
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 39 place count 187 transition count 192
Iterating global reduction 0 with 7 rules applied. Total rules applied 46 place count 187 transition count 192
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 48 place count 186 transition count 191
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 49 place count 186 transition count 190
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 50 place count 185 transition count 190
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 52 place count 185 transition count 188
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 54 place count 183 transition count 188
Applied a total of 54 rules in 31 ms. Remains 183 /210 variables (removed 27) and now considering 188/215 (removed 27) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 188 rows 183 cols
[2023-03-09 06:39:45] [INFO ] Computed 31 place invariants in 14 ms
[2023-03-09 06:39:45] [INFO ] [Real]Absence check using 6 positive place invariants in 6 ms returned sat
[2023-03-09 06:39:45] [INFO ] [Real]Absence check using 6 positive and 25 generalized place invariants in 16 ms returned sat
[2023-03-09 06:39:45] [INFO ] After 170ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:3
[2023-03-09 06:39:45] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-09 06:39:45] [INFO ] After 16ms SMT Verify possible using 2 Read/Feed constraints in real domain returned unsat :0 sat :1 real:3
[2023-03-09 06:39:45] [INFO ] After 43ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1 real:3
Attempting to minimize the solution found.
Minimization took 15 ms.
[2023-03-09 06:39:45] [INFO ] After 358ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1 real:3
[2023-03-09 06:39:46] [INFO ] [Nat]Absence check using 6 positive place invariants in 4 ms returned sat
[2023-03-09 06:39:46] [INFO ] [Nat]Absence check using 6 positive and 25 generalized place invariants in 11 ms returned sat
[2023-03-09 06:39:46] [INFO ] After 223ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-09 06:39:46] [INFO ] After 175ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-09 06:39:46] [INFO ] Deduced a trap composed of 20 places in 70 ms of which 0 ms to minimize.
[2023-03-09 06:39:46] [INFO ] Deduced a trap composed of 16 places in 95 ms of which 1 ms to minimize.
[2023-03-09 06:39:46] [INFO ] Deduced a trap composed of 13 places in 106 ms of which 1 ms to minimize.
[2023-03-09 06:39:46] [INFO ] Deduced a trap composed of 10 places in 102 ms of which 1 ms to minimize.
[2023-03-09 06:39:46] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 448 ms
[2023-03-09 06:39:47] [INFO ] Deduced a trap composed of 26 places in 77 ms of which 1 ms to minimize.
[2023-03-09 06:39:47] [INFO ] Deduced a trap composed of 17 places in 76 ms of which 1 ms to minimize.
[2023-03-09 06:39:47] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 206 ms
[2023-03-09 06:39:47] [INFO ] Deduced a trap composed of 69 places in 172 ms of which 1 ms to minimize.
[2023-03-09 06:39:47] [INFO ] Deduced a trap composed of 67 places in 163 ms of which 1 ms to minimize.
[2023-03-09 06:39:47] [INFO ] Deduced a trap composed of 24 places in 160 ms of which 0 ms to minimize.
[2023-03-09 06:39:47] [INFO ] Deduced a trap composed of 67 places in 168 ms of which 2 ms to minimize.
[2023-03-09 06:39:48] [INFO ] Deduced a trap composed of 39 places in 153 ms of which 1 ms to minimize.
[2023-03-09 06:39:48] [INFO ] Deduced a trap composed of 30 places in 167 ms of which 0 ms to minimize.
[2023-03-09 06:39:48] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1101 ms
[2023-03-09 06:39:48] [INFO ] After 2154ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 178 ms.
[2023-03-09 06:39:48] [INFO ] After 2676ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p2) p1 (NOT p0)), (X (NOT p2)), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p2 (NOT p1) p0)))), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (G (NOT (AND p2 p0 (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 653 ms. Reduced automaton from 4 states, 10 edges and 3 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 53 ms :[(NOT p2)]
Stuttering acceptance computed with spot in 51 ms :[(NOT p2)]
// Phase 1: matrix 497 rows 527 cols
[2023-03-09 06:39:49] [INFO ] Computed 49 place invariants in 36 ms
[2023-03-09 06:39:50] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-09 06:39:50] [INFO ] [Real]Absence check using 2 positive and 47 generalized place invariants in 29 ms returned sat
[2023-03-09 06:39:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 06:39:53] [INFO ] [Real]Absence check using state equation in 3493 ms returned sat
[2023-03-09 06:39:53] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 06:39:53] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 06:39:54] [INFO ] [Nat]Absence check using 2 positive and 47 generalized place invariants in 27 ms returned sat
[2023-03-09 06:39:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 06:39:56] [INFO ] [Nat]Absence check using state equation in 2511 ms returned sat
[2023-03-09 06:39:56] [INFO ] Deduced a trap composed of 91 places in 120 ms of which 0 ms to minimize.
[2023-03-09 06:39:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 240 ms
[2023-03-09 06:39:56] [INFO ] Computed and/alt/rep : 496/958/496 causal constraints (skipped 0 transitions) in 35 ms.
[2023-03-09 06:40:06] [INFO ] Added : 342 causal constraints over 69 iterations in 9564 ms. Result :sat
Could not prove EG (NOT p2)
Support contains 1 out of 527 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 : 527/527 places, 497/497 transitions.
Graph (complete) has 895 edges and 527 vertex of which 526 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 114 transitions
Trivial Post-agglo rules discarded 114 transitions
Performed 114 trivial Post agglomeration. Transition count delta: 114
Iterating post reduction 0 with 114 rules applied. Total rules applied 115 place count 525 transition count 381
Reduce places removed 114 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 117 rules applied. Total rules applied 232 place count 411 transition count 378
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 235 place count 408 transition count 378
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 21 Pre rules applied. Total rules applied 235 place count 408 transition count 357
Deduced a syphon composed of 21 places in 4 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 3 with 42 rules applied. Total rules applied 277 place count 387 transition count 357
Performed 89 Post agglomeration using F-continuation condition.Transition count delta: 89
Deduced a syphon composed of 89 places in 2 ms
Reduce places removed 89 places and 0 transitions.
Iterating global reduction 3 with 178 rules applied. Total rules applied 455 place count 298 transition count 268
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 489 place count 281 transition count 268
Partial Post-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 492 place count 281 transition count 268
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 493 place count 280 transition count 267
Applied a total of 493 rules in 81 ms. Remains 280 /527 variables (removed 247) and now considering 267/497 (removed 230) transitions.
// Phase 1: matrix 267 rows 280 cols
[2023-03-09 06:40:06] [INFO ] Computed 49 place invariants in 18 ms
[2023-03-09 06:40:06] [INFO ] Implicit Places using invariants in 381 ms returned []
[2023-03-09 06:40:06] [INFO ] Invariant cache hit.
[2023-03-09 06:40:07] [INFO ] State equation strengthened by 17 read => feed constraints.
[2023-03-09 06:40:08] [INFO ] Implicit Places using invariants and state equation in 1759 ms returned []
Implicit Place search using SMT with State Equation took 2148 ms to find 0 implicit places.
[2023-03-09 06:40:08] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-09 06:40:08] [INFO ] Invariant cache hit.
[2023-03-09 06:40:08] [INFO ] Dead Transitions using invariants and state equation in 188 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 280/527 places, 267/497 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2425 ms. Remains : 280/527 places, 267/497 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 845 edges and 280 vertex of which 279 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p2), (X (NOT p2)), (X (X (NOT p2)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 110 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p2)]
Incomplete random walk after 10000 steps, including 1386 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 821 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 472951 steps, run timeout after 3001 ms. (steps per millisecond=157 ) properties seen :{}
Probabilistic random walk after 472951 steps, saw 236551 distinct states, run finished after 3001 ms. (steps per millisecond=157 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-09 06:40:11] [INFO ] Invariant cache hit.
[2023-03-09 06:40:11] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 06:40:12] [INFO ] [Real]Absence check using 2 positive and 47 generalized place invariants in 17 ms returned sat
[2023-03-09 06:40:12] [INFO ] After 271ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 06:40:12] [INFO ] State equation strengthened by 17 read => feed constraints.
[2023-03-09 06:40:12] [INFO ] After 54ms SMT Verify possible using 17 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-09 06:40:12] [INFO ] After 97ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 22 ms.
[2023-03-09 06:40:12] [INFO ] After 480ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 1 out of 280 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 280/280 places, 267/267 transitions.
Graph (complete) has 807 edges and 280 vertex of which 279 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 7 rules applied. Total rules applied 8 place count 279 transition count 260
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 14 place count 273 transition count 260
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 16 place count 272 transition count 259
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 18 place count 271 transition count 259
Free-agglomeration rule (complex) applied 37 times.
Iterating global reduction 2 with 37 rules applied. Total rules applied 55 place count 271 transition count 222
Reduce places removed 37 places and 0 transitions.
Iterating post reduction 2 with 37 rules applied. Total rules applied 92 place count 234 transition count 222
Partial Free-agglomeration rule applied 39 times.
Drop transitions removed 39 transitions
Iterating global reduction 3 with 39 rules applied. Total rules applied 131 place count 234 transition count 222
Applied a total of 131 rules in 47 ms. Remains 234 /280 variables (removed 46) and now considering 222/267 (removed 45) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 48 ms. Remains : 234/280 places, 222/267 transitions.
Incomplete random walk after 10000 steps, including 1240 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 832 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 486962 steps, run timeout after 3001 ms. (steps per millisecond=162 ) properties seen :{}
Probabilistic random walk after 486962 steps, saw 243633 distinct states, run finished after 3001 ms. (steps per millisecond=162 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 222 rows 234 cols
[2023-03-09 06:40:15] [INFO ] Computed 49 place invariants in 10 ms
[2023-03-09 06:40:15] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-09 06:40:15] [INFO ] [Real]Absence check using 2 positive and 47 generalized place invariants in 20 ms returned sat
[2023-03-09 06:40:15] [INFO ] After 143ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 06:40:15] [INFO ] State equation strengthened by 37 read => feed constraints.
[2023-03-09 06:40:15] [INFO ] After 65ms SMT Verify possible using 37 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-09 06:40:15] [INFO ] After 90ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 14 ms.
[2023-03-09 06:40:15] [INFO ] After 322ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 234 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 234/234 places, 222/222 transitions.
Applied a total of 0 rules in 4 ms. Remains 234 /234 variables (removed 0) and now considering 222/222 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 234/234 places, 222/222 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 234/234 places, 222/222 transitions.
Applied a total of 0 rules in 4 ms. Remains 234 /234 variables (removed 0) and now considering 222/222 (removed 0) transitions.
[2023-03-09 06:40:15] [INFO ] Invariant cache hit.
[2023-03-09 06:40:16] [INFO ] Implicit Places using invariants in 611 ms returned [20, 26, 46, 52, 73, 78, 98, 104, 125, 130, 131, 151, 156, 178, 184, 191, 225, 231]
Discarding 18 places :
Implicit Place search using SMT only with invariants took 613 ms to find 18 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 216/234 places, 222/222 transitions.
Free-agglomeration rule (complex) applied 9 times.
Iterating global reduction 0 with 9 rules applied. Total rules applied 9 place count 216 transition count 213
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 18 place count 207 transition count 213
Applied a total of 18 rules in 8 ms. Remains 207 /216 variables (removed 9) and now considering 213/222 (removed 9) transitions.
// Phase 1: matrix 213 rows 207 cols
[2023-03-09 06:40:16] [INFO ] Computed 31 place invariants in 9 ms
[2023-03-09 06:40:16] [INFO ] Implicit Places using invariants in 297 ms returned []
[2023-03-09 06:40:16] [INFO ] Invariant cache hit.
[2023-03-09 06:40:16] [INFO ] State equation strengthened by 37 read => feed constraints.
[2023-03-09 06:40:19] [INFO ] Implicit Places using invariants and state equation in 2475 ms returned []
Implicit Place search using SMT with State Equation took 2779 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 207/234 places, 213/222 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 3404 ms. Remains : 207/234 places, 213/222 transitions.
Incomplete random walk after 10000 steps, including 1384 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 900 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 558517 steps, run timeout after 3001 ms. (steps per millisecond=186 ) properties seen :{}
Probabilistic random walk after 558517 steps, saw 279314 distinct states, run finished after 3001 ms. (steps per millisecond=186 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-09 06:40:22] [INFO ] Invariant cache hit.
[2023-03-09 06:40:22] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-09 06:40:22] [INFO ] [Real]Absence check using 3 positive and 28 generalized place invariants in 18 ms returned sat
[2023-03-09 06:40:22] [INFO ] After 176ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 06:40:22] [INFO ] State equation strengthened by 37 read => feed constraints.
[2023-03-09 06:40:22] [INFO ] After 143ms SMT Verify possible using 37 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-09 06:40:22] [INFO ] After 168ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 17 ms.
[2023-03-09 06:40:22] [INFO ] After 446ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 207 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 207/207 places, 213/213 transitions.
Applied a total of 0 rules in 5 ms. Remains 207 /207 variables (removed 0) and now considering 213/213 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 207/207 places, 213/213 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 207/207 places, 213/213 transitions.
Applied a total of 0 rules in 5 ms. Remains 207 /207 variables (removed 0) and now considering 213/213 (removed 0) transitions.
[2023-03-09 06:40:22] [INFO ] Invariant cache hit.
[2023-03-09 06:40:23] [INFO ] Implicit Places using invariants in 330 ms returned []
[2023-03-09 06:40:23] [INFO ] Invariant cache hit.
[2023-03-09 06:40:23] [INFO ] State equation strengthened by 37 read => feed constraints.
[2023-03-09 06:40:25] [INFO ] Implicit Places using invariants and state equation in 2133 ms returned []
Implicit Place search using SMT with State Equation took 2465 ms to find 0 implicit places.
[2023-03-09 06:40:25] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-09 06:40:25] [INFO ] Invariant cache hit.
[2023-03-09 06:40:25] [INFO ] Dead Transitions using invariants and state equation in 260 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2738 ms. Remains : 207/207 places, 213/213 transitions.
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 18 Pre rules applied. Total rules applied 0 place count 207 transition count 195
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 0 with 36 rules applied. Total rules applied 36 place count 189 transition count 195
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 44 place count 181 transition count 187
Iterating global reduction 0 with 8 rules applied. Total rules applied 52 place count 181 transition count 187
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 54 place count 180 transition count 186
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 56 place count 180 transition count 184
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 58 place count 178 transition count 184
Applied a total of 58 rules in 18 ms. Remains 178 /207 variables (removed 29) and now considering 184/213 (removed 29) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 184 rows 178 cols
[2023-03-09 06:40:25] [INFO ] Computed 31 place invariants in 10 ms
[2023-03-09 06:40:25] [INFO ] [Real]Absence check using 6 positive place invariants in 5 ms returned sat
[2023-03-09 06:40:25] [INFO ] [Real]Absence check using 6 positive and 25 generalized place invariants in 12 ms returned sat
[2023-03-09 06:40:25] [INFO ] After 236ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 06:40:25] [INFO ] [Nat]Absence check using 6 positive place invariants in 4 ms returned sat
[2023-03-09 06:40:25] [INFO ] [Nat]Absence check using 6 positive and 25 generalized place invariants in 12 ms returned sat
[2023-03-09 06:40:25] [INFO ] After 156ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 06:40:25] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 06:40:25] [INFO ] After 10ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 06:40:26] [INFO ] Deduced a trap composed of 62 places in 121 ms of which 1 ms to minimize.
[2023-03-09 06:40:26] [INFO ] Deduced a trap composed of 58 places in 97 ms of which 1 ms to minimize.
[2023-03-09 06:40:26] [INFO ] Deduced a trap composed of 65 places in 96 ms of which 1 ms to minimize.
[2023-03-09 06:40:26] [INFO ] Deduced a trap composed of 10 places in 99 ms of which 1 ms to minimize.
[2023-03-09 06:40:26] [INFO ] Deduced a trap composed of 58 places in 148 ms of which 0 ms to minimize.
[2023-03-09 06:40:26] [INFO ] Deduced a trap composed of 52 places in 173 ms of which 1 ms to minimize.
[2023-03-09 06:40:26] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 823 ms
[2023-03-09 06:40:26] [INFO ] After 849ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 18 ms.
[2023-03-09 06:40:26] [INFO ] After 1093ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(NOT p2), (X (NOT p2)), (X (X (NOT p2)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 173 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 51 ms :[(NOT p2)]
Stuttering acceptance computed with spot in 56 ms :[(NOT p2)]
// Phase 1: matrix 267 rows 280 cols
[2023-03-09 06:40:27] [INFO ] Computed 49 place invariants in 18 ms
[2023-03-09 06:40:27] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2023-03-09 06:40:27] [INFO ] [Real]Absence check using 2 positive and 47 generalized place invariants in 40 ms returned sat
[2023-03-09 06:40:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 06:40:28] [INFO ] [Real]Absence check using state equation in 1025 ms returned sat
[2023-03-09 06:40:28] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 06:40:28] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-09 06:40:28] [INFO ] [Nat]Absence check using 2 positive and 47 generalized place invariants in 25 ms returned sat
[2023-03-09 06:40:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 06:40:29] [INFO ] [Nat]Absence check using state equation in 820 ms returned sat
[2023-03-09 06:40:29] [INFO ] State equation strengthened by 17 read => feed constraints.
[2023-03-09 06:40:29] [INFO ] [Nat]Added 17 Read/Feed constraints in 219 ms returned sat
[2023-03-09 06:40:29] [INFO ] Deduced a trap composed of 9 places in 93 ms of which 0 ms to minimize.
[2023-03-09 06:40:30] [INFO ] Deduced a trap composed of 10 places in 131 ms of which 1 ms to minimize.
[2023-03-09 06:40:30] [INFO ] Deduced a trap composed of 14 places in 147 ms of which 1 ms to minimize.
[2023-03-09 06:40:30] [INFO ] Deduced a trap composed of 27 places in 156 ms of which 3 ms to minimize.
[2023-03-09 06:40:30] [INFO ] Deduced a trap composed of 10 places in 94 ms of which 0 ms to minimize.
[2023-03-09 06:40:30] [INFO ] Deduced a trap composed of 14 places in 91 ms of which 1 ms to minimize.
[2023-03-09 06:40:30] [INFO ] Deduced a trap composed of 4 places in 91 ms of which 1 ms to minimize.
[2023-03-09 06:40:30] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1041 ms
[2023-03-09 06:40:30] [INFO ] Computed and/alt/rep : 266/967/266 causal constraints (skipped 0 transitions) in 21 ms.
[2023-03-09 06:40:35] [INFO ] Added : 210 causal constraints over 43 iterations in 4286 ms. Result :sat
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 47 ms :[(NOT p2)]
Stuttering criterion allowed to conclude after 5 steps with 0 reset in 0 ms.
FORMULA DoubleExponent-PT-010-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-010-LTLFireability-10 finished in 95226 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 5 out of 527 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 527/527 places, 497/497 transitions.
Graph (complete) has 895 edges and 527 vertex of which 526 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 113 transitions
Trivial Post-agglo rules discarded 113 transitions
Performed 113 trivial Post agglomeration. Transition count delta: 113
Iterating post reduction 0 with 113 rules applied. Total rules applied 114 place count 525 transition count 382
Reduce places removed 113 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 117 rules applied. Total rules applied 231 place count 412 transition count 378
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 235 place count 408 transition count 378
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 22 Pre rules applied. Total rules applied 235 place count 408 transition count 356
Deduced a syphon composed of 22 places in 3 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 3 with 44 rules applied. Total rules applied 279 place count 386 transition count 356
Performed 89 Post agglomeration using F-continuation condition.Transition count delta: 89
Deduced a syphon composed of 89 places in 2 ms
Reduce places removed 89 places and 0 transitions.
Iterating global reduction 3 with 178 rules applied. Total rules applied 457 place count 297 transition count 267
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 491 place count 280 transition count 267
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 492 place count 279 transition count 266
Applied a total of 492 rules in 47 ms. Remains 279 /527 variables (removed 248) and now considering 266/497 (removed 231) transitions.
// Phase 1: matrix 266 rows 279 cols
[2023-03-09 06:40:35] [INFO ] Computed 49 place invariants in 14 ms
[2023-03-09 06:40:35] [INFO ] Implicit Places using invariants in 392 ms returned []
[2023-03-09 06:40:35] [INFO ] Invariant cache hit.
[2023-03-09 06:40:35] [INFO ] State equation strengthened by 16 read => feed constraints.
[2023-03-09 06:40:37] [INFO ] Implicit Places using invariants and state equation in 2065 ms returned []
Implicit Place search using SMT with State Equation took 2458 ms to find 0 implicit places.
[2023-03-09 06:40:37] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-09 06:40:37] [INFO ] Invariant cache hit.
[2023-03-09 06:40:37] [INFO ] Dead Transitions using invariants and state equation in 199 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 279/527 places, 266/497 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2712 ms. Remains : 279/527 places, 266/497 transitions.
Stuttering acceptance computed with spot in 272 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : DoubleExponent-PT-010-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (GEQ s163 1) (GEQ s170 1)), p1:(AND (LT s16 1) (OR (LT s251 1) (LT s269 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 10 steps with 0 reset in 0 ms.
FORMULA DoubleExponent-PT-010-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-010-LTLFireability-11 finished in 3005 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 527 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 527/527 places, 497/497 transitions.
Graph (complete) has 895 edges and 527 vertex of which 526 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 121 transitions
Trivial Post-agglo rules discarded 121 transitions
Performed 121 trivial Post agglomeration. Transition count delta: 121
Iterating post reduction 0 with 121 rules applied. Total rules applied 122 place count 525 transition count 374
Reduce places removed 121 places and 0 transitions.
Iterating post reduction 1 with 121 rules applied. Total rules applied 243 place count 404 transition count 374
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 21 Pre rules applied. Total rules applied 243 place count 404 transition count 353
Deduced a syphon composed of 21 places in 4 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 285 place count 383 transition count 353
Performed 92 Post agglomeration using F-continuation condition.Transition count delta: 92
Deduced a syphon composed of 92 places in 1 ms
Reduce places removed 92 places and 0 transitions.
Iterating global reduction 2 with 184 rules applied. Total rules applied 469 place count 291 transition count 261
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 505 place count 273 transition count 261
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 506 place count 272 transition count 260
Applied a total of 506 rules in 53 ms. Remains 272 /527 variables (removed 255) and now considering 260/497 (removed 237) transitions.
// Phase 1: matrix 260 rows 272 cols
[2023-03-09 06:40:38] [INFO ] Computed 49 place invariants in 16 ms
[2023-03-09 06:40:38] [INFO ] Implicit Places using invariants in 373 ms returned []
[2023-03-09 06:40:38] [INFO ] Invariant cache hit.
[2023-03-09 06:40:39] [INFO ] State equation strengthened by 18 read => feed constraints.
[2023-03-09 06:40:40] [INFO ] Implicit Places using invariants and state equation in 1524 ms returned []
Implicit Place search using SMT with State Equation took 1908 ms to find 0 implicit places.
[2023-03-09 06:40:40] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-09 06:40:40] [INFO ] Invariant cache hit.
[2023-03-09 06:40:40] [INFO ] Dead Transitions using invariants and state equation in 188 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 272/527 places, 260/497 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2156 ms. Remains : 272/527 places, 260/497 transitions.
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Running random walk in product with property : DoubleExponent-PT-010-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LT s147 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 13828 reset in 156 ms.
Product exploration explored 100000 steps with 13776 reset in 228 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 853 edges and 272 vertex of which 271 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
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 159 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 51 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 1376 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 794 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 447298 steps, run timeout after 3001 ms. (steps per millisecond=149 ) properties seen :{}
Probabilistic random walk after 447298 steps, saw 223721 distinct states, run finished after 3001 ms. (steps per millisecond=149 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-09 06:40:44] [INFO ] Invariant cache hit.
[2023-03-09 06:40:44] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 06:40:44] [INFO ] [Real]Absence check using 2 positive and 47 generalized place invariants in 18 ms returned sat
[2023-03-09 06:40:44] [INFO ] After 204ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 06:40:44] [INFO ] State equation strengthened by 18 read => feed constraints.
[2023-03-09 06:40:44] [INFO ] After 62ms SMT Verify possible using 18 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-09 06:40:44] [INFO ] After 88ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 15 ms.
[2023-03-09 06:40:44] [INFO ] After 386ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 9 ms.
Support contains 1 out of 272 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 272/272 places, 260/260 transitions.
Graph (complete) has 813 edges and 272 vertex of which 271 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 271 transition count 259
Free-agglomeration rule (complex) applied 37 times.
Iterating global reduction 1 with 37 rules applied. Total rules applied 39 place count 271 transition count 222
Reduce places removed 37 places and 0 transitions.
Iterating post reduction 1 with 37 rules applied. Total rules applied 76 place count 234 transition count 222
Partial Free-agglomeration rule applied 39 times.
Drop transitions removed 39 transitions
Iterating global reduction 2 with 39 rules applied. Total rules applied 115 place count 234 transition count 222
Applied a total of 115 rules in 23 ms. Remains 234 /272 variables (removed 38) and now considering 222/260 (removed 38) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 234/272 places, 222/260 transitions.
Incomplete random walk after 10000 steps, including 1272 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 813 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 522819 steps, run timeout after 3001 ms. (steps per millisecond=174 ) properties seen :{}
Probabilistic random walk after 522819 steps, saw 261568 distinct states, run finished after 3001 ms. (steps per millisecond=174 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 222 rows 234 cols
[2023-03-09 06:40:47] [INFO ] Computed 49 place invariants in 11 ms
[2023-03-09 06:40:47] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-09 06:40:47] [INFO ] [Real]Absence check using 3 positive and 46 generalized place invariants in 22 ms returned sat
[2023-03-09 06:40:47] [INFO ] After 170ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 06:40:47] [INFO ] State equation strengthened by 37 read => feed constraints.
[2023-03-09 06:40:47] [INFO ] After 123ms SMT Verify possible using 37 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 06:40:47] [INFO ] After 371ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 06:40:48] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-09 06:40:48] [INFO ] [Nat]Absence check using 3 positive and 46 generalized place invariants in 31 ms returned sat
[2023-03-09 06:40:48] [INFO ] After 246ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 06:40:48] [INFO ] After 223ms SMT Verify possible using 37 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 06:40:48] [INFO ] After 257ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 19 ms.
[2023-03-09 06:40:48] [INFO ] After 616ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 12 ms.
Support contains 1 out of 234 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 234/234 places, 222/222 transitions.
Applied a total of 0 rules in 6 ms. Remains 234 /234 variables (removed 0) and now considering 222/222 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 234/234 places, 222/222 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 234/234 places, 222/222 transitions.
Applied a total of 0 rules in 6 ms. Remains 234 /234 variables (removed 0) and now considering 222/222 (removed 0) transitions.
[2023-03-09 06:40:48] [INFO ] Invariant cache hit.
[2023-03-09 06:40:49] [INFO ] Implicit Places using invariants in 897 ms returned [20, 26, 46, 51, 72, 77, 97, 103, 124, 130, 131, 151, 156, 178, 184, 191, 225, 231]
Discarding 18 places :
Implicit Place search using SMT only with invariants took 899 ms to find 18 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 216/234 places, 222/222 transitions.
Free-agglomeration rule (complex) applied 9 times.
Iterating global reduction 0 with 9 rules applied. Total rules applied 9 place count 216 transition count 213
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 18 place count 207 transition count 213
Applied a total of 18 rules in 12 ms. Remains 207 /216 variables (removed 9) and now considering 213/222 (removed 9) transitions.
// Phase 1: matrix 213 rows 207 cols
[2023-03-09 06:40:49] [INFO ] Computed 31 place invariants in 18 ms
[2023-03-09 06:40:49] [INFO ] Implicit Places using invariants in 418 ms returned []
[2023-03-09 06:40:49] [INFO ] Invariant cache hit.
[2023-03-09 06:40:50] [INFO ] State equation strengthened by 37 read => feed constraints.
[2023-03-09 06:40:52] [INFO ] Implicit Places using invariants and state equation in 2508 ms returned []
Implicit Place search using SMT with State Equation took 2927 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 207/234 places, 213/222 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 3845 ms. Remains : 207/234 places, 213/222 transitions.
Incomplete random walk after 10000 steps, including 1460 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 924 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 528314 steps, run timeout after 3001 ms. (steps per millisecond=176 ) properties seen :{}
Probabilistic random walk after 528314 steps, saw 264212 distinct states, run finished after 3001 ms. (steps per millisecond=176 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-09 06:40:55] [INFO ] Invariant cache hit.
[2023-03-09 06:40:55] [INFO ] [Real]Absence check using 13 positive place invariants in 18 ms returned sat
[2023-03-09 06:40:55] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 5 ms returned sat
[2023-03-09 06:40:55] [INFO ] After 157ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 06:40:55] [INFO ] State equation strengthened by 37 read => feed constraints.
[2023-03-09 06:40:55] [INFO ] After 112ms SMT Verify possible using 37 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 06:40:55] [INFO ] After 343ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 06:40:55] [INFO ] [Nat]Absence check using 13 positive place invariants in 19 ms returned sat
[2023-03-09 06:40:55] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 6 ms returned sat
[2023-03-09 06:40:56] [INFO ] After 215ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 06:40:56] [INFO ] After 155ms SMT Verify possible using 37 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 06:40:56] [INFO ] After 187ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 20 ms.
[2023-03-09 06:40:56] [INFO ] After 495ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 10 ms.
Support contains 1 out of 207 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 207/207 places, 213/213 transitions.
Applied a total of 0 rules in 8 ms. Remains 207 /207 variables (removed 0) and now considering 213/213 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 207/207 places, 213/213 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 207/207 places, 213/213 transitions.
Applied a total of 0 rules in 6 ms. Remains 207 /207 variables (removed 0) and now considering 213/213 (removed 0) transitions.
[2023-03-09 06:40:56] [INFO ] Invariant cache hit.
[2023-03-09 06:40:56] [INFO ] Implicit Places using invariants in 399 ms returned []
[2023-03-09 06:40:56] [INFO ] Invariant cache hit.
[2023-03-09 06:40:57] [INFO ] State equation strengthened by 37 read => feed constraints.
[2023-03-09 06:40:58] [INFO ] Implicit Places using invariants and state equation in 2128 ms returned []
Implicit Place search using SMT with State Equation took 2529 ms to find 0 implicit places.
[2023-03-09 06:40:58] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-09 06:40:58] [INFO ] Invariant cache hit.
[2023-03-09 06:40:59] [INFO ] Dead Transitions using invariants and state equation in 254 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2797 ms. Remains : 207/207 places, 213/213 transitions.
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 18 Pre rules applied. Total rules applied 0 place count 207 transition count 195
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 0 with 36 rules applied. Total rules applied 36 place count 189 transition count 195
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 44 place count 181 transition count 187
Iterating global reduction 0 with 8 rules applied. Total rules applied 52 place count 181 transition count 187
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 54 place count 180 transition count 186
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 56 place count 180 transition count 184
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 58 place count 178 transition count 184
Applied a total of 58 rules in 14 ms. Remains 178 /207 variables (removed 29) and now considering 184/213 (removed 29) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 184 rows 178 cols
[2023-03-09 06:40:59] [INFO ] Computed 31 place invariants in 13 ms
[2023-03-09 06:40:59] [INFO ] [Real]Absence check using 13 positive place invariants in 14 ms returned sat
[2023-03-09 06:40:59] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 7 ms returned sat
[2023-03-09 06:40:59] [INFO ] After 144ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 06:40:59] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 06:40:59] [INFO ] After 12ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 06:40:59] [INFO ] After 229ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 06:40:59] [INFO ] [Nat]Absence check using 13 positive place invariants in 14 ms returned sat
[2023-03-09 06:40:59] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 6 ms returned sat
[2023-03-09 06:40:59] [INFO ] After 147ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 06:40:59] [INFO ] After 13ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 06:40:59] [INFO ] After 35ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 13 ms.
[2023-03-09 06:40:59] [INFO ] After 270ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 138 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 45 ms :[(NOT p0)]
Support contains 1 out of 272 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 272/272 places, 260/260 transitions.
Applied a total of 0 rules in 6 ms. Remains 272 /272 variables (removed 0) and now considering 260/260 (removed 0) transitions.
// Phase 1: matrix 260 rows 272 cols
[2023-03-09 06:40:59] [INFO ] Computed 49 place invariants in 14 ms
[2023-03-09 06:41:00] [INFO ] Implicit Places using invariants in 380 ms returned []
[2023-03-09 06:41:00] [INFO ] Invariant cache hit.
[2023-03-09 06:41:00] [INFO ] State equation strengthened by 18 read => feed constraints.
[2023-03-09 06:41:01] [INFO ] Implicit Places using invariants and state equation in 1679 ms returned []
Implicit Place search using SMT with State Equation took 2061 ms to find 0 implicit places.
[2023-03-09 06:41:01] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-09 06:41:01] [INFO ] Invariant cache hit.
[2023-03-09 06:41:02] [INFO ] Dead Transitions using invariants and state equation in 329 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2403 ms. Remains : 272/272 places, 260/260 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 853 edges and 272 vertex of which 271 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 ms
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 156 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 1400 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 809 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 459397 steps, run timeout after 3001 ms. (steps per millisecond=153 ) properties seen :{}
Probabilistic random walk after 459397 steps, saw 229767 distinct states, run finished after 3001 ms. (steps per millisecond=153 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-09 06:41:05] [INFO ] Invariant cache hit.
[2023-03-09 06:41:05] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-09 06:41:05] [INFO ] [Real]Absence check using 2 positive and 47 generalized place invariants in 28 ms returned sat
[2023-03-09 06:41:06] [INFO ] After 333ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 06:41:06] [INFO ] State equation strengthened by 18 read => feed constraints.
[2023-03-09 06:41:06] [INFO ] After 103ms SMT Verify possible using 18 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-09 06:41:06] [INFO ] After 147ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 23 ms.
[2023-03-09 06:41:06] [INFO ] After 628ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 15 ms.
Support contains 1 out of 272 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 272/272 places, 260/260 transitions.
Graph (complete) has 813 edges and 272 vertex of which 271 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 271 transition count 259
Free-agglomeration rule (complex) applied 37 times.
Iterating global reduction 1 with 37 rules applied. Total rules applied 39 place count 271 transition count 222
Reduce places removed 37 places and 0 transitions.
Iterating post reduction 1 with 37 rules applied. Total rules applied 76 place count 234 transition count 222
Partial Free-agglomeration rule applied 39 times.
Drop transitions removed 39 transitions
Iterating global reduction 2 with 39 rules applied. Total rules applied 115 place count 234 transition count 222
Applied a total of 115 rules in 23 ms. Remains 234 /272 variables (removed 38) and now considering 222/260 (removed 38) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 234/272 places, 222/260 transitions.
Incomplete random walk after 10000 steps, including 1296 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 859 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 503252 steps, run timeout after 3001 ms. (steps per millisecond=167 ) properties seen :{}
Probabilistic random walk after 503252 steps, saw 251782 distinct states, run finished after 3001 ms. (steps per millisecond=167 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 222 rows 234 cols
[2023-03-09 06:41:09] [INFO ] Computed 49 place invariants in 10 ms
[2023-03-09 06:41:09] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-09 06:41:09] [INFO ] [Real]Absence check using 3 positive and 46 generalized place invariants in 23 ms returned sat
[2023-03-09 06:41:09] [INFO ] After 182ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 06:41:09] [INFO ] State equation strengthened by 37 read => feed constraints.
[2023-03-09 06:41:09] [INFO ] After 156ms SMT Verify possible using 37 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 06:41:09] [INFO ] After 417ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 06:41:09] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-09 06:41:09] [INFO ] [Nat]Absence check using 3 positive and 46 generalized place invariants in 26 ms returned sat
[2023-03-09 06:41:09] [INFO ] After 189ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 06:41:10] [INFO ] After 156ms SMT Verify possible using 37 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 06:41:10] [INFO ] After 182ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 15 ms.
[2023-03-09 06:41:10] [INFO ] After 479ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 9 ms.
Support contains 1 out of 234 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 234/234 places, 222/222 transitions.
Applied a total of 0 rules in 4 ms. Remains 234 /234 variables (removed 0) and now considering 222/222 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 234/234 places, 222/222 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 234/234 places, 222/222 transitions.
Applied a total of 0 rules in 4 ms. Remains 234 /234 variables (removed 0) and now considering 222/222 (removed 0) transitions.
[2023-03-09 06:41:10] [INFO ] Invariant cache hit.
[2023-03-09 06:41:10] [INFO ] Implicit Places using invariants in 632 ms returned [20, 26, 46, 51, 72, 77, 97, 103, 124, 130, 131, 151, 156, 178, 184, 191, 225, 231]
Discarding 18 places :
Implicit Place search using SMT only with invariants took 646 ms to find 18 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 216/234 places, 222/222 transitions.
Free-agglomeration rule (complex) applied 9 times.
Iterating global reduction 0 with 9 rules applied. Total rules applied 9 place count 216 transition count 213
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 18 place count 207 transition count 213
Applied a total of 18 rules in 12 ms. Remains 207 /216 variables (removed 9) and now considering 213/222 (removed 9) transitions.
// Phase 1: matrix 213 rows 207 cols
[2023-03-09 06:41:10] [INFO ] Computed 31 place invariants in 20 ms
[2023-03-09 06:41:11] [INFO ] Implicit Places using invariants in 409 ms returned []
[2023-03-09 06:41:11] [INFO ] Invariant cache hit.
[2023-03-09 06:41:11] [INFO ] State equation strengthened by 37 read => feed constraints.
[2023-03-09 06:41:13] [INFO ] Implicit Places using invariants and state equation in 2081 ms returned []
Implicit Place search using SMT with State Equation took 2491 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 207/234 places, 213/222 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 3157 ms. Remains : 207/234 places, 213/222 transitions.
Incomplete random walk after 10000 steps, including 1423 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 923 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 572536 steps, run timeout after 3001 ms. (steps per millisecond=190 ) properties seen :{}
Probabilistic random walk after 572536 steps, saw 286328 distinct states, run finished after 3001 ms. (steps per millisecond=190 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-09 06:41:16] [INFO ] Invariant cache hit.
[2023-03-09 06:41:16] [INFO ] [Real]Absence check using 13 positive place invariants in 18 ms returned sat
[2023-03-09 06:41:16] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 6 ms returned sat
[2023-03-09 06:41:16] [INFO ] After 225ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 06:41:16] [INFO ] State equation strengthened by 37 read => feed constraints.
[2023-03-09 06:41:16] [INFO ] After 188ms SMT Verify possible using 37 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 06:41:16] [INFO ] After 488ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 06:41:16] [INFO ] [Nat]Absence check using 13 positive place invariants in 32 ms returned sat
[2023-03-09 06:41:16] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 8 ms returned sat
[2023-03-09 06:41:17] [INFO ] After 289ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 06:41:17] [INFO ] After 157ms SMT Verify possible using 37 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 06:41:17] [INFO ] After 190ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 21 ms.
[2023-03-09 06:41:17] [INFO ] After 617ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 10 ms.
Support contains 1 out of 207 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 207/207 places, 213/213 transitions.
Applied a total of 0 rules in 5 ms. Remains 207 /207 variables (removed 0) and now considering 213/213 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 207/207 places, 213/213 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 207/207 places, 213/213 transitions.
Applied a total of 0 rules in 5 ms. Remains 207 /207 variables (removed 0) and now considering 213/213 (removed 0) transitions.
[2023-03-09 06:41:17] [INFO ] Invariant cache hit.
[2023-03-09 06:41:17] [INFO ] Implicit Places using invariants in 387 ms returned []
[2023-03-09 06:41:17] [INFO ] Invariant cache hit.
[2023-03-09 06:41:18] [INFO ] State equation strengthened by 37 read => feed constraints.
[2023-03-09 06:41:20] [INFO ] Implicit Places using invariants and state equation in 2202 ms returned []
Implicit Place search using SMT with State Equation took 2590 ms to find 0 implicit places.
[2023-03-09 06:41:20] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-09 06:41:20] [INFO ] Invariant cache hit.
[2023-03-09 06:41:20] [INFO ] Dead Transitions using invariants and state equation in 153 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2755 ms. Remains : 207/207 places, 213/213 transitions.
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 18 Pre rules applied. Total rules applied 0 place count 207 transition count 195
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 0 with 36 rules applied. Total rules applied 36 place count 189 transition count 195
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 44 place count 181 transition count 187
Iterating global reduction 0 with 8 rules applied. Total rules applied 52 place count 181 transition count 187
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 54 place count 180 transition count 186
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 56 place count 180 transition count 184
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 58 place count 178 transition count 184
Applied a total of 58 rules in 13 ms. Remains 178 /207 variables (removed 29) and now considering 184/213 (removed 29) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 184 rows 178 cols
[2023-03-09 06:41:20] [INFO ] Computed 31 place invariants in 10 ms
[2023-03-09 06:41:20] [INFO ] [Real]Absence check using 13 positive place invariants in 12 ms returned sat
[2023-03-09 06:41:20] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 6 ms returned sat
[2023-03-09 06:41:20] [INFO ] After 118ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 06:41:20] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 06:41:20] [INFO ] After 15ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 06:41:20] [INFO ] After 193ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 06:41:20] [INFO ] [Nat]Absence check using 13 positive place invariants in 12 ms returned sat
[2023-03-09 06:41:20] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 6 ms returned sat
[2023-03-09 06:41:20] [INFO ] After 112ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 06:41:20] [INFO ] After 9ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 06:41:20] [INFO ] After 24ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 9 ms.
[2023-03-09 06:41:20] [INFO ] After 206ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 99 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Product exploration explored 100000 steps with 13926 reset in 113 ms.
Product exploration explored 100000 steps with 13940 reset in 131 ms.
Support contains 1 out of 272 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 272/272 places, 260/260 transitions.
Applied a total of 0 rules in 4 ms. Remains 272 /272 variables (removed 0) and now considering 260/260 (removed 0) transitions.
// Phase 1: matrix 260 rows 272 cols
[2023-03-09 06:41:21] [INFO ] Computed 49 place invariants in 9 ms
[2023-03-09 06:41:21] [INFO ] Implicit Places using invariants in 246 ms returned []
[2023-03-09 06:41:21] [INFO ] Invariant cache hit.
[2023-03-09 06:41:21] [INFO ] State equation strengthened by 18 read => feed constraints.
[2023-03-09 06:41:22] [INFO ] Implicit Places using invariants and state equation in 1541 ms returned []
Implicit Place search using SMT with State Equation took 1787 ms to find 0 implicit places.
[2023-03-09 06:41:22] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-09 06:41:22] [INFO ] Invariant cache hit.
[2023-03-09 06:41:23] [INFO ] Dead Transitions using invariants and state equation in 178 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1976 ms. Remains : 272/272 places, 260/260 transitions.
Treatment of property DoubleExponent-PT-010-LTLFireability-12 finished in 44911 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((G(F(p0)) U (p1 U p2)) U p2))'
Support contains 3 out of 527 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 527/527 places, 497/497 transitions.
Graph (complete) has 895 edges and 527 vertex of which 526 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 120 transitions
Trivial Post-agglo rules discarded 120 transitions
Performed 120 trivial Post agglomeration. Transition count delta: 120
Iterating post reduction 0 with 120 rules applied. Total rules applied 121 place count 525 transition count 375
Reduce places removed 120 places and 0 transitions.
Iterating post reduction 1 with 120 rules applied. Total rules applied 241 place count 405 transition count 375
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 20 Pre rules applied. Total rules applied 241 place count 405 transition count 355
Deduced a syphon composed of 20 places in 2 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 281 place count 385 transition count 355
Performed 92 Post agglomeration using F-continuation condition.Transition count delta: 92
Deduced a syphon composed of 92 places in 1 ms
Reduce places removed 92 places and 0 transitions.
Iterating global reduction 2 with 184 rules applied. Total rules applied 465 place count 293 transition count 263
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 501 place count 275 transition count 263
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 502 place count 274 transition count 262
Applied a total of 502 rules in 32 ms. Remains 274 /527 variables (removed 253) and now considering 262/497 (removed 235) transitions.
// Phase 1: matrix 262 rows 274 cols
[2023-03-09 06:41:23] [INFO ] Computed 49 place invariants in 12 ms
[2023-03-09 06:41:23] [INFO ] Implicit Places using invariants in 238 ms returned []
[2023-03-09 06:41:23] [INFO ] Invariant cache hit.
[2023-03-09 06:41:23] [INFO ] State equation strengthened by 18 read => feed constraints.
[2023-03-09 06:41:24] [INFO ] Implicit Places using invariants and state equation in 1374 ms returned []
Implicit Place search using SMT with State Equation took 1614 ms to find 0 implicit places.
[2023-03-09 06:41:24] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-09 06:41:24] [INFO ] Invariant cache hit.
[2023-03-09 06:41:25] [INFO ] Dead Transitions using invariants and state equation in 179 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 274/527 places, 262/497 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1833 ms. Remains : 274/527 places, 262/497 transitions.
Stuttering acceptance computed with spot in 114 ms :[(NOT p2), (NOT p0), (NOT p0)]
Running random walk in product with property : DoubleExponent-PT-010-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}]], initial=0, aps=[p2:(GEQ s84 1), p0:(GEQ s17 1), p1:(GEQ s1 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 5 steps with 0 reset in 0 ms.
FORMULA DoubleExponent-PT-010-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-010-LTLFireability-13 finished in 1966 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 527 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 527/527 places, 497/497 transitions.
Graph (complete) has 895 edges and 527 vertex of which 526 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 121 transitions
Trivial Post-agglo rules discarded 121 transitions
Performed 121 trivial Post agglomeration. Transition count delta: 121
Iterating post reduction 0 with 121 rules applied. Total rules applied 122 place count 525 transition count 374
Reduce places removed 121 places and 0 transitions.
Iterating post reduction 1 with 121 rules applied. Total rules applied 243 place count 404 transition count 374
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 21 Pre rules applied. Total rules applied 243 place count 404 transition count 353
Deduced a syphon composed of 21 places in 2 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 285 place count 383 transition count 353
Performed 92 Post agglomeration using F-continuation condition.Transition count delta: 92
Deduced a syphon composed of 92 places in 1 ms
Reduce places removed 92 places and 0 transitions.
Iterating global reduction 2 with 184 rules applied. Total rules applied 469 place count 291 transition count 261
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 505 place count 273 transition count 261
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 506 place count 272 transition count 260
Applied a total of 506 rules in 30 ms. Remains 272 /527 variables (removed 255) and now considering 260/497 (removed 237) transitions.
// Phase 1: matrix 260 rows 272 cols
[2023-03-09 06:41:25] [INFO ] Computed 49 place invariants in 10 ms
[2023-03-09 06:41:25] [INFO ] Implicit Places using invariants in 217 ms returned []
[2023-03-09 06:41:25] [INFO ] Invariant cache hit.
[2023-03-09 06:41:25] [INFO ] State equation strengthened by 18 read => feed constraints.
[2023-03-09 06:41:26] [INFO ] Implicit Places using invariants and state equation in 1329 ms returned []
Implicit Place search using SMT with State Equation took 1548 ms to find 0 implicit places.
[2023-03-09 06:41:26] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-09 06:41:26] [INFO ] Invariant cache hit.
[2023-03-09 06:41:26] [INFO ] Dead Transitions using invariants and state equation in 208 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 272/527 places, 260/497 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1796 ms. Remains : 272/527 places, 260/497 transitions.
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Running random walk in product with property : DoubleExponent-PT-010-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GEQ s51 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 15 steps with 0 reset in 0 ms.
FORMULA DoubleExponent-PT-010-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-010-LTLFireability-14 finished in 1846 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(((p0||G(p1)) U X(!p2)))))'
Support contains 5 out of 527 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 527/527 places, 497/497 transitions.
Applied a total of 0 rules in 11 ms. Remains 527 /527 variables (removed 0) and now considering 497/497 (removed 0) transitions.
// Phase 1: matrix 497 rows 527 cols
[2023-03-09 06:41:27] [INFO ] Computed 49 place invariants in 23 ms
[2023-03-09 06:41:27] [INFO ] Implicit Places using invariants in 327 ms returned []
[2023-03-09 06:41:27] [INFO ] Invariant cache hit.
[2023-03-09 06:41:30] [INFO ] Implicit Places using invariants and state equation in 2971 ms returned []
Implicit Place search using SMT with State Equation took 3299 ms to find 0 implicit places.
[2023-03-09 06:41:30] [INFO ] Invariant cache hit.
[2023-03-09 06:41:30] [INFO ] Dead Transitions using invariants and state equation in 387 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3698 ms. Remains : 527/527 places, 497/497 transitions.
Stuttering acceptance computed with spot in 300 ms :[p2, p2, p2, p2, p2, (AND (NOT p1) p2), true, (NOT p1)]
Running random walk in product with property : DoubleExponent-PT-010-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(OR p0 p1), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 5}], [{ cond=p2, acceptance={} source=3 dest: 6}], [{ cond=(AND (NOT p0) (NOT p1) p2), acceptance={0} source=4 dest: 3}, { cond=(OR (AND p0 p2) (AND p1 p2)), acceptance={0} source=4 dest: 4}, { cond=(AND (NOT p0) p1 p2), acceptance={0} source=4 dest: 5}], [{ cond=(AND (NOT p1) p2), acceptance={} source=5 dest: 6}, { cond=(AND p1 p2), acceptance={} source=5 dest: 7}], [{ cond=true, acceptance={0} source=6 dest: 6}], [{ cond=(NOT p1), acceptance={} source=7 dest: 6}, { cond=p1, acceptance={} source=7 dest: 7}]], initial=0, aps=[p0:(AND (GEQ s309 1) (GEQ s355 1)), p1:(GEQ s24 1), p2:(AND (GEQ s128 1) (GEQ s233 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 25000 reset in 413 ms.
Product exploration explored 100000 steps with 25000 reset in 357 ms.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 895 edges and 527 vertex of which 525 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Computed a total of 7 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (X (NOT (OR p0 p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 169 ms. Reduced automaton from 8 states, 14 edges and 3 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 148 ms :[p2, p2, p2, p2, true]
Incomplete random walk after 10000 steps, including 330 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 282 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 347382 steps, run timeout after 3001 ms. (steps per millisecond=115 ) properties seen :{}
Probabilistic random walk after 347382 steps, saw 173724 distinct states, run finished after 3001 ms. (steps per millisecond=115 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-09 06:41:35] [INFO ] Invariant cache hit.
[2023-03-09 06:41:35] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-09 06:41:35] [INFO ] [Real]Absence check using 2 positive and 47 generalized place invariants in 22 ms returned sat
[2023-03-09 06:41:35] [INFO ] After 578ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 06:41:36] [INFO ] Deduced a trap composed of 67 places in 155 ms of which 1 ms to minimize.
[2023-03-09 06:41:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 220 ms
[2023-03-09 06:41:36] [INFO ] After 845ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 06:41:36] [INFO ] After 971ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 06:41:36] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 06:41:36] [INFO ] [Nat]Absence check using 2 positive and 47 generalized place invariants in 20 ms returned sat
[2023-03-09 06:41:36] [INFO ] After 513ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 06:41:36] [INFO ] Deduced a trap composed of 67 places in 145 ms of which 0 ms to minimize.
[2023-03-09 06:41:37] [INFO ] Deduced a trap composed of 53 places in 149 ms of which 1 ms to minimize.
[2023-03-09 06:41:37] [INFO ] Deduced a trap composed of 95 places in 164 ms of which 0 ms to minimize.
[2023-03-09 06:41:37] [INFO ] Deduced a trap composed of 89 places in 157 ms of which 0 ms to minimize.
[2023-03-09 06:41:37] [INFO ] Deduced a trap composed of 55 places in 159 ms of which 0 ms to minimize.
[2023-03-09 06:41:37] [INFO ] Deduced a trap composed of 41 places in 163 ms of which 1 ms to minimize.
[2023-03-09 06:41:38] [INFO ] Deduced a trap composed of 43 places in 173 ms of which 1 ms to minimize.
[2023-03-09 06:41:38] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1329 ms
[2023-03-09 06:41:38] [INFO ] After 1873ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 38 ms.
[2023-03-09 06:41:38] [INFO ] After 2035ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 12 ms.
Support contains 2 out of 527 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 527/527 places, 497/497 transitions.
Graph (complete) has 895 edges and 527 vertex of which 525 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 118 transitions
Trivial Post-agglo rules discarded 118 transitions
Performed 118 trivial Post agglomeration. Transition count delta: 118
Iterating post reduction 0 with 119 rules applied. Total rules applied 120 place count 525 transition count 377
Reduce places removed 118 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 120 rules applied. Total rules applied 240 place count 407 transition count 375
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 242 place count 405 transition count 375
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 22 Pre rules applied. Total rules applied 242 place count 405 transition count 353
Deduced a syphon composed of 22 places in 3 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 3 with 44 rules applied. Total rules applied 286 place count 383 transition count 353
Performed 90 Post agglomeration using F-continuation condition.Transition count delta: 90
Deduced a syphon composed of 90 places in 1 ms
Reduce places removed 90 places and 0 transitions.
Iterating global reduction 3 with 180 rules applied. Total rules applied 466 place count 293 transition count 263
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 36 rules applied. Total rules applied 502 place count 275 transition count 263
Free-agglomeration rule (complex) applied 39 times.
Iterating global reduction 3 with 39 rules applied. Total rules applied 541 place count 275 transition count 224
Reduce places removed 39 places and 0 transitions.
Iterating post reduction 3 with 39 rules applied. Total rules applied 580 place count 236 transition count 224
Partial Free-agglomeration rule applied 40 times.
Drop transitions removed 40 transitions
Iterating global reduction 4 with 40 rules applied. Total rules applied 620 place count 236 transition count 224
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 621 place count 235 transition count 223
Applied a total of 621 rules in 37 ms. Remains 235 /527 variables (removed 292) and now considering 223/497 (removed 274) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 38 ms. Remains : 235/527 places, 223/497 transitions.
Incomplete random walk after 10000 steps, including 1330 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 827 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 532826 steps, run timeout after 3001 ms. (steps per millisecond=177 ) properties seen :{}
Probabilistic random walk after 532826 steps, saw 266570 distinct states, run finished after 3001 ms. (steps per millisecond=177 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 223 rows 235 cols
[2023-03-09 06:41:41] [INFO ] Computed 49 place invariants in 14 ms
[2023-03-09 06:41:41] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 06:41:41] [INFO ] [Real]Absence check using 2 positive and 47 generalized place invariants in 27 ms returned sat
[2023-03-09 06:41:41] [INFO ] After 244ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 06:41:41] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 06:41:41] [INFO ] [Nat]Absence check using 2 positive and 47 generalized place invariants in 25 ms returned sat
[2023-03-09 06:41:41] [INFO ] After 146ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 06:41:41] [INFO ] State equation strengthened by 37 read => feed constraints.
[2023-03-09 06:41:41] [INFO ] After 113ms SMT Verify possible using 37 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 06:41:41] [INFO ] After 148ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 20 ms.
[2023-03-09 06:41:41] [INFO ] After 400ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 5 ms.
Support contains 2 out of 235 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 235/235 places, 223/223 transitions.
Applied a total of 0 rules in 4 ms. Remains 235 /235 variables (removed 0) and now considering 223/223 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 235/235 places, 223/223 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 235/235 places, 223/223 transitions.
Applied a total of 0 rules in 4 ms. Remains 235 /235 variables (removed 0) and now considering 223/223 (removed 0) transitions.
[2023-03-09 06:41:41] [INFO ] Invariant cache hit.
[2023-03-09 06:41:42] [INFO ] Implicit Places using invariants in 570 ms returned [20, 26, 47, 52, 73, 79, 99, 105, 126, 131, 132, 152, 157, 179, 185, 192, 226, 232]
Discarding 18 places :
Implicit Place search using SMT only with invariants took 572 ms to find 18 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 217/235 places, 223/223 transitions.
Free-agglomeration rule (complex) applied 8 times.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 217 transition count 215
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 16 place count 209 transition count 215
Applied a total of 16 rules in 8 ms. Remains 209 /217 variables (removed 8) and now considering 215/223 (removed 8) transitions.
// Phase 1: matrix 215 rows 209 cols
[2023-03-09 06:41:42] [INFO ] Computed 31 place invariants in 11 ms
[2023-03-09 06:41:42] [INFO ] Implicit Places using invariants in 263 ms returned []
[2023-03-09 06:41:42] [INFO ] Invariant cache hit.
[2023-03-09 06:41:42] [INFO ] State equation strengthened by 37 read => feed constraints.
[2023-03-09 06:41:44] [INFO ] Implicit Places using invariants and state equation in 1849 ms returned []
Implicit Place search using SMT with State Equation took 2114 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 209/235 places, 215/223 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 2699 ms. Remains : 209/235 places, 215/223 transitions.
Incomplete random walk after 10000 steps, including 1439 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 942 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 570224 steps, run timeout after 3001 ms. (steps per millisecond=190 ) properties seen :{}
Probabilistic random walk after 570224 steps, saw 285193 distinct states, run finished after 3001 ms. (steps per millisecond=190 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-09 06:41:47] [INFO ] Invariant cache hit.
[2023-03-09 06:41:47] [INFO ] [Real]Absence check using 13 positive place invariants in 16 ms returned sat
[2023-03-09 06:41:47] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 6 ms returned sat
[2023-03-09 06:41:47] [INFO ] After 226ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 06:41:47] [INFO ] [Nat]Absence check using 13 positive place invariants in 16 ms returned sat
[2023-03-09 06:41:47] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 5 ms returned sat
[2023-03-09 06:41:48] [INFO ] After 170ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 06:41:48] [INFO ] State equation strengthened by 37 read => feed constraints.
[2023-03-09 06:41:48] [INFO ] After 79ms SMT Verify possible using 37 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 06:41:48] [INFO ] Deduced a trap composed of 13 places in 69 ms of which 1 ms to minimize.
[2023-03-09 06:41:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 92 ms
[2023-03-09 06:41:48] [INFO ] After 184ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 16 ms.
[2023-03-09 06:41:48] [INFO ] After 443ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 4 ms.
Support contains 2 out of 209 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 209/209 places, 215/215 transitions.
Applied a total of 0 rules in 3 ms. Remains 209 /209 variables (removed 0) and now considering 215/215 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 209/209 places, 215/215 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 209/209 places, 215/215 transitions.
Applied a total of 0 rules in 3 ms. Remains 209 /209 variables (removed 0) and now considering 215/215 (removed 0) transitions.
[2023-03-09 06:41:48] [INFO ] Invariant cache hit.
[2023-03-09 06:41:48] [INFO ] Implicit Places using invariants in 267 ms returned []
[2023-03-09 06:41:48] [INFO ] Invariant cache hit.
[2023-03-09 06:41:48] [INFO ] State equation strengthened by 37 read => feed constraints.
[2023-03-09 06:41:50] [INFO ] Implicit Places using invariants and state equation in 1741 ms returned []
Implicit Place search using SMT with State Equation took 2010 ms to find 0 implicit places.
[2023-03-09 06:41:50] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-09 06:41:50] [INFO ] Invariant cache hit.
[2023-03-09 06:41:50] [INFO ] Dead Transitions using invariants and state equation in 212 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2234 ms. Remains : 209/209 places, 215/215 transitions.
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 17 Pre rules applied. Total rules applied 0 place count 209 transition count 198
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 0 with 34 rules applied. Total rules applied 34 place count 192 transition count 198
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 43 place count 183 transition count 189
Iterating global reduction 0 with 9 rules applied. Total rules applied 52 place count 183 transition count 189
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 54 place count 182 transition count 188
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 56 place count 182 transition count 186
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 58 place count 180 transition count 186
Applied a total of 58 rules in 15 ms. Remains 180 /209 variables (removed 29) and now considering 186/215 (removed 29) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 186 rows 180 cols
[2023-03-09 06:41:50] [INFO ] Computed 31 place invariants in 9 ms
[2023-03-09 06:41:50] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-09 06:41:50] [INFO ] [Real]Absence check using 5 positive and 26 generalized place invariants in 10 ms returned sat
[2023-03-09 06:41:50] [INFO ] After 182ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 06:41:50] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-09 06:41:50] [INFO ] [Nat]Absence check using 5 positive and 26 generalized place invariants in 10 ms returned sat
[2023-03-09 06:41:50] [INFO ] After 151ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 06:41:50] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 06:41:50] [INFO ] After 12ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 06:41:51] [INFO ] Deduced a trap composed of 17 places in 59 ms of which 1 ms to minimize.
[2023-03-09 06:41:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 81 ms
[2023-03-09 06:41:51] [INFO ] After 105ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 12 ms.
[2023-03-09 06:41:51] [INFO ] After 329ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (X (NOT (OR p0 p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 164 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 143 ms :[p2, p2, p2, p2, true]
Stuttering acceptance computed with spot in 151 ms :[p2, p2, p2, p2, true]
Support contains 2 out of 527 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 527/527 places, 497/497 transitions.
Applied a total of 0 rules in 12 ms. Remains 527 /527 variables (removed 0) and now considering 497/497 (removed 0) transitions.
// Phase 1: matrix 497 rows 527 cols
[2023-03-09 06:41:51] [INFO ] Computed 49 place invariants in 24 ms
[2023-03-09 06:41:51] [INFO ] Implicit Places using invariants in 340 ms returned []
[2023-03-09 06:41:51] [INFO ] Invariant cache hit.
[2023-03-09 06:41:54] [INFO ] Implicit Places using invariants and state equation in 3042 ms returned []
Implicit Place search using SMT with State Equation took 3385 ms to find 0 implicit places.
[2023-03-09 06:41:54] [INFO ] Invariant cache hit.
[2023-03-09 06:41:55] [INFO ] Dead Transitions using invariants and state equation in 359 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3757 ms. Remains : 527/527 places, 497/497 transitions.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 895 edges and 527 vertex of which 525 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Computed a total of 7 stabilizing places and 7 stable transitions
Knowledge obtained : [(NOT p2), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 78 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 164 ms :[p2, p2, p2, p2, true]
Incomplete random walk after 10000 steps, including 326 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 294 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 341019 steps, run timeout after 3001 ms. (steps per millisecond=113 ) properties seen :{}
Probabilistic random walk after 341019 steps, saw 170546 distinct states, run finished after 3001 ms. (steps per millisecond=113 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-09 06:41:58] [INFO ] Invariant cache hit.
[2023-03-09 06:41:58] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 06:41:58] [INFO ] [Real]Absence check using 2 positive and 47 generalized place invariants in 19 ms returned sat
[2023-03-09 06:41:59] [INFO ] After 557ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 06:41:59] [INFO ] Deduced a trap composed of 67 places in 146 ms of which 1 ms to minimize.
[2023-03-09 06:41:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 210 ms
[2023-03-09 06:41:59] [INFO ] After 812ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 06:41:59] [INFO ] After 937ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 06:41:59] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-09 06:41:59] [INFO ] [Nat]Absence check using 2 positive and 47 generalized place invariants in 21 ms returned sat
[2023-03-09 06:42:00] [INFO ] After 510ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 06:42:00] [INFO ] Deduced a trap composed of 67 places in 147 ms of which 0 ms to minimize.
[2023-03-09 06:42:00] [INFO ] Deduced a trap composed of 53 places in 153 ms of which 1 ms to minimize.
[2023-03-09 06:42:00] [INFO ] Deduced a trap composed of 95 places in 161 ms of which 0 ms to minimize.
[2023-03-09 06:42:00] [INFO ] Deduced a trap composed of 89 places in 159 ms of which 0 ms to minimize.
[2023-03-09 06:42:01] [INFO ] Deduced a trap composed of 55 places in 162 ms of which 0 ms to minimize.
[2023-03-09 06:42:01] [INFO ] Deduced a trap composed of 41 places in 243 ms of which 0 ms to minimize.
[2023-03-09 06:42:01] [INFO ] Deduced a trap composed of 43 places in 167 ms of which 0 ms to minimize.
[2023-03-09 06:42:01] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1408 ms
[2023-03-09 06:42:01] [INFO ] After 1947ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 38 ms.
[2023-03-09 06:42:01] [INFO ] After 2108ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 12 ms.
Support contains 2 out of 527 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 527/527 places, 497/497 transitions.
Graph (complete) has 895 edges and 527 vertex of which 525 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 118 transitions
Trivial Post-agglo rules discarded 118 transitions
Performed 118 trivial Post agglomeration. Transition count delta: 118
Iterating post reduction 0 with 119 rules applied. Total rules applied 120 place count 525 transition count 377
Reduce places removed 118 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 120 rules applied. Total rules applied 240 place count 407 transition count 375
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 242 place count 405 transition count 375
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 22 Pre rules applied. Total rules applied 242 place count 405 transition count 353
Deduced a syphon composed of 22 places in 2 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 3 with 44 rules applied. Total rules applied 286 place count 383 transition count 353
Performed 90 Post agglomeration using F-continuation condition.Transition count delta: 90
Deduced a syphon composed of 90 places in 0 ms
Reduce places removed 90 places and 0 transitions.
Iterating global reduction 3 with 180 rules applied. Total rules applied 466 place count 293 transition count 263
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 36 rules applied. Total rules applied 502 place count 275 transition count 263
Free-agglomeration rule (complex) applied 39 times.
Iterating global reduction 3 with 39 rules applied. Total rules applied 541 place count 275 transition count 224
Reduce places removed 39 places and 0 transitions.
Iterating post reduction 3 with 39 rules applied. Total rules applied 580 place count 236 transition count 224
Partial Free-agglomeration rule applied 40 times.
Drop transitions removed 40 transitions
Iterating global reduction 4 with 40 rules applied. Total rules applied 620 place count 236 transition count 224
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 621 place count 235 transition count 223
Applied a total of 621 rules in 47 ms. Remains 235 /527 variables (removed 292) and now considering 223/497 (removed 274) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 48 ms. Remains : 235/527 places, 223/497 transitions.
Incomplete random walk after 10000 steps, including 1301 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 817 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 532900 steps, run timeout after 3001 ms. (steps per millisecond=177 ) properties seen :{}
Probabilistic random walk after 532900 steps, saw 266607 distinct states, run finished after 3001 ms. (steps per millisecond=177 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 223 rows 235 cols
[2023-03-09 06:42:04] [INFO ] Computed 49 place invariants in 13 ms
[2023-03-09 06:42:04] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 06:42:04] [INFO ] [Real]Absence check using 2 positive and 47 generalized place invariants in 26 ms returned sat
[2023-03-09 06:42:04] [INFO ] After 235ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 06:42:05] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 06:42:05] [INFO ] [Nat]Absence check using 2 positive and 47 generalized place invariants in 25 ms returned sat
[2023-03-09 06:42:05] [INFO ] After 142ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 06:42:05] [INFO ] State equation strengthened by 37 read => feed constraints.
[2023-03-09 06:42:05] [INFO ] After 103ms SMT Verify possible using 37 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 06:42:05] [INFO ] After 135ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 18 ms.
[2023-03-09 06:42:05] [INFO ] After 379ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 5 ms.
Support contains 2 out of 235 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 235/235 places, 223/223 transitions.
Applied a total of 0 rules in 4 ms. Remains 235 /235 variables (removed 0) and now considering 223/223 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 235/235 places, 223/223 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 235/235 places, 223/223 transitions.
Applied a total of 0 rules in 4 ms. Remains 235 /235 variables (removed 0) and now considering 223/223 (removed 0) transitions.
[2023-03-09 06:42:05] [INFO ] Invariant cache hit.
[2023-03-09 06:42:06] [INFO ] Implicit Places using invariants in 661 ms returned [20, 26, 47, 52, 73, 79, 99, 105, 126, 131, 132, 152, 157, 179, 185, 192, 226, 232]
Discarding 18 places :
Implicit Place search using SMT only with invariants took 663 ms to find 18 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 217/235 places, 223/223 transitions.
Free-agglomeration rule (complex) applied 8 times.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 217 transition count 215
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 16 place count 209 transition count 215
Applied a total of 16 rules in 13 ms. Remains 209 /217 variables (removed 8) and now considering 215/223 (removed 8) transitions.
// Phase 1: matrix 215 rows 209 cols
[2023-03-09 06:42:06] [INFO ] Computed 31 place invariants in 15 ms
[2023-03-09 06:42:06] [INFO ] Implicit Places using invariants in 370 ms returned []
[2023-03-09 06:42:06] [INFO ] Invariant cache hit.
[2023-03-09 06:42:06] [INFO ] State equation strengthened by 37 read => feed constraints.
[2023-03-09 06:42:08] [INFO ] Implicit Places using invariants and state equation in 1873 ms returned []
Implicit Place search using SMT with State Equation took 2244 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 209/235 places, 215/223 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 2927 ms. Remains : 209/235 places, 215/223 transitions.
Incomplete random walk after 10000 steps, including 1422 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 921 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 552415 steps, run timeout after 3001 ms. (steps per millisecond=184 ) properties seen :{}
Probabilistic random walk after 552415 steps, saw 276283 distinct states, run finished after 3001 ms. (steps per millisecond=184 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-09 06:42:11] [INFO ] Invariant cache hit.
[2023-03-09 06:42:11] [INFO ] [Real]Absence check using 13 positive place invariants in 16 ms returned sat
[2023-03-09 06:42:11] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 6 ms returned sat
[2023-03-09 06:42:11] [INFO ] After 266ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 06:42:11] [INFO ] [Nat]Absence check using 13 positive place invariants in 25 ms returned sat
[2023-03-09 06:42:11] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 8 ms returned sat
[2023-03-09 06:42:11] [INFO ] After 254ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 06:42:11] [INFO ] State equation strengthened by 37 read => feed constraints.
[2023-03-09 06:42:12] [INFO ] After 127ms SMT Verify possible using 37 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 06:42:12] [INFO ] Deduced a trap composed of 13 places in 100 ms of which 0 ms to minimize.
[2023-03-09 06:42:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 135 ms
[2023-03-09 06:42:12] [INFO ] After 282ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 25 ms.
[2023-03-09 06:42:12] [INFO ] After 675ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 7 ms.
Support contains 2 out of 209 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 209/209 places, 215/215 transitions.
Applied a total of 0 rules in 5 ms. Remains 209 /209 variables (removed 0) and now considering 215/215 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 209/209 places, 215/215 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 209/209 places, 215/215 transitions.
Applied a total of 0 rules in 6 ms. Remains 209 /209 variables (removed 0) and now considering 215/215 (removed 0) transitions.
[2023-03-09 06:42:12] [INFO ] Invariant cache hit.
[2023-03-09 06:42:12] [INFO ] Implicit Places using invariants in 300 ms returned []
[2023-03-09 06:42:12] [INFO ] Invariant cache hit.
[2023-03-09 06:42:12] [INFO ] State equation strengthened by 37 read => feed constraints.
[2023-03-09 06:42:14] [INFO ] Implicit Places using invariants and state equation in 2395 ms returned []
Implicit Place search using SMT with State Equation took 2706 ms to find 0 implicit places.
[2023-03-09 06:42:15] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-09 06:42:15] [INFO ] Invariant cache hit.
[2023-03-09 06:42:15] [INFO ] Dead Transitions using invariants and state equation in 242 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2962 ms. Remains : 209/209 places, 215/215 transitions.
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 17 Pre rules applied. Total rules applied 0 place count 209 transition count 198
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 0 with 34 rules applied. Total rules applied 34 place count 192 transition count 198
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 43 place count 183 transition count 189
Iterating global reduction 0 with 9 rules applied. Total rules applied 52 place count 183 transition count 189
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 54 place count 182 transition count 188
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 56 place count 182 transition count 186
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 58 place count 180 transition count 186
Applied a total of 58 rules in 15 ms. Remains 180 /209 variables (removed 29) and now considering 186/215 (removed 29) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 186 rows 180 cols
[2023-03-09 06:42:15] [INFO ] Computed 31 place invariants in 10 ms
[2023-03-09 06:42:15] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-09 06:42:15] [INFO ] [Real]Absence check using 5 positive and 26 generalized place invariants in 10 ms returned sat
[2023-03-09 06:42:15] [INFO ] After 197ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 06:42:15] [INFO ] [Nat]Absence check using 5 positive place invariants in 4 ms returned sat
[2023-03-09 06:42:15] [INFO ] [Nat]Absence check using 5 positive and 26 generalized place invariants in 14 ms returned sat
[2023-03-09 06:42:15] [INFO ] After 226ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 06:42:15] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 06:42:15] [INFO ] After 19ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 06:42:15] [INFO ] Deduced a trap composed of 17 places in 91 ms of which 1 ms to minimize.
[2023-03-09 06:42:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 122 ms
[2023-03-09 06:42:15] [INFO ] After 158ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 20 ms.
[2023-03-09 06:42:15] [INFO ] After 485ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(NOT p2), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 122 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 198 ms :[p2, p2, p2, p2, true]
Stuttering acceptance computed with spot in 195 ms :[p2, p2, p2, p2, true]
Stuttering acceptance computed with spot in 177 ms :[p2, p2, p2, p2, true]
Product exploration explored 100000 steps with 25000 reset in 459 ms.
Product exploration explored 100000 steps with 25000 reset in 343 ms.
Applying partial POR strategy [true, false, false, false, true]
Stuttering acceptance computed with spot in 149 ms :[p2, p2, p2, p2, true]
Support contains 2 out of 527 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 527/527 places, 497/497 transitions.
Graph (complete) has 895 edges and 527 vertex of which 526 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Performed 117 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 117 rules applied. Total rules applied 118 place count 526 transition count 496
Performed 23 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 23 Pre rules applied. Total rules applied 118 place count 526 transition count 515
Deduced a syphon composed of 140 places in 3 ms
Iterating global reduction 1 with 23 rules applied. Total rules applied 141 place count 526 transition count 515
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 145 place count 522 transition count 511
Deduced a syphon composed of 136 places in 3 ms
Iterating global reduction 1 with 4 rules applied. Total rules applied 149 place count 522 transition count 511
Performed 90 Post agglomeration using F-continuation condition.Transition count delta: -18
Deduced a syphon composed of 226 places in 2 ms
Iterating global reduction 1 with 90 rules applied. Total rules applied 239 place count 522 transition count 529
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 240 place count 521 transition count 528
Deduced a syphon composed of 225 places in 2 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 241 place count 521 transition count 528
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: -120
Deduced a syphon composed of 245 places in 2 ms
Iterating global reduction 1 with 20 rules applied. Total rules applied 261 place count 521 transition count 648
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 282 place count 500 transition count 606
Deduced a syphon composed of 224 places in 1 ms
Iterating global reduction 1 with 21 rules applied. Total rules applied 303 place count 500 transition count 606
Deduced a syphon composed of 224 places in 2 ms
Applied a total of 303 rules in 131 ms. Remains 500 /527 variables (removed 27) and now considering 606/497 (removed -109) transitions.
[2023-03-09 06:42:17] [INFO ] Redundant transitions in 4 ms returned []
// Phase 1: matrix 606 rows 500 cols
[2023-03-09 06:42:17] [INFO ] Computed 49 place invariants in 32 ms
[2023-03-09 06:42:18] [INFO ] Dead Transitions using invariants and state equation in 498 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 500/527 places, 606/497 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 643 ms. Remains : 500/527 places, 606/497 transitions.
Support contains 2 out of 527 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 527/527 places, 497/497 transitions.
Applied a total of 0 rules in 19 ms. Remains 527 /527 variables (removed 0) and now considering 497/497 (removed 0) transitions.
// Phase 1: matrix 497 rows 527 cols
[2023-03-09 06:42:18] [INFO ] Computed 49 place invariants in 22 ms
[2023-03-09 06:42:18] [INFO ] Implicit Places using invariants in 338 ms returned []
[2023-03-09 06:42:18] [INFO ] Invariant cache hit.
[2023-03-09 06:42:21] [INFO ] Implicit Places using invariants and state equation in 2851 ms returned []
Implicit Place search using SMT with State Equation took 3191 ms to find 0 implicit places.
[2023-03-09 06:42:21] [INFO ] Invariant cache hit.
[2023-03-09 06:42:22] [INFO ] Dead Transitions using invariants and state equation in 413 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3624 ms. Remains : 527/527 places, 497/497 transitions.
Treatment of property DoubleExponent-PT-010-LTLFireability-15 finished in 55146 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(((p0||G(p1)) U X(!p2)))))'
[2023-03-09 06:42:22] [INFO ] Flatten gal took : 37 ms
[2023-03-09 06:42:22] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/LTLFireability.sr.xml took 1 ms.
[2023-03-09 06:42:22] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 527 places, 497 transitions and 1392 arcs took 11 ms.
Total runtime 371060 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT DoubleExponent-PT-010
BK_EXAMINATION: LTLFireability
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/372
LTLFireability
FORMULA DoubleExponent-PT-010-LTLFireability-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
BK_STOP 1678344203926
--------------------
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.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/372/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/372/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/372/LTLFireability.xml
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: LAUNCH task # 4 (type EXCL) for 3 DoubleExponent-PT-010-LTLFireability-12
lola: time limit : 1200 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DoubleExponent-PT-010-LTLFireability-01: LTL 0 1 0 0 1 0 0 0
DoubleExponent-PT-010-LTLFireability-12: LTL 0 0 1 0 1 0 0 0
DoubleExponent-PT-010-LTLFireability-15: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 5/1200 6/32 DoubleExponent-PT-010-LTLFireability-12 834200 m, 166840 m/sec, 983275 t fired, .
Time elapsed: 5 secs. Pages in use: 6
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DoubleExponent-PT-010-LTLFireability-01: LTL 0 1 0 0 1 0 0 0
DoubleExponent-PT-010-LTLFireability-12: LTL 0 0 1 0 1 0 0 0
DoubleExponent-PT-010-LTLFireability-15: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 10/1200 12/32 DoubleExponent-PT-010-LTLFireability-12 1670790 m, 167318 m/sec, 1970697 t fired, .
Time elapsed: 10 secs. Pages in use: 12
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DoubleExponent-PT-010-LTLFireability-01: LTL 0 1 0 0 1 0 0 0
DoubleExponent-PT-010-LTLFireability-12: LTL 0 0 1 0 1 0 0 0
DoubleExponent-PT-010-LTLFireability-15: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 15/1200 17/32 DoubleExponent-PT-010-LTLFireability-12 2501671 m, 166176 m/sec, 2951491 t fired, .
Time elapsed: 15 secs. Pages in use: 17
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DoubleExponent-PT-010-LTLFireability-01: LTL 0 1 0 0 1 0 0 0
DoubleExponent-PT-010-LTLFireability-12: LTL 0 0 1 0 1 0 0 0
DoubleExponent-PT-010-LTLFireability-15: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 20/1200 23/32 DoubleExponent-PT-010-LTLFireability-12 3343043 m, 168274 m/sec, 3944591 t fired, .
Time elapsed: 20 secs. Pages in use: 23
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DoubleExponent-PT-010-LTLFireability-01: LTL 0 1 0 0 1 0 0 0
DoubleExponent-PT-010-LTLFireability-12: LTL 0 0 1 0 1 0 0 0
DoubleExponent-PT-010-LTLFireability-15: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 25/1200 28/32 DoubleExponent-PT-010-LTLFireability-12 4184579 m, 168307 m/sec, 4937975 t fired, .
Time elapsed: 25 secs. Pages in use: 28
# running tasks: 1 of 4 Visible: 3
lola: CANCELED task # 4 (type EXCL) for DoubleExponent-PT-010-LTLFireability-12 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DoubleExponent-PT-010-LTLFireability-01: LTL 0 1 0 0 1 0 0 0
DoubleExponent-PT-010-LTLFireability-12: LTL 0 0 0 0 1 0 1 0
DoubleExponent-PT-010-LTLFireability-15: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
Time elapsed: 30 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
lola: LAUNCH task # 7 (type EXCL) for 6 DoubleExponent-PT-010-LTLFireability-15
lola: time limit : 1785 sec
lola: memory limit: 32 pages
lola: FINISHED task # 7 (type EXCL) for DoubleExponent-PT-010-LTLFireability-15
lola: result : true
lola: markings : 6
lola: fired transitions : 5
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 1 (type EXCL) for 0 DoubleExponent-PT-010-LTLFireability-01
lola: time limit : 3570 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
DoubleExponent-PT-010-LTLFireability-15: LTL true LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DoubleExponent-PT-010-LTLFireability-01: LTL 0 0 1 0 1 0 0 0
DoubleExponent-PT-010-LTLFireability-12: LTL 0 0 0 0 1 0 1 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 5/3570 6/32 DoubleExponent-PT-010-LTLFireability-01 840490 m, 168098 m/sec, 1039615 t fired, .
Time elapsed: 35 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
DoubleExponent-PT-010-LTLFireability-15: LTL true LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DoubleExponent-PT-010-LTLFireability-01: LTL 0 0 1 0 1 0 0 0
DoubleExponent-PT-010-LTLFireability-12: LTL 0 0 0 0 1 0 1 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 10/3570 12/32 DoubleExponent-PT-010-LTLFireability-01 1668564 m, 165614 m/sec, 2066282 t fired, .
Time elapsed: 40 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
DoubleExponent-PT-010-LTLFireability-15: LTL true LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DoubleExponent-PT-010-LTLFireability-01: LTL 0 0 1 0 1 0 0 0
DoubleExponent-PT-010-LTLFireability-12: LTL 0 0 0 0 1 0 1 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 15/3570 17/32 DoubleExponent-PT-010-LTLFireability-01 2492955 m, 164878 m/sec, 3088348 t fired, .
Time elapsed: 45 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
DoubleExponent-PT-010-LTLFireability-15: LTL true LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DoubleExponent-PT-010-LTLFireability-01: LTL 0 0 1 0 1 0 0 0
DoubleExponent-PT-010-LTLFireability-12: LTL 0 0 0 0 1 0 1 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 20/3570 22/32 DoubleExponent-PT-010-LTLFireability-01 3314614 m, 164331 m/sec, 4107330 t fired, .
Time elapsed: 50 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
DoubleExponent-PT-010-LTLFireability-15: LTL true LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DoubleExponent-PT-010-LTLFireability-01: LTL 0 0 1 0 1 0 0 0
DoubleExponent-PT-010-LTLFireability-12: LTL 0 0 0 0 1 0 1 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 25/3570 28/32 DoubleExponent-PT-010-LTLFireability-01 4133000 m, 163677 m/sec, 5122181 t fired, .
Time elapsed: 55 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
lola: CANCELED task # 1 (type EXCL) for DoubleExponent-PT-010-LTLFireability-01 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
DoubleExponent-PT-010-LTLFireability-15: LTL true LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DoubleExponent-PT-010-LTLFireability-01: LTL 0 0 0 0 1 0 1 0
DoubleExponent-PT-010-LTLFireability-12: LTL 0 0 0 0 1 0 1 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
Time elapsed: 60 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
lola: Portfolio finished: no open tasks 3
FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
DoubleExponent-PT-010-LTLFireability-01: LTL unknown AGGR
DoubleExponent-PT-010-LTLFireability-12: LTL unknown AGGR
DoubleExponent-PT-010-LTLFireability-15: LTL true LTL model checker
Time elapsed: 60 secs. Pages in use: 32
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="DoubleExponent-PT-010"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="lolaxred"
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-5348"
echo " Executing tool lolaxred"
echo " Input is DoubleExponent-PT-010, 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 r135-smll-167819414500476"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/DoubleExponent-PT-010.tgz
mv DoubleExponent-PT-010 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 ;