About the Execution of LTSMin+red for RERS2020-PT-pb107
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 9710.203 | 3600000.00 | 3940780.00 | 7576.00 | ??FFTFFF?????FF? | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2023-input.r329-tall-167889201800268.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 ltsminxred
Input is RERS2020-PT-pb107, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r329-tall-167889201800268
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 59M
-rw-r--r-- 1 mcc users 6.9K Feb 26 08:35 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K Feb 26 08:35 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Feb 26 08:30 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Feb 26 08:30 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:40 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 16:40 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Feb 25 16:40 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Feb 25 16:40 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.4K Feb 26 08:40 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 93K Feb 26 08:40 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 10K Feb 26 08:38 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 73K Feb 26 08:38 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:40 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:40 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 59M Mar 5 18:23 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 RERS2020-PT-pb107-LTLFireability-00
FORMULA_NAME RERS2020-PT-pb107-LTLFireability-01
FORMULA_NAME RERS2020-PT-pb107-LTLFireability-02
FORMULA_NAME RERS2020-PT-pb107-LTLFireability-03
FORMULA_NAME RERS2020-PT-pb107-LTLFireability-04
FORMULA_NAME RERS2020-PT-pb107-LTLFireability-05
FORMULA_NAME RERS2020-PT-pb107-LTLFireability-06
FORMULA_NAME RERS2020-PT-pb107-LTLFireability-07
FORMULA_NAME RERS2020-PT-pb107-LTLFireability-08
FORMULA_NAME RERS2020-PT-pb107-LTLFireability-09
FORMULA_NAME RERS2020-PT-pb107-LTLFireability-10
FORMULA_NAME RERS2020-PT-pb107-LTLFireability-11
FORMULA_NAME RERS2020-PT-pb107-LTLFireability-12
FORMULA_NAME RERS2020-PT-pb107-LTLFireability-13
FORMULA_NAME RERS2020-PT-pb107-LTLFireability-14
FORMULA_NAME RERS2020-PT-pb107-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1679101192218
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=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=RERS2020-PT-pb107
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-18 00:59:53] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-18 00:59:53] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-18 00:59:55] [INFO ] Load time of PNML (sax parser for PT used): 1737 ms
[2023-03-18 00:59:55] [INFO ] Transformed 1382 places.
[2023-03-18 00:59:55] [INFO ] Transformed 104643 transitions.
[2023-03-18 00:59:55] [INFO ] Found NUPN structural information;
[2023-03-18 00:59:56] [INFO ] Parsed PT model containing 1382 places and 104643 transitions and 417030 arcs in 2344 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 24 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Ensure Unique test removed 11427 transitions
Reduce redundant transitions removed 11427 transitions.
FORMULA RERS2020-PT-pb107-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RERS2020-PT-pb107-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 66 out of 1382 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1382/1382 places, 93216/93216 transitions.
Ensure Unique test removed 12 places
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 0 with 13 rules applied. Total rules applied 13 place count 1369 transition count 93216
Applied a total of 13 rules in 350 ms. Remains 1369 /1382 variables (removed 13) and now considering 93216/93216 (removed 0) transitions.
[2023-03-18 00:59:57] [INFO ] Flow matrix only has 62870 transitions (discarded 30346 similar events)
// Phase 1: matrix 62870 rows 1369 cols
[2023-03-18 00:59:57] [INFO ] Computed 12 place invariants in 421 ms
[2023-03-18 01:00:01] [INFO ] Implicit Places using invariants in 4041 ms returned []
Implicit Place search using SMT only with invariants took 4068 ms to find 0 implicit places.
[2023-03-18 01:00:01] [INFO ] Flow matrix only has 62870 transitions (discarded 30346 similar events)
[2023-03-18 01:00:01] [INFO ] Invariant cache hit.
[2023-03-18 01:00:31] [INFO ] Performed 91174/93216 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-18 01:00:32] [INFO ] Dead Transitions using invariants and state equation in 31001 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1369/1382 places, 93216/93216 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 35441 ms. Remains : 1369/1382 places, 93216/93216 transitions.
Support contains 66 out of 1369 places after structural reductions.
[2023-03-18 01:00:35] [INFO ] Flatten gal took : 2572 ms
[2023-03-18 01:00:38] [INFO ] Flatten gal took : 2332 ms
[2023-03-18 01:00:42] [INFO ] Input system was already deterministic with 93216 transitions.
Support contains 62 out of 1369 places (down from 66) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1017 ms. (steps per millisecond=9 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=32 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=76 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 31) seen :0
Interrupted probabilistic random walk after 9168 steps, run timeout after 3003 ms. (steps per millisecond=3 ) properties seen :{}
Probabilistic random walk after 9168 steps, saw 7515 distinct states, run finished after 3004 ms. (steps per millisecond=3 ) properties seen :0
Running SMT prover for 31 properties.
[2023-03-18 01:00:47] [INFO ] Flow matrix only has 62870 transitions (discarded 30346 similar events)
[2023-03-18 01:00:47] [INFO ] Invariant cache hit.
[2023-03-18 01:00:48] [INFO ] [Real]Absence check using 12 positive place invariants in 12 ms returned sat
[2023-03-18 01:01:12] [INFO ] After 23385ms SMT Verify possible using state equation in real domain returned unsat :2 sat :29
[2023-03-18 01:01:13] [INFO ] State equation strengthened by 3692 read => feed constraints.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:642)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:339)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:71)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-18 01:01:13] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-18 01:01:13] [INFO ] After 25942ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 31 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 56 out of 1369 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1369/1369 places, 93216/93216 transitions.
Drop transitions removed 2811 transitions
Reduce isomorphic transitions removed 2811 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 2812 rules applied. Total rules applied 2812 place count 1369 transition count 90404
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2813 place count 1368 transition count 90404
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 2813 place count 1368 transition count 90402
Deduced a syphon composed of 2 places in 63 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 2817 place count 1366 transition count 90402
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 2819 place count 1366 transition count 90400
Performed 17 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 17 places in 55 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 2853 place count 1349 transition count 90380
Drop transitions removed 6 transitions
Ensure Unique test removed 439 transitions
Reduce isomorphic transitions removed 445 transitions.
Iterating post reduction 3 with 445 rules applied. Total rules applied 3298 place count 1349 transition count 89935
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 57 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 3306 place count 1345 transition count 89931
Drop transitions removed 4 transitions
Ensure Unique test removed 92 transitions
Reduce isomorphic transitions removed 96 transitions.
Iterating post reduction 4 with 96 rules applied. Total rules applied 3402 place count 1345 transition count 89835
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 1 places in 53 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 3404 place count 1344 transition count 89836
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 3407 place count 1344 transition count 89833
Free-agglomeration rule applied 30 times.
Iterating global reduction 6 with 30 rules applied. Total rules applied 3437 place count 1344 transition count 89803
Reduce places removed 30 places and 0 transitions.
Drop transitions removed 42 transitions
Ensure Unique test removed 555 transitions
Reduce isomorphic transitions removed 597 transitions.
Iterating post reduction 6 with 627 rules applied. Total rules applied 4064 place count 1314 transition count 89206
Free-agglomeration rule (complex) applied 14 times with reduction of 16 identical transitions.
Iterating global reduction 7 with 14 rules applied. Total rules applied 4078 place count 1314 transition count 89854
Reduce places removed 14 places and 0 transitions.
Drop transitions removed 5 transitions
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 26 transitions.
Iterating post reduction 7 with 40 rules applied. Total rules applied 4118 place count 1300 transition count 89828
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 4119 place count 1299 transition count 89827
Applied a total of 4119 rules in 4562 ms. Remains 1299 /1369 variables (removed 70) and now considering 89827/93216 (removed 3389) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4566 ms. Remains : 1299/1369 places, 89827/93216 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 732 ms. (steps per millisecond=13 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=21 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 29) seen :0
Interrupted probabilistic random walk after 8715 steps, run timeout after 3001 ms. (steps per millisecond=2 ) properties seen :{}
Probabilistic random walk after 8715 steps, saw 6849 distinct states, run finished after 3002 ms. (steps per millisecond=2 ) properties seen :0
Running SMT prover for 29 properties.
[2023-03-18 01:01:22] [INFO ] Flow matrix only has 62359 transitions (discarded 27468 similar events)
// Phase 1: matrix 62359 rows 1299 cols
[2023-03-18 01:01:22] [INFO ] Computed 12 place invariants in 219 ms
[2023-03-18 01:01:23] [INFO ] [Real]Absence check using 12 positive place invariants in 10 ms returned sat
[2023-03-18 01:01:47] [INFO ] After 23778ms SMT Verify possible using state equation in real domain returned unsat :0 sat :20
[2023-03-18 01:01:48] [INFO ] State equation strengthened by 3684 read => feed constraints.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:642)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:339)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:71)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-18 01:01:48] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-18 01:01:48] [INFO ] After 25737ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 29 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 33 ms.
Support contains 56 out of 1299 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1299/1299 places, 89827/89827 transitions.
Applied a total of 0 rules in 371 ms. Remains 1299 /1299 variables (removed 0) and now considering 89827/89827 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 371 ms. Remains : 1299/1299 places, 89827/89827 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1299/1299 places, 89827/89827 transitions.
Applied a total of 0 rules in 483 ms. Remains 1299 /1299 variables (removed 0) and now considering 89827/89827 (removed 0) transitions.
[2023-03-18 01:01:49] [INFO ] Flow matrix only has 62359 transitions (discarded 27468 similar events)
[2023-03-18 01:01:49] [INFO ] Invariant cache hit.
[2023-03-18 01:01:52] [INFO ] Implicit Places using invariants in 3215 ms returned []
Implicit Place search using SMT only with invariants took 3219 ms to find 0 implicit places.
[2023-03-18 01:01:52] [INFO ] Flow matrix only has 62359 transitions (discarded 27468 similar events)
[2023-03-18 01:01:52] [INFO ] Invariant cache hit.
[2023-03-18 01:02:22] [INFO ] Dead Transitions using invariants and state equation in 29558 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33272 ms. Remains : 1299/1299 places, 89827/89827 transitions.
Graph (trivial) has 27754 edges and 1299 vertex of which 952 / 1299 are part of one of the 144 SCC in 8 ms
Free SCC test removed 808 places
Drop transitions removed 25176 transitions
Ensure Unique test removed 52089 transitions
Reduce isomorphic transitions removed 77265 transitions.
Graph (complete) has 11630 edges and 491 vertex of which 476 are kept as prefixes of interest. Removing 15 places using SCC suffix rule.7 ms
Discarding 15 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Drop transitions removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 0 with 22 rules applied. Total rules applied 24 place count 476 transition count 12538
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 24 place count 476 transition count 12537
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 26 place count 475 transition count 12537
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 29 place count 472 transition count 12525
Iterating global reduction 1 with 3 rules applied. Total rules applied 32 place count 472 transition count 12525
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 38 place count 472 transition count 12519
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 4 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 46 place count 468 transition count 12515
Ensure Unique test removed 73 transitions
Reduce isomorphic transitions removed 73 transitions.
Iterating post reduction 2 with 73 rules applied. Total rules applied 119 place count 468 transition count 12442
Drop transitions removed 5659 transitions
Redundant transition composition rules discarded 5659 transitions
Iterating global reduction 3 with 5659 rules applied. Total rules applied 5778 place count 468 transition count 6783
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 47 transitions
Reduce isomorphic transitions removed 47 transitions.
Graph (complete) has 8059 edges and 465 vertex of which 443 are kept as prefixes of interest. Removing 22 places using SCC suffix rule.3 ms
Discarding 22 places :
Also discarding 7 output transitions
Drop transitions removed 7 transitions
Iterating post reduction 3 with 51 rules applied. Total rules applied 5829 place count 443 transition count 6729
Drop transitions removed 394 transitions
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 409 transitions.
Iterating post reduction 4 with 409 rules applied. Total rules applied 6238 place count 443 transition count 6320
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 6244 place count 437 transition count 6298
Iterating global reduction 5 with 6 rules applied. Total rules applied 6250 place count 437 transition count 6298
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 6254 place count 433 transition count 6282
Iterating global reduction 5 with 4 rules applied. Total rules applied 6258 place count 433 transition count 6282
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 6264 place count 430 transition count 6279
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 6265 place count 430 transition count 6278
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 6267 place count 429 transition count 6291
Drop transitions removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 6 with 21 rules applied. Total rules applied 6288 place count 429 transition count 6270
Free-agglomeration rule applied 9 times with reduction of 3 identical transitions.
Iterating global reduction 6 with 9 rules applied. Total rules applied 6297 place count 429 transition count 6258
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 53 transitions
Reduce isomorphic transitions removed 53 transitions.
Iterating post reduction 6 with 62 rules applied. Total rules applied 6359 place count 420 transition count 6205
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 6361 place count 419 transition count 6216
Drop transitions removed 44 transitions
Redundant transition composition rules discarded 44 transitions
Iterating global reduction 7 with 44 rules applied. Total rules applied 6405 place count 419 transition count 6172
Free-agglomeration rule applied 3 times.
Iterating global reduction 7 with 3 rules applied. Total rules applied 6408 place count 419 transition count 6169
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 7 with 12 rules applied. Total rules applied 6420 place count 416 transition count 6160
Drop transitions removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 8 with 7 rules applied. Total rules applied 6427 place count 416 transition count 6153
Free-agglomeration rule applied 1 times.
Iterating global reduction 8 with 1 rules applied. Total rules applied 6428 place count 416 transition count 6152
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 6429 place count 415 transition count 6152
Drop transitions removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 9 with 11 rules applied. Total rules applied 6440 place count 415 transition count 6141
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 9 with 3 rules applied. Total rules applied 6443 place count 415 transition count 6201
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 9 with 3 rules applied. Total rules applied 6446 place count 412 transition count 6201
Drop transitions removed 31 transitions
Redundant transition composition rules discarded 31 transitions
Iterating global reduction 10 with 31 rules applied. Total rules applied 6477 place count 412 transition count 6170
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 10 with 4 rules applied. Total rules applied 6481 place count 412 transition count 6170
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 10 with 1 rules applied. Total rules applied 6482 place count 412 transition count 6169
Applied a total of 6482 rules in 2495 ms. Remains 412 /1299 variables (removed 887) and now considering 6169/89827 (removed 83658) transitions.
Running SMT prover for 29 properties.
[2023-03-18 01:02:24] [INFO ] Flow matrix only has 6056 transitions (discarded 113 similar events)
// Phase 1: matrix 6056 rows 412 cols
[2023-03-18 01:02:25] [INFO ] Computed 0 place invariants in 58 ms
[2023-03-18 01:02:30] [INFO ] After 5025ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:29
[2023-03-18 01:02:34] [INFO ] After 4297ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :29
[2023-03-18 01:02:34] [INFO ] State equation strengthened by 16 read => feed constraints.
[2023-03-18 01:02:38] [INFO ] After 3440ms SMT Verify possible using 16 Read/Feed constraints in natural domain returned unsat :0 sat :29
[2023-03-18 01:02:43] [INFO ] After 9005ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :29
Attempting to minimize the solution found.
Minimization took 3437 ms.
[2023-03-18 01:02:47] [INFO ] After 17193ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :29
Successfully simplified 2 atomic propositions for a total of 14 simplifications.
Computed a total of 261 stabilizing places and 30825 stable transitions
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((!p0 U (G(!p0)||(!p0&&G(!p1))))))'
Support contains 4 out of 1369 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1369/1369 places, 93216/93216 transitions.
Applied a total of 0 rules in 145 ms. Remains 1369 /1369 variables (removed 0) and now considering 93216/93216 (removed 0) transitions.
[2023-03-18 01:02:47] [INFO ] Flow matrix only has 62870 transitions (discarded 30346 similar events)
// Phase 1: matrix 62870 rows 1369 cols
[2023-03-18 01:02:48] [INFO ] Computed 12 place invariants in 319 ms
[2023-03-18 01:02:52] [INFO ] Implicit Places using invariants in 4034 ms returned []
Implicit Place search using SMT only with invariants took 4038 ms to find 0 implicit places.
[2023-03-18 01:02:52] [INFO ] Flow matrix only has 62870 transitions (discarded 30346 similar events)
[2023-03-18 01:02:52] [INFO ] Invariant cache hit.
[2023-03-18 01:03:22] [INFO ] Performed 87309/93216 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-18 01:03:24] [INFO ] Dead Transitions using invariants and state equation in 32277 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 36464 ms. Remains : 1369/1369 places, 93216/93216 transitions.
Stuttering acceptance computed with spot in 272 ms :[true, p0, p0, (AND p0 p1), p1]
Running random walk in product with property : RERS2020-PT-pb107-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 3}], [{ cond=(AND p1 p0), acceptance={} source=3 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 4}], [{ cond=p1, acceptance={} source=4 dest: 0}, { cond=(NOT p1), acceptance={} source=4 dest: 4}]], initial=1, aps=[p0:(AND (EQ s498 1) (EQ s842 1)), p1:(AND (EQ s16 1) (EQ s1164 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 1 reset in 5105 ms.
Product exploration explored 100000 steps with 3 reset in 5005 ms.
Computed a total of 261 stabilizing places and 30825 stable transitions
Computed a total of 261 stabilizing places and 30825 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p1) (NOT p0))), (X (NOT p0)), (X (NOT (AND p1 (NOT p0)))), true, (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p1 p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p0))), (X (X (NOT (AND p1 (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 350 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter sensitive) to 5 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 171 ms :[true, p0, p0, p1, (AND p0 p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 937 ms. (steps per millisecond=10 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 115 ms. (steps per millisecond=86 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 121 ms. (steps per millisecond=82 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 115 ms. (steps per millisecond=86 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 108 ms. (steps per millisecond=92 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 118 ms. (steps per millisecond=84 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 119 ms. (steps per millisecond=84 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 9199 steps, run timeout after 3001 ms. (steps per millisecond=3 ) properties seen :{}
Probabilistic random walk after 9199 steps, saw 7542 distinct states, run finished after 3002 ms. (steps per millisecond=3 ) properties seen :0
Running SMT prover for 6 properties.
[2023-03-18 01:03:40] [INFO ] Flow matrix only has 62870 transitions (discarded 30346 similar events)
[2023-03-18 01:03:40] [INFO ] Invariant cache hit.
[2023-03-18 01:03:40] [INFO ] [Real]Absence check using 12 positive place invariants in 13 ms returned sat
[2023-03-18 01:04:04] [INFO ] After 23354ms SMT Verify possible using state equation in real domain returned unsat :1 sat :4 real:1
[2023-03-18 01:04:05] [INFO ] State equation strengthened by 3692 read => feed constraints.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:642)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:339)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-18 01:04:05] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-18 01:04:05] [INFO ] After 25034ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 6 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 1369 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1369/1369 places, 93216/93216 transitions.
Drop transitions removed 2811 transitions
Reduce isomorphic transitions removed 2811 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 2812 rules applied. Total rules applied 2812 place count 1369 transition count 90404
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2813 place count 1368 transition count 90404
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 2813 place count 1368 transition count 90402
Deduced a syphon composed of 2 places in 45 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 2817 place count 1366 transition count 90402
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 2819 place count 1366 transition count 90400
Performed 17 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 17 places in 46 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 2853 place count 1349 transition count 90380
Drop transitions removed 6 transitions
Ensure Unique test removed 439 transitions
Reduce isomorphic transitions removed 445 transitions.
Iterating post reduction 3 with 445 rules applied. Total rules applied 3298 place count 1349 transition count 89935
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 45 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 3306 place count 1345 transition count 89931
Drop transitions removed 4 transitions
Ensure Unique test removed 92 transitions
Reduce isomorphic transitions removed 96 transitions.
Iterating post reduction 4 with 96 rules applied. Total rules applied 3402 place count 1345 transition count 89835
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 1 places in 44 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 3404 place count 1344 transition count 89836
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 3407 place count 1344 transition count 89833
Free-agglomeration rule applied 32 times.
Iterating global reduction 6 with 32 rules applied. Total rules applied 3439 place count 1344 transition count 89801
Reduce places removed 32 places and 0 transitions.
Drop transitions removed 44 transitions
Ensure Unique test removed 555 transitions
Reduce isomorphic transitions removed 599 transitions.
Iterating post reduction 6 with 631 rules applied. Total rules applied 4070 place count 1312 transition count 89202
Free-agglomeration rule (complex) applied 15 times with reduction of 16 identical transitions.
Iterating global reduction 7 with 15 rules applied. Total rules applied 4085 place count 1312 transition count 89935
Reduce places removed 15 places and 0 transitions.
Drop transitions removed 5 transitions
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 26 transitions.
Iterating post reduction 7 with 41 rules applied. Total rules applied 4126 place count 1297 transition count 89909
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 4127 place count 1296 transition count 89908
Applied a total of 4127 rules in 4084 ms. Remains 1296 /1369 variables (removed 73) and now considering 89908/93216 (removed 3308) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4102 ms. Remains : 1296/1369 places, 89908/93216 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 663 ms. (steps per millisecond=15 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 9492 steps, run timeout after 3002 ms. (steps per millisecond=3 ) properties seen :{}
Probabilistic random walk after 9492 steps, saw 7541 distinct states, run finished after 3002 ms. (steps per millisecond=3 ) properties seen :0
Running SMT prover for 5 properties.
[2023-03-18 01:04:13] [INFO ] Flow matrix only has 62424 transitions (discarded 27484 similar events)
// Phase 1: matrix 62424 rows 1296 cols
[2023-03-18 01:04:14] [INFO ] Computed 12 place invariants in 214 ms
[2023-03-18 01:04:14] [INFO ] [Real]Absence check using 12 positive place invariants in 11 ms returned sat
[2023-03-18 01:04:38] [INFO ] After 24334ms SMT Verify possible using state equation in real domain returned unsat :0 sat :4 real:1
[2023-03-18 01:04:39] [INFO ] State equation strengthened by 3688 read => feed constraints.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:642)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:339)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-18 01:04:39] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-18 01:04:39] [INFO ] After 25155ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 5 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 25 ms.
Support contains 4 out of 1296 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1296/1296 places, 89908/89908 transitions.
Applied a total of 0 rules in 444 ms. Remains 1296 /1296 variables (removed 0) and now considering 89908/89908 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 444 ms. Remains : 1296/1296 places, 89908/89908 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1296/1296 places, 89908/89908 transitions.
Applied a total of 0 rules in 445 ms. Remains 1296 /1296 variables (removed 0) and now considering 89908/89908 (removed 0) transitions.
[2023-03-18 01:04:40] [INFO ] Flow matrix only has 62424 transitions (discarded 27484 similar events)
[2023-03-18 01:04:40] [INFO ] Invariant cache hit.
[2023-03-18 01:04:44] [INFO ] Implicit Places using invariants in 3810 ms returned []
Implicit Place search using SMT only with invariants took 3811 ms to find 0 implicit places.
[2023-03-18 01:04:44] [INFO ] Flow matrix only has 62424 transitions (discarded 27484 similar events)
[2023-03-18 01:04:44] [INFO ] Invariant cache hit.
[2023-03-18 01:05:14] [INFO ] Performed 85986/89908 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-18 01:05:15] [INFO ] Dead Transitions using invariants and state equation in 31534 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35805 ms. Remains : 1296/1296 places, 89908/89908 transitions.
Graph (trivial) has 31450 edges and 1296 vertex of which 1027 / 1296 are part of one of the 151 SCC in 5 ms
Free SCC test removed 876 places
Drop transitions removed 32345 transitions
Ensure Unique test removed 48684 transitions
Reduce isomorphic transitions removed 81029 transitions.
Graph (complete) has 8473 edges and 420 vertex of which 405 are kept as prefixes of interest. Removing 15 places using SCC suffix rule.4 ms
Discarding 15 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Drop transitions removed 23 transitions
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 42 transitions.
Iterating post reduction 0 with 42 rules applied. Total rules applied 44 place count 405 transition count 8835
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 44 place count 405 transition count 8834
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 46 place count 404 transition count 8834
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 49 place count 401 transition count 8822
Iterating global reduction 1 with 3 rules applied. Total rules applied 52 place count 401 transition count 8822
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 58 place count 401 transition count 8816
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 66 place count 397 transition count 8812
Ensure Unique test removed 73 transitions
Reduce isomorphic transitions removed 73 transitions.
Iterating post reduction 2 with 73 rules applied. Total rules applied 139 place count 397 transition count 8739
Drop transitions removed 4065 transitions
Redundant transition composition rules discarded 4065 transitions
Iterating global reduction 3 with 4065 rules applied. Total rules applied 4204 place count 397 transition count 4674
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 51 transitions
Reduce isomorphic transitions removed 51 transitions.
Graph (complete) has 5359 edges and 394 vertex of which 362 are kept as prefixes of interest. Removing 32 places using SCC suffix rule.2 ms
Discarding 32 places :
Also discarding 7 output transitions
Drop transitions removed 7 transitions
Iterating post reduction 3 with 55 rules applied. Total rules applied 4259 place count 362 transition count 4616
Drop transitions removed 446 transitions
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 458 transitions.
Iterating post reduction 4 with 458 rules applied. Total rules applied 4717 place count 362 transition count 4158
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 4717 place count 362 transition count 4157
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 4719 place count 361 transition count 4157
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 4725 place count 355 transition count 4135
Iterating global reduction 5 with 6 rules applied. Total rules applied 4731 place count 355 transition count 4135
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 4735 place count 351 transition count 4119
Iterating global reduction 5 with 4 rules applied. Total rules applied 4739 place count 351 transition count 4119
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 4747 place count 347 transition count 4115
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 4748 place count 347 transition count 4114
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 4750 place count 346 transition count 4127
Drop transitions removed 22 transitions
Redundant transition composition rules discarded 22 transitions
Iterating global reduction 6 with 22 rules applied. Total rules applied 4772 place count 346 transition count 4105
Free-agglomeration rule applied 18 times with reduction of 5 identical transitions.
Iterating global reduction 6 with 18 rules applied. Total rules applied 4790 place count 346 transition count 4082
Reduce places removed 18 places and 0 transitions.
Ensure Unique test removed 69 transitions
Reduce isomorphic transitions removed 69 transitions.
Iterating post reduction 6 with 87 rules applied. Total rules applied 4877 place count 328 transition count 4013
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 4879 place count 327 transition count 4022
Drop transitions removed 81 transitions
Redundant transition composition rules discarded 81 transitions
Iterating global reduction 7 with 81 rules applied. Total rules applied 4960 place count 327 transition count 3941
Free-agglomeration rule applied 9 times with reduction of 2 identical transitions.
Iterating global reduction 7 with 9 rules applied. Total rules applied 4969 place count 327 transition count 3930
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 7 with 19 rules applied. Total rules applied 4988 place count 318 transition count 3920
Drop transitions removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 8 with 13 rules applied. Total rules applied 5001 place count 318 transition count 3907
Free-agglomeration rule applied 2 times.
Iterating global reduction 8 with 2 rules applied. Total rules applied 5003 place count 318 transition count 3905
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 5005 place count 316 transition count 3905
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 9 with 6 rules applied. Total rules applied 5011 place count 316 transition count 3899
Free-agglomeration rule (complex) applied 7 times with reduction of 11 identical transitions.
Iterating global reduction 9 with 7 rules applied. Total rules applied 5018 place count 316 transition count 3972
Reduce places removed 7 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 8 rules applied. Total rules applied 5026 place count 309 transition count 3971
Drop transitions removed 41 transitions
Redundant transition composition rules discarded 41 transitions
Iterating global reduction 10 with 41 rules applied. Total rules applied 5067 place count 309 transition count 3930
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 10 with 6 rules applied. Total rules applied 5073 place count 309 transition count 3930
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 5074 place count 309 transition count 3929
Applied a total of 5074 rules in 1505 ms. Remains 309 /1296 variables (removed 987) and now considering 3929/89908 (removed 85979) transitions.
Running SMT prover for 5 properties.
[2023-03-18 01:05:17] [INFO ] Flow matrix only has 3814 transitions (discarded 115 similar events)
// Phase 1: matrix 3814 rows 309 cols
[2023-03-18 01:05:17] [INFO ] Computed 0 place invariants in 22 ms
[2023-03-18 01:05:18] [INFO ] After 1073ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-18 01:05:19] [INFO ] After 852ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-18 01:05:19] [INFO ] State equation strengthened by 17 read => feed constraints.
[2023-03-18 01:05:19] [INFO ] After 411ms SMT Verify possible using 17 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-18 01:05:20] [INFO ] After 1074ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 421 ms.
[2023-03-18 01:05:20] [INFO ] After 2435ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p1) (NOT p0))), (X (NOT p0)), (X (NOT (AND p1 (NOT p0)))), true, (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p1 p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p0))), (X (X (NOT (AND p1 (NOT p0))))), (G (NOT (AND p0 p1)))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 368 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter sensitive) to 5 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 153 ms :[true, p0, (AND p0 p1), p0, p1]
Stuttering acceptance computed with spot in 162 ms :[true, p0, (AND p0 p1), p0, p1]
Support contains 4 out of 1369 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1369/1369 places, 93216/93216 transitions.
Applied a total of 0 rules in 147 ms. Remains 1369 /1369 variables (removed 0) and now considering 93216/93216 (removed 0) transitions.
[2023-03-18 01:05:21] [INFO ] Flow matrix only has 62870 transitions (discarded 30346 similar events)
// Phase 1: matrix 62870 rows 1369 cols
[2023-03-18 01:05:21] [INFO ] Computed 12 place invariants in 230 ms
[2023-03-18 01:05:25] [INFO ] Implicit Places using invariants in 3500 ms returned []
Implicit Place search using SMT only with invariants took 3502 ms to find 0 implicit places.
[2023-03-18 01:05:25] [INFO ] Flow matrix only has 62870 transitions (discarded 30346 similar events)
[2023-03-18 01:05:25] [INFO ] Invariant cache hit.
[2023-03-18 01:05:55] [INFO ] Performed 84801/93216 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-18 01:05:58] [INFO ] Dead Transitions using invariants and state equation in 33367 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 37022 ms. Remains : 1369/1369 places, 93216/93216 transitions.
Computed a total of 261 stabilizing places and 30825 stable transitions
Computed a total of 261 stabilizing places and 30825 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), true, (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 384 ms. Reduced automaton from 5 states, 10 edges and 2 AP (stutter sensitive) to 5 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 162 ms :[true, p0, (AND p0 p1), p0, p1]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 875 ms. (steps per millisecond=11 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 5 resets, run finished after 122 ms. (steps per millisecond=81 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 110 ms. (steps per millisecond=90 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 117 ms. (steps per millisecond=85 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 116 ms. (steps per millisecond=86 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 9790 steps, run timeout after 3003 ms. (steps per millisecond=3 ) properties seen :{}
Probabilistic random walk after 9790 steps, saw 7914 distinct states, run finished after 3004 ms. (steps per millisecond=3 ) properties seen :0
Running SMT prover for 4 properties.
[2023-03-18 01:06:04] [INFO ] Flow matrix only has 62870 transitions (discarded 30346 similar events)
[2023-03-18 01:06:04] [INFO ] Invariant cache hit.
[2023-03-18 01:06:04] [INFO ] [Real]Absence check using 12 positive place invariants in 13 ms returned sat
[2023-03-18 01:06:28] [INFO ] After 23543ms SMT Verify possible using state equation in real domain returned unsat :0 sat :4
[2023-03-18 01:06:28] [INFO ] State equation strengthened by 3692 read => feed constraints.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:642)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:339)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-18 01:06:29] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-18 01:06:29] [INFO ] After 25028ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 4 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 1369 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1369/1369 places, 93216/93216 transitions.
Drop transitions removed 2811 transitions
Reduce isomorphic transitions removed 2811 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 2812 rules applied. Total rules applied 2812 place count 1369 transition count 90404
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2813 place count 1368 transition count 90404
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 2813 place count 1368 transition count 90402
Deduced a syphon composed of 2 places in 52 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 2817 place count 1366 transition count 90402
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 2819 place count 1366 transition count 90400
Performed 17 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 17 places in 53 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 2853 place count 1349 transition count 90380
Drop transitions removed 6 transitions
Ensure Unique test removed 439 transitions
Reduce isomorphic transitions removed 445 transitions.
Iterating post reduction 3 with 445 rules applied. Total rules applied 3298 place count 1349 transition count 89935
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 53 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 3306 place count 1345 transition count 89931
Drop transitions removed 4 transitions
Ensure Unique test removed 92 transitions
Reduce isomorphic transitions removed 96 transitions.
Iterating post reduction 4 with 96 rules applied. Total rules applied 3402 place count 1345 transition count 89835
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 1 places in 51 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 3404 place count 1344 transition count 89836
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 3407 place count 1344 transition count 89833
Free-agglomeration rule applied 32 times.
Iterating global reduction 6 with 32 rules applied. Total rules applied 3439 place count 1344 transition count 89801
Reduce places removed 32 places and 0 transitions.
Drop transitions removed 44 transitions
Ensure Unique test removed 555 transitions
Reduce isomorphic transitions removed 599 transitions.
Iterating post reduction 6 with 631 rules applied. Total rules applied 4070 place count 1312 transition count 89202
Free-agglomeration rule (complex) applied 15 times with reduction of 16 identical transitions.
Iterating global reduction 7 with 15 rules applied. Total rules applied 4085 place count 1312 transition count 89935
Reduce places removed 15 places and 0 transitions.
Drop transitions removed 5 transitions
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 26 transitions.
Iterating post reduction 7 with 41 rules applied. Total rules applied 4126 place count 1297 transition count 89909
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 4127 place count 1296 transition count 89908
Applied a total of 4127 rules in 4453 ms. Remains 1296 /1369 variables (removed 73) and now considering 89908/93216 (removed 3308) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4460 ms. Remains : 1296/1369 places, 89908/93216 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 695 ms. (steps per millisecond=14 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 102 ms. (steps per millisecond=98 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 3 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 8653 steps, run timeout after 3002 ms. (steps per millisecond=2 ) properties seen :{}
Probabilistic random walk after 8653 steps, saw 6791 distinct states, run finished after 3002 ms. (steps per millisecond=2 ) properties seen :0
Running SMT prover for 4 properties.
[2023-03-18 01:06:37] [INFO ] Flow matrix only has 62424 transitions (discarded 27484 similar events)
// Phase 1: matrix 62424 rows 1296 cols
[2023-03-18 01:06:37] [INFO ] Computed 12 place invariants in 207 ms
[2023-03-18 01:06:38] [INFO ] [Real]Absence check using 12 positive place invariants in 11 ms returned sat
[2023-03-18 01:07:02] [INFO ] After 23962ms SMT Verify possible using state equation in real domain returned unsat :0 sat :4
[2023-03-18 01:07:02] [INFO ] State equation strengthened by 3688 read => feed constraints.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:642)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:339)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-18 01:07:02] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-18 01:07:02] [INFO ] After 25033ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 4 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 21 ms.
Support contains 4 out of 1296 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1296/1296 places, 89908/89908 transitions.
Applied a total of 0 rules in 497 ms. Remains 1296 /1296 variables (removed 0) and now considering 89908/89908 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 497 ms. Remains : 1296/1296 places, 89908/89908 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1296/1296 places, 89908/89908 transitions.
Applied a total of 0 rules in 469 ms. Remains 1296 /1296 variables (removed 0) and now considering 89908/89908 (removed 0) transitions.
[2023-03-18 01:07:04] [INFO ] Flow matrix only has 62424 transitions (discarded 27484 similar events)
[2023-03-18 01:07:04] [INFO ] Invariant cache hit.
[2023-03-18 01:07:07] [INFO ] Implicit Places using invariants in 3657 ms returned []
Implicit Place search using SMT only with invariants took 3661 ms to find 0 implicit places.
[2023-03-18 01:07:07] [INFO ] Flow matrix only has 62424 transitions (discarded 27484 similar events)
[2023-03-18 01:07:07] [INFO ] Invariant cache hit.
[2023-03-18 01:07:37] [INFO ] Performed 88100/89908 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-18 01:07:38] [INFO ] Dead Transitions using invariants and state equation in 30772 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34918 ms. Remains : 1296/1296 places, 89908/89908 transitions.
Graph (trivial) has 31450 edges and 1296 vertex of which 1027 / 1296 are part of one of the 151 SCC in 4 ms
Free SCC test removed 876 places
Drop transitions removed 32345 transitions
Ensure Unique test removed 48684 transitions
Reduce isomorphic transitions removed 81029 transitions.
Graph (complete) has 8473 edges and 420 vertex of which 405 are kept as prefixes of interest. Removing 15 places using SCC suffix rule.4 ms
Discarding 15 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Drop transitions removed 23 transitions
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 42 transitions.
Iterating post reduction 0 with 42 rules applied. Total rules applied 44 place count 405 transition count 8835
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 44 place count 405 transition count 8834
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 46 place count 404 transition count 8834
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 49 place count 401 transition count 8822
Iterating global reduction 1 with 3 rules applied. Total rules applied 52 place count 401 transition count 8822
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 58 place count 401 transition count 8816
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 66 place count 397 transition count 8812
Ensure Unique test removed 73 transitions
Reduce isomorphic transitions removed 73 transitions.
Iterating post reduction 2 with 73 rules applied. Total rules applied 139 place count 397 transition count 8739
Drop transitions removed 4065 transitions
Redundant transition composition rules discarded 4065 transitions
Iterating global reduction 3 with 4065 rules applied. Total rules applied 4204 place count 397 transition count 4674
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 51 transitions
Reduce isomorphic transitions removed 51 transitions.
Graph (complete) has 5359 edges and 394 vertex of which 362 are kept as prefixes of interest. Removing 32 places using SCC suffix rule.1 ms
Discarding 32 places :
Also discarding 7 output transitions
Drop transitions removed 7 transitions
Iterating post reduction 3 with 55 rules applied. Total rules applied 4259 place count 362 transition count 4616
Drop transitions removed 446 transitions
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 458 transitions.
Iterating post reduction 4 with 458 rules applied. Total rules applied 4717 place count 362 transition count 4158
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 4717 place count 362 transition count 4157
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 4719 place count 361 transition count 4157
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 4725 place count 355 transition count 4135
Iterating global reduction 5 with 6 rules applied. Total rules applied 4731 place count 355 transition count 4135
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 4735 place count 351 transition count 4119
Iterating global reduction 5 with 4 rules applied. Total rules applied 4739 place count 351 transition count 4119
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 4747 place count 347 transition count 4115
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 4748 place count 347 transition count 4114
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 4750 place count 346 transition count 4127
Drop transitions removed 22 transitions
Redundant transition composition rules discarded 22 transitions
Iterating global reduction 6 with 22 rules applied. Total rules applied 4772 place count 346 transition count 4105
Free-agglomeration rule applied 18 times with reduction of 5 identical transitions.
Iterating global reduction 6 with 18 rules applied. Total rules applied 4790 place count 346 transition count 4082
Reduce places removed 18 places and 0 transitions.
Ensure Unique test removed 69 transitions
Reduce isomorphic transitions removed 69 transitions.
Iterating post reduction 6 with 87 rules applied. Total rules applied 4877 place count 328 transition count 4013
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 4879 place count 327 transition count 4022
Drop transitions removed 81 transitions
Redundant transition composition rules discarded 81 transitions
Iterating global reduction 7 with 81 rules applied. Total rules applied 4960 place count 327 transition count 3941
Free-agglomeration rule applied 9 times with reduction of 2 identical transitions.
Iterating global reduction 7 with 9 rules applied. Total rules applied 4969 place count 327 transition count 3930
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 7 with 19 rules applied. Total rules applied 4988 place count 318 transition count 3920
Drop transitions removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 8 with 13 rules applied. Total rules applied 5001 place count 318 transition count 3907
Free-agglomeration rule applied 2 times.
Iterating global reduction 8 with 2 rules applied. Total rules applied 5003 place count 318 transition count 3905
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 5005 place count 316 transition count 3905
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 9 with 6 rules applied. Total rules applied 5011 place count 316 transition count 3899
Free-agglomeration rule (complex) applied 7 times with reduction of 11 identical transitions.
Iterating global reduction 9 with 7 rules applied. Total rules applied 5018 place count 316 transition count 3972
Reduce places removed 7 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 8 rules applied. Total rules applied 5026 place count 309 transition count 3971
Drop transitions removed 41 transitions
Redundant transition composition rules discarded 41 transitions
Iterating global reduction 10 with 41 rules applied. Total rules applied 5067 place count 309 transition count 3930
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 10 with 6 rules applied. Total rules applied 5073 place count 309 transition count 3930
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 5074 place count 309 transition count 3929
Applied a total of 5074 rules in 1499 ms. Remains 309 /1296 variables (removed 987) and now considering 3929/89908 (removed 85979) transitions.
Running SMT prover for 4 properties.
[2023-03-18 01:07:40] [INFO ] Flow matrix only has 3814 transitions (discarded 115 similar events)
// Phase 1: matrix 3814 rows 309 cols
[2023-03-18 01:07:40] [INFO ] Computed 0 place invariants in 24 ms
[2023-03-18 01:07:40] [INFO ] After 794ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-18 01:07:41] [INFO ] After 842ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-18 01:07:41] [INFO ] State equation strengthened by 17 read => feed constraints.
[2023-03-18 01:07:42] [INFO ] After 348ms SMT Verify possible using 17 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-18 01:07:42] [INFO ] After 871ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 342 ms.
[2023-03-18 01:07:42] [INFO ] After 2146ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), true, (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 445 ms. Reduced automaton from 5 states, 10 edges and 2 AP (stutter sensitive) to 5 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 193 ms :[true, p0, (AND p0 p1), p0, p1]
Stuttering acceptance computed with spot in 180 ms :[true, p0, (AND p0 p1), p0, p1]
Stuttering acceptance computed with spot in 180 ms :[true, p0, (AND p0 p1), p0, p1]
Product exploration explored 100000 steps with 2 reset in 5701 ms.
Product exploration explored 100000 steps with 6 reset in 5744 ms.
Applying partial POR strategy [true, false, false, false, true]
Stuttering acceptance computed with spot in 166 ms :[true, p0, (AND p0 p1), p0, p1]
Support contains 4 out of 1369 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1369/1369 places, 93216/93216 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 1369 transition count 93216
Performed 19 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 20 places in 45 ms
Iterating global reduction 1 with 19 rules applied. Total rules applied 20 place count 1369 transition count 93213
Ensure Unique test removed 439 transitions
Reduce isomorphic transitions removed 439 transitions.
Iterating post reduction 1 with 439 rules applied. Total rules applied 459 place count 1369 transition count 92774
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 461 place count 1367 transition count 92772
Deduced a syphon composed of 18 places in 45 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 463 place count 1367 transition count 92772
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 22 places in 45 ms
Iterating global reduction 2 with 4 rules applied. Total rules applied 467 place count 1367 transition count 92772
Ensure Unique test removed 96 transitions
Reduce isomorphic transitions removed 96 transitions.
Iterating post reduction 2 with 96 rules applied. Total rules applied 563 place count 1367 transition count 92676
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 567 place count 1363 transition count 92672
Deduced a syphon composed of 18 places in 46 ms
Iterating global reduction 3 with 4 rules applied. Total rules applied 571 place count 1363 transition count 92672
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 19 places in 44 ms
Iterating global reduction 3 with 1 rules applied. Total rules applied 572 place count 1363 transition count 92675
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 575 place count 1363 transition count 92672
Deduced a syphon composed of 19 places in 45 ms
Applied a total of 575 rules in 2045 ms. Remains 1363 /1369 variables (removed 6) and now considering 92672/93216 (removed 544) transitions.
[2023-03-18 01:07:57] [INFO ] Flow matrix only has 62330 transitions (discarded 30342 similar events)
// Phase 1: matrix 62330 rows 1363 cols
[2023-03-18 01:07:58] [INFO ] Computed 12 place invariants in 195 ms
[2023-03-18 01:08:26] [INFO ] Dead Transitions using invariants and state equation in 28245 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1363/1369 places, 92672/93216 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 30293 ms. Remains : 1363/1369 places, 92672/93216 transitions.
Support contains 4 out of 1369 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1369/1369 places, 93216/93216 transitions.
Applied a total of 0 rules in 139 ms. Remains 1369 /1369 variables (removed 0) and now considering 93216/93216 (removed 0) transitions.
[2023-03-18 01:08:26] [INFO ] Flow matrix only has 62870 transitions (discarded 30346 similar events)
// Phase 1: matrix 62870 rows 1369 cols
[2023-03-18 01:08:26] [INFO ] Computed 12 place invariants in 242 ms
[2023-03-18 01:08:29] [INFO ] Implicit Places using invariants in 3572 ms returned []
Implicit Place search using SMT only with invariants took 3573 ms to find 0 implicit places.
[2023-03-18 01:08:29] [INFO ] Flow matrix only has 62870 transitions (discarded 30346 similar events)
[2023-03-18 01:08:29] [INFO ] Invariant cache hit.
[2023-03-18 01:09:00] [INFO ] Performed 91806/93216 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-18 01:09:00] [INFO ] Dead Transitions using invariants and state equation in 30681 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 34397 ms. Remains : 1369/1369 places, 93216/93216 transitions.
Treatment of property RERS2020-PT-pb107-LTLFireability-00 finished in 376512 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&&X((p0&&G(F(p0)))))))'
Support contains 2 out of 1369 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1369/1369 places, 93216/93216 transitions.
Reduce places removed 1 places and 1 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 1368 transition count 93214
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 1367 transition count 93214
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 2 place count 1367 transition count 93212
Deduced a syphon composed of 2 places in 53 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 6 place count 1365 transition count 93212
Performed 17 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 17 places in 53 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 40 place count 1348 transition count 93192
Ensure Unique test removed 439 transitions
Reduce isomorphic transitions removed 439 transitions.
Iterating post reduction 2 with 439 rules applied. Total rules applied 479 place count 1348 transition count 92753
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 48 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 487 place count 1344 transition count 92749
Ensure Unique test removed 96 transitions
Reduce isomorphic transitions removed 96 transitions.
Iterating post reduction 3 with 96 rules applied. Total rules applied 583 place count 1344 transition count 92653
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 1 places in 45 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 585 place count 1343 transition count 92654
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 588 place count 1343 transition count 92651
Applied a total of 588 rules in 2476 ms. Remains 1343 /1369 variables (removed 26) and now considering 92651/93216 (removed 565) transitions.
[2023-03-18 01:09:06] [INFO ] Flow matrix only has 62309 transitions (discarded 30342 similar events)
// Phase 1: matrix 62309 rows 1343 cols
[2023-03-18 01:09:07] [INFO ] Computed 12 place invariants in 220 ms
[2023-03-18 01:09:10] [INFO ] Implicit Places using invariants in 3643 ms returned []
Implicit Place search using SMT only with invariants took 3643 ms to find 0 implicit places.
[2023-03-18 01:09:10] [INFO ] Flow matrix only has 62309 transitions (discarded 30342 similar events)
[2023-03-18 01:09:10] [INFO ] Invariant cache hit.
[2023-03-18 01:09:40] [INFO ] Performed 85331/92651 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-18 01:09:43] [INFO ] Dead Transitions using invariants and state equation in 32809 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1343/1369 places, 92651/93216 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 38934 ms. Remains : 1343/1369 places, 92651/93216 transitions.
Stuttering acceptance computed with spot in 46 ms :[true, (NOT p0)]
Running random walk in product with property : RERS2020-PT-pb107-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(OR (EQ s1031 0) (EQ s1221 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 1 reset in 6129 ms.
Product exploration explored 100000 steps with 0 reset in 6010 ms.
Computed a total of 257 stabilizing places and 30632 stable transitions
Computed a total of 257 stabilizing places and 30632 stable transitions
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 257 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 38 ms :[true, (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 556 ms. (steps per millisecond=17 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 9079 steps, run timeout after 3003 ms. (steps per millisecond=3 ) properties seen :{}
Probabilistic random walk after 9079 steps, saw 6370 distinct states, run finished after 3003 ms. (steps per millisecond=3 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-18 01:10:00] [INFO ] Flow matrix only has 62309 transitions (discarded 30342 similar events)
[2023-03-18 01:10:00] [INFO ] Invariant cache hit.
[2023-03-18 01:10:00] [INFO ] [Real]Absence check using 12 positive place invariants in 12 ms returned sat
[2023-03-18 01:10:20] [INFO ] After 19711ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-18 01:10:20] [INFO ] State equation strengthened by 3673 read => feed constraints.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:642)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:339)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-18 01:10:25] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-18 01:10:25] [INFO ] After 25041ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 17 ms.
Support contains 2 out of 1343 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1343/1343 places, 92651/92651 transitions.
Drop transitions removed 2819 transitions
Reduce isomorphic transitions removed 2819 transitions.
Iterating post reduction 0 with 2819 rules applied. Total rules applied 2819 place count 1343 transition count 89832
Free-agglomeration rule applied 32 times.
Iterating global reduction 1 with 32 rules applied. Total rules applied 2851 place count 1343 transition count 89800
Reduce places removed 32 places and 0 transitions.
Drop transitions removed 44 transitions
Ensure Unique test removed 555 transitions
Reduce isomorphic transitions removed 599 transitions.
Iterating post reduction 1 with 631 rules applied. Total rules applied 3482 place count 1311 transition count 89201
Free-agglomeration rule (complex) applied 15 times with reduction of 16 identical transitions.
Iterating global reduction 2 with 15 rules applied. Total rules applied 3497 place count 1311 transition count 89934
Reduce places removed 15 places and 0 transitions.
Drop transitions removed 5 transitions
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 26 transitions.
Iterating post reduction 2 with 41 rules applied. Total rules applied 3538 place count 1296 transition count 89908
Applied a total of 3538 rules in 1863 ms. Remains 1296 /1343 variables (removed 47) and now considering 89908/92651 (removed 2743) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1867 ms. Remains : 1296/1343 places, 89908/92651 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 550 ms. (steps per millisecond=18 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 10041 steps, run timeout after 3002 ms. (steps per millisecond=3 ) properties seen :{}
Probabilistic random walk after 10041 steps, saw 8003 distinct states, run finished after 3004 ms. (steps per millisecond=3 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-18 01:10:30] [INFO ] Flow matrix only has 62424 transitions (discarded 27484 similar events)
// Phase 1: matrix 62424 rows 1296 cols
[2023-03-18 01:10:31] [INFO ] Computed 12 place invariants in 220 ms
[2023-03-18 01:10:31] [INFO ] [Real]Absence check using 12 positive place invariants in 11 ms returned sat
[2023-03-18 01:10:52] [INFO ] After 21349ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-18 01:10:53] [INFO ] State equation strengthened by 3688 read => feed constraints.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:642)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:339)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-18 01:10:56] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-18 01:10:56] [INFO ] After 25032ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 15 ms.
Support contains 2 out of 1296 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1296/1296 places, 89908/89908 transitions.
Applied a total of 0 rules in 376 ms. Remains 1296 /1296 variables (removed 0) and now considering 89908/89908 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 376 ms. Remains : 1296/1296 places, 89908/89908 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1296/1296 places, 89908/89908 transitions.
Applied a total of 0 rules in 418 ms. Remains 1296 /1296 variables (removed 0) and now considering 89908/89908 (removed 0) transitions.
[2023-03-18 01:10:56] [INFO ] Flow matrix only has 62424 transitions (discarded 27484 similar events)
[2023-03-18 01:10:56] [INFO ] Invariant cache hit.
[2023-03-18 01:11:00] [INFO ] Implicit Places using invariants in 3698 ms returned []
Implicit Place search using SMT only with invariants took 3698 ms to find 0 implicit places.
[2023-03-18 01:11:00] [INFO ] Flow matrix only has 62424 transitions (discarded 27484 similar events)
[2023-03-18 01:11:00] [INFO ] Invariant cache hit.
[2023-03-18 01:11:30] [INFO ] Performed 88103/89908 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-18 01:11:31] [INFO ] Dead Transitions using invariants and state equation in 30779 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34916 ms. Remains : 1296/1296 places, 89908/89908 transitions.
Graph (trivial) has 31584 edges and 1296 vertex of which 1032 / 1296 are part of one of the 152 SCC in 5 ms
Free SCC test removed 880 places
Drop transitions removed 33012 transitions
Ensure Unique test removed 48155 transitions
Reduce isomorphic transitions removed 81167 transitions.
Graph (complete) has 8395 edges and 416 vertex of which 401 are kept as prefixes of interest. Removing 15 places using SCC suffix rule.4 ms
Discarding 15 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Drop transitions removed 23 transitions
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 42 transitions.
Iterating post reduction 0 with 42 rules applied. Total rules applied 44 place count 401 transition count 8697
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 44 place count 401 transition count 8696
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 46 place count 400 transition count 8696
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 49 place count 397 transition count 8684
Iterating global reduction 1 with 3 rules applied. Total rules applied 52 place count 397 transition count 8684
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 58 place count 397 transition count 8678
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 2 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 66 place count 393 transition count 8674
Ensure Unique test removed 73 transitions
Reduce isomorphic transitions removed 73 transitions.
Iterating post reduction 2 with 73 rules applied. Total rules applied 139 place count 393 transition count 8601
Drop transitions removed 3979 transitions
Redundant transition composition rules discarded 3979 transitions
Iterating global reduction 3 with 3979 rules applied. Total rules applied 4118 place count 393 transition count 4622
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 51 transitions
Reduce isomorphic transitions removed 51 transitions.
Graph (complete) has 5268 edges and 390 vertex of which 357 are kept as prefixes of interest. Removing 33 places using SCC suffix rule.2 ms
Discarding 33 places :
Also discarding 7 output transitions
Drop transitions removed 7 transitions
Iterating post reduction 3 with 55 rules applied. Total rules applied 4173 place count 357 transition count 4564
Drop transitions removed 450 transitions
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 462 transitions.
Iterating post reduction 4 with 462 rules applied. Total rules applied 4635 place count 357 transition count 4102
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 4635 place count 357 transition count 4101
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 4637 place count 356 transition count 4101
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 4643 place count 350 transition count 4079
Iterating global reduction 5 with 6 rules applied. Total rules applied 4649 place count 350 transition count 4079
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 4653 place count 346 transition count 4063
Iterating global reduction 5 with 4 rules applied. Total rules applied 4657 place count 346 transition count 4063
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 5 with 10 rules applied. Total rules applied 4667 place count 341 transition count 4058
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 4668 place count 341 transition count 4057
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 4670 place count 340 transition count 4070
Drop transitions removed 23 transitions
Redundant transition composition rules discarded 23 transitions
Iterating global reduction 6 with 23 rules applied. Total rules applied 4693 place count 340 transition count 4047
Free-agglomeration rule applied 20 times with reduction of 7 identical transitions.
Iterating global reduction 6 with 20 rules applied. Total rules applied 4713 place count 340 transition count 4020
Reduce places removed 20 places and 0 transitions.
Ensure Unique test removed 65 transitions
Reduce isomorphic transitions removed 65 transitions.
Iterating post reduction 6 with 85 rules applied. Total rules applied 4798 place count 320 transition count 3955
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 4800 place count 319 transition count 3964
Drop transitions removed 95 transitions
Redundant transition composition rules discarded 95 transitions
Iterating global reduction 7 with 95 rules applied. Total rules applied 4895 place count 319 transition count 3869
Free-agglomeration rule applied 11 times with reduction of 2 identical transitions.
Iterating global reduction 7 with 11 rules applied. Total rules applied 4906 place count 319 transition count 3856
Reduce places removed 11 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 7 with 21 rules applied. Total rules applied 4927 place count 308 transition count 3846
Drop transitions removed 28 transitions
Redundant transition composition rules discarded 28 transitions
Iterating global reduction 8 with 28 rules applied. Total rules applied 4955 place count 308 transition count 3818
Free-agglomeration rule applied 4 times.
Iterating global reduction 8 with 4 rules applied. Total rules applied 4959 place count 308 transition count 3814
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 8 with 4 rules applied. Total rules applied 4963 place count 304 transition count 3814
Drop transitions removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 9 with 11 rules applied. Total rules applied 4974 place count 304 transition count 3803
Free-agglomeration rule applied 1 times.
Iterating global reduction 9 with 1 rules applied. Total rules applied 4975 place count 304 transition count 3802
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 4976 place count 303 transition count 3802
Free-agglomeration rule (complex) applied 7 times with reduction of 11 identical transitions.
Iterating global reduction 10 with 7 rules applied. Total rules applied 4983 place count 303 transition count 3875
Reduce places removed 7 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 10 with 8 rules applied. Total rules applied 4991 place count 296 transition count 3874
Drop transitions removed 41 transitions
Redundant transition composition rules discarded 41 transitions
Iterating global reduction 11 with 41 rules applied. Total rules applied 5032 place count 296 transition count 3833
Applied a total of 5032 rules in 1505 ms. Remains 296 /1296 variables (removed 1000) and now considering 3833/89908 (removed 86075) transitions.
Running SMT prover for 1 properties.
[2023-03-18 01:11:32] [INFO ] Flow matrix only has 3716 transitions (discarded 117 similar events)
// Phase 1: matrix 3716 rows 296 cols
[2023-03-18 01:11:32] [INFO ] Computed 0 place invariants in 15 ms
[2023-03-18 01:11:33] [INFO ] After 645ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 01:11:34] [INFO ] After 558ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 01:11:34] [INFO ] State equation strengthened by 16 read => feed constraints.
[2023-03-18 01:11:34] [INFO ] After 87ms SMT Verify possible using 16 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-18 01:11:34] [INFO ] After 200ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 71 ms.
[2023-03-18 01:11:34] [INFO ] After 884ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 169 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 76 ms :[true, (NOT p0)]
Stuttering acceptance computed with spot in 57 ms :[true, (NOT p0)]
Support contains 2 out of 1343 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1343/1343 places, 92651/92651 transitions.
Applied a total of 0 rules in 380 ms. Remains 1343 /1343 variables (removed 0) and now considering 92651/92651 (removed 0) transitions.
[2023-03-18 01:11:35] [INFO ] Flow matrix only has 62309 transitions (discarded 30342 similar events)
// Phase 1: matrix 62309 rows 1343 cols
[2023-03-18 01:11:35] [INFO ] Computed 12 place invariants in 221 ms
[2023-03-18 01:11:38] [INFO ] Implicit Places using invariants in 3610 ms returned []
Implicit Place search using SMT only with invariants took 3613 ms to find 0 implicit places.
[2023-03-18 01:11:38] [INFO ] Flow matrix only has 62309 transitions (discarded 30342 similar events)
[2023-03-18 01:11:38] [INFO ] Invariant cache hit.
[2023-03-18 01:12:09] [INFO ] Performed 91614/92651 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-18 01:12:09] [INFO ] Dead Transitions using invariants and state equation in 30576 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 34571 ms. Remains : 1343/1343 places, 92651/92651 transitions.
Computed a total of 257 stabilizing places and 30632 stable transitions
Computed a total of 257 stabilizing places and 30632 stable transitions
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 263 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 44 ms :[true, (NOT p0)]
Incomplete random walk after 10000 steps, including 4 resets, run finished after 677 ms. (steps per millisecond=14 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 9079 steps, run timeout after 3001 ms. (steps per millisecond=3 ) properties seen :{}
Probabilistic random walk after 9079 steps, saw 6370 distinct states, run finished after 3001 ms. (steps per millisecond=3 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-18 01:12:14] [INFO ] Flow matrix only has 62309 transitions (discarded 30342 similar events)
[2023-03-18 01:12:14] [INFO ] Invariant cache hit.
[2023-03-18 01:12:14] [INFO ] [Real]Absence check using 12 positive place invariants in 9 ms returned sat
[2023-03-18 01:12:33] [INFO ] After 19362ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-18 01:12:34] [INFO ] State equation strengthened by 3673 read => feed constraints.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:642)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:339)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-18 01:12:39] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-18 01:12:39] [INFO ] After 25037ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 14 ms.
Support contains 2 out of 1343 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1343/1343 places, 92651/92651 transitions.
Drop transitions removed 2819 transitions
Reduce isomorphic transitions removed 2819 transitions.
Iterating post reduction 0 with 2819 rules applied. Total rules applied 2819 place count 1343 transition count 89832
Free-agglomeration rule applied 32 times.
Iterating global reduction 1 with 32 rules applied. Total rules applied 2851 place count 1343 transition count 89800
Reduce places removed 32 places and 0 transitions.
Drop transitions removed 44 transitions
Ensure Unique test removed 555 transitions
Reduce isomorphic transitions removed 599 transitions.
Iterating post reduction 1 with 631 rules applied. Total rules applied 3482 place count 1311 transition count 89201
Free-agglomeration rule (complex) applied 15 times with reduction of 16 identical transitions.
Iterating global reduction 2 with 15 rules applied. Total rules applied 3497 place count 1311 transition count 89934
Reduce places removed 15 places and 0 transitions.
Drop transitions removed 5 transitions
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 26 transitions.
Iterating post reduction 2 with 41 rules applied. Total rules applied 3538 place count 1296 transition count 89908
Applied a total of 3538 rules in 2121 ms. Remains 1296 /1343 variables (removed 47) and now considering 89908/92651 (removed 2743) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2124 ms. Remains : 1296/1343 places, 89908/92651 transitions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 563 ms. (steps per millisecond=17 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 10021 steps, run timeout after 3003 ms. (steps per millisecond=3 ) properties seen :{}
Probabilistic random walk after 10021 steps, saw 7989 distinct states, run finished after 3003 ms. (steps per millisecond=3 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-18 01:12:45] [INFO ] Flow matrix only has 62424 transitions (discarded 27484 similar events)
// Phase 1: matrix 62424 rows 1296 cols
[2023-03-18 01:12:45] [INFO ] Computed 12 place invariants in 235 ms
[2023-03-18 01:12:45] [INFO ] [Real]Absence check using 12 positive place invariants in 8 ms returned sat
[2023-03-18 01:13:05] [INFO ] After 19452ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-18 01:13:05] [INFO ] State equation strengthened by 3688 read => feed constraints.
[2023-03-18 01:13:10] [INFO ] After 4928ms SMT Verify possible using 3688 Read/Feed constraints in real domain returned unsat :0 sat :0
[2023-03-18 01:13:10] [INFO ] After 25037ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 19 ms.
Support contains 2 out of 1296 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1296/1296 places, 89908/89908 transitions.
Applied a total of 0 rules in 395 ms. Remains 1296 /1296 variables (removed 0) and now considering 89908/89908 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 395 ms. Remains : 1296/1296 places, 89908/89908 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1296/1296 places, 89908/89908 transitions.
Applied a total of 0 rules in 397 ms. Remains 1296 /1296 variables (removed 0) and now considering 89908/89908 (removed 0) transitions.
[2023-03-18 01:13:11] [INFO ] Flow matrix only has 62424 transitions (discarded 27484 similar events)
[2023-03-18 01:13:11] [INFO ] Invariant cache hit.
[2023-03-18 01:13:14] [INFO ] Implicit Places using invariants in 3598 ms returned []
Implicit Place search using SMT only with invariants took 3599 ms to find 0 implicit places.
[2023-03-18 01:13:14] [INFO ] Flow matrix only has 62424 transitions (discarded 27484 similar events)
[2023-03-18 01:13:14] [INFO ] Invariant cache hit.
[2023-03-18 01:13:44] [INFO ] Dead Transitions using invariants and state equation in 29939 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33945 ms. Remains : 1296/1296 places, 89908/89908 transitions.
Graph (trivial) has 31584 edges and 1296 vertex of which 1032 / 1296 are part of one of the 152 SCC in 5 ms
Free SCC test removed 880 places
Drop transitions removed 33012 transitions
Ensure Unique test removed 48155 transitions
Reduce isomorphic transitions removed 81167 transitions.
Graph (complete) has 8395 edges and 416 vertex of which 401 are kept as prefixes of interest. Removing 15 places using SCC suffix rule.4 ms
Discarding 15 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Drop transitions removed 23 transitions
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 42 transitions.
Iterating post reduction 0 with 42 rules applied. Total rules applied 44 place count 401 transition count 8697
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 44 place count 401 transition count 8696
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 46 place count 400 transition count 8696
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 49 place count 397 transition count 8684
Iterating global reduction 1 with 3 rules applied. Total rules applied 52 place count 397 transition count 8684
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 58 place count 397 transition count 8678
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 66 place count 393 transition count 8674
Ensure Unique test removed 73 transitions
Reduce isomorphic transitions removed 73 transitions.
Iterating post reduction 2 with 73 rules applied. Total rules applied 139 place count 393 transition count 8601
Drop transitions removed 3979 transitions
Redundant transition composition rules discarded 3979 transitions
Iterating global reduction 3 with 3979 rules applied. Total rules applied 4118 place count 393 transition count 4622
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 51 transitions
Reduce isomorphic transitions removed 51 transitions.
Graph (complete) has 5268 edges and 390 vertex of which 357 are kept as prefixes of interest. Removing 33 places using SCC suffix rule.2 ms
Discarding 33 places :
Also discarding 7 output transitions
Drop transitions removed 7 transitions
Iterating post reduction 3 with 55 rules applied. Total rules applied 4173 place count 357 transition count 4564
Drop transitions removed 450 transitions
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 462 transitions.
Iterating post reduction 4 with 462 rules applied. Total rules applied 4635 place count 357 transition count 4102
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 4635 place count 357 transition count 4101
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 4637 place count 356 transition count 4101
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 4643 place count 350 transition count 4079
Iterating global reduction 5 with 6 rules applied. Total rules applied 4649 place count 350 transition count 4079
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 4653 place count 346 transition count 4063
Iterating global reduction 5 with 4 rules applied. Total rules applied 4657 place count 346 transition count 4063
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 5 with 10 rules applied. Total rules applied 4667 place count 341 transition count 4058
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 4668 place count 341 transition count 4057
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 4670 place count 340 transition count 4070
Drop transitions removed 23 transitions
Redundant transition composition rules discarded 23 transitions
Iterating global reduction 6 with 23 rules applied. Total rules applied 4693 place count 340 transition count 4047
Free-agglomeration rule applied 20 times with reduction of 7 identical transitions.
Iterating global reduction 6 with 20 rules applied. Total rules applied 4713 place count 340 transition count 4020
Reduce places removed 20 places and 0 transitions.
Ensure Unique test removed 65 transitions
Reduce isomorphic transitions removed 65 transitions.
Iterating post reduction 6 with 85 rules applied. Total rules applied 4798 place count 320 transition count 3955
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 4800 place count 319 transition count 3964
Drop transitions removed 95 transitions
Redundant transition composition rules discarded 95 transitions
Iterating global reduction 7 with 95 rules applied. Total rules applied 4895 place count 319 transition count 3869
Free-agglomeration rule applied 11 times with reduction of 2 identical transitions.
Iterating global reduction 7 with 11 rules applied. Total rules applied 4906 place count 319 transition count 3856
Reduce places removed 11 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 7 with 21 rules applied. Total rules applied 4927 place count 308 transition count 3846
Drop transitions removed 28 transitions
Redundant transition composition rules discarded 28 transitions
Iterating global reduction 8 with 28 rules applied. Total rules applied 4955 place count 308 transition count 3818
Free-agglomeration rule applied 4 times.
Iterating global reduction 8 with 4 rules applied. Total rules applied 4959 place count 308 transition count 3814
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 8 with 4 rules applied. Total rules applied 4963 place count 304 transition count 3814
Drop transitions removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 9 with 11 rules applied. Total rules applied 4974 place count 304 transition count 3803
Free-agglomeration rule applied 1 times.
Iterating global reduction 9 with 1 rules applied. Total rules applied 4975 place count 304 transition count 3802
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 4976 place count 303 transition count 3802
Free-agglomeration rule (complex) applied 7 times with reduction of 11 identical transitions.
Iterating global reduction 10 with 7 rules applied. Total rules applied 4983 place count 303 transition count 3875
Reduce places removed 7 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 10 with 8 rules applied. Total rules applied 4991 place count 296 transition count 3874
Drop transitions removed 41 transitions
Redundant transition composition rules discarded 41 transitions
Iterating global reduction 11 with 41 rules applied. Total rules applied 5032 place count 296 transition count 3833
Applied a total of 5032 rules in 1481 ms. Remains 296 /1296 variables (removed 1000) and now considering 3833/89908 (removed 86075) transitions.
Running SMT prover for 1 properties.
[2023-03-18 01:13:46] [INFO ] Flow matrix only has 3716 transitions (discarded 117 similar events)
// Phase 1: matrix 3716 rows 296 cols
[2023-03-18 01:13:46] [INFO ] Computed 0 place invariants in 18 ms
[2023-03-18 01:13:46] [INFO ] After 589ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 01:13:47] [INFO ] After 535ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 01:13:47] [INFO ] State equation strengthened by 16 read => feed constraints.
[2023-03-18 01:13:47] [INFO ] After 85ms SMT Verify possible using 16 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-18 01:13:47] [INFO ] After 195ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 76 ms.
[2023-03-18 01:13:47] [INFO ] After 857ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 176 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 52 ms :[true, (NOT p0)]
Stuttering acceptance computed with spot in 43 ms :[true, (NOT p0)]
Stuttering acceptance computed with spot in 39 ms :[true, (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 5322 ms.
Product exploration explored 100000 steps with 1 reset in 5068 ms.
Support contains 2 out of 1343 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1343/1343 places, 92651/92651 transitions.
Applied a total of 0 rules in 378 ms. Remains 1343 /1343 variables (removed 0) and now considering 92651/92651 (removed 0) transitions.
[2023-03-18 01:13:59] [INFO ] Flow matrix only has 62309 transitions (discarded 30342 similar events)
// Phase 1: matrix 62309 rows 1343 cols
[2023-03-18 01:13:59] [INFO ] Computed 12 place invariants in 196 ms
[2023-03-18 01:14:02] [INFO ] Implicit Places using invariants in 3351 ms returned []
Implicit Place search using SMT only with invariants took 3354 ms to find 0 implicit places.
[2023-03-18 01:14:02] [INFO ] Flow matrix only has 62309 transitions (discarded 30342 similar events)
[2023-03-18 01:14:02] [INFO ] Invariant cache hit.
[2023-03-18 01:14:32] [INFO ] Dead Transitions using invariants and state equation in 30168 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 33902 ms. Remains : 1343/1343 places, 92651/92651 transitions.
Treatment of property RERS2020-PT-pb107-LTLFireability-01 finished in 331132 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(G((X(p1)&&F(p2)&&p0)))))'
Support contains 4 out of 1369 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1369/1369 places, 93216/93216 transitions.
Applied a total of 0 rules in 134 ms. Remains 1369 /1369 variables (removed 0) and now considering 93216/93216 (removed 0) transitions.
[2023-03-18 01:14:35] [INFO ] Flow matrix only has 62870 transitions (discarded 30346 similar events)
// Phase 1: matrix 62870 rows 1369 cols
[2023-03-18 01:14:36] [INFO ] Computed 12 place invariants in 284 ms
[2023-03-18 01:14:39] [INFO ] Implicit Places using invariants in 3660 ms returned []
Implicit Place search using SMT only with invariants took 3660 ms to find 0 implicit places.
[2023-03-18 01:14:39] [INFO ] Flow matrix only has 62870 transitions (discarded 30346 similar events)
[2023-03-18 01:14:39] [INFO ] Invariant cache hit.
[2023-03-18 01:15:09] [INFO ] Performed 89329/93216 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-18 01:15:10] [INFO ] Dead Transitions using invariants and state equation in 31536 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 35334 ms. Remains : 1369/1369 places, 93216/93216 transitions.
Stuttering acceptance computed with spot in 208 ms :[(OR (NOT p0) (NOT p2) (NOT p1)), (OR (NOT p0) (NOT p2) (NOT p1)), (OR (NOT p0) (NOT p2) (NOT p1)), true, (AND p0 (NOT p1)), (NOT p2)]
Running random walk in product with property : RERS2020-PT-pb107-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={} source=2 dest: 3}, { cond=p0, acceptance={} source=2 dest: 4}, { cond=(AND p0 (NOT p2)), acceptance={} source=2 dest: 5}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(AND (EQ s62 1) (EQ s1109 1)), p2:(AND (EQ s62 1) (EQ s1109 1)), p1:(AND (EQ s236 1) (EQ s1034 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][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 3 ms.
FORMULA RERS2020-PT-pb107-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RERS2020-PT-pb107-LTLFireability-02 finished in 35813 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) U G(p1))))'
Support contains 4 out of 1369 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1369/1369 places, 93216/93216 transitions.
Applied a total of 0 rules in 122 ms. Remains 1369 /1369 variables (removed 0) and now considering 93216/93216 (removed 0) transitions.
[2023-03-18 01:15:11] [INFO ] Flow matrix only has 62870 transitions (discarded 30346 similar events)
[2023-03-18 01:15:11] [INFO ] Invariant cache hit.
[2023-03-18 01:15:14] [INFO ] Implicit Places using invariants in 3352 ms returned []
Implicit Place search using SMT only with invariants took 3353 ms to find 0 implicit places.
[2023-03-18 01:15:14] [INFO ] Flow matrix only has 62870 transitions (discarded 30346 similar events)
[2023-03-18 01:15:14] [INFO ] Invariant cache hit.
[2023-03-18 01:15:44] [INFO ] Performed 85316/93216 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-18 01:15:47] [INFO ] Dead Transitions using invariants and state equation in 33054 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 36530 ms. Remains : 1369/1369 places, 93216/93216 transitions.
Stuttering acceptance computed with spot in 127 ms :[(NOT p1), (NOT p1), p0]
Running random walk in product with property : RERS2020-PT-pb107-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(AND (EQ s212 1) (EQ s1210 1)), p0:(AND (EQ s395 1) (EQ s827 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 0 reset in 5133 ms.
Stack based approach found an accepted trace after 156 steps with 0 reset with depth 157 and stack size 157 in 12 ms.
FORMULA RERS2020-PT-pb107-LTLFireability-03 FALSE TECHNIQUES STACK_TEST
Treatment of property RERS2020-PT-pb107-LTLFireability-03 finished in 41954 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(p1)))))'
Support contains 4 out of 1369 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1369/1369 places, 93216/93216 transitions.
Applied a total of 0 rules in 128 ms. Remains 1369 /1369 variables (removed 0) and now considering 93216/93216 (removed 0) transitions.
[2023-03-18 01:15:53] [INFO ] Flow matrix only has 62870 transitions (discarded 30346 similar events)
[2023-03-18 01:15:53] [INFO ] Invariant cache hit.
[2023-03-18 01:15:56] [INFO ] Implicit Places using invariants in 3514 ms returned []
Implicit Place search using SMT only with invariants took 3515 ms to find 0 implicit places.
[2023-03-18 01:15:56] [INFO ] Flow matrix only has 62870 transitions (discarded 30346 similar events)
[2023-03-18 01:15:56] [INFO ] Invariant cache hit.
[2023-03-18 01:16:27] [INFO ] Performed 85849/93216 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-18 01:16:29] [INFO ] Dead Transitions using invariants and state equation in 32864 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 36509 ms. Remains : 1369/1369 places, 93216/93216 transitions.
Stuttering acceptance computed with spot in 134 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : RERS2020-PT-pb107-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(AND p0 (NOT p1)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 2}], [{ 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:(OR (NEQ s496 1) (NEQ s959 1)), p1:(OR (NEQ s415 1) (NEQ s478 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration timeout after 96480 steps with 32160 reset in 10002 ms.
Product exploration explored 100000 steps with 33333 reset in 9992 ms.
Computed a total of 261 stabilizing places and 30825 stable transitions
Computed a total of 261 stabilizing places and 30825 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :(AND p0 p1)
Knowledge based reduction with 5 factoid took 155 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA RERS2020-PT-pb107-LTLFireability-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property RERS2020-PT-pb107-LTLFireability-04 finished in 57328 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(X((X(p0) U p1))))'
Support contains 2 out of 1369 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 1369/1369 places, 93216/93216 transitions.
Applied a total of 0 rules in 122 ms. Remains 1369 /1369 variables (removed 0) and now considering 93216/93216 (removed 0) transitions.
[2023-03-18 01:16:50] [INFO ] Flow matrix only has 62870 transitions (discarded 30346 similar events)
[2023-03-18 01:16:50] [INFO ] Invariant cache hit.
[2023-03-18 01:16:53] [INFO ] Implicit Places using invariants in 3184 ms returned []
Implicit Place search using SMT only with invariants took 3186 ms to find 0 implicit places.
[2023-03-18 01:16:53] [INFO ] Flow matrix only has 62870 transitions (discarded 30346 similar events)
[2023-03-18 01:16:53] [INFO ] Invariant cache hit.
[2023-03-18 01:17:24] [INFO ] Performed 88168/93216 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-18 01:17:25] [INFO ] Dead Transitions using invariants and state equation in 31945 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 35255 ms. Remains : 1369/1369 places, 93216/93216 transitions.
Stuttering acceptance computed with spot in 76 ms :[(NOT p1), (NOT p1)]
Running random walk in product with property : RERS2020-PT-pb107-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (EQ s187 1) (EQ s1172 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 241 steps with 0 reset in 15 ms.
FORMULA RERS2020-PT-pb107-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RERS2020-PT-pb107-LTLFireability-05 finished in 35484 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((F(p0) U p1))))'
Support contains 4 out of 1369 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1369/1369 places, 93216/93216 transitions.
Reduce places removed 1 places and 1 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 1368 transition count 93214
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 1367 transition count 93214
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 2 place count 1367 transition count 93212
Deduced a syphon composed of 2 places in 43 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 6 place count 1365 transition count 93212
Performed 17 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 17 places in 43 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 40 place count 1348 transition count 93192
Ensure Unique test removed 439 transitions
Reduce isomorphic transitions removed 439 transitions.
Iterating post reduction 2 with 439 rules applied. Total rules applied 479 place count 1348 transition count 92753
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 44 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 487 place count 1344 transition count 92749
Ensure Unique test removed 96 transitions
Reduce isomorphic transitions removed 96 transitions.
Iterating post reduction 3 with 96 rules applied. Total rules applied 583 place count 1344 transition count 92653
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 1 places in 43 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 585 place count 1343 transition count 92654
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 588 place count 1343 transition count 92651
Applied a total of 588 rules in 1934 ms. Remains 1343 /1369 variables (removed 26) and now considering 92651/93216 (removed 565) transitions.
[2023-03-18 01:17:27] [INFO ] Flow matrix only has 62309 transitions (discarded 30342 similar events)
// Phase 1: matrix 62309 rows 1343 cols
[2023-03-18 01:17:28] [INFO ] Computed 12 place invariants in 193 ms
[2023-03-18 01:17:31] [INFO ] Implicit Places using invariants in 3316 ms returned []
Implicit Place search using SMT only with invariants took 3319 ms to find 0 implicit places.
[2023-03-18 01:17:31] [INFO ] Flow matrix only has 62309 transitions (discarded 30342 similar events)
[2023-03-18 01:17:31] [INFO ] Invariant cache hit.
[2023-03-18 01:18:01] [INFO ] Dead Transitions using invariants and state equation in 30238 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1343/1369 places, 92651/93216 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 35493 ms. Remains : 1343/1369 places, 92651/93216 transitions.
Stuttering acceptance computed with spot in 152 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : RERS2020-PT-pb107-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 1}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(AND (EQ s556 1) (EQ s567 1)), p0:(AND (EQ s414 1) (EQ s657 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 0 reset in 5421 ms.
Stack based approach found an accepted trace after 145 steps with 0 reset with depth 146 and stack size 146 in 12 ms.
FORMULA RERS2020-PT-pb107-LTLFireability-07 FALSE TECHNIQUES STACK_TEST
Treatment of property RERS2020-PT-pb107-LTLFireability-07 finished in 41227 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(p1)||G(p2)||p0))))'
Support contains 6 out of 1369 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1369/1369 places, 93216/93216 transitions.
Applied a total of 0 rules in 140 ms. Remains 1369 /1369 variables (removed 0) and now considering 93216/93216 (removed 0) transitions.
[2023-03-18 01:18:07] [INFO ] Flow matrix only has 62870 transitions (discarded 30346 similar events)
// Phase 1: matrix 62870 rows 1369 cols
[2023-03-18 01:18:07] [INFO ] Computed 12 place invariants in 275 ms
[2023-03-18 01:18:11] [INFO ] Implicit Places using invariants in 3764 ms returned []
Implicit Place search using SMT only with invariants took 3765 ms to find 0 implicit places.
[2023-03-18 01:18:11] [INFO ] Flow matrix only has 62870 transitions (discarded 30346 similar events)
[2023-03-18 01:18:11] [INFO ] Invariant cache hit.
[2023-03-18 01:18:41] [INFO ] Performed 87361/93216 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-18 01:18:43] [INFO ] Dead Transitions using invariants and state equation in 32290 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 36198 ms. Remains : 1369/1369 places, 93216/93216 transitions.
Stuttering acceptance computed with spot in 185 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p1) p0 (NOT p2))]
Running random walk in product with property : RERS2020-PT-pb107-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=3 dest: 2}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(OR (EQ s74 0) (EQ s792 0)), p1:(OR (EQ s132 0) (EQ s188 0)), p2:(OR (EQ s821 0) (EQ s865 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 1 reset in 4824 ms.
Product exploration explored 100000 steps with 0 reset in 5015 ms.
Computed a total of 261 stabilizing places and 30825 stable transitions
Computed a total of 261 stabilizing places and 30825 stable transitions
Detected a total of 261/1369 stabilizing places and 30825/93216 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p0 p1 p2), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X p1)), true, (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 465 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 151 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p1), (AND (NOT p1) p0 (NOT p2))]
Incomplete random walk after 10000 steps, including 3 resets, run finished after 943 ms. (steps per millisecond=10 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 117 ms. (steps per millisecond=85 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 107 ms. (steps per millisecond=93 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 106 ms. (steps per millisecond=94 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 110 ms. (steps per millisecond=90 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 108 ms. (steps per millisecond=92 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 8967 steps, run timeout after 3003 ms. (steps per millisecond=2 ) properties seen :{}
Probabilistic random walk after 8967 steps, saw 7356 distinct states, run finished after 3003 ms. (steps per millisecond=2 ) properties seen :0
Running SMT prover for 5 properties.
[2023-03-18 01:18:59] [INFO ] Flow matrix only has 62870 transitions (discarded 30346 similar events)
[2023-03-18 01:18:59] [INFO ] Invariant cache hit.
[2023-03-18 01:18:59] [INFO ] [Real]Absence check using 12 positive place invariants in 10 ms returned sat
[2023-03-18 01:19:23] [INFO ] After 23972ms SMT Verify possible using state equation in real domain returned unsat :0 sat :5
[2023-03-18 01:19:24] [INFO ] State equation strengthened by 3692 read => feed constraints.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:642)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:339)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-18 01:19:24] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-18 01:19:24] [INFO ] After 25485ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 5 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 6 out of 1369 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1369/1369 places, 93216/93216 transitions.
Drop transitions removed 2811 transitions
Reduce isomorphic transitions removed 2811 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 2812 rules applied. Total rules applied 2812 place count 1369 transition count 90404
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2813 place count 1368 transition count 90404
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 2813 place count 1368 transition count 90402
Deduced a syphon composed of 2 places in 57 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 2817 place count 1366 transition count 90402
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 2819 place count 1366 transition count 90400
Performed 17 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 17 places in 57 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 2853 place count 1349 transition count 90380
Drop transitions removed 6 transitions
Ensure Unique test removed 439 transitions
Reduce isomorphic transitions removed 445 transitions.
Iterating post reduction 3 with 445 rules applied. Total rules applied 3298 place count 1349 transition count 89935
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 57 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 3306 place count 1345 transition count 89931
Drop transitions removed 4 transitions
Ensure Unique test removed 92 transitions
Reduce isomorphic transitions removed 96 transitions.
Iterating post reduction 4 with 96 rules applied. Total rules applied 3402 place count 1345 transition count 89835
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 1 places in 56 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 3404 place count 1344 transition count 89836
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 3407 place count 1344 transition count 89833
Free-agglomeration rule applied 32 times.
Iterating global reduction 6 with 32 rules applied. Total rules applied 3439 place count 1344 transition count 89801
Reduce places removed 32 places and 0 transitions.
Drop transitions removed 44 transitions
Ensure Unique test removed 555 transitions
Reduce isomorphic transitions removed 599 transitions.
Iterating post reduction 6 with 631 rules applied. Total rules applied 4070 place count 1312 transition count 89202
Free-agglomeration rule (complex) applied 14 times with reduction of 16 identical transitions.
Iterating global reduction 7 with 14 rules applied. Total rules applied 4084 place count 1312 transition count 89850
Reduce places removed 14 places and 0 transitions.
Drop transitions removed 5 transitions
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 26 transitions.
Iterating post reduction 7 with 40 rules applied. Total rules applied 4124 place count 1298 transition count 89824
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 4125 place count 1297 transition count 89823
Applied a total of 4125 rules in 4581 ms. Remains 1297 /1369 variables (removed 72) and now considering 89823/93216 (removed 3393) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4584 ms. Remains : 1297/1369 places, 89823/93216 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 655 ms. (steps per millisecond=15 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 101 ms. (steps per millisecond=99 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 9231 steps, run timeout after 3001 ms. (steps per millisecond=3 ) properties seen :{}
Probabilistic random walk after 9231 steps, saw 7312 distinct states, run finished after 3001 ms. (steps per millisecond=3 ) properties seen :0
Running SMT prover for 5 properties.
[2023-03-18 01:19:33] [INFO ] Flow matrix only has 62339 transitions (discarded 27484 similar events)
// Phase 1: matrix 62339 rows 1297 cols
[2023-03-18 01:19:33] [INFO ] Computed 12 place invariants in 203 ms
[2023-03-18 01:19:34] [INFO ] [Real]Absence check using 12 positive place invariants in 12 ms returned sat
[2023-03-18 01:19:58] [INFO ] After 24158ms SMT Verify possible using state equation in real domain returned unsat :0 sat :5
[2023-03-18 01:19:59] [INFO ] State equation strengthened by 3682 read => feed constraints.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:642)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:339)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-18 01:19:59] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-18 01:19:59] [INFO ] After 25159ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 5 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 10 ms.
Support contains 6 out of 1297 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1297/1297 places, 89823/89823 transitions.
Applied a total of 0 rules in 408 ms. Remains 1297 /1297 variables (removed 0) and now considering 89823/89823 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 408 ms. Remains : 1297/1297 places, 89823/89823 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1297/1297 places, 89823/89823 transitions.
Applied a total of 0 rules in 402 ms. Remains 1297 /1297 variables (removed 0) and now considering 89823/89823 (removed 0) transitions.
[2023-03-18 01:19:59] [INFO ] Flow matrix only has 62339 transitions (discarded 27484 similar events)
[2023-03-18 01:19:59] [INFO ] Invariant cache hit.
[2023-03-18 01:20:03] [INFO ] Implicit Places using invariants in 3746 ms returned []
Implicit Place search using SMT only with invariants took 3747 ms to find 0 implicit places.
[2023-03-18 01:20:03] [INFO ] Flow matrix only has 62339 transitions (discarded 27484 similar events)
[2023-03-18 01:20:03] [INFO ] Invariant cache hit.
[2023-03-18 01:20:33] [INFO ] Dead Transitions using invariants and state equation in 29702 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33859 ms. Remains : 1297/1297 places, 89823/89823 transitions.
Graph (trivial) has 31248 edges and 1297 vertex of which 1029 / 1297 are part of one of the 152 SCC in 5 ms
Free SCC test removed 877 places
Drop transitions removed 32540 transitions
Ensure Unique test removed 48495 transitions
Reduce isomorphic transitions removed 81035 transitions.
Graph (complete) has 8497 edges and 420 vertex of which 405 are kept as prefixes of interest. Removing 15 places using SCC suffix rule.5 ms
Discarding 15 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Drop transitions removed 23 transitions
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 42 transitions.
Iterating post reduction 0 with 42 rules applied. Total rules applied 44 place count 405 transition count 8744
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 44 place count 405 transition count 8743
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 46 place count 404 transition count 8743
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 49 place count 401 transition count 8731
Iterating global reduction 1 with 3 rules applied. Total rules applied 52 place count 401 transition count 8731
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 58 place count 401 transition count 8725
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 2 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 66 place count 397 transition count 8721
Ensure Unique test removed 73 transitions
Reduce isomorphic transitions removed 73 transitions.
Iterating post reduction 2 with 73 rules applied. Total rules applied 139 place count 397 transition count 8648
Drop transitions removed 3956 transitions
Redundant transition composition rules discarded 3956 transitions
Iterating global reduction 3 with 3956 rules applied. Total rules applied 4095 place count 397 transition count 4692
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 51 transitions
Reduce isomorphic transitions removed 51 transitions.
Graph (complete) has 5382 edges and 394 vertex of which 362 are kept as prefixes of interest. Removing 32 places using SCC suffix rule.1 ms
Discarding 32 places :
Also discarding 7 output transitions
Drop transitions removed 7 transitions
Iterating post reduction 3 with 55 rules applied. Total rules applied 4150 place count 362 transition count 4634
Drop transitions removed 447 transitions
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 459 transitions.
Iterating post reduction 4 with 459 rules applied. Total rules applied 4609 place count 362 transition count 4175
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 4609 place count 362 transition count 4174
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 4611 place count 361 transition count 4174
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 4617 place count 355 transition count 4152
Iterating global reduction 5 with 6 rules applied. Total rules applied 4623 place count 355 transition count 4152
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 4627 place count 351 transition count 4136
Iterating global reduction 5 with 4 rules applied. Total rules applied 4631 place count 351 transition count 4136
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 5 with 10 rules applied. Total rules applied 4641 place count 346 transition count 4131
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 4642 place count 346 transition count 4130
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 4644 place count 345 transition count 4143
Drop transitions removed 27 transitions
Redundant transition composition rules discarded 27 transitions
Iterating global reduction 6 with 27 rules applied. Total rules applied 4671 place count 345 transition count 4116
Free-agglomeration rule applied 19 times with reduction of 7 identical transitions.
Iterating global reduction 6 with 19 rules applied. Total rules applied 4690 place count 345 transition count 4090
Reduce places removed 19 places and 0 transitions.
Ensure Unique test removed 62 transitions
Reduce isomorphic transitions removed 62 transitions.
Iterating post reduction 6 with 81 rules applied. Total rules applied 4771 place count 326 transition count 4028
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 4773 place count 325 transition count 4037
Drop transitions removed 95 transitions
Redundant transition composition rules discarded 95 transitions
Iterating global reduction 7 with 95 rules applied. Total rules applied 4868 place count 325 transition count 3942
Free-agglomeration rule applied 10 times with reduction of 2 identical transitions.
Iterating global reduction 7 with 10 rules applied. Total rules applied 4878 place count 325 transition count 3930
Reduce places removed 10 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 7 with 20 rules applied. Total rules applied 4898 place count 315 transition count 3920
Drop transitions removed 28 transitions
Redundant transition composition rules discarded 28 transitions
Iterating global reduction 8 with 28 rules applied. Total rules applied 4926 place count 315 transition count 3892
Free-agglomeration rule applied 4 times.
Iterating global reduction 8 with 4 rules applied. Total rules applied 4930 place count 315 transition count 3888
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 8 with 4 rules applied. Total rules applied 4934 place count 311 transition count 3888
Drop transitions removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 9 with 13 rules applied. Total rules applied 4947 place count 311 transition count 3875
Free-agglomeration rule applied 1 times.
Iterating global reduction 9 with 1 rules applied. Total rules applied 4948 place count 311 transition count 3874
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 4949 place count 310 transition count 3874
Free-agglomeration rule (complex) applied 7 times with reduction of 11 identical transitions.
Iterating global reduction 10 with 7 rules applied. Total rules applied 4956 place count 310 transition count 3951
Reduce places removed 7 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 10 with 8 rules applied. Total rules applied 4964 place count 303 transition count 3950
Drop transitions removed 43 transitions
Redundant transition composition rules discarded 43 transitions
Iterating global reduction 11 with 43 rules applied. Total rules applied 5007 place count 303 transition count 3907
Applied a total of 5007 rules in 1498 ms. Remains 303 /1297 variables (removed 994) and now considering 3907/89823 (removed 85916) transitions.
Running SMT prover for 5 properties.
[2023-03-18 01:20:34] [INFO ] Flow matrix only has 3789 transitions (discarded 118 similar events)
// Phase 1: matrix 3789 rows 303 cols
[2023-03-18 01:20:34] [INFO ] Computed 0 place invariants in 26 ms
[2023-03-18 01:20:36] [INFO ] After 1074ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-18 01:20:37] [INFO ] After 982ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-18 01:20:37] [INFO ] State equation strengthened by 17 read => feed constraints.
[2023-03-18 01:20:37] [INFO ] After 559ms SMT Verify possible using 17 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-18 01:20:38] [INFO ] After 1347ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 656 ms.
[2023-03-18 01:20:39] [INFO ] After 3068ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Knowledge obtained : [(AND p0 p1 p2), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X p1)), true, (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 685 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 207 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p1), (AND (NOT p1) p0 (NOT p2))]
Stuttering acceptance computed with spot in 179 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p1), (AND (NOT p1) p0 (NOT p2))]
Support contains 6 out of 1369 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1369/1369 places, 93216/93216 transitions.
Applied a total of 0 rules in 126 ms. Remains 1369 /1369 variables (removed 0) and now considering 93216/93216 (removed 0) transitions.
[2023-03-18 01:20:40] [INFO ] Flow matrix only has 62870 transitions (discarded 30346 similar events)
// Phase 1: matrix 62870 rows 1369 cols
[2023-03-18 01:20:40] [INFO ] Computed 12 place invariants in 287 ms
[2023-03-18 01:20:44] [INFO ] Implicit Places using invariants in 3732 ms returned []
Implicit Place search using SMT only with invariants took 3732 ms to find 0 implicit places.
[2023-03-18 01:20:44] [INFO ] Flow matrix only has 62870 transitions (discarded 30346 similar events)
[2023-03-18 01:20:44] [INFO ] Invariant cache hit.
[2023-03-18 01:21:14] [INFO ] Performed 88377/93216 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-18 01:21:16] [INFO ] Dead Transitions using invariants and state equation in 31945 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 35805 ms. Remains : 1369/1369 places, 93216/93216 transitions.
Computed a total of 261 stabilizing places and 30825 stable transitions
Computed a total of 261 stabilizing places and 30825 stable transitions
Detected a total of 261/1369 stabilizing places and 30825/93216 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p0 p2 p1), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X (X p1)), true, (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X (NOT (AND p0 p2 (NOT p1))))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 470 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 131 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p1), (AND (NOT p1) p0 (NOT p2))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 642 ms. (steps per millisecond=15 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 9576 steps, run timeout after 3002 ms. (steps per millisecond=3 ) properties seen :{}
Probabilistic random walk after 9576 steps, saw 7781 distinct states, run finished after 3002 ms. (steps per millisecond=3 ) properties seen :0
Running SMT prover for 5 properties.
[2023-03-18 01:21:21] [INFO ] Flow matrix only has 62870 transitions (discarded 30346 similar events)
[2023-03-18 01:21:21] [INFO ] Invariant cache hit.
[2023-03-18 01:21:21] [INFO ] [Real]Absence check using 12 positive place invariants in 15 ms returned sat
[2023-03-18 01:21:45] [INFO ] After 23827ms SMT Verify possible using state equation in real domain returned unsat :0 sat :5
[2023-03-18 01:21:46] [INFO ] State equation strengthened by 3692 read => feed constraints.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:642)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:339)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-18 01:21:46] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-18 01:21:46] [INFO ] After 25035ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 5 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 6 out of 1369 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1369/1369 places, 93216/93216 transitions.
Drop transitions removed 2811 transitions
Reduce isomorphic transitions removed 2811 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 2812 rules applied. Total rules applied 2812 place count 1369 transition count 90404
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2813 place count 1368 transition count 90404
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 2813 place count 1368 transition count 90402
Deduced a syphon composed of 2 places in 45 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 2817 place count 1366 transition count 90402
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 2819 place count 1366 transition count 90400
Performed 17 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 17 places in 46 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 2853 place count 1349 transition count 90380
Drop transitions removed 6 transitions
Ensure Unique test removed 439 transitions
Reduce isomorphic transitions removed 445 transitions.
Iterating post reduction 3 with 445 rules applied. Total rules applied 3298 place count 1349 transition count 89935
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 46 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 3306 place count 1345 transition count 89931
Drop transitions removed 4 transitions
Ensure Unique test removed 92 transitions
Reduce isomorphic transitions removed 96 transitions.
Iterating post reduction 4 with 96 rules applied. Total rules applied 3402 place count 1345 transition count 89835
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 1 places in 44 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 3404 place count 1344 transition count 89836
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 3407 place count 1344 transition count 89833
Free-agglomeration rule applied 32 times.
Iterating global reduction 6 with 32 rules applied. Total rules applied 3439 place count 1344 transition count 89801
Reduce places removed 32 places and 0 transitions.
Drop transitions removed 44 transitions
Ensure Unique test removed 555 transitions
Reduce isomorphic transitions removed 599 transitions.
Iterating post reduction 6 with 631 rules applied. Total rules applied 4070 place count 1312 transition count 89202
Free-agglomeration rule (complex) applied 14 times with reduction of 16 identical transitions.
Iterating global reduction 7 with 14 rules applied. Total rules applied 4084 place count 1312 transition count 89850
Reduce places removed 14 places and 0 transitions.
Drop transitions removed 5 transitions
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 26 transitions.
Iterating post reduction 7 with 40 rules applied. Total rules applied 4124 place count 1298 transition count 89824
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 4125 place count 1297 transition count 89823
Applied a total of 4125 rules in 3817 ms. Remains 1297 /1369 variables (removed 72) and now considering 89823/93216 (removed 3393) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3819 ms. Remains : 1297/1369 places, 89823/93216 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 642 ms. (steps per millisecond=15 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 3 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 9351 steps, run timeout after 3002 ms. (steps per millisecond=3 ) properties seen :{}
Probabilistic random walk after 9351 steps, saw 7417 distinct states, run finished after 3002 ms. (steps per millisecond=3 ) properties seen :0
Running SMT prover for 5 properties.
[2023-03-18 01:21:54] [INFO ] Flow matrix only has 62339 transitions (discarded 27484 similar events)
// Phase 1: matrix 62339 rows 1297 cols
[2023-03-18 01:21:54] [INFO ] Computed 12 place invariants in 199 ms
[2023-03-18 01:21:54] [INFO ] [Real]Absence check using 12 positive place invariants in 12 ms returned sat
[2023-03-18 01:22:18] [INFO ] After 23585ms SMT Verify possible using state equation in real domain returned unsat :0 sat :5
[2023-03-18 01:22:18] [INFO ] State equation strengthened by 3682 read => feed constraints.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:642)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:339)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-18 01:22:19] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-18 01:22:19] [INFO ] After 25034ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 5 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 16 ms.
Support contains 6 out of 1297 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1297/1297 places, 89823/89823 transitions.
Applied a total of 0 rules in 420 ms. Remains 1297 /1297 variables (removed 0) and now considering 89823/89823 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 420 ms. Remains : 1297/1297 places, 89823/89823 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1297/1297 places, 89823/89823 transitions.
Applied a total of 0 rules in 414 ms. Remains 1297 /1297 variables (removed 0) and now considering 89823/89823 (removed 0) transitions.
[2023-03-18 01:22:20] [INFO ] Flow matrix only has 62339 transitions (discarded 27484 similar events)
[2023-03-18 01:22:20] [INFO ] Invariant cache hit.
[2023-03-18 01:22:23] [INFO ] Implicit Places using invariants in 3519 ms returned []
Implicit Place search using SMT only with invariants took 3520 ms to find 0 implicit places.
[2023-03-18 01:22:23] [INFO ] Flow matrix only has 62339 transitions (discarded 27484 similar events)
[2023-03-18 01:22:23] [INFO ] Invariant cache hit.
[2023-03-18 01:22:54] [INFO ] Performed 88590/89823 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-18 01:22:54] [INFO ] Dead Transitions using invariants and state equation in 30590 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34532 ms. Remains : 1297/1297 places, 89823/89823 transitions.
Graph (trivial) has 31248 edges and 1297 vertex of which 1029 / 1297 are part of one of the 152 SCC in 4 ms
Free SCC test removed 877 places
Drop transitions removed 32540 transitions
Ensure Unique test removed 48495 transitions
Reduce isomorphic transitions removed 81035 transitions.
Graph (complete) has 8497 edges and 420 vertex of which 405 are kept as prefixes of interest. Removing 15 places using SCC suffix rule.4 ms
Discarding 15 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Drop transitions removed 23 transitions
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 42 transitions.
Iterating post reduction 0 with 42 rules applied. Total rules applied 44 place count 405 transition count 8744
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 44 place count 405 transition count 8743
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 46 place count 404 transition count 8743
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 49 place count 401 transition count 8731
Iterating global reduction 1 with 3 rules applied. Total rules applied 52 place count 401 transition count 8731
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 58 place count 401 transition count 8725
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 2 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 66 place count 397 transition count 8721
Ensure Unique test removed 73 transitions
Reduce isomorphic transitions removed 73 transitions.
Iterating post reduction 2 with 73 rules applied. Total rules applied 139 place count 397 transition count 8648
Drop transitions removed 3956 transitions
Redundant transition composition rules discarded 3956 transitions
Iterating global reduction 3 with 3956 rules applied. Total rules applied 4095 place count 397 transition count 4692
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 51 transitions
Reduce isomorphic transitions removed 51 transitions.
Graph (complete) has 5382 edges and 394 vertex of which 362 are kept as prefixes of interest. Removing 32 places using SCC suffix rule.2 ms
Discarding 32 places :
Also discarding 7 output transitions
Drop transitions removed 7 transitions
Iterating post reduction 3 with 55 rules applied. Total rules applied 4150 place count 362 transition count 4634
Drop transitions removed 447 transitions
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 459 transitions.
Iterating post reduction 4 with 459 rules applied. Total rules applied 4609 place count 362 transition count 4175
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 4609 place count 362 transition count 4174
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 4611 place count 361 transition count 4174
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 4617 place count 355 transition count 4152
Iterating global reduction 5 with 6 rules applied. Total rules applied 4623 place count 355 transition count 4152
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 4627 place count 351 transition count 4136
Iterating global reduction 5 with 4 rules applied. Total rules applied 4631 place count 351 transition count 4136
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 5 with 10 rules applied. Total rules applied 4641 place count 346 transition count 4131
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 4642 place count 346 transition count 4130
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 4644 place count 345 transition count 4143
Drop transitions removed 27 transitions
Redundant transition composition rules discarded 27 transitions
Iterating global reduction 6 with 27 rules applied. Total rules applied 4671 place count 345 transition count 4116
Free-agglomeration rule applied 19 times with reduction of 7 identical transitions.
Iterating global reduction 6 with 19 rules applied. Total rules applied 4690 place count 345 transition count 4090
Reduce places removed 19 places and 0 transitions.
Ensure Unique test removed 62 transitions
Reduce isomorphic transitions removed 62 transitions.
Iterating post reduction 6 with 81 rules applied. Total rules applied 4771 place count 326 transition count 4028
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 4773 place count 325 transition count 4037
Drop transitions removed 95 transitions
Redundant transition composition rules discarded 95 transitions
Iterating global reduction 7 with 95 rules applied. Total rules applied 4868 place count 325 transition count 3942
Free-agglomeration rule applied 10 times with reduction of 2 identical transitions.
Iterating global reduction 7 with 10 rules applied. Total rules applied 4878 place count 325 transition count 3930
Reduce places removed 10 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 7 with 20 rules applied. Total rules applied 4898 place count 315 transition count 3920
Drop transitions removed 28 transitions
Redundant transition composition rules discarded 28 transitions
Iterating global reduction 8 with 28 rules applied. Total rules applied 4926 place count 315 transition count 3892
Free-agglomeration rule applied 4 times.
Iterating global reduction 8 with 4 rules applied. Total rules applied 4930 place count 315 transition count 3888
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 8 with 4 rules applied. Total rules applied 4934 place count 311 transition count 3888
Drop transitions removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 9 with 13 rules applied. Total rules applied 4947 place count 311 transition count 3875
Free-agglomeration rule applied 1 times.
Iterating global reduction 9 with 1 rules applied. Total rules applied 4948 place count 311 transition count 3874
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 4949 place count 310 transition count 3874
Free-agglomeration rule (complex) applied 7 times with reduction of 11 identical transitions.
Iterating global reduction 10 with 7 rules applied. Total rules applied 4956 place count 310 transition count 3951
Reduce places removed 7 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 10 with 8 rules applied. Total rules applied 4964 place count 303 transition count 3950
Drop transitions removed 43 transitions
Redundant transition composition rules discarded 43 transitions
Iterating global reduction 11 with 43 rules applied. Total rules applied 5007 place count 303 transition count 3907
Applied a total of 5007 rules in 1490 ms. Remains 303 /1297 variables (removed 994) and now considering 3907/89823 (removed 85916) transitions.
Running SMT prover for 5 properties.
[2023-03-18 01:22:56] [INFO ] Flow matrix only has 3789 transitions (discarded 118 similar events)
// Phase 1: matrix 3789 rows 303 cols
[2023-03-18 01:22:56] [INFO ] Computed 0 place invariants in 27 ms
[2023-03-18 01:22:57] [INFO ] After 1133ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-18 01:22:58] [INFO ] After 1025ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-18 01:22:58] [INFO ] State equation strengthened by 17 read => feed constraints.
[2023-03-18 01:22:58] [INFO ] After 582ms SMT Verify possible using 17 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-18 01:22:59] [INFO ] After 1399ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 685 ms.
[2023-03-18 01:23:00] [INFO ] After 3197ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Knowledge obtained : [(AND p0 p2 p1), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X (X p1)), true, (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X (NOT (AND p0 p2 (NOT p1))))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 407 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 186 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p1), (AND (NOT p1) p0 (NOT p2))]
Stuttering acceptance computed with spot in 214 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p1), (AND (NOT p1) p0 (NOT p2))]
Stuttering acceptance computed with spot in 177 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p1), (AND (NOT p1) p0 (NOT p2))]
Product exploration explored 100000 steps with 1 reset in 4897 ms.
Product exploration explored 100000 steps with 4 reset in 4935 ms.
Applying partial POR strategy [false, true, true, true]
Stuttering acceptance computed with spot in 175 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p1), (AND (NOT p1) p0 (NOT p2))]
Support contains 6 out of 1369 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1369/1369 places, 93216/93216 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 1369 transition count 93216
Performed 19 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 20 places in 47 ms
Iterating global reduction 1 with 19 rules applied. Total rules applied 20 place count 1369 transition count 93213
Ensure Unique test removed 439 transitions
Reduce isomorphic transitions removed 439 transitions.
Iterating post reduction 1 with 439 rules applied. Total rules applied 459 place count 1369 transition count 92774
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 461 place count 1367 transition count 92772
Deduced a syphon composed of 18 places in 47 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 463 place count 1367 transition count 92772
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 22 places in 46 ms
Iterating global reduction 2 with 4 rules applied. Total rules applied 467 place count 1367 transition count 92772
Ensure Unique test removed 96 transitions
Reduce isomorphic transitions removed 96 transitions.
Iterating post reduction 2 with 96 rules applied. Total rules applied 563 place count 1367 transition count 92676
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 567 place count 1363 transition count 92672
Deduced a syphon composed of 18 places in 46 ms
Iterating global reduction 3 with 4 rules applied. Total rules applied 571 place count 1363 transition count 92672
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 19 places in 47 ms
Iterating global reduction 3 with 1 rules applied. Total rules applied 572 place count 1363 transition count 92675
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 575 place count 1363 transition count 92672
Deduced a syphon composed of 19 places in 46 ms
Applied a total of 575 rules in 2004 ms. Remains 1363 /1369 variables (removed 6) and now considering 92672/93216 (removed 544) transitions.
[2023-03-18 01:23:13] [INFO ] Flow matrix only has 62330 transitions (discarded 30342 similar events)
// Phase 1: matrix 62330 rows 1363 cols
[2023-03-18 01:23:13] [INFO ] Computed 12 place invariants in 224 ms
[2023-03-18 01:23:42] [INFO ] Dead Transitions using invariants and state equation in 28383 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1363/1369 places, 92672/93216 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 30391 ms. Remains : 1363/1369 places, 92672/93216 transitions.
Support contains 6 out of 1369 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1369/1369 places, 93216/93216 transitions.
Applied a total of 0 rules in 127 ms. Remains 1369 /1369 variables (removed 0) and now considering 93216/93216 (removed 0) transitions.
[2023-03-18 01:23:42] [INFO ] Flow matrix only has 62870 transitions (discarded 30346 similar events)
// Phase 1: matrix 62870 rows 1369 cols
[2023-03-18 01:23:42] [INFO ] Computed 12 place invariants in 300 ms
[2023-03-18 01:23:45] [INFO ] Implicit Places using invariants in 3725 ms returned []
Implicit Place search using SMT only with invariants took 3727 ms to find 0 implicit places.
[2023-03-18 01:23:45] [INFO ] Flow matrix only has 62870 transitions (discarded 30346 similar events)
[2023-03-18 01:23:45] [INFO ] Invariant cache hit.
[2023-03-18 01:24:16] [INFO ] Performed 89490/93216 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-18 01:24:17] [INFO ] Dead Transitions using invariants and state equation in 31526 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 35382 ms. Remains : 1369/1369 places, 93216/93216 transitions.
Treatment of property RERS2020-PT-pb107-LTLFireability-08 finished in 373408 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)&&((p1 U p2)||X(G(p0))))))'
Support contains 6 out of 1369 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1369/1369 places, 93216/93216 transitions.
Applied a total of 0 rules in 249 ms. Remains 1369 /1369 variables (removed 0) and now considering 93216/93216 (removed 0) transitions.
[2023-03-18 01:24:20] [INFO ] Flow matrix only has 62870 transitions (discarded 30346 similar events)
[2023-03-18 01:24:20] [INFO ] Invariant cache hit.
[2023-03-18 01:24:24] [INFO ] Implicit Places using invariants in 3480 ms returned []
Implicit Place search using SMT only with invariants took 3481 ms to find 0 implicit places.
[2023-03-18 01:24:24] [INFO ] Flow matrix only has 62870 transitions (discarded 30346 similar events)
[2023-03-18 01:24:24] [INFO ] Invariant cache hit.
[2023-03-18 01:24:54] [INFO ] Performed 84342/93216 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-18 01:24:57] [INFO ] Dead Transitions using invariants and state equation in 33414 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 37148 ms. Remains : 1369/1369 places, 93216/93216 transitions.
Stuttering acceptance computed with spot in 239 ms :[(NOT p0), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p2)), true, (NOT p2)]
Running random walk in product with property : RERS2020-PT-pb107-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(OR p2 p1), acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=3 dest: 5}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=5 dest: 4}, { cond=(AND (NOT p2) p1), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p2:(AND (EQ s799 1) (EQ s1260 1)), p1:(AND (EQ s729 1) (EQ s879 1)), p0:(OR (EQ s126 0) (EQ s1219 0))], 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][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 1 reset in 5001 ms.
Product exploration explored 100000 steps with 1 reset in 5037 ms.
Computed a total of 261 stabilizing places and 30825 stable transitions
Computed a total of 261 stabilizing places and 30825 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p1) p0), (X (NOT (OR p2 p1))), (X (NOT (AND (NOT p2) p1))), (X p0), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (AND (NOT p2) (NOT p1))), (X (X (NOT (OR p2 p1)))), (X (X (NOT (AND (NOT p2) p1)))), true, (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (AND (NOT p2) (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 14 factoid took 496 ms. Reduced automaton from 6 states, 12 edges and 3 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 84 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 791 ms. (steps per millisecond=12 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 9402 steps, run timeout after 3002 ms. (steps per millisecond=3 ) properties seen :{}
Probabilistic random walk after 9402 steps, saw 7676 distinct states, run finished after 3002 ms. (steps per millisecond=3 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-18 01:25:13] [INFO ] Flow matrix only has 62870 transitions (discarded 30346 similar events)
[2023-03-18 01:25:13] [INFO ] Invariant cache hit.
[2023-03-18 01:25:13] [INFO ] [Real]Absence check using 12 positive place invariants in 11 ms returned sat
[2023-03-18 01:25:33] [INFO ] After 20334ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-18 01:25:34] [INFO ] State equation strengthened by 3692 read => feed constraints.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:642)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:339)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-18 01:25:38] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-18 01:25:38] [INFO ] After 25032ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 1369 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1369/1369 places, 93216/93216 transitions.
Drop transitions removed 2811 transitions
Reduce isomorphic transitions removed 2811 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 2812 rules applied. Total rules applied 2812 place count 1369 transition count 90404
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2813 place count 1368 transition count 90404
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 2813 place count 1368 transition count 90402
Deduced a syphon composed of 2 places in 45 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 2817 place count 1366 transition count 90402
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 2819 place count 1366 transition count 90400
Performed 17 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 17 places in 46 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 2853 place count 1349 transition count 90380
Drop transitions removed 6 transitions
Ensure Unique test removed 439 transitions
Reduce isomorphic transitions removed 445 transitions.
Iterating post reduction 3 with 445 rules applied. Total rules applied 3298 place count 1349 transition count 89935
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 46 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 3306 place count 1345 transition count 89931
Drop transitions removed 4 transitions
Ensure Unique test removed 92 transitions
Reduce isomorphic transitions removed 96 transitions.
Iterating post reduction 4 with 96 rules applied. Total rules applied 3402 place count 1345 transition count 89835
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 1 places in 46 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 3404 place count 1344 transition count 89836
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 3407 place count 1344 transition count 89833
Free-agglomeration rule applied 32 times.
Iterating global reduction 6 with 32 rules applied. Total rules applied 3439 place count 1344 transition count 89801
Reduce places removed 32 places and 0 transitions.
Drop transitions removed 44 transitions
Ensure Unique test removed 555 transitions
Reduce isomorphic transitions removed 599 transitions.
Iterating post reduction 6 with 631 rules applied. Total rules applied 4070 place count 1312 transition count 89202
Free-agglomeration rule (complex) applied 15 times with reduction of 16 identical transitions.
Iterating global reduction 7 with 15 rules applied. Total rules applied 4085 place count 1312 transition count 89935
Reduce places removed 15 places and 0 transitions.
Drop transitions removed 5 transitions
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 26 transitions.
Iterating post reduction 7 with 41 rules applied. Total rules applied 4126 place count 1297 transition count 89909
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 4127 place count 1296 transition count 89908
Applied a total of 4127 rules in 3821 ms. Remains 1296 /1369 variables (removed 73) and now considering 89908/93216 (removed 3308) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3823 ms. Remains : 1296/1369 places, 89908/93216 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 511 ms. (steps per millisecond=19 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 10046 steps, run timeout after 3003 ms. (steps per millisecond=3 ) properties seen :{}
Probabilistic random walk after 10046 steps, saw 8006 distinct states, run finished after 3003 ms. (steps per millisecond=3 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-18 01:25:45] [INFO ] Flow matrix only has 62424 transitions (discarded 27484 similar events)
// Phase 1: matrix 62424 rows 1296 cols
[2023-03-18 01:25:46] [INFO ] Computed 12 place invariants in 220 ms
[2023-03-18 01:25:46] [INFO ] [Real]Absence check using 12 positive place invariants in 9 ms returned sat
[2023-03-18 01:26:06] [INFO ] After 20475ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-18 01:26:07] [INFO ] State equation strengthened by 3688 read => feed constraints.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:642)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:339)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-18 01:26:11] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-18 01:26:11] [INFO ] After 25036ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 14 ms.
Support contains 2 out of 1296 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1296/1296 places, 89908/89908 transitions.
Applied a total of 0 rules in 391 ms. Remains 1296 /1296 variables (removed 0) and now considering 89908/89908 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 391 ms. Remains : 1296/1296 places, 89908/89908 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1296/1296 places, 89908/89908 transitions.
Applied a total of 0 rules in 395 ms. Remains 1296 /1296 variables (removed 0) and now considering 89908/89908 (removed 0) transitions.
[2023-03-18 01:26:11] [INFO ] Flow matrix only has 62424 transitions (discarded 27484 similar events)
[2023-03-18 01:26:11] [INFO ] Invariant cache hit.
[2023-03-18 01:26:15] [INFO ] Implicit Places using invariants in 3646 ms returned []
Implicit Place search using SMT only with invariants took 3659 ms to find 0 implicit places.
[2023-03-18 01:26:15] [INFO ] Flow matrix only has 62424 transitions (discarded 27484 similar events)
[2023-03-18 01:26:15] [INFO ] Invariant cache hit.
[2023-03-18 01:26:45] [INFO ] Performed 89682/89908 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-18 01:26:45] [INFO ] Dead Transitions using invariants and state equation in 30294 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34356 ms. Remains : 1296/1296 places, 89908/89908 transitions.
Graph (trivial) has 31685 edges and 1296 vertex of which 1033 / 1296 are part of one of the 152 SCC in 4 ms
Free SCC test removed 881 places
Drop transitions removed 33195 transitions
Ensure Unique test removed 48136 transitions
Reduce isomorphic transitions removed 81331 transitions.
Graph (complete) has 8274 edges and 415 vertex of which 400 are kept as prefixes of interest. Removing 15 places using SCC suffix rule.4 ms
Discarding 15 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Drop transitions removed 23 transitions
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 42 transitions.
Iterating post reduction 0 with 42 rules applied. Total rules applied 44 place count 400 transition count 8533
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 44 place count 400 transition count 8532
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 46 place count 399 transition count 8532
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 49 place count 396 transition count 8520
Iterating global reduction 1 with 3 rules applied. Total rules applied 52 place count 396 transition count 8520
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 58 place count 396 transition count 8514
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 2 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 66 place count 392 transition count 8510
Ensure Unique test removed 73 transitions
Reduce isomorphic transitions removed 73 transitions.
Iterating post reduction 2 with 73 rules applied. Total rules applied 139 place count 392 transition count 8437
Drop transitions removed 3895 transitions
Redundant transition composition rules discarded 3895 transitions
Iterating global reduction 3 with 3895 rules applied. Total rules applied 4034 place count 392 transition count 4542
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 51 transitions
Reduce isomorphic transitions removed 51 transitions.
Graph (complete) has 5191 edges and 389 vertex of which 356 are kept as prefixes of interest. Removing 33 places using SCC suffix rule.2 ms
Discarding 33 places :
Also discarding 7 output transitions
Drop transitions removed 7 transitions
Iterating post reduction 3 with 55 rules applied. Total rules applied 4089 place count 356 transition count 4484
Drop transitions removed 450 transitions
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 462 transitions.
Iterating post reduction 4 with 462 rules applied. Total rules applied 4551 place count 356 transition count 4022
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 4551 place count 356 transition count 4021
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 4553 place count 355 transition count 4021
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 4559 place count 349 transition count 3999
Iterating global reduction 5 with 6 rules applied. Total rules applied 4565 place count 349 transition count 3999
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 4569 place count 345 transition count 3983
Iterating global reduction 5 with 4 rules applied. Total rules applied 4573 place count 345 transition count 3983
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 5 with 10 rules applied. Total rules applied 4583 place count 340 transition count 3978
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 4584 place count 340 transition count 3977
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 4586 place count 339 transition count 3990
Drop transitions removed 23 transitions
Redundant transition composition rules discarded 23 transitions
Iterating global reduction 6 with 23 rules applied. Total rules applied 4609 place count 339 transition count 3967
Free-agglomeration rule applied 20 times with reduction of 7 identical transitions.
Iterating global reduction 6 with 20 rules applied. Total rules applied 4629 place count 339 transition count 3940
Reduce places removed 20 places and 0 transitions.
Ensure Unique test removed 62 transitions
Reduce isomorphic transitions removed 62 transitions.
Iterating post reduction 6 with 82 rules applied. Total rules applied 4711 place count 319 transition count 3878
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 4713 place count 318 transition count 3887
Drop transitions removed 93 transitions
Redundant transition composition rules discarded 93 transitions
Iterating global reduction 7 with 93 rules applied. Total rules applied 4806 place count 318 transition count 3794
Free-agglomeration rule applied 11 times with reduction of 2 identical transitions.
Iterating global reduction 7 with 11 rules applied. Total rules applied 4817 place count 318 transition count 3781
Reduce places removed 11 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 7 with 21 rules applied. Total rules applied 4838 place count 307 transition count 3771
Drop transitions removed 28 transitions
Redundant transition composition rules discarded 28 transitions
Iterating global reduction 8 with 28 rules applied. Total rules applied 4866 place count 307 transition count 3743
Free-agglomeration rule applied 4 times.
Iterating global reduction 8 with 4 rules applied. Total rules applied 4870 place count 307 transition count 3739
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 8 with 4 rules applied. Total rules applied 4874 place count 303 transition count 3739
Drop transitions removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 9 with 11 rules applied. Total rules applied 4885 place count 303 transition count 3728
Free-agglomeration rule applied 1 times.
Iterating global reduction 9 with 1 rules applied. Total rules applied 4886 place count 303 transition count 3727
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 4887 place count 302 transition count 3727
Free-agglomeration rule (complex) applied 7 times with reduction of 11 identical transitions.
Iterating global reduction 10 with 7 rules applied. Total rules applied 4894 place count 302 transition count 3800
Reduce places removed 7 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 10 with 8 rules applied. Total rules applied 4902 place count 295 transition count 3799
Drop transitions removed 41 transitions
Redundant transition composition rules discarded 41 transitions
Iterating global reduction 11 with 41 rules applied. Total rules applied 4943 place count 295 transition count 3758
Applied a total of 4943 rules in 1454 ms. Remains 295 /1296 variables (removed 1001) and now considering 3758/89908 (removed 86150) transitions.
Running SMT prover for 1 properties.
[2023-03-18 01:26:47] [INFO ] Flow matrix only has 3642 transitions (discarded 116 similar events)
// Phase 1: matrix 3642 rows 295 cols
[2023-03-18 01:26:47] [INFO ] Computed 0 place invariants in 21 ms
[2023-03-18 01:26:48] [INFO ] After 564ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 01:26:48] [INFO ] After 510ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 01:26:48] [INFO ] State equation strengthened by 16 read => feed constraints.
[2023-03-18 01:26:48] [INFO ] After 78ms SMT Verify possible using 16 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-18 01:26:48] [INFO ] After 188ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 62 ms.
[2023-03-18 01:26:48] [INFO ] After 820ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND (NOT p2) (NOT p1) p0), (X (NOT (OR p2 p1))), (X (NOT (AND (NOT p2) p1))), (X p0), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (AND (NOT p2) (NOT p1))), (X (X (NOT (OR p2 p1)))), (X (X (NOT (AND (NOT p2) p1)))), true, (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (AND (NOT p2) (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 14 factoid took 557 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 77 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 74 ms :[true, (NOT p0), (NOT p0)]
Support contains 2 out of 1369 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 1369/1369 places, 93216/93216 transitions.
Applied a total of 0 rules in 121 ms. Remains 1369 /1369 variables (removed 0) and now considering 93216/93216 (removed 0) transitions.
[2023-03-18 01:26:49] [INFO ] Flow matrix only has 62870 transitions (discarded 30346 similar events)
// Phase 1: matrix 62870 rows 1369 cols
[2023-03-18 01:26:49] [INFO ] Computed 12 place invariants in 227 ms
[2023-03-18 01:26:53] [INFO ] Implicit Places using invariants in 3589 ms returned []
Implicit Place search using SMT only with invariants took 3590 ms to find 0 implicit places.
[2023-03-18 01:26:53] [INFO ] Flow matrix only has 62870 transitions (discarded 30346 similar events)
[2023-03-18 01:26:53] [INFO ] Invariant cache hit.
[2023-03-18 01:27:23] [INFO ] Performed 90316/93216 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-18 01:27:24] [INFO ] Dead Transitions using invariants and state equation in 31191 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 34906 ms. Remains : 1369/1369 places, 93216/93216 transitions.
Computed a total of 261 stabilizing places and 30825 stable transitions
Computed a total of 261 stabilizing places and 30825 stable transitions
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 194 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 91 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 592 ms. (steps per millisecond=16 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 9716 steps, run timeout after 3002 ms. (steps per millisecond=3 ) properties seen :{}
Probabilistic random walk after 9716 steps, saw 7871 distinct states, run finished after 3005 ms. (steps per millisecond=3 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-18 01:27:29] [INFO ] Flow matrix only has 62870 transitions (discarded 30346 similar events)
[2023-03-18 01:27:29] [INFO ] Invariant cache hit.
[2023-03-18 01:27:29] [INFO ] [Real]Absence check using 12 positive place invariants in 12 ms returned sat
[2023-03-18 01:27:48] [INFO ] After 19434ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-18 01:27:49] [INFO ] State equation strengthened by 3692 read => feed constraints.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:642)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:339)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-18 01:27:54] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-18 01:27:54] [INFO ] After 25019ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 1369 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1369/1369 places, 93216/93216 transitions.
Drop transitions removed 2811 transitions
Reduce isomorphic transitions removed 2811 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 2812 rules applied. Total rules applied 2812 place count 1369 transition count 90404
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2813 place count 1368 transition count 90404
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 2813 place count 1368 transition count 90402
Deduced a syphon composed of 2 places in 45 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 2817 place count 1366 transition count 90402
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 2819 place count 1366 transition count 90400
Performed 17 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 17 places in 49 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 2853 place count 1349 transition count 90380
Drop transitions removed 6 transitions
Ensure Unique test removed 439 transitions
Reduce isomorphic transitions removed 445 transitions.
Iterating post reduction 3 with 445 rules applied. Total rules applied 3298 place count 1349 transition count 89935
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 45 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 3306 place count 1345 transition count 89931
Drop transitions removed 4 transitions
Ensure Unique test removed 92 transitions
Reduce isomorphic transitions removed 96 transitions.
Iterating post reduction 4 with 96 rules applied. Total rules applied 3402 place count 1345 transition count 89835
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 1 places in 45 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 3404 place count 1344 transition count 89836
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 3407 place count 1344 transition count 89833
Free-agglomeration rule applied 32 times.
Iterating global reduction 6 with 32 rules applied. Total rules applied 3439 place count 1344 transition count 89801
Reduce places removed 32 places and 0 transitions.
Drop transitions removed 44 transitions
Ensure Unique test removed 555 transitions
Reduce isomorphic transitions removed 599 transitions.
Iterating post reduction 6 with 631 rules applied. Total rules applied 4070 place count 1312 transition count 89202
Free-agglomeration rule (complex) applied 15 times with reduction of 16 identical transitions.
Iterating global reduction 7 with 15 rules applied. Total rules applied 4085 place count 1312 transition count 89935
Reduce places removed 15 places and 0 transitions.
Drop transitions removed 5 transitions
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 26 transitions.
Iterating post reduction 7 with 41 rules applied. Total rules applied 4126 place count 1297 transition count 89909
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 4127 place count 1296 transition count 89908
Applied a total of 4127 rules in 3831 ms. Remains 1296 /1369 variables (removed 73) and now considering 89908/93216 (removed 3308) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3833 ms. Remains : 1296/1369 places, 89908/93216 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 532 ms. (steps per millisecond=18 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 8896 steps, run timeout after 3003 ms. (steps per millisecond=2 ) properties seen :{}
Probabilistic random walk after 8896 steps, saw 7015 distinct states, run finished after 3003 ms. (steps per millisecond=2 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-18 01:28:01] [INFO ] Flow matrix only has 62424 transitions (discarded 27484 similar events)
// Phase 1: matrix 62424 rows 1296 cols
[2023-03-18 01:28:01] [INFO ] Computed 12 place invariants in 181 ms
[2023-03-18 01:28:02] [INFO ] [Real]Absence check using 12 positive place invariants in 8 ms returned sat
[2023-03-18 01:28:21] [INFO ] After 19452ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-18 01:28:21] [INFO ] State equation strengthened by 3688 read => feed constraints.
[2023-03-18 01:28:26] [INFO ] After 4993ms SMT Verify possible using 3688 Read/Feed constraints in real domain returned unsat :0 sat :0
[2023-03-18 01:28:26] [INFO ] After 25029ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 14 ms.
Support contains 2 out of 1296 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1296/1296 places, 89908/89908 transitions.
Applied a total of 0 rules in 376 ms. Remains 1296 /1296 variables (removed 0) and now considering 89908/89908 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 376 ms. Remains : 1296/1296 places, 89908/89908 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1296/1296 places, 89908/89908 transitions.
Applied a total of 0 rules in 374 ms. Remains 1296 /1296 variables (removed 0) and now considering 89908/89908 (removed 0) transitions.
[2023-03-18 01:28:27] [INFO ] Flow matrix only has 62424 transitions (discarded 27484 similar events)
[2023-03-18 01:28:27] [INFO ] Invariant cache hit.
[2023-03-18 01:28:31] [INFO ] Implicit Places using invariants in 3477 ms returned []
Implicit Place search using SMT only with invariants took 3478 ms to find 0 implicit places.
[2023-03-18 01:28:31] [INFO ] Flow matrix only has 62424 transitions (discarded 27484 similar events)
[2023-03-18 01:28:31] [INFO ] Invariant cache hit.
[2023-03-18 01:29:00] [INFO ] Dead Transitions using invariants and state equation in 29466 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33328 ms. Remains : 1296/1296 places, 89908/89908 transitions.
Graph (trivial) has 31685 edges and 1296 vertex of which 1033 / 1296 are part of one of the 152 SCC in 4 ms
Free SCC test removed 881 places
Drop transitions removed 33195 transitions
Ensure Unique test removed 48136 transitions
Reduce isomorphic transitions removed 81331 transitions.
Graph (complete) has 8274 edges and 415 vertex of which 400 are kept as prefixes of interest. Removing 15 places using SCC suffix rule.4 ms
Discarding 15 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Drop transitions removed 23 transitions
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 42 transitions.
Iterating post reduction 0 with 42 rules applied. Total rules applied 44 place count 400 transition count 8533
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 44 place count 400 transition count 8532
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 46 place count 399 transition count 8532
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 49 place count 396 transition count 8520
Iterating global reduction 1 with 3 rules applied. Total rules applied 52 place count 396 transition count 8520
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 58 place count 396 transition count 8514
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 66 place count 392 transition count 8510
Ensure Unique test removed 73 transitions
Reduce isomorphic transitions removed 73 transitions.
Iterating post reduction 2 with 73 rules applied. Total rules applied 139 place count 392 transition count 8437
Drop transitions removed 3895 transitions
Redundant transition composition rules discarded 3895 transitions
Iterating global reduction 3 with 3895 rules applied. Total rules applied 4034 place count 392 transition count 4542
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 51 transitions
Reduce isomorphic transitions removed 51 transitions.
Graph (complete) has 5191 edges and 389 vertex of which 356 are kept as prefixes of interest. Removing 33 places using SCC suffix rule.1 ms
Discarding 33 places :
Also discarding 7 output transitions
Drop transitions removed 7 transitions
Iterating post reduction 3 with 55 rules applied. Total rules applied 4089 place count 356 transition count 4484
Drop transitions removed 450 transitions
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 462 transitions.
Iterating post reduction 4 with 462 rules applied. Total rules applied 4551 place count 356 transition count 4022
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 4551 place count 356 transition count 4021
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 4553 place count 355 transition count 4021
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 4559 place count 349 transition count 3999
Iterating global reduction 5 with 6 rules applied. Total rules applied 4565 place count 349 transition count 3999
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 4569 place count 345 transition count 3983
Iterating global reduction 5 with 4 rules applied. Total rules applied 4573 place count 345 transition count 3983
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 5 with 10 rules applied. Total rules applied 4583 place count 340 transition count 3978
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 4584 place count 340 transition count 3977
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 4586 place count 339 transition count 3990
Drop transitions removed 23 transitions
Redundant transition composition rules discarded 23 transitions
Iterating global reduction 6 with 23 rules applied. Total rules applied 4609 place count 339 transition count 3967
Free-agglomeration rule applied 20 times with reduction of 7 identical transitions.
Iterating global reduction 6 with 20 rules applied. Total rules applied 4629 place count 339 transition count 3940
Reduce places removed 20 places and 0 transitions.
Ensure Unique test removed 62 transitions
Reduce isomorphic transitions removed 62 transitions.
Iterating post reduction 6 with 82 rules applied. Total rules applied 4711 place count 319 transition count 3878
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 4713 place count 318 transition count 3887
Drop transitions removed 93 transitions
Redundant transition composition rules discarded 93 transitions
Iterating global reduction 7 with 93 rules applied. Total rules applied 4806 place count 318 transition count 3794
Free-agglomeration rule applied 11 times with reduction of 2 identical transitions.
Iterating global reduction 7 with 11 rules applied. Total rules applied 4817 place count 318 transition count 3781
Reduce places removed 11 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 7 with 21 rules applied. Total rules applied 4838 place count 307 transition count 3771
Drop transitions removed 28 transitions
Redundant transition composition rules discarded 28 transitions
Iterating global reduction 8 with 28 rules applied. Total rules applied 4866 place count 307 transition count 3743
Free-agglomeration rule applied 4 times.
Iterating global reduction 8 with 4 rules applied. Total rules applied 4870 place count 307 transition count 3739
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 8 with 4 rules applied. Total rules applied 4874 place count 303 transition count 3739
Drop transitions removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 9 with 11 rules applied. Total rules applied 4885 place count 303 transition count 3728
Free-agglomeration rule applied 1 times.
Iterating global reduction 9 with 1 rules applied. Total rules applied 4886 place count 303 transition count 3727
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 4887 place count 302 transition count 3727
Free-agglomeration rule (complex) applied 7 times with reduction of 11 identical transitions.
Iterating global reduction 10 with 7 rules applied. Total rules applied 4894 place count 302 transition count 3800
Reduce places removed 7 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 10 with 8 rules applied. Total rules applied 4902 place count 295 transition count 3799
Drop transitions removed 41 transitions
Redundant transition composition rules discarded 41 transitions
Iterating global reduction 11 with 41 rules applied. Total rules applied 4943 place count 295 transition count 3758
Applied a total of 4943 rules in 1466 ms. Remains 295 /1296 variables (removed 1001) and now considering 3758/89908 (removed 86150) transitions.
Running SMT prover for 1 properties.
[2023-03-18 01:29:02] [INFO ] Flow matrix only has 3642 transitions (discarded 116 similar events)
// Phase 1: matrix 3642 rows 295 cols
[2023-03-18 01:29:02] [INFO ] Computed 0 place invariants in 18 ms
[2023-03-18 01:29:02] [INFO ] After 621ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 01:29:03] [INFO ] After 514ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 01:29:03] [INFO ] State equation strengthened by 16 read => feed constraints.
[2023-03-18 01:29:03] [INFO ] After 75ms SMT Verify possible using 16 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-18 01:29:03] [INFO ] After 178ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 62 ms.
[2023-03-18 01:29:03] [INFO ] After 809ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 128 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 73 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 71 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 72 ms :[true, (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1 reset in 4852 ms.
Product exploration explored 100000 steps with 0 reset in 5013 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 78 ms :[true, (NOT p0), (NOT p0)]
Support contains 2 out of 1369 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1369/1369 places, 93216/93216 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 1369 transition count 93216
Performed 19 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 20 places in 46 ms
Iterating global reduction 1 with 19 rules applied. Total rules applied 20 place count 1369 transition count 93213
Ensure Unique test removed 439 transitions
Reduce isomorphic transitions removed 439 transitions.
Iterating post reduction 1 with 439 rules applied. Total rules applied 459 place count 1369 transition count 92774
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 461 place count 1367 transition count 92772
Deduced a syphon composed of 18 places in 46 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 463 place count 1367 transition count 92772
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 22 places in 86 ms
Iterating global reduction 2 with 4 rules applied. Total rules applied 467 place count 1367 transition count 92772
Ensure Unique test removed 96 transitions
Reduce isomorphic transitions removed 96 transitions.
Iterating post reduction 2 with 96 rules applied. Total rules applied 563 place count 1367 transition count 92676
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 567 place count 1363 transition count 92672
Deduced a syphon composed of 18 places in 47 ms
Iterating global reduction 3 with 4 rules applied. Total rules applied 571 place count 1363 transition count 92672
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 19 places in 47 ms
Iterating global reduction 3 with 1 rules applied. Total rules applied 572 place count 1363 transition count 92675
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 575 place count 1363 transition count 92672
Deduced a syphon composed of 19 places in 47 ms
Applied a total of 575 rules in 2172 ms. Remains 1363 /1369 variables (removed 6) and now considering 92672/93216 (removed 544) transitions.
[2023-03-18 01:29:16] [INFO ] Flow matrix only has 62330 transitions (discarded 30342 similar events)
// Phase 1: matrix 62330 rows 1363 cols
[2023-03-18 01:29:16] [INFO ] Computed 12 place invariants in 222 ms
[2023-03-18 01:29:44] [INFO ] Dead Transitions using invariants and state equation in 28686 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1363/1369 places, 92672/93216 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 30861 ms. Remains : 1363/1369 places, 92672/93216 transitions.
Support contains 2 out of 1369 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1369/1369 places, 93216/93216 transitions.
Applied a total of 0 rules in 129 ms. Remains 1369 /1369 variables (removed 0) and now considering 93216/93216 (removed 0) transitions.
[2023-03-18 01:29:45] [INFO ] Flow matrix only has 62870 transitions (discarded 30346 similar events)
// Phase 1: matrix 62870 rows 1369 cols
[2023-03-18 01:29:45] [INFO ] Computed 12 place invariants in 268 ms
[2023-03-18 01:29:48] [INFO ] Implicit Places using invariants in 3616 ms returned []
Implicit Place search using SMT only with invariants took 3616 ms to find 0 implicit places.
[2023-03-18 01:29:48] [INFO ] Flow matrix only has 62870 transitions (discarded 30346 similar events)
[2023-03-18 01:29:48] [INFO ] Invariant cache hit.
[2023-03-18 01:30:19] [INFO ] Performed 86767/93216 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-18 01:30:21] [INFO ] Dead Transitions using invariants and state equation in 32475 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 36225 ms. Remains : 1369/1369 places, 93216/93216 transitions.
Treatment of property RERS2020-PT-pb107-LTLFireability-09 finished in 363819 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 X(G(p1))))'
Support contains 4 out of 1369 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1369/1369 places, 93216/93216 transitions.
Applied a total of 0 rules in 133 ms. Remains 1369 /1369 variables (removed 0) and now considering 93216/93216 (removed 0) transitions.
[2023-03-18 01:30:24] [INFO ] Flow matrix only has 62870 transitions (discarded 30346 similar events)
[2023-03-18 01:30:24] [INFO ] Invariant cache hit.
[2023-03-18 01:30:28] [INFO ] Implicit Places using invariants in 3631 ms returned []
Implicit Place search using SMT only with invariants took 3633 ms to find 0 implicit places.
[2023-03-18 01:30:28] [INFO ] Flow matrix only has 62870 transitions (discarded 30346 similar events)
[2023-03-18 01:30:28] [INFO ] Invariant cache hit.
[2023-03-18 01:30:58] [INFO ] Performed 80134/93216 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-18 01:31:03] [INFO ] Dead Transitions using invariants and state equation in 35272 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 39041 ms. Remains : 1369/1369 places, 93216/93216 transitions.
Stuttering acceptance computed with spot in 177 ms :[(NOT p1), (AND (NOT p1) p0), (NOT p1), true, (AND p1 p0)]
Running random walk in product with property : RERS2020-PT-pb107-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 3}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 4}], [{ cond=p0, acceptance={} source=2 dest: 0}, { cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(AND p0 p1), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={} source=4 dest: 4}]], initial=2, aps=[p1:(AND (EQ s29 1) (EQ s241 1)), p0:(AND (EQ s997 1) (EQ s1341 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration timeout after 86130 steps with 21489 reset in 10002 ms.
Product exploration explored 100000 steps with 24916 reset in 9066 ms.
Computed a total of 261 stabilizing places and 30825 stable transitions
Computed a total of 261 stabilizing places and 30825 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), true, (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 13 factoid took 589 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter sensitive) to 4 states, 10 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 101 ms :[(NOT p1), (NOT p1), true, (AND p1 p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 635 ms. (steps per millisecond=15 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 10025 steps, run timeout after 3001 ms. (steps per millisecond=3 ) properties seen :{}
Probabilistic random walk after 10025 steps, saw 8065 distinct states, run finished after 3002 ms. (steps per millisecond=3 ) properties seen :0
Running SMT prover for 5 properties.
[2023-03-18 01:31:28] [INFO ] Flow matrix only has 62870 transitions (discarded 30346 similar events)
[2023-03-18 01:31:28] [INFO ] Invariant cache hit.
[2023-03-18 01:31:28] [INFO ] [Real]Absence check using 12 positive place invariants in 10 ms returned sat
[2023-03-18 01:31:50] [INFO ] After 21989ms SMT Verify possible using state equation in real domain returned unsat :0 sat :3 real:2
[2023-03-18 01:31:51] [INFO ] State equation strengthened by 3692 read => feed constraints.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:642)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:339)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-18 01:31:53] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-18 01:31:53] [INFO ] After 25023ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 5 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 1369 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1369/1369 places, 93216/93216 transitions.
Drop transitions removed 2811 transitions
Reduce isomorphic transitions removed 2811 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 2812 rules applied. Total rules applied 2812 place count 1369 transition count 90404
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2813 place count 1368 transition count 90404
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 2813 place count 1368 transition count 90402
Deduced a syphon composed of 2 places in 72 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 2817 place count 1366 transition count 90402
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 2819 place count 1366 transition count 90400
Performed 17 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 17 places in 57 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 2853 place count 1349 transition count 90380
Drop transitions removed 6 transitions
Ensure Unique test removed 439 transitions
Reduce isomorphic transitions removed 445 transitions.
Iterating post reduction 3 with 445 rules applied. Total rules applied 3298 place count 1349 transition count 89935
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 56 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 3306 place count 1345 transition count 89931
Drop transitions removed 4 transitions
Ensure Unique test removed 92 transitions
Reduce isomorphic transitions removed 96 transitions.
Iterating post reduction 4 with 96 rules applied. Total rules applied 3402 place count 1345 transition count 89835
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 1 places in 57 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 3404 place count 1344 transition count 89836
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 3407 place count 1344 transition count 89833
Free-agglomeration rule applied 32 times.
Iterating global reduction 6 with 32 rules applied. Total rules applied 3439 place count 1344 transition count 89801
Reduce places removed 32 places and 0 transitions.
Drop transitions removed 44 transitions
Ensure Unique test removed 555 transitions
Reduce isomorphic transitions removed 599 transitions.
Iterating post reduction 6 with 631 rules applied. Total rules applied 4070 place count 1312 transition count 89202
Free-agglomeration rule (complex) applied 15 times with reduction of 16 identical transitions.
Iterating global reduction 7 with 15 rules applied. Total rules applied 4085 place count 1312 transition count 89935
Reduce places removed 15 places and 0 transitions.
Drop transitions removed 5 transitions
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 26 transitions.
Iterating post reduction 7 with 41 rules applied. Total rules applied 4126 place count 1297 transition count 89909
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 4127 place count 1296 transition count 89908
Applied a total of 4127 rules in 4728 ms. Remains 1296 /1369 variables (removed 73) and now considering 89908/93216 (removed 3308) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4732 ms. Remains : 1296/1369 places, 89908/93216 transitions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 857 ms. (steps per millisecond=11 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 111 ms. (steps per millisecond=90 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 120 ms. (steps per millisecond=83 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 8292 steps, run timeout after 3003 ms. (steps per millisecond=2 ) properties seen :{}
Probabilistic random walk after 8292 steps, saw 6497 distinct states, run finished after 3003 ms. (steps per millisecond=2 ) properties seen :0
Running SMT prover for 5 properties.
[2023-03-18 01:32:02] [INFO ] Flow matrix only has 62424 transitions (discarded 27484 similar events)
// Phase 1: matrix 62424 rows 1296 cols
[2023-03-18 01:32:02] [INFO ] Computed 12 place invariants in 218 ms
[2023-03-18 01:32:02] [INFO ] [Real]Absence check using 12 positive place invariants in 8 ms returned sat
[2023-03-18 01:32:24] [INFO ] After 21400ms SMT Verify possible using state equation in real domain returned unsat :0 sat :3 real:2
[2023-03-18 01:32:24] [INFO ] State equation strengthened by 3688 read => feed constraints.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:642)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:339)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-18 01:32:27] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-18 01:32:27] [INFO ] After 25039ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 5 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 16 ms.
Support contains 4 out of 1296 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1296/1296 places, 89908/89908 transitions.
Applied a total of 0 rules in 459 ms. Remains 1296 /1296 variables (removed 0) and now considering 89908/89908 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 459 ms. Remains : 1296/1296 places, 89908/89908 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1296/1296 places, 89908/89908 transitions.
Applied a total of 0 rules in 399 ms. Remains 1296 /1296 variables (removed 0) and now considering 89908/89908 (removed 0) transitions.
[2023-03-18 01:32:28] [INFO ] Flow matrix only has 62424 transitions (discarded 27484 similar events)
[2023-03-18 01:32:28] [INFO ] Invariant cache hit.
[2023-03-18 01:32:32] [INFO ] Implicit Places using invariants in 3675 ms returned []
Implicit Place search using SMT only with invariants took 3676 ms to find 0 implicit places.
[2023-03-18 01:32:32] [INFO ] Flow matrix only has 62424 transitions (discarded 27484 similar events)
[2023-03-18 01:32:32] [INFO ] Invariant cache hit.
[2023-03-18 01:33:01] [INFO ] Dead Transitions using invariants and state equation in 29648 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33730 ms. Remains : 1296/1296 places, 89908/89908 transitions.
Graph (trivial) has 31546 edges and 1296 vertex of which 1026 / 1296 are part of one of the 151 SCC in 4 ms
Free SCC test removed 875 places
Drop transitions removed 32678 transitions
Ensure Unique test removed 48366 transitions
Reduce isomorphic transitions removed 81044 transitions.
Graph (complete) has 8471 edges and 421 vertex of which 406 are kept as prefixes of interest. Removing 15 places using SCC suffix rule.4 ms
Discarding 15 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Drop transitions removed 23 transitions
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 42 transitions.
Iterating post reduction 0 with 42 rules applied. Total rules applied 44 place count 406 transition count 8820
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 44 place count 406 transition count 8819
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 46 place count 405 transition count 8819
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 49 place count 402 transition count 8807
Iterating global reduction 1 with 3 rules applied. Total rules applied 52 place count 402 transition count 8807
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 58 place count 402 transition count 8801
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 66 place count 398 transition count 8797
Ensure Unique test removed 73 transitions
Reduce isomorphic transitions removed 73 transitions.
Iterating post reduction 2 with 73 rules applied. Total rules applied 139 place count 398 transition count 8724
Drop transitions removed 4078 transitions
Redundant transition composition rules discarded 4078 transitions
Iterating global reduction 3 with 4078 rules applied. Total rules applied 4217 place count 398 transition count 4646
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 51 transitions
Reduce isomorphic transitions removed 51 transitions.
Graph (complete) has 5340 edges and 395 vertex of which 362 are kept as prefixes of interest. Removing 33 places using SCC suffix rule.1 ms
Discarding 33 places :
Also discarding 7 output transitions
Drop transitions removed 7 transitions
Iterating post reduction 3 with 55 rules applied. Total rules applied 4272 place count 362 transition count 4588
Drop transitions removed 449 transitions
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 461 transitions.
Iterating post reduction 4 with 461 rules applied. Total rules applied 4733 place count 362 transition count 4127
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 4733 place count 362 transition count 4126
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 4735 place count 361 transition count 4126
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 4741 place count 355 transition count 4104
Iterating global reduction 5 with 6 rules applied. Total rules applied 4747 place count 355 transition count 4104
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 4751 place count 351 transition count 4088
Iterating global reduction 5 with 4 rules applied. Total rules applied 4755 place count 351 transition count 4088
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 5 with 10 rules applied. Total rules applied 4765 place count 346 transition count 4083
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 4766 place count 346 transition count 4082
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 4768 place count 345 transition count 4095
Drop transitions removed 22 transitions
Redundant transition composition rules discarded 22 transitions
Iterating global reduction 6 with 22 rules applied. Total rules applied 4790 place count 345 transition count 4073
Free-agglomeration rule applied 18 times with reduction of 6 identical transitions.
Iterating global reduction 6 with 18 rules applied. Total rules applied 4808 place count 345 transition count 4049
Reduce places removed 18 places and 0 transitions.
Ensure Unique test removed 55 transitions
Reduce isomorphic transitions removed 55 transitions.
Iterating post reduction 6 with 73 rules applied. Total rules applied 4881 place count 327 transition count 3994
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 4883 place count 326 transition count 4004
Drop transitions removed 84 transitions
Redundant transition composition rules discarded 84 transitions
Iterating global reduction 7 with 84 rules applied. Total rules applied 4967 place count 326 transition count 3920
Free-agglomeration rule applied 10 times with reduction of 1 identical transitions.
Iterating global reduction 7 with 10 rules applied. Total rules applied 4977 place count 326 transition count 3909
Reduce places removed 10 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 7 with 22 rules applied. Total rules applied 4999 place count 316 transition count 3897
Drop transitions removed 32 transitions
Redundant transition composition rules discarded 32 transitions
Iterating global reduction 8 with 32 rules applied. Total rules applied 5031 place count 316 transition count 3865
Free-agglomeration rule applied 4 times.
Iterating global reduction 8 with 4 rules applied. Total rules applied 5035 place count 316 transition count 3861
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 8 with 4 rules applied. Total rules applied 5039 place count 312 transition count 3861
Drop transitions removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 9 with 13 rules applied. Total rules applied 5052 place count 312 transition count 3848
Free-agglomeration rule applied 1 times.
Iterating global reduction 9 with 1 rules applied. Total rules applied 5053 place count 312 transition count 3847
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 5054 place count 311 transition count 3847
Free-agglomeration rule (complex) applied 6 times with reduction of 11 identical transitions.
Iterating global reduction 10 with 6 rules applied. Total rules applied 5060 place count 311 transition count 3907
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 10 with 7 rules applied. Total rules applied 5067 place count 305 transition count 3906
Drop transitions removed 30 transitions
Redundant transition composition rules discarded 30 transitions
Iterating global reduction 11 with 30 rules applied. Total rules applied 5097 place count 305 transition count 3876
Applied a total of 5097 rules in 1468 ms. Remains 305 /1296 variables (removed 991) and now considering 3876/89908 (removed 86032) transitions.
Running SMT prover for 5 properties.
[2023-03-18 01:33:03] [INFO ] Flow matrix only has 3765 transitions (discarded 111 similar events)
// Phase 1: matrix 3765 rows 305 cols
[2023-03-18 01:33:03] [INFO ] Computed 0 place invariants in 18 ms
[2023-03-18 01:33:04] [INFO ] After 855ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-18 01:33:05] [INFO ] After 786ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-18 01:33:05] [INFO ] State equation strengthened by 16 read => feed constraints.
[2023-03-18 01:33:05] [INFO ] After 339ms SMT Verify possible using 16 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-18 01:33:06] [INFO ] After 893ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 334 ms.
[2023-03-18 01:33:06] [INFO ] After 2099ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), true, (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 537 ms. Reduced automaton from 4 states, 10 edges and 2 AP (stutter insensitive) to 4 states, 10 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 117 ms :[(NOT p1), (NOT p1), true, (AND p1 p0)]
Stuttering acceptance computed with spot in 128 ms :[(NOT p1), (NOT p1), true, (AND p1 p0)]
[2023-03-18 01:33:07] [INFO ] Flow matrix only has 62870 transitions (discarded 30346 similar events)
// Phase 1: matrix 62870 rows 1369 cols
[2023-03-18 01:33:07] [INFO ] Computed 12 place invariants in 258 ms
Could not prove EG (NOT p1)
Support contains 4 out of 1369 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1369/1369 places, 93216/93216 transitions.
Reduce places removed 1 places and 1 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 1368 transition count 93214
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 1367 transition count 93214
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 2 place count 1367 transition count 93212
Deduced a syphon composed of 2 places in 46 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 6 place count 1365 transition count 93212
Performed 17 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 17 places in 48 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 40 place count 1348 transition count 93192
Ensure Unique test removed 439 transitions
Reduce isomorphic transitions removed 439 transitions.
Iterating post reduction 2 with 439 rules applied. Total rules applied 479 place count 1348 transition count 92753
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 48 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 487 place count 1344 transition count 92749
Ensure Unique test removed 96 transitions
Reduce isomorphic transitions removed 96 transitions.
Iterating post reduction 3 with 96 rules applied. Total rules applied 583 place count 1344 transition count 92653
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 1 places in 47 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 585 place count 1343 transition count 92654
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 588 place count 1343 transition count 92651
Applied a total of 588 rules in 2296 ms. Remains 1343 /1369 variables (removed 26) and now considering 92651/93216 (removed 565) transitions.
[2023-03-18 01:33:25] [INFO ] Flow matrix only has 62309 transitions (discarded 30342 similar events)
// Phase 1: matrix 62309 rows 1343 cols
[2023-03-18 01:33:25] [INFO ] Computed 12 place invariants in 190 ms
[2023-03-18 01:33:28] [INFO ] Implicit Places using invariants in 3373 ms returned []
Implicit Place search using SMT only with invariants took 3376 ms to find 0 implicit places.
[2023-03-18 01:33:28] [INFO ] Flow matrix only has 62309 transitions (discarded 30342 similar events)
[2023-03-18 01:33:28] [INFO ] Invariant cache hit.
[2023-03-18 01:33:58] [INFO ] Dead Transitions using invariants and state equation in 30160 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1343/1369 places, 92651/93216 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 35837 ms. Remains : 1343/1369 places, 92651/93216 transitions.
Computed a total of 257 stabilizing places and 30632 stable transitions
Computed a total of 257 stabilizing places and 30632 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 p1))), (X (NOT p1)), true, (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 12 factoid took 503 ms. Reduced automaton from 4 states, 10 edges and 2 AP (stutter insensitive) to 4 states, 10 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 128 ms :[(NOT p1), (NOT p1), true, (AND p1 p0)]
Incomplete random walk after 10000 steps, including 3 resets, run finished after 778 ms. (steps per millisecond=12 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 3 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 7129 steps, run timeout after 3003 ms. (steps per millisecond=2 ) properties seen :{}
Probabilistic random walk after 7129 steps, saw 5228 distinct states, run finished after 3003 ms. (steps per millisecond=2 ) properties seen :0
Running SMT prover for 5 properties.
[2023-03-18 01:34:04] [INFO ] Flow matrix only has 62309 transitions (discarded 30342 similar events)
[2023-03-18 01:34:04] [INFO ] Invariant cache hit.
[2023-03-18 01:34:04] [INFO ] [Real]Absence check using 12 positive place invariants in 12 ms returned sat
[2023-03-18 01:34:26] [INFO ] After 22109ms SMT Verify possible using state equation in real domain returned unsat :0 sat :3 real:2
[2023-03-18 01:34:27] [INFO ] State equation strengthened by 3673 read => feed constraints.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:642)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:339)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-18 01:34:29] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-18 01:34:29] [INFO ] After 25028ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 5 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 17 ms.
Support contains 4 out of 1343 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1343/1343 places, 92651/92651 transitions.
Drop transitions removed 2819 transitions
Reduce isomorphic transitions removed 2819 transitions.
Iterating post reduction 0 with 2819 rules applied. Total rules applied 2819 place count 1343 transition count 89832
Free-agglomeration rule applied 32 times.
Iterating global reduction 1 with 32 rules applied. Total rules applied 2851 place count 1343 transition count 89800
Reduce places removed 32 places and 0 transitions.
Drop transitions removed 44 transitions
Ensure Unique test removed 555 transitions
Reduce isomorphic transitions removed 599 transitions.
Iterating post reduction 1 with 631 rules applied. Total rules applied 3482 place count 1311 transition count 89201
Free-agglomeration rule (complex) applied 15 times with reduction of 16 identical transitions.
Iterating global reduction 2 with 15 rules applied. Total rules applied 3497 place count 1311 transition count 89934
Reduce places removed 15 places and 0 transitions.
Drop transitions removed 5 transitions
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 26 transitions.
Iterating post reduction 2 with 41 rules applied. Total rules applied 3538 place count 1296 transition count 89908
Applied a total of 3538 rules in 2019 ms. Remains 1296 /1343 variables (removed 47) and now considering 89908/92651 (removed 2743) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2022 ms. Remains : 1296/1343 places, 89908/92651 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 641 ms. (steps per millisecond=15 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 9456 steps, run timeout after 3002 ms. (steps per millisecond=3 ) properties seen :{}
Probabilistic random walk after 9456 steps, saw 7509 distinct states, run finished after 3002 ms. (steps per millisecond=3 ) properties seen :0
Running SMT prover for 5 properties.
[2023-03-18 01:34:35] [INFO ] Flow matrix only has 62424 transitions (discarded 27484 similar events)
// Phase 1: matrix 62424 rows 1296 cols
[2023-03-18 01:34:35] [INFO ] Computed 12 place invariants in 224 ms
[2023-03-18 01:34:36] [INFO ] [Real]Absence check using 12 positive place invariants in 8 ms returned sat
[2023-03-18 01:34:58] [INFO ] After 22649ms SMT Verify possible using state equation in real domain returned unsat :0 sat :3 real:2
[2023-03-18 01:34:59] [INFO ] State equation strengthened by 3688 read => feed constraints.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:642)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:339)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-18 01:35:00] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-18 01:35:00] [INFO ] After 25028ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 5 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 14 ms.
Support contains 4 out of 1296 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1296/1296 places, 89908/89908 transitions.
Applied a total of 0 rules in 389 ms. Remains 1296 /1296 variables (removed 0) and now considering 89908/89908 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 389 ms. Remains : 1296/1296 places, 89908/89908 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1296/1296 places, 89908/89908 transitions.
Applied a total of 0 rules in 385 ms. Remains 1296 /1296 variables (removed 0) and now considering 89908/89908 (removed 0) transitions.
[2023-03-18 01:35:01] [INFO ] Flow matrix only has 62424 transitions (discarded 27484 similar events)
[2023-03-18 01:35:01] [INFO ] Invariant cache hit.
[2023-03-18 01:35:04] [INFO ] Implicit Places using invariants in 3370 ms returned []
Implicit Place search using SMT only with invariants took 3371 ms to find 0 implicit places.
[2023-03-18 01:35:05] [INFO ] Flow matrix only has 62424 transitions (discarded 27484 similar events)
[2023-03-18 01:35:05] [INFO ] Invariant cache hit.
[2023-03-18 01:35:33] [INFO ] Dead Transitions using invariants and state equation in 29000 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32765 ms. Remains : 1296/1296 places, 89908/89908 transitions.
Graph (trivial) has 31546 edges and 1296 vertex of which 1026 / 1296 are part of one of the 151 SCC in 5 ms
Free SCC test removed 875 places
Drop transitions removed 32678 transitions
Ensure Unique test removed 48366 transitions
Reduce isomorphic transitions removed 81044 transitions.
Graph (complete) has 8471 edges and 421 vertex of which 406 are kept as prefixes of interest. Removing 15 places using SCC suffix rule.4 ms
Discarding 15 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Drop transitions removed 23 transitions
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 42 transitions.
Iterating post reduction 0 with 42 rules applied. Total rules applied 44 place count 406 transition count 8820
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 44 place count 406 transition count 8819
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 46 place count 405 transition count 8819
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 49 place count 402 transition count 8807
Iterating global reduction 1 with 3 rules applied. Total rules applied 52 place count 402 transition count 8807
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 58 place count 402 transition count 8801
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 66 place count 398 transition count 8797
Ensure Unique test removed 73 transitions
Reduce isomorphic transitions removed 73 transitions.
Iterating post reduction 2 with 73 rules applied. Total rules applied 139 place count 398 transition count 8724
Drop transitions removed 4078 transitions
Redundant transition composition rules discarded 4078 transitions
Iterating global reduction 3 with 4078 rules applied. Total rules applied 4217 place count 398 transition count 4646
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 51 transitions
Reduce isomorphic transitions removed 51 transitions.
Graph (complete) has 5340 edges and 395 vertex of which 362 are kept as prefixes of interest. Removing 33 places using SCC suffix rule.1 ms
Discarding 33 places :
Also discarding 7 output transitions
Drop transitions removed 7 transitions
Iterating post reduction 3 with 55 rules applied. Total rules applied 4272 place count 362 transition count 4588
Drop transitions removed 449 transitions
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 461 transitions.
Iterating post reduction 4 with 461 rules applied. Total rules applied 4733 place count 362 transition count 4127
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 4733 place count 362 transition count 4126
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 4735 place count 361 transition count 4126
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 4741 place count 355 transition count 4104
Iterating global reduction 5 with 6 rules applied. Total rules applied 4747 place count 355 transition count 4104
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 4751 place count 351 transition count 4088
Iterating global reduction 5 with 4 rules applied. Total rules applied 4755 place count 351 transition count 4088
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 5 with 10 rules applied. Total rules applied 4765 place count 346 transition count 4083
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 4766 place count 346 transition count 4082
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 4768 place count 345 transition count 4095
Drop transitions removed 22 transitions
Redundant transition composition rules discarded 22 transitions
Iterating global reduction 6 with 22 rules applied. Total rules applied 4790 place count 345 transition count 4073
Free-agglomeration rule applied 18 times with reduction of 6 identical transitions.
Iterating global reduction 6 with 18 rules applied. Total rules applied 4808 place count 345 transition count 4049
Reduce places removed 18 places and 0 transitions.
Ensure Unique test removed 55 transitions
Reduce isomorphic transitions removed 55 transitions.
Iterating post reduction 6 with 73 rules applied. Total rules applied 4881 place count 327 transition count 3994
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 4883 place count 326 transition count 4004
Drop transitions removed 84 transitions
Redundant transition composition rules discarded 84 transitions
Iterating global reduction 7 with 84 rules applied. Total rules applied 4967 place count 326 transition count 3920
Free-agglomeration rule applied 10 times with reduction of 1 identical transitions.
Iterating global reduction 7 with 10 rules applied. Total rules applied 4977 place count 326 transition count 3909
Reduce places removed 10 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 7 with 22 rules applied. Total rules applied 4999 place count 316 transition count 3897
Drop transitions removed 32 transitions
Redundant transition composition rules discarded 32 transitions
Iterating global reduction 8 with 32 rules applied. Total rules applied 5031 place count 316 transition count 3865
Free-agglomeration rule applied 4 times.
Iterating global reduction 8 with 4 rules applied. Total rules applied 5035 place count 316 transition count 3861
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 8 with 4 rules applied. Total rules applied 5039 place count 312 transition count 3861
Drop transitions removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 9 with 13 rules applied. Total rules applied 5052 place count 312 transition count 3848
Free-agglomeration rule applied 1 times.
Iterating global reduction 9 with 1 rules applied. Total rules applied 5053 place count 312 transition count 3847
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 5054 place count 311 transition count 3847
Free-agglomeration rule (complex) applied 6 times with reduction of 11 identical transitions.
Iterating global reduction 10 with 6 rules applied. Total rules applied 5060 place count 311 transition count 3907
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 10 with 7 rules applied. Total rules applied 5067 place count 305 transition count 3906
Drop transitions removed 30 transitions
Redundant transition composition rules discarded 30 transitions
Iterating global reduction 11 with 30 rules applied. Total rules applied 5097 place count 305 transition count 3876
Applied a total of 5097 rules in 1502 ms. Remains 305 /1296 variables (removed 991) and now considering 3876/89908 (removed 86032) transitions.
Running SMT prover for 5 properties.
[2023-03-18 01:35:35] [INFO ] Flow matrix only has 3765 transitions (discarded 111 similar events)
// Phase 1: matrix 3765 rows 305 cols
[2023-03-18 01:35:35] [INFO ] Computed 0 place invariants in 18 ms
[2023-03-18 01:35:36] [INFO ] After 741ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-18 01:35:37] [INFO ] After 795ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-18 01:35:37] [INFO ] State equation strengthened by 16 read => feed constraints.
[2023-03-18 01:35:37] [INFO ] After 338ms SMT Verify possible using 16 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-18 01:35:38] [INFO ] After 900ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 321 ms.
[2023-03-18 01:35:38] [INFO ] After 2097ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 p1))), (X (NOT p1)), true, (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 12 factoid took 513 ms. Reduced automaton from 4 states, 10 edges and 2 AP (stutter insensitive) to 4 states, 10 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 98 ms :[(NOT p1), (NOT p1), true, (AND p1 p0)]
Stuttering acceptance computed with spot in 111 ms :[(NOT p1), (NOT p1), true, (AND p1 p0)]
[2023-03-18 01:35:39] [INFO ] Flow matrix only has 62309 transitions (discarded 30342 similar events)
// Phase 1: matrix 62309 rows 1343 cols
[2023-03-18 01:35:39] [INFO ] Computed 12 place invariants in 209 ms
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 92 ms :[(NOT p1), (NOT p1), true, (AND p1 p0)]
Product exploration explored 100000 steps with 33342 reset in 4777 ms.
Product exploration explored 100000 steps with 33331 reset in 4750 ms.
Support contains 4 out of 1343 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1343/1343 places, 92651/92651 transitions.
Applied a total of 0 rules in 380 ms. Remains 1343 /1343 variables (removed 0) and now considering 92651/92651 (removed 0) transitions.
[2023-03-18 01:36:04] [INFO ] Flow matrix only has 62309 transitions (discarded 30342 similar events)
[2023-03-18 01:36:04] [INFO ] Invariant cache hit.
[2023-03-18 01:36:08] [INFO ] Implicit Places using invariants in 3232 ms returned []
Implicit Place search using SMT only with invariants took 3233 ms to find 0 implicit places.
[2023-03-18 01:36:08] [INFO ] Flow matrix only has 62309 transitions (discarded 30342 similar events)
[2023-03-18 01:36:08] [INFO ] Invariant cache hit.
[2023-03-18 01:36:38] [INFO ] Performed 91821/92651 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-18 01:36:38] [INFO ] Dead Transitions using invariants and state equation in 30485 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 34100 ms. Remains : 1343/1343 places, 92651/92651 transitions.
Treatment of property RERS2020-PT-pb107-LTLFireability-10 finished in 377193 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 2 out of 1369 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1369/1369 places, 93216/93216 transitions.
Reduce places removed 1 places and 1 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 1368 transition count 93214
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 1367 transition count 93214
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 2 place count 1367 transition count 93212
Deduced a syphon composed of 2 places in 45 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 6 place count 1365 transition count 93212
Performed 17 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 17 places in 68 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 40 place count 1348 transition count 93192
Ensure Unique test removed 439 transitions
Reduce isomorphic transitions removed 439 transitions.
Iterating post reduction 2 with 439 rules applied. Total rules applied 479 place count 1348 transition count 92753
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 43 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 487 place count 1344 transition count 92749
Ensure Unique test removed 96 transitions
Reduce isomorphic transitions removed 96 transitions.
Iterating post reduction 3 with 96 rules applied. Total rules applied 583 place count 1344 transition count 92653
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 1 places in 43 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 585 place count 1343 transition count 92654
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 588 place count 1343 transition count 92651
Applied a total of 588 rules in 2457 ms. Remains 1343 /1369 variables (removed 26) and now considering 92651/93216 (removed 565) transitions.
[2023-03-18 01:36:44] [INFO ] Flow matrix only has 62309 transitions (discarded 30342 similar events)
[2023-03-18 01:36:44] [INFO ] Invariant cache hit.
[2023-03-18 01:36:47] [INFO ] Implicit Places using invariants in 3313 ms returned []
Implicit Place search using SMT only with invariants took 3313 ms to find 0 implicit places.
[2023-03-18 01:36:47] [INFO ] Flow matrix only has 62309 transitions (discarded 30342 similar events)
[2023-03-18 01:36:47] [INFO ] Invariant cache hit.
[2023-03-18 01:37:17] [INFO ] Performed 91512/92651 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-18 01:37:18] [INFO ] Dead Transitions using invariants and state equation in 30599 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1343/1369 places, 92651/93216 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 36372 ms. Remains : 1343/1369 places, 92651/93216 transitions.
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
Running random walk in product with property : RERS2020-PT-pb107-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (NEQ s232 1) (NEQ s368 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 0 reset in 4849 ms.
Product exploration explored 100000 steps with 0 reset in 4895 ms.
Computed a total of 257 stabilizing places and 30632 stable transitions
Computed a total of 257 stabilizing places and 30632 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 127 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 35 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 3 resets, run finished after 517 ms. (steps per millisecond=19 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 3 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 8757 steps, run timeout after 3002 ms. (steps per millisecond=2 ) properties seen :{}
Probabilistic random walk after 8757 steps, saw 6162 distinct states, run finished after 3002 ms. (steps per millisecond=2 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-18 01:37:32] [INFO ] Flow matrix only has 62309 transitions (discarded 30342 similar events)
[2023-03-18 01:37:32] [INFO ] Invariant cache hit.
[2023-03-18 01:37:32] [INFO ] [Real]Absence check using 12 positive place invariants in 10 ms returned sat
[2023-03-18 01:37:51] [INFO ] After 19136ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-18 01:37:52] [INFO ] State equation strengthened by 3673 read => feed constraints.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:642)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:339)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-18 01:37:57] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-18 01:37:57] [INFO ] After 25020ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 20 ms.
Support contains 2 out of 1343 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1343/1343 places, 92651/92651 transitions.
Drop transitions removed 2819 transitions
Reduce isomorphic transitions removed 2819 transitions.
Iterating post reduction 0 with 2819 rules applied. Total rules applied 2819 place count 1343 transition count 89832
Free-agglomeration rule applied 32 times.
Iterating global reduction 1 with 32 rules applied. Total rules applied 2851 place count 1343 transition count 89800
Reduce places removed 32 places and 0 transitions.
Drop transitions removed 44 transitions
Ensure Unique test removed 555 transitions
Reduce isomorphic transitions removed 599 transitions.
Iterating post reduction 1 with 631 rules applied. Total rules applied 3482 place count 1311 transition count 89201
Free-agglomeration rule (complex) applied 15 times with reduction of 16 identical transitions.
Iterating global reduction 2 with 15 rules applied. Total rules applied 3497 place count 1311 transition count 89934
Reduce places removed 15 places and 0 transitions.
Drop transitions removed 5 transitions
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 26 transitions.
Iterating post reduction 2 with 41 rules applied. Total rules applied 3538 place count 1296 transition count 89908
Applied a total of 3538 rules in 2124 ms. Remains 1296 /1343 variables (removed 47) and now considering 89908/92651 (removed 2743) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2127 ms. Remains : 1296/1343 places, 89908/92651 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 587 ms. (steps per millisecond=17 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 9813 steps, run timeout after 3002 ms. (steps per millisecond=3 ) properties seen :{}
Probabilistic random walk after 9813 steps, saw 7816 distinct states, run finished after 3003 ms. (steps per millisecond=3 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-18 01:38:03] [INFO ] Flow matrix only has 62424 transitions (discarded 27484 similar events)
// Phase 1: matrix 62424 rows 1296 cols
[2023-03-18 01:38:03] [INFO ] Computed 12 place invariants in 195 ms
[2023-03-18 01:38:03] [INFO ] [Real]Absence check using 12 positive place invariants in 7 ms returned sat
[2023-03-18 01:38:23] [INFO ] After 19752ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-18 01:38:23] [INFO ] State equation strengthened by 3688 read => feed constraints.
[2023-03-18 01:38:28] [INFO ] After 4687ms SMT Verify possible using 3688 Read/Feed constraints in real domain returned unsat :0 sat :0
[2023-03-18 01:38:28] [INFO ] After 25019ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 18 ms.
Support contains 2 out of 1296 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1296/1296 places, 89908/89908 transitions.
Applied a total of 0 rules in 410 ms. Remains 1296 /1296 variables (removed 0) and now considering 89908/89908 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 410 ms. Remains : 1296/1296 places, 89908/89908 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1296/1296 places, 89908/89908 transitions.
Applied a total of 0 rules in 381 ms. Remains 1296 /1296 variables (removed 0) and now considering 89908/89908 (removed 0) transitions.
[2023-03-18 01:38:29] [INFO ] Flow matrix only has 62424 transitions (discarded 27484 similar events)
[2023-03-18 01:38:29] [INFO ] Invariant cache hit.
[2023-03-18 01:38:32] [INFO ] Implicit Places using invariants in 3434 ms returned []
Implicit Place search using SMT only with invariants took 3435 ms to find 0 implicit places.
[2023-03-18 01:38:32] [INFO ] Flow matrix only has 62424 transitions (discarded 27484 similar events)
[2023-03-18 01:38:32] [INFO ] Invariant cache hit.
[2023-03-18 01:39:01] [INFO ] Dead Transitions using invariants and state equation in 29256 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33081 ms. Remains : 1296/1296 places, 89908/89908 transitions.
Graph (trivial) has 31571 edges and 1296 vertex of which 1032 / 1296 are part of one of the 152 SCC in 4 ms
Free SCC test removed 880 places
Drop transitions removed 32735 transitions
Ensure Unique test removed 48492 transitions
Reduce isomorphic transitions removed 81227 transitions.
Graph (complete) has 8390 edges and 416 vertex of which 401 are kept as prefixes of interest. Removing 15 places using SCC suffix rule.4 ms
Discarding 15 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Drop transitions removed 23 transitions
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 42 transitions.
Iterating post reduction 0 with 42 rules applied. Total rules applied 44 place count 401 transition count 8637
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 44 place count 401 transition count 8636
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 46 place count 400 transition count 8636
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 49 place count 397 transition count 8624
Iterating global reduction 1 with 3 rules applied. Total rules applied 52 place count 397 transition count 8624
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 58 place count 397 transition count 8618
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 66 place count 393 transition count 8614
Ensure Unique test removed 73 transitions
Reduce isomorphic transitions removed 73 transitions.
Iterating post reduction 2 with 73 rules applied. Total rules applied 139 place count 393 transition count 8541
Drop transitions removed 3942 transitions
Redundant transition composition rules discarded 3942 transitions
Iterating global reduction 3 with 3942 rules applied. Total rules applied 4081 place count 393 transition count 4599
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 51 transitions
Reduce isomorphic transitions removed 51 transitions.
Graph (complete) has 5272 edges and 390 vertex of which 357 are kept as prefixes of interest. Removing 33 places using SCC suffix rule.1 ms
Discarding 33 places :
Also discarding 7 output transitions
Drop transitions removed 7 transitions
Iterating post reduction 3 with 55 rules applied. Total rules applied 4136 place count 357 transition count 4541
Drop transitions removed 451 transitions
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 463 transitions.
Iterating post reduction 4 with 463 rules applied. Total rules applied 4599 place count 357 transition count 4078
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 4599 place count 357 transition count 4077
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 4601 place count 356 transition count 4077
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 4607 place count 350 transition count 4055
Iterating global reduction 5 with 6 rules applied. Total rules applied 4613 place count 350 transition count 4055
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 4617 place count 346 transition count 4039
Iterating global reduction 5 with 4 rules applied. Total rules applied 4621 place count 346 transition count 4039
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 5 with 10 rules applied. Total rules applied 4631 place count 341 transition count 4034
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 4632 place count 341 transition count 4033
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 4634 place count 340 transition count 4046
Drop transitions removed 23 transitions
Redundant transition composition rules discarded 23 transitions
Iterating global reduction 6 with 23 rules applied. Total rules applied 4657 place count 340 transition count 4023
Free-agglomeration rule applied 20 times with reduction of 7 identical transitions.
Iterating global reduction 6 with 20 rules applied. Total rules applied 4677 place count 340 transition count 3996
Reduce places removed 20 places and 0 transitions.
Ensure Unique test removed 65 transitions
Reduce isomorphic transitions removed 65 transitions.
Iterating post reduction 6 with 85 rules applied. Total rules applied 4762 place count 320 transition count 3931
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 4764 place count 319 transition count 3940
Drop transitions removed 94 transitions
Redundant transition composition rules discarded 94 transitions
Iterating global reduction 7 with 94 rules applied. Total rules applied 4858 place count 319 transition count 3846
Free-agglomeration rule applied 11 times with reduction of 2 identical transitions.
Iterating global reduction 7 with 11 rules applied. Total rules applied 4869 place count 319 transition count 3833
Reduce places removed 11 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 7 with 21 rules applied. Total rules applied 4890 place count 308 transition count 3823
Drop transitions removed 29 transitions
Redundant transition composition rules discarded 29 transitions
Iterating global reduction 8 with 29 rules applied. Total rules applied 4919 place count 308 transition count 3794
Free-agglomeration rule applied 4 times.
Iterating global reduction 8 with 4 rules applied. Total rules applied 4923 place count 308 transition count 3790
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 8 with 4 rules applied. Total rules applied 4927 place count 304 transition count 3790
Drop transitions removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 9 with 11 rules applied. Total rules applied 4938 place count 304 transition count 3779
Free-agglomeration rule applied 1 times.
Iterating global reduction 9 with 1 rules applied. Total rules applied 4939 place count 304 transition count 3778
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 4940 place count 303 transition count 3778
Free-agglomeration rule (complex) applied 7 times with reduction of 11 identical transitions.
Iterating global reduction 10 with 7 rules applied. Total rules applied 4947 place count 303 transition count 3851
Reduce places removed 7 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 10 with 8 rules applied. Total rules applied 4955 place count 296 transition count 3850
Drop transitions removed 41 transitions
Redundant transition composition rules discarded 41 transitions
Iterating global reduction 11 with 41 rules applied. Total rules applied 4996 place count 296 transition count 3809
Applied a total of 4996 rules in 1450 ms. Remains 296 /1296 variables (removed 1000) and now considering 3809/89908 (removed 86099) transitions.
Running SMT prover for 1 properties.
[2023-03-18 01:39:03] [INFO ] Flow matrix only has 3693 transitions (discarded 116 similar events)
// Phase 1: matrix 3693 rows 296 cols
[2023-03-18 01:39:03] [INFO ] Computed 0 place invariants in 25 ms
[2023-03-18 01:39:04] [INFO ] After 564ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 01:39:04] [INFO ] After 511ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 01:39:04] [INFO ] State equation strengthened by 16 read => feed constraints.
[2023-03-18 01:39:04] [INFO ] After 85ms SMT Verify possible using 16 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-18 01:39:04] [INFO ] After 197ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 74 ms.
[2023-03-18 01:39:04] [INFO ] After 833ms 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 124 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 29 ms :[(NOT p0)]
Support contains 2 out of 1343 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1343/1343 places, 92651/92651 transitions.
Applied a total of 0 rules in 383 ms. Remains 1343 /1343 variables (removed 0) and now considering 92651/92651 (removed 0) transitions.
[2023-03-18 01:39:05] [INFO ] Flow matrix only has 62309 transitions (discarded 30342 similar events)
// Phase 1: matrix 62309 rows 1343 cols
[2023-03-18 01:39:05] [INFO ] Computed 12 place invariants in 207 ms
[2023-03-18 01:39:09] [INFO ] Implicit Places using invariants in 3494 ms returned []
Implicit Place search using SMT only with invariants took 3495 ms to find 0 implicit places.
[2023-03-18 01:39:09] [INFO ] Flow matrix only has 62309 transitions (discarded 30342 similar events)
[2023-03-18 01:39:09] [INFO ] Invariant cache hit.
[2023-03-18 01:39:39] [INFO ] Performed 91059/92651 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-18 01:39:39] [INFO ] Dead Transitions using invariants and state equation in 30764 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 34645 ms. Remains : 1343/1343 places, 92651/92651 transitions.
Computed a total of 257 stabilizing places and 30632 stable transitions
Computed a total of 257 stabilizing places and 30632 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 111 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 534 ms. (steps per millisecond=18 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 8996 steps, run timeout after 3003 ms. (steps per millisecond=2 ) properties seen :{}
Probabilistic random walk after 8996 steps, saw 6308 distinct states, run finished after 3004 ms. (steps per millisecond=2 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-18 01:39:44] [INFO ] Flow matrix only has 62309 transitions (discarded 30342 similar events)
[2023-03-18 01:39:44] [INFO ] Invariant cache hit.
[2023-03-18 01:39:44] [INFO ] [Real]Absence check using 12 positive place invariants in 10 ms returned sat
[2023-03-18 01:40:04] [INFO ] After 19882ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-18 01:40:04] [INFO ] State equation strengthened by 3673 read => feed constraints.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:642)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:339)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-18 01:40:09] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-18 01:40:09] [INFO ] After 25031ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 15 ms.
Support contains 2 out of 1343 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1343/1343 places, 92651/92651 transitions.
Drop transitions removed 2819 transitions
Reduce isomorphic transitions removed 2819 transitions.
Iterating post reduction 0 with 2819 rules applied. Total rules applied 2819 place count 1343 transition count 89832
Free-agglomeration rule applied 32 times.
Iterating global reduction 1 with 32 rules applied. Total rules applied 2851 place count 1343 transition count 89800
Reduce places removed 32 places and 0 transitions.
Drop transitions removed 44 transitions
Ensure Unique test removed 555 transitions
Reduce isomorphic transitions removed 599 transitions.
Iterating post reduction 1 with 631 rules applied. Total rules applied 3482 place count 1311 transition count 89201
Free-agglomeration rule (complex) applied 15 times with reduction of 16 identical transitions.
Iterating global reduction 2 with 15 rules applied. Total rules applied 3497 place count 1311 transition count 89934
Reduce places removed 15 places and 0 transitions.
Drop transitions removed 5 transitions
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 26 transitions.
Iterating post reduction 2 with 41 rules applied. Total rules applied 3538 place count 1296 transition count 89908
Applied a total of 3538 rules in 1756 ms. Remains 1296 /1343 variables (removed 47) and now considering 89908/92651 (removed 2743) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1759 ms. Remains : 1296/1343 places, 89908/92651 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 571 ms. (steps per millisecond=17 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 9129 steps, run timeout after 3003 ms. (steps per millisecond=3 ) properties seen :{}
Probabilistic random walk after 9129 steps, saw 7226 distinct states, run finished after 3003 ms. (steps per millisecond=3 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-18 01:40:14] [INFO ] Flow matrix only has 62424 transitions (discarded 27484 similar events)
// Phase 1: matrix 62424 rows 1296 cols
[2023-03-18 01:40:15] [INFO ] Computed 12 place invariants in 209 ms
[2023-03-18 01:40:15] [INFO ] [Real]Absence check using 12 positive place invariants in 8 ms returned sat
[2023-03-18 01:40:35] [INFO ] After 20170ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-18 01:40:35] [INFO ] State equation strengthened by 3688 read => feed constraints.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:642)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:339)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-18 01:40:40] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-18 01:40:40] [INFO ] After 25020ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 13 ms.
Support contains 2 out of 1296 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1296/1296 places, 89908/89908 transitions.
Applied a total of 0 rules in 396 ms. Remains 1296 /1296 variables (removed 0) and now considering 89908/89908 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 396 ms. Remains : 1296/1296 places, 89908/89908 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1296/1296 places, 89908/89908 transitions.
Applied a total of 0 rules in 398 ms. Remains 1296 /1296 variables (removed 0) and now considering 89908/89908 (removed 0) transitions.
[2023-03-18 01:40:40] [INFO ] Flow matrix only has 62424 transitions (discarded 27484 similar events)
[2023-03-18 01:40:40] [INFO ] Invariant cache hit.
[2023-03-18 01:40:44] [INFO ] Implicit Places using invariants in 3678 ms returned []
Implicit Place search using SMT only with invariants took 3679 ms to find 0 implicit places.
[2023-03-18 01:40:44] [INFO ] Flow matrix only has 62424 transitions (discarded 27484 similar events)
[2023-03-18 01:40:44] [INFO ] Invariant cache hit.
[2023-03-18 01:41:13] [INFO ] Dead Transitions using invariants and state equation in 29418 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33504 ms. Remains : 1296/1296 places, 89908/89908 transitions.
Graph (trivial) has 31571 edges and 1296 vertex of which 1032 / 1296 are part of one of the 152 SCC in 4 ms
Free SCC test removed 880 places
Drop transitions removed 32735 transitions
Ensure Unique test removed 48492 transitions
Reduce isomorphic transitions removed 81227 transitions.
Graph (complete) has 8390 edges and 416 vertex of which 401 are kept as prefixes of interest. Removing 15 places using SCC suffix rule.4 ms
Discarding 15 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Drop transitions removed 23 transitions
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 42 transitions.
Iterating post reduction 0 with 42 rules applied. Total rules applied 44 place count 401 transition count 8637
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 44 place count 401 transition count 8636
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 46 place count 400 transition count 8636
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 49 place count 397 transition count 8624
Iterating global reduction 1 with 3 rules applied. Total rules applied 52 place count 397 transition count 8624
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 58 place count 397 transition count 8618
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 2 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 66 place count 393 transition count 8614
Ensure Unique test removed 73 transitions
Reduce isomorphic transitions removed 73 transitions.
Iterating post reduction 2 with 73 rules applied. Total rules applied 139 place count 393 transition count 8541
Drop transitions removed 3942 transitions
Redundant transition composition rules discarded 3942 transitions
Iterating global reduction 3 with 3942 rules applied. Total rules applied 4081 place count 393 transition count 4599
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 51 transitions
Reduce isomorphic transitions removed 51 transitions.
Graph (complete) has 5272 edges and 390 vertex of which 357 are kept as prefixes of interest. Removing 33 places using SCC suffix rule.1 ms
Discarding 33 places :
Also discarding 7 output transitions
Drop transitions removed 7 transitions
Iterating post reduction 3 with 55 rules applied. Total rules applied 4136 place count 357 transition count 4541
Drop transitions removed 451 transitions
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 463 transitions.
Iterating post reduction 4 with 463 rules applied. Total rules applied 4599 place count 357 transition count 4078
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 4599 place count 357 transition count 4077
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 4601 place count 356 transition count 4077
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 4607 place count 350 transition count 4055
Iterating global reduction 5 with 6 rules applied. Total rules applied 4613 place count 350 transition count 4055
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 4617 place count 346 transition count 4039
Iterating global reduction 5 with 4 rules applied. Total rules applied 4621 place count 346 transition count 4039
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 5 with 10 rules applied. Total rules applied 4631 place count 341 transition count 4034
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 4632 place count 341 transition count 4033
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 4634 place count 340 transition count 4046
Drop transitions removed 23 transitions
Redundant transition composition rules discarded 23 transitions
Iterating global reduction 6 with 23 rules applied. Total rules applied 4657 place count 340 transition count 4023
Free-agglomeration rule applied 20 times with reduction of 7 identical transitions.
Iterating global reduction 6 with 20 rules applied. Total rules applied 4677 place count 340 transition count 3996
Reduce places removed 20 places and 0 transitions.
Ensure Unique test removed 65 transitions
Reduce isomorphic transitions removed 65 transitions.
Iterating post reduction 6 with 85 rules applied. Total rules applied 4762 place count 320 transition count 3931
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 4764 place count 319 transition count 3940
Drop transitions removed 94 transitions
Redundant transition composition rules discarded 94 transitions
Iterating global reduction 7 with 94 rules applied. Total rules applied 4858 place count 319 transition count 3846
Free-agglomeration rule applied 11 times with reduction of 2 identical transitions.
Iterating global reduction 7 with 11 rules applied. Total rules applied 4869 place count 319 transition count 3833
Reduce places removed 11 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 7 with 21 rules applied. Total rules applied 4890 place count 308 transition count 3823
Drop transitions removed 29 transitions
Redundant transition composition rules discarded 29 transitions
Iterating global reduction 8 with 29 rules applied. Total rules applied 4919 place count 308 transition count 3794
Free-agglomeration rule applied 4 times.
Iterating global reduction 8 with 4 rules applied. Total rules applied 4923 place count 308 transition count 3790
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 8 with 4 rules applied. Total rules applied 4927 place count 304 transition count 3790
Drop transitions removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 9 with 11 rules applied. Total rules applied 4938 place count 304 transition count 3779
Free-agglomeration rule applied 1 times.
Iterating global reduction 9 with 1 rules applied. Total rules applied 4939 place count 304 transition count 3778
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 4940 place count 303 transition count 3778
Free-agglomeration rule (complex) applied 7 times with reduction of 11 identical transitions.
Iterating global reduction 10 with 7 rules applied. Total rules applied 4947 place count 303 transition count 3851
Reduce places removed 7 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 10 with 8 rules applied. Total rules applied 4955 place count 296 transition count 3850
Drop transitions removed 41 transitions
Redundant transition composition rules discarded 41 transitions
Iterating global reduction 11 with 41 rules applied. Total rules applied 4996 place count 296 transition count 3809
Applied a total of 4996 rules in 1466 ms. Remains 296 /1296 variables (removed 1000) and now considering 3809/89908 (removed 86099) transitions.
Running SMT prover for 1 properties.
[2023-03-18 01:41:15] [INFO ] Flow matrix only has 3693 transitions (discarded 116 similar events)
// Phase 1: matrix 3693 rows 296 cols
[2023-03-18 01:41:15] [INFO ] Computed 0 place invariants in 26 ms
[2023-03-18 01:41:16] [INFO ] After 566ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 01:41:16] [INFO ] After 511ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 01:41:16] [INFO ] State equation strengthened by 16 read => feed constraints.
[2023-03-18 01:41:16] [INFO ] After 85ms SMT Verify possible using 16 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-18 01:41:16] [INFO ] After 203ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 77 ms.
[2023-03-18 01:41:16] [INFO ] After 834ms 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 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 31 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Product exploration explored 100000 steps with 1 reset in 4958 ms.
Product exploration explored 100000 steps with 0 reset in 4926 ms.
Support contains 2 out of 1343 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1343/1343 places, 92651/92651 transitions.
Applied a total of 0 rules in 386 ms. Remains 1343 /1343 variables (removed 0) and now considering 92651/92651 (removed 0) transitions.
[2023-03-18 01:41:27] [INFO ] Flow matrix only has 62309 transitions (discarded 30342 similar events)
// Phase 1: matrix 62309 rows 1343 cols
[2023-03-18 01:41:27] [INFO ] Computed 12 place invariants in 220 ms
[2023-03-18 01:41:31] [INFO ] Implicit Places using invariants in 3653 ms returned []
Implicit Place search using SMT only with invariants took 3655 ms to find 0 implicit places.
[2023-03-18 01:41:31] [INFO ] Flow matrix only has 62309 transitions (discarded 30342 similar events)
[2023-03-18 01:41:31] [INFO ] Invariant cache hit.
[2023-03-18 01:42:01] [INFO ] Performed 89614/92651 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-18 01:42:02] [INFO ] Dead Transitions using invariants and state equation in 31200 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 35245 ms. Remains : 1343/1343 places, 92651/92651 transitions.
Treatment of property RERS2020-PT-pb107-LTLFireability-11 finished in 323771 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(p0)&&X(G(p1))))'
Support contains 4 out of 1369 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1369/1369 places, 93216/93216 transitions.
Applied a total of 0 rules in 126 ms. Remains 1369 /1369 variables (removed 0) and now considering 93216/93216 (removed 0) transitions.
[2023-03-18 01:42:05] [INFO ] Flow matrix only has 62870 transitions (discarded 30346 similar events)
// Phase 1: matrix 62870 rows 1369 cols
[2023-03-18 01:42:05] [INFO ] Computed 12 place invariants in 258 ms
[2023-03-18 01:42:09] [INFO ] Implicit Places using invariants in 3827 ms returned []
Implicit Place search using SMT only with invariants took 3828 ms to find 0 implicit places.
[2023-03-18 01:42:09] [INFO ] Flow matrix only has 62870 transitions (discarded 30346 similar events)
[2023-03-18 01:42:09] [INFO ] Invariant cache hit.
[2023-03-18 01:42:39] [INFO ] Performed 88961/93216 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-18 01:42:41] [INFO ] Dead Transitions using invariants and state equation in 31685 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 35642 ms. Remains : 1369/1369 places, 93216/93216 transitions.
Stuttering acceptance computed with spot in 141 ms :[(NOT p1), true, (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : RERS2020-PT-pb107-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=p0, acceptance={} source=2 dest: 0}, { cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=(AND p0 p1), acceptance={0} source=3 dest: 0}, { cond=(NOT p1), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={0} source=3 dest: 3}]], initial=2, aps=[p1:(OR (NEQ s292 1) (NEQ s1002 1)), p0:(OR (EQ s414 0) (EQ s865 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 5181 ms.
Product exploration explored 100000 steps with 0 reset in 5121 ms.
Computed a total of 261 stabilizing places and 30825 stable transitions
Computed a total of 261 stabilizing places and 30825 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p0) p1))), (X (AND p0 p1)), (X p1), true, (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 p1))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 366 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 73 ms :[true, (NOT p1), (NOT p1)]
Incomplete random walk after 10000 steps, including 3 resets, run finished after 567 ms. (steps per millisecond=17 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 9142 steps, run timeout after 3003 ms. (steps per millisecond=3 ) properties seen :{}
Probabilistic random walk after 9142 steps, saw 7494 distinct states, run finished after 3004 ms. (steps per millisecond=3 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-18 01:42:56] [INFO ] Flow matrix only has 62870 transitions (discarded 30346 similar events)
[2023-03-18 01:42:56] [INFO ] Invariant cache hit.
[2023-03-18 01:42:56] [INFO ] [Real]Absence check using 12 positive place invariants in 9 ms returned sat
[2023-03-18 01:43:15] [INFO ] After 19241ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-18 01:43:16] [INFO ] State equation strengthened by 3692 read => feed constraints.
[2023-03-18 01:43:21] [INFO ] After 5115ms SMT Verify possible using 3692 Read/Feed constraints in real domain returned unsat :0 sat :0
[2023-03-18 01:43:21] [INFO ] After 25019ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 1369 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1369/1369 places, 93216/93216 transitions.
Drop transitions removed 2811 transitions
Reduce isomorphic transitions removed 2811 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 2812 rules applied. Total rules applied 2812 place count 1369 transition count 90404
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2813 place count 1368 transition count 90404
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 2813 place count 1368 transition count 90402
Deduced a syphon composed of 2 places in 43 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 2817 place count 1366 transition count 90402
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 2819 place count 1366 transition count 90400
Performed 17 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 17 places in 43 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 2853 place count 1349 transition count 90380
Drop transitions removed 6 transitions
Ensure Unique test removed 439 transitions
Reduce isomorphic transitions removed 445 transitions.
Iterating post reduction 3 with 445 rules applied. Total rules applied 3298 place count 1349 transition count 89935
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 44 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 3306 place count 1345 transition count 89931
Drop transitions removed 4 transitions
Ensure Unique test removed 92 transitions
Reduce isomorphic transitions removed 96 transitions.
Iterating post reduction 4 with 96 rules applied. Total rules applied 3402 place count 1345 transition count 89835
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 1 places in 44 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 3404 place count 1344 transition count 89836
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 3407 place count 1344 transition count 89833
Free-agglomeration rule applied 32 times.
Iterating global reduction 6 with 32 rules applied. Total rules applied 3439 place count 1344 transition count 89801
Reduce places removed 32 places and 0 transitions.
Drop transitions removed 44 transitions
Ensure Unique test removed 555 transitions
Reduce isomorphic transitions removed 599 transitions.
Iterating post reduction 6 with 631 rules applied. Total rules applied 4070 place count 1312 transition count 89202
Free-agglomeration rule (complex) applied 15 times with reduction of 16 identical transitions.
Iterating global reduction 7 with 15 rules applied. Total rules applied 4085 place count 1312 transition count 89935
Reduce places removed 15 places and 0 transitions.
Drop transitions removed 5 transitions
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 26 transitions.
Iterating post reduction 7 with 41 rules applied. Total rules applied 4126 place count 1297 transition count 89909
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 4127 place count 1296 transition count 89908
Applied a total of 4127 rules in 3555 ms. Remains 1296 /1369 variables (removed 73) and now considering 89908/93216 (removed 3308) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3557 ms. Remains : 1296/1369 places, 89908/93216 transitions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 519 ms. (steps per millisecond=19 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 9833 steps, run timeout after 3001 ms. (steps per millisecond=3 ) properties seen :{}
Probabilistic random walk after 9833 steps, saw 7834 distinct states, run finished after 3001 ms. (steps per millisecond=3 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-18 01:43:28] [INFO ] Flow matrix only has 62424 transitions (discarded 27484 similar events)
// Phase 1: matrix 62424 rows 1296 cols
[2023-03-18 01:43:28] [INFO ] Computed 12 place invariants in 201 ms
[2023-03-18 01:43:29] [INFO ] [Real]Absence check using 12 positive place invariants in 10 ms returned sat
[2023-03-18 01:43:48] [INFO ] After 19549ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-18 01:43:49] [INFO ] State equation strengthened by 3688 read => feed constraints.
[2023-03-18 01:43:54] [INFO ] After 4877ms SMT Verify possible using 3688 Read/Feed constraints in real domain returned unsat :0 sat :0
[2023-03-18 01:43:54] [INFO ] After 25020ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 17 ms.
Support contains 2 out of 1296 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1296/1296 places, 89908/89908 transitions.
Applied a total of 0 rules in 416 ms. Remains 1296 /1296 variables (removed 0) and now considering 89908/89908 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 416 ms. Remains : 1296/1296 places, 89908/89908 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1296/1296 places, 89908/89908 transitions.
Applied a total of 0 rules in 381 ms. Remains 1296 /1296 variables (removed 0) and now considering 89908/89908 (removed 0) transitions.
[2023-03-18 01:43:54] [INFO ] Flow matrix only has 62424 transitions (discarded 27484 similar events)
[2023-03-18 01:43:54] [INFO ] Invariant cache hit.
[2023-03-18 01:43:58] [INFO ] Implicit Places using invariants in 3460 ms returned []
Implicit Place search using SMT only with invariants took 3460 ms to find 0 implicit places.
[2023-03-18 01:43:58] [INFO ] Flow matrix only has 62424 transitions (discarded 27484 similar events)
[2023-03-18 01:43:58] [INFO ] Invariant cache hit.
[2023-03-18 01:44:27] [INFO ] Dead Transitions using invariants and state equation in 29110 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32957 ms. Remains : 1296/1296 places, 89908/89908 transitions.
Graph (trivial) has 31704 edges and 1296 vertex of which 1030 / 1296 are part of one of the 152 SCC in 4 ms
Free SCC test removed 878 places
Drop transitions removed 33062 transitions
Ensure Unique test removed 48183 transitions
Reduce isomorphic transitions removed 81245 transitions.
Graph (complete) has 8350 edges and 418 vertex of which 403 are kept as prefixes of interest. Removing 15 places using SCC suffix rule.4 ms
Discarding 15 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Drop transitions removed 23 transitions
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 42 transitions.
Iterating post reduction 0 with 42 rules applied. Total rules applied 44 place count 403 transition count 8619
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 44 place count 403 transition count 8618
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 46 place count 402 transition count 8618
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 49 place count 399 transition count 8606
Iterating global reduction 1 with 3 rules applied. Total rules applied 52 place count 399 transition count 8606
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 58 place count 399 transition count 8600
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 2 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 66 place count 395 transition count 8596
Ensure Unique test removed 73 transitions
Reduce isomorphic transitions removed 73 transitions.
Iterating post reduction 2 with 73 rules applied. Total rules applied 139 place count 395 transition count 8523
Drop transitions removed 3945 transitions
Redundant transition composition rules discarded 3945 transitions
Iterating global reduction 3 with 3945 rules applied. Total rules applied 4084 place count 395 transition count 4578
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 51 transitions
Reduce isomorphic transitions removed 51 transitions.
Graph (complete) has 5261 edges and 392 vertex of which 361 are kept as prefixes of interest. Removing 31 places using SCC suffix rule.1 ms
Discarding 31 places :
Also discarding 7 output transitions
Drop transitions removed 7 transitions
Iterating post reduction 3 with 55 rules applied. Total rules applied 4139 place count 361 transition count 4520
Drop transitions removed 443 transitions
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 455 transitions.
Iterating post reduction 4 with 455 rules applied. Total rules applied 4594 place count 361 transition count 4065
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 4594 place count 361 transition count 4064
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 4596 place count 360 transition count 4064
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 4602 place count 354 transition count 4042
Iterating global reduction 5 with 6 rules applied. Total rules applied 4608 place count 354 transition count 4042
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 4612 place count 350 transition count 4026
Iterating global reduction 5 with 4 rules applied. Total rules applied 4616 place count 350 transition count 4026
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 5 with 10 rules applied. Total rules applied 4626 place count 345 transition count 4021
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 4627 place count 345 transition count 4020
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 4629 place count 344 transition count 4033
Drop transitions removed 23 transitions
Redundant transition composition rules discarded 23 transitions
Iterating global reduction 6 with 23 rules applied. Total rules applied 4652 place count 344 transition count 4010
Free-agglomeration rule applied 19 times with reduction of 7 identical transitions.
Iterating global reduction 6 with 19 rules applied. Total rules applied 4671 place count 344 transition count 3984
Reduce places removed 19 places and 0 transitions.
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Iterating post reduction 6 with 82 rules applied. Total rules applied 4753 place count 325 transition count 3921
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 4755 place count 324 transition count 3930
Drop transitions removed 78 transitions
Redundant transition composition rules discarded 78 transitions
Iterating global reduction 7 with 78 rules applied. Total rules applied 4833 place count 324 transition count 3852
Free-agglomeration rule applied 10 times with reduction of 1 identical transitions.
Iterating global reduction 7 with 10 rules applied. Total rules applied 4843 place count 324 transition count 3841
Reduce places removed 10 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 7 with 21 rules applied. Total rules applied 4864 place count 314 transition count 3830
Drop transitions removed 30 transitions
Redundant transition composition rules discarded 30 transitions
Iterating global reduction 8 with 30 rules applied. Total rules applied 4894 place count 314 transition count 3800
Free-agglomeration rule applied 4 times.
Iterating global reduction 8 with 4 rules applied. Total rules applied 4898 place count 314 transition count 3796
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 8 with 4 rules applied. Total rules applied 4902 place count 310 transition count 3796
Drop transitions removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 9 with 13 rules applied. Total rules applied 4915 place count 310 transition count 3783
Free-agglomeration rule applied 1 times.
Iterating global reduction 9 with 1 rules applied. Total rules applied 4916 place count 310 transition count 3782
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 4917 place count 309 transition count 3782
Free-agglomeration rule (complex) applied 7 times with reduction of 11 identical transitions.
Iterating global reduction 10 with 7 rules applied. Total rules applied 4924 place count 309 transition count 3856
Reduce places removed 7 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 10 with 8 rules applied. Total rules applied 4932 place count 302 transition count 3855
Drop transitions removed 42 transitions
Redundant transition composition rules discarded 42 transitions
Iterating global reduction 11 with 42 rules applied. Total rules applied 4974 place count 302 transition count 3813
Applied a total of 4974 rules in 1456 ms. Remains 302 /1296 variables (removed 994) and now considering 3813/89908 (removed 86095) transitions.
Running SMT prover for 1 properties.
[2023-03-18 01:44:28] [INFO ] Flow matrix only has 3695 transitions (discarded 118 similar events)
// Phase 1: matrix 3695 rows 302 cols
[2023-03-18 01:44:28] [INFO ] Computed 0 place invariants in 20 ms
[2023-03-18 01:44:29] [INFO ] After 595ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 01:44:30] [INFO ] After 528ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 01:44:30] [INFO ] State equation strengthened by 17 read => feed constraints.
[2023-03-18 01:44:30] [INFO ] After 75ms SMT Verify possible using 17 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-18 01:44:30] [INFO ] After 180ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 65 ms.
[2023-03-18 01:44:30] [INFO ] After 820ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p0) p1))), (X (AND p0 p1)), (X p1), true, (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 p1))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 327 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 88 ms :[true, (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 87 ms :[true, (NOT p1), (NOT p1)]
Support contains 2 out of 1369 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 1369/1369 places, 93216/93216 transitions.
Applied a total of 0 rules in 128 ms. Remains 1369 /1369 variables (removed 0) and now considering 93216/93216 (removed 0) transitions.
[2023-03-18 01:44:31] [INFO ] Flow matrix only has 62870 transitions (discarded 30346 similar events)
// Phase 1: matrix 62870 rows 1369 cols
[2023-03-18 01:44:31] [INFO ] Computed 12 place invariants in 250 ms
[2023-03-18 01:44:34] [INFO ] Implicit Places using invariants in 3482 ms returned []
Implicit Place search using SMT only with invariants took 3483 ms to find 0 implicit places.
[2023-03-18 01:44:34] [INFO ] Flow matrix only has 62870 transitions (discarded 30346 similar events)
[2023-03-18 01:44:34] [INFO ] Invariant cache hit.
[2023-03-18 01:45:04] [INFO ] Performed 85105/93216 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-18 01:45:07] [INFO ] Dead Transitions using invariants and state equation in 33286 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 36900 ms. Remains : 1369/1369 places, 93216/93216 transitions.
Computed a total of 261 stabilizing places and 30825 stable transitions
Computed a total of 261 stabilizing places and 30825 stable transitions
Knowledge obtained : [p1, (X p1), (X (X p1)), true]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 167 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 81 ms :[true, (NOT p1), (NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 739 ms. (steps per millisecond=13 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 9919 steps, run timeout after 3001 ms. (steps per millisecond=3 ) properties seen :{}
Probabilistic random walk after 9919 steps, saw 8004 distinct states, run finished after 3003 ms. (steps per millisecond=3 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-18 01:45:12] [INFO ] Flow matrix only has 62870 transitions (discarded 30346 similar events)
[2023-03-18 01:45:12] [INFO ] Invariant cache hit.
[2023-03-18 01:45:12] [INFO ] [Real]Absence check using 12 positive place invariants in 8 ms returned sat
[2023-03-18 01:45:33] [INFO ] After 20244ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-18 01:45:34] [INFO ] State equation strengthened by 3692 read => feed constraints.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:642)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:339)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-18 01:45:37] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-18 01:45:37] [INFO ] After 25033ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 1369 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1369/1369 places, 93216/93216 transitions.
Drop transitions removed 2811 transitions
Reduce isomorphic transitions removed 2811 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 2812 rules applied. Total rules applied 2812 place count 1369 transition count 90404
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2813 place count 1368 transition count 90404
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 2813 place count 1368 transition count 90402
Deduced a syphon composed of 2 places in 60 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 2817 place count 1366 transition count 90402
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 2819 place count 1366 transition count 90400
Performed 17 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 17 places in 60 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 2853 place count 1349 transition count 90380
Drop transitions removed 6 transitions
Ensure Unique test removed 439 transitions
Reduce isomorphic transitions removed 445 transitions.
Iterating post reduction 3 with 445 rules applied. Total rules applied 3298 place count 1349 transition count 89935
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 61 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 3306 place count 1345 transition count 89931
Drop transitions removed 4 transitions
Ensure Unique test removed 92 transitions
Reduce isomorphic transitions removed 96 transitions.
Iterating post reduction 4 with 96 rules applied. Total rules applied 3402 place count 1345 transition count 89835
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 1 places in 61 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 3404 place count 1344 transition count 89836
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 3407 place count 1344 transition count 89833
Free-agglomeration rule applied 32 times.
Iterating global reduction 6 with 32 rules applied. Total rules applied 3439 place count 1344 transition count 89801
Reduce places removed 32 places and 0 transitions.
Drop transitions removed 44 transitions
Ensure Unique test removed 555 transitions
Reduce isomorphic transitions removed 599 transitions.
Iterating post reduction 6 with 631 rules applied. Total rules applied 4070 place count 1312 transition count 89202
Free-agglomeration rule (complex) applied 15 times with reduction of 16 identical transitions.
Iterating global reduction 7 with 15 rules applied. Total rules applied 4085 place count 1312 transition count 89935
Reduce places removed 15 places and 0 transitions.
Drop transitions removed 5 transitions
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 26 transitions.
Iterating post reduction 7 with 41 rules applied. Total rules applied 4126 place count 1297 transition count 89909
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 4127 place count 1296 transition count 89908
Applied a total of 4127 rules in 4740 ms. Remains 1296 /1369 variables (removed 73) and now considering 89908/93216 (removed 3308) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4742 ms. Remains : 1296/1369 places, 89908/93216 transitions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 631 ms. (steps per millisecond=15 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 7421 steps, run timeout after 3004 ms. (steps per millisecond=2 ) properties seen :{}
Probabilistic random walk after 7421 steps, saw 5737 distinct states, run finished after 3004 ms. (steps per millisecond=2 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-18 01:45:46] [INFO ] Flow matrix only has 62424 transitions (discarded 27484 similar events)
// Phase 1: matrix 62424 rows 1296 cols
[2023-03-18 01:45:46] [INFO ] Computed 12 place invariants in 221 ms
[2023-03-18 01:45:46] [INFO ] [Real]Absence check using 12 positive place invariants in 8 ms returned sat
[2023-03-18 01:46:06] [INFO ] After 19698ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-18 01:46:06] [INFO ] State equation strengthened by 3688 read => feed constraints.
[2023-03-18 01:46:11] [INFO ] After 4738ms SMT Verify possible using 3688 Read/Feed constraints in real domain returned unsat :0 sat :0
[2023-03-18 01:46:11] [INFO ] After 25023ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 18 ms.
Support contains 2 out of 1296 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1296/1296 places, 89908/89908 transitions.
Applied a total of 0 rules in 481 ms. Remains 1296 /1296 variables (removed 0) and now considering 89908/89908 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 481 ms. Remains : 1296/1296 places, 89908/89908 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1296/1296 places, 89908/89908 transitions.
Applied a total of 0 rules in 520 ms. Remains 1296 /1296 variables (removed 0) and now considering 89908/89908 (removed 0) transitions.
[2023-03-18 01:46:12] [INFO ] Flow matrix only has 62424 transitions (discarded 27484 similar events)
[2023-03-18 01:46:12] [INFO ] Invariant cache hit.
[2023-03-18 01:46:16] [INFO ] Implicit Places using invariants in 3623 ms returned []
Implicit Place search using SMT only with invariants took 3624 ms to find 0 implicit places.
[2023-03-18 01:46:16] [INFO ] Flow matrix only has 62424 transitions (discarded 27484 similar events)
[2023-03-18 01:46:16] [INFO ] Invariant cache hit.
[2023-03-18 01:46:46] [INFO ] Performed 87587/89908 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-18 01:46:47] [INFO ] Dead Transitions using invariants and state equation in 30972 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35126 ms. Remains : 1296/1296 places, 89908/89908 transitions.
Graph (trivial) has 31704 edges and 1296 vertex of which 1030 / 1296 are part of one of the 152 SCC in 5 ms
Free SCC test removed 878 places
Drop transitions removed 33062 transitions
Ensure Unique test removed 48183 transitions
Reduce isomorphic transitions removed 81245 transitions.
Graph (complete) has 8350 edges and 418 vertex of which 403 are kept as prefixes of interest. Removing 15 places using SCC suffix rule.4 ms
Discarding 15 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Drop transitions removed 23 transitions
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 42 transitions.
Iterating post reduction 0 with 42 rules applied. Total rules applied 44 place count 403 transition count 8619
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 44 place count 403 transition count 8618
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 46 place count 402 transition count 8618
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 49 place count 399 transition count 8606
Iterating global reduction 1 with 3 rules applied. Total rules applied 52 place count 399 transition count 8606
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 58 place count 399 transition count 8600
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 2 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 66 place count 395 transition count 8596
Ensure Unique test removed 73 transitions
Reduce isomorphic transitions removed 73 transitions.
Iterating post reduction 2 with 73 rules applied. Total rules applied 139 place count 395 transition count 8523
Drop transitions removed 3945 transitions
Redundant transition composition rules discarded 3945 transitions
Iterating global reduction 3 with 3945 rules applied. Total rules applied 4084 place count 395 transition count 4578
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 51 transitions
Reduce isomorphic transitions removed 51 transitions.
Graph (complete) has 5261 edges and 392 vertex of which 361 are kept as prefixes of interest. Removing 31 places using SCC suffix rule.2 ms
Discarding 31 places :
Also discarding 7 output transitions
Drop transitions removed 7 transitions
Iterating post reduction 3 with 55 rules applied. Total rules applied 4139 place count 361 transition count 4520
Drop transitions removed 443 transitions
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 455 transitions.
Iterating post reduction 4 with 455 rules applied. Total rules applied 4594 place count 361 transition count 4065
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 4594 place count 361 transition count 4064
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 4596 place count 360 transition count 4064
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 4602 place count 354 transition count 4042
Iterating global reduction 5 with 6 rules applied. Total rules applied 4608 place count 354 transition count 4042
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 4612 place count 350 transition count 4026
Iterating global reduction 5 with 4 rules applied. Total rules applied 4616 place count 350 transition count 4026
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 5 with 10 rules applied. Total rules applied 4626 place count 345 transition count 4021
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 4627 place count 345 transition count 4020
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 4629 place count 344 transition count 4033
Drop transitions removed 23 transitions
Redundant transition composition rules discarded 23 transitions
Iterating global reduction 6 with 23 rules applied. Total rules applied 4652 place count 344 transition count 4010
Free-agglomeration rule applied 19 times with reduction of 7 identical transitions.
Iterating global reduction 6 with 19 rules applied. Total rules applied 4671 place count 344 transition count 3984
Reduce places removed 19 places and 0 transitions.
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Iterating post reduction 6 with 82 rules applied. Total rules applied 4753 place count 325 transition count 3921
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 4755 place count 324 transition count 3930
Drop transitions removed 78 transitions
Redundant transition composition rules discarded 78 transitions
Iterating global reduction 7 with 78 rules applied. Total rules applied 4833 place count 324 transition count 3852
Free-agglomeration rule applied 10 times with reduction of 1 identical transitions.
Iterating global reduction 7 with 10 rules applied. Total rules applied 4843 place count 324 transition count 3841
Reduce places removed 10 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 7 with 21 rules applied. Total rules applied 4864 place count 314 transition count 3830
Drop transitions removed 30 transitions
Redundant transition composition rules discarded 30 transitions
Iterating global reduction 8 with 30 rules applied. Total rules applied 4894 place count 314 transition count 3800
Free-agglomeration rule applied 4 times.
Iterating global reduction 8 with 4 rules applied. Total rules applied 4898 place count 314 transition count 3796
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 8 with 4 rules applied. Total rules applied 4902 place count 310 transition count 3796
Drop transitions removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 9 with 13 rules applied. Total rules applied 4915 place count 310 transition count 3783
Free-agglomeration rule applied 1 times.
Iterating global reduction 9 with 1 rules applied. Total rules applied 4916 place count 310 transition count 3782
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 4917 place count 309 transition count 3782
Free-agglomeration rule (complex) applied 7 times with reduction of 11 identical transitions.
Iterating global reduction 10 with 7 rules applied. Total rules applied 4924 place count 309 transition count 3856
Reduce places removed 7 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 10 with 8 rules applied. Total rules applied 4932 place count 302 transition count 3855
Drop transitions removed 42 transitions
Redundant transition composition rules discarded 42 transitions
Iterating global reduction 11 with 42 rules applied. Total rules applied 4974 place count 302 transition count 3813
Applied a total of 4974 rules in 1486 ms. Remains 302 /1296 variables (removed 994) and now considering 3813/89908 (removed 86095) transitions.
Running SMT prover for 1 properties.
[2023-03-18 01:46:48] [INFO ] Flow matrix only has 3695 transitions (discarded 118 similar events)
// Phase 1: matrix 3695 rows 302 cols
[2023-03-18 01:46:48] [INFO ] Computed 0 place invariants in 21 ms
[2023-03-18 01:46:49] [INFO ] After 574ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 01:46:49] [INFO ] After 519ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 01:46:49] [INFO ] State equation strengthened by 17 read => feed constraints.
[2023-03-18 01:46:49] [INFO ] After 76ms SMT Verify possible using 17 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-18 01:46:50] [INFO ] After 181ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 66 ms.
[2023-03-18 01:46:50] [INFO ] After 815ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p1, (X p1), (X (X p1)), true]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 134 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 64 ms :[true, (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 60 ms :[true, (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 70 ms :[true, (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 1 reset in 4903 ms.
Product exploration explored 100000 steps with 0 reset in 5121 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 75 ms :[true, (NOT p1), (NOT p1)]
Support contains 2 out of 1369 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1369/1369 places, 93216/93216 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 1369 transition count 93216
Performed 19 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 20 places in 46 ms
Iterating global reduction 1 with 19 rules applied. Total rules applied 20 place count 1369 transition count 93213
Ensure Unique test removed 439 transitions
Reduce isomorphic transitions removed 439 transitions.
Iterating post reduction 1 with 439 rules applied. Total rules applied 459 place count 1369 transition count 92774
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 461 place count 1367 transition count 92772
Deduced a syphon composed of 18 places in 46 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 463 place count 1367 transition count 92772
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 22 places in 46 ms
Iterating global reduction 2 with 4 rules applied. Total rules applied 467 place count 1367 transition count 92772
Ensure Unique test removed 96 transitions
Reduce isomorphic transitions removed 96 transitions.
Iterating post reduction 2 with 96 rules applied. Total rules applied 563 place count 1367 transition count 92676
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 567 place count 1363 transition count 92672
Deduced a syphon composed of 18 places in 47 ms
Iterating global reduction 3 with 4 rules applied. Total rules applied 571 place count 1363 transition count 92672
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 19 places in 46 ms
Iterating global reduction 3 with 1 rules applied. Total rules applied 572 place count 1363 transition count 92675
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 575 place count 1363 transition count 92672
Deduced a syphon composed of 19 places in 46 ms
Applied a total of 575 rules in 2030 ms. Remains 1363 /1369 variables (removed 6) and now considering 92672/93216 (removed 544) transitions.
[2023-03-18 01:47:02] [INFO ] Flow matrix only has 62330 transitions (discarded 30342 similar events)
// Phase 1: matrix 62330 rows 1363 cols
[2023-03-18 01:47:03] [INFO ] Computed 12 place invariants in 233 ms
[2023-03-18 01:47:31] [INFO ] Dead Transitions using invariants and state equation in 29072 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1363/1369 places, 92672/93216 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 31104 ms. Remains : 1363/1369 places, 92672/93216 transitions.
Support contains 2 out of 1369 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1369/1369 places, 93216/93216 transitions.
Applied a total of 0 rules in 163 ms. Remains 1369 /1369 variables (removed 0) and now considering 93216/93216 (removed 0) transitions.
[2023-03-18 01:47:32] [INFO ] Flow matrix only has 62870 transitions (discarded 30346 similar events)
// Phase 1: matrix 62870 rows 1369 cols
[2023-03-18 01:47:32] [INFO ] Computed 12 place invariants in 224 ms
[2023-03-18 01:47:35] [INFO ] Implicit Places using invariants in 3498 ms returned []
Implicit Place search using SMT only with invariants took 3502 ms to find 0 implicit places.
[2023-03-18 01:47:35] [INFO ] Flow matrix only has 62870 transitions (discarded 30346 similar events)
[2023-03-18 01:47:35] [INFO ] Invariant cache hit.
[2023-03-18 01:48:05] [INFO ] Performed 91046/93216 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-18 01:48:06] [INFO ] Dead Transitions using invariants and state equation in 30949 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 34617 ms. Remains : 1369/1369 places, 93216/93216 transitions.
Treatment of property RERS2020-PT-pb107-LTLFireability-12 finished in 364058 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(p0)||G(p1)))'
Support contains 4 out of 1369 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1369/1369 places, 93216/93216 transitions.
Reduce places removed 1 places and 1 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 1368 transition count 93214
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 1367 transition count 93214
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 2 place count 1367 transition count 93212
Deduced a syphon composed of 2 places in 44 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 6 place count 1365 transition count 93212
Performed 17 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 17 places in 142 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 40 place count 1348 transition count 93192
Ensure Unique test removed 439 transitions
Reduce isomorphic transitions removed 439 transitions.
Iterating post reduction 2 with 439 rules applied. Total rules applied 479 place count 1348 transition count 92753
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 56 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 487 place count 1344 transition count 92749
Ensure Unique test removed 96 transitions
Reduce isomorphic transitions removed 96 transitions.
Iterating post reduction 3 with 96 rules applied. Total rules applied 583 place count 1344 transition count 92653
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 1 places in 55 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 585 place count 1343 transition count 92654
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 588 place count 1343 transition count 92651
Applied a total of 588 rules in 2695 ms. Remains 1343 /1369 variables (removed 26) and now considering 92651/93216 (removed 565) transitions.
[2023-03-18 01:48:12] [INFO ] Flow matrix only has 62309 transitions (discarded 30342 similar events)
// Phase 1: matrix 62309 rows 1343 cols
[2023-03-18 01:48:12] [INFO ] Computed 12 place invariants in 195 ms
[2023-03-18 01:48:15] [INFO ] Implicit Places using invariants in 3518 ms returned []
Implicit Place search using SMT only with invariants took 3524 ms to find 0 implicit places.
[2023-03-18 01:48:15] [INFO ] Flow matrix only has 62309 transitions (discarded 30342 similar events)
[2023-03-18 01:48:15] [INFO ] Invariant cache hit.
[2023-03-18 01:48:45] [INFO ] Performed 84987/92651 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-18 01:48:48] [INFO ] Dead Transitions using invariants and state equation in 32964 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1343/1369 places, 92651/93216 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 39191 ms. Remains : 1343/1369 places, 92651/93216 transitions.
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : RERS2020-PT-pb107-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(AND (EQ s259 1) (EQ s1001 1)), p1:(AND (EQ s445 1) (EQ s1058 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 0 reset in 4992 ms.
Stuttering criterion allowed to conclude after 214 steps with 0 reset in 15 ms.
FORMULA RERS2020-PT-pb107-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RERS2020-PT-pb107-LTLFireability-14 finished in 44416 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 G(p1)))'
Support contains 4 out of 1369 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1369/1369 places, 93216/93216 transitions.
Reduce places removed 1 places and 1 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 1368 transition count 93214
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 1367 transition count 93214
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 2 place count 1367 transition count 93212
Deduced a syphon composed of 2 places in 44 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 6 place count 1365 transition count 93212
Performed 17 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 17 places in 45 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 40 place count 1348 transition count 93192
Ensure Unique test removed 439 transitions
Reduce isomorphic transitions removed 439 transitions.
Iterating post reduction 2 with 439 rules applied. Total rules applied 479 place count 1348 transition count 92753
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 44 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 487 place count 1344 transition count 92749
Ensure Unique test removed 96 transitions
Reduce isomorphic transitions removed 96 transitions.
Iterating post reduction 3 with 96 rules applied. Total rules applied 583 place count 1344 transition count 92653
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 1 places in 46 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 585 place count 1343 transition count 92654
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 588 place count 1343 transition count 92651
Applied a total of 588 rules in 2086 ms. Remains 1343 /1369 variables (removed 26) and now considering 92651/93216 (removed 565) transitions.
[2023-03-18 01:48:56] [INFO ] Flow matrix only has 62309 transitions (discarded 30342 similar events)
[2023-03-18 01:48:56] [INFO ] Invariant cache hit.
[2023-03-18 01:48:59] [INFO ] Implicit Places using invariants in 3277 ms returned []
Implicit Place search using SMT only with invariants took 3278 ms to find 0 implicit places.
[2023-03-18 01:48:59] [INFO ] Flow matrix only has 62309 transitions (discarded 30342 similar events)
[2023-03-18 01:48:59] [INFO ] Invariant cache hit.
[2023-03-18 01:49:29] [INFO ] Performed 92033/92651 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-18 01:49:29] [INFO ] Dead Transitions using invariants and state equation in 30411 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1343/1369 places, 92651/93216 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 35777 ms. Remains : 1343/1369 places, 92651/93216 transitions.
Stuttering acceptance computed with spot in 118 ms :[(NOT p1), p0, (AND p0 p1)]
Running random walk in product with property : RERS2020-PT-pb107-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={0} source=1 dest: 1}], [{ cond=(AND p1 p0), acceptance={} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(AND (EQ s1068 1) (EQ s1322 1)), p0:(AND (EQ s840 1) (EQ s1058 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 33249 reset in 4551 ms.
Product exploration explored 100000 steps with 33302 reset in 4485 ms.
Computed a total of 257 stabilizing places and 30632 stable transitions
Computed a total of 257 stabilizing places and 30632 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND p1 p0))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p1 p0)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 325 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter insensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 130 ms :[(NOT p1), p0, (AND p0 p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 718 ms. (steps per millisecond=13 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 8718 steps, run timeout after 3002 ms. (steps per millisecond=2 ) properties seen :{}
Probabilistic random walk after 8718 steps, saw 6142 distinct states, run finished after 3002 ms. (steps per millisecond=2 ) properties seen :0
Running SMT prover for 4 properties.
[2023-03-18 01:49:43] [INFO ] Flow matrix only has 62309 transitions (discarded 30342 similar events)
[2023-03-18 01:49:43] [INFO ] Invariant cache hit.
[2023-03-18 01:49:44] [INFO ] [Real]Absence check using 12 positive place invariants in 11 ms returned sat
[2023-03-18 01:50:07] [INFO ] After 23187ms SMT Verify possible using state equation in real domain returned unsat :0 sat :4
[2023-03-18 01:50:07] [INFO ] State equation strengthened by 3673 read => feed constraints.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:642)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:339)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-18 01:50:09] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-18 01:50:09] [INFO ] After 25134ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 4 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 16 ms.
Support contains 4 out of 1343 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1343/1343 places, 92651/92651 transitions.
Drop transitions removed 2819 transitions
Reduce isomorphic transitions removed 2819 transitions.
Iterating post reduction 0 with 2819 rules applied. Total rules applied 2819 place count 1343 transition count 89832
Free-agglomeration rule applied 32 times.
Iterating global reduction 1 with 32 rules applied. Total rules applied 2851 place count 1343 transition count 89800
Reduce places removed 32 places and 0 transitions.
Drop transitions removed 44 transitions
Ensure Unique test removed 555 transitions
Reduce isomorphic transitions removed 599 transitions.
Iterating post reduction 1 with 631 rules applied. Total rules applied 3482 place count 1311 transition count 89201
Free-agglomeration rule (complex) applied 15 times with reduction of 16 identical transitions.
Iterating global reduction 2 with 15 rules applied. Total rules applied 3497 place count 1311 transition count 89934
Reduce places removed 15 places and 0 transitions.
Drop transitions removed 5 transitions
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 26 transitions.
Iterating post reduction 2 with 41 rules applied. Total rules applied 3538 place count 1296 transition count 89908
Applied a total of 3538 rules in 1833 ms. Remains 1296 /1343 variables (removed 47) and now considering 89908/92651 (removed 2743) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1835 ms. Remains : 1296/1343 places, 89908/92651 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 647 ms. (steps per millisecond=15 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 10003 steps, run timeout after 3003 ms. (steps per millisecond=3 ) properties seen :{}
Probabilistic random walk after 10003 steps, saw 7978 distinct states, run finished after 3003 ms. (steps per millisecond=3 ) properties seen :0
Running SMT prover for 4 properties.
[2023-03-18 01:50:15] [INFO ] Flow matrix only has 62424 transitions (discarded 27484 similar events)
// Phase 1: matrix 62424 rows 1296 cols
[2023-03-18 01:50:15] [INFO ] Computed 12 place invariants in 214 ms
[2023-03-18 01:50:15] [INFO ] [Real]Absence check using 12 positive place invariants in 9 ms returned sat
[2023-03-18 01:50:38] [INFO ] After 23177ms SMT Verify possible using state equation in real domain returned unsat :0 sat :4
[2023-03-18 01:50:39] [INFO ] State equation strengthened by 3688 read => feed constraints.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:642)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:339)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-18 01:50:40] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-18 01:50:40] [INFO ] After 25032ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 4 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 16 ms.
Support contains 4 out of 1296 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1296/1296 places, 89908/89908 transitions.
Applied a total of 0 rules in 395 ms. Remains 1296 /1296 variables (removed 0) and now considering 89908/89908 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 395 ms. Remains : 1296/1296 places, 89908/89908 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1296/1296 places, 89908/89908 transitions.
Applied a total of 0 rules in 393 ms. Remains 1296 /1296 variables (removed 0) and now considering 89908/89908 (removed 0) transitions.
[2023-03-18 01:50:41] [INFO ] Flow matrix only has 62424 transitions (discarded 27484 similar events)
[2023-03-18 01:50:41] [INFO ] Invariant cache hit.
[2023-03-18 01:50:44] [INFO ] Implicit Places using invariants in 3599 ms returned []
Implicit Place search using SMT only with invariants took 3600 ms to find 0 implicit places.
[2023-03-18 01:50:44] [INFO ] Flow matrix only has 62424 transitions (discarded 27484 similar events)
[2023-03-18 01:50:44] [INFO ] Invariant cache hit.
[2023-03-18 01:51:14] [INFO ] Dead Transitions using invariants and state equation in 30181 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34186 ms. Remains : 1296/1296 places, 89908/89908 transitions.
Graph (trivial) has 31367 edges and 1296 vertex of which 1025 / 1296 are part of one of the 152 SCC in 5 ms
Free SCC test removed 873 places
Drop transitions removed 32018 transitions
Ensure Unique test removed 48901 transitions
Reduce isomorphic transitions removed 80919 transitions.
Graph (complete) has 8595 edges and 423 vertex of which 408 are kept as prefixes of interest. Removing 15 places using SCC suffix rule.6 ms
Discarding 15 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Drop transitions removed 23 transitions
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 42 transitions.
Iterating post reduction 0 with 42 rules applied. Total rules applied 44 place count 408 transition count 8945
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 44 place count 408 transition count 8944
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 46 place count 407 transition count 8944
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 49 place count 404 transition count 8932
Iterating global reduction 1 with 3 rules applied. Total rules applied 52 place count 404 transition count 8932
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 58 place count 404 transition count 8926
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 66 place count 400 transition count 8922
Ensure Unique test removed 73 transitions
Reduce isomorphic transitions removed 73 transitions.
Iterating post reduction 2 with 73 rules applied. Total rules applied 139 place count 400 transition count 8849
Drop transitions removed 4122 transitions
Redundant transition composition rules discarded 4122 transitions
Iterating global reduction 3 with 4122 rules applied. Total rules applied 4261 place count 400 transition count 4727
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 51 transitions
Reduce isomorphic transitions removed 51 transitions.
Graph (complete) has 5437 edges and 397 vertex of which 366 are kept as prefixes of interest. Removing 31 places using SCC suffix rule.1 ms
Discarding 31 places :
Also discarding 7 output transitions
Drop transitions removed 7 transitions
Iterating post reduction 3 with 55 rules applied. Total rules applied 4316 place count 366 transition count 4669
Drop transitions removed 445 transitions
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 457 transitions.
Iterating post reduction 4 with 457 rules applied. Total rules applied 4773 place count 366 transition count 4212
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 4773 place count 366 transition count 4211
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 4775 place count 365 transition count 4211
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 4781 place count 359 transition count 4189
Iterating global reduction 5 with 6 rules applied. Total rules applied 4787 place count 359 transition count 4189
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 4791 place count 355 transition count 4173
Iterating global reduction 5 with 4 rules applied. Total rules applied 4795 place count 355 transition count 4173
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 5 with 10 rules applied. Total rules applied 4805 place count 350 transition count 4168
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 4806 place count 350 transition count 4167
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 4808 place count 349 transition count 4180
Drop transitions removed 23 transitions
Redundant transition composition rules discarded 23 transitions
Iterating global reduction 6 with 23 rules applied. Total rules applied 4831 place count 349 transition count 4157
Free-agglomeration rule applied 18 times with reduction of 7 identical transitions.
Iterating global reduction 6 with 18 rules applied. Total rules applied 4849 place count 349 transition count 4132
Reduce places removed 18 places and 0 transitions.
Ensure Unique test removed 68 transitions
Reduce isomorphic transitions removed 68 transitions.
Iterating post reduction 6 with 86 rules applied. Total rules applied 4935 place count 331 transition count 4064
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 4937 place count 330 transition count 4073
Drop transitions removed 90 transitions
Redundant transition composition rules discarded 90 transitions
Iterating global reduction 7 with 90 rules applied. Total rules applied 5027 place count 330 transition count 3983
Free-agglomeration rule applied 9 times with reduction of 2 identical transitions.
Iterating global reduction 7 with 9 rules applied. Total rules applied 5036 place count 330 transition count 3972
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 7 with 19 rules applied. Total rules applied 5055 place count 321 transition count 3962
Drop transitions removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 8 with 19 rules applied. Total rules applied 5074 place count 321 transition count 3943
Free-agglomeration rule applied 2 times.
Iterating global reduction 8 with 2 rules applied. Total rules applied 5076 place count 321 transition count 3941
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 5078 place count 319 transition count 3941
Drop transitions removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 9 with 11 rules applied. Total rules applied 5089 place count 319 transition count 3930
Free-agglomeration rule applied 1 times.
Iterating global reduction 9 with 1 rules applied. Total rules applied 5090 place count 319 transition count 3929
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 5091 place count 318 transition count 3929
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 10 with 4 rules applied. Total rules applied 5095 place count 318 transition count 3994
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 10 with 4 rules applied. Total rules applied 5099 place count 314 transition count 3994
Drop transitions removed 38 transitions
Redundant transition composition rules discarded 38 transitions
Iterating global reduction 11 with 38 rules applied. Total rules applied 5137 place count 314 transition count 3956
Applied a total of 5137 rules in 1525 ms. Remains 314 /1296 variables (removed 982) and now considering 3956/89908 (removed 85952) transitions.
Running SMT prover for 4 properties.
[2023-03-18 01:51:16] [INFO ] Flow matrix only has 3840 transitions (discarded 116 similar events)
// Phase 1: matrix 3840 rows 314 cols
[2023-03-18 01:51:16] [INFO ] Computed 0 place invariants in 22 ms
[2023-03-18 01:51:17] [INFO ] After 969ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-18 01:51:18] [INFO ] After 861ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-18 01:51:18] [INFO ] State equation strengthened by 18 read => feed constraints.
[2023-03-18 01:51:18] [INFO ] After 379ms SMT Verify possible using 18 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-18 01:51:19] [INFO ] After 915ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 353 ms.
[2023-03-18 01:51:19] [INFO ] After 2213ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND p1 p0))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p1 p0)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 299 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter insensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 106 ms :[(NOT p1), p0, (AND p0 p1)]
Stuttering acceptance computed with spot in 110 ms :[(NOT p1), p0, (AND p0 p1)]
[2023-03-18 01:51:20] [INFO ] Flow matrix only has 62309 transitions (discarded 30342 similar events)
// Phase 1: matrix 62309 rows 1343 cols
[2023-03-18 01:51:20] [INFO ] Computed 12 place invariants in 197 ms
Could not prove EG (NOT p1)
Support contains 4 out of 1343 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1343/1343 places, 92651/92651 transitions.
Applied a total of 0 rules in 390 ms. Remains 1343 /1343 variables (removed 0) and now considering 92651/92651 (removed 0) transitions.
[2023-03-18 01:51:36] [INFO ] Flow matrix only has 62309 transitions (discarded 30342 similar events)
[2023-03-18 01:51:36] [INFO ] Invariant cache hit.
[2023-03-18 01:51:39] [INFO ] Implicit Places using invariants in 3340 ms returned []
Implicit Place search using SMT only with invariants took 3341 ms to find 0 implicit places.
[2023-03-18 01:51:39] [INFO ] Flow matrix only has 62309 transitions (discarded 30342 similar events)
[2023-03-18 01:51:39] [INFO ] Invariant cache hit.
[2023-03-18 01:52:09] [INFO ] Performed 89104/92651 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-18 01:52:10] [INFO ] Dead Transitions using invariants and state equation in 31426 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 35160 ms. Remains : 1343/1343 places, 92651/92651 transitions.
Computed a total of 257 stabilizing places and 30632 stable transitions
Computed a total of 257 stabilizing places and 30632 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (NOT (AND p0 p1))), (X (NOT p1)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 365 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter insensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 121 ms :[(NOT p1), p0, (AND p0 p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 690 ms. (steps per millisecond=14 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 7434 steps, run timeout after 3001 ms. (steps per millisecond=2 ) properties seen :{}
Probabilistic random walk after 7434 steps, saw 5386 distinct states, run finished after 3001 ms. (steps per millisecond=2 ) properties seen :0
Running SMT prover for 4 properties.
[2023-03-18 01:52:16] [INFO ] Flow matrix only has 62309 transitions (discarded 30342 similar events)
[2023-03-18 01:52:16] [INFO ] Invariant cache hit.
[2023-03-18 01:52:16] [INFO ] [Real]Absence check using 12 positive place invariants in 10 ms returned sat
[2023-03-18 01:52:39] [INFO ] After 23027ms SMT Verify possible using state equation in real domain returned unsat :0 sat :4
[2023-03-18 01:52:40] [INFO ] State equation strengthened by 3673 read => feed constraints.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:642)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:339)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-18 01:52:41] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-18 01:52:41] [INFO ] After 25141ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 4 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 13 ms.
Support contains 4 out of 1343 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1343/1343 places, 92651/92651 transitions.
Drop transitions removed 2819 transitions
Reduce isomorphic transitions removed 2819 transitions.
Iterating post reduction 0 with 2819 rules applied. Total rules applied 2819 place count 1343 transition count 89832
Free-agglomeration rule applied 32 times.
Iterating global reduction 1 with 32 rules applied. Total rules applied 2851 place count 1343 transition count 89800
Reduce places removed 32 places and 0 transitions.
Drop transitions removed 44 transitions
Ensure Unique test removed 555 transitions
Reduce isomorphic transitions removed 599 transitions.
Iterating post reduction 1 with 631 rules applied. Total rules applied 3482 place count 1311 transition count 89201
Free-agglomeration rule (complex) applied 15 times with reduction of 16 identical transitions.
Iterating global reduction 2 with 15 rules applied. Total rules applied 3497 place count 1311 transition count 89934
Reduce places removed 15 places and 0 transitions.
Drop transitions removed 5 transitions
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 26 transitions.
Iterating post reduction 2 with 41 rules applied. Total rules applied 3538 place count 1296 transition count 89908
Applied a total of 3538 rules in 2721 ms. Remains 1296 /1343 variables (removed 47) and now considering 89908/92651 (removed 2743) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2723 ms. Remains : 1296/1343 places, 89908/92651 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 680 ms. (steps per millisecond=14 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 9341 steps, run timeout after 3002 ms. (steps per millisecond=3 ) properties seen :{}
Probabilistic random walk after 9341 steps, saw 7409 distinct states, run finished after 3002 ms. (steps per millisecond=3 ) properties seen :0
Running SMT prover for 4 properties.
[2023-03-18 01:52:48] [INFO ] Flow matrix only has 62424 transitions (discarded 27484 similar events)
// Phase 1: matrix 62424 rows 1296 cols
[2023-03-18 01:52:48] [INFO ] Computed 12 place invariants in 213 ms
[2023-03-18 01:52:48] [INFO ] [Real]Absence check using 12 positive place invariants in 8 ms returned sat
[2023-03-18 01:53:13] [INFO ] After 24554ms SMT Verify possible using state equation in real domain returned unsat :0 sat :4
[2023-03-18 01:53:13] [INFO ] State equation strengthened by 3688 read => feed constraints.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:642)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:339)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-18 01:53:13] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-18 01:53:13] [INFO ] After 25643ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 4 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 13 ms.
Support contains 4 out of 1296 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1296/1296 places, 89908/89908 transitions.
Applied a total of 0 rules in 476 ms. Remains 1296 /1296 variables (removed 0) and now considering 89908/89908 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 478 ms. Remains : 1296/1296 places, 89908/89908 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1296/1296 places, 89908/89908 transitions.
Applied a total of 0 rules in 526 ms. Remains 1296 /1296 variables (removed 0) and now considering 89908/89908 (removed 0) transitions.
[2023-03-18 01:53:14] [INFO ] Flow matrix only has 62424 transitions (discarded 27484 similar events)
[2023-03-18 01:53:14] [INFO ] Invariant cache hit.
[2023-03-18 01:53:18] [INFO ] Implicit Places using invariants in 3730 ms returned []
Implicit Place search using SMT only with invariants took 3731 ms to find 0 implicit places.
[2023-03-18 01:53:18] [INFO ] Flow matrix only has 62424 transitions (discarded 27484 similar events)
[2023-03-18 01:53:18] [INFO ] Invariant cache hit.
[2023-03-18 01:53:48] [INFO ] Performed 88106/89908 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-18 01:53:49] [INFO ] Dead Transitions using invariants and state equation in 30832 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35098 ms. Remains : 1296/1296 places, 89908/89908 transitions.
Graph (trivial) has 31367 edges and 1296 vertex of which 1025 / 1296 are part of one of the 152 SCC in 5 ms
Free SCC test removed 873 places
Drop transitions removed 32018 transitions
Ensure Unique test removed 48901 transitions
Reduce isomorphic transitions removed 80919 transitions.
Graph (complete) has 8595 edges and 423 vertex of which 408 are kept as prefixes of interest. Removing 15 places using SCC suffix rule.4 ms
Discarding 15 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Drop transitions removed 23 transitions
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 42 transitions.
Iterating post reduction 0 with 42 rules applied. Total rules applied 44 place count 408 transition count 8945
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 44 place count 408 transition count 8944
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 46 place count 407 transition count 8944
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 49 place count 404 transition count 8932
Iterating global reduction 1 with 3 rules applied. Total rules applied 52 place count 404 transition count 8932
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 58 place count 404 transition count 8926
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 2 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 66 place count 400 transition count 8922
Ensure Unique test removed 73 transitions
Reduce isomorphic transitions removed 73 transitions.
Iterating post reduction 2 with 73 rules applied. Total rules applied 139 place count 400 transition count 8849
Drop transitions removed 4122 transitions
Redundant transition composition rules discarded 4122 transitions
Iterating global reduction 3 with 4122 rules applied. Total rules applied 4261 place count 400 transition count 4727
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 51 transitions
Reduce isomorphic transitions removed 51 transitions.
Graph (complete) has 5437 edges and 397 vertex of which 366 are kept as prefixes of interest. Removing 31 places using SCC suffix rule.2 ms
Discarding 31 places :
Also discarding 7 output transitions
Drop transitions removed 7 transitions
Iterating post reduction 3 with 55 rules applied. Total rules applied 4316 place count 366 transition count 4669
Drop transitions removed 445 transitions
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 457 transitions.
Iterating post reduction 4 with 457 rules applied. Total rules applied 4773 place count 366 transition count 4212
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 4773 place count 366 transition count 4211
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 4775 place count 365 transition count 4211
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 4781 place count 359 transition count 4189
Iterating global reduction 5 with 6 rules applied. Total rules applied 4787 place count 359 transition count 4189
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 4791 place count 355 transition count 4173
Iterating global reduction 5 with 4 rules applied. Total rules applied 4795 place count 355 transition count 4173
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 5 with 10 rules applied. Total rules applied 4805 place count 350 transition count 4168
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 4806 place count 350 transition count 4167
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 4808 place count 349 transition count 4180
Drop transitions removed 23 transitions
Redundant transition composition rules discarded 23 transitions
Iterating global reduction 6 with 23 rules applied. Total rules applied 4831 place count 349 transition count 4157
Free-agglomeration rule applied 18 times with reduction of 7 identical transitions.
Iterating global reduction 6 with 18 rules applied. Total rules applied 4849 place count 349 transition count 4132
Reduce places removed 18 places and 0 transitions.
Ensure Unique test removed 68 transitions
Reduce isomorphic transitions removed 68 transitions.
Iterating post reduction 6 with 86 rules applied. Total rules applied 4935 place count 331 transition count 4064
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 4937 place count 330 transition count 4073
Drop transitions removed 90 transitions
Redundant transition composition rules discarded 90 transitions
Iterating global reduction 7 with 90 rules applied. Total rules applied 5027 place count 330 transition count 3983
Free-agglomeration rule applied 9 times with reduction of 2 identical transitions.
Iterating global reduction 7 with 9 rules applied. Total rules applied 5036 place count 330 transition count 3972
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 7 with 19 rules applied. Total rules applied 5055 place count 321 transition count 3962
Drop transitions removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 8 with 19 rules applied. Total rules applied 5074 place count 321 transition count 3943
Free-agglomeration rule applied 2 times.
Iterating global reduction 8 with 2 rules applied. Total rules applied 5076 place count 321 transition count 3941
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 5078 place count 319 transition count 3941
Drop transitions removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 9 with 11 rules applied. Total rules applied 5089 place count 319 transition count 3930
Free-agglomeration rule applied 1 times.
Iterating global reduction 9 with 1 rules applied. Total rules applied 5090 place count 319 transition count 3929
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 5091 place count 318 transition count 3929
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 10 with 4 rules applied. Total rules applied 5095 place count 318 transition count 3994
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 10 with 4 rules applied. Total rules applied 5099 place count 314 transition count 3994
Drop transitions removed 38 transitions
Redundant transition composition rules discarded 38 transitions
Iterating global reduction 11 with 38 rules applied. Total rules applied 5137 place count 314 transition count 3956
Applied a total of 5137 rules in 1537 ms. Remains 314 /1296 variables (removed 982) and now considering 3956/89908 (removed 85952) transitions.
Running SMT prover for 4 properties.
[2023-03-18 01:53:51] [INFO ] Flow matrix only has 3840 transitions (discarded 116 similar events)
// Phase 1: matrix 3840 rows 314 cols
[2023-03-18 01:53:51] [INFO ] Computed 0 place invariants in 16 ms
[2023-03-18 01:53:52] [INFO ] After 1007ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-18 01:53:53] [INFO ] After 848ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-18 01:53:53] [INFO ] State equation strengthened by 18 read => feed constraints.
[2023-03-18 01:53:53] [INFO ] After 399ms SMT Verify possible using 18 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-18 01:53:54] [INFO ] After 941ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 371 ms.
[2023-03-18 01:53:54] [INFO ] After 2235ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (NOT (AND p0 p1))), (X (NOT p1)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 387 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter insensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 122 ms :[(NOT p1), p0, (AND p0 p1)]
Stuttering acceptance computed with spot in 100 ms :[(NOT p1), p0, (AND p0 p1)]
[2023-03-18 01:53:55] [INFO ] Flow matrix only has 62309 transitions (discarded 30342 similar events)
// Phase 1: matrix 62309 rows 1343 cols
[2023-03-18 01:53:55] [INFO ] Computed 12 place invariants in 218 ms
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 115 ms :[(NOT p1), p0, (AND p0 p1)]
Product exploration explored 100000 steps with 33455 reset in 5820 ms.
Product exploration explored 100000 steps with 33316 reset in 4570 ms.
Support contains 4 out of 1343 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1343/1343 places, 92651/92651 transitions.
Applied a total of 0 rules in 385 ms. Remains 1343 /1343 variables (removed 0) and now considering 92651/92651 (removed 0) transitions.
[2023-03-18 01:54:21] [INFO ] Flow matrix only has 62309 transitions (discarded 30342 similar events)
[2023-03-18 01:54:21] [INFO ] Invariant cache hit.
[2023-03-18 01:54:24] [INFO ] Implicit Places using invariants in 3372 ms returned []
Implicit Place search using SMT only with invariants took 3372 ms to find 0 implicit places.
[2023-03-18 01:54:24] [INFO ] Flow matrix only has 62309 transitions (discarded 30342 similar events)
[2023-03-18 01:54:24] [INFO ] Invariant cache hit.
[2023-03-18 01:54:55] [INFO ] Performed 90003/92651 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-18 01:54:55] [INFO ] Dead Transitions using invariants and state equation in 31104 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 34862 ms. Remains : 1343/1343 places, 92651/92651 transitions.
Treatment of property RERS2020-PT-pb107-LTLFireability-15 finished in 365211 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((!p0 U (G(!p0)||(!p0&&G(!p1))))))'
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&&X((p0&&G(F(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(G((F(p1)||G(p2)||p0))))'
Found a Lengthening insensitive property : RERS2020-PT-pb107-LTLFireability-08
Stuttering acceptance computed with spot in 163 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p1) p0 (NOT p2))]
Support contains 6 out of 1369 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1369/1369 places, 93216/93216 transitions.
Reduce places removed 1 places and 1 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 1368 transition count 93214
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 1367 transition count 93214
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 2 place count 1367 transition count 93212
Deduced a syphon composed of 2 places in 46 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 6 place count 1365 transition count 93212
Performed 17 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 17 places in 47 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 40 place count 1348 transition count 93192
Ensure Unique test removed 439 transitions
Reduce isomorphic transitions removed 439 transitions.
Iterating post reduction 2 with 439 rules applied. Total rules applied 479 place count 1348 transition count 92753
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 46 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 487 place count 1344 transition count 92749
Ensure Unique test removed 96 transitions
Reduce isomorphic transitions removed 96 transitions.
Iterating post reduction 3 with 96 rules applied. Total rules applied 583 place count 1344 transition count 92653
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 1 places in 73 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 585 place count 1343 transition count 92654
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 588 place count 1343 transition count 92651
Applied a total of 588 rules in 2614 ms. Remains 1343 /1369 variables (removed 26) and now considering 92651/93216 (removed 565) transitions.
[2023-03-18 01:55:02] [INFO ] Flow matrix only has 62309 transitions (discarded 30342 similar events)
[2023-03-18 01:55:02] [INFO ] Invariant cache hit.
[2023-03-18 01:55:05] [INFO ] Implicit Places using invariants in 3500 ms returned []
Implicit Place search using SMT only with invariants took 3501 ms to find 0 implicit places.
[2023-03-18 01:55:05] [INFO ] Flow matrix only has 62309 transitions (discarded 30342 similar events)
[2023-03-18 01:55:05] [INFO ] Invariant cache hit.
[2023-03-18 01:55:35] [INFO ] Performed 80098/92651 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-18 01:55:40] [INFO ] Dead Transitions using invariants and state equation in 34723 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 1343/1369 places, 92651/93216 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 40841 ms. Remains : 1343/1369 places, 92651/93216 transitions.
Running random walk in product with property : RERS2020-PT-pb107-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=3 dest: 2}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(OR (EQ s74 0) (EQ s780 0)), p1:(OR (EQ s132 0) (EQ s187 0)), p2:(OR (EQ s808 0) (EQ s851 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 2 reset in 5668 ms.
Product exploration explored 100000 steps with 2 reset in 5238 ms.
Computed a total of 257 stabilizing places and 30632 stable transitions
Computed a total of 257 stabilizing places and 30632 stable transitions
Detected a total of 257/1343 stabilizing places and 30632/92651 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p0 p1 p2), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X p1)), true, (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 448 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 134 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p1), (AND (NOT p1) p0 (NOT p2))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 760 ms. (steps per millisecond=13 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 6606 steps, run timeout after 3002 ms. (steps per millisecond=2 ) properties seen :{}
Probabilistic random walk after 6606 steps, saw 4902 distinct states, run finished after 3002 ms. (steps per millisecond=2 ) properties seen :0
Running SMT prover for 5 properties.
[2023-03-18 01:55:56] [INFO ] Flow matrix only has 62309 transitions (discarded 30342 similar events)
[2023-03-18 01:55:56] [INFO ] Invariant cache hit.
[2023-03-18 01:55:56] [INFO ] [Real]Absence check using 12 positive place invariants in 10 ms returned sat
[2023-03-18 01:56:21] [INFO ] After 24343ms SMT Verify possible using state equation in real domain returned unsat :0 sat :5
[2023-03-18 01:56:22] [INFO ] State equation strengthened by 3673 read => feed constraints.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:642)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:339)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLLengthAwareSolver.runSLCLLTLTest(LTLLengthAwareSolver.java:100)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:764)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-18 01:56:22] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-18 01:56:22] [INFO ] After 25579ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 5 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 93 ms.
Support contains 6 out of 1343 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1343/1343 places, 92651/92651 transitions.
Drop transitions removed 2819 transitions
Reduce isomorphic transitions removed 2819 transitions.
Iterating post reduction 0 with 2819 rules applied. Total rules applied 2819 place count 1343 transition count 89832
Free-agglomeration rule applied 32 times.
Iterating global reduction 1 with 32 rules applied. Total rules applied 2851 place count 1343 transition count 89800
Reduce places removed 32 places and 0 transitions.
Drop transitions removed 44 transitions
Ensure Unique test removed 555 transitions
Reduce isomorphic transitions removed 599 transitions.
Iterating post reduction 1 with 631 rules applied. Total rules applied 3482 place count 1311 transition count 89201
Free-agglomeration rule (complex) applied 14 times with reduction of 16 identical transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 3496 place count 1311 transition count 89849
Reduce places removed 14 places and 0 transitions.
Drop transitions removed 5 transitions
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 26 transitions.
Iterating post reduction 2 with 40 rules applied. Total rules applied 3536 place count 1297 transition count 89823
Applied a total of 3536 rules in 2249 ms. Remains 1297 /1343 variables (removed 46) and now considering 89823/92651 (removed 2828) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2254 ms. Remains : 1297/1343 places, 89823/92651 transitions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 780 ms. (steps per millisecond=12 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 6707 steps, run timeout after 3003 ms. (steps per millisecond=2 ) properties seen :{}
Probabilistic random walk after 6707 steps, saw 5119 distinct states, run finished after 3004 ms. (steps per millisecond=2 ) properties seen :0
Running SMT prover for 5 properties.
[2023-03-18 01:56:28] [INFO ] Flow matrix only has 62339 transitions (discarded 27484 similar events)
// Phase 1: matrix 62339 rows 1297 cols
[2023-03-18 01:56:29] [INFO ] Computed 12 place invariants in 256 ms
[2023-03-18 01:56:29] [INFO ] [Real]Absence check using 12 positive place invariants in 8 ms returned sat
[2023-03-18 01:56:54] [INFO ] After 24442ms SMT Verify possible using state equation in real domain returned unsat :0 sat :5
[2023-03-18 01:56:54] [INFO ] State equation strengthened by 3682 read => feed constraints.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:642)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:339)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLLengthAwareSolver.runSLCLLTLTest(LTLLengthAwareSolver.java:100)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:764)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-18 01:56:54] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-18 01:56:54] [INFO ] After 25388ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 5 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 11 ms.
Support contains 6 out of 1297 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1297/1297 places, 89823/89823 transitions.
Applied a total of 0 rules in 612 ms. Remains 1297 /1297 variables (removed 0) and now considering 89823/89823 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 612 ms. Remains : 1297/1297 places, 89823/89823 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1297/1297 places, 89823/89823 transitions.
Applied a total of 0 rules in 444 ms. Remains 1297 /1297 variables (removed 0) and now considering 89823/89823 (removed 0) transitions.
[2023-03-18 01:56:55] [INFO ] Flow matrix only has 62339 transitions (discarded 27484 similar events)
[2023-03-18 01:56:55] [INFO ] Invariant cache hit.
[2023-03-18 01:56:59] [INFO ] Implicit Places using invariants in 3487 ms returned []
Implicit Place search using SMT only with invariants took 3488 ms to find 0 implicit places.
[2023-03-18 01:56:59] [INFO ] Flow matrix only has 62339 transitions (discarded 27484 similar events)
[2023-03-18 01:56:59] [INFO ] Invariant cache hit.
[2023-03-18 01:57:28] [INFO ] Dead Transitions using invariants and state equation in 29457 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33397 ms. Remains : 1297/1297 places, 89823/89823 transitions.
Graph (trivial) has 31248 edges and 1297 vertex of which 1029 / 1297 are part of one of the 152 SCC in 4 ms
Free SCC test removed 877 places
Drop transitions removed 32540 transitions
Ensure Unique test removed 48495 transitions
Reduce isomorphic transitions removed 81035 transitions.
Graph (complete) has 8497 edges and 420 vertex of which 405 are kept as prefixes of interest. Removing 15 places using SCC suffix rule.4 ms
Discarding 15 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Drop transitions removed 23 transitions
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 42 transitions.
Iterating post reduction 0 with 42 rules applied. Total rules applied 44 place count 405 transition count 8744
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 44 place count 405 transition count 8743
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 46 place count 404 transition count 8743
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 49 place count 401 transition count 8731
Iterating global reduction 1 with 3 rules applied. Total rules applied 52 place count 401 transition count 8731
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 58 place count 401 transition count 8725
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 2 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 66 place count 397 transition count 8721
Ensure Unique test removed 73 transitions
Reduce isomorphic transitions removed 73 transitions.
Iterating post reduction 2 with 73 rules applied. Total rules applied 139 place count 397 transition count 8648
Drop transitions removed 3956 transitions
Redundant transition composition rules discarded 3956 transitions
Iterating global reduction 3 with 3956 rules applied. Total rules applied 4095 place count 397 transition count 4692
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 51 transitions
Reduce isomorphic transitions removed 51 transitions.
Graph (complete) has 5382 edges and 394 vertex of which 362 are kept as prefixes of interest. Removing 32 places using SCC suffix rule.1 ms
Discarding 32 places :
Also discarding 7 output transitions
Drop transitions removed 7 transitions
Iterating post reduction 3 with 55 rules applied. Total rules applied 4150 place count 362 transition count 4634
Drop transitions removed 447 transitions
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 459 transitions.
Iterating post reduction 4 with 459 rules applied. Total rules applied 4609 place count 362 transition count 4175
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 4609 place count 362 transition count 4174
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 4611 place count 361 transition count 4174
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 4617 place count 355 transition count 4152
Iterating global reduction 5 with 6 rules applied. Total rules applied 4623 place count 355 transition count 4152
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 4627 place count 351 transition count 4136
Iterating global reduction 5 with 4 rules applied. Total rules applied 4631 place count 351 transition count 4136
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 5 with 10 rules applied. Total rules applied 4641 place count 346 transition count 4131
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 4642 place count 346 transition count 4130
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 4644 place count 345 transition count 4143
Drop transitions removed 27 transitions
Redundant transition composition rules discarded 27 transitions
Iterating global reduction 6 with 27 rules applied. Total rules applied 4671 place count 345 transition count 4116
Free-agglomeration rule applied 19 times with reduction of 7 identical transitions.
Iterating global reduction 6 with 19 rules applied. Total rules applied 4690 place count 345 transition count 4090
Reduce places removed 19 places and 0 transitions.
Ensure Unique test removed 62 transitions
Reduce isomorphic transitions removed 62 transitions.
Iterating post reduction 6 with 81 rules applied. Total rules applied 4771 place count 326 transition count 4028
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 4773 place count 325 transition count 4037
Drop transitions removed 95 transitions
Redundant transition composition rules discarded 95 transitions
Iterating global reduction 7 with 95 rules applied. Total rules applied 4868 place count 325 transition count 3942
Free-agglomeration rule applied 10 times with reduction of 2 identical transitions.
Iterating global reduction 7 with 10 rules applied. Total rules applied 4878 place count 325 transition count 3930
Reduce places removed 10 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 7 with 20 rules applied. Total rules applied 4898 place count 315 transition count 3920
Drop transitions removed 28 transitions
Redundant transition composition rules discarded 28 transitions
Iterating global reduction 8 with 28 rules applied. Total rules applied 4926 place count 315 transition count 3892
Free-agglomeration rule applied 4 times.
Iterating global reduction 8 with 4 rules applied. Total rules applied 4930 place count 315 transition count 3888
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 8 with 4 rules applied. Total rules applied 4934 place count 311 transition count 3888
Drop transitions removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 9 with 13 rules applied. Total rules applied 4947 place count 311 transition count 3875
Free-agglomeration rule applied 1 times.
Iterating global reduction 9 with 1 rules applied. Total rules applied 4948 place count 311 transition count 3874
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 4949 place count 310 transition count 3874
Free-agglomeration rule (complex) applied 7 times with reduction of 11 identical transitions.
Iterating global reduction 10 with 7 rules applied. Total rules applied 4956 place count 310 transition count 3951
Reduce places removed 7 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 10 with 8 rules applied. Total rules applied 4964 place count 303 transition count 3950
Drop transitions removed 43 transitions
Redundant transition composition rules discarded 43 transitions
Iterating global reduction 11 with 43 rules applied. Total rules applied 5007 place count 303 transition count 3907
Applied a total of 5007 rules in 1479 ms. Remains 303 /1297 variables (removed 994) and now considering 3907/89823 (removed 85916) transitions.
Running SMT prover for 5 properties.
[2023-03-18 01:57:30] [INFO ] Flow matrix only has 3789 transitions (discarded 118 similar events)
// Phase 1: matrix 3789 rows 303 cols
[2023-03-18 01:57:30] [INFO ] Computed 0 place invariants in 25 ms
[2023-03-18 01:57:31] [INFO ] After 1041ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-18 01:57:32] [INFO ] After 967ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-18 01:57:32] [INFO ] State equation strengthened by 17 read => feed constraints.
[2023-03-18 01:57:32] [INFO ] After 556ms SMT Verify possible using 17 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-18 01:57:33] [INFO ] After 1346ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 643 ms.
[2023-03-18 01:57:34] [INFO ] After 3038ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Knowledge obtained : [(AND p0 p1 p2), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X p1)), true, (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 381 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 178 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p1), (AND (NOT p1) p0 (NOT p2))]
Stuttering acceptance computed with spot in 156 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p1), (AND (NOT p1) p0 (NOT p2))]
Support contains 6 out of 1343 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1343/1343 places, 92651/92651 transitions.
Applied a total of 0 rules in 121 ms. Remains 1343 /1343 variables (removed 0) and now considering 92651/92651 (removed 0) transitions.
[2023-03-18 01:57:35] [INFO ] Flow matrix only has 62309 transitions (discarded 30342 similar events)
// Phase 1: matrix 62309 rows 1343 cols
[2023-03-18 01:57:35] [INFO ] Computed 12 place invariants in 206 ms
[2023-03-18 01:57:38] [INFO ] Implicit Places using invariants in 3493 ms returned []
Implicit Place search using SMT only with invariants took 3495 ms to find 0 implicit places.
[2023-03-18 01:57:38] [INFO ] Flow matrix only has 62309 transitions (discarded 30342 similar events)
[2023-03-18 01:57:38] [INFO ] Invariant cache hit.
[2023-03-18 01:58:08] [INFO ] Performed 90628/92651 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-18 01:58:09] [INFO ] Dead Transitions using invariants and state equation in 30889 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 34507 ms. Remains : 1343/1343 places, 92651/92651 transitions.
Computed a total of 257 stabilizing places and 30632 stable transitions
Computed a total of 257 stabilizing places and 30632 stable transitions
Detected a total of 257/1343 stabilizing places and 30632/92651 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p0 p2 p1), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X (X p1)), true, (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X (NOT (AND p0 p2 (NOT p1))))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 414 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 151 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p1), (AND (NOT p1) p0 (NOT p2))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 709 ms. (steps per millisecond=14 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 7529 steps, run timeout after 3002 ms. (steps per millisecond=2 ) properties seen :{}
Probabilistic random walk after 7529 steps, saw 5437 distinct states, run finished after 3004 ms. (steps per millisecond=2 ) properties seen :0
Running SMT prover for 5 properties.
[2023-03-18 01:58:14] [INFO ] Flow matrix only has 62309 transitions (discarded 30342 similar events)
[2023-03-18 01:58:14] [INFO ] Invariant cache hit.
[2023-03-18 01:58:15] [INFO ] [Real]Absence check using 12 positive place invariants in 11 ms returned sat
[2023-03-18 01:58:38] [INFO ] After 23645ms SMT Verify possible using state equation in real domain returned unsat :0 sat :5
[2023-03-18 01:58:39] [INFO ] State equation strengthened by 3673 read => feed constraints.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:642)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:339)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLLengthAwareSolver.runSLCLLTLTest(LTLLengthAwareSolver.java:100)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:764)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-18 01:58:39] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-18 01:58:39] [INFO ] After 25035ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 5 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 28 ms.
Support contains 6 out of 1343 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1343/1343 places, 92651/92651 transitions.
Drop transitions removed 2819 transitions
Reduce isomorphic transitions removed 2819 transitions.
Iterating post reduction 0 with 2819 rules applied. Total rules applied 2819 place count 1343 transition count 89832
Free-agglomeration rule applied 32 times.
Iterating global reduction 1 with 32 rules applied. Total rules applied 2851 place count 1343 transition count 89800
Reduce places removed 32 places and 0 transitions.
Drop transitions removed 44 transitions
Ensure Unique test removed 555 transitions
Reduce isomorphic transitions removed 599 transitions.
Iterating post reduction 1 with 631 rules applied. Total rules applied 3482 place count 1311 transition count 89201
Free-agglomeration rule (complex) applied 14 times with reduction of 16 identical transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 3496 place count 1311 transition count 89849
Reduce places removed 14 places and 0 transitions.
Drop transitions removed 5 transitions
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 26 transitions.
Iterating post reduction 2 with 40 rules applied. Total rules applied 3536 place count 1297 transition count 89823
Applied a total of 3536 rules in 1975 ms. Remains 1297 /1343 variables (removed 46) and now considering 89823/92651 (removed 2828) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1977 ms. Remains : 1297/1343 places, 89823/92651 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 808 ms. (steps per millisecond=12 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=136 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 3 resets, run finished after 73 ms. (steps per millisecond=136 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 9308 steps, run timeout after 3002 ms. (steps per millisecond=3 ) properties seen :{}
Probabilistic random walk after 9308 steps, saw 7381 distinct states, run finished after 3002 ms. (steps per millisecond=3 ) properties seen :0
Running SMT prover for 5 properties.
[2023-03-18 01:58:46] [INFO ] Flow matrix only has 62339 transitions (discarded 27484 similar events)
// Phase 1: matrix 62339 rows 1297 cols
[2023-03-18 01:58:46] [INFO ] Computed 12 place invariants in 188 ms
[2023-03-18 01:58:46] [INFO ] [Real]Absence check using 12 positive place invariants in 9 ms returned sat
[2023-03-18 01:59:10] [INFO ] After 23373ms SMT Verify possible using state equation in real domain returned unsat :0 sat :5
[2023-03-18 01:59:10] [INFO ] State equation strengthened by 3682 read => feed constraints.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:642)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:339)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLLengthAwareSolver.runSLCLLTLTest(LTLLengthAwareSolver.java:100)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:764)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-18 01:59:11] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-18 01:59:11] [INFO ] After 25050ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 5 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 12 ms.
Support contains 6 out of 1297 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1297/1297 places, 89823/89823 transitions.
Applied a total of 0 rules in 371 ms. Remains 1297 /1297 variables (removed 0) and now considering 89823/89823 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 371 ms. Remains : 1297/1297 places, 89823/89823 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1297/1297 places, 89823/89823 transitions.
Applied a total of 0 rules in 370 ms. Remains 1297 /1297 variables (removed 0) and now considering 89823/89823 (removed 0) transitions.
[2023-03-18 01:59:12] [INFO ] Flow matrix only has 62339 transitions (discarded 27484 similar events)
[2023-03-18 01:59:12] [INFO ] Invariant cache hit.
[2023-03-18 01:59:16] [INFO ] Implicit Places using invariants in 3942 ms returned []
Implicit Place search using SMT only with invariants took 3942 ms to find 0 implicit places.
[2023-03-18 01:59:16] [INFO ] Flow matrix only has 62339 transitions (discarded 27484 similar events)
[2023-03-18 01:59:16] [INFO ] Invariant cache hit.
[2023-03-18 01:59:45] [INFO ] Dead Transitions using invariants and state equation in 29542 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33863 ms. Remains : 1297/1297 places, 89823/89823 transitions.
Graph (trivial) has 31248 edges and 1297 vertex of which 1029 / 1297 are part of one of the 152 SCC in 4 ms
Free SCC test removed 877 places
Drop transitions removed 32540 transitions
Ensure Unique test removed 48495 transitions
Reduce isomorphic transitions removed 81035 transitions.
Graph (complete) has 8497 edges and 420 vertex of which 405 are kept as prefixes of interest. Removing 15 places using SCC suffix rule.4 ms
Discarding 15 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Drop transitions removed 23 transitions
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 42 transitions.
Iterating post reduction 0 with 42 rules applied. Total rules applied 44 place count 405 transition count 8744
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 44 place count 405 transition count 8743
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 46 place count 404 transition count 8743
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 49 place count 401 transition count 8731
Iterating global reduction 1 with 3 rules applied. Total rules applied 52 place count 401 transition count 8731
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 58 place count 401 transition count 8725
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 66 place count 397 transition count 8721
Ensure Unique test removed 73 transitions
Reduce isomorphic transitions removed 73 transitions.
Iterating post reduction 2 with 73 rules applied. Total rules applied 139 place count 397 transition count 8648
Drop transitions removed 3956 transitions
Redundant transition composition rules discarded 3956 transitions
Iterating global reduction 3 with 3956 rules applied. Total rules applied 4095 place count 397 transition count 4692
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 51 transitions
Reduce isomorphic transitions removed 51 transitions.
Graph (complete) has 5382 edges and 394 vertex of which 362 are kept as prefixes of interest. Removing 32 places using SCC suffix rule.2 ms
Discarding 32 places :
Also discarding 7 output transitions
Drop transitions removed 7 transitions
Iterating post reduction 3 with 55 rules applied. Total rules applied 4150 place count 362 transition count 4634
Drop transitions removed 447 transitions
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 459 transitions.
Iterating post reduction 4 with 459 rules applied. Total rules applied 4609 place count 362 transition count 4175
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 4609 place count 362 transition count 4174
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 4611 place count 361 transition count 4174
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 4617 place count 355 transition count 4152
Iterating global reduction 5 with 6 rules applied. Total rules applied 4623 place count 355 transition count 4152
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 4627 place count 351 transition count 4136
Iterating global reduction 5 with 4 rules applied. Total rules applied 4631 place count 351 transition count 4136
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 5 with 10 rules applied. Total rules applied 4641 place count 346 transition count 4131
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 4642 place count 346 transition count 4130
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 4644 place count 345 transition count 4143
Drop transitions removed 27 transitions
Redundant transition composition rules discarded 27 transitions
Iterating global reduction 6 with 27 rules applied. Total rules applied 4671 place count 345 transition count 4116
Free-agglomeration rule applied 19 times with reduction of 7 identical transitions.
Iterating global reduction 6 with 19 rules applied. Total rules applied 4690 place count 345 transition count 4090
Reduce places removed 19 places and 0 transitions.
Ensure Unique test removed 62 transitions
Reduce isomorphic transitions removed 62 transitions.
Iterating post reduction 6 with 81 rules applied. Total rules applied 4771 place count 326 transition count 4028
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 4773 place count 325 transition count 4037
Drop transitions removed 95 transitions
Redundant transition composition rules discarded 95 transitions
Iterating global reduction 7 with 95 rules applied. Total rules applied 4868 place count 325 transition count 3942
Free-agglomeration rule applied 10 times with reduction of 2 identical transitions.
Iterating global reduction 7 with 10 rules applied. Total rules applied 4878 place count 325 transition count 3930
Reduce places removed 10 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 7 with 20 rules applied. Total rules applied 4898 place count 315 transition count 3920
Drop transitions removed 28 transitions
Redundant transition composition rules discarded 28 transitions
Iterating global reduction 8 with 28 rules applied. Total rules applied 4926 place count 315 transition count 3892
Free-agglomeration rule applied 4 times.
Iterating global reduction 8 with 4 rules applied. Total rules applied 4930 place count 315 transition count 3888
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 8 with 4 rules applied. Total rules applied 4934 place count 311 transition count 3888
Drop transitions removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 9 with 13 rules applied. Total rules applied 4947 place count 311 transition count 3875
Free-agglomeration rule applied 1 times.
Iterating global reduction 9 with 1 rules applied. Total rules applied 4948 place count 311 transition count 3874
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 4949 place count 310 transition count 3874
Free-agglomeration rule (complex) applied 7 times with reduction of 11 identical transitions.
Iterating global reduction 10 with 7 rules applied. Total rules applied 4956 place count 310 transition count 3951
Reduce places removed 7 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 10 with 8 rules applied. Total rules applied 4964 place count 303 transition count 3950
Drop transitions removed 43 transitions
Redundant transition composition rules discarded 43 transitions
Iterating global reduction 11 with 43 rules applied. Total rules applied 5007 place count 303 transition count 3907
Applied a total of 5007 rules in 1566 ms. Remains 303 /1297 variables (removed 994) and now considering 3907/89823 (removed 85916) transitions.
Running SMT prover for 5 properties.
[2023-03-18 01:59:47] [INFO ] Flow matrix only has 3789 transitions (discarded 118 similar events)
// Phase 1: matrix 3789 rows 303 cols
[2023-03-18 01:59:47] [INFO ] Computed 0 place invariants in 25 ms
[2023-03-18 01:59:48] [INFO ] After 1046ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-18 01:59:49] [INFO ] After 958ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-18 01:59:49] [INFO ] State equation strengthened by 17 read => feed constraints.
[2023-03-18 01:59:50] [INFO ] After 549ms SMT Verify possible using 17 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-18 01:59:50] [INFO ] After 1304ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 634 ms.
[2023-03-18 01:59:51] [INFO ] After 2982ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Knowledge obtained : [(AND p0 p2 p1), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X (X p1)), true, (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X (NOT (AND p0 p2 (NOT p1))))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 432 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 171 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p1), (AND (NOT p1) p0 (NOT p2))]
Stuttering acceptance computed with spot in 158 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p1), (AND (NOT p1) p0 (NOT p2))]
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 13026976 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16009548 kB
BK_TIME_CONFINEMENT_REACHED
--------------------
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
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="RERS2020-PT-pb107"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool ltsminxred"
echo " Input is RERS2020-PT-pb107, 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 r329-tall-167889201800268"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/RERS2020-PT-pb107.tgz
mv RERS2020-PT-pb107 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 ;