About the Execution of LoLa+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 |
| 10874.827 | 3600000.00 | 3911880.00 | 14412.40 | ??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.r327-tall-167889199400268.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool lolaxred
Input is RERS2020-PT-pb107, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r327-tall-167889199400268
=====================================================================
--------------------
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 1679031827331
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=lolaxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=RERS2020-PT-pb107
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-17 05:43:48] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-17 05:43:49] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-17 05:43:50] [INFO ] Load time of PNML (sax parser for PT used): 1677 ms
[2023-03-17 05:43:50] [INFO ] Transformed 1382 places.
[2023-03-17 05:43:51] [INFO ] Transformed 104643 transitions.
[2023-03-17 05:43:51] [INFO ] Found NUPN structural information;
[2023-03-17 05:43:51] [INFO ] Parsed PT model containing 1382 places and 104643 transitions and 417030 arcs in 2034 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 359 ms. Remains 1369 /1382 variables (removed 13) and now considering 93216/93216 (removed 0) transitions.
[2023-03-17 05:43:52] [INFO ] Flow matrix only has 62870 transitions (discarded 30346 similar events)
// Phase 1: matrix 62870 rows 1369 cols
[2023-03-17 05:43:52] [INFO ] Computed 12 place invariants in 394 ms
[2023-03-17 05:43:56] [INFO ] Implicit Places using invariants in 3972 ms returned []
Implicit Place search using SMT only with invariants took 3994 ms to find 0 implicit places.
[2023-03-17 05:43:56] [INFO ] Flow matrix only has 62870 transitions (discarded 30346 similar events)
[2023-03-17 05:43:56] [INFO ] Invariant cache hit.
[2023-03-17 05:44:26] [INFO ] Performed 87516/93216 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-17 05:44:28] [INFO ] Dead Transitions using invariants and state equation in 32288 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 36657 ms. Remains : 1369/1382 places, 93216/93216 transitions.
Support contains 66 out of 1369 places after structural reductions.
[2023-03-17 05:44:32] [INFO ] Flatten gal took : 2666 ms
[2023-03-17 05:44:34] [INFO ] Flatten gal took : 2274 ms
[2023-03-17 05:44:39] [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 3 resets, run finished after 968 ms. (steps per millisecond=10 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=45 ) 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 18 ms. (steps per millisecond=55 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=52 ) 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 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 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 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 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 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 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 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 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 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 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 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 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 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
Interrupted probabilistic random walk after 8385 steps, run timeout after 3003 ms. (steps per millisecond=2 ) properties seen :{}
Probabilistic random walk after 8385 steps, saw 6880 distinct states, run finished after 3004 ms. (steps per millisecond=2 ) properties seen :0
Running SMT prover for 31 properties.
[2023-03-17 05:44:44] [INFO ] Flow matrix only has 62870 transitions (discarded 30346 similar events)
[2023-03-17 05:44:44] [INFO ] Invariant cache hit.
[2023-03-17 05:44:45] [INFO ] [Real]Absence check using 12 positive place invariants in 12 ms returned sat
[2023-03-17 05:45:09] [INFO ] After 23483ms SMT Verify possible using state equation in real domain returned unsat :2 sat :29
[2023-03-17 05:45:10] [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-17 05:45:10] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-17 05:45:10] [INFO ] After 25827ms 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 1 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 51 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 56 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 118 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 49 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 4692 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 4697 ms. Remains : 1299/1369 places, 89827/93216 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 922 ms. (steps per millisecond=10 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) 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 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 1000 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 18 ms. (steps per millisecond=55 ) 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 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 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 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 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 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 18 ms. (steps per millisecond=55 ) 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 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 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 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 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 18 ms. (steps per millisecond=55 ) 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 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 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 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 16 ms. (steps per millisecond=62 ) properties (out of 29) seen :0
Interrupted probabilistic random walk after 6645 steps, run timeout after 3004 ms. (steps per millisecond=2 ) properties seen :{}
Probabilistic random walk after 6645 steps, saw 5065 distinct states, run finished after 3004 ms. (steps per millisecond=2 ) properties seen :0
Running SMT prover for 29 properties.
[2023-03-17 05:45:19] [INFO ] Flow matrix only has 62359 transitions (discarded 27468 similar events)
// Phase 1: matrix 62359 rows 1299 cols
[2023-03-17 05:45:19] [INFO ] Computed 12 place invariants in 274 ms
[2023-03-17 05:45:20] [INFO ] [Real]Absence check using 12 positive place invariants in 14 ms returned sat
[2023-03-17 05:45:44] [INFO ] After 23706ms SMT Verify possible using state equation in real domain returned unsat :0 sat :29
[2023-03-17 05:45:45] [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-17 05:45:45] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-17 05:45:45] [INFO ] After 25911ms 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 36 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 408 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 408 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 407 ms. Remains 1299 /1299 variables (removed 0) and now considering 89827/89827 (removed 0) transitions.
[2023-03-17 05:45:46] [INFO ] Flow matrix only has 62359 transitions (discarded 27468 similar events)
[2023-03-17 05:45:46] [INFO ] Invariant cache hit.
[2023-03-17 05:45:49] [INFO ] Implicit Places using invariants in 3329 ms returned []
Implicit Place search using SMT only with invariants took 3330 ms to find 0 implicit places.
[2023-03-17 05:45:49] [INFO ] Flow matrix only has 62359 transitions (discarded 27468 similar events)
[2023-03-17 05:45:49] [INFO ] Invariant cache hit.
[2023-03-17 05:46:20] [INFO ] Performed 89425/89827 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-17 05:46:20] [INFO ] Dead Transitions using invariants and state equation in 30361 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34107 ms. Remains : 1299/1299 places, 89827/89827 transitions.
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 128 ms. Remains 1369 /1369 variables (removed 0) and now considering 93216/93216 (removed 0) transitions.
[2023-03-17 05:46:20] [INFO ] Flow matrix only has 62870 transitions (discarded 30346 similar events)
// Phase 1: matrix 62870 rows 1369 cols
[2023-03-17 05:46:21] [INFO ] Computed 12 place invariants in 284 ms
[2023-03-17 05:46:24] [INFO ] Implicit Places using invariants in 3672 ms returned []
Implicit Place search using SMT only with invariants took 3673 ms to find 0 implicit places.
[2023-03-17 05:46:24] [INFO ] Flow matrix only has 62870 transitions (discarded 30346 similar events)
[2023-03-17 05:46:24] [INFO ] Invariant cache hit.
[2023-03-17 05:46:54] [INFO ] Performed 91099/93216 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-17 05:46:55] [INFO ] Dead Transitions using invariants and state equation in 30919 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 34723 ms. Remains : 1369/1369 places, 93216/93216 transitions.
Stuttering acceptance computed with spot in 275 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 3 reset in 4915 ms.
Product exploration explored 100000 steps with 0 reset in 4894 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 377 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 633 ms. (steps per millisecond=15 ) properties (out of 6) 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 6) 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 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 6) 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 6) 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 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 8191 steps, run timeout after 3001 ms. (steps per millisecond=2 ) properties seen :{}
Probabilistic random walk after 8191 steps, saw 6702 distinct states, run finished after 3001 ms. (steps per millisecond=2 ) properties seen :0
Running SMT prover for 6 properties.
[2023-03-17 05:47:11] [INFO ] Flow matrix only has 62870 transitions (discarded 30346 similar events)
[2023-03-17 05:47:11] [INFO ] Invariant cache hit.
[2023-03-17 05:47:11] [INFO ] [Real]Absence check using 12 positive place invariants in 17 ms returned sat
[2023-03-17 05:47:33] [INFO ] After 22457ms SMT Verify possible using state equation in real domain returned unsat :1 sat :4 real:1
[2023-03-17 05:47: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: 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-17 05:47:36] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-17 05:47:36] [INFO ] After 25035ms 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 51 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 51 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 50 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 4288 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 4291 ms. Remains : 1296/1369 places, 89908/93216 transitions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 638 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 85 ms. (steps per millisecond=117 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 5) 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 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
Interrupted probabilistic random walk after 7113 steps, run timeout after 3004 ms. (steps per millisecond=2 ) properties seen :{}
Probabilistic random walk after 7113 steps, saw 5461 distinct states, run finished after 3004 ms. (steps per millisecond=2 ) properties seen :0
Running SMT prover for 5 properties.
[2023-03-17 05:47:44] [INFO ] Flow matrix only has 62424 transitions (discarded 27484 similar events)
// Phase 1: matrix 62424 rows 1296 cols
[2023-03-17 05:47:44] [INFO ] Computed 12 place invariants in 256 ms
[2023-03-17 05:47:45] [INFO ] [Real]Absence check using 12 positive place invariants in 10 ms returned sat
[2023-03-17 05:48:08] [INFO ] After 22849ms SMT Verify possible using state equation in real domain returned unsat :0 sat :4 real:1
[2023-03-17 05:48:08] [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-17 05:48:09] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-17 05:48:09] [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 23 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 395 ms. Remains 1296 /1296 variables (removed 0) and now considering 89908/89908 (removed 0) transitions.
[2023-03-17 05:48:10] [INFO ] Flow matrix only has 62424 transitions (discarded 27484 similar events)
[2023-03-17 05:48:10] [INFO ] Invariant cache hit.
[2023-03-17 05:48:14] [INFO ] Implicit Places using invariants in 3738 ms returned []
Implicit Place search using SMT only with invariants took 3739 ms to find 0 implicit places.
[2023-03-17 05:48:14] [INFO ] Flow matrix only has 62424 transitions (discarded 27484 similar events)
[2023-03-17 05:48:14] [INFO ] Invariant cache hit.
[2023-03-17 05:48:44] [INFO ] Performed 88563/89908 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-17 05:48:45] [INFO ] Dead Transitions using invariants and state equation in 30618 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34762 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 7 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 3 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 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 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 1784 ms. Remains 309 /1296 variables (removed 987) and now considering 3929/89908 (removed 85979) transitions.
Running SMT prover for 5 properties.
[2023-03-17 05:48:46] [INFO ] Flow matrix only has 3814 transitions (discarded 115 similar events)
// Phase 1: matrix 3814 rows 309 cols
[2023-03-17 05:48:46] [INFO ] Computed 0 place invariants in 24 ms
[2023-03-17 05:48:47] [INFO ] After 971ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-17 05:48:48] [INFO ] After 888ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-17 05:48:48] [INFO ] State equation strengthened by 17 read => feed constraints.
[2023-03-17 05:48:49] [INFO ] After 422ms SMT Verify possible using 17 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-17 05:48:50] [INFO ] After 1148ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 433 ms.
[2023-03-17 05:48:50] [INFO ] After 2570ms 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 404 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 167 ms :[true, p0, (AND p0 p1), p0, p1]
Stuttering acceptance computed with spot in 149 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 132 ms. Remains 1369 /1369 variables (removed 0) and now considering 93216/93216 (removed 0) transitions.
[2023-03-17 05:48:51] [INFO ] Flow matrix only has 62870 transitions (discarded 30346 similar events)
// Phase 1: matrix 62870 rows 1369 cols
[2023-03-17 05:48:51] [INFO ] Computed 12 place invariants in 286 ms
[2023-03-17 05:48:55] [INFO ] Implicit Places using invariants in 3696 ms returned []
Implicit Place search using SMT only with invariants took 3698 ms to find 0 implicit places.
[2023-03-17 05:48:55] [INFO ] Flow matrix only has 62870 transitions (discarded 30346 similar events)
[2023-03-17 05:48:55] [INFO ] Invariant cache hit.
[2023-03-17 05:49:25] [INFO ] Performed 90972/93216 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-17 05:49:26] [INFO ] Dead Transitions using invariants and state equation in 30963 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 34795 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 392 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 150 ms :[true, p0, (AND p0 p1), p0, p1]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 687 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 80 ms. (steps per millisecond=125 ) 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 82 ms. (steps per millisecond=121 ) properties (out of 4) 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 4) seen :0
Interrupted probabilistic random walk after 9632 steps, run timeout after 3001 ms. (steps per millisecond=3 ) properties seen :{}
Probabilistic random walk after 9632 steps, saw 7819 distinct states, run finished after 3001 ms. (steps per millisecond=3 ) properties seen :0
Running SMT prover for 4 properties.
[2023-03-17 05:49:31] [INFO ] Flow matrix only has 62870 transitions (discarded 30346 similar events)
[2023-03-17 05:49:31] [INFO ] Invariant cache hit.
[2023-03-17 05:49:31] [INFO ] [Real]Absence check using 12 positive place invariants in 10 ms returned sat
[2023-03-17 05:49:54] [INFO ] After 22629ms SMT Verify possible using state equation in real domain returned unsat :0 sat :4
[2023-03-17 05:49:54] [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-17 05:49:56] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-17 05:49:56] [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 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 47 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 50 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 48 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 4071 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 4073 ms. Remains : 1296/1369 places, 89908/93216 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 700 ms. (steps per millisecond=14 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 96 ms. (steps per millisecond=104 ) properties (out of 4) 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 4) 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 4) 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 4) seen :0
Interrupted probabilistic random walk after 8364 steps, run timeout after 3002 ms. (steps per millisecond=2 ) properties seen :{}
Probabilistic random walk after 8364 steps, saw 6558 distinct states, run finished after 3002 ms. (steps per millisecond=2 ) properties seen :0
Running SMT prover for 4 properties.
[2023-03-17 05:50:04] [INFO ] Flow matrix only has 62424 transitions (discarded 27484 similar events)
// Phase 1: matrix 62424 rows 1296 cols
[2023-03-17 05:50:04] [INFO ] Computed 12 place invariants in 235 ms
[2023-03-17 05:50:05] [INFO ] [Real]Absence check using 12 positive place invariants in 11 ms returned sat
[2023-03-17 05:50:28] [INFO ] After 23632ms SMT Verify possible using state equation in real domain returned unsat :0 sat :4
[2023-03-17 05:50:29] [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-17 05:50:29] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-17 05:50:29] [INFO ] After 25036ms 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 18 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 403 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 403 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 406 ms. Remains 1296 /1296 variables (removed 0) and now considering 89908/89908 (removed 0) transitions.
[2023-03-17 05:50:30] [INFO ] Flow matrix only has 62424 transitions (discarded 27484 similar events)
[2023-03-17 05:50:30] [INFO ] Invariant cache hit.
[2023-03-17 05:50:34] [INFO ] Implicit Places using invariants in 3668 ms returned []
Implicit Place search using SMT only with invariants took 3668 ms to find 0 implicit places.
[2023-03-17 05:50:34] [INFO ] Flow matrix only has 62424 transitions (discarded 27484 similar events)
[2023-03-17 05:50:34] [INFO ] Invariant cache hit.
[2023-03-17 05:51:04] [INFO ] Dead Transitions using invariants and state equation in 29986 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34070 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 1542 ms. Remains 309 /1296 variables (removed 987) and now considering 3929/89908 (removed 85979) transitions.
Running SMT prover for 4 properties.
[2023-03-17 05:51:05] [INFO ] Flow matrix only has 3814 transitions (discarded 115 similar events)
// Phase 1: matrix 3814 rows 309 cols
[2023-03-17 05:51:05] [INFO ] Computed 0 place invariants in 21 ms
[2023-03-17 05:51:06] [INFO ] After 730ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-17 05:51:07] [INFO ] After 758ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-17 05:51:07] [INFO ] State equation strengthened by 17 read => feed constraints.
[2023-03-17 05:51:07] [INFO ] After 330ms SMT Verify possible using 17 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-17 05:51:08] [INFO ] After 858ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 336 ms.
[2023-03-17 05:51:08] [INFO ] After 2020ms 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 426 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 151 ms :[true, p0, (AND p0 p1), p0, p1]
Stuttering acceptance computed with spot in 150 ms :[true, p0, (AND p0 p1), p0, p1]
Stuttering acceptance computed with spot in 161 ms :[true, p0, (AND p0 p1), p0, p1]
Product exploration explored 100000 steps with 0 reset in 5320 ms.
Product exploration explored 100000 steps with 1 reset in 5020 ms.
Applying partial POR strategy [true, false, false, false, true]
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 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 49 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 48 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 47 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 48 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 50 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 2191 ms. Remains 1363 /1369 variables (removed 6) and now considering 92672/93216 (removed 544) transitions.
[2023-03-17 05:51:22] [INFO ] Flow matrix only has 62330 transitions (discarded 30342 similar events)
// Phase 1: matrix 62330 rows 1363 cols
[2023-03-17 05:51:22] [INFO ] Computed 12 place invariants in 220 ms
[2023-03-17 05:51:51] [INFO ] Dead Transitions using invariants and state equation in 28702 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 30897 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 124 ms. Remains 1369 /1369 variables (removed 0) and now considering 93216/93216 (removed 0) transitions.
[2023-03-17 05:51:51] [INFO ] Flow matrix only has 62870 transitions (discarded 30346 similar events)
// Phase 1: matrix 62870 rows 1369 cols
[2023-03-17 05:51:51] [INFO ] Computed 12 place invariants in 230 ms
[2023-03-17 05:51:55] [INFO ] Implicit Places using invariants in 3595 ms returned []
Implicit Place search using SMT only with invariants took 3596 ms to find 0 implicit places.
[2023-03-17 05:51:55] [INFO ] Flow matrix only has 62870 transitions (discarded 30346 similar events)
[2023-03-17 05:51:55] [INFO ] Invariant cache hit.
[2023-03-17 05:52:25] [INFO ] Performed 91378/93216 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-17 05:52:25] [INFO ] Dead Transitions using invariants and state equation in 30832 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 34555 ms. Remains : 1369/1369 places, 93216/93216 transitions.
Treatment of property RERS2020-PT-pb107-LTLFireability-00 finished in 368435 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 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 90 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 88 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 90 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 3132 ms. Remains 1343 /1369 variables (removed 26) and now considering 92651/93216 (removed 565) transitions.
[2023-03-17 05:52:32] [INFO ] Flow matrix only has 62309 transitions (discarded 30342 similar events)
// Phase 1: matrix 62309 rows 1343 cols
[2023-03-17 05:52:32] [INFO ] Computed 12 place invariants in 222 ms
[2023-03-17 05:52:36] [INFO ] Implicit Places using invariants in 3724 ms returned []
Implicit Place search using SMT only with invariants took 3725 ms to find 0 implicit places.
[2023-03-17 05:52:36] [INFO ] Flow matrix only has 62309 transitions (discarded 30342 similar events)
[2023-03-17 05:52:36] [INFO ] Invariant cache hit.
[2023-03-17 05:53:06] [INFO ] Performed 91265/92651 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-17 05:53:06] [INFO ] Dead Transitions using invariants and state equation in 30689 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 37551 ms. Remains : 1343/1369 places, 92651/93216 transitions.
Stuttering acceptance computed with spot in 58 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 0 reset in 4783 ms.
Product exploration explored 100000 steps with 0 reset in 4893 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 162 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 41 ms :[true, (NOT p0)]
Incomplete random walk after 10000 steps, including 4 resets, run finished after 508 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 72 ms. (steps per millisecond=138 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 8194 steps, run timeout after 3002 ms. (steps per millisecond=2 ) properties seen :{}
Probabilistic random walk after 8194 steps, saw 5824 distinct states, run finished after 3002 ms. (steps per millisecond=2 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-17 05:53:21] [INFO ] Flow matrix only has 62309 transitions (discarded 30342 similar events)
[2023-03-17 05:53:21] [INFO ] Invariant cache hit.
[2023-03-17 05:53:21] [INFO ] [Real]Absence check using 12 positive place invariants in 10 ms returned sat
[2023-03-17 05:53:41] [INFO ] After 20251ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-17 05:53:42] [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-17 05:53:46] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-17 05:53:46] [INFO ] After 25028ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 12 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 1870 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 1872 ms. Remains : 1296/1343 places, 89908/92651 transitions.
Incomplete random walk after 10000 steps, including 4 resets, run finished after 574 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 71 ms. (steps per millisecond=140 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 6800 steps, run timeout after 3001 ms. (steps per millisecond=2 ) properties seen :{}
Probabilistic random walk after 6800 steps, saw 5198 distinct states, run finished after 3001 ms. (steps per millisecond=2 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-17 05:53:51] [INFO ] Flow matrix only has 62424 transitions (discarded 27484 similar events)
// Phase 1: matrix 62424 rows 1296 cols
[2023-03-17 05:53:52] [INFO ] Computed 12 place invariants in 241 ms
[2023-03-17 05:53:52] [INFO ] [Real]Absence check using 12 positive place invariants in 10 ms returned sat
[2023-03-17 05:54:12] [INFO ] After 19869ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-17 05:54:12] [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-17 05:54:17] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-17 05:54:17] [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 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 422 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 424 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-17 05:54:17] [INFO ] Flow matrix only has 62424 transitions (discarded 27484 similar events)
[2023-03-17 05:54:17] [INFO ] Invariant cache hit.
[2023-03-17 05:54:21] [INFO ] Implicit Places using invariants in 3714 ms returned []
Implicit Place search using SMT only with invariants took 3714 ms to find 0 implicit places.
[2023-03-17 05:54:21] [INFO ] Flow matrix only has 62424 transitions (discarded 27484 similar events)
[2023-03-17 05:54:21] [INFO ] Invariant cache hit.
[2023-03-17 05:54:51] [INFO ] Dead Transitions using invariants and state equation in 29581 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33696 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 4 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 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 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 0 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 1490 ms. Remains 296 /1296 variables (removed 1000) and now considering 3833/89908 (removed 86075) transitions.
Running SMT prover for 1 properties.
[2023-03-17 05:54:52] [INFO ] Flow matrix only has 3716 transitions (discarded 117 similar events)
// Phase 1: matrix 3716 rows 296 cols
[2023-03-17 05:54:52] [INFO ] Computed 0 place invariants in 16 ms
[2023-03-17 05:54:53] [INFO ] After 604ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-17 05:54:53] [INFO ] After 543ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-17 05:54:53] [INFO ] State equation strengthened by 16 read => feed constraints.
[2023-03-17 05:54:54] [INFO ] After 84ms SMT Verify possible using 16 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-17 05:54:54] [INFO ] After 198ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 69 ms.
[2023-03-17 05:54:54] [INFO ] After 860ms 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 153 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 49 ms :[true, (NOT p0)]
Stuttering acceptance computed with spot in 40 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 383 ms. Remains 1343 /1343 variables (removed 0) and now considering 92651/92651 (removed 0) transitions.
[2023-03-17 05:54:54] [INFO ] Flow matrix only has 62309 transitions (discarded 30342 similar events)
// Phase 1: matrix 62309 rows 1343 cols
[2023-03-17 05:54:55] [INFO ] Computed 12 place invariants in 235 ms
[2023-03-17 05:54:58] [INFO ] Implicit Places using invariants in 3716 ms returned []
Implicit Place search using SMT only with invariants took 3717 ms to find 0 implicit places.
[2023-03-17 05:54:58] [INFO ] Flow matrix only has 62309 transitions (discarded 30342 similar events)
[2023-03-17 05:54:58] [INFO ] Invariant cache hit.
[2023-03-17 05:55:28] [INFO ] Performed 91506/92651 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-17 05:55:29] [INFO ] Dead Transitions using invariants and state equation in 30579 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 34681 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 129 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 35 ms :[true, (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 479 ms. (steps per millisecond=20 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 8774 steps, run timeout after 3001 ms. (steps per millisecond=2 ) properties seen :{}
Probabilistic random walk after 8774 steps, saw 6171 distinct states, run finished after 3001 ms. (steps per millisecond=2 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-17 05:55:33] [INFO ] Flow matrix only has 62309 transitions (discarded 30342 similar events)
[2023-03-17 05:55:33] [INFO ] Invariant cache hit.
[2023-03-17 05:55:33] [INFO ] [Real]Absence check using 12 positive place invariants in 8 ms returned sat
[2023-03-17 05:55:53] [INFO ] After 19679ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-17 05:55:53] [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-17 05:55:58] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-17 05:55:58] [INFO ] After 25028ms 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 1791 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 1793 ms. Remains : 1296/1343 places, 89908/92651 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 527 ms. (steps per millisecond=18 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 9369 steps, run timeout after 3003 ms. (steps per millisecond=3 ) properties seen :{}
Probabilistic random walk after 9369 steps, saw 7433 distinct states, run finished after 3003 ms. (steps per millisecond=3 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-17 05:56:04] [INFO ] Flow matrix only has 62424 transitions (discarded 27484 similar events)
// Phase 1: matrix 62424 rows 1296 cols
[2023-03-17 05:56:04] [INFO ] Computed 12 place invariants in 221 ms
[2023-03-17 05:56:04] [INFO ] [Real]Absence check using 12 positive place invariants in 9 ms returned sat
[2023-03-17 05:56:25] [INFO ] After 20409ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-17 05:56:25] [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-17 05:56:29] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-17 05:56:29] [INFO ] After 25049ms 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 408 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 408 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 414 ms. Remains 1296 /1296 variables (removed 0) and now considering 89908/89908 (removed 0) transitions.
[2023-03-17 05:56:30] [INFO ] Flow matrix only has 62424 transitions (discarded 27484 similar events)
[2023-03-17 05:56:30] [INFO ] Invariant cache hit.
[2023-03-17 05:56:33] [INFO ] Implicit Places using invariants in 3556 ms returned []
Implicit Place search using SMT only with invariants took 3556 ms to find 0 implicit places.
[2023-03-17 05:56:33] [INFO ] Flow matrix only has 62424 transitions (discarded 27484 similar events)
[2023-03-17 05:56:33] [INFO ] Invariant cache hit.
[2023-03-17 05:57:03] [INFO ] Dead Transitions using invariants and state equation in 29301 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33279 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 4 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 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.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 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 0 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 1475 ms. Remains 296 /1296 variables (removed 1000) and now considering 3833/89908 (removed 86075) transitions.
Running SMT prover for 1 properties.
[2023-03-17 05:57:04] [INFO ] Flow matrix only has 3716 transitions (discarded 117 similar events)
// Phase 1: matrix 3716 rows 296 cols
[2023-03-17 05:57:04] [INFO ] Computed 0 place invariants in 27 ms
[2023-03-17 05:57:05] [INFO ] After 582ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-17 05:57:05] [INFO ] After 527ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-17 05:57:05] [INFO ] State equation strengthened by 16 read => feed constraints.
[2023-03-17 05:57:05] [INFO ] After 81ms SMT Verify possible using 16 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-17 05:57:06] [INFO ] After 193ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 70 ms.
[2023-03-17 05:57:06] [INFO ] After 845ms 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 117 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 47 ms :[true, (NOT p0)]
Stuttering acceptance computed with spot in 36 ms :[true, (NOT p0)]
Stuttering acceptance computed with spot in 45 ms :[true, (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 4652 ms.
Product exploration explored 100000 steps with 0 reset in 4759 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 388 ms. Remains 1343 /1343 variables (removed 0) and now considering 92651/92651 (removed 0) transitions.
[2023-03-17 05:57:16] [INFO ] Flow matrix only has 62309 transitions (discarded 30342 similar events)
// Phase 1: matrix 62309 rows 1343 cols
[2023-03-17 05:57:16] [INFO ] Computed 12 place invariants in 201 ms
[2023-03-17 05:57:19] [INFO ] Implicit Places using invariants in 3588 ms returned []
Implicit Place search using SMT only with invariants took 3589 ms to find 0 implicit places.
[2023-03-17 05:57:19] [INFO ] Flow matrix only has 62309 transitions (discarded 30342 similar events)
[2023-03-17 05:57:19] [INFO ] Invariant cache hit.
[2023-03-17 05:57:50] [INFO ] Performed 92359/92651 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-17 05:57:50] [INFO ] Dead Transitions using invariants and state equation in 30310 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 34292 ms. Remains : 1343/1343 places, 92651/92651 transitions.
Treatment of property RERS2020-PT-pb107-LTLFireability-01 finished in 324075 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 151 ms. Remains 1369 /1369 variables (removed 0) and now considering 93216/93216 (removed 0) transitions.
[2023-03-17 05:57:53] [INFO ] Flow matrix only has 62870 transitions (discarded 30346 similar events)
// Phase 1: matrix 62870 rows 1369 cols
[2023-03-17 05:57:53] [INFO ] Computed 12 place invariants in 256 ms
[2023-03-17 05:57:56] [INFO ] Implicit Places using invariants in 3626 ms returned []
Implicit Place search using SMT only with invariants took 3630 ms to find 0 implicit places.
[2023-03-17 05:57:57] [INFO ] Flow matrix only has 62870 transitions (discarded 30346 similar events)
[2023-03-17 05:57:57] [INFO ] Invariant cache hit.
[2023-03-17 05:58:27] [INFO ] Performed 87197/93216 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-17 05:58:29] [INFO ] Dead Transitions using invariants and state equation in 32247 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 36031 ms. Remains : 1369/1369 places, 93216/93216 transitions.
Stuttering acceptance computed with spot in 237 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 36430 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 126 ms. Remains 1369 /1369 variables (removed 0) and now considering 93216/93216 (removed 0) transitions.
[2023-03-17 05:58:29] [INFO ] Flow matrix only has 62870 transitions (discarded 30346 similar events)
[2023-03-17 05:58:29] [INFO ] Invariant cache hit.
[2023-03-17 05:58:33] [INFO ] Implicit Places using invariants in 3431 ms returned []
Implicit Place search using SMT only with invariants took 3432 ms to find 0 implicit places.
[2023-03-17 05:58:33] [INFO ] Flow matrix only has 62870 transitions (discarded 30346 similar events)
[2023-03-17 05:58:33] [INFO ] Invariant cache hit.
[2023-03-17 05:59:03] [INFO ] Performed 91316/93216 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-17 05:59:04] [INFO ] Dead Transitions using invariants and state equation in 30862 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 34423 ms. Remains : 1369/1369 places, 93216/93216 transitions.
Stuttering acceptance computed with spot in 108 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]]
Stuttering criterion allowed to conclude after 292 steps with 0 reset in 18 ms.
FORMULA RERS2020-PT-pb107-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RERS2020-PT-pb107-LTLFireability-03 finished in 34703 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-17 05:59:04] [INFO ] Flow matrix only has 62870 transitions (discarded 30346 similar events)
[2023-03-17 05:59:04] [INFO ] Invariant cache hit.
[2023-03-17 05:59:07] [INFO ] Implicit Places using invariants in 3443 ms returned []
Implicit Place search using SMT only with invariants took 3444 ms to find 0 implicit places.
[2023-03-17 05:59:07] [INFO ] Flow matrix only has 62870 transitions (discarded 30346 similar events)
[2023-03-17 05:59:07] [INFO ] Invariant cache hit.
[2023-03-17 05:59:38] [INFO ] Performed 90505/93216 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-17 05:59:39] [INFO ] Dead Transitions using invariants and state equation in 31154 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 34731 ms. Remains : 1369/1369 places, 93216/93216 transitions.
Stuttering acceptance computed with spot in 118 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 99090 steps with 33030 reset in 10001 ms.
Product exploration explored 100000 steps with 33333 reset in 9768 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 170 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 55353 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 124 ms. Remains 1369 /1369 variables (removed 0) and now considering 93216/93216 (removed 0) transitions.
[2023-03-17 05:59:59] [INFO ] Flow matrix only has 62870 transitions (discarded 30346 similar events)
[2023-03-17 05:59:59] [INFO ] Invariant cache hit.
[2023-03-17 06:00:03] [INFO ] Implicit Places using invariants in 3417 ms returned []
Implicit Place search using SMT only with invariants took 3417 ms to find 0 implicit places.
[2023-03-17 06:00:03] [INFO ] Flow matrix only has 62870 transitions (discarded 30346 similar events)
[2023-03-17 06:00:03] [INFO ] Invariant cache hit.
[2023-03-17 06:00:33] [INFO ] Performed 91799/93216 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-17 06:00:33] [INFO ] Dead Transitions using invariants and state equation in 30685 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 34228 ms. Remains : 1369/1369 places, 93216/93216 transitions.
Stuttering acceptance computed with spot in 85 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]]
Product exploration explored 100000 steps with 0 reset in 4661 ms.
Stuttering criterion allowed to conclude after 207 steps with 0 reset in 14 ms.
FORMULA RERS2020-PT-pb107-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RERS2020-PT-pb107-LTLFireability-05 finished in 39138 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 49 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 49 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 49 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 49 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 2306 ms. Remains 1343 /1369 variables (removed 26) and now considering 92651/93216 (removed 565) transitions.
[2023-03-17 06:00:41] [INFO ] Flow matrix only has 62309 transitions (discarded 30342 similar events)
// Phase 1: matrix 62309 rows 1343 cols
[2023-03-17 06:00:41] [INFO ] Computed 12 place invariants in 231 ms
[2023-03-17 06:00:44] [INFO ] Implicit Places using invariants in 3649 ms returned []
Implicit Place search using SMT only with invariants took 3651 ms to find 0 implicit places.
[2023-03-17 06:00:44] [INFO ] Flow matrix only has 62309 transitions (discarded 30342 similar events)
[2023-03-17 06:00:44] [INFO ] Invariant cache hit.
[2023-03-17 06:01:15] [INFO ] Performed 89523/92651 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-17 06:01:16] [INFO ] Dead Transitions using invariants and state equation in 31252 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 37213 ms. Remains : 1343/1369 places, 92651/93216 transitions.
Stuttering acceptance computed with spot in 210 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 4724 ms.
Stack based approach found an accepted trace after 198 steps with 0 reset with depth 199 and stack size 199 in 15 ms.
FORMULA RERS2020-PT-pb107-LTLFireability-07 FALSE TECHNIQUES STACK_TEST
Treatment of property RERS2020-PT-pb107-LTLFireability-07 finished in 42315 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 129 ms. Remains 1369 /1369 variables (removed 0) and now considering 93216/93216 (removed 0) transitions.
[2023-03-17 06:01:21] [INFO ] Flow matrix only has 62870 transitions (discarded 30346 similar events)
// Phase 1: matrix 62870 rows 1369 cols
[2023-03-17 06:01:21] [INFO ] Computed 12 place invariants in 267 ms
[2023-03-17 06:01:24] [INFO ] Implicit Places using invariants in 3629 ms returned []
Implicit Place search using SMT only with invariants took 3630 ms to find 0 implicit places.
[2023-03-17 06:01:24] [INFO ] Flow matrix only has 62870 transitions (discarded 30346 similar events)
[2023-03-17 06:01:24] [INFO ] Invariant cache hit.
[2023-03-17 06:01:55] [INFO ] Performed 90890/93216 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-17 06:01:55] [INFO ] Dead Transitions using invariants and state equation in 31000 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 34762 ms. Remains : 1369/1369 places, 93216/93216 transitions.
Stuttering acceptance computed with spot in 157 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 0 reset in 4615 ms.
Product exploration explored 100000 steps with 0 reset in 4670 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 394 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 162 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 605 ms. (steps per millisecond=16 ) 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 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 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 65 ms. (steps per millisecond=153 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 8723 steps, run timeout after 3001 ms. (steps per millisecond=2 ) properties seen :{}
Probabilistic random walk after 8723 steps, saw 7158 distinct states, run finished after 3002 ms. (steps per millisecond=2 ) properties seen :0
Running SMT prover for 5 properties.
[2023-03-17 06:02:10] [INFO ] Flow matrix only has 62870 transitions (discarded 30346 similar events)
[2023-03-17 06:02:10] [INFO ] Invariant cache hit.
[2023-03-17 06:02:10] [INFO ] [Real]Absence check using 12 positive place invariants in 11 ms returned sat
[2023-03-17 06:02:34] [INFO ] After 23443ms SMT Verify possible using state equation in real domain returned unsat :0 sat :5
[2023-03-17 06:02: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-17 06:02:35] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-17 06:02:35] [INFO ] After 25132ms 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 47 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 47 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 47 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 47 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 3850 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 3852 ms. Remains : 1297/1369 places, 89823/93216 transitions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 622 ms. (steps per millisecond=16 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) 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 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) 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
Interrupted probabilistic random walk after 9010 steps, run timeout after 3002 ms. (steps per millisecond=3 ) properties seen :{}
Probabilistic random walk after 9010 steps, saw 7119 distinct states, run finished after 3002 ms. (steps per millisecond=3 ) properties seen :0
Running SMT prover for 5 properties.
[2023-03-17 06:02:43] [INFO ] Flow matrix only has 62339 transitions (discarded 27484 similar events)
// Phase 1: matrix 62339 rows 1297 cols
[2023-03-17 06:02:43] [INFO ] Computed 12 place invariants in 200 ms
[2023-03-17 06:02:44] [INFO ] [Real]Absence check using 12 positive place invariants in 8 ms returned sat
[2023-03-17 06:03:07] [INFO ] After 23486ms SMT Verify possible using state equation in real domain returned unsat :0 sat :5
[2023-03-17 06:03:08] [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: 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-17 06:03:08] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-17 06:03:08] [INFO ] After 25020ms 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 398 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 399 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 396 ms. Remains 1297 /1297 variables (removed 0) and now considering 89823/89823 (removed 0) transitions.
[2023-03-17 06:03:09] [INFO ] Flow matrix only has 62339 transitions (discarded 27484 similar events)
[2023-03-17 06:03:09] [INFO ] Invariant cache hit.
[2023-03-17 06:03:13] [INFO ] Implicit Places using invariants in 3603 ms returned []
Implicit Place search using SMT only with invariants took 3604 ms to find 0 implicit places.
[2023-03-17 06:03:13] [INFO ] Flow matrix only has 62339 transitions (discarded 27484 similar events)
[2023-03-17 06:03:13] [INFO ] Invariant cache hit.
[2023-03-17 06:03:42] [INFO ] Dead Transitions using invariants and state equation in 29405 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33414 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 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.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 1495 ms. Remains 303 /1297 variables (removed 994) and now considering 3907/89823 (removed 85916) transitions.
Running SMT prover for 5 properties.
[2023-03-17 06:03:44] [INFO ] Flow matrix only has 3789 transitions (discarded 118 similar events)
// Phase 1: matrix 3789 rows 303 cols
[2023-03-17 06:03:44] [INFO ] Computed 0 place invariants in 29 ms
[2023-03-17 06:03:45] [INFO ] After 1036ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-17 06:03:46] [INFO ] After 966ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-17 06:03:46] [INFO ] State equation strengthened by 17 read => feed constraints.
[2023-03-17 06:03:46] [INFO ] After 547ms SMT Verify possible using 17 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-17 06:03:47] [INFO ] After 1322ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 646 ms.
[2023-03-17 06:03:48] [INFO ] After 3015ms 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 358 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 148 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 148 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 125 ms. Remains 1369 /1369 variables (removed 0) and now considering 93216/93216 (removed 0) transitions.
[2023-03-17 06:03:49] [INFO ] Flow matrix only has 62870 transitions (discarded 30346 similar events)
// Phase 1: matrix 62870 rows 1369 cols
[2023-03-17 06:03:49] [INFO ] Computed 12 place invariants in 260 ms
[2023-03-17 06:03:52] [INFO ] Implicit Places using invariants in 3550 ms returned []
Implicit Place search using SMT only with invariants took 3553 ms to find 0 implicit places.
[2023-03-17 06:03:52] [INFO ] Flow matrix only has 62870 transitions (discarded 30346 similar events)
[2023-03-17 06:03:52] [INFO ] Invariant cache hit.
[2023-03-17 06:04:23] [INFO ] Performed 91633/93216 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-17 06:04:23] [INFO ] Dead Transitions using invariants and state equation in 30745 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 34426 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 400 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 148 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 618 ms. (steps per millisecond=16 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 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 3 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 60 ms. (steps per millisecond=166 ) properties (out of 5) 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 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
Interrupted probabilistic random walk after 9641 steps, run timeout after 3001 ms. (steps per millisecond=3 ) properties seen :{}
Probabilistic random walk after 9641 steps, saw 7824 distinct states, run finished after 3001 ms. (steps per millisecond=3 ) properties seen :0
Running SMT prover for 5 properties.
[2023-03-17 06:04:28] [INFO ] Flow matrix only has 62870 transitions (discarded 30346 similar events)
[2023-03-17 06:04:28] [INFO ] Invariant cache hit.
[2023-03-17 06:04:28] [INFO ] [Real]Absence check using 12 positive place invariants in 10 ms returned sat
[2023-03-17 06:04:52] [INFO ] After 23646ms SMT Verify possible using state equation in real domain returned unsat :0 sat :5
[2023-03-17 06:04:53] [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-17 06:04:53] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-17 06:04:53] [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 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 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 4173 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 4175 ms. Remains : 1297/1369 places, 89823/93216 transitions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 599 ms. (steps per millisecond=16 ) properties (out of 5) 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 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 80 ms. (steps per millisecond=125 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 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 10000 steps, including 3 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 8170 steps, run timeout after 3003 ms. (steps per millisecond=2 ) properties seen :{}
Probabilistic random walk after 8170 steps, saw 6392 distinct states, run finished after 3003 ms. (steps per millisecond=2 ) properties seen :0
Running SMT prover for 5 properties.
[2023-03-17 06:05:02] [INFO ] Flow matrix only has 62339 transitions (discarded 27484 similar events)
// Phase 1: matrix 62339 rows 1297 cols
[2023-03-17 06:05:02] [INFO ] Computed 12 place invariants in 210 ms
[2023-03-17 06:05:02] [INFO ] [Real]Absence check using 12 positive place invariants in 10 ms returned sat
[2023-03-17 06:05:25] [INFO ] After 23331ms SMT Verify possible using state equation in real domain returned unsat :0 sat :5
[2023-03-17 06:05:26] [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-17 06:05:27] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-17 06:05:27] [INFO ] After 25028ms 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 391 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 391 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 394 ms. Remains 1297 /1297 variables (removed 0) and now considering 89823/89823 (removed 0) transitions.
[2023-03-17 06:05:28] [INFO ] Flow matrix only has 62339 transitions (discarded 27484 similar events)
[2023-03-17 06:05:28] [INFO ] Invariant cache hit.
[2023-03-17 06:05:31] [INFO ] Implicit Places using invariants in 3484 ms returned []
Implicit Place search using SMT only with invariants took 3488 ms to find 0 implicit places.
[2023-03-17 06:05:31] [INFO ] Flow matrix only has 62339 transitions (discarded 27484 similar events)
[2023-03-17 06:05:31] [INFO ] Invariant cache hit.
[2023-03-17 06:06:00] [INFO ] Dead Transitions using invariants and state equation in 29339 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33229 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 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.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 1478 ms. Remains 303 /1297 variables (removed 994) and now considering 3907/89823 (removed 85916) transitions.
Running SMT prover for 5 properties.
[2023-03-17 06:06:02] [INFO ] Flow matrix only has 3789 transitions (discarded 118 similar events)
// Phase 1: matrix 3789 rows 303 cols
[2023-03-17 06:06:02] [INFO ] Computed 0 place invariants in 23 ms
[2023-03-17 06:06:03] [INFO ] After 1027ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-17 06:06:04] [INFO ] After 948ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-17 06:06:04] [INFO ] State equation strengthened by 17 read => feed constraints.
[2023-03-17 06:06:05] [INFO ] After 552ms SMT Verify possible using 17 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-17 06:06:05] [INFO ] After 1301ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 648 ms.
[2023-03-17 06:06:06] [INFO ] After 2976ms 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 368 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 166 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 165 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 150 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 0 reset in 4614 ms.
Product exploration explored 100000 steps with 1 reset in 4843 ms.
Applying partial POR strategy [false, true, true, true]
Stuttering acceptance computed with spot in 160 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 47 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 2000 ms. Remains 1363 /1369 variables (removed 6) and now considering 92672/93216 (removed 544) transitions.
[2023-03-17 06:06:19] [INFO ] Flow matrix only has 62330 transitions (discarded 30342 similar events)
// Phase 1: matrix 62330 rows 1363 cols
[2023-03-17 06:06:19] [INFO ] Computed 12 place invariants in 210 ms
[2023-03-17 06:06:47] [INFO ] Dead Transitions using invariants and state equation in 28705 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 30707 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-17 06:06:48] [INFO ] Flow matrix only has 62870 transitions (discarded 30346 similar events)
// Phase 1: matrix 62870 rows 1369 cols
[2023-03-17 06:06:48] [INFO ] Computed 12 place invariants in 249 ms
[2023-03-17 06:06:51] [INFO ] Implicit Places using invariants in 3676 ms returned []
Implicit Place search using SMT only with invariants took 3677 ms to find 0 implicit places.
[2023-03-17 06:06:51] [INFO ] Flow matrix only has 62870 transitions (discarded 30346 similar events)
[2023-03-17 06:06:51] [INFO ] Invariant cache hit.
[2023-03-17 06:07:21] [INFO ] Performed 91837/93216 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-17 06:07:22] [INFO ] Dead Transitions using invariants and state equation in 30675 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 34482 ms. Remains : 1369/1369 places, 93216/93216 transitions.
Treatment of property RERS2020-PT-pb107-LTLFireability-08 finished in 364243 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 126 ms. Remains 1369 /1369 variables (removed 0) and now considering 93216/93216 (removed 0) transitions.
[2023-03-17 06:07:25] [INFO ] Flow matrix only has 62870 transitions (discarded 30346 similar events)
[2023-03-17 06:07:25] [INFO ] Invariant cache hit.
[2023-03-17 06:07:28] [INFO ] Implicit Places using invariants in 3360 ms returned []
Implicit Place search using SMT only with invariants took 3361 ms to find 0 implicit places.
[2023-03-17 06:07:28] [INFO ] Flow matrix only has 62870 transitions (discarded 30346 similar events)
[2023-03-17 06:07:28] [INFO ] Invariant cache hit.
[2023-03-17 06:07:59] [INFO ] Performed 86754/93216 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-17 06:08:01] [INFO ] Dead Transitions using invariants and state equation in 32448 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 35936 ms. Remains : 1369/1369 places, 93216/93216 transitions.
Stuttering acceptance computed with spot in 192 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 0 reset in 4994 ms.
Product exploration explored 100000 steps with 0 reset in 4650 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 497 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 483 ms. (steps per millisecond=20 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 10030 steps, run timeout after 3002 ms. (steps per millisecond=3 ) properties seen :{}
Probabilistic random walk after 10030 steps, saw 8069 distinct states, run finished after 3002 ms. (steps per millisecond=3 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-17 06:08:15] [INFO ] Flow matrix only has 62870 transitions (discarded 30346 similar events)
[2023-03-17 06:08:15] [INFO ] Invariant cache hit.
[2023-03-17 06:08:16] [INFO ] [Real]Absence check using 12 positive place invariants in 12 ms returned sat
[2023-03-17 06:08:35] [INFO ] After 19349ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-17 06:08:36] [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-17 06:08:41] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-17 06:08:41] [INFO ] After 25028ms 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 44 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 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 3579 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 3582 ms. Remains : 1296/1369 places, 89908/93216 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 486 ms. (steps per millisecond=20 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 9920 steps, run timeout after 3001 ms. (steps per millisecond=3 ) properties seen :{}
Probabilistic random walk after 9920 steps, saw 7910 distinct states, run finished after 3001 ms. (steps per millisecond=3 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-17 06:08:48] [INFO ] Flow matrix only has 62424 transitions (discarded 27484 similar events)
// Phase 1: matrix 62424 rows 1296 cols
[2023-03-17 06:08:48] [INFO ] Computed 12 place invariants in 192 ms
[2023-03-17 06:08:48] [INFO ] [Real]Absence check using 12 positive place invariants in 8 ms returned sat
[2023-03-17 06:09:08] [INFO ] After 20184ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-17 06:09:09] [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-17 06:09:13] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-17 06:09:13] [INFO ] After 25040ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 11 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 339 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 339 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 375 ms. Remains 1296 /1296 variables (removed 0) and now considering 89908/89908 (removed 0) transitions.
[2023-03-17 06:09:14] [INFO ] Flow matrix only has 62424 transitions (discarded 27484 similar events)
[2023-03-17 06:09:14] [INFO ] Invariant cache hit.
[2023-03-17 06:09:17] [INFO ] Implicit Places using invariants in 3693 ms returned []
Implicit Place search using SMT only with invariants took 3694 ms to find 0 implicit places.
[2023-03-17 06:09:17] [INFO ] Flow matrix only has 62424 transitions (discarded 27484 similar events)
[2023-03-17 06:09:17] [INFO ] Invariant cache hit.
[2023-03-17 06:09:47] [INFO ] Dead Transitions using invariants and state equation in 29172 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33249 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 1 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 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 1480 ms. Remains 295 /1296 variables (removed 1001) and now considering 3758/89908 (removed 86150) transitions.
Running SMT prover for 1 properties.
[2023-03-17 06:09:48] [INFO ] Flow matrix only has 3642 transitions (discarded 116 similar events)
// Phase 1: matrix 3642 rows 295 cols
[2023-03-17 06:09:48] [INFO ] Computed 0 place invariants in 21 ms
[2023-03-17 06:09:49] [INFO ] After 586ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-17 06:09:49] [INFO ] After 519ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-17 06:09:49] [INFO ] State equation strengthened by 16 read => feed constraints.
[2023-03-17 06:09:49] [INFO ] After 78ms SMT Verify possible using 16 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-17 06:09:50] [INFO ] After 186ms 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-17 06:09:50] [INFO ] After 825ms 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 527 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 89 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 83 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 129 ms. Remains 1369 /1369 variables (removed 0) and now considering 93216/93216 (removed 0) transitions.
[2023-03-17 06:09:51] [INFO ] Flow matrix only has 62870 transitions (discarded 30346 similar events)
// Phase 1: matrix 62870 rows 1369 cols
[2023-03-17 06:09:51] [INFO ] Computed 12 place invariants in 260 ms
[2023-03-17 06:09:54] [INFO ] Implicit Places using invariants in 3729 ms returned []
Implicit Place search using SMT only with invariants took 3730 ms to find 0 implicit places.
[2023-03-17 06:09:54] [INFO ] Flow matrix only has 62870 transitions (discarded 30346 similar events)
[2023-03-17 06:09:54] [INFO ] Invariant cache hit.
[2023-03-17 06:10:24] [INFO ] Performed 91065/93216 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-17 06:10:25] [INFO ] Dead Transitions using invariants and state equation in 30937 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 34799 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 238 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 76 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 483 ms. (steps per millisecond=20 ) 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 9868 steps, run timeout after 3001 ms. (steps per millisecond=3 ) properties seen :{}
Probabilistic random walk after 9868 steps, saw 7968 distinct states, run finished after 3001 ms. (steps per millisecond=3 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-17 06:10:30] [INFO ] Flow matrix only has 62870 transitions (discarded 30346 similar events)
[2023-03-17 06:10:30] [INFO ] Invariant cache hit.
[2023-03-17 06:10:30] [INFO ] [Real]Absence check using 12 positive place invariants in 8 ms returned sat
[2023-03-17 06:10:50] [INFO ] After 19605ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-17 06:10:50] [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-17 06:10:55] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-17 06:10:55] [INFO ] After 25029ms 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 48 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 47 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 47 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 47 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 3637 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 3639 ms. Remains : 1296/1369 places, 89908/93216 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 499 ms. (steps per millisecond=20 ) properties (out of 1) 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 1) seen :0
Interrupted probabilistic random walk after 8416 steps, run timeout after 3002 ms. (steps per millisecond=2 ) properties seen :{}
Probabilistic random walk after 8416 steps, saw 6587 distinct states, run finished after 3002 ms. (steps per millisecond=2 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-17 06:11:02] [INFO ] Flow matrix only has 62424 transitions (discarded 27484 similar events)
// Phase 1: matrix 62424 rows 1296 cols
[2023-03-17 06:11:02] [INFO ] Computed 12 place invariants in 243 ms
[2023-03-17 06:11:03] [INFO ] [Real]Absence check using 12 positive place invariants in 9 ms returned sat
[2023-03-17 06:11:23] [INFO ] After 20070ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-17 06:11:23] [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-17 06:11:27] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-17 06:11:27] [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 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 342 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 342 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 341 ms. Remains 1296 /1296 variables (removed 0) and now considering 89908/89908 (removed 0) transitions.
[2023-03-17 06:11:28] [INFO ] Flow matrix only has 62424 transitions (discarded 27484 similar events)
[2023-03-17 06:11:28] [INFO ] Invariant cache hit.
[2023-03-17 06:11:32] [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-17 06:11:32] [INFO ] Flow matrix only has 62424 transitions (discarded 27484 similar events)
[2023-03-17 06:11:32] [INFO ] Invariant cache hit.
[2023-03-17 06:12:02] [INFO ] Dead Transitions using invariants and state equation in 30000 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33948 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.3 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.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 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 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 1475 ms. Remains 295 /1296 variables (removed 1001) and now considering 3758/89908 (removed 86150) transitions.
Running SMT prover for 1 properties.
[2023-03-17 06:12:03] [INFO ] Flow matrix only has 3642 transitions (discarded 116 similar events)
// Phase 1: matrix 3642 rows 295 cols
[2023-03-17 06:12:03] [INFO ] Computed 0 place invariants in 21 ms
[2023-03-17 06:12:04] [INFO ] After 591ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-17 06:12:04] [INFO ] After 519ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-17 06:12:04] [INFO ] State equation strengthened by 16 read => feed constraints.
[2023-03-17 06:12:04] [INFO ] After 82ms SMT Verify possible using 16 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-17 06:12:05] [INFO ] After 194ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 67 ms.
[2023-03-17 06:12:05] [INFO ] After 835ms 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 166 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 93 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 85 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 82 ms :[true, (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 4820 ms.
Product exploration explored 100000 steps with 0 reset in 4873 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 87 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 48 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 48 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 47 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 48 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 48 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 48 ms
Applied a total of 575 rules in 2049 ms. Remains 1363 /1369 variables (removed 6) and now considering 92672/93216 (removed 544) transitions.
[2023-03-17 06:12:17] [INFO ] Flow matrix only has 62330 transitions (discarded 30342 similar events)
// Phase 1: matrix 62330 rows 1363 cols
[2023-03-17 06:12:17] [INFO ] Computed 12 place invariants in 237 ms
[2023-03-17 06:12:46] [INFO ] Dead Transitions using invariants and state equation in 29329 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 31387 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 171 ms. Remains 1369 /1369 variables (removed 0) and now considering 93216/93216 (removed 0) transitions.
[2023-03-17 06:12:47] [INFO ] Flow matrix only has 62870 transitions (discarded 30346 similar events)
// Phase 1: matrix 62870 rows 1369 cols
[2023-03-17 06:12:47] [INFO ] Computed 12 place invariants in 266 ms
[2023-03-17 06:12:50] [INFO ] Implicit Places using invariants in 3635 ms returned []
Implicit Place search using SMT only with invariants took 3635 ms to find 0 implicit places.
[2023-03-17 06:12:50] [INFO ] Flow matrix only has 62870 transitions (discarded 30346 similar events)
[2023-03-17 06:12:50] [INFO ] Invariant cache hit.
[2023-03-17 06:13:21] [INFO ] Performed 89619/93216 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-17 06:13:22] [INFO ] Dead Transitions using invariants and state equation in 31402 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 35212 ms. Remains : 1369/1369 places, 93216/93216 transitions.
Treatment of property RERS2020-PT-pb107-LTLFireability-09 finished in 359874 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 266 ms. Remains 1369 /1369 variables (removed 0) and now considering 93216/93216 (removed 0) transitions.
[2023-03-17 06:13:25] [INFO ] Flow matrix only has 62870 transitions (discarded 30346 similar events)
[2023-03-17 06:13:25] [INFO ] Invariant cache hit.
[2023-03-17 06:13:29] [INFO ] Implicit Places using invariants in 3559 ms returned []
Implicit Place search using SMT only with invariants took 3560 ms to find 0 implicit places.
[2023-03-17 06:13:29] [INFO ] Flow matrix only has 62870 transitions (discarded 30346 similar events)
[2023-03-17 06:13:29] [INFO ] Invariant cache hit.
[2023-03-17 06:13:59] [INFO ] Performed 91120/93216 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-17 06:14:00] [INFO ] Dead Transitions using invariants and state equation in 30934 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 34763 ms. Remains : 1369/1369 places, 93216/93216 transitions.
Stuttering acceptance computed with spot in 183 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 explored 100000 steps with 25018 reset in 8412 ms.
Product exploration explored 100000 steps with 25061 reset in 8378 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 572 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 126 ms :[(NOT p1), (NOT p1), true, (AND p1 p0)]
Incomplete random walk after 10000 steps, including 3 resets, run finished after 662 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 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 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 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 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 73 ms. (steps per millisecond=137 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 9475 steps, run timeout after 3003 ms. (steps per millisecond=3 ) properties seen :{}
Probabilistic random walk after 9475 steps, saw 7726 distinct states, run finished after 3003 ms. (steps per millisecond=3 ) properties seen :0
Running SMT prover for 5 properties.
[2023-03-17 06:14:22] [INFO ] Flow matrix only has 62870 transitions (discarded 30346 similar events)
[2023-03-17 06:14:22] [INFO ] Invariant cache hit.
[2023-03-17 06:14:22] [INFO ] [Real]Absence check using 12 positive place invariants in 11 ms returned sat
[2023-03-17 06:14:44] [INFO ] After 21799ms SMT Verify possible using state equation in real domain returned unsat :0 sat :3 real:2
[2023-03-17 06:14:45] [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-17 06:14:47] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-17 06:14:47] [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 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 50 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 50 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 49 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 50 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 4235 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 4237 ms. Remains : 1296/1369 places, 89908/93216 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 744 ms. (steps per millisecond=13 ) 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 4 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 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 89 ms. (steps per millisecond=112 ) properties (out of 5) 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 5) seen :0
Interrupted probabilistic random walk after 6282 steps, run timeout after 3003 ms. (steps per millisecond=2 ) properties seen :{}
Probabilistic random walk after 6282 steps, saw 4739 distinct states, run finished after 3004 ms. (steps per millisecond=2 ) properties seen :0
Running SMT prover for 5 properties.
[2023-03-17 06:14:56] [INFO ] Flow matrix only has 62424 transitions (discarded 27484 similar events)
// Phase 1: matrix 62424 rows 1296 cols
[2023-03-17 06:14:56] [INFO ] Computed 12 place invariants in 247 ms
[2023-03-17 06:14:56] [INFO ] [Real]Absence check using 12 positive place invariants in 11 ms returned sat
[2023-03-17 06:15:19] [INFO ] After 22913ms SMT Verify possible using state equation in real domain returned unsat :0 sat :3 real:2
[2023-03-17 06:15:19] [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-17 06:15:21] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-17 06:15:21] [INFO ] After 25029ms 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 15 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 402 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 402 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 419 ms. Remains 1296 /1296 variables (removed 0) and now considering 89908/89908 (removed 0) transitions.
[2023-03-17 06:15:22] [INFO ] Flow matrix only has 62424 transitions (discarded 27484 similar events)
[2023-03-17 06:15:22] [INFO ] Invariant cache hit.
[2023-03-17 06:15:25] [INFO ] Implicit Places using invariants in 3661 ms returned []
Implicit Place search using SMT only with invariants took 3662 ms to find 0 implicit places.
[2023-03-17 06:15:25] [INFO ] Flow matrix only has 62424 transitions (discarded 27484 similar events)
[2023-03-17 06:15:25] [INFO ] Invariant cache hit.
[2023-03-17 06:15:55] [INFO ] Dead Transitions using invariants and state equation in 29677 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33765 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 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 2 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 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 1533 ms. Remains 305 /1296 variables (removed 991) and now considering 3876/89908 (removed 86032) transitions.
Running SMT prover for 5 properties.
[2023-03-17 06:15:57] [INFO ] Flow matrix only has 3765 transitions (discarded 111 similar events)
// Phase 1: matrix 3765 rows 305 cols
[2023-03-17 06:15:57] [INFO ] Computed 0 place invariants in 19 ms
[2023-03-17 06:15:57] [INFO ] After 787ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-17 06:15:58] [INFO ] After 809ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-17 06:15:58] [INFO ] State equation strengthened by 16 read => feed constraints.
[2023-03-17 06:15:59] [INFO ] After 347ms SMT Verify possible using 16 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-17 06:15:59] [INFO ] After 912ms 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-17 06:16:00] [INFO ] After 2136ms 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 532 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 131 ms :[(NOT p1), (NOT p1), true, (AND p1 p0)]
Stuttering acceptance computed with spot in 129 ms :[(NOT p1), (NOT p1), true, (AND p1 p0)]
[2023-03-17 06:16:00] [INFO ] Flow matrix only has 62870 transitions (discarded 30346 similar events)
// Phase 1: matrix 62870 rows 1369 cols
[2023-03-17 06:16:01] [INFO ] Computed 12 place invariants in 274 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 47 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 48 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 2028 ms. Remains 1343 /1369 variables (removed 26) and now considering 92651/93216 (removed 565) transitions.
[2023-03-17 06:16:18] [INFO ] Flow matrix only has 62309 transitions (discarded 30342 similar events)
// Phase 1: matrix 62309 rows 1343 cols
[2023-03-17 06:16:18] [INFO ] Computed 12 place invariants in 241 ms
[2023-03-17 06:16:22] [INFO ] Implicit Places using invariants in 3771 ms returned []
Implicit Place search using SMT only with invariants took 3773 ms to find 0 implicit places.
[2023-03-17 06:16:22] [INFO ] Flow matrix only has 62309 transitions (discarded 30342 similar events)
[2023-03-17 06:16:22] [INFO ] Invariant cache hit.
[2023-03-17 06:16:52] [INFO ] Performed 89252/92651 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-17 06:16:53] [INFO ] Dead Transitions using invariants and state equation in 31360 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 37165 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 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 143 ms :[(NOT p1), (NOT p1), true, (AND p1 p0)]
Incomplete random walk after 10000 steps, including 6 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 78 ms. (steps per millisecond=128 ) 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 4 resets, run finished after 86 ms. (steps per millisecond=116 ) 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 74 ms. (steps per millisecond=135 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 7558 steps, run timeout after 3001 ms. (steps per millisecond=2 ) properties seen :{}
Probabilistic random walk after 7558 steps, saw 5461 distinct states, run finished after 3001 ms. (steps per millisecond=2 ) properties seen :0
Running SMT prover for 5 properties.
[2023-03-17 06:16:59] [INFO ] Flow matrix only has 62309 transitions (discarded 30342 similar events)
[2023-03-17 06:16:59] [INFO ] Invariant cache hit.
[2023-03-17 06:16:59] [INFO ] [Real]Absence check using 12 positive place invariants in 11 ms returned sat
[2023-03-17 06:17:21] [INFO ] After 22506ms SMT Verify possible using state equation in real domain returned unsat :0 sat :3 real:2
[2023-03-17 06:17: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: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-17 06:17:24] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-17 06:17:24] [INFO ] After 25027ms 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 20 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 1811 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 1813 ms. Remains : 1296/1343 places, 89908/92651 transitions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 604 ms. (steps per millisecond=16 ) properties (out of 5) 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 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 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 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 72 ms. (steps per millisecond=138 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 8538 steps, run timeout after 3001 ms. (steps per millisecond=2 ) properties seen :{}
Probabilistic random walk after 8538 steps, saw 6689 distinct states, run finished after 3001 ms. (steps per millisecond=2 ) properties seen :0
Running SMT prover for 5 properties.
[2023-03-17 06:17:30] [INFO ] Flow matrix only has 62424 transitions (discarded 27484 similar events)
// Phase 1: matrix 62424 rows 1296 cols
[2023-03-17 06:17:30] [INFO ] Computed 12 place invariants in 213 ms
[2023-03-17 06:17:30] [INFO ] [Real]Absence check using 12 positive place invariants in 11 ms returned sat
[2023-03-17 06:17:54] [INFO ] After 23782ms SMT Verify possible using state equation in real domain returned unsat :0 sat :3 real:2
[2023-03-17 06:17:54] [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-17 06:17:55] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-17 06:17:55] [INFO ] After 25035ms 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 18 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 406 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 406 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 407 ms. Remains 1296 /1296 variables (removed 0) and now considering 89908/89908 (removed 0) transitions.
[2023-03-17 06:17:56] [INFO ] Flow matrix only has 62424 transitions (discarded 27484 similar events)
[2023-03-17 06:17:56] [INFO ] Invariant cache hit.
[2023-03-17 06:18:00] [INFO ] Implicit Places using invariants in 3936 ms returned []
Implicit Place search using SMT only with invariants took 3936 ms to find 0 implicit places.
[2023-03-17 06:18:00] [INFO ] Flow matrix only has 62424 transitions (discarded 27484 similar events)
[2023-03-17 06:18:00] [INFO ] Invariant cache hit.
[2023-03-17 06:18:29] [INFO ] Dead Transitions using invariants and state equation in 28946 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33296 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 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.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 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 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 1481 ms. Remains 305 /1296 variables (removed 991) and now considering 3876/89908 (removed 86032) transitions.
Running SMT prover for 5 properties.
[2023-03-17 06:18:30] [INFO ] Flow matrix only has 3765 transitions (discarded 111 similar events)
// Phase 1: matrix 3765 rows 305 cols
[2023-03-17 06:18:30] [INFO ] Computed 0 place invariants in 15 ms
[2023-03-17 06:18:31] [INFO ] After 768ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-17 06:18:32] [INFO ] After 796ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-17 06:18:32] [INFO ] State equation strengthened by 16 read => feed constraints.
[2023-03-17 06:18:32] [INFO ] After 333ms SMT Verify possible using 16 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-17 06:18:33] [INFO ] After 877ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 323 ms.
[2023-03-17 06:18:33] [INFO ] After 2075ms 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 478 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 104 ms :[(NOT p1), (NOT p1), true, (AND p1 p0)]
Stuttering acceptance computed with spot in 117 ms :[(NOT p1), (NOT p1), true, (AND p1 p0)]
[2023-03-17 06:18:34] [INFO ] Flow matrix only has 62309 transitions (discarded 30342 similar events)
// Phase 1: matrix 62309 rows 1343 cols
[2023-03-17 06:18:34] [INFO ] Computed 12 place invariants in 225 ms
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 115 ms :[(NOT p1), (NOT p1), true, (AND p1 p0)]
Product exploration explored 100000 steps with 33265 reset in 4188 ms.
Product exploration explored 100000 steps with 33422 reset in 4220 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 379 ms. Remains 1343 /1343 variables (removed 0) and now considering 92651/92651 (removed 0) transitions.
[2023-03-17 06:18:58] [INFO ] Flow matrix only has 62309 transitions (discarded 30342 similar events)
[2023-03-17 06:18:58] [INFO ] Invariant cache hit.
[2023-03-17 06:19:02] [INFO ] Implicit Places using invariants in 3259 ms returned []
Implicit Place search using SMT only with invariants took 3260 ms to find 0 implicit places.
[2023-03-17 06:19:02] [INFO ] Flow matrix only has 62309 transitions (discarded 30342 similar events)
[2023-03-17 06:19:02] [INFO ] Invariant cache hit.
[2023-03-17 06:19:32] [INFO ] Performed 92592/92651 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-17 06:19:32] [INFO ] Dead Transitions using invariants and state equation in 30241 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 33883 ms. Remains : 1343/1343 places, 92651/92651 transitions.
Treatment of property RERS2020-PT-pb107-LTLFireability-10 finished in 369890 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 49 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 109 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 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 2369 ms. Remains 1343 /1369 variables (removed 26) and now considering 92651/93216 (removed 565) transitions.
[2023-03-17 06:19:37] [INFO ] Flow matrix only has 62309 transitions (discarded 30342 similar events)
[2023-03-17 06:19:37] [INFO ] Invariant cache hit.
[2023-03-17 06:19:40] [INFO ] Implicit Places using invariants in 3383 ms returned []
Implicit Place search using SMT only with invariants took 3384 ms to find 0 implicit places.
[2023-03-17 06:19:40] [INFO ] Flow matrix only has 62309 transitions (discarded 30342 similar events)
[2023-03-17 06:19:40] [INFO ] Invariant cache hit.
[2023-03-17 06:20:11] [INFO ] Performed 91632/92651 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-17 06:20:11] [INFO ] Dead Transitions using invariants and state equation in 30548 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 36303 ms. Remains : 1343/1369 places, 92651/93216 transitions.
Stuttering acceptance computed with spot in 37 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 4922 ms.
Product exploration explored 100000 steps with 0 reset in 4753 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 204 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 45 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 528 ms. (steps per millisecond=18 ) 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 7111 steps, run timeout after 3001 ms. (steps per millisecond=2 ) properties seen :{}
Probabilistic random walk after 7111 steps, saw 5217 distinct states, run finished after 3001 ms. (steps per millisecond=2 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-17 06:20:25] [INFO ] Flow matrix only has 62309 transitions (discarded 30342 similar events)
[2023-03-17 06:20:25] [INFO ] Invariant cache hit.
[2023-03-17 06:20:25] [INFO ] [Real]Absence check using 12 positive place invariants in 10 ms returned sat
[2023-03-17 06:20:45] [INFO ] After 19646ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-17 06:20:46] [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-17 06:20:50] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-17 06:20:50] [INFO ] After 25034ms 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 1914 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 1916 ms. Remains : 1296/1343 places, 89908/92651 transitions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 594 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 64 ms. (steps per millisecond=156 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 6882 steps, run timeout after 3002 ms. (steps per millisecond=2 ) properties seen :{}
Probabilistic random walk after 6882 steps, saw 5263 distinct states, run finished after 3002 ms. (steps per millisecond=2 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-17 06:20:56] [INFO ] Flow matrix only has 62424 transitions (discarded 27484 similar events)
// Phase 1: matrix 62424 rows 1296 cols
[2023-03-17 06:20:56] [INFO ] Computed 12 place invariants in 229 ms
[2023-03-17 06:20:56] [INFO ] [Real]Absence check using 12 positive place invariants in 9 ms returned sat
[2023-03-17 06:21:17] [INFO ] After 20264ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-17 06:21:17] [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-17 06:21:21] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-17 06:21:21] [INFO ] After 25029ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 16 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 387 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 387 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 389 ms. Remains 1296 /1296 variables (removed 0) and now considering 89908/89908 (removed 0) transitions.
[2023-03-17 06:21:22] [INFO ] Flow matrix only has 62424 transitions (discarded 27484 similar events)
[2023-03-17 06:21:22] [INFO ] Invariant cache hit.
[2023-03-17 06:21:25] [INFO ] Implicit Places using invariants in 3421 ms returned []
Implicit Place search using SMT only with invariants took 3421 ms to find 0 implicit places.
[2023-03-17 06:21:26] [INFO ] Flow matrix only has 62424 transitions (discarded 27484 similar events)
[2023-03-17 06:21:26] [INFO ] Invariant cache hit.
[2023-03-17 06:21:55] [INFO ] Dead Transitions using invariants and state equation in 29253 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33070 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 5 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 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 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.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 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 21 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 1492 ms. Remains 296 /1296 variables (removed 1000) and now considering 3809/89908 (removed 86099) transitions.
Running SMT prover for 1 properties.
[2023-03-17 06:21:56] [INFO ] Flow matrix only has 3693 transitions (discarded 116 similar events)
// Phase 1: matrix 3693 rows 296 cols
[2023-03-17 06:21:56] [INFO ] Computed 0 place invariants in 27 ms
[2023-03-17 06:21:57] [INFO ] After 574ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-17 06:21:57] [INFO ] After 516ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-17 06:21:57] [INFO ] State equation strengthened by 16 read => feed constraints.
[2023-03-17 06:21:58] [INFO ] After 83ms SMT Verify possible using 16 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-17 06:21:58] [INFO ] After 201ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 73 ms.
[2023-03-17 06:21:58] [INFO ] After 838ms 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 103 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 31 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 390 ms. Remains 1343 /1343 variables (removed 0) and now considering 92651/92651 (removed 0) transitions.
[2023-03-17 06:21:58] [INFO ] Flow matrix only has 62309 transitions (discarded 30342 similar events)
// Phase 1: matrix 62309 rows 1343 cols
[2023-03-17 06:21:59] [INFO ] Computed 12 place invariants in 224 ms
[2023-03-17 06:22:02] [INFO ] Implicit Places using invariants in 3546 ms returned []
Implicit Place search using SMT only with invariants took 3548 ms to find 0 implicit places.
[2023-03-17 06:22:02] [INFO ] Flow matrix only has 62309 transitions (discarded 30342 similar events)
[2023-03-17 06:22:02] [INFO ] Invariant cache hit.
[2023-03-17 06:22:32] [INFO ] Dead Transitions using invariants and state equation in 30171 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 34110 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 121 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 28 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 492 ms. (steps per millisecond=20 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 6704 steps, run timeout after 3001 ms. (steps per millisecond=2 ) properties seen :{}
Probabilistic random walk after 6704 steps, saw 4960 distinct states, run finished after 3001 ms. (steps per millisecond=2 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-17 06:22:36] [INFO ] Flow matrix only has 62309 transitions (discarded 30342 similar events)
[2023-03-17 06:22:36] [INFO ] Invariant cache hit.
[2023-03-17 06:22:37] [INFO ] [Real]Absence check using 12 positive place invariants in 11 ms returned sat
[2023-03-17 06:22:57] [INFO ] After 20130ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-17 06:22:57] [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.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-17 06:23:02] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-17 06:23:02] [INFO ] After 25024ms 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 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 1830 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 1832 ms. Remains : 1296/1343 places, 89908/92651 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 492 ms. (steps per millisecond=20 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 9867 steps, run timeout after 3003 ms. (steps per millisecond=3 ) properties seen :{}
Probabilistic random walk after 9867 steps, saw 7865 distinct states, run finished after 3003 ms. (steps per millisecond=3 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-17 06:23:07] [INFO ] Flow matrix only has 62424 transitions (discarded 27484 similar events)
// Phase 1: matrix 62424 rows 1296 cols
[2023-03-17 06:23:07] [INFO ] Computed 12 place invariants in 232 ms
[2023-03-17 06:23:07] [INFO ] [Real]Absence check using 12 positive place invariants in 9 ms returned sat
[2023-03-17 06:23:27] [INFO ] After 19769ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-17 06:23:28] [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-17 06:23:32] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-17 06:23:32] [INFO ] After 25023ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 16 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 391 ms. Remains 1296 /1296 variables (removed 0) and now considering 89908/89908 (removed 0) transitions.
[2023-03-17 06:23:33] [INFO ] Flow matrix only has 62424 transitions (discarded 27484 similar events)
[2023-03-17 06:23:33] [INFO ] Invariant cache hit.
[2023-03-17 06:23:37] [INFO ] Implicit Places using invariants in 3540 ms returned []
Implicit Place search using SMT only with invariants took 3540 ms to find 0 implicit places.
[2023-03-17 06:23:37] [INFO ] Flow matrix only has 62424 transitions (discarded 27484 similar events)
[2023-03-17 06:23:37] [INFO ] Invariant cache hit.
[2023-03-17 06:24:06] [INFO ] Dead Transitions using invariants and state equation in 29084 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33022 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 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 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 0 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 1493 ms. Remains 296 /1296 variables (removed 1000) and now considering 3809/89908 (removed 86099) transitions.
Running SMT prover for 1 properties.
[2023-03-17 06:24:07] [INFO ] Flow matrix only has 3693 transitions (discarded 116 similar events)
// Phase 1: matrix 3693 rows 296 cols
[2023-03-17 06:24:07] [INFO ] Computed 0 place invariants in 26 ms
[2023-03-17 06:24:08] [INFO ] After 584ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-17 06:24:08] [INFO ] After 507ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-17 06:24:08] [INFO ] State equation strengthened by 16 read => feed constraints.
[2023-03-17 06:24:09] [INFO ] After 82ms SMT Verify possible using 16 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-17 06:24:09] [INFO ] After 194ms 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-17 06:24:09] [INFO ] After 825ms 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 188 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 26 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Product exploration explored 100000 steps with 1 reset in 4602 ms.
Product exploration explored 100000 steps with 0 reset in 4691 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 385 ms. Remains 1343 /1343 variables (removed 0) and now considering 92651/92651 (removed 0) transitions.
[2023-03-17 06:24:19] [INFO ] Flow matrix only has 62309 transitions (discarded 30342 similar events)
// Phase 1: matrix 62309 rows 1343 cols
[2023-03-17 06:24:19] [INFO ] Computed 12 place invariants in 214 ms
[2023-03-17 06:24:22] [INFO ] Implicit Places using invariants in 3529 ms returned []
Implicit Place search using SMT only with invariants took 3530 ms to find 0 implicit places.
[2023-03-17 06:24:22] [INFO ] Flow matrix only has 62309 transitions (discarded 30342 similar events)
[2023-03-17 06:24:22] [INFO ] Invariant cache hit.
[2023-03-17 06:24:53] [INFO ] Performed 89898/92651 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-17 06:24:53] [INFO ] Dead Transitions using invariants and state equation in 31189 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 35106 ms. Remains : 1343/1343 places, 92651/92651 transitions.
Treatment of property RERS2020-PT-pb107-LTLFireability-11 finished in 321880 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 132 ms. Remains 1369 /1369 variables (removed 0) and now considering 93216/93216 (removed 0) transitions.
[2023-03-17 06:24:57] [INFO ] Flow matrix only has 62870 transitions (discarded 30346 similar events)
// Phase 1: matrix 62870 rows 1369 cols
[2023-03-17 06:24:57] [INFO ] Computed 12 place invariants in 395 ms
[2023-03-17 06:25:01] [INFO ] Implicit Places using invariants in 4087 ms returned []
Implicit Place search using SMT only with invariants took 4088 ms to find 0 implicit places.
[2023-03-17 06:25:01] [INFO ] Flow matrix only has 62870 transitions (discarded 30346 similar events)
[2023-03-17 06:25:01] [INFO ] Invariant cache hit.
[2023-03-17 06:25:31] [INFO ] Performed 88969/93216 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-17 06:25:32] [INFO ] Dead Transitions using invariants and state equation in 31661 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 35884 ms. Remains : 1369/1369 places, 93216/93216 transitions.
Stuttering acceptance computed with spot in 114 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 1 reset in 5049 ms.
Product exploration explored 100000 steps with 1 reset in 4705 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 339 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 75 ms :[true, (NOT p1), (NOT p1)]
Incomplete random walk after 10000 steps, including 3 resets, run finished after 549 ms. (steps per millisecond=18 ) properties (out of 1) 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 1) seen :0
Interrupted probabilistic random walk after 8958 steps, run timeout after 3002 ms. (steps per millisecond=2 ) properties seen :{}
Probabilistic random walk after 8958 steps, saw 7349 distinct states, run finished after 3004 ms. (steps per millisecond=2 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-17 06:25:47] [INFO ] Flow matrix only has 62870 transitions (discarded 30346 similar events)
[2023-03-17 06:25:47] [INFO ] Invariant cache hit.
[2023-03-17 06:25:47] [INFO ] [Real]Absence check using 12 positive place invariants in 11 ms returned sat
[2023-03-17 06:26:07] [INFO ] After 19608ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-17 06:26:07] [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-17 06:26:12] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-17 06:26:12] [INFO ] After 25035ms 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 46 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 47 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 47 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 47 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 3687 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 3689 ms. Remains : 1296/1369 places, 89908/93216 transitions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 497 ms. (steps per millisecond=20 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 9360 steps, run timeout after 3001 ms. (steps per millisecond=3 ) properties seen :{}
Probabilistic random walk after 9360 steps, saw 7425 distinct states, run finished after 3002 ms. (steps per millisecond=3 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-17 06:26:20] [INFO ] Flow matrix only has 62424 transitions (discarded 27484 similar events)
// Phase 1: matrix 62424 rows 1296 cols
[2023-03-17 06:26:20] [INFO ] Computed 12 place invariants in 224 ms
[2023-03-17 06:26:20] [INFO ] [Real]Absence check using 12 positive place invariants in 11 ms returned sat
[2023-03-17 06:26:40] [INFO ] After 20070ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-17 06:26:40] [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-17 06:26:45] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-17 06:26:45] [INFO ] After 25025ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 12 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 337 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 337 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 338 ms. Remains 1296 /1296 variables (removed 0) and now considering 89908/89908 (removed 0) transitions.
[2023-03-17 06:26:45] [INFO ] Flow matrix only has 62424 transitions (discarded 27484 similar events)
[2023-03-17 06:26:45] [INFO ] Invariant cache hit.
[2023-03-17 06:26:49] [INFO ] Implicit Places using invariants in 3635 ms returned []
Implicit Place search using SMT only with invariants took 3636 ms to find 0 implicit places.
[2023-03-17 06:26:49] [INFO ] Flow matrix only has 62424 transitions (discarded 27484 similar events)
[2023-03-17 06:26:49] [INFO ] Invariant cache hit.
[2023-03-17 06:27:19] [INFO ] Dead Transitions using invariants and state equation in 29700 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33683 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 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 0 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 1505 ms. Remains 302 /1296 variables (removed 994) and now considering 3813/89908 (removed 86095) transitions.
Running SMT prover for 1 properties.
[2023-03-17 06:27:20] [INFO ] Flow matrix only has 3695 transitions (discarded 118 similar events)
// Phase 1: matrix 3695 rows 302 cols
[2023-03-17 06:27:20] [INFO ] Computed 0 place invariants in 24 ms
[2023-03-17 06:27:21] [INFO ] After 603ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-17 06:27:22] [INFO ] After 541ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-17 06:27:22] [INFO ] State equation strengthened by 17 read => feed constraints.
[2023-03-17 06:27:22] [INFO ] After 79ms SMT Verify possible using 17 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-17 06:27:22] [INFO ] After 189ms 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-17 06:27:22] [INFO ] After 847ms 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 283 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 p1), (NOT p1)]
Stuttering acceptance computed with spot in 70 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 130 ms. Remains 1369 /1369 variables (removed 0) and now considering 93216/93216 (removed 0) transitions.
[2023-03-17 06:27:22] [INFO ] Flow matrix only has 62870 transitions (discarded 30346 similar events)
// Phase 1: matrix 62870 rows 1369 cols
[2023-03-17 06:27:23] [INFO ] Computed 12 place invariants in 271 ms
[2023-03-17 06:27:26] [INFO ] Implicit Places using invariants in 3840 ms returned []
Implicit Place search using SMT only with invariants took 3843 ms to find 0 implicit places.
[2023-03-17 06:27:26] [INFO ] Flow matrix only has 62870 transitions (discarded 30346 similar events)
[2023-03-17 06:27:26] [INFO ] Invariant cache hit.
[2023-03-17 06:27:57] [INFO ] Performed 87437/93216 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-17 06:27:58] [INFO ] Dead Transitions using invariants and state equation in 32117 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 36093 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 115 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 66 ms :[true, (NOT p1), (NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 500 ms. (steps per millisecond=20 ) properties (out of 1) 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 1) seen :0
Interrupted probabilistic random walk after 9813 steps, run timeout after 3003 ms. (steps per millisecond=3 ) properties seen :{}
Probabilistic random walk after 9813 steps, saw 7929 distinct states, run finished after 3003 ms. (steps per millisecond=3 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-17 06:28:03] [INFO ] Flow matrix only has 62870 transitions (discarded 30346 similar events)
[2023-03-17 06:28:03] [INFO ] Invariant cache hit.
[2023-03-17 06:28:03] [INFO ] [Real]Absence check using 12 positive place invariants in 11 ms returned sat
[2023-03-17 06:28:22] [INFO ] After 19331ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-17 06:28:23] [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-17 06:28:28] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-17 06:28:28] [INFO ] After 25030ms 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 44 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 3597 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 3599 ms. Remains : 1296/1369 places, 89908/93216 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 485 ms. (steps per millisecond=20 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 9784 steps, run timeout after 3002 ms. (steps per millisecond=3 ) properties seen :{}
Probabilistic random walk after 9784 steps, saw 7791 distinct states, run finished after 3002 ms. (steps per millisecond=3 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-17 06:28:35] [INFO ] Flow matrix only has 62424 transitions (discarded 27484 similar events)
// Phase 1: matrix 62424 rows 1296 cols
[2023-03-17 06:28:35] [INFO ] Computed 12 place invariants in 200 ms
[2023-03-17 06:28:36] [INFO ] [Real]Absence check using 12 positive place invariants in 8 ms returned sat
[2023-03-17 06:28:56] [INFO ] After 19982ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-17 06:28:56] [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-17 06:29:00] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-17 06:29:00] [INFO ] After 25024ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 16 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 338 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 338 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 340 ms. Remains 1296 /1296 variables (removed 0) and now considering 89908/89908 (removed 0) transitions.
[2023-03-17 06:29:01] [INFO ] Flow matrix only has 62424 transitions (discarded 27484 similar events)
[2023-03-17 06:29:01] [INFO ] Invariant cache hit.
[2023-03-17 06:29:05] [INFO ] Implicit Places using invariants in 3613 ms returned []
Implicit Place search using SMT only with invariants took 3614 ms to find 0 implicit places.
[2023-03-17 06:29:05] [INFO ] Flow matrix only has 62424 transitions (discarded 27484 similar events)
[2023-03-17 06:29:05] [INFO ] Invariant cache hit.
[2023-03-17 06:29:34] [INFO ] Dead Transitions using invariants and state equation in 28964 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32925 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 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 0 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 1470 ms. Remains 302 /1296 variables (removed 994) and now considering 3813/89908 (removed 86095) transitions.
Running SMT prover for 1 properties.
[2023-03-17 06:29:35] [INFO ] Flow matrix only has 3695 transitions (discarded 118 similar events)
// Phase 1: matrix 3695 rows 302 cols
[2023-03-17 06:29:35] [INFO ] Computed 0 place invariants in 24 ms
[2023-03-17 06:29:36] [INFO ] After 605ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-17 06:29:36] [INFO ] After 530ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-17 06:29:36] [INFO ] State equation strengthened by 17 read => feed constraints.
[2023-03-17 06:29:37] [INFO ] After 76ms SMT Verify possible using 17 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-17 06:29:37] [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 67 ms.
[2023-03-17 06:29:37] [INFO ] After 829ms 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 149 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)]
Stuttering acceptance computed with spot in 74 ms :[true, (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 75 ms :[true, (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 2 reset in 4697 ms.
Product exploration explored 100000 steps with 0 reset in 4961 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 90 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 48 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 48 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 48 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 2039 ms. Remains 1363 /1369 variables (removed 6) and now considering 92672/93216 (removed 544) transitions.
[2023-03-17 06:29:49] [INFO ] Flow matrix only has 62330 transitions (discarded 30342 similar events)
// Phase 1: matrix 62330 rows 1363 cols
[2023-03-17 06:29:49] [INFO ] Computed 12 place invariants in 234 ms
[2023-03-17 06:30:17] [INFO ] Dead Transitions using invariants and state equation in 28201 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 30242 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-17 06:30:17] [INFO ] Flow matrix only has 62870 transitions (discarded 30346 similar events)
// Phase 1: matrix 62870 rows 1369 cols
[2023-03-17 06:30:18] [INFO ] Computed 12 place invariants in 252 ms
[2023-03-17 06:30:21] [INFO ] Implicit Places using invariants in 3728 ms returned []
Implicit Place search using SMT only with invariants took 3729 ms to find 0 implicit places.
[2023-03-17 06:30:21] [INFO ] Flow matrix only has 62870 transitions (discarded 30346 similar events)
[2023-03-17 06:30:21] [INFO ] Invariant cache hit.
[2023-03-17 06:30:51] [INFO ] Performed 89625/93216 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-17 06:30:53] [INFO ] Dead Transitions using invariants and state equation in 31477 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 35338 ms. Remains : 1369/1369 places, 93216/93216 transitions.
Treatment of property RERS2020-PT-pb107-LTLFireability-12 finished in 359155 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 47 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 47 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 2292 ms. Remains 1343 /1369 variables (removed 26) and now considering 92651/93216 (removed 565) transitions.
[2023-03-17 06:30:58] [INFO ] Flow matrix only has 62309 transitions (discarded 30342 similar events)
// Phase 1: matrix 62309 rows 1343 cols
[2023-03-17 06:30:58] [INFO ] Computed 12 place invariants in 214 ms
[2023-03-17 06:31:02] [INFO ] Implicit Places using invariants in 3685 ms returned []
Implicit Place search using SMT only with invariants took 3685 ms to find 0 implicit places.
[2023-03-17 06:31:02] [INFO ] Flow matrix only has 62309 transitions (discarded 30342 similar events)
[2023-03-17 06:31:02] [INFO ] Invariant cache hit.
[2023-03-17 06:31:32] [INFO ] Performed 92384/92651 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-17 06:31:32] [INFO ] Dead Transitions using invariants and state equation in 30316 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 36297 ms. Remains : 1343/1369 places, 92651/93216 transitions.
Stuttering acceptance computed with spot in 87 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]]
Stuttering criterion allowed to conclude after 269 steps with 0 reset in 33 ms.
FORMULA RERS2020-PT-pb107-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RERS2020-PT-pb107-LTLFireability-14 finished in 36562 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 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 70 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 2428 ms. Remains 1343 /1369 variables (removed 26) and now considering 92651/93216 (removed 565) transitions.
[2023-03-17 06:31:35] [INFO ] Flow matrix only has 62309 transitions (discarded 30342 similar events)
[2023-03-17 06:31:35] [INFO ] Invariant cache hit.
[2023-03-17 06:31:38] [INFO ] Implicit Places using invariants in 3549 ms returned []
Implicit Place search using SMT only with invariants took 3550 ms to find 0 implicit places.
[2023-03-17 06:31:38] [INFO ] Flow matrix only has 62309 transitions (discarded 30342 similar events)
[2023-03-17 06:31:38] [INFO ] Invariant cache hit.
[2023-03-17 06:32:08] [INFO ] Performed 91657/92651 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-17 06:32:09] [INFO ] Dead Transitions using invariants and state equation in 30550 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 36532 ms. Remains : 1343/1369 places, 92651/93216 transitions.
Stuttering acceptance computed with spot in 103 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 33231 reset in 4205 ms.
Product exploration explored 100000 steps with 33288 reset in 4219 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 396 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter insensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 119 ms :[(NOT p1), p0, (AND p0 p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 608 ms. (steps per millisecond=16 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 4) 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 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 7583 steps, run timeout after 3003 ms. (steps per millisecond=2 ) properties seen :{}
Probabilistic random walk after 7583 steps, saw 5481 distinct states, run finished after 3003 ms. (steps per millisecond=2 ) properties seen :0
Running SMT prover for 4 properties.
[2023-03-17 06:32:23] [INFO ] Flow matrix only has 62309 transitions (discarded 30342 similar events)
[2023-03-17 06:32:23] [INFO ] Invariant cache hit.
[2023-03-17 06:32:23] [INFO ] [Real]Absence check using 12 positive place invariants in 8 ms returned sat
[2023-03-17 06:32:46] [INFO ] After 23384ms SMT Verify possible using state equation in real domain returned unsat :0 sat :4
[2023-03-17 06:32:47] [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-17 06:32:48] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-17 06:32:48] [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 15 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 1850 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 1852 ms. Remains : 1296/1343 places, 89908/92651 transitions.
Incomplete random walk after 10000 steps, including 4 resets, run finished after 702 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 66 ms. (steps per millisecond=151 ) properties (out of 4) 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 4) 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 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 3 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 7448 steps, run timeout after 3001 ms. (steps per millisecond=2 ) properties seen :{}
Probabilistic random walk after 7448 steps, saw 5760 distinct states, run finished after 3001 ms. (steps per millisecond=2 ) properties seen :0
Running SMT prover for 4 properties.
[2023-03-17 06:32:54] [INFO ] Flow matrix only has 62424 transitions (discarded 27484 similar events)
// Phase 1: matrix 62424 rows 1296 cols
[2023-03-17 06:32:54] [INFO ] Computed 12 place invariants in 218 ms
[2023-03-17 06:32:54] [INFO ] [Real]Absence check using 12 positive place invariants in 12 ms returned sat
[2023-03-17 06:33:18] [INFO ] After 23392ms SMT Verify possible using state equation in real domain returned unsat :0 sat :4
[2023-03-17 06:33:18] [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-17 06:33:19] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-17 06:33:19] [INFO ] After 25039ms 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 15 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 400 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 400 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 403 ms. Remains 1296 /1296 variables (removed 0) and now considering 89908/89908 (removed 0) transitions.
[2023-03-17 06:33:20] [INFO ] Flow matrix only has 62424 transitions (discarded 27484 similar events)
[2023-03-17 06:33:20] [INFO ] Invariant cache hit.
[2023-03-17 06:33:23] [INFO ] Implicit Places using invariants in 3806 ms returned []
Implicit Place search using SMT only with invariants took 3807 ms to find 0 implicit places.
[2023-03-17 06:33:24] [INFO ] Flow matrix only has 62424 transitions (discarded 27484 similar events)
[2023-03-17 06:33:24] [INFO ] Invariant cache hit.
[2023-03-17 06:33:53] [INFO ] Dead Transitions using invariants and state equation in 29300 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33517 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 4 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.3 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 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.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 1494 ms. Remains 314 /1296 variables (removed 982) and now considering 3956/89908 (removed 85952) transitions.
Running SMT prover for 4 properties.
[2023-03-17 06:33:54] [INFO ] Flow matrix only has 3840 transitions (discarded 116 similar events)
// Phase 1: matrix 3840 rows 314 cols
[2023-03-17 06:33:54] [INFO ] Computed 0 place invariants in 23 ms
[2023-03-17 06:33:55] [INFO ] After 974ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-17 06:33:56] [INFO ] After 847ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-17 06:33:56] [INFO ] State equation strengthened by 18 read => feed constraints.
[2023-03-17 06:33:57] [INFO ] After 391ms SMT Verify possible using 18 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-17 06:33:57] [INFO ] After 921ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 350 ms.
[2023-03-17 06:33:58] [INFO ] After 2197ms 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 442 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 98 ms :[(NOT p1), p0, (AND p0 p1)]
Stuttering acceptance computed with spot in 97 ms :[(NOT p1), p0, (AND p0 p1)]
[2023-03-17 06:33:58] [INFO ] Flow matrix only has 62309 transitions (discarded 30342 similar events)
// Phase 1: matrix 62309 rows 1343 cols
[2023-03-17 06:33:59] [INFO ] Computed 12 place invariants in 217 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-17 06:34:14] [INFO ] Flow matrix only has 62309 transitions (discarded 30342 similar events)
[2023-03-17 06:34:14] [INFO ] Invariant cache hit.
[2023-03-17 06:34:18] [INFO ] Implicit Places using invariants in 3486 ms returned []
Implicit Place search using SMT only with invariants took 3487 ms to find 0 implicit places.
[2023-03-17 06:34:18] [INFO ] Flow matrix only has 62309 transitions (discarded 30342 similar events)
[2023-03-17 06:34:18] [INFO ] Invariant cache hit.
[2023-03-17 06:34:48] [INFO ] Performed 92538/92651 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-17 06:34:48] [INFO ] Dead Transitions using invariants and state equation in 30256 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 34138 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 400 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 3 resets, run finished after 712 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 64 ms. (steps per millisecond=156 ) properties (out of 4) 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 4) 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 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 8140 steps, run timeout after 3001 ms. (steps per millisecond=2 ) properties seen :{}
Probabilistic random walk after 8140 steps, saw 5785 distinct states, run finished after 3001 ms. (steps per millisecond=2 ) properties seen :0
Running SMT prover for 4 properties.
[2023-03-17 06:34:53] [INFO ] Flow matrix only has 62309 transitions (discarded 30342 similar events)
[2023-03-17 06:34:53] [INFO ] Invariant cache hit.
[2023-03-17 06:34:53] [INFO ] [Real]Absence check using 12 positive place invariants in 11 ms returned sat
[2023-03-17 06:35:17] [INFO ] After 23393ms SMT Verify possible using state equation in real domain returned unsat :0 sat :4
[2023-03-17 06:35:18] [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-17 06:35:18] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-17 06:35:18] [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 19 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 2005 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 2007 ms. Remains : 1296/1343 places, 89908/92651 transitions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 613 ms. (steps per millisecond=16 ) 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
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 10001 steps, including 2 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 3 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 8338 steps, run timeout after 3003 ms. (steps per millisecond=2 ) properties seen :{}
Probabilistic random walk after 8338 steps, saw 6535 distinct states, run finished after 3003 ms. (steps per millisecond=2 ) properties seen :0
Running SMT prover for 4 properties.
[2023-03-17 06:35:24] [INFO ] Flow matrix only has 62424 transitions (discarded 27484 similar events)
// Phase 1: matrix 62424 rows 1296 cols
[2023-03-17 06:35:24] [INFO ] Computed 12 place invariants in 242 ms
[2023-03-17 06:35:25] [INFO ] [Real]Absence check using 12 positive place invariants in 12 ms returned sat
[2023-03-17 06:35:48] [INFO ] After 23210ms SMT Verify possible using state equation in real domain returned unsat :0 sat :4
[2023-03-17 06:35:49] [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-17 06:35:50] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-17 06:35:50] [INFO ] After 25052ms 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 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 405 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 405 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 406 ms. Remains 1296 /1296 variables (removed 0) and now considering 89908/89908 (removed 0) transitions.
[2023-03-17 06:35:50] [INFO ] Flow matrix only has 62424 transitions (discarded 27484 similar events)
[2023-03-17 06:35:50] [INFO ] Invariant cache hit.
[2023-03-17 06:35:54] [INFO ] Implicit Places using invariants in 3816 ms returned []
Implicit Place search using SMT only with invariants took 3818 ms to find 0 implicit places.
[2023-03-17 06:35:54] [INFO ] Flow matrix only has 62424 transitions (discarded 27484 similar events)
[2023-03-17 06:35:54] [INFO ] Invariant cache hit.
[2023-03-17 06:36:24] [INFO ] Performed 87396/89908 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-17 06:36:25] [INFO ] Dead Transitions using invariants and state equation in 31073 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35304 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 3 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 1635 ms. Remains 314 /1296 variables (removed 982) and now considering 3956/89908 (removed 85952) transitions.
Running SMT prover for 4 properties.
[2023-03-17 06:36:27] [INFO ] Flow matrix only has 3840 transitions (discarded 116 similar events)
// Phase 1: matrix 3840 rows 314 cols
[2023-03-17 06:36:27] [INFO ] Computed 0 place invariants in 24 ms
[2023-03-17 06:36:28] [INFO ] After 1094ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-17 06:36:29] [INFO ] After 923ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-17 06:36:29] [INFO ] State equation strengthened by 18 read => feed constraints.
[2023-03-17 06:36:30] [INFO ] After 423ms SMT Verify possible using 18 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-17 06:36:30] [INFO ] After 980ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 377 ms.
[2023-03-17 06:36:30] [INFO ] After 2366ms 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 400 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 114 ms :[(NOT p1), p0, (AND p0 p1)]
Stuttering acceptance computed with spot in 125 ms :[(NOT p1), p0, (AND p0 p1)]
[2023-03-17 06:36:31] [INFO ] Flow matrix only has 62309 transitions (discarded 30342 similar events)
// Phase 1: matrix 62309 rows 1343 cols
[2023-03-17 06:36:32] [INFO ] Computed 12 place invariants in 255 ms
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 267 ms :[(NOT p1), p0, (AND p0 p1)]
Product exploration explored 100000 steps with 33221 reset in 4425 ms.
Product exploration explored 100000 steps with 33394 reset in 4467 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 396 ms. Remains 1343 /1343 variables (removed 0) and now considering 92651/92651 (removed 0) transitions.
[2023-03-17 06:36:56] [INFO ] Flow matrix only has 62309 transitions (discarded 30342 similar events)
[2023-03-17 06:36:56] [INFO ] Invariant cache hit.
[2023-03-17 06:37:00] [INFO ] Implicit Places using invariants in 3714 ms returned []
Implicit Place search using SMT only with invariants took 3715 ms to find 0 implicit places.
[2023-03-17 06:37:00] [INFO ] Flow matrix only has 62309 transitions (discarded 30342 similar events)
[2023-03-17 06:37:00] [INFO ] Invariant cache hit.
[2023-03-17 06:37:30] [INFO ] Performed 86057/92651 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-17 06:37:33] [INFO ] Dead Transitions using invariants and state equation in 32475 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 36588 ms. Remains : 1343/1343 places, 92651/92651 transitions.
Treatment of property RERS2020-PT-pb107-LTLFireability-15 finished in 363389 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 49 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 51 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 49 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 57 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 2592 ms. Remains 1343 /1369 variables (removed 26) and now considering 92651/93216 (removed 565) transitions.
[2023-03-17 06:37:39] [INFO ] Flow matrix only has 62309 transitions (discarded 30342 similar events)
[2023-03-17 06:37:39] [INFO ] Invariant cache hit.
[2023-03-17 06:37:42] [INFO ] Implicit Places using invariants in 3657 ms returned []
Implicit Place search using SMT only with invariants took 3658 ms to find 0 implicit places.
[2023-03-17 06:37:42] [INFO ] Flow matrix only has 62309 transitions (discarded 30342 similar events)
[2023-03-17 06:37:42] [INFO ] Invariant cache hit.
[2023-03-17 06:38:13] [INFO ] Performed 89968/92651 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-17 06:38:13] [INFO ] Dead Transitions using invariants and state equation in 31074 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 37326 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 1 reset in 4763 ms.
Product exploration explored 100000 steps with 0 reset in 5204 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 451 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 148 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 666 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 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 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 72 ms. (steps per millisecond=138 ) 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 74 ms. (steps per millisecond=135 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 6406 steps, run timeout after 3004 ms. (steps per millisecond=2 ) properties seen :{}
Probabilistic random walk after 6406 steps, saw 4778 distinct states, run finished after 3006 ms. (steps per millisecond=2 ) properties seen :0
Running SMT prover for 5 properties.
[2023-03-17 06:38:29] [INFO ] Flow matrix only has 62309 transitions (discarded 30342 similar events)
[2023-03-17 06:38:29] [INFO ] Invariant cache hit.
[2023-03-17 06:38:29] [INFO ] [Real]Absence check using 12 positive place invariants in 12 ms returned sat
[2023-03-17 06:38:54] [INFO ] After 24765ms SMT Verify possible using state equation in real domain returned unsat :0 sat :5
[2023-03-17 06:38:54] [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-17 06:38:54] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-17 06:38:54] [INFO ] After 25604ms 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 13 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 2023 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 2026 ms. Remains : 1297/1343 places, 89823/92651 transitions.
Incomplete random walk after 10000 steps, including 5 resets, run finished after 619 ms. (steps per millisecond=16 ) 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 3 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 5) 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 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 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 8683 steps, run timeout after 3002 ms. (steps per millisecond=2 ) properties seen :{}
Probabilistic random walk after 8683 steps, saw 6819 distinct states, run finished after 3002 ms. (steps per millisecond=2 ) properties seen :0
Running SMT prover for 5 properties.
[2023-03-17 06:39:00] [INFO ] Flow matrix only has 62339 transitions (discarded 27484 similar events)
// Phase 1: matrix 62339 rows 1297 cols
[2023-03-17 06:39:01] [INFO ] Computed 12 place invariants in 254 ms
[2023-03-17 06:39:01] [INFO ] [Real]Absence check using 12 positive place invariants in 11 ms returned sat
[2023-03-17 06:39:26] [INFO ] After 24709ms SMT Verify possible using state equation in real domain returned unsat :0 sat :5
[2023-03-17 06:39:26] [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-17 06:39:26] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-17 06:39:26] [INFO ] After 25472ms 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 395 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 395 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 399 ms. Remains 1297 /1297 variables (removed 0) and now considering 89823/89823 (removed 0) transitions.
[2023-03-17 06:39:27] [INFO ] Flow matrix only has 62339 transitions (discarded 27484 similar events)
[2023-03-17 06:39:27] [INFO ] Invariant cache hit.
[2023-03-17 06:39:31] [INFO ] Implicit Places using invariants in 3641 ms returned []
Implicit Place search using SMT only with invariants took 3642 ms to find 0 implicit places.
[2023-03-17 06:39:31] [INFO ] Flow matrix only has 62339 transitions (discarded 27484 similar events)
[2023-03-17 06:39:31] [INFO ] Invariant cache hit.
[2023-03-17 06:40:01] [INFO ] Performed 84082/89823 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-17 06:40:03] [INFO ] Dead Transitions using invariants and state equation in 32197 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36245 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.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 0 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 1564 ms. Remains 303 /1297 variables (removed 994) and now considering 3907/89823 (removed 85916) transitions.
Running SMT prover for 5 properties.
[2023-03-17 06:40:05] [INFO ] Flow matrix only has 3789 transitions (discarded 118 similar events)
// Phase 1: matrix 3789 rows 303 cols
[2023-03-17 06:40:05] [INFO ] Computed 0 place invariants in 27 ms
[2023-03-17 06:40:06] [INFO ] After 1121ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-17 06:40:07] [INFO ] After 1031ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-17 06:40:07] [INFO ] State equation strengthened by 17 read => feed constraints.
[2023-03-17 06:40:07] [INFO ] After 606ms SMT Verify possible using 17 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-17 06:40:08] [INFO ] After 1416ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 702 ms.
[2023-03-17 06:40:09] [INFO ] After 3236ms 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 441 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 176 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 171 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 131 ms. Remains 1343 /1343 variables (removed 0) and now considering 92651/92651 (removed 0) transitions.
[2023-03-17 06:40:10] [INFO ] Flow matrix only has 62309 transitions (discarded 30342 similar events)
// Phase 1: matrix 62309 rows 1343 cols
[2023-03-17 06:40:10] [INFO ] Computed 12 place invariants in 242 ms
[2023-03-17 06:40:14] [INFO ] Implicit Places using invariants in 3725 ms returned []
Implicit Place search using SMT only with invariants took 3726 ms to find 0 implicit places.
[2023-03-17 06:40:14] [INFO ] Flow matrix only has 62309 transitions (discarded 30342 similar events)
[2023-03-17 06:40:14] [INFO ] Invariant cache hit.
[2023-03-17 06:40:44] [INFO ] Performed 87586/92651 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-17 06:40:46] [INFO ] Dead Transitions using invariants and state equation in 31925 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 35784 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 371 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 148 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 5 resets, run finished after 675 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 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 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 74 ms. (steps per millisecond=135 ) properties (out of 5) 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 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 6647 steps, run timeout after 3001 ms. (steps per millisecond=2 ) properties seen :{}
Probabilistic random walk after 6647 steps, saw 4917 distinct states, run finished after 3001 ms. (steps per millisecond=2 ) properties seen :0
Running SMT prover for 5 properties.
[2023-03-17 06:40:51] [INFO ] Flow matrix only has 62309 transitions (discarded 30342 similar events)
[2023-03-17 06:40:51] [INFO ] Invariant cache hit.
[2023-03-17 06:40:51] [INFO ] [Real]Absence check using 12 positive place invariants in 11 ms returned sat
[2023-03-17 06:41:16] [INFO ] After 24707ms SMT Verify possible using state equation in real domain returned unsat :0 sat :5
[2023-03-17 06:41:16] [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-17 06:41:16] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-17 06:41:16] [INFO ] After 25537ms 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 15 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 1890 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 1894 ms. Remains : 1297/1343 places, 89823/92651 transitions.
Incomplete random walk after 10000 steps, including 5 resets, run finished after 711 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 71 ms. (steps per millisecond=140 ) 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 10000 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 4 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 74 ms. (steps per millisecond=135 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 6866 steps, run timeout after 3003 ms. (steps per millisecond=2 ) properties seen :{}
Probabilistic random walk after 6866 steps, saw 5250 distinct states, run finished after 3003 ms. (steps per millisecond=2 ) properties seen :0
Running SMT prover for 5 properties.
[2023-03-17 06:41:22] [INFO ] Flow matrix only has 62339 transitions (discarded 27484 similar events)
// Phase 1: matrix 62339 rows 1297 cols
[2023-03-17 06:41:23] [INFO ] Computed 12 place invariants in 239 ms
[2023-03-17 06:41:23] [INFO ] [Real]Absence check using 12 positive place invariants in 10 ms returned sat
[2023-03-17 06:41:47] [INFO ] After 24288ms SMT Verify possible using state equation in real domain returned unsat :0 sat :5
[2023-03-17 06:41:48] [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-17 06:41:48] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-17 06:41:48] [INFO ] After 25063ms 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 389 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 389 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 387 ms. Remains 1297 /1297 variables (removed 0) and now considering 89823/89823 (removed 0) transitions.
[2023-03-17 06:41:49] [INFO ] Flow matrix only has 62339 transitions (discarded 27484 similar events)
[2023-03-17 06:41:49] [INFO ] Invariant cache hit.
[2023-03-17 06:41:52] [INFO ] Implicit Places using invariants in 3595 ms returned []
Implicit Place search using SMT only with invariants took 3598 ms to find 0 implicit places.
[2023-03-17 06:41:52] [INFO ] Flow matrix only has 62339 transitions (discarded 27484 similar events)
[2023-03-17 06:41:52] [INFO ] Invariant cache hit.
[2023-03-17 06:42:22] [INFO ] Performed 87108/89823 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-17 06:42:23] [INFO ] Dead Transitions using invariants and state equation in 31068 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35060 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.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 0 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 0 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 1506 ms. Remains 303 /1297 variables (removed 994) and now considering 3907/89823 (removed 85916) transitions.
Running SMT prover for 5 properties.
[2023-03-17 06:42:25] [INFO ] Flow matrix only has 3789 transitions (discarded 118 similar events)
// Phase 1: matrix 3789 rows 303 cols
[2023-03-17 06:42:25] [INFO ] Computed 0 place invariants in 28 ms
[2023-03-17 06:42:26] [INFO ] After 1059ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-17 06:42:27] [INFO ] After 975ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-17 06:42:27] [INFO ] State equation strengthened by 17 read => feed constraints.
[2023-03-17 06:42:28] [INFO ] After 560ms SMT Verify possible using 17 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-17 06:42:28] [INFO ] After 1352ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 660 ms.
[2023-03-17 06:42:29] [INFO ] After 3075ms 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 411 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 142 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))]
Stuttering acceptance computed with spot in 160 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 0 reset in 4762 ms.
Product exploration explored 100000 steps with 0 reset in 5176 ms.
Applying partial POR strategy [false, true, true, true]
Stuttering acceptance computed with spot in 159 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 SI_LTL mode, iteration 0 : 1343/1343 places, 92651/92651 transitions.
Applied a total of 0 rules in 389 ms. Remains 1343 /1343 variables (removed 0) and now considering 92651/92651 (removed 0) transitions.
[2023-03-17 06:42:41] [INFO ] Flow matrix only has 62309 transitions (discarded 30342 similar events)
// Phase 1: matrix 62309 rows 1343 cols
[2023-03-17 06:42:41] [INFO ] Computed 12 place invariants in 262 ms
[2023-03-17 06:43:11] [INFO ] Performed 86251/92651 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-17 06:43:13] [INFO ] Dead Transitions using invariants and state equation in 32552 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 32943 ms. Remains : 1343/1343 places, 92651/92651 transitions.
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 127 ms. Remains 1343 /1343 variables (removed 0) and now considering 92651/92651 (removed 0) transitions.
[2023-03-17 06:43:13] [INFO ] Flow matrix only has 62309 transitions (discarded 30342 similar events)
[2023-03-17 06:43:13] [INFO ] Invariant cache hit.
[2023-03-17 06:43:17] [INFO ] Implicit Places using invariants in 3435 ms returned []
Implicit Place search using SMT only with invariants took 3435 ms to find 0 implicit places.
[2023-03-17 06:43:17] [INFO ] Flow matrix only has 62309 transitions (discarded 30342 similar events)
[2023-03-17 06:43:17] [INFO ] Invariant cache hit.
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 12236216 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16009648 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="lolaxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool lolaxred"
echo " Input is 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 r327-tall-167889199400268"
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 ;