About the Execution of LoLa+red for RERS2020-PT-pb102
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 10302.768 | 3600000.00 | 3951317.00 | 13807.20 | ???FFF?F???????? | 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-167889199300228.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-pb102, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r327-tall-167889199300228
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 71M
-rw-r--r-- 1 mcc users 8.4K Feb 26 08:36 CTLCardinality.txt
-rw-r--r-- 1 mcc users 95K Feb 26 08:36 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.5K Feb 26 08:34 CTLFireability.txt
-rw-r--r-- 1 mcc users 65K Feb 26 08:34 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K 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.5K Feb 25 16:40 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:40 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.8K Feb 26 08:44 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 71K Feb 26 08:44 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Feb 26 08:42 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 84K Feb 26 08:42 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K 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 70M 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-pb102-LTLFireability-00
FORMULA_NAME RERS2020-PT-pb102-LTLFireability-01
FORMULA_NAME RERS2020-PT-pb102-LTLFireability-02
FORMULA_NAME RERS2020-PT-pb102-LTLFireability-03
FORMULA_NAME RERS2020-PT-pb102-LTLFireability-04
FORMULA_NAME RERS2020-PT-pb102-LTLFireability-05
FORMULA_NAME RERS2020-PT-pb102-LTLFireability-06
FORMULA_NAME RERS2020-PT-pb102-LTLFireability-07
FORMULA_NAME RERS2020-PT-pb102-LTLFireability-08
FORMULA_NAME RERS2020-PT-pb102-LTLFireability-09
FORMULA_NAME RERS2020-PT-pb102-LTLFireability-10
FORMULA_NAME RERS2020-PT-pb102-LTLFireability-11
FORMULA_NAME RERS2020-PT-pb102-LTLFireability-12
FORMULA_NAME RERS2020-PT-pb102-LTLFireability-13
FORMULA_NAME RERS2020-PT-pb102-LTLFireability-14
FORMULA_NAME RERS2020-PT-pb102-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1679015893412
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-pb102
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-17 01:18:15] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-17 01:18:15] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-17 01:18:17] [INFO ] Load time of PNML (sax parser for PT used): 2099 ms
[2023-03-17 01:18:17] [INFO ] Transformed 1276 places.
[2023-03-17 01:18:17] [INFO ] Transformed 125387 transitions.
[2023-03-17 01:18:17] [INFO ] Found NUPN structural information;
[2023-03-17 01:18:17] [INFO ] Parsed PT model containing 1276 places and 125387 transitions and 499222 arcs in 2555 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 29 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 2767 transitions
Reduce redundant transitions removed 2767 transitions.
Support contains 68 out of 1276 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1276/1276 places, 122620/122620 transitions.
Ensure Unique test removed 6 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 1270 transition count 122620
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 9 place count 1267 transition count 122617
Iterating global reduction 1 with 3 rules applied. Total rules applied 12 place count 1267 transition count 122617
Applied a total of 12 rules in 845 ms. Remains 1267 /1276 variables (removed 9) and now considering 122617/122620 (removed 3) transitions.
[2023-03-17 01:18:19] [INFO ] Flow matrix only has 94416 transitions (discarded 28201 similar events)
// Phase 1: matrix 94416 rows 1267 cols
[2023-03-17 01:18:19] [INFO ] Computed 7 place invariants in 571 ms
[2023-03-17 01:18:27] [INFO ] Implicit Places using invariants in 7898 ms returned []
Implicit Place search using SMT only with invariants took 7923 ms to find 0 implicit places.
[2023-03-17 01:18:27] [INFO ] Flow matrix only has 94416 transitions (discarded 28201 similar events)
[2023-03-17 01:18:27] [INFO ] Invariant cache hit.
[2023-03-17 01:18:57] [INFO ] Performed 92702/122617 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-17 01:19:06] [INFO ] Dead Transitions using invariants and state equation in 39632 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1267/1276 places, 122617/122620 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 48421 ms. Remains : 1267/1276 places, 122617/122620 transitions.
Support contains 68 out of 1267 places after structural reductions.
[2023-03-17 01:19:11] [INFO ] Flatten gal took : 3698 ms
[2023-03-17 01:19:14] [INFO ] Flatten gal took : 3340 ms
[2023-03-17 01:19:21] [INFO ] Input system was already deterministic with 122617 transitions.
Support contains 66 out of 1267 places (down from 68) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 1606 ms. (steps per millisecond=6 ) properties (out of 35) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=35 ) properties (out of 34) 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 34) 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 34) 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 34) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 34) 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 34) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 34) 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 34) 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 34) 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 34) 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 34) 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 34) 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 34) 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 34) 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 34) 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 34) 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 34) 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 34) 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 34) 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 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 34) 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 34) 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 34) 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 34) 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 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 34) 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 34) 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 34) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 34) 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 34) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 34) seen :0
Interrupted probabilistic random walk after 15369 steps, run timeout after 6003 ms. (steps per millisecond=2 ) properties seen :{}
Probabilistic random walk after 15369 steps, saw 11199 distinct states, run finished after 6006 ms. (steps per millisecond=2 ) properties seen :0
Running SMT prover for 34 properties.
[2023-03-17 01:19:30] [INFO ] Flow matrix only has 94416 transitions (discarded 28201 similar events)
[2023-03-17 01:19:31] [INFO ] Invariant cache hit.
[2023-03-17 01:19:31] [INFO ] After 929ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:34
[2023-03-17 01:19:32] [INFO ] [Nat]Absence check using 7 positive place invariants in 11 ms returned sat
[2023-03-17 01:19:56] [INFO ] After 23356ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :33
[2023-03-17 01:19:59] [INFO ] State equation strengthened by 3015 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:350)
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 01:19:59] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-17 01:19:59] [INFO ] After 27309ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:34
Fused 34 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 64 out of 1267 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1267/1267 places, 122617/122617 transitions.
Drop transitions removed 2004 transitions
Reduce isomorphic transitions removed 2004 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2006 rules applied. Total rules applied 2006 place count 1267 transition count 120611
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 2009 place count 1265 transition count 120610
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 2009 place count 1265 transition count 120608
Deduced a syphon composed of 2 places in 170 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 2013 place count 1263 transition count 120608
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: 38
Deduced a syphon composed of 38 places in 69 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 2 with 76 rules applied. Total rules applied 2089 place count 1225 transition count 120570
Ensure Unique test removed 1981 transitions
Reduce isomorphic transitions removed 1981 transitions.
Iterating post reduction 2 with 1981 rules applied. Total rules applied 4070 place count 1225 transition count 118589
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 74 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 4074 place count 1223 transition count 118587
Drop transitions removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 4077 place count 1223 transition count 118584
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 5 places in 66 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 4087 place count 1218 transition count 118585
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 4091 place count 1218 transition count 118581
Free-agglomeration rule applied 37 times.
Iterating global reduction 5 with 37 rules applied. Total rules applied 4128 place count 1218 transition count 118544
Reduce places removed 37 places and 0 transitions.
Ensure Unique test removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Iterating post reduction 5 with 73 rules applied. Total rules applied 4201 place count 1181 transition count 118508
Free-agglomeration rule applied 1 times.
Iterating global reduction 6 with 1 rules applied. Total rules applied 4202 place count 1181 transition count 118507
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 4204 place count 1180 transition count 118506
Free-agglomeration rule applied 1 times.
Iterating global reduction 7 with 1 rules applied. Total rules applied 4205 place count 1180 transition count 118505
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 4206 place count 1179 transition count 118505
Free-agglomeration rule (complex) applied 69 times with reduction of 2083 identical transitions.
Iterating global reduction 8 with 69 rules applied. Total rules applied 4275 place count 1179 transition count 129391
Reduce places removed 69 places and 0 transitions.
Drop transitions removed 41 transitions
Ensure Unique test removed 1863 transitions
Reduce isomorphic transitions removed 1904 transitions.
Iterating post reduction 8 with 1973 rules applied. Total rules applied 6248 place count 1110 transition count 127487
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 6249 place count 1109 transition count 127486
Applied a total of 6249 rules in 9994 ms. Remains 1109 /1267 variables (removed 158) and now considering 127486/122617 (removed -4869) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10000 ms. Remains : 1109/1267 places, 127486/122617 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1460 ms. (steps per millisecond=6 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=35 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=37 ) properties (out of 33) 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 33) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=33 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=16 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 33) 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 33) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=37 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=37 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 33) 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 33) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 33) 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 33) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 33) 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 33) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 33) 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 33) 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 33) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=35 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 33) 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 33) seen :0
Interrupted probabilistic random walk after 12961 steps, run timeout after 6002 ms. (steps per millisecond=2 ) properties seen :{}
Probabilistic random walk after 12961 steps, saw 9776 distinct states, run finished after 6002 ms. (steps per millisecond=2 ) properties seen :0
Running SMT prover for 33 properties.
[2023-03-17 01:20:17] [INFO ] Flow matrix only has 100595 transitions (discarded 26891 similar events)
// Phase 1: matrix 100595 rows 1109 cols
[2023-03-17 01:20:18] [INFO ] Computed 7 place invariants in 499 ms
[2023-03-17 01:20:19] [INFO ] After 697ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:33
[2023-03-17 01:20:19] [INFO ] [Nat]Absence check using 7 positive place invariants in 13 ms returned sat
[2023-03-17 01:20:44] [INFO ] After 23891ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :28
[2023-03-17 01:20:45] [INFO ] State equation strengthened by 3431 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:350)
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 01:20:45] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-17 01:20:45] [INFO ] After 26536ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:33
Fused 33 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 64 out of 1109 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1109/1109 places, 127486/127486 transitions.
Applied a total of 0 rules in 809 ms. Remains 1109 /1109 variables (removed 0) and now considering 127486/127486 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 809 ms. Remains : 1109/1109 places, 127486/127486 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1109/1109 places, 127486/127486 transitions.
Applied a total of 0 rules in 655 ms. Remains 1109 /1109 variables (removed 0) and now considering 127486/127486 (removed 0) transitions.
[2023-03-17 01:20:47] [INFO ] Flow matrix only has 100595 transitions (discarded 26891 similar events)
[2023-03-17 01:20:47] [INFO ] Invariant cache hit.
[2023-03-17 01:20:54] [INFO ] Implicit Places using invariants in 7332 ms returned []
Implicit Place search using SMT only with invariants took 7338 ms to find 0 implicit places.
[2023-03-17 01:20:54] [INFO ] Flow matrix only has 100595 transitions (discarded 26891 similar events)
[2023-03-17 01:20:54] [INFO ] Invariant cache hit.
[2023-03-17 01:21:24] [INFO ] Performed 102321/127486 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-17 01:21:32] [INFO ] Dead Transitions using invariants and state equation in 37694 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 45704 ms. Remains : 1109/1109 places, 127486/127486 transitions.
Successfully simplified 1 atomic propositions for a total of 16 simplifications.
Computed a total of 245 stabilizing places and 27913 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(X(X((G(F(p0))||G(p1))))))'
Support contains 4 out of 1267 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1267/1267 places, 122617/122617 transitions.
Applied a total of 0 rules in 206 ms. Remains 1267 /1267 variables (removed 0) and now considering 122617/122617 (removed 0) transitions.
[2023-03-17 01:21:33] [INFO ] Flow matrix only has 94416 transitions (discarded 28201 similar events)
// Phase 1: matrix 94416 rows 1267 cols
[2023-03-17 01:21:33] [INFO ] Computed 7 place invariants in 476 ms
[2023-03-17 01:21:41] [INFO ] Implicit Places using invariants in 8249 ms returned []
Implicit Place search using SMT only with invariants took 8256 ms to find 0 implicit places.
[2023-03-17 01:21:41] [INFO ] Flow matrix only has 94416 transitions (discarded 28201 similar events)
[2023-03-17 01:21:41] [INFO ] Invariant cache hit.
[2023-03-17 01:22:11] [INFO ] Performed 93511/122617 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-17 01:22:20] [INFO ] Dead Transitions using invariants and state equation in 39343 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 47811 ms. Remains : 1267/1267 places, 122617/122617 transitions.
Stuttering acceptance computed with spot in 363 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Running random walk in product with property : RERS2020-PT-pb102-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=p1, acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 4}, { cond=(NOT p1), acceptance={} source=3 dest: 5}], [{ cond=(NOT p0), acceptance={0} source=4 dest: 4}], [{ cond=(NOT p0), acceptance={} source=5 dest: 4}, { cond=true, acceptance={} source=5 dest: 5}]], initial=0, aps=[p1:(AND (EQ s1080 1) (EQ s1128 1)), p0:(OR (EQ s626 0) (EQ s1238 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 2 reset in 7959 ms.
Product exploration explored 100000 steps with 0 reset in 7905 ms.
Computed a total of 245 stabilizing places and 27913 stable transitions
Computed a total of 245 stabilizing places and 27913 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 112 ms. Reduced automaton from 6 states, 9 edges and 2 AP (stutter sensitive) to 6 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 254 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1045 ms. (steps per millisecond=9 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 138 ms. (steps per millisecond=72 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 175 ms. (steps per millisecond=57 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 187 ms. (steps per millisecond=53 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 7717 steps, run timeout after 3001 ms. (steps per millisecond=2 ) properties seen :{}
Probabilistic random walk after 7717 steps, saw 5746 distinct states, run finished after 3003 ms. (steps per millisecond=2 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-17 01:22:43] [INFO ] Flow matrix only has 94416 transitions (discarded 28201 similar events)
[2023-03-17 01:22:43] [INFO ] Invariant cache hit.
[2023-03-17 01:22:43] [INFO ] [Real]Absence check using 7 positive place invariants in 14 ms returned sat
[2023-03-17 01:22:43] [INFO ] After 251ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-17 01:22:43] [INFO ] [Nat]Absence check using 7 positive place invariants in 11 ms returned sat
[2023-03-17 01:23:08] [INFO ] After 24919ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-17 01:23:09] [INFO ] State equation strengthened by 3015 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:350)
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 01:23:09] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-17 01:23:09] [INFO ] After 25859ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:3
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 1267 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1267/1267 places, 122617/122617 transitions.
Drop transitions removed 2004 transitions
Reduce isomorphic transitions removed 2004 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2006 rules applied. Total rules applied 2006 place count 1267 transition count 120611
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 2009 place count 1265 transition count 120610
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 2009 place count 1265 transition count 120608
Deduced a syphon composed of 2 places in 53 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 2013 place count 1263 transition count 120608
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: 38
Deduced a syphon composed of 38 places in 58 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 2 with 76 rules applied. Total rules applied 2089 place count 1225 transition count 120570
Ensure Unique test removed 1981 transitions
Reduce isomorphic transitions removed 1981 transitions.
Iterating post reduction 2 with 1981 rules applied. Total rules applied 4070 place count 1225 transition count 118589
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 53 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 4074 place count 1223 transition count 118587
Drop transitions removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 4077 place count 1223 transition count 118584
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 5 places in 53 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 4087 place count 1218 transition count 118585
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 4091 place count 1218 transition count 118581
Free-agglomeration rule applied 38 times.
Iterating global reduction 5 with 38 rules applied. Total rules applied 4129 place count 1218 transition count 118543
Reduce places removed 38 places and 0 transitions.
Ensure Unique test removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Iterating post reduction 5 with 74 rules applied. Total rules applied 4203 place count 1180 transition count 118507
Free-agglomeration rule applied 1 times.
Iterating global reduction 6 with 1 rules applied. Total rules applied 4204 place count 1180 transition count 118506
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 4206 place count 1179 transition count 118505
Free-agglomeration rule applied 1 times.
Iterating global reduction 7 with 1 rules applied. Total rules applied 4207 place count 1179 transition count 118504
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 4208 place count 1178 transition count 118504
Free-agglomeration rule (complex) applied 75 times with reduction of 4414 identical transitions.
Iterating global reduction 8 with 75 rules applied. Total rules applied 4283 place count 1178 transition count 134714
Reduce places removed 75 places and 0 transitions.
Drop transitions removed 48 transitions
Ensure Unique test removed 3410 transitions
Reduce isomorphic transitions removed 3458 transitions.
Iterating post reduction 8 with 3533 rules applied. Total rules applied 7816 place count 1103 transition count 131256
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 7817 place count 1102 transition count 131255
Applied a total of 7817 rules in 8241 ms. Remains 1102 /1267 variables (removed 165) and now considering 131255/122617 (removed -8638) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8247 ms. Remains : 1102/1267 places, 131255/122617 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1076 ms. (steps per millisecond=9 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 137 ms. (steps per millisecond=73 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 124 ms. (steps per millisecond=80 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 123 ms. (steps per millisecond=81 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 7553 steps, run timeout after 3002 ms. (steps per millisecond=2 ) properties seen :{}
Probabilistic random walk after 7553 steps, saw 5813 distinct states, run finished after 3002 ms. (steps per millisecond=2 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-17 01:23:22] [INFO ] Flow matrix only has 104269 transitions (discarded 26986 similar events)
// Phase 1: matrix 104269 rows 1102 cols
[2023-03-17 01:23:22] [INFO ] Computed 7 place invariants in 656 ms
[2023-03-17 01:23:22] [INFO ] [Real]Absence check using 7 positive place invariants in 11 ms returned sat
[2023-03-17 01:23:23] [INFO ] After 259ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-17 01:23:23] [INFO ] [Nat]Absence check using 7 positive place invariants in 25 ms returned sat
[2023-03-17 01:23:48] [INFO ] After 24786ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-17 01:23:49] [INFO ] State equation strengthened by 3605 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:350)
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 01:23:49] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-17 01:23:49] [INFO ] After 26455ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:3
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 1102 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1102/1102 places, 131255/131255 transitions.
Applied a total of 0 rules in 679 ms. Remains 1102 /1102 variables (removed 0) and now considering 131255/131255 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 681 ms. Remains : 1102/1102 places, 131255/131255 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1102/1102 places, 131255/131255 transitions.
Applied a total of 0 rules in 741 ms. Remains 1102 /1102 variables (removed 0) and now considering 131255/131255 (removed 0) transitions.
[2023-03-17 01:23:50] [INFO ] Flow matrix only has 104269 transitions (discarded 26986 similar events)
[2023-03-17 01:23:50] [INFO ] Invariant cache hit.
[2023-03-17 01:23:59] [INFO ] Implicit Places using invariants in 8408 ms returned []
Implicit Place search using SMT only with invariants took 8408 ms to find 0 implicit places.
[2023-03-17 01:23:59] [INFO ] Flow matrix only has 104269 transitions (discarded 26986 similar events)
[2023-03-17 01:23:59] [INFO ] Invariant cache hit.
[2023-03-17 01:24:29] [INFO ] Performed 94134/131255 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-17 01:24:40] [INFO ] Dead Transitions using invariants and state equation in 41686 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 50854 ms. Remains : 1102/1102 places, 131255/131255 transitions.
Knowledge obtained : [(AND (NOT p1) p0), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 112 ms. Reduced automaton from 6 states, 9 edges and 2 AP (stutter sensitive) to 6 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 260 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 247 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Support contains 4 out of 1267 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1267/1267 places, 122617/122617 transitions.
Applied a total of 0 rules in 160 ms. Remains 1267 /1267 variables (removed 0) and now considering 122617/122617 (removed 0) transitions.
[2023-03-17 01:24:41] [INFO ] Flow matrix only has 94416 transitions (discarded 28201 similar events)
// Phase 1: matrix 94416 rows 1267 cols
[2023-03-17 01:24:42] [INFO ] Computed 7 place invariants in 438 ms
[2023-03-17 01:24:50] [INFO ] Implicit Places using invariants in 8451 ms returned []
Implicit Place search using SMT only with invariants took 8453 ms to find 0 implicit places.
[2023-03-17 01:24:50] [INFO ] Flow matrix only has 94416 transitions (discarded 28201 similar events)
[2023-03-17 01:24:50] [INFO ] Invariant cache hit.
[2023-03-17 01:25:20] [INFO ] Performed 93270/122617 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-17 01:25:30] [INFO ] Dead Transitions using invariants and state equation in 39977 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 48594 ms. Remains : 1267/1267 places, 122617/122617 transitions.
Computed a total of 245 stabilizing places and 27913 stable transitions
Computed a total of 245 stabilizing places and 27913 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 103 ms. Reduced automaton from 6 states, 9 edges and 2 AP (stutter sensitive) to 6 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 254 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1024 ms. (steps per millisecond=9 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 150 ms. (steps per millisecond=66 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 153 ms. (steps per millisecond=65 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 164 ms. (steps per millisecond=60 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 6488 steps, run timeout after 3003 ms. (steps per millisecond=2 ) properties seen :{}
Probabilistic random walk after 6488 steps, saw 4836 distinct states, run finished after 3004 ms. (steps per millisecond=2 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-17 01:25:36] [INFO ] Flow matrix only has 94416 transitions (discarded 28201 similar events)
[2023-03-17 01:25:36] [INFO ] Invariant cache hit.
[2023-03-17 01:25:36] [INFO ] [Real]Absence check using 7 positive place invariants in 13 ms returned sat
[2023-03-17 01:25:36] [INFO ] After 209ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-17 01:25:36] [INFO ] [Nat]Absence check using 7 positive place invariants in 11 ms returned sat
[2023-03-17 01:26:01] [INFO ] After 24795ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-17 01:26:02] [INFO ] State equation strengthened by 3015 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:350)
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 01:26:02] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-17 01:26:02] [INFO ] After 25768ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:3
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 1267 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1267/1267 places, 122617/122617 transitions.
Drop transitions removed 2004 transitions
Reduce isomorphic transitions removed 2004 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2006 rules applied. Total rules applied 2006 place count 1267 transition count 120611
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 2009 place count 1265 transition count 120610
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 2009 place count 1265 transition count 120608
Deduced a syphon composed of 2 places in 64 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 2013 place count 1263 transition count 120608
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: 38
Deduced a syphon composed of 38 places in 58 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 2 with 76 rules applied. Total rules applied 2089 place count 1225 transition count 120570
Ensure Unique test removed 1981 transitions
Reduce isomorphic transitions removed 1981 transitions.
Iterating post reduction 2 with 1981 rules applied. Total rules applied 4070 place count 1225 transition count 118589
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 54 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 4074 place count 1223 transition count 118587
Drop transitions removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 4077 place count 1223 transition count 118584
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 5 places in 53 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 4087 place count 1218 transition count 118585
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 4091 place count 1218 transition count 118581
Free-agglomeration rule applied 38 times.
Iterating global reduction 5 with 38 rules applied. Total rules applied 4129 place count 1218 transition count 118543
Reduce places removed 38 places and 0 transitions.
Ensure Unique test removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Iterating post reduction 5 with 74 rules applied. Total rules applied 4203 place count 1180 transition count 118507
Free-agglomeration rule applied 1 times.
Iterating global reduction 6 with 1 rules applied. Total rules applied 4204 place count 1180 transition count 118506
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 4206 place count 1179 transition count 118505
Free-agglomeration rule applied 1 times.
Iterating global reduction 7 with 1 rules applied. Total rules applied 4207 place count 1179 transition count 118504
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 4208 place count 1178 transition count 118504
Free-agglomeration rule (complex) applied 75 times with reduction of 4414 identical transitions.
Iterating global reduction 8 with 75 rules applied. Total rules applied 4283 place count 1178 transition count 134714
Reduce places removed 75 places and 0 transitions.
Drop transitions removed 48 transitions
Ensure Unique test removed 3410 transitions
Reduce isomorphic transitions removed 3458 transitions.
Iterating post reduction 8 with 3533 rules applied. Total rules applied 7816 place count 1103 transition count 131256
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 7817 place count 1102 transition count 131255
Applied a total of 7817 rules in 8596 ms. Remains 1102 /1267 variables (removed 165) and now considering 131255/122617 (removed -8638) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8601 ms. Remains : 1102/1267 places, 131255/122617 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1519 ms. (steps per millisecond=6 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 208 ms. (steps per millisecond=48 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 217 ms. (steps per millisecond=46 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 199 ms. (steps per millisecond=50 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 10485 steps, run timeout after 6004 ms. (steps per millisecond=1 ) properties seen :{}
Probabilistic random walk after 10485 steps, saw 7831 distinct states, run finished after 6004 ms. (steps per millisecond=1 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-17 01:26:19] [INFO ] Flow matrix only has 104269 transitions (discarded 26986 similar events)
// Phase 1: matrix 104269 rows 1102 cols
[2023-03-17 01:26:19] [INFO ] Computed 7 place invariants in 567 ms
[2023-03-17 01:26:19] [INFO ] [Real]Absence check using 7 positive place invariants in 10 ms returned sat
[2023-03-17 01:26:19] [INFO ] After 198ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-17 01:26:20] [INFO ] [Nat]Absence check using 7 positive place invariants in 10 ms returned sat
[2023-03-17 01:26:44] [INFO ] After 25029ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 1102 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1102/1102 places, 131255/131255 transitions.
Applied a total of 0 rules in 698 ms. Remains 1102 /1102 variables (removed 0) and now considering 131255/131255 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 699 ms. Remains : 1102/1102 places, 131255/131255 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1102/1102 places, 131255/131255 transitions.
Applied a total of 0 rules in 678 ms. Remains 1102 /1102 variables (removed 0) and now considering 131255/131255 (removed 0) transitions.
[2023-03-17 01:26:46] [INFO ] Flow matrix only has 104269 transitions (discarded 26986 similar events)
[2023-03-17 01:26:46] [INFO ] Invariant cache hit.
[2023-03-17 01:26:54] [INFO ] Implicit Places using invariants in 8390 ms returned []
Implicit Place search using SMT only with invariants took 8391 ms to find 0 implicit places.
[2023-03-17 01:26:54] [INFO ] Flow matrix only has 104269 transitions (discarded 26986 similar events)
[2023-03-17 01:26:54] [INFO ] Invariant cache hit.
[2023-03-17 01:27:24] [INFO ] Performed 96024/131255 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-17 01:27:34] [INFO ] Dead Transitions using invariants and state equation in 40206 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 49289 ms. Remains : 1102/1102 places, 131255/131255 transitions.
Knowledge obtained : [(AND (NOT p1) p0), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 101 ms. Reduced automaton from 6 states, 9 edges and 2 AP (stutter sensitive) to 6 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 263 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 272 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 252 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 9662 ms.
Product exploration explored 100000 steps with 0 reset in 8259 ms.
Applying partial POR strategy [false, false, false, true, true, true]
Stuttering acceptance computed with spot in 273 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Support contains 4 out of 1267 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1267/1267 places, 122617/122617 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 1267 transition count 122617
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 1267 transition count 122616
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 42 places in 45 ms
Iterating global reduction 2 with 40 rules applied. Total rules applied 43 place count 1267 transition count 122623
Ensure Unique test removed 1982 transitions
Reduce isomorphic transitions removed 1982 transitions.
Iterating post reduction 2 with 1982 rules applied. Total rules applied 2025 place count 1267 transition count 120641
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 44 places in 45 ms
Iterating global reduction 3 with 2 rules applied. Total rules applied 2027 place count 1267 transition count 120641
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2028 place count 1267 transition count 120640
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 2030 place count 1265 transition count 120638
Deduced a syphon composed of 42 places in 44 ms
Iterating global reduction 4 with 2 rules applied. Total rules applied 2032 place count 1265 transition count 120638
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -14
Deduced a syphon composed of 47 places in 46 ms
Iterating global reduction 4 with 5 rules applied. Total rules applied 2037 place count 1265 transition count 120652
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 2042 place count 1265 transition count 120647
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 2043 place count 1264 transition count 120644
Deduced a syphon composed of 46 places in 47 ms
Iterating global reduction 5 with 1 rules applied. Total rules applied 2044 place count 1264 transition count 120644
Deduced a syphon composed of 46 places in 46 ms
Applied a total of 2044 rules in 3079 ms. Remains 1264 /1267 variables (removed 3) and now considering 120644/122617 (removed 1973) transitions.
[2023-03-17 01:27:57] [INFO ] Flow matrix only has 92428 transitions (discarded 28216 similar events)
// Phase 1: matrix 92428 rows 1264 cols
[2023-03-17 01:27:57] [INFO ] Computed 7 place invariants in 392 ms
[2023-03-17 01:28:28] [INFO ] Performed 90819/120644 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-17 01:28:37] [INFO ] Dead Transitions using invariants and state equation in 40360 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1264/1267 places, 120644/122617 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 43443 ms. Remains : 1264/1267 places, 120644/122617 transitions.
Support contains 4 out of 1267 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1267/1267 places, 122617/122617 transitions.
Applied a total of 0 rules in 202 ms. Remains 1267 /1267 variables (removed 0) and now considering 122617/122617 (removed 0) transitions.
[2023-03-17 01:28:38] [INFO ] Flow matrix only has 94416 transitions (discarded 28201 similar events)
// Phase 1: matrix 94416 rows 1267 cols
[2023-03-17 01:28:38] [INFO ] Computed 7 place invariants in 384 ms
[2023-03-17 01:28:46] [INFO ] Implicit Places using invariants in 8563 ms returned []
Implicit Place search using SMT only with invariants took 8567 ms to find 0 implicit places.
[2023-03-17 01:28:46] [INFO ] Flow matrix only has 94416 transitions (discarded 28201 similar events)
[2023-03-17 01:28:46] [INFO ] Invariant cache hit.
[2023-03-17 01:29:16] [INFO ] Performed 91609/122617 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-17 01:29:26] [INFO ] Dead Transitions using invariants and state equation in 40226 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 48999 ms. Remains : 1267/1267 places, 122617/122617 transitions.
Treatment of property RERS2020-PT-pb102-LTLFireability-00 finished in 479079 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)) U G((p1||X(G(!p2))))))'
Support contains 6 out of 1267 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1267/1267 places, 122617/122617 transitions.
Applied a total of 0 rules in 164 ms. Remains 1267 /1267 variables (removed 0) and now considering 122617/122617 (removed 0) transitions.
[2023-03-17 01:29:32] [INFO ] Flow matrix only has 94416 transitions (discarded 28201 similar events)
[2023-03-17 01:29:32] [INFO ] Invariant cache hit.
[2023-03-17 01:29:40] [INFO ] Implicit Places using invariants in 8133 ms returned []
Implicit Place search using SMT only with invariants took 8139 ms to find 0 implicit places.
[2023-03-17 01:29:40] [INFO ] Flow matrix only has 94416 transitions (discarded 28201 similar events)
[2023-03-17 01:29:40] [INFO ] Invariant cache hit.
[2023-03-17 01:30:10] [INFO ] Performed 95756/122617 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-17 01:30:19] [INFO ] Dead Transitions using invariants and state equation in 38862 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 47176 ms. Remains : 1267/1267 places, 122617/122617 transitions.
Stuttering acceptance computed with spot in 188 ms :[(AND (NOT p1) p2), (AND p0 p2), (AND (NOT p1) p2), p0]
Running random walk in product with property : RERS2020-PT-pb102-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={1} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={0, 1} source=0 dest: 2}], [{ cond=(AND p1 (NOT p2)), acceptance={} source=1 dest: 1}, { cond=p2, acceptance={} source=1 dest: 3}], [{ cond=p2, acceptance={1} source=2 dest: 0}, { cond=(NOT p1), acceptance={} source=2 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p1) p2), acceptance={0, 1} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}, { cond=p0, acceptance={0, 1} source=3 dest: 3}]], initial=0, aps=[p1:(AND (EQ s158 1) (EQ s509 1)), p2:(AND (EQ s275 1) (EQ s1005 1)), p0:(AND (EQ s8 1) (EQ s164 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 28605 reset in 8951 ms.
Product exploration explored 100000 steps with 28583 reset in 8602 ms.
Computed a total of 245 stabilizing places and 27913 stable transitions
Computed a total of 245 stabilizing places and 27913 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (NOT p2)), (X (NOT (AND p1 (NOT p2)))), (X (NOT p1)), (X (NOT (AND (NOT p1) p2))), (X (AND (NOT p1) (NOT p2))), (X (X (NOT p2))), true, (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT p0))), (X (X (AND (NOT p1) (NOT p2))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 13 factoid took 627 ms. Reduced automaton from 4 states, 12 edges and 3 AP (stutter sensitive) to 4 states, 15 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 160 ms :[(AND (NOT p1) p2), (AND p1 p2 p0), (AND (NOT p1) p2), p0]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1214 ms. (steps per millisecond=8 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 168 ms. (steps per millisecond=59 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 136 ms. (steps per millisecond=73 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 156 ms. (steps per millisecond=64 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 127 ms. (steps per millisecond=78 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 131 ms. (steps per millisecond=76 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 131 ms. (steps per millisecond=76 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 11330 steps, run timeout after 6005 ms. (steps per millisecond=1 ) properties seen :{}
Probabilistic random walk after 11330 steps, saw 8386 distinct states, run finished after 6006 ms. (steps per millisecond=1 ) properties seen :0
Running SMT prover for 6 properties.
[2023-03-17 01:30:46] [INFO ] Flow matrix only has 94416 transitions (discarded 28201 similar events)
[2023-03-17 01:30:46] [INFO ] Invariant cache hit.
[2023-03-17 01:30:46] [INFO ] [Real]Absence check using 7 positive place invariants in 10 ms returned sat
[2023-03-17 01:31:11] [INFO ] After 24704ms SMT Verify possible using state equation in real domain returned unsat :1 sat :3 real:2
[2023-03-17 01:31:13] [INFO ] State equation strengthened by 3015 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 01:31:13] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-17 01:31:13] [INFO ] After 26304ms 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 6 out of 1267 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1267/1267 places, 122617/122617 transitions.
Drop transitions removed 2004 transitions
Reduce isomorphic transitions removed 2004 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2006 rules applied. Total rules applied 2006 place count 1267 transition count 120611
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 2009 place count 1265 transition count 120610
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 2009 place count 1265 transition count 120608
Deduced a syphon composed of 2 places in 64 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 2013 place count 1263 transition count 120608
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: 38
Deduced a syphon composed of 38 places in 49 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 2 with 76 rules applied. Total rules applied 2089 place count 1225 transition count 120570
Ensure Unique test removed 1981 transitions
Reduce isomorphic transitions removed 1981 transitions.
Iterating post reduction 2 with 1981 rules applied. Total rules applied 4070 place count 1225 transition count 118589
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 49 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 4074 place count 1223 transition count 118587
Drop transitions removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 4077 place count 1223 transition count 118584
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 5 places in 47 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 4087 place count 1218 transition count 118585
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 4091 place count 1218 transition count 118581
Free-agglomeration rule applied 39 times.
Iterating global reduction 5 with 39 rules applied. Total rules applied 4130 place count 1218 transition count 118542
Reduce places removed 39 places and 0 transitions.
Ensure Unique test removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Iterating post reduction 5 with 75 rules applied. Total rules applied 4205 place count 1179 transition count 118506
Free-agglomeration rule applied 1 times.
Iterating global reduction 6 with 1 rules applied. Total rules applied 4206 place count 1179 transition count 118505
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 4208 place count 1178 transition count 118504
Free-agglomeration rule applied 1 times.
Iterating global reduction 7 with 1 rules applied. Total rules applied 4209 place count 1178 transition count 118503
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 4210 place count 1177 transition count 118503
Free-agglomeration rule (complex) applied 73 times with reduction of 2998 identical transitions.
Iterating global reduction 8 with 73 rules applied. Total rules applied 4283 place count 1177 transition count 131366
Reduce places removed 73 places and 0 transitions.
Drop transitions removed 46 transitions
Ensure Unique test removed 2284 transitions
Reduce isomorphic transitions removed 2330 transitions.
Iterating post reduction 8 with 2403 rules applied. Total rules applied 6686 place count 1104 transition count 129036
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 6687 place count 1103 transition count 129035
Applied a total of 6687 rules in 9461 ms. Remains 1103 /1267 variables (removed 164) and now considering 129035/122617 (removed -6418) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9466 ms. Remains : 1103/1267 places, 129035/122617 transitions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 1269 ms. (steps per millisecond=7 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 188 ms. (steps per millisecond=53 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 181 ms. (steps per millisecond=55 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 169 ms. (steps per millisecond=59 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 185 ms. (steps per millisecond=54 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 186 ms. (steps per millisecond=53 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 10905 steps, run timeout after 6002 ms. (steps per millisecond=1 ) properties seen :{}
Probabilistic random walk after 10905 steps, saw 8202 distinct states, run finished after 6004 ms. (steps per millisecond=1 ) properties seen :0
Running SMT prover for 5 properties.
[2023-03-17 01:31:30] [INFO ] Flow matrix only has 102079 transitions (discarded 26956 similar events)
// Phase 1: matrix 102079 rows 1103 cols
[2023-03-17 01:31:31] [INFO ] Computed 7 place invariants in 560 ms
[2023-03-17 01:31:31] [INFO ] [Real]Absence check using 7 positive place invariants in 9 ms returned sat
[2023-03-17 01:31:56] [INFO ] After 24789ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:3
[2023-03-17 01:31:57] [INFO ] State equation strengthened by 3505 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 01:31:57] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-17 01:31:57] [INFO ] After 25699ms 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 1103 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1103/1103 places, 129035/129035 transitions.
Applied a total of 0 rules in 719 ms. Remains 1103 /1103 variables (removed 0) and now considering 129035/129035 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 719 ms. Remains : 1103/1103 places, 129035/129035 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1103/1103 places, 129035/129035 transitions.
Applied a total of 0 rules in 642 ms. Remains 1103 /1103 variables (removed 0) and now considering 129035/129035 (removed 0) transitions.
[2023-03-17 01:31:58] [INFO ] Flow matrix only has 102079 transitions (discarded 26956 similar events)
[2023-03-17 01:31:58] [INFO ] Invariant cache hit.
[2023-03-17 01:32:06] [INFO ] Implicit Places using invariants in 8428 ms returned []
Implicit Place search using SMT only with invariants took 8429 ms to find 0 implicit places.
[2023-03-17 01:32:06] [INFO ] Flow matrix only has 102079 transitions (discarded 26956 similar events)
[2023-03-17 01:32:06] [INFO ] Invariant cache hit.
[2023-03-17 01:32:37] [INFO ] Performed 99234/129035 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-17 01:32:46] [INFO ] Dead Transitions using invariants and state equation in 39219 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 48305 ms. Remains : 1103/1103 places, 129035/129035 transitions.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (NOT p2)), (X (NOT (AND p1 (NOT p2)))), (X (NOT p1)), (X (NOT (AND (NOT p1) p2))), (X (AND (NOT p1) (NOT p2))), (X (X (NOT p2))), true, (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT p0))), (X (X (AND (NOT p1) (NOT p2)))), (G (NOT (AND p1 p2)))]
False Knowledge obtained : []
Knowledge based reduction with 14 factoid took 630 ms. Reduced automaton from 4 states, 15 edges and 3 AP (stutter insensitive) to 3 states, 10 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 136 ms :[p2, p2, p0]
Stuttering acceptance computed with spot in 113 ms :[p2, p2, p0]
Support contains 6 out of 1267 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1267/1267 places, 122617/122617 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 1266 transition count 122614
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 5 place count 1264 transition count 122613
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 5 place count 1264 transition count 122611
Deduced a syphon composed of 2 places in 55 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 9 place count 1262 transition count 122611
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: 38
Deduced a syphon composed of 38 places in 49 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 2 with 76 rules applied. Total rules applied 85 place count 1224 transition count 122573
Ensure Unique test removed 1981 transitions
Reduce isomorphic transitions removed 1981 transitions.
Iterating post reduction 2 with 1981 rules applied. Total rules applied 2066 place count 1224 transition count 120592
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 51 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 2070 place count 1222 transition count 120590
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2071 place count 1222 transition count 120589
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 5 places in 52 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 2081 place count 1217 transition count 120590
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 2085 place count 1217 transition count 120586
Applied a total of 2085 rules in 3107 ms. Remains 1217 /1267 variables (removed 50) and now considering 120586/122617 (removed 2031) transitions.
[2023-03-17 01:32:50] [INFO ] Flow matrix only has 92370 transitions (discarded 28216 similar events)
// Phase 1: matrix 92370 rows 1217 cols
[2023-03-17 01:32:50] [INFO ] Computed 7 place invariants in 337 ms
[2023-03-17 01:32:58] [INFO ] Implicit Places using invariants in 8221 ms returned []
Implicit Place search using SMT only with invariants took 8222 ms to find 0 implicit places.
[2023-03-17 01:32:58] [INFO ] Flow matrix only has 92370 transitions (discarded 28216 similar events)
[2023-03-17 01:32:58] [INFO ] Invariant cache hit.
[2023-03-17 01:33:28] [INFO ] Performed 91569/120586 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-17 01:33:38] [INFO ] Dead Transitions using invariants and state equation in 39735 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1217/1267 places, 120586/122617 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 51068 ms. Remains : 1217/1267 places, 120586/122617 transitions.
Computed a total of 232 stabilizing places and 26848 stable transitions
Computed a total of 232 stabilizing places and 26848 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (NOT p2)), (X (NOT (AND p1 (NOT p2)))), (X (AND (NOT p1) (NOT p2))), (X (NOT p0)), (X (X (NOT p2))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 429 ms. Reduced automaton from 3 states, 10 edges and 3 AP (stutter insensitive) to 3 states, 10 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 120 ms :[p2, p2, p0]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1161 ms. (steps per millisecond=8 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 158 ms. (steps per millisecond=63 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 146 ms. (steps per millisecond=68 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 133 ms. (steps per millisecond=75 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 142 ms. (steps per millisecond=70 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 6697 steps, run timeout after 3002 ms. (steps per millisecond=2 ) properties seen :{}
Probabilistic random walk after 6697 steps, saw 4937 distinct states, run finished after 3002 ms. (steps per millisecond=2 ) properties seen :0
Running SMT prover for 4 properties.
[2023-03-17 01:33:44] [INFO ] Flow matrix only has 92370 transitions (discarded 28216 similar events)
[2023-03-17 01:33:44] [INFO ] Invariant cache hit.
[2023-03-17 01:33:44] [INFO ] [Real]Absence check using 7 positive place invariants in 12 ms returned sat
[2023-03-17 01:34:09] [INFO ] After 25078ms SMT Verify possible using state equation in real domain returned unsat :0 sat :4
[2023-03-17 01:34:10] [INFO ] State equation strengthened by 3026 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 01:34:10] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-17 01:34:10] [INFO ] After 26035ms 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 6 out of 1217 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1217/1217 places, 120586/120586 transitions.
Drop transitions removed 2006 transitions
Reduce isomorphic transitions removed 2006 transitions.
Iterating post reduction 0 with 2006 rules applied. Total rules applied 2006 place count 1217 transition count 118580
Free-agglomeration rule applied 39 times.
Iterating global reduction 1 with 39 rules applied. Total rules applied 2045 place count 1217 transition count 118541
Reduce places removed 39 places and 0 transitions.
Ensure Unique test removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Iterating post reduction 1 with 75 rules applied. Total rules applied 2120 place count 1178 transition count 118505
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 2121 place count 1178 transition count 118504
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 2123 place count 1177 transition count 118503
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 2124 place count 1177 transition count 118502
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2125 place count 1176 transition count 118502
Free-agglomeration rule (complex) applied 73 times with reduction of 2998 identical transitions.
Iterating global reduction 4 with 73 rules applied. Total rules applied 2198 place count 1176 transition count 131365
Reduce places removed 73 places and 0 transitions.
Drop transitions removed 46 transitions
Ensure Unique test removed 2284 transitions
Reduce isomorphic transitions removed 2330 transitions.
Iterating post reduction 4 with 2403 rules applied. Total rules applied 4601 place count 1103 transition count 129035
Applied a total of 4601 rules in 4517 ms. Remains 1103 /1217 variables (removed 114) and now considering 129035/120586 (removed -8449) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4521 ms. Remains : 1103/1217 places, 129035/120586 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1250 ms. (steps per millisecond=8 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 165 ms. (steps per millisecond=60 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 164 ms. (steps per millisecond=60 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 174 ms. (steps per millisecond=57 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 175 ms. (steps per millisecond=57 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 5750 steps, run timeout after 3005 ms. (steps per millisecond=1 ) properties seen :{}
Probabilistic random walk after 5750 steps, saw 4524 distinct states, run finished after 3005 ms. (steps per millisecond=1 ) properties seen :0
Running SMT prover for 4 properties.
[2023-03-17 01:34:20] [INFO ] Flow matrix only has 102079 transitions (discarded 26956 similar events)
// Phase 1: matrix 102079 rows 1103 cols
[2023-03-17 01:34:20] [INFO ] Computed 7 place invariants in 632 ms
[2023-03-17 01:34:20] [INFO ] [Real]Absence check using 7 positive place invariants in 12 ms returned sat
[2023-03-17 01:34:45] [INFO ] After 25025ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-17 01:34:45] [INFO ] [Nat]Absence check using 7 positive place invariants in 10 ms returned sat
[2023-03-17 01:35:10] [INFO ] After 24776ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-17 01:35:11] [INFO ] State equation strengthened by 3505 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:350)
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 01:35:11] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-17 01:35:11] [INFO ] After 25739ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:2
Fused 4 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 6 out of 1103 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1103/1103 places, 129035/129035 transitions.
Applied a total of 0 rules in 643 ms. Remains 1103 /1103 variables (removed 0) and now considering 129035/129035 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 643 ms. Remains : 1103/1103 places, 129035/129035 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1103/1103 places, 129035/129035 transitions.
Applied a total of 0 rules in 634 ms. Remains 1103 /1103 variables (removed 0) and now considering 129035/129035 (removed 0) transitions.
[2023-03-17 01:35:12] [INFO ] Flow matrix only has 102079 transitions (discarded 26956 similar events)
[2023-03-17 01:35:12] [INFO ] Invariant cache hit.
[2023-03-17 01:35:20] [INFO ] Implicit Places using invariants in 8177 ms returned []
Implicit Place search using SMT only with invariants took 8190 ms to find 0 implicit places.
[2023-03-17 01:35:20] [INFO ] Flow matrix only has 102079 transitions (discarded 26956 similar events)
[2023-03-17 01:35:20] [INFO ] Invariant cache hit.
[2023-03-17 01:35:51] [INFO ] Performed 91805/129035 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-17 01:36:02] [INFO ] Dead Transitions using invariants and state equation in 41940 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 50776 ms. Remains : 1103/1103 places, 129035/129035 transitions.
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (NOT p2)), (X (NOT (AND p1 (NOT p2)))), (X (AND (NOT p1) (NOT p2))), (X (NOT p0)), (X (X (NOT p2))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 457 ms. Reduced automaton from 3 states, 10 edges and 3 AP (stutter insensitive) to 3 states, 10 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 116 ms :[p2, p2, p0]
Stuttering acceptance computed with spot in 122 ms :[p2, p2, p0]
Stuttering acceptance computed with spot in 115 ms :[p2, p2, p0]
Product exploration explored 100000 steps with 1 reset in 7782 ms.
Product exploration explored 100000 steps with 0 reset in 8744 ms.
Support contains 6 out of 1217 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1217/1217 places, 120586/120586 transitions.
Applied a total of 0 rules in 516 ms. Remains 1217 /1217 variables (removed 0) and now considering 120586/120586 (removed 0) transitions.
[2023-03-17 01:36:20] [INFO ] Flow matrix only has 92370 transitions (discarded 28216 similar events)
// Phase 1: matrix 92370 rows 1217 cols
[2023-03-17 01:36:21] [INFO ] Computed 7 place invariants in 378 ms
[2023-03-17 01:36:28] [INFO ] Implicit Places using invariants in 8075 ms returned []
Implicit Place search using SMT only with invariants took 8079 ms to find 0 implicit places.
[2023-03-17 01:36:29] [INFO ] Flow matrix only has 92370 transitions (discarded 28216 similar events)
[2023-03-17 01:36:29] [INFO ] Invariant cache hit.
[2023-03-17 01:36:59] [INFO ] Performed 92546/120586 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-17 01:37:08] [INFO ] Dead Transitions using invariants and state equation in 39188 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 47789 ms. Remains : 1217/1217 places, 120586/120586 transitions.
Treatment of property RERS2020-PT-pb102-LTLFireability-01 finished in 460824 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((F(p1) U X(p2))))) U (X(p4)&&p3)))'
Support contains 8 out of 1267 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1267/1267 places, 122617/122617 transitions.
Applied a total of 0 rules in 312 ms. Remains 1267 /1267 variables (removed 0) and now considering 122617/122617 (removed 0) transitions.
[2023-03-17 01:37:13] [INFO ] Flow matrix only has 94416 transitions (discarded 28201 similar events)
// Phase 1: matrix 94416 rows 1267 cols
[2023-03-17 01:37:13] [INFO ] Computed 7 place invariants in 400 ms
[2023-03-17 01:37:21] [INFO ] Implicit Places using invariants in 8263 ms returned []
Implicit Place search using SMT only with invariants took 8264 ms to find 0 implicit places.
[2023-03-17 01:37:21] [INFO ] Flow matrix only has 94416 transitions (discarded 28201 similar events)
[2023-03-17 01:37:21] [INFO ] Invariant cache hit.
[2023-03-17 01:37:51] [INFO ] Performed 95245/122617 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-17 01:37:59] [INFO ] Dead Transitions using invariants and state equation in 38389 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 46973 ms. Remains : 1267/1267 places, 122617/122617 transitions.
Stuttering acceptance computed with spot in 483 ms :[(OR (NOT p3) (NOT p4)), (NOT p2), (NOT p4), false, (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), false, (AND (NOT p1) (NOT p2)), (NOT p1)]
Running random walk in product with property : RERS2020-PT-pb102-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(NOT p3), acceptance={0} source=0 dest: 0}, { cond=(NOT p3), acceptance={} source=0 dest: 1}, { cond=p3, acceptance={0} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}, { cond=p0, acceptance={} source=1 dest: 3}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 4}, { cond=(NOT p0), acceptance={} source=1 dest: 5}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 6}, { cond=p0, acceptance={} source=1 dest: 7}], [{ cond=(AND (NOT p3) (NOT p4)), acceptance={0} source=2 dest: 0}, { cond=(OR (AND (NOT p3) (NOT p4)) (AND (NOT p0) (NOT p4))), acceptance={} source=2 dest: 1}, { cond=(AND p3 (NOT p4)), acceptance={0} source=2 dest: 2}, { cond=(AND p0 (NOT p4)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p1) (NOT p0) (NOT p4)), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p0) (NOT p4)), acceptance={} source=2 dest: 5}, { cond=(AND (NOT p1) p0 (NOT p4)), acceptance={} source=2 dest: 6}, { cond=(AND p0 (NOT p4)), acceptance={} source=2 dest: 7}], [{ cond=true, acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) p2), acceptance={} source=3 dest: 6}, { cond=p2, acceptance={} source=3 dest: 7}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0} source=4 dest: 4}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=4 dest: 6}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=4 dest: 8}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=4 dest: 9}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=5 dest: 4}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=5 dest: 5}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=5 dest: 6}, { cond=(AND p0 (NOT p2)), acceptance={} source=5 dest: 7}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=6 dest: 10}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=7 dest: 6}, { cond=(NOT p2), acceptance={0} source=7 dest: 7}], [{ cond=(AND (NOT p1) (NOT p0) p2), acceptance={0} source=8 dest: 4}, { cond=(AND (NOT p1) p0 p2), acceptance={} source=8 dest: 6}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={} source=8 dest: 8}, { cond=(AND (NOT p1) p0 p2), acceptance={} source=8 dest: 9}], [{ cond=(NOT p1), acceptance={} source=9 dest: 6}, { cond=(NOT p1), acceptance={} source=9 dest: 9}], [{ cond=(NOT p1), acceptance={0} source=10 dest: 10}]], initial=0, aps=[p3:(AND (EQ s367 1) (EQ s1040 1)), p0:(AND (EQ s491 1) (EQ s630 1)), p1:(AND (EQ s330 1) (EQ s662 1)), p4:(AND (EQ s366 1) (EQ s1105 1)), p2:(AND (EQ s367...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 13320 reset in 7791 ms.
Product exploration explored 100000 steps with 13330 reset in 6558 ms.
Computed a total of 245 stabilizing places and 27913 stable transitions
Computed a total of 245 stabilizing places and 27913 stable transitions
Detected a total of 245/1267 stabilizing places and 27913/122617 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/5 atomic propositions.
Knowledge obtained : [(AND (NOT p3) (NOT p0) (NOT p1) (NOT p4) (NOT p2)), (X (NOT (AND (NOT p1) p0 (NOT p4)))), (X (AND (NOT p0) (NOT p4))), (X (OR (AND (NOT p3) (NOT p4)) (AND (NOT p0) (NOT p4)))), (X (NOT (AND p3 (NOT p4)))), (X (NOT p3)), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND p0 (NOT p4)))), (X (AND (NOT p3) (NOT p4))), (X (AND (NOT p1) (NOT p0) (NOT p4))), (X (NOT p0)), (X (X (NOT (AND (NOT p1) p0 (NOT p4))))), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT p3))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p0 (NOT p4))))), (X (X (AND (NOT p3) (NOT p4)))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (AND (NOT p0) (NOT p4)))), true, (X (X (OR (AND (NOT p3) (NOT p4)) (AND (NOT p0) (NOT p4))))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (NOT (AND p3 (NOT p4))))), (X (X (AND (NOT p1) (NOT p0) (NOT p2)))), (X (X (AND (NOT p1) (NOT p0) (NOT p4)))), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 32 factoid took 3273 ms. Reduced automaton from 11 states, 38 edges and 5 AP (stutter sensitive) to 11 states, 38 edges and 5 AP (stutter sensitive).
Stuttering acceptance computed with spot in 542 ms :[(OR (NOT p3) (NOT p4)), (NOT p2), (NOT p4), false, (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), false, (AND (NOT p1) (NOT p2)), (NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1404 ms. (steps per millisecond=7 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 21) 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 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 21) 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 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 21) 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 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 21) 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 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=37 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 21) 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 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=35 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=37 ) properties (out of 21) seen :0
Interrupted probabilistic random walk after 5492 steps, run timeout after 3001 ms. (steps per millisecond=1 ) properties seen :{}
Probabilistic random walk after 5492 steps, saw 4053 distinct states, run finished after 3002 ms. (steps per millisecond=1 ) properties seen :0
Running SMT prover for 21 properties.
[2023-03-17 01:38:24] [INFO ] Flow matrix only has 94416 transitions (discarded 28201 similar events)
[2023-03-17 01:38:24] [INFO ] Invariant cache hit.
[2023-03-17 01:38:24] [INFO ] [Real]Absence check using 7 positive place invariants in 14 ms returned sat
[2023-03-17 01:38:49] [INFO ] After 24247ms SMT Verify possible using state equation in real domain returned unsat :0 sat :5 real:15
[2023-03-17 01:38:50] [INFO ] State equation strengthened by 3015 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 01:38:50] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-17 01:38:50] [INFO ] After 25755ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 21 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 8 out of 1267 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1267/1267 places, 122617/122617 transitions.
Drop transitions removed 2004 transitions
Reduce isomorphic transitions removed 2004 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2006 rules applied. Total rules applied 2006 place count 1267 transition count 120611
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 2009 place count 1265 transition count 120610
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 2009 place count 1265 transition count 120608
Deduced a syphon composed of 2 places in 61 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 2013 place count 1263 transition count 120608
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: 38
Deduced a syphon composed of 38 places in 55 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 2 with 76 rules applied. Total rules applied 2089 place count 1225 transition count 120570
Ensure Unique test removed 1981 transitions
Reduce isomorphic transitions removed 1981 transitions.
Iterating post reduction 2 with 1981 rules applied. Total rules applied 4070 place count 1225 transition count 118589
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 54 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 4074 place count 1223 transition count 118587
Drop transitions removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 4077 place count 1223 transition count 118584
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 5 places in 54 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 4087 place count 1218 transition count 118585
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 4091 place count 1218 transition count 118581
Free-agglomeration rule applied 39 times.
Iterating global reduction 5 with 39 rules applied. Total rules applied 4130 place count 1218 transition count 118542
Reduce places removed 39 places and 0 transitions.
Ensure Unique test removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Iterating post reduction 5 with 75 rules applied. Total rules applied 4205 place count 1179 transition count 118506
Free-agglomeration rule applied 1 times.
Iterating global reduction 6 with 1 rules applied. Total rules applied 4206 place count 1179 transition count 118505
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 4208 place count 1178 transition count 118504
Free-agglomeration rule applied 1 times.
Iterating global reduction 7 with 1 rules applied. Total rules applied 4209 place count 1178 transition count 118503
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 4210 place count 1177 transition count 118503
Free-agglomeration rule (complex) applied 73 times with reduction of 3094 identical transitions.
Iterating global reduction 8 with 73 rules applied. Total rules applied 4283 place count 1177 transition count 132452
Reduce places removed 73 places and 0 transitions.
Drop transitions removed 46 transitions
Ensure Unique test removed 2517 transitions
Reduce isomorphic transitions removed 2563 transitions.
Iterating post reduction 8 with 2636 rules applied. Total rules applied 6919 place count 1104 transition count 129889
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 6920 place count 1103 transition count 129888
Applied a total of 6920 rules in 8243 ms. Remains 1103 /1267 variables (removed 164) and now considering 129888/122617 (removed -7271) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8249 ms. Remains : 1103/1267 places, 129888/122617 transitions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 1196 ms. (steps per millisecond=8 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 21) 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 21) 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 21) 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 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 21) 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 21) 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 21) 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 21) 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 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 21) 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 21) 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 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 21) 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 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=32 ) properties (out of 21) 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 21) 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 21) 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 21) 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 21) seen :0
Interrupted probabilistic random walk after 8712 steps, run timeout after 3004 ms. (steps per millisecond=2 ) properties seen :{}
Probabilistic random walk after 8712 steps, saw 6571 distinct states, run finished after 3004 ms. (steps per millisecond=2 ) properties seen :0
Running SMT prover for 21 properties.
[2023-03-17 01:39:03] [INFO ] Flow matrix only has 102931 transitions (discarded 26957 similar events)
// Phase 1: matrix 102931 rows 1103 cols
[2023-03-17 01:39:03] [INFO ] Computed 7 place invariants in 576 ms
[2023-03-17 01:39:04] [INFO ] [Real]Absence check using 7 positive place invariants in 9 ms returned sat
[2023-03-17 01:39:28] [INFO ] After 25018ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:15
[2023-03-17 01:39:29] [INFO ] [Nat]Absence check using 7 positive place invariants in 12 ms returned sat
[2023-03-17 01:39:53] [INFO ] After 24272ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :20
[2023-03-17 01:39:54] [INFO ] State equation strengthened by 3544 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:350)
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 01:39:54] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-17 01:39:54] [INFO ] After 25762ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:15
Fused 21 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 8 out of 1103 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1103/1103 places, 129888/129888 transitions.
Applied a total of 0 rules in 602 ms. Remains 1103 /1103 variables (removed 0) and now considering 129888/129888 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 602 ms. Remains : 1103/1103 places, 129888/129888 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1103/1103 places, 129888/129888 transitions.
Applied a total of 0 rules in 592 ms. Remains 1103 /1103 variables (removed 0) and now considering 129888/129888 (removed 0) transitions.
[2023-03-17 01:39:55] [INFO ] Flow matrix only has 102931 transitions (discarded 26957 similar events)
[2023-03-17 01:39:55] [INFO ] Invariant cache hit.
[2023-03-17 01:40:03] [INFO ] Implicit Places using invariants in 8166 ms returned []
Implicit Place search using SMT only with invariants took 8171 ms to find 0 implicit places.
[2023-03-17 01:40:03] [INFO ] Flow matrix only has 102931 transitions (discarded 26957 similar events)
[2023-03-17 01:40:03] [INFO ] Invariant cache hit.
[2023-03-17 01:40:34] [INFO ] Performed 94669/129888 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-17 01:40:45] [INFO ] Dead Transitions using invariants and state equation in 41296 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 50077 ms. Remains : 1103/1103 places, 129888/129888 transitions.
Knowledge obtained : [(AND (NOT p3) (NOT p0) (NOT p1) (NOT p4) (NOT p2)), (X (NOT (AND (NOT p1) p0 (NOT p4)))), (X (AND (NOT p0) (NOT p4))), (X (OR (AND (NOT p3) (NOT p4)) (AND (NOT p0) (NOT p4)))), (X (NOT (AND p3 (NOT p4)))), (X (NOT p3)), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND p0 (NOT p4)))), (X (AND (NOT p3) (NOT p4))), (X (AND (NOT p1) (NOT p0) (NOT p4))), (X (NOT p0)), (X (X (NOT (AND (NOT p1) p0 (NOT p4))))), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT p3))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p0 (NOT p4))))), (X (X (AND (NOT p3) (NOT p4)))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (AND (NOT p0) (NOT p4)))), true, (X (X (OR (AND (NOT p3) (NOT p4)) (AND (NOT p0) (NOT p4))))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (NOT (AND p3 (NOT p4))))), (X (X (AND (NOT p1) (NOT p0) (NOT p2)))), (X (X (AND (NOT p1) (NOT p0) (NOT p4)))), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 32 factoid took 3310 ms. Reduced automaton from 11 states, 38 edges and 5 AP (stutter sensitive) to 11 states, 38 edges and 5 AP (stutter sensitive).
Stuttering acceptance computed with spot in 527 ms :[(OR (NOT p3) (NOT p4)), (NOT p2), (NOT p4), false, (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), false, (AND (NOT p1) (NOT p2)), (NOT p1)]
Stuttering acceptance computed with spot in 508 ms :[(OR (NOT p3) (NOT p4)), (NOT p2), (NOT p4), false, (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), false, (AND (NOT p1) (NOT p2)), (NOT p1)]
[2023-03-17 01:40:49] [INFO ] Flow matrix only has 94416 transitions (discarded 28201 similar events)
// Phase 1: matrix 94416 rows 1267 cols
[2023-03-17 01:40:50] [INFO ] Computed 7 place invariants in 454 ms
Could not prove EG (NOT p3)
[2023-03-17 01:41:05] [INFO ] Flow matrix only has 94416 transitions (discarded 28201 similar events)
[2023-03-17 01:41:06] [INFO ] Invariant cache hit.
Could not prove EG (NOT p4)
Support contains 8 out of 1267 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1267/1267 places, 122617/122617 transitions.
Applied a total of 0 rules in 165 ms. Remains 1267 /1267 variables (removed 0) and now considering 122617/122617 (removed 0) transitions.
[2023-03-17 01:41:21] [INFO ] Flow matrix only has 94416 transitions (discarded 28201 similar events)
[2023-03-17 01:41:21] [INFO ] Invariant cache hit.
[2023-03-17 01:41:29] [INFO ] Implicit Places using invariants in 7873 ms returned []
Implicit Place search using SMT only with invariants took 7875 ms to find 0 implicit places.
[2023-03-17 01:41:29] [INFO ] Flow matrix only has 94416 transitions (discarded 28201 similar events)
[2023-03-17 01:41:29] [INFO ] Invariant cache hit.
[2023-03-17 01:41:59] [INFO ] Performed 91583/122617 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-17 01:42:09] [INFO ] Dead Transitions using invariants and state equation in 40371 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 48416 ms. Remains : 1267/1267 places, 122617/122617 transitions.
Computed a total of 245 stabilizing places and 27913 stable transitions
Computed a total of 245 stabilizing places and 27913 stable transitions
Detected a total of 245/1267 stabilizing places and 27913/122617 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/5 atomic propositions.
Knowledge obtained : [(AND (NOT p3) (NOT p0) (NOT p1) (NOT p4) (NOT p2)), (X (AND (NOT p0) (NOT p4))), (X (OR (AND (NOT p3) (NOT p4)) (AND (NOT p0) (NOT p4)))), (X (NOT (AND p3 (NOT p4)))), (X (NOT p3)), (X (NOT (AND p0 (NOT p1) (NOT p4)))), (X (NOT (AND p0 (NOT p4)))), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p3) (NOT p4))), (X (NOT p0)), (X (AND (NOT p0) (NOT p1))), (X (AND (NOT p0) (NOT p1) (NOT p4))), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT p3))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p4))))), (X (X (NOT (AND p0 (NOT p4))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p3) (NOT p4)))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (AND (NOT p0) (NOT p4)))), true, (X (X (OR (AND (NOT p3) (NOT p4)) (AND (NOT p0) (NOT p4))))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND p3 (NOT p4))))), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) (NOT p1) (NOT p4)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 32 factoid took 3395 ms. Reduced automaton from 11 states, 38 edges and 5 AP (stutter sensitive) to 11 states, 38 edges and 5 AP (stutter sensitive).
Stuttering acceptance computed with spot in 538 ms :[(OR (NOT p3) (NOT p4)), (NOT p2), (NOT p4), false, (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), false, (AND (NOT p1) (NOT p2)), (NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1418 ms. (steps per millisecond=7 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 21) 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 21) 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 21) 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 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 21) 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 21) 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 21) 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 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 21) 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 21) 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 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 21) 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 21) 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 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=35 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=32 ) properties (out of 21) seen :0
Interrupted probabilistic random walk after 6570 steps, run timeout after 3003 ms. (steps per millisecond=2 ) properties seen :{}
Probabilistic random walk after 6570 steps, saw 4905 distinct states, run finished after 3003 ms. (steps per millisecond=2 ) properties seen :0
Running SMT prover for 21 properties.
[2023-03-17 01:42:19] [INFO ] Flow matrix only has 94416 transitions (discarded 28201 similar events)
[2023-03-17 01:42:19] [INFO ] Invariant cache hit.
[2023-03-17 01:42:19] [INFO ] [Real]Absence check using 7 positive place invariants in 17 ms returned sat
[2023-03-17 01:42:44] [INFO ] After 25023ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:15
[2023-03-17 01:42:44] [INFO ] [Nat]Absence check using 7 positive place invariants in 20 ms returned sat
[2023-03-17 01:43:09] [INFO ] After 24103ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :20
[2023-03-17 01:43:10] [INFO ] State equation strengthened by 3015 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:350)
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 01:43:10] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-17 01:43:10] [INFO ] After 25827ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:15
Fused 21 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 8 out of 1267 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1267/1267 places, 122617/122617 transitions.
Drop transitions removed 2004 transitions
Reduce isomorphic transitions removed 2004 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2006 rules applied. Total rules applied 2006 place count 1267 transition count 120611
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 2009 place count 1265 transition count 120610
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 2009 place count 1265 transition count 120608
Deduced a syphon composed of 2 places in 67 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 2013 place count 1263 transition count 120608
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: 38
Deduced a syphon composed of 38 places in 57 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 2 with 76 rules applied. Total rules applied 2089 place count 1225 transition count 120570
Ensure Unique test removed 1981 transitions
Reduce isomorphic transitions removed 1981 transitions.
Iterating post reduction 2 with 1981 rules applied. Total rules applied 4070 place count 1225 transition count 118589
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 55 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 4074 place count 1223 transition count 118587
Drop transitions removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 4077 place count 1223 transition count 118584
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 5 places in 65 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 4087 place count 1218 transition count 118585
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 4091 place count 1218 transition count 118581
Free-agglomeration rule applied 39 times.
Iterating global reduction 5 with 39 rules applied. Total rules applied 4130 place count 1218 transition count 118542
Reduce places removed 39 places and 0 transitions.
Ensure Unique test removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Iterating post reduction 5 with 75 rules applied. Total rules applied 4205 place count 1179 transition count 118506
Free-agglomeration rule applied 1 times.
Iterating global reduction 6 with 1 rules applied. Total rules applied 4206 place count 1179 transition count 118505
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 4208 place count 1178 transition count 118504
Free-agglomeration rule applied 1 times.
Iterating global reduction 7 with 1 rules applied. Total rules applied 4209 place count 1178 transition count 118503
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 4210 place count 1177 transition count 118503
Free-agglomeration rule (complex) applied 73 times with reduction of 3094 identical transitions.
Iterating global reduction 8 with 73 rules applied. Total rules applied 4283 place count 1177 transition count 132452
Reduce places removed 73 places and 0 transitions.
Drop transitions removed 46 transitions
Ensure Unique test removed 2517 transitions
Reduce isomorphic transitions removed 2563 transitions.
Iterating post reduction 8 with 2636 rules applied. Total rules applied 6919 place count 1104 transition count 129889
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 6920 place count 1103 transition count 129888
Applied a total of 6920 rules in 8994 ms. Remains 1103 /1267 variables (removed 164) and now considering 129888/122617 (removed -7271) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8998 ms. Remains : 1103/1267 places, 129888/122617 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1301 ms. (steps per millisecond=7 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 21) 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 21) 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 21) 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 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 21) 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 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 21) 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 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 21) 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 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 21) seen :0
Interrupted probabilistic random walk after 7582 steps, run timeout after 3004 ms. (steps per millisecond=2 ) properties seen :{}
Probabilistic random walk after 7582 steps, saw 5831 distinct states, run finished after 3004 ms. (steps per millisecond=2 ) properties seen :0
Running SMT prover for 21 properties.
[2023-03-17 01:43:24] [INFO ] Flow matrix only has 102931 transitions (discarded 26957 similar events)
// Phase 1: matrix 102931 rows 1103 cols
[2023-03-17 01:43:24] [INFO ] Computed 7 place invariants in 525 ms
[2023-03-17 01:43:25] [INFO ] [Real]Absence check using 7 positive place invariants in 10 ms returned sat
[2023-03-17 01:43:49] [INFO ] After 24459ms SMT Verify possible using state equation in real domain returned unsat :0 sat :5 real:15
[2023-03-17 01:43:50] [INFO ] State equation strengthened by 3544 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 01:43:50] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-17 01:43:50] [INFO ] After 25720ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 21 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 8 out of 1103 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1103/1103 places, 129888/129888 transitions.
Applied a total of 0 rules in 680 ms. Remains 1103 /1103 variables (removed 0) and now considering 129888/129888 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 680 ms. Remains : 1103/1103 places, 129888/129888 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1103/1103 places, 129888/129888 transitions.
Applied a total of 0 rules in 665 ms. Remains 1103 /1103 variables (removed 0) and now considering 129888/129888 (removed 0) transitions.
[2023-03-17 01:43:51] [INFO ] Flow matrix only has 102931 transitions (discarded 26957 similar events)
[2023-03-17 01:43:51] [INFO ] Invariant cache hit.
[2023-03-17 01:44:00] [INFO ] Implicit Places using invariants in 8283 ms returned []
Implicit Place search using SMT only with invariants took 8294 ms to find 0 implicit places.
[2023-03-17 01:44:00] [INFO ] Flow matrix only has 102931 transitions (discarded 26957 similar events)
[2023-03-17 01:44:00] [INFO ] Invariant cache hit.
[2023-03-17 01:44:30] [INFO ] Performed 95672/129888 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-17 01:44:40] [INFO ] Dead Transitions using invariants and state equation in 40549 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 49522 ms. Remains : 1103/1103 places, 129888/129888 transitions.
Knowledge obtained : [(AND (NOT p3) (NOT p0) (NOT p1) (NOT p4) (NOT p2)), (X (AND (NOT p0) (NOT p4))), (X (OR (AND (NOT p3) (NOT p4)) (AND (NOT p0) (NOT p4)))), (X (NOT (AND p3 (NOT p4)))), (X (NOT p3)), (X (NOT (AND p0 (NOT p1) (NOT p4)))), (X (NOT (AND p0 (NOT p4)))), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p3) (NOT p4))), (X (NOT p0)), (X (AND (NOT p0) (NOT p1))), (X (AND (NOT p0) (NOT p1) (NOT p4))), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT p3))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p4))))), (X (X (NOT (AND p0 (NOT p4))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p3) (NOT p4)))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (AND (NOT p0) (NOT p4)))), true, (X (X (OR (AND (NOT p3) (NOT p4)) (AND (NOT p0) (NOT p4))))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND p3 (NOT p4))))), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) (NOT p1) (NOT p4)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 32 factoid took 3405 ms. Reduced automaton from 11 states, 38 edges and 5 AP (stutter sensitive) to 11 states, 38 edges and 5 AP (stutter sensitive).
Stuttering acceptance computed with spot in 519 ms :[(OR (NOT p3) (NOT p4)), (NOT p2), (NOT p4), false, (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), false, (AND (NOT p1) (NOT p2)), (NOT p1)]
Stuttering acceptance computed with spot in 507 ms :[(OR (NOT p3) (NOT p4)), (NOT p2), (NOT p4), false, (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), false, (AND (NOT p1) (NOT p2)), (NOT p1)]
[2023-03-17 01:44:45] [INFO ] Flow matrix only has 94416 transitions (discarded 28201 similar events)
// Phase 1: matrix 94416 rows 1267 cols
[2023-03-17 01:44:46] [INFO ] Computed 7 place invariants in 388 ms
Could not prove EG (NOT p3)
[2023-03-17 01:45:01] [INFO ] Flow matrix only has 94416 transitions (discarded 28201 similar events)
[2023-03-17 01:45:01] [INFO ] Invariant cache hit.
Could not prove EG (NOT p4)
Stuttering acceptance computed with spot in 529 ms :[(OR (NOT p3) (NOT p4)), (NOT p2), (NOT p4), false, (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), false, (AND (NOT p1) (NOT p2)), (NOT p1)]
Product exploration explored 100000 steps with 13315 reset in 6560 ms.
Product exploration explored 100000 steps with 13376 reset in 6313 ms.
Applying partial POR strategy [false, false, false, false, false, false, true, false, false, true, true]
Stuttering acceptance computed with spot in 516 ms :[(OR (NOT p3) (NOT p4)), (NOT p2), (NOT p4), false, (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), false, (AND (NOT p1) (NOT p2)), (NOT p1)]
Support contains 8 out of 1267 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1267/1267 places, 122617/122617 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 1267 transition count 122617
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 1267 transition count 122616
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 42 places in 57 ms
Iterating global reduction 2 with 40 rules applied. Total rules applied 43 place count 1267 transition count 122623
Ensure Unique test removed 1982 transitions
Reduce isomorphic transitions removed 1982 transitions.
Iterating post reduction 2 with 1982 rules applied. Total rules applied 2025 place count 1267 transition count 120641
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 44 places in 56 ms
Iterating global reduction 3 with 2 rules applied. Total rules applied 2027 place count 1267 transition count 120641
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2028 place count 1267 transition count 120640
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 2030 place count 1265 transition count 120638
Deduced a syphon composed of 42 places in 58 ms
Iterating global reduction 4 with 2 rules applied. Total rules applied 2032 place count 1265 transition count 120638
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -14
Deduced a syphon composed of 47 places in 57 ms
Iterating global reduction 4 with 5 rules applied. Total rules applied 2037 place count 1265 transition count 120652
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 2042 place count 1265 transition count 120647
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 2043 place count 1264 transition count 120644
Deduced a syphon composed of 46 places in 57 ms
Iterating global reduction 5 with 1 rules applied. Total rules applied 2044 place count 1264 transition count 120644
Deduced a syphon composed of 46 places in 54 ms
Applied a total of 2044 rules in 3378 ms. Remains 1264 /1267 variables (removed 3) and now considering 120644/122617 (removed 1973) transitions.
[2023-03-17 01:45:34] [INFO ] Flow matrix only has 92428 transitions (discarded 28216 similar events)
// Phase 1: matrix 92428 rows 1264 cols
[2023-03-17 01:45:34] [INFO ] Computed 7 place invariants in 364 ms
[2023-03-17 01:46:04] [INFO ] Performed 91885/120644 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-17 01:46:13] [INFO ] Dead Transitions using invariants and state equation in 39527 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1264/1267 places, 120644/122617 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 42912 ms. Remains : 1264/1267 places, 120644/122617 transitions.
Support contains 8 out of 1267 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1267/1267 places, 122617/122617 transitions.
Applied a total of 0 rules in 189 ms. Remains 1267 /1267 variables (removed 0) and now considering 122617/122617 (removed 0) transitions.
[2023-03-17 01:46:13] [INFO ] Flow matrix only has 94416 transitions (discarded 28201 similar events)
// Phase 1: matrix 94416 rows 1267 cols
[2023-03-17 01:46:14] [INFO ] Computed 7 place invariants in 405 ms
[2023-03-17 01:46:22] [INFO ] Implicit Places using invariants in 8425 ms returned []
Implicit Place search using SMT only with invariants took 8426 ms to find 0 implicit places.
[2023-03-17 01:46:22] [INFO ] Flow matrix only has 94416 transitions (discarded 28201 similar events)
[2023-03-17 01:46:22] [INFO ] Invariant cache hit.
[2023-03-17 01:46:52] [INFO ] Performed 94801/122617 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-17 01:47:01] [INFO ] Dead Transitions using invariants and state equation in 39391 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 48017 ms. Remains : 1267/1267 places, 122617/122617 transitions.
Treatment of property RERS2020-PT-pb102-LTLFireability-02 finished in 593653 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 1267 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1267/1267 places, 122617/122617 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 1266 transition count 122614
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 5 place count 1264 transition count 122613
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 5 place count 1264 transition count 122611
Deduced a syphon composed of 2 places in 61 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 9 place count 1262 transition count 122611
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: 38
Deduced a syphon composed of 38 places in 56 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 2 with 76 rules applied. Total rules applied 85 place count 1224 transition count 122573
Ensure Unique test removed 1981 transitions
Reduce isomorphic transitions removed 1981 transitions.
Iterating post reduction 2 with 1981 rules applied. Total rules applied 2066 place count 1224 transition count 120592
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 54 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 2070 place count 1222 transition count 120590
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2071 place count 1222 transition count 120589
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 5 places in 55 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 2081 place count 1217 transition count 120590
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 2085 place count 1217 transition count 120586
Applied a total of 2085 rules in 3725 ms. Remains 1217 /1267 variables (removed 50) and now considering 120586/122617 (removed 2031) transitions.
[2023-03-17 01:47:10] [INFO ] Flow matrix only has 92370 transitions (discarded 28216 similar events)
// Phase 1: matrix 92370 rows 1217 cols
[2023-03-17 01:47:10] [INFO ] Computed 7 place invariants in 473 ms
[2023-03-17 01:47:18] [INFO ] Implicit Places using invariants in 8340 ms returned []
Implicit Place search using SMT only with invariants took 8342 ms to find 0 implicit places.
[2023-03-17 01:47:18] [INFO ] Flow matrix only has 92370 transitions (discarded 28216 similar events)
[2023-03-17 01:47:18] [INFO ] Invariant cache hit.
[2023-03-17 01:47:48] [INFO ] Performed 99998/120586 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-17 01:47:54] [INFO ] Dead Transitions using invariants and state equation in 36278 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1217/1267 places, 120586/122617 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 48351 ms. Remains : 1217/1267 places, 120586/122617 transitions.
Stuttering acceptance computed with spot in 96 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : RERS2020-PT-pb102-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s61 1) (EQ s1004 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 66 steps with 0 reset in 11 ms.
FORMULA RERS2020-PT-pb102-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RERS2020-PT-pb102-LTLFireability-03 finished in 48664 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0) U (!p1&&X(p0))))'
Support contains 4 out of 1267 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1267/1267 places, 122617/122617 transitions.
Applied a total of 0 rules in 205 ms. Remains 1267 /1267 variables (removed 0) and now considering 122617/122617 (removed 0) transitions.
[2023-03-17 01:47:55] [INFO ] Flow matrix only has 94416 transitions (discarded 28201 similar events)
// Phase 1: matrix 94416 rows 1267 cols
[2023-03-17 01:47:55] [INFO ] Computed 7 place invariants in 398 ms
[2023-03-17 01:48:03] [INFO ] Implicit Places using invariants in 8606 ms returned []
Implicit Place search using SMT only with invariants took 8607 ms to find 0 implicit places.
[2023-03-17 01:48:03] [INFO ] Flow matrix only has 94416 transitions (discarded 28201 similar events)
[2023-03-17 01:48:03] [INFO ] Invariant cache hit.
[2023-03-17 01:48:34] [INFO ] Performed 90688/122617 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-17 01:48:44] [INFO ] Dead Transitions using invariants and state equation in 40730 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 49546 ms. Remains : 1267/1267 places, 122617/122617 transitions.
Stuttering acceptance computed with spot in 147 ms :[(OR (NOT p0) p1), true, (NOT p0), (NOT p0)]
Running random walk in product with property : RERS2020-PT-pb102-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(AND p1 p0), acceptance={0} source=0 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={0} source=0 dest: 1}, { cond=(NOT p1), acceptance={0} source=0 dest: 2}, { cond=(AND p1 p0), acceptance={0} source=0 dest: 3}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}], [{ cond=(NOT p0), acceptance={} source=3 dest: 1}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(AND (EQ s621 1) (EQ s1034 1)), p0:(AND (EQ s1181 1) (EQ s1258 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][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 4 ms.
FORMULA RERS2020-PT-pb102-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RERS2020-PT-pb102-LTLFireability-04 finished in 49912 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||X(((X(p1)&&F(!p2))||X(G(p1)))))))'
Support contains 6 out of 1267 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1267/1267 places, 122617/122617 transitions.
Applied a total of 0 rules in 226 ms. Remains 1267 /1267 variables (removed 0) and now considering 122617/122617 (removed 0) transitions.
[2023-03-17 01:48:45] [INFO ] Flow matrix only has 94416 transitions (discarded 28201 similar events)
[2023-03-17 01:48:45] [INFO ] Invariant cache hit.
[2023-03-17 01:48:53] [INFO ] Implicit Places using invariants in 7893 ms returned []
Implicit Place search using SMT only with invariants took 7893 ms to find 0 implicit places.
[2023-03-17 01:48:53] [INFO ] Flow matrix only has 94416 transitions (discarded 28201 similar events)
[2023-03-17 01:48:53] [INFO ] Invariant cache hit.
[2023-03-17 01:49:23] [INFO ] Performed 91385/122617 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-17 01:49:33] [INFO ] Dead Transitions using invariants and state equation in 39959 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 48084 ms. Remains : 1267/1267 places, 122617/122617 transitions.
Stuttering acceptance computed with spot in 522 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), (AND p2 (NOT p1)), (AND (NOT p0) (NOT p1)), (AND p2 (NOT p1) (NOT p0)), true, p2, (NOT p0), (AND p2 (NOT p0))]
Running random walk in product with property : RERS2020-PT-pb102-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 4}, { cond=p2, acceptance={} source=2 dest: 5}], [{ cond=(NOT p0), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p0) p2), acceptance={} source=3 dest: 5}, { cond=p0, acceptance={} source=3 dest: 6}, { cond=(AND p0 p2), acceptance={} source=3 dest: 7}], [{ cond=(NOT p1), acceptance={} source=4 dest: 8}], [{ cond=(AND p2 p1), acceptance={} source=5 dest: 5}, { cond=(AND p2 (NOT p1)), acceptance={} source=5 dest: 9}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=6 dest: 8}, { cond=(AND p0 (NOT p1)), acceptance={} source=6 dest: 10}], [{ cond=(AND (NOT p0) p2 p1), acceptance={} source=7 dest: 5}, { cond=(AND p0 p2 p1), acceptance={} source=7 dest: 7}, { cond=(AND (NOT p0) p2 (NOT p1)), acceptance={} source=7 dest: 9}, { cond=(AND p0 p2 (NOT p1)), acceptance={} source=7 dest: 11}], [{ cond=true, acceptance={0} source=8 dest: 8}], [{ cond=p2, acceptance={0} source=9 dest: 9}], [{ cond=(NOT p0), acceptance={} source=10 dest: 8}, { cond=p0, acceptance={} source=10 dest: 10}], [{ cond=(AND (NOT p0) p2), acceptance={} source=11 dest: 9}, { cond=(AND p0 p2), acceptance={} source=11 dest: 11}]], initial=0, aps=[p0:(AND (EQ s319 1) (EQ s669 1)), p2:(AND (EQ s325 1) (EQ s1201 1)), p1:(AND (EQ s80 1) (EQ s779 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 3 ms.
FORMULA RERS2020-PT-pb102-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RERS2020-PT-pb102-LTLFireability-05 finished in 48827 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(X(X(F((p0&&G(p1))))))))'
Support contains 4 out of 1267 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1267/1267 places, 122617/122617 transitions.
Applied a total of 0 rules in 187 ms. Remains 1267 /1267 variables (removed 0) and now considering 122617/122617 (removed 0) transitions.
[2023-03-17 01:49:34] [INFO ] Flow matrix only has 94416 transitions (discarded 28201 similar events)
[2023-03-17 01:49:34] [INFO ] Invariant cache hit.
[2023-03-17 01:49:41] [INFO ] Implicit Places using invariants in 7862 ms returned []
Implicit Place search using SMT only with invariants took 7863 ms to find 0 implicit places.
[2023-03-17 01:49:41] [INFO ] Flow matrix only has 94416 transitions (discarded 28201 similar events)
[2023-03-17 01:49:41] [INFO ] Invariant cache hit.
[2023-03-17 01:50:12] [INFO ] Performed 94466/122617 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-17 01:50:21] [INFO ] Dead Transitions using invariants and state equation in 39212 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 47266 ms. Remains : 1267/1267 places, 122617/122617 transitions.
Stuttering acceptance computed with spot in 605 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : RERS2020-PT-pb102-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={0} source=4 dest: 4}, { cond=(AND p0 p1), acceptance={} source=4 dest: 5}], [{ cond=(NOT p1), acceptance={0} source=5 dest: 4}, { cond=p1, acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(OR (EQ s486 0) (EQ s724 0)), p1:(OR (EQ s649 0) (EQ s751 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 8679 ms.
Product exploration explored 100000 steps with 1 reset in 8659 ms.
Computed a total of 245 stabilizing places and 27913 stable transitions
Computed a total of 245 stabilizing places and 27913 stable transitions
Knowledge obtained : [(AND p0 p1), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 109 ms. Reduced automaton from 6 states, 8 edges and 2 AP (stutter sensitive) to 6 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 250 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1203 ms. (steps per millisecond=8 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 172 ms. (steps per millisecond=58 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 168 ms. (steps per millisecond=59 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 161 ms. (steps per millisecond=62 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 5793 steps, run timeout after 3002 ms. (steps per millisecond=1 ) properties seen :{}
Probabilistic random walk after 5793 steps, saw 4296 distinct states, run finished after 3003 ms. (steps per millisecond=1 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-17 01:50:45] [INFO ] Flow matrix only has 94416 transitions (discarded 28201 similar events)
[2023-03-17 01:50:45] [INFO ] Invariant cache hit.
[2023-03-17 01:50:45] [INFO ] After 184ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-17 01:50:45] [INFO ] [Nat]Absence check using 7 positive place invariants in 12 ms returned sat
[2023-03-17 01:51:10] [INFO ] After 24764ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-17 01:51:10] [INFO ] State equation strengthened by 3015 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:350)
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 01:51:10] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-17 01:51:10] [INFO ] After 25677ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:3
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 1267 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1267/1267 places, 122617/122617 transitions.
Drop transitions removed 2004 transitions
Reduce isomorphic transitions removed 2004 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2006 rules applied. Total rules applied 2006 place count 1267 transition count 120611
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 2009 place count 1265 transition count 120610
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 2009 place count 1265 transition count 120608
Deduced a syphon composed of 2 places in 62 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 2013 place count 1263 transition count 120608
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: 38
Deduced a syphon composed of 38 places in 53 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 2 with 76 rules applied. Total rules applied 2089 place count 1225 transition count 120570
Ensure Unique test removed 1981 transitions
Reduce isomorphic transitions removed 1981 transitions.
Iterating post reduction 2 with 1981 rules applied. Total rules applied 4070 place count 1225 transition count 118589
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 55 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 4074 place count 1223 transition count 118587
Drop transitions removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 4077 place count 1223 transition count 118584
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 5 places in 52 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 4087 place count 1218 transition count 118585
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 4091 place count 1218 transition count 118581
Free-agglomeration rule applied 39 times.
Iterating global reduction 5 with 39 rules applied. Total rules applied 4130 place count 1218 transition count 118542
Reduce places removed 39 places and 0 transitions.
Ensure Unique test removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Iterating post reduction 5 with 75 rules applied. Total rules applied 4205 place count 1179 transition count 118506
Free-agglomeration rule applied 1 times.
Iterating global reduction 6 with 1 rules applied. Total rules applied 4206 place count 1179 transition count 118505
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 4208 place count 1178 transition count 118504
Free-agglomeration rule applied 1 times.
Iterating global reduction 7 with 1 rules applied. Total rules applied 4209 place count 1178 transition count 118503
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 4210 place count 1177 transition count 118503
Free-agglomeration rule (complex) applied 75 times with reduction of 4414 identical transitions.
Iterating global reduction 8 with 75 rules applied. Total rules applied 4285 place count 1177 transition count 134713
Reduce places removed 75 places and 0 transitions.
Drop transitions removed 48 transitions
Ensure Unique test removed 3410 transitions
Reduce isomorphic transitions removed 3458 transitions.
Iterating post reduction 8 with 3533 rules applied. Total rules applied 7818 place count 1102 transition count 131255
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 7819 place count 1101 transition count 131254
Applied a total of 7819 rules in 7791 ms. Remains 1101 /1267 variables (removed 166) and now considering 131254/122617 (removed -8637) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7795 ms. Remains : 1101/1267 places, 131254/122617 transitions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 1093 ms. (steps per millisecond=9 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 147 ms. (steps per millisecond=68 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 158 ms. (steps per millisecond=63 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 180 ms. (steps per millisecond=55 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 7801 steps, run timeout after 3003 ms. (steps per millisecond=2 ) properties seen :{}
Probabilistic random walk after 7801 steps, saw 5972 distinct states, run finished after 3003 ms. (steps per millisecond=2 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-17 01:51:23] [INFO ] Flow matrix only has 104268 transitions (discarded 26986 similar events)
// Phase 1: matrix 104268 rows 1101 cols
[2023-03-17 01:51:24] [INFO ] Computed 7 place invariants in 525 ms
[2023-03-17 01:51:24] [INFO ] After 161ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-17 01:51:24] [INFO ] [Nat]Absence check using 7 positive place invariants in 9 ms returned sat
[2023-03-17 01:51:49] [INFO ] After 24802ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-17 01:51:49] [INFO ] State equation strengthened by 3605 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:350)
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 01:51:49] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-17 01:51:49] [INFO ] After 25684ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:3
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 1101 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1101/1101 places, 131254/131254 transitions.
Applied a total of 0 rules in 610 ms. Remains 1101 /1101 variables (removed 0) and now considering 131254/131254 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 610 ms. Remains : 1101/1101 places, 131254/131254 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1101/1101 places, 131254/131254 transitions.
Applied a total of 0 rules in 617 ms. Remains 1101 /1101 variables (removed 0) and now considering 131254/131254 (removed 0) transitions.
[2023-03-17 01:51:51] [INFO ] Flow matrix only has 104268 transitions (discarded 26986 similar events)
[2023-03-17 01:51:51] [INFO ] Invariant cache hit.
[2023-03-17 01:51:58] [INFO ] Implicit Places using invariants in 7628 ms returned []
Implicit Place search using SMT only with invariants took 7628 ms to find 0 implicit places.
[2023-03-17 01:51:58] [INFO ] Flow matrix only has 104268 transitions (discarded 26986 similar events)
[2023-03-17 01:51:58] [INFO ] Invariant cache hit.
[2023-03-17 01:52:28] [INFO ] Performed 95501/131254 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-17 01:52:39] [INFO ] Dead Transitions using invariants and state equation in 40802 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 49060 ms. Remains : 1101/1101 places, 131254/131254 transitions.
Knowledge obtained : [(AND p0 p1), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 987 ms. Reduced automaton from 6 states, 8 edges and 2 AP (stutter sensitive) to 6 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 248 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Stuttering acceptance computed with spot in 249 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Support contains 4 out of 1267 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1267/1267 places, 122617/122617 transitions.
Applied a total of 0 rules in 204 ms. Remains 1267 /1267 variables (removed 0) and now considering 122617/122617 (removed 0) transitions.
[2023-03-17 01:52:41] [INFO ] Flow matrix only has 94416 transitions (discarded 28201 similar events)
// Phase 1: matrix 94416 rows 1267 cols
[2023-03-17 01:52:41] [INFO ] Computed 7 place invariants in 395 ms
[2023-03-17 01:52:49] [INFO ] Implicit Places using invariants in 8517 ms returned []
Implicit Place search using SMT only with invariants took 8524 ms to find 0 implicit places.
[2023-03-17 01:52:49] [INFO ] Flow matrix only has 94416 transitions (discarded 28201 similar events)
[2023-03-17 01:52:49] [INFO ] Invariant cache hit.
[2023-03-17 01:53:20] [INFO ] Performed 99082/122617 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-17 01:53:27] [INFO ] Dead Transitions using invariants and state equation in 37925 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 46659 ms. Remains : 1267/1267 places, 122617/122617 transitions.
Computed a total of 245 stabilizing places and 27913 stable transitions
Computed a total of 245 stabilizing places and 27913 stable transitions
Knowledge obtained : [(AND p0 p1), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 86 ms. Reduced automaton from 6 states, 8 edges and 2 AP (stutter sensitive) to 6 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 256 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1422 ms. (steps per millisecond=7 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 165 ms. (steps per millisecond=60 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 168 ms. (steps per millisecond=59 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 163 ms. (steps per millisecond=61 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 7283 steps, run timeout after 3003 ms. (steps per millisecond=2 ) properties seen :{}
Probabilistic random walk after 7283 steps, saw 5428 distinct states, run finished after 3003 ms. (steps per millisecond=2 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-17 01:53:34] [INFO ] Flow matrix only has 94416 transitions (discarded 28201 similar events)
[2023-03-17 01:53:34] [INFO ] Invariant cache hit.
[2023-03-17 01:53:34] [INFO ] After 191ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-17 01:53:34] [INFO ] [Nat]Absence check using 7 positive place invariants in 11 ms returned sat
[2023-03-17 01:53:59] [INFO ] After 24776ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-17 01:53:59] [INFO ] State equation strengthened by 3015 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:350)
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 01:53:59] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-17 01:53:59] [INFO ] After 25731ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:3
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 1267 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1267/1267 places, 122617/122617 transitions.
Drop transitions removed 2004 transitions
Reduce isomorphic transitions removed 2004 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2006 rules applied. Total rules applied 2006 place count 1267 transition count 120611
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 2009 place count 1265 transition count 120610
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 2009 place count 1265 transition count 120608
Deduced a syphon composed of 2 places in 53 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 2013 place count 1263 transition count 120608
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: 38
Deduced a syphon composed of 38 places in 47 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 2 with 76 rules applied. Total rules applied 2089 place count 1225 transition count 120570
Ensure Unique test removed 1981 transitions
Reduce isomorphic transitions removed 1981 transitions.
Iterating post reduction 2 with 1981 rules applied. Total rules applied 4070 place count 1225 transition count 118589
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 52 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 4074 place count 1223 transition count 118587
Drop transitions removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 4077 place count 1223 transition count 118584
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 5 places in 56 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 4087 place count 1218 transition count 118585
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 4091 place count 1218 transition count 118581
Free-agglomeration rule applied 39 times.
Iterating global reduction 5 with 39 rules applied. Total rules applied 4130 place count 1218 transition count 118542
Reduce places removed 39 places and 0 transitions.
Ensure Unique test removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Iterating post reduction 5 with 75 rules applied. Total rules applied 4205 place count 1179 transition count 118506
Free-agglomeration rule applied 1 times.
Iterating global reduction 6 with 1 rules applied. Total rules applied 4206 place count 1179 transition count 118505
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 4208 place count 1178 transition count 118504
Free-agglomeration rule applied 1 times.
Iterating global reduction 7 with 1 rules applied. Total rules applied 4209 place count 1178 transition count 118503
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 4210 place count 1177 transition count 118503
Free-agglomeration rule (complex) applied 75 times with reduction of 4414 identical transitions.
Iterating global reduction 8 with 75 rules applied. Total rules applied 4285 place count 1177 transition count 134713
Reduce places removed 75 places and 0 transitions.
Drop transitions removed 48 transitions
Ensure Unique test removed 3410 transitions
Reduce isomorphic transitions removed 3458 transitions.
Iterating post reduction 8 with 3533 rules applied. Total rules applied 7818 place count 1102 transition count 131255
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 7819 place count 1101 transition count 131254
Applied a total of 7819 rules in 7675 ms. Remains 1101 /1267 variables (removed 166) and now considering 131254/122617 (removed -8637) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7679 ms. Remains : 1101/1267 places, 131254/122617 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1275 ms. (steps per millisecond=7 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 187 ms. (steps per millisecond=53 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 185 ms. (steps per millisecond=54 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 181 ms. (steps per millisecond=55 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 7230 steps, run timeout after 3003 ms. (steps per millisecond=2 ) properties seen :{}
Probabilistic random walk after 7230 steps, saw 5589 distinct states, run finished after 3003 ms. (steps per millisecond=2 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-17 01:54:12] [INFO ] Flow matrix only has 104268 transitions (discarded 26986 similar events)
// Phase 1: matrix 104268 rows 1101 cols
[2023-03-17 01:54:13] [INFO ] Computed 7 place invariants in 626 ms
[2023-03-17 01:54:13] [INFO ] After 163ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-17 01:54:13] [INFO ] [Nat]Absence check using 7 positive place invariants in 10 ms returned sat
[2023-03-17 01:54:38] [INFO ] After 25013ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 4 out of 1101 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1101/1101 places, 131254/131254 transitions.
Applied a total of 0 rules in 695 ms. Remains 1101 /1101 variables (removed 0) and now considering 131254/131254 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 696 ms. Remains : 1101/1101 places, 131254/131254 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1101/1101 places, 131254/131254 transitions.
Applied a total of 0 rules in 699 ms. Remains 1101 /1101 variables (removed 0) and now considering 131254/131254 (removed 0) transitions.
[2023-03-17 01:54:39] [INFO ] Flow matrix only has 104268 transitions (discarded 26986 similar events)
[2023-03-17 01:54:39] [INFO ] Invariant cache hit.
[2023-03-17 01:54:47] [INFO ] Implicit Places using invariants in 8088 ms returned []
Implicit Place search using SMT only with invariants took 8092 ms to find 0 implicit places.
[2023-03-17 01:54:48] [INFO ] Flow matrix only has 104268 transitions (discarded 26986 similar events)
[2023-03-17 01:54:48] [INFO ] Invariant cache hit.
[2023-03-17 01:55:18] [INFO ] Performed 97638/131254 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-17 01:55:28] [INFO ] Dead Transitions using invariants and state equation in 40320 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 49127 ms. Remains : 1101/1101 places, 131254/131254 transitions.
Knowledge obtained : [(AND p0 p1), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 86 ms. Reduced automaton from 6 states, 8 edges and 2 AP (stutter sensitive) to 6 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 227 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Stuttering acceptance computed with spot in 240 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Stuttering acceptance computed with spot in 246 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Product exploration explored 100000 steps with 1 reset in 9910 ms.
Product exploration explored 100000 steps with 0 reset in 7054 ms.
Applying partial POR strategy [false, false, false, false, true, true]
Stuttering acceptance computed with spot in 335 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Support contains 4 out of 1267 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1267/1267 places, 122617/122617 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 1267 transition count 122617
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 1267 transition count 122616
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 42 places in 47 ms
Iterating global reduction 2 with 40 rules applied. Total rules applied 43 place count 1267 transition count 122623
Ensure Unique test removed 1982 transitions
Reduce isomorphic transitions removed 1982 transitions.
Iterating post reduction 2 with 1982 rules applied. Total rules applied 2025 place count 1267 transition count 120641
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 44 places in 46 ms
Iterating global reduction 3 with 2 rules applied. Total rules applied 2027 place count 1267 transition count 120641
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2028 place count 1267 transition count 120640
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 2030 place count 1265 transition count 120638
Deduced a syphon composed of 42 places in 46 ms
Iterating global reduction 4 with 2 rules applied. Total rules applied 2032 place count 1265 transition count 120638
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -14
Deduced a syphon composed of 47 places in 46 ms
Iterating global reduction 4 with 5 rules applied. Total rules applied 2037 place count 1265 transition count 120652
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 2042 place count 1265 transition count 120647
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 2043 place count 1264 transition count 120644
Deduced a syphon composed of 46 places in 46 ms
Iterating global reduction 5 with 1 rules applied. Total rules applied 2044 place count 1264 transition count 120644
Deduced a syphon composed of 46 places in 46 ms
Applied a total of 2044 rules in 2995 ms. Remains 1264 /1267 variables (removed 3) and now considering 120644/122617 (removed 1973) transitions.
[2023-03-17 01:55:49] [INFO ] Flow matrix only has 92428 transitions (discarded 28216 similar events)
// Phase 1: matrix 92428 rows 1264 cols
[2023-03-17 01:55:50] [INFO ] Computed 7 place invariants in 380 ms
[2023-03-17 01:56:20] [INFO ] Performed 93074/120644 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-17 01:56:29] [INFO ] Dead Transitions using invariants and state equation in 39585 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1264/1267 places, 120644/122617 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 42584 ms. Remains : 1264/1267 places, 120644/122617 transitions.
Support contains 4 out of 1267 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1267/1267 places, 122617/122617 transitions.
Applied a total of 0 rules in 191 ms. Remains 1267 /1267 variables (removed 0) and now considering 122617/122617 (removed 0) transitions.
[2023-03-17 01:56:29] [INFO ] Flow matrix only has 94416 transitions (discarded 28201 similar events)
// Phase 1: matrix 94416 rows 1267 cols
[2023-03-17 01:56:29] [INFO ] Computed 7 place invariants in 347 ms
[2023-03-17 01:56:38] [INFO ] Implicit Places using invariants in 8687 ms returned []
Implicit Place search using SMT only with invariants took 8690 ms to find 0 implicit places.
[2023-03-17 01:56:38] [INFO ] Flow matrix only has 94416 transitions (discarded 28201 similar events)
[2023-03-17 01:56:38] [INFO ] Invariant cache hit.
[2023-03-17 01:57:08] [INFO ] Performed 92463/122617 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-17 01:57:17] [INFO ] Dead Transitions using invariants and state equation in 39397 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 48285 ms. Remains : 1267/1267 places, 122617/122617 transitions.
Treatment of property RERS2020-PT-pb102-LTLFireability-06 finished in 468033 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 4 out of 1267 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1267/1267 places, 122617/122617 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 1266 transition count 122614
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 5 place count 1264 transition count 122613
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 5 place count 1264 transition count 122611
Deduced a syphon composed of 2 places in 165 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 9 place count 1262 transition count 122611
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: 38
Deduced a syphon composed of 38 places in 57 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 2 with 76 rules applied. Total rules applied 85 place count 1224 transition count 122573
Ensure Unique test removed 1981 transitions
Reduce isomorphic transitions removed 1981 transitions.
Iterating post reduction 2 with 1981 rules applied. Total rules applied 2066 place count 1224 transition count 120592
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 50 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 2070 place count 1222 transition count 120590
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2071 place count 1222 transition count 120589
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 5 places in 49 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 2081 place count 1217 transition count 120590
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 2085 place count 1217 transition count 120586
Applied a total of 2085 rules in 3563 ms. Remains 1217 /1267 variables (removed 50) and now considering 120586/122617 (removed 2031) transitions.
[2023-03-17 01:57:25] [INFO ] Flow matrix only has 92370 transitions (discarded 28216 similar events)
// Phase 1: matrix 92370 rows 1217 cols
[2023-03-17 01:57:25] [INFO ] Computed 7 place invariants in 407 ms
[2023-03-17 01:57:34] [INFO ] Implicit Places using invariants in 8646 ms returned []
Implicit Place search using SMT only with invariants took 8648 ms to find 0 implicit places.
[2023-03-17 01:57:34] [INFO ] Flow matrix only has 92370 transitions (discarded 28216 similar events)
[2023-03-17 01:57:34] [INFO ] Invariant cache hit.
[2023-03-17 01:58:04] [INFO ] Performed 99577/120586 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-17 01:58:10] [INFO ] Dead Transitions using invariants and state equation in 36607 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1217/1267 places, 120586/122617 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 48824 ms. Remains : 1217/1267 places, 120586/122617 transitions.
Stuttering acceptance computed with spot in 46 ms :[(NOT p0)]
Running random walk in product with property : RERS2020-PT-pb102-LTLFireability-07 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 (AND (EQ s1046 1) (EQ s1095 1)) (AND (EQ s678 1) (EQ s1043 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 88 steps with 0 reset in 14 ms.
FORMULA RERS2020-PT-pb102-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RERS2020-PT-pb102-LTLFireability-07 finished in 49265 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((X(X(X(X(!p1)))) U ((X(X(X(X(!p1))))&&p2)||X(X(X(X(G(!p1))))))))))'
Support contains 6 out of 1267 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1267/1267 places, 122617/122617 transitions.
Applied a total of 0 rules in 174 ms. Remains 1267 /1267 variables (removed 0) and now considering 122617/122617 (removed 0) transitions.
[2023-03-17 01:58:11] [INFO ] Flow matrix only has 94416 transitions (discarded 28201 similar events)
// Phase 1: matrix 94416 rows 1267 cols
[2023-03-17 01:58:11] [INFO ] Computed 7 place invariants in 574 ms
[2023-03-17 01:58:19] [INFO ] Implicit Places using invariants in 8492 ms returned []
Implicit Place search using SMT only with invariants took 8495 ms to find 0 implicit places.
[2023-03-17 01:58:19] [INFO ] Flow matrix only has 94416 transitions (discarded 28201 similar events)
[2023-03-17 01:58:19] [INFO ] Invariant cache hit.
[2023-03-17 01:58:49] [INFO ] Performed 91763/122617 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-17 01:58:59] [INFO ] Dead Transitions using invariants and state equation in 39708 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 48381 ms. Remains : 1267/1267 places, 122617/122617 transitions.
Stuttering acceptance computed with spot in 313 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (NOT p0)]
Running random walk in product with property : RERS2020-PT-pb102-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 4}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 5}], [{ cond=(NOT p0), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p0) p1), acceptance={} source=5 dest: 6}], [{ cond=(NOT p0), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p0:(AND (EQ s348 1) (EQ s634 1)), p2:(AND (EQ s486 1) (EQ s824 1)), p1:(AND (EQ s457 1) (EQ s593 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 14325 reset in 6435 ms.
Product exploration explored 100000 steps with 14260 reset in 5969 ms.
Computed a total of 245 stabilizing places and 27913 stable transitions
Computed a total of 245 stabilizing places and 27913 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (AND (NOT p0) (NOT p2) (NOT p1))), (X (NOT p0)), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 353 ms. Reduced automaton from 7 states, 9 edges and 3 AP (stutter sensitive) to 7 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 413 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1268 ms. (steps per millisecond=7 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 166 ms. (steps per millisecond=60 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 176 ms. (steps per millisecond=56 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 179 ms. (steps per millisecond=55 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 177 ms. (steps per millisecond=56 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 6479 steps, run timeout after 3005 ms. (steps per millisecond=2 ) properties seen :{}
Probabilistic random walk after 6479 steps, saw 4830 distinct states, run finished after 3005 ms. (steps per millisecond=2 ) properties seen :0
Running SMT prover for 4 properties.
[2023-03-17 01:59:18] [INFO ] Flow matrix only has 94416 transitions (discarded 28201 similar events)
[2023-03-17 01:59:18] [INFO ] Invariant cache hit.
[2023-03-17 01:59:19] [INFO ] [Real]Absence check using 7 positive place invariants in 13 ms returned sat
[2023-03-17 01:59:44] [INFO ] After 24819ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:2
[2023-03-17 01:59:44] [INFO ] State equation strengthened by 3015 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 01:59:44] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-17 01:59:44] [INFO ] After 25864ms 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 6 out of 1267 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1267/1267 places, 122617/122617 transitions.
Drop transitions removed 2004 transitions
Reduce isomorphic transitions removed 2004 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2006 rules applied. Total rules applied 2006 place count 1267 transition count 120611
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 2009 place count 1265 transition count 120610
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 2009 place count 1265 transition count 120608
Deduced a syphon composed of 2 places in 117 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 2013 place count 1263 transition count 120608
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: 38
Deduced a syphon composed of 38 places in 46 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 2 with 76 rules applied. Total rules applied 2089 place count 1225 transition count 120570
Ensure Unique test removed 1981 transitions
Reduce isomorphic transitions removed 1981 transitions.
Iterating post reduction 2 with 1981 rules applied. Total rules applied 4070 place count 1225 transition count 118589
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 47 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 4074 place count 1223 transition count 118587
Drop transitions removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 4077 place count 1223 transition count 118584
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 5 places in 46 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 4087 place count 1218 transition count 118585
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 4091 place count 1218 transition count 118581
Free-agglomeration rule applied 39 times.
Iterating global reduction 5 with 39 rules applied. Total rules applied 4130 place count 1218 transition count 118542
Reduce places removed 39 places and 0 transitions.
Ensure Unique test removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Iterating post reduction 5 with 75 rules applied. Total rules applied 4205 place count 1179 transition count 118506
Free-agglomeration rule applied 1 times.
Iterating global reduction 6 with 1 rules applied. Total rules applied 4206 place count 1179 transition count 118505
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 4208 place count 1178 transition count 118504
Free-agglomeration rule applied 1 times.
Iterating global reduction 7 with 1 rules applied. Total rules applied 4209 place count 1178 transition count 118503
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 4210 place count 1177 transition count 118503
Free-agglomeration rule (complex) applied 75 times with reduction of 4414 identical transitions.
Iterating global reduction 8 with 75 rules applied. Total rules applied 4285 place count 1177 transition count 134713
Reduce places removed 75 places and 0 transitions.
Drop transitions removed 48 transitions
Ensure Unique test removed 3410 transitions
Reduce isomorphic transitions removed 3458 transitions.
Iterating post reduction 8 with 3533 rules applied. Total rules applied 7818 place count 1102 transition count 131255
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 7819 place count 1101 transition count 131254
Applied a total of 7819 rules in 8220 ms. Remains 1101 /1267 variables (removed 166) and now considering 131254/122617 (removed -8637) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8228 ms. Remains : 1101/1267 places, 131254/122617 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1418 ms. (steps per millisecond=7 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 181 ms. (steps per millisecond=55 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 215 ms. (steps per millisecond=46 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 195 ms. (steps per millisecond=51 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 210 ms. (steps per millisecond=47 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 10397 steps, run timeout after 6004 ms. (steps per millisecond=1 ) properties seen :{}
Probabilistic random walk after 10397 steps, saw 7761 distinct states, run finished after 6005 ms. (steps per millisecond=1 ) properties seen :0
Running SMT prover for 4 properties.
[2023-03-17 02:00:01] [INFO ] Flow matrix only has 104268 transitions (discarded 26986 similar events)
// Phase 1: matrix 104268 rows 1101 cols
[2023-03-17 02:00:02] [INFO ] Computed 7 place invariants in 655 ms
[2023-03-17 02:00:02] [INFO ] [Real]Absence check using 7 positive place invariants in 12 ms returned sat
[2023-03-17 02:00:27] [INFO ] After 24767ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:2
[2023-03-17 02:00:27] [INFO ] State equation strengthened by 3605 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 02:00:27] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-17 02:00:27] [INFO ] After 25691ms 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 6 out of 1101 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1101/1101 places, 131254/131254 transitions.
Applied a total of 0 rules in 637 ms. Remains 1101 /1101 variables (removed 0) and now considering 131254/131254 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 637 ms. Remains : 1101/1101 places, 131254/131254 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1101/1101 places, 131254/131254 transitions.
Applied a total of 0 rules in 584 ms. Remains 1101 /1101 variables (removed 0) and now considering 131254/131254 (removed 0) transitions.
[2023-03-17 02:00:29] [INFO ] Flow matrix only has 104268 transitions (discarded 26986 similar events)
[2023-03-17 02:00:29] [INFO ] Invariant cache hit.
[2023-03-17 02:00:37] [INFO ] Implicit Places using invariants in 8087 ms returned []
Implicit Place search using SMT only with invariants took 8087 ms to find 0 implicit places.
[2023-03-17 02:00:37] [INFO ] Flow matrix only has 104268 transitions (discarded 26986 similar events)
[2023-03-17 02:00:37] [INFO ] Invariant cache hit.
[2023-03-17 02:01:07] [INFO ] Performed 98391/131254 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-17 02:01:17] [INFO ] Dead Transitions using invariants and state equation in 40231 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 48920 ms. Remains : 1101/1101 places, 131254/131254 transitions.
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (AND (NOT p0) (NOT p2) (NOT p1))), (X (NOT p0)), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 311 ms. Reduced automaton from 7 states, 9 edges and 3 AP (stutter sensitive) to 7 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 284 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (NOT p0)]
Stuttering acceptance computed with spot in 291 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (NOT p0)]
Support contains 6 out of 1267 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1267/1267 places, 122617/122617 transitions.
Applied a total of 0 rules in 202 ms. Remains 1267 /1267 variables (removed 0) and now considering 122617/122617 (removed 0) transitions.
[2023-03-17 02:01:18] [INFO ] Flow matrix only has 94416 transitions (discarded 28201 similar events)
// Phase 1: matrix 94416 rows 1267 cols
[2023-03-17 02:01:19] [INFO ] Computed 7 place invariants in 349 ms
[2023-03-17 02:01:27] [INFO ] Implicit Places using invariants in 8510 ms returned []
Implicit Place search using SMT only with invariants took 8514 ms to find 0 implicit places.
[2023-03-17 02:01:27] [INFO ] Flow matrix only has 94416 transitions (discarded 28201 similar events)
[2023-03-17 02:01:27] [INFO ] Invariant cache hit.
[2023-03-17 02:01:57] [INFO ] Performed 93438/122617 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-17 02:02:06] [INFO ] Dead Transitions using invariants and state equation in 39636 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 48369 ms. Remains : 1267/1267 places, 122617/122617 transitions.
Computed a total of 245 stabilizing places and 27913 stable transitions
Computed a total of 245 stabilizing places and 27913 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (AND (NOT p1) (NOT p2) (NOT p0))), (X (NOT (AND p1 (NOT p2) (NOT p0)))), (X (NOT p0)), (X (X (AND (NOT p1) (NOT p2) (NOT p0)))), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 309 ms. Reduced automaton from 7 states, 9 edges and 3 AP (stutter sensitive) to 7 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 258 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1110 ms. (steps per millisecond=9 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 192 ms. (steps per millisecond=52 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 131 ms. (steps per millisecond=76 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 148 ms. (steps per millisecond=67 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 121 ms. (steps per millisecond=82 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 8291 steps, run timeout after 3002 ms. (steps per millisecond=2 ) properties seen :{}
Probabilistic random walk after 8291 steps, saw 6173 distinct states, run finished after 3004 ms. (steps per millisecond=2 ) properties seen :0
Running SMT prover for 4 properties.
[2023-03-17 02:02:12] [INFO ] Flow matrix only has 94416 transitions (discarded 28201 similar events)
[2023-03-17 02:02:13] [INFO ] Invariant cache hit.
[2023-03-17 02:02:13] [INFO ] [Real]Absence check using 7 positive place invariants in 8 ms returned sat
[2023-03-17 02:02:38] [INFO ] After 24788ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:2
[2023-03-17 02:02:38] [INFO ] State equation strengthened by 3015 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 02:02:38] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-17 02:02:38] [INFO ] After 25702ms 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 6 out of 1267 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1267/1267 places, 122617/122617 transitions.
Drop transitions removed 2004 transitions
Reduce isomorphic transitions removed 2004 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2006 rules applied. Total rules applied 2006 place count 1267 transition count 120611
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 2009 place count 1265 transition count 120610
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 2009 place count 1265 transition count 120608
Deduced a syphon composed of 2 places in 54 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 2013 place count 1263 transition count 120608
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: 38
Deduced a syphon composed of 38 places in 49 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 2 with 76 rules applied. Total rules applied 2089 place count 1225 transition count 120570
Ensure Unique test removed 1981 transitions
Reduce isomorphic transitions removed 1981 transitions.
Iterating post reduction 2 with 1981 rules applied. Total rules applied 4070 place count 1225 transition count 118589
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 49 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 4074 place count 1223 transition count 118587
Drop transitions removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 4077 place count 1223 transition count 118584
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 5 places in 47 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 4087 place count 1218 transition count 118585
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 4091 place count 1218 transition count 118581
Free-agglomeration rule applied 39 times.
Iterating global reduction 5 with 39 rules applied. Total rules applied 4130 place count 1218 transition count 118542
Reduce places removed 39 places and 0 transitions.
Ensure Unique test removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Iterating post reduction 5 with 75 rules applied. Total rules applied 4205 place count 1179 transition count 118506
Free-agglomeration rule applied 1 times.
Iterating global reduction 6 with 1 rules applied. Total rules applied 4206 place count 1179 transition count 118505
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 4208 place count 1178 transition count 118504
Free-agglomeration rule applied 1 times.
Iterating global reduction 7 with 1 rules applied. Total rules applied 4209 place count 1178 transition count 118503
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 4210 place count 1177 transition count 118503
Free-agglomeration rule (complex) applied 75 times with reduction of 4414 identical transitions.
Iterating global reduction 8 with 75 rules applied. Total rules applied 4285 place count 1177 transition count 134713
Reduce places removed 75 places and 0 transitions.
Drop transitions removed 48 transitions
Ensure Unique test removed 3410 transitions
Reduce isomorphic transitions removed 3458 transitions.
Iterating post reduction 8 with 3533 rules applied. Total rules applied 7818 place count 1102 transition count 131255
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 7819 place count 1101 transition count 131254
Applied a total of 7819 rules in 7211 ms. Remains 1101 /1267 variables (removed 166) and now considering 131254/122617 (removed -8637) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7215 ms. Remains : 1101/1267 places, 131254/122617 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1152 ms. (steps per millisecond=8 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 197 ms. (steps per millisecond=50 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 152 ms. (steps per millisecond=65 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 164 ms. (steps per millisecond=60 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 151 ms. (steps per millisecond=66 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 6321 steps, run timeout after 3005 ms. (steps per millisecond=2 ) properties seen :{}
Probabilistic random walk after 6321 steps, saw 4960 distinct states, run finished after 3005 ms. (steps per millisecond=2 ) properties seen :0
Running SMT prover for 4 properties.
[2023-03-17 02:02:50] [INFO ] Flow matrix only has 104268 transitions (discarded 26986 similar events)
// Phase 1: matrix 104268 rows 1101 cols
[2023-03-17 02:02:51] [INFO ] Computed 7 place invariants in 606 ms
[2023-03-17 02:02:51] [INFO ] [Real]Absence check using 7 positive place invariants in 9 ms returned sat
[2023-03-17 02:03:16] [INFO ] After 24808ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:2
[2023-03-17 02:03:17] [INFO ] State equation strengthened by 3605 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 02:03:17] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-17 02:03:17] [INFO ] After 25729ms 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 6 out of 1101 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1101/1101 places, 131254/131254 transitions.
Applied a total of 0 rules in 587 ms. Remains 1101 /1101 variables (removed 0) and now considering 131254/131254 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 587 ms. Remains : 1101/1101 places, 131254/131254 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1101/1101 places, 131254/131254 transitions.
Applied a total of 0 rules in 673 ms. Remains 1101 /1101 variables (removed 0) and now considering 131254/131254 (removed 0) transitions.
[2023-03-17 02:03:18] [INFO ] Flow matrix only has 104268 transitions (discarded 26986 similar events)
[2023-03-17 02:03:18] [INFO ] Invariant cache hit.
[2023-03-17 02:03:26] [INFO ] Implicit Places using invariants in 8193 ms returned []
Implicit Place search using SMT only with invariants took 8194 ms to find 0 implicit places.
[2023-03-17 02:03:26] [INFO ] Flow matrix only has 104268 transitions (discarded 26986 similar events)
[2023-03-17 02:03:26] [INFO ] Invariant cache hit.
[2023-03-17 02:03:56] [INFO ] Performed 99093/131254 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-17 02:04:05] [INFO ] Dead Transitions using invariants and state equation in 39253 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 48134 ms. Remains : 1101/1101 places, 131254/131254 transitions.
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (AND (NOT p1) (NOT p2) (NOT p0))), (X (NOT (AND p1 (NOT p2) (NOT p0)))), (X (NOT p0)), (X (X (AND (NOT p1) (NOT p2) (NOT p0)))), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 259 ms. Reduced automaton from 7 states, 9 edges and 3 AP (stutter sensitive) to 7 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 275 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (NOT p0)]
Stuttering acceptance computed with spot in 281 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (NOT p0)]
Stuttering acceptance computed with spot in 304 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (NOT p0)]
Product exploration explored 100000 steps with 14298 reset in 7556 ms.
Product exploration explored 100000 steps with 14340 reset in 7462 ms.
Applying partial POR strategy [false, false, false, false, false, true, true]
Stuttering acceptance computed with spot in 425 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (NOT p0)]
Support contains 6 out of 1267 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1267/1267 places, 122617/122617 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 1267 transition count 122617
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 1267 transition count 122616
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 42 places in 46 ms
Iterating global reduction 2 with 40 rules applied. Total rules applied 43 place count 1267 transition count 122623
Ensure Unique test removed 1982 transitions
Reduce isomorphic transitions removed 1982 transitions.
Iterating post reduction 2 with 1982 rules applied. Total rules applied 2025 place count 1267 transition count 120641
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 44 places in 45 ms
Iterating global reduction 3 with 2 rules applied. Total rules applied 2027 place count 1267 transition count 120641
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2028 place count 1267 transition count 120640
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 2030 place count 1265 transition count 120638
Deduced a syphon composed of 42 places in 46 ms
Iterating global reduction 4 with 2 rules applied. Total rules applied 2032 place count 1265 transition count 120638
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -14
Deduced a syphon composed of 47 places in 45 ms
Iterating global reduction 4 with 5 rules applied. Total rules applied 2037 place count 1265 transition count 120652
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 2042 place count 1265 transition count 120647
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 2043 place count 1264 transition count 120644
Deduced a syphon composed of 46 places in 51 ms
Iterating global reduction 5 with 1 rules applied. Total rules applied 2044 place count 1264 transition count 120644
Deduced a syphon composed of 46 places in 43 ms
Applied a total of 2044 rules in 2993 ms. Remains 1264 /1267 variables (removed 3) and now considering 120644/122617 (removed 1973) transitions.
[2023-03-17 02:04:25] [INFO ] Flow matrix only has 92428 transitions (discarded 28216 similar events)
// Phase 1: matrix 92428 rows 1264 cols
[2023-03-17 02:04:26] [INFO ] Computed 7 place invariants in 332 ms
[2023-03-17 02:04:56] [INFO ] Performed 91432/120644 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-17 02:05:05] [INFO ] Dead Transitions using invariants and state equation in 39982 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1264/1267 places, 120644/122617 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 42981 ms. Remains : 1264/1267 places, 120644/122617 transitions.
Support contains 6 out of 1267 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1267/1267 places, 122617/122617 transitions.
Applied a total of 0 rules in 249 ms. Remains 1267 /1267 variables (removed 0) and now considering 122617/122617 (removed 0) transitions.
[2023-03-17 02:05:06] [INFO ] Flow matrix only has 94416 transitions (discarded 28201 similar events)
// Phase 1: matrix 94416 rows 1267 cols
[2023-03-17 02:05:06] [INFO ] Computed 7 place invariants in 388 ms
[2023-03-17 02:05:14] [INFO ] Implicit Places using invariants in 8238 ms returned []
Implicit Place search using SMT only with invariants took 8238 ms to find 0 implicit places.
[2023-03-17 02:05:14] [INFO ] Flow matrix only has 94416 transitions (discarded 28201 similar events)
[2023-03-17 02:05:14] [INFO ] Invariant cache hit.
[2023-03-17 02:05:44] [INFO ] Performed 90043/122617 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-17 02:05:55] [INFO ] Dead Transitions using invariants and state equation in 40705 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 49199 ms. Remains : 1267/1267 places, 122617/122617 transitions.
Treatment of property RERS2020-PT-pb102-LTLFireability-08 finished in 468514 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 1267 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1267/1267 places, 122617/122617 transitions.
Applied a total of 0 rules in 188 ms. Remains 1267 /1267 variables (removed 0) and now considering 122617/122617 (removed 0) transitions.
[2023-03-17 02:05:59] [INFO ] Flow matrix only has 94416 transitions (discarded 28201 similar events)
[2023-03-17 02:05:59] [INFO ] Invariant cache hit.
[2023-03-17 02:06:07] [INFO ] Implicit Places using invariants in 8142 ms returned []
Implicit Place search using SMT only with invariants took 8156 ms to find 0 implicit places.
[2023-03-17 02:06:07] [INFO ] Flow matrix only has 94416 transitions (discarded 28201 similar events)
[2023-03-17 02:06:08] [INFO ] Invariant cache hit.
[2023-03-17 02:06:38] [INFO ] Performed 96232/122617 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-17 02:06:46] [INFO ] Dead Transitions using invariants and state equation in 38305 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 46653 ms. Remains : 1267/1267 places, 122617/122617 transitions.
Stuttering acceptance computed with spot in 116 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : RERS2020-PT-pb102-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (EQ s334 0) (EQ s974 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 0 reset in 8935 ms.
Product exploration explored 100000 steps with 0 reset in 8412 ms.
Computed a total of 245 stabilizing places and 27913 stable transitions
Computed a total of 245 stabilizing places and 27913 stable transitions
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 150 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 88 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 905 ms. (steps per millisecond=11 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 127 ms. (steps per millisecond=78 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 7840 steps, run timeout after 3002 ms. (steps per millisecond=2 ) properties seen :{}
Probabilistic random walk after 7840 steps, saw 5841 distinct states, run finished after 3002 ms. (steps per millisecond=2 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-17 02:07:08] [INFO ] Flow matrix only has 94416 transitions (discarded 28201 similar events)
[2023-03-17 02:07:08] [INFO ] Invariant cache hit.
[2023-03-17 02:07:09] [INFO ] After 149ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-17 02:07:09] [INFO ] [Nat]Absence check using 7 positive place invariants in 10 ms returned sat
[2023-03-17 02:07:34] [INFO ] After 25210ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-17 02:07:35] [INFO ] State equation strengthened by 3015 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:350)
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 02:07:35] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-17 02:07:35] [INFO ] After 26032ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 1267 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1267/1267 places, 122617/122617 transitions.
Drop transitions removed 2004 transitions
Reduce isomorphic transitions removed 2004 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2006 rules applied. Total rules applied 2006 place count 1267 transition count 120611
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 2009 place count 1265 transition count 120610
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 2009 place count 1265 transition count 120608
Deduced a syphon composed of 2 places in 56 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 2013 place count 1263 transition count 120608
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: 38
Deduced a syphon composed of 38 places in 50 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 2 with 76 rules applied. Total rules applied 2089 place count 1225 transition count 120570
Ensure Unique test removed 1981 transitions
Reduce isomorphic transitions removed 1981 transitions.
Iterating post reduction 2 with 1981 rules applied. Total rules applied 4070 place count 1225 transition count 118589
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 49 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 4074 place count 1223 transition count 118587
Drop transitions removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 4077 place count 1223 transition count 118584
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 5 places in 49 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 4087 place count 1218 transition count 118585
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 4091 place count 1218 transition count 118581
Free-agglomeration rule applied 39 times.
Iterating global reduction 5 with 39 rules applied. Total rules applied 4130 place count 1218 transition count 118542
Reduce places removed 39 places and 0 transitions.
Ensure Unique test removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Iterating post reduction 5 with 75 rules applied. Total rules applied 4205 place count 1179 transition count 118506
Free-agglomeration rule applied 1 times.
Iterating global reduction 6 with 1 rules applied. Total rules applied 4206 place count 1179 transition count 118505
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 4208 place count 1178 transition count 118504
Free-agglomeration rule applied 1 times.
Iterating global reduction 7 with 1 rules applied. Total rules applied 4209 place count 1178 transition count 118503
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 4210 place count 1177 transition count 118503
Free-agglomeration rule (complex) applied 75 times with reduction of 4414 identical transitions.
Iterating global reduction 8 with 75 rules applied. Total rules applied 4285 place count 1177 transition count 134713
Reduce places removed 75 places and 0 transitions.
Drop transitions removed 48 transitions
Ensure Unique test removed 3410 transitions
Reduce isomorphic transitions removed 3458 transitions.
Iterating post reduction 8 with 3533 rules applied. Total rules applied 7818 place count 1102 transition count 131255
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 7819 place count 1101 transition count 131254
Applied a total of 7819 rules in 7792 ms. Remains 1101 /1267 variables (removed 166) and now considering 131254/122617 (removed -8637) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7797 ms. Remains : 1101/1267 places, 131254/122617 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 954 ms. (steps per millisecond=10 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 152 ms. (steps per millisecond=65 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 5647 steps, run timeout after 3004 ms. (steps per millisecond=1 ) properties seen :{}
Probabilistic random walk after 5647 steps, saw 4451 distinct states, run finished after 3004 ms. (steps per millisecond=1 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-17 02:07:47] [INFO ] Flow matrix only has 104268 transitions (discarded 26986 similar events)
// Phase 1: matrix 104268 rows 1101 cols
[2023-03-17 02:07:47] [INFO ] Computed 7 place invariants in 616 ms
[2023-03-17 02:07:47] [INFO ] After 130ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-17 02:07:48] [INFO ] [Nat]Absence check using 7 positive place invariants in 8 ms returned sat
[2023-03-17 02:08:13] [INFO ] After 25025ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 1101 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1101/1101 places, 131254/131254 transitions.
Applied a total of 0 rules in 673 ms. Remains 1101 /1101 variables (removed 0) and now considering 131254/131254 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 673 ms. Remains : 1101/1101 places, 131254/131254 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1101/1101 places, 131254/131254 transitions.
Applied a total of 0 rules in 665 ms. Remains 1101 /1101 variables (removed 0) and now considering 131254/131254 (removed 0) transitions.
[2023-03-17 02:08:14] [INFO ] Flow matrix only has 104268 transitions (discarded 26986 similar events)
[2023-03-17 02:08:14] [INFO ] Invariant cache hit.
[2023-03-17 02:08:22] [INFO ] Implicit Places using invariants in 7837 ms returned []
Implicit Place search using SMT only with invariants took 7838 ms to find 0 implicit places.
[2023-03-17 02:08:22] [INFO ] Flow matrix only has 104268 transitions (discarded 26986 similar events)
[2023-03-17 02:08:22] [INFO ] Invariant cache hit.
[2023-03-17 02:08:52] [INFO ] Performed 94098/131254 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-17 02:09:03] [INFO ] Dead Transitions using invariants and state equation in 41599 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 50114 ms. Remains : 1101/1101 places, 131254/131254 transitions.
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 157 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 80 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 84 ms :[true, (NOT p0), (NOT p0)]
Support contains 2 out of 1267 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1267/1267 places, 122617/122617 transitions.
Applied a total of 0 rules in 204 ms. Remains 1267 /1267 variables (removed 0) and now considering 122617/122617 (removed 0) transitions.
[2023-03-17 02:09:04] [INFO ] Flow matrix only has 94416 transitions (discarded 28201 similar events)
// Phase 1: matrix 94416 rows 1267 cols
[2023-03-17 02:09:04] [INFO ] Computed 7 place invariants in 474 ms
[2023-03-17 02:09:13] [INFO ] Implicit Places using invariants in 8574 ms returned []
Implicit Place search using SMT only with invariants took 8578 ms to find 0 implicit places.
[2023-03-17 02:09:13] [INFO ] Flow matrix only has 94416 transitions (discarded 28201 similar events)
[2023-03-17 02:09:13] [INFO ] Invariant cache hit.
[2023-03-17 02:09:43] [INFO ] Performed 90569/122617 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-17 02:09:53] [INFO ] Dead Transitions using invariants and state equation in 40773 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 49561 ms. Remains : 1267/1267 places, 122617/122617 transitions.
Computed a total of 245 stabilizing places and 27913 stable transitions
Computed a total of 245 stabilizing places and 27913 stable transitions
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 87 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1053 ms. (steps per millisecond=9 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 143 ms. (steps per millisecond=69 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 7460 steps, run timeout after 3001 ms. (steps per millisecond=2 ) properties seen :{}
Probabilistic random walk after 7460 steps, saw 5554 distinct states, run finished after 3001 ms. (steps per millisecond=2 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-17 02:09:59] [INFO ] Flow matrix only has 94416 transitions (discarded 28201 similar events)
[2023-03-17 02:09:59] [INFO ] Invariant cache hit.
[2023-03-17 02:09:59] [INFO ] After 146ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-17 02:09:59] [INFO ] [Nat]Absence check using 7 positive place invariants in 10 ms returned sat
[2023-03-17 02:10:23] [INFO ] After 24350ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-17 02:10:24] [INFO ] State equation strengthened by 3015 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:350)
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 02:10:24] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-17 02:10:24] [INFO ] After 25169ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 1267 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1267/1267 places, 122617/122617 transitions.
Drop transitions removed 2004 transitions
Reduce isomorphic transitions removed 2004 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2006 rules applied. Total rules applied 2006 place count 1267 transition count 120611
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 2009 place count 1265 transition count 120610
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 2009 place count 1265 transition count 120608
Deduced a syphon composed of 2 places in 63 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 2013 place count 1263 transition count 120608
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: 38
Deduced a syphon composed of 38 places in 58 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 2 with 76 rules applied. Total rules applied 2089 place count 1225 transition count 120570
Ensure Unique test removed 1981 transitions
Reduce isomorphic transitions removed 1981 transitions.
Iterating post reduction 2 with 1981 rules applied. Total rules applied 4070 place count 1225 transition count 118589
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 58 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 4074 place count 1223 transition count 118587
Drop transitions removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 4077 place count 1223 transition count 118584
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 5 places in 54 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 4087 place count 1218 transition count 118585
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 4091 place count 1218 transition count 118581
Free-agglomeration rule applied 39 times.
Iterating global reduction 5 with 39 rules applied. Total rules applied 4130 place count 1218 transition count 118542
Reduce places removed 39 places and 0 transitions.
Ensure Unique test removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Iterating post reduction 5 with 75 rules applied. Total rules applied 4205 place count 1179 transition count 118506
Free-agglomeration rule applied 1 times.
Iterating global reduction 6 with 1 rules applied. Total rules applied 4206 place count 1179 transition count 118505
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 4208 place count 1178 transition count 118504
Free-agglomeration rule applied 1 times.
Iterating global reduction 7 with 1 rules applied. Total rules applied 4209 place count 1178 transition count 118503
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 4210 place count 1177 transition count 118503
Free-agglomeration rule (complex) applied 75 times with reduction of 4414 identical transitions.
Iterating global reduction 8 with 75 rules applied. Total rules applied 4285 place count 1177 transition count 134713
Reduce places removed 75 places and 0 transitions.
Drop transitions removed 48 transitions
Ensure Unique test removed 3410 transitions
Reduce isomorphic transitions removed 3458 transitions.
Iterating post reduction 8 with 3533 rules applied. Total rules applied 7818 place count 1102 transition count 131255
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 7819 place count 1101 transition count 131254
Applied a total of 7819 rules in 8225 ms. Remains 1101 /1267 variables (removed 166) and now considering 131254/122617 (removed -8637) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8230 ms. Remains : 1101/1267 places, 131254/122617 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1094 ms. (steps per millisecond=9 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 156 ms. (steps per millisecond=64 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 7298 steps, run timeout after 3002 ms. (steps per millisecond=2 ) properties seen :{}
Probabilistic random walk after 7298 steps, saw 5628 distinct states, run finished after 3002 ms. (steps per millisecond=2 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-17 02:10:37] [INFO ] Flow matrix only has 104268 transitions (discarded 26986 similar events)
// Phase 1: matrix 104268 rows 1101 cols
[2023-03-17 02:10:37] [INFO ] Computed 7 place invariants in 637 ms
[2023-03-17 02:10:37] [INFO ] After 129ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-17 02:10:38] [INFO ] [Nat]Absence check using 7 positive place invariants in 7 ms returned sat
[2023-03-17 02:11:02] [INFO ] After 25013ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 1101 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1101/1101 places, 131254/131254 transitions.
Applied a total of 0 rules in 652 ms. Remains 1101 /1101 variables (removed 0) and now considering 131254/131254 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 652 ms. Remains : 1101/1101 places, 131254/131254 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1101/1101 places, 131254/131254 transitions.
Applied a total of 0 rules in 625 ms. Remains 1101 /1101 variables (removed 0) and now considering 131254/131254 (removed 0) transitions.
[2023-03-17 02:11:04] [INFO ] Flow matrix only has 104268 transitions (discarded 26986 similar events)
[2023-03-17 02:11:04] [INFO ] Invariant cache hit.
[2023-03-17 02:11:12] [INFO ] Implicit Places using invariants in 8147 ms returned []
Implicit Place search using SMT only with invariants took 8150 ms to find 0 implicit places.
[2023-03-17 02:11:12] [INFO ] Flow matrix only has 104268 transitions (discarded 26986 similar events)
[2023-03-17 02:11:12] [INFO ] Invariant cache hit.
[2023-03-17 02:11:42] [INFO ] Performed 93957/131254 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-17 02:11:53] [INFO ] Dead Transitions using invariants and state equation in 41469 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 50270 ms. Remains : 1101/1101 places, 131254/131254 transitions.
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 127 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 63 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 57 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 63 ms :[true, (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 8263 ms.
Product exploration explored 100000 steps with 0 reset in 8195 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 82 ms :[true, (NOT p0), (NOT p0)]
Support contains 2 out of 1267 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1267/1267 places, 122617/122617 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 1267 transition count 122617
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 1267 transition count 122616
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 42 places in 46 ms
Iterating global reduction 2 with 40 rules applied. Total rules applied 43 place count 1267 transition count 122623
Ensure Unique test removed 1982 transitions
Reduce isomorphic transitions removed 1982 transitions.
Iterating post reduction 2 with 1982 rules applied. Total rules applied 2025 place count 1267 transition count 120641
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 44 places in 45 ms
Iterating global reduction 3 with 2 rules applied. Total rules applied 2027 place count 1267 transition count 120641
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2028 place count 1267 transition count 120640
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 2030 place count 1265 transition count 120638
Deduced a syphon composed of 42 places in 45 ms
Iterating global reduction 4 with 2 rules applied. Total rules applied 2032 place count 1265 transition count 120638
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -14
Deduced a syphon composed of 47 places in 46 ms
Iterating global reduction 4 with 5 rules applied. Total rules applied 2037 place count 1265 transition count 120652
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 2042 place count 1265 transition count 120647
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 2043 place count 1264 transition count 120644
Deduced a syphon composed of 46 places in 96 ms
Iterating global reduction 5 with 1 rules applied. Total rules applied 2044 place count 1264 transition count 120644
Deduced a syphon composed of 46 places in 47 ms
Applied a total of 2044 rules in 3112 ms. Remains 1264 /1267 variables (removed 3) and now considering 120644/122617 (removed 1973) transitions.
[2023-03-17 02:12:14] [INFO ] Flow matrix only has 92428 transitions (discarded 28216 similar events)
// Phase 1: matrix 92428 rows 1264 cols
[2023-03-17 02:12:14] [INFO ] Computed 7 place invariants in 469 ms
[2023-03-17 02:12:44] [INFO ] Performed 92099/120644 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-17 02:12:54] [INFO ] Dead Transitions using invariants and state equation in 40406 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1264/1267 places, 120644/122617 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 43522 ms. Remains : 1264/1267 places, 120644/122617 transitions.
Support contains 2 out of 1267 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1267/1267 places, 122617/122617 transitions.
Applied a total of 0 rules in 231 ms. Remains 1267 /1267 variables (removed 0) and now considering 122617/122617 (removed 0) transitions.
[2023-03-17 02:12:54] [INFO ] Flow matrix only has 94416 transitions (discarded 28201 similar events)
// Phase 1: matrix 94416 rows 1267 cols
[2023-03-17 02:12:55] [INFO ] Computed 7 place invariants in 374 ms
[2023-03-17 02:13:03] [INFO ] Implicit Places using invariants in 8185 ms returned []
Implicit Place search using SMT only with invariants took 8197 ms to find 0 implicit places.
[2023-03-17 02:13:03] [INFO ] Flow matrix only has 94416 transitions (discarded 28201 similar events)
[2023-03-17 02:13:03] [INFO ] Invariant cache hit.
[2023-03-17 02:13:33] [INFO ] Performed 91691/122617 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-17 02:13:43] [INFO ] Dead Transitions using invariants and state equation in 40387 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 48830 ms. Remains : 1267/1267 places, 122617/122617 transitions.
Treatment of property RERS2020-PT-pb102-LTLFireability-09 finished in 468409 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 1267 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1267/1267 places, 122617/122617 transitions.
Applied a total of 0 rules in 188 ms. Remains 1267 /1267 variables (removed 0) and now considering 122617/122617 (removed 0) transitions.
[2023-03-17 02:13:48] [INFO ] Flow matrix only has 94416 transitions (discarded 28201 similar events)
[2023-03-17 02:13:48] [INFO ] Invariant cache hit.
[2023-03-17 02:13:56] [INFO ] Implicit Places using invariants in 8083 ms returned []
Implicit Place search using SMT only with invariants took 8084 ms to find 0 implicit places.
[2023-03-17 02:13:56] [INFO ] Flow matrix only has 94416 transitions (discarded 28201 similar events)
[2023-03-17 02:13:56] [INFO ] Invariant cache hit.
[2023-03-17 02:14:26] [INFO ] Performed 92666/122617 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-17 02:14:36] [INFO ] Dead Transitions using invariants and state equation in 40045 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 48323 ms. Remains : 1267/1267 places, 122617/122617 transitions.
Stuttering acceptance computed with spot in 109 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : RERS2020-PT-pb102-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (EQ s652 0) (EQ s1051 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 1 reset in 9055 ms.
Product exploration explored 100000 steps with 0 reset in 7791 ms.
Computed a total of 245 stabilizing places and 27913 stable transitions
Computed a total of 245 stabilizing places and 27913 stable transitions
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 152 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 83 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1100 ms. (steps per millisecond=9 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 140 ms. (steps per millisecond=71 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 5785 steps, run timeout after 3002 ms. (steps per millisecond=1 ) properties seen :{}
Probabilistic random walk after 5785 steps, saw 4290 distinct states, run finished after 3002 ms. (steps per millisecond=1 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-17 02:14:58] [INFO ] Flow matrix only has 94416 transitions (discarded 28201 similar events)
[2023-03-17 02:14:58] [INFO ] Invariant cache hit.
[2023-03-17 02:14:58] [INFO ] After 131ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-17 02:14:59] [INFO ] [Nat]Absence check using 7 positive place invariants in 10 ms returned sat
[2023-03-17 02:15:23] [INFO ] After 24444ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-17 02:15:24] [INFO ] State equation strengthened by 3015 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:350)
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 02:15:24] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-17 02:15:24] [INFO ] After 25246ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 1267 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1267/1267 places, 122617/122617 transitions.
Drop transitions removed 2004 transitions
Reduce isomorphic transitions removed 2004 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2006 rules applied. Total rules applied 2006 place count 1267 transition count 120611
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 2009 place count 1265 transition count 120610
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 2009 place count 1265 transition count 120608
Deduced a syphon composed of 2 places in 54 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 2013 place count 1263 transition count 120608
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: 38
Deduced a syphon composed of 38 places in 51 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 2 with 76 rules applied. Total rules applied 2089 place count 1225 transition count 120570
Ensure Unique test removed 1981 transitions
Reduce isomorphic transitions removed 1981 transitions.
Iterating post reduction 2 with 1981 rules applied. Total rules applied 4070 place count 1225 transition count 118589
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 51 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 4074 place count 1223 transition count 118587
Drop transitions removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 4077 place count 1223 transition count 118584
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 5 places in 49 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 4087 place count 1218 transition count 118585
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 4091 place count 1218 transition count 118581
Free-agglomeration rule applied 39 times.
Iterating global reduction 5 with 39 rules applied. Total rules applied 4130 place count 1218 transition count 118542
Reduce places removed 39 places and 0 transitions.
Ensure Unique test removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Iterating post reduction 5 with 75 rules applied. Total rules applied 4205 place count 1179 transition count 118506
Free-agglomeration rule applied 1 times.
Iterating global reduction 6 with 1 rules applied. Total rules applied 4206 place count 1179 transition count 118505
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 4208 place count 1178 transition count 118504
Free-agglomeration rule applied 1 times.
Iterating global reduction 7 with 1 rules applied. Total rules applied 4209 place count 1178 transition count 118503
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 4210 place count 1177 transition count 118503
Free-agglomeration rule (complex) applied 75 times with reduction of 4414 identical transitions.
Iterating global reduction 8 with 75 rules applied. Total rules applied 4285 place count 1177 transition count 134713
Reduce places removed 75 places and 0 transitions.
Drop transitions removed 48 transitions
Ensure Unique test removed 3410 transitions
Reduce isomorphic transitions removed 3458 transitions.
Iterating post reduction 8 with 3533 rules applied. Total rules applied 7818 place count 1102 transition count 131255
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 7819 place count 1101 transition count 131254
Applied a total of 7819 rules in 7832 ms. Remains 1101 /1267 variables (removed 166) and now considering 131254/122617 (removed -8637) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7836 ms. Remains : 1101/1267 places, 131254/122617 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 767 ms. (steps per millisecond=13 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 116 ms. (steps per millisecond=86 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 7941 steps, run timeout after 3021 ms. (steps per millisecond=2 ) properties seen :{}
Probabilistic random walk after 7941 steps, saw 6059 distinct states, run finished after 3021 ms. (steps per millisecond=2 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-17 02:15:36] [INFO ] Flow matrix only has 104268 transitions (discarded 26986 similar events)
// Phase 1: matrix 104268 rows 1101 cols
[2023-03-17 02:15:36] [INFO ] Computed 7 place invariants in 564 ms
[2023-03-17 02:15:36] [INFO ] After 135ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-17 02:15:36] [INFO ] [Nat]Absence check using 7 positive place invariants in 8 ms returned sat
[2023-03-17 02:16:01] [INFO ] After 25016ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 1101 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1101/1101 places, 131254/131254 transitions.
Applied a total of 0 rules in 596 ms. Remains 1101 /1101 variables (removed 0) and now considering 131254/131254 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 596 ms. Remains : 1101/1101 places, 131254/131254 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1101/1101 places, 131254/131254 transitions.
Applied a total of 0 rules in 597 ms. Remains 1101 /1101 variables (removed 0) and now considering 131254/131254 (removed 0) transitions.
[2023-03-17 02:16:03] [INFO ] Flow matrix only has 104268 transitions (discarded 26986 similar events)
[2023-03-17 02:16:03] [INFO ] Invariant cache hit.
[2023-03-17 02:16:11] [INFO ] Implicit Places using invariants in 8028 ms returned []
Implicit Place search using SMT only with invariants took 8029 ms to find 0 implicit places.
[2023-03-17 02:16:11] [INFO ] Flow matrix only has 104268 transitions (discarded 26986 similar events)
[2023-03-17 02:16:11] [INFO ] Invariant cache hit.
[2023-03-17 02:16:41] [INFO ] Performed 93959/131254 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-17 02:16:52] [INFO ] Dead Transitions using invariants and state equation in 41556 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 50196 ms. Remains : 1101/1101 places, 131254/131254 transitions.
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 147 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 88 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 80 ms :[true, (NOT p0), (NOT p0)]
Support contains 2 out of 1267 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1267/1267 places, 122617/122617 transitions.
Applied a total of 0 rules in 203 ms. Remains 1267 /1267 variables (removed 0) and now considering 122617/122617 (removed 0) transitions.
[2023-03-17 02:16:53] [INFO ] Flow matrix only has 94416 transitions (discarded 28201 similar events)
// Phase 1: matrix 94416 rows 1267 cols
[2023-03-17 02:16:53] [INFO ] Computed 7 place invariants in 399 ms
[2023-03-17 02:17:01] [INFO ] Implicit Places using invariants in 8451 ms returned []
Implicit Place search using SMT only with invariants took 8454 ms to find 0 implicit places.
[2023-03-17 02:17:01] [INFO ] Flow matrix only has 94416 transitions (discarded 28201 similar events)
[2023-03-17 02:17:01] [INFO ] Invariant cache hit.
[2023-03-17 02:17:31] [INFO ] Performed 95230/122617 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-17 02:17:40] [INFO ] Dead Transitions using invariants and state equation in 38910 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 47571 ms. Remains : 1267/1267 places, 122617/122617 transitions.
Computed a total of 245 stabilizing places and 27913 stable transitions
Computed a total of 245 stabilizing places and 27913 stable transitions
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 154 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 p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1198 ms. (steps per millisecond=8 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 195 ms. (steps per millisecond=51 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 6385 steps, run timeout after 3001 ms. (steps per millisecond=2 ) properties seen :{}
Probabilistic random walk after 6385 steps, saw 4760 distinct states, run finished after 3003 ms. (steps per millisecond=2 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-17 02:17:46] [INFO ] Flow matrix only has 94416 transitions (discarded 28201 similar events)
[2023-03-17 02:17:46] [INFO ] Invariant cache hit.
[2023-03-17 02:17:46] [INFO ] After 141ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-17 02:17:46] [INFO ] [Nat]Absence check using 7 positive place invariants in 10 ms returned sat
[2023-03-17 02:18:11] [INFO ] After 24855ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-17 02:18:12] [INFO ] State equation strengthened by 3015 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:350)
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 02:18:12] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-17 02:18:12] [INFO ] After 25683ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 1267 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1267/1267 places, 122617/122617 transitions.
Drop transitions removed 2004 transitions
Reduce isomorphic transitions removed 2004 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2006 rules applied. Total rules applied 2006 place count 1267 transition count 120611
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 2009 place count 1265 transition count 120610
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 2009 place count 1265 transition count 120608
Deduced a syphon composed of 2 places in 63 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 2013 place count 1263 transition count 120608
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 7377468 kB
After kill :
MemTotal: 16393216 kB
MemFree: 15996592 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-pb102"
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-pb102, 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-167889199300228"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/RERS2020-PT-pb102.tgz
mv RERS2020-PT-pb102 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 ;