About the Execution of LTSMin+red for RERS2020-PT-pb103
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 6280.920 | 793665.00 | 936684.00 | 1993.00 | F?TFF?F?TFFFFFTF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2023-input.r329-tall-167889201800235.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool ltsminxred
Input is RERS2020-PT-pb103, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r329-tall-167889201800235
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 18M
-rw-r--r-- 1 mcc users 7.2K Feb 26 08:33 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K Feb 26 08:33 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Feb 26 08:31 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K Feb 26 08:31 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:40 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K 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 13K Feb 26 08:36 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 130K Feb 26 08:36 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.8K Feb 26 08:35 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 64K Feb 26 08:35 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 18M 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-pb103-LTLCardinality-00
FORMULA_NAME RERS2020-PT-pb103-LTLCardinality-01
FORMULA_NAME RERS2020-PT-pb103-LTLCardinality-02
FORMULA_NAME RERS2020-PT-pb103-LTLCardinality-03
FORMULA_NAME RERS2020-PT-pb103-LTLCardinality-04
FORMULA_NAME RERS2020-PT-pb103-LTLCardinality-05
FORMULA_NAME RERS2020-PT-pb103-LTLCardinality-06
FORMULA_NAME RERS2020-PT-pb103-LTLCardinality-07
FORMULA_NAME RERS2020-PT-pb103-LTLCardinality-08
FORMULA_NAME RERS2020-PT-pb103-LTLCardinality-09
FORMULA_NAME RERS2020-PT-pb103-LTLCardinality-10
FORMULA_NAME RERS2020-PT-pb103-LTLCardinality-11
FORMULA_NAME RERS2020-PT-pb103-LTLCardinality-12
FORMULA_NAME RERS2020-PT-pb103-LTLCardinality-13
FORMULA_NAME RERS2020-PT-pb103-LTLCardinality-14
FORMULA_NAME RERS2020-PT-pb103-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1679088177310
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=RERS2020-PT-pb103
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-17 21:22:59] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-17 21:22:59] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-17 21:23:00] [INFO ] Load time of PNML (sax parser for PT used): 786 ms
[2023-03-17 21:23:00] [INFO ] Transformed 520 places.
[2023-03-17 21:23:00] [INFO ] Transformed 31658 transitions.
[2023-03-17 21:23:00] [INFO ] Found NUPN structural information;
[2023-03-17 21:23:00] [INFO ] Parsed PT model containing 520 places and 31658 transitions and 125892 arcs in 1037 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 23 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Ensure Unique test removed 3229 transitions
Reduce redundant transitions removed 3229 transitions.
FORMULA RERS2020-PT-pb103-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RERS2020-PT-pb103-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RERS2020-PT-pb103-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RERS2020-PT-pb103-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RERS2020-PT-pb103-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RERS2020-PT-pb103-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 29 out of 520 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 520/520 places, 28429/28429 transitions.
Ensure Unique test removed 7 places
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 513 transition count 28429
Applied a total of 7 rules in 104 ms. Remains 513 /520 variables (removed 7) and now considering 28429/28429 (removed 0) transitions.
[2023-03-17 21:23:00] [INFO ] Flow matrix only has 18674 transitions (discarded 9755 similar events)
// Phase 1: matrix 18674 rows 513 cols
[2023-03-17 21:23:01] [INFO ] Computed 8 place invariants in 147 ms
[2023-03-17 21:23:02] [INFO ] Implicit Places using invariants in 1370 ms returned []
Implicit Place search using SMT only with invariants took 1396 ms to find 0 implicit places.
[2023-03-17 21:23:02] [INFO ] Flow matrix only has 18674 transitions (discarded 9755 similar events)
[2023-03-17 21:23:02] [INFO ] Invariant cache hit.
[2023-03-17 21:23:10] [INFO ] Dead Transitions using invariants and state equation in 8432 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 513/520 places, 28429/28429 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9943 ms. Remains : 513/520 places, 28429/28429 transitions.
Support contains 29 out of 513 places after structural reductions.
[2023-03-17 21:23:12] [INFO ] Flatten gal took : 1034 ms
[2023-03-17 21:23:13] [INFO ] Flatten gal took : 805 ms
[2023-03-17 21:23:14] [INFO ] Input system was already deterministic with 28429 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 869 ms. (steps per millisecond=11 ) properties (out of 19) seen :8
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 11) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 9) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 7) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 6) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
[2023-03-17 21:23:16] [INFO ] Flow matrix only has 18674 transitions (discarded 9755 similar events)
[2023-03-17 21:23:16] [INFO ] Invariant cache hit.
[2023-03-17 21:23:16] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-17 21:23:21] [INFO ] After 5031ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:4
[2023-03-17 21:23:21] [INFO ] State equation strengthened by 1379 read => feed constraints.
[2023-03-17 21:23:23] [INFO ] After 1750ms SMT Verify possible using 1379 Read/Feed constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-17 21:23:23] [INFO ] After 7220ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-17 21:23:23] [INFO ] [Nat]Absence check using 8 positive place invariants in 9 ms returned sat
[2023-03-17 21:23:28] [INFO ] After 4864ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-17 21:23:38] [INFO ] After 9673ms SMT Verify possible using 1379 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-17 21:23:39] [INFO ] Deduced a trap composed of 12 places in 970 ms of which 4 ms to minimize.
[2023-03-17 21:23:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1801 ms
[2023-03-17 21:23:42] [INFO ] Deduced a trap composed of 53 places in 1788 ms of which 1 ms to minimize.
[2023-03-17 21:23:44] [INFO ] Deduced a trap composed of 67 places in 1851 ms of which 1 ms to minimize.
[2023-03-17 21:23:46] [INFO ] Deduced a trap composed of 102 places in 1889 ms of which 1 ms to minimize.
[2023-03-17 21:23:49] [INFO ] Deduced a trap composed of 60 places in 1994 ms of which 1 ms to minimize.
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.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
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 21:23:49] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-17 21:23:49] [INFO ] After 25855ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:5
Parikh walk visited 0 properties in 47 ms.
Support contains 9 out of 513 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 513/513 places, 28429/28429 transitions.
Drop transitions removed 1062 transitions
Reduce isomorphic transitions removed 1062 transitions.
Iterating post reduction 0 with 1062 rules applied. Total rules applied 1062 place count 513 transition count 27367
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 15 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 1064 place count 512 transition count 27366
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 1 places in 15 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 1066 place count 511 transition count 27377
Free-agglomeration rule applied 12 times.
Iterating global reduction 1 with 12 rules applied. Total rules applied 1078 place count 511 transition count 27365
Reduce places removed 12 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 86 transitions
Reduce isomorphic transitions removed 88 transitions.
Iterating post reduction 1 with 100 rules applied. Total rules applied 1178 place count 499 transition count 27277
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 1179 place count 499 transition count 27457
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1180 place count 498 transition count 27457
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 1181 place count 497 transition count 27456
Applied a total of 1181 rules in 911 ms. Remains 497 /513 variables (removed 16) and now considering 27456/28429 (removed 973) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 913 ms. Remains : 497/513 places, 27456/28429 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 303 ms. (steps per millisecond=33 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 39457 steps, run timeout after 3001 ms. (steps per millisecond=13 ) properties seen :{}
Probabilistic random walk after 39457 steps, saw 27923 distinct states, run finished after 3002 ms. (steps per millisecond=13 ) properties seen :0
Running SMT prover for 5 properties.
[2023-03-17 21:23:53] [INFO ] Flow matrix only has 18727 transitions (discarded 8729 similar events)
// Phase 1: matrix 18727 rows 497 cols
[2023-03-17 21:23:53] [INFO ] Computed 8 place invariants in 62 ms
[2023-03-17 21:23:54] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-17 21:23:58] [INFO ] After 4822ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:4
[2023-03-17 21:23:59] [INFO ] State equation strengthened by 1374 read => feed constraints.
[2023-03-17 21:24:00] [INFO ] After 1324ms SMT Verify possible using 1374 Read/Feed constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-17 21:24:00] [INFO ] After 6501ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-17 21:24:00] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-17 21:24:05] [INFO ] After 4454ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-17 21:24:15] [INFO ] After 10613ms SMT Verify possible using 1374 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-17 21:24:19] [INFO ] Deduced a trap composed of 136 places in 1680 ms of which 0 ms to minimize.
[2023-03-17 21:24:21] [INFO ] Deduced a trap composed of 60 places in 1598 ms of which 0 ms to minimize.
[2023-03-17 21:24:25] [INFO ] Deduced a trap composed of 43 places in 1697 ms of which 1 ms to minimize.
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.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
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 21:24:25] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-17 21:24:25] [INFO ] After 25074ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:5
Parikh walk visited 0 properties in 17 ms.
Support contains 9 out of 497 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 497/497 places, 27456/27456 transitions.
Applied a total of 0 rules in 110 ms. Remains 497 /497 variables (removed 0) and now considering 27456/27456 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 110 ms. Remains : 497/497 places, 27456/27456 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 497/497 places, 27456/27456 transitions.
Applied a total of 0 rules in 114 ms. Remains 497 /497 variables (removed 0) and now considering 27456/27456 (removed 0) transitions.
[2023-03-17 21:24:25] [INFO ] Flow matrix only has 18727 transitions (discarded 8729 similar events)
[2023-03-17 21:24:25] [INFO ] Invariant cache hit.
[2023-03-17 21:24:26] [INFO ] Implicit Places using invariants in 919 ms returned []
Implicit Place search using SMT only with invariants took 919 ms to find 0 implicit places.
[2023-03-17 21:24:26] [INFO ] Flow matrix only has 18727 transitions (discarded 8729 similar events)
[2023-03-17 21:24:26] [INFO ] Invariant cache hit.
[2023-03-17 21:24:34] [INFO ] Dead Transitions using invariants and state equation in 7586 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8622 ms. Remains : 497/497 places, 27456/27456 transitions.
Graph (trivial) has 10075 edges and 497 vertex of which 367 / 497 are part of one of the 61 SCC in 4 ms
Free SCC test removed 306 places
Drop transitions removed 10578 transitions
Ensure Unique test removed 14187 transitions
Reduce isomorphic transitions removed 24765 transitions.
Graph (complete) has 2575 edges and 191 vertex of which 184 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.2 ms
Discarding 7 places :
Also discarding 0 output transitions
Drop transitions removed 10 transitions
Reduce isomorphic transitions removed 10 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 12 rules applied. Total rules applied 14 place count 184 transition count 2679
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 16 place count 182 transition count 2679
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 17 place count 181 transition count 2669
Iterating global reduction 2 with 1 rules applied. Total rules applied 18 place count 181 transition count 2669
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 22 place count 179 transition count 2667
Ensure Unique test removed 33 transitions
Reduce isomorphic transitions removed 33 transitions.
Iterating post reduction 2 with 33 rules applied. Total rules applied 55 place count 179 transition count 2634
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 57 place count 178 transition count 2644
Drop transitions removed 1448 transitions
Redundant transition composition rules discarded 1448 transitions
Iterating global reduction 3 with 1448 rules applied. Total rules applied 1505 place count 178 transition count 1196
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 1423 edges and 176 vertex of which 160 are kept as prefixes of interest. Removing 16 places using SCC suffix rule.0 ms
Discarding 16 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Iterating post reduction 3 with 11 rules applied. Total rules applied 1516 place count 160 transition count 1185
Drop transitions removed 102 transitions
Reduce isomorphic transitions removed 102 transitions.
Iterating post reduction 4 with 102 rules applied. Total rules applied 1618 place count 160 transition count 1083
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 1620 place count 158 transition count 1073
Iterating global reduction 5 with 2 rules applied. Total rules applied 1622 place count 158 transition count 1073
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1623 place count 158 transition count 1072
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 1625 place count 157 transition count 1071
Drop transitions removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 6 with 5 rules applied. Total rules applied 1630 place count 157 transition count 1066
Free-agglomeration rule applied 7 times with reduction of 2 identical transitions.
Iterating global reduction 6 with 7 rules applied. Total rules applied 1637 place count 157 transition count 1057
Reduce places removed 7 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 6 with 12 rules applied. Total rules applied 1649 place count 150 transition count 1052
Drop transitions removed 28 transitions
Redundant transition composition rules discarded 28 transitions
Iterating global reduction 7 with 28 rules applied. Total rules applied 1677 place count 150 transition count 1024
Free-agglomeration rule applied 2 times.
Iterating global reduction 7 with 2 rules applied. Total rules applied 1679 place count 150 transition count 1022
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 1681 place count 148 transition count 1022
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 8 with 3 rules applied. Total rules applied 1684 place count 148 transition count 1019
Free-agglomeration rule (complex) applied 5 times with reduction of 3 identical transitions.
Iterating global reduction 8 with 5 rules applied. Total rules applied 1689 place count 148 transition count 1132
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 8 with 17 rules applied. Total rules applied 1706 place count 143 transition count 1120
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 1707 place count 142 transition count 1115
Iterating global reduction 9 with 1 rules applied. Total rules applied 1708 place count 142 transition count 1115
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 9 with 9 rules applied. Total rules applied 1717 place count 142 transition count 1106
Drop transitions removed 23 transitions
Redundant transition composition rules discarded 23 transitions
Iterating global reduction 10 with 23 rules applied. Total rules applied 1740 place count 142 transition count 1083
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 10 with 2 rules applied. Total rules applied 1742 place count 142 transition count 1083
Applied a total of 1742 rules in 322 ms. Remains 142 /497 variables (removed 355) and now considering 1083/27456 (removed 26373) transitions.
Running SMT prover for 5 properties.
[2023-03-17 21:24:34] [INFO ] Flow matrix only has 1052 transitions (discarded 31 similar events)
// Phase 1: matrix 1052 rows 142 cols
[2023-03-17 21:24:34] [INFO ] Computed 0 place invariants in 17 ms
[2023-03-17 21:24:35] [INFO ] After 509ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-17 21:24:35] [INFO ] After 238ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-17 21:24:35] [INFO ] State equation strengthened by 11 read => feed constraints.
[2023-03-17 21:24:35] [INFO ] After 129ms SMT Verify possible using 11 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-17 21:24:35] [INFO ] After 307ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 116 ms.
[2023-03-17 21:24:35] [INFO ] After 714ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Computed a total of 121 stabilizing places and 10286 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' '!(F(G(p0)))'
Support contains 1 out of 513 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 513/513 places, 28429/28429 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 9 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 511 transition count 28427
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 1 places in 9 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 510 transition count 28438
Applied a total of 4 rules in 294 ms. Remains 510 /513 variables (removed 3) and now considering 28438/28429 (removed -9) transitions.
[2023-03-17 21:24:36] [INFO ] Flow matrix only has 18682 transitions (discarded 9756 similar events)
// Phase 1: matrix 18682 rows 510 cols
[2023-03-17 21:24:36] [INFO ] Computed 8 place invariants in 78 ms
[2023-03-17 21:24:37] [INFO ] Implicit Places using invariants in 866 ms returned []
Implicit Place search using SMT only with invariants took 868 ms to find 0 implicit places.
[2023-03-17 21:24:37] [INFO ] Flow matrix only has 18682 transitions (discarded 9756 similar events)
[2023-03-17 21:24:37] [INFO ] Invariant cache hit.
[2023-03-17 21:24:45] [INFO ] Dead Transitions using invariants and state equation in 7770 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 510/513 places, 28438/28429 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 8936 ms. Remains : 510/513 places, 28438/28429 transitions.
Stuttering acceptance computed with spot in 120 ms :[(NOT p0)]
Running random walk in product with property : RERS2020-PT-pb103-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s429 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 2305 ms.
Product exploration explored 100000 steps with 0 reset in 2215 ms.
Computed a total of 118 stabilizing places and 10295 stable transitions
Computed a total of 118 stabilizing places and 10295 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 101 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 188 ms. (steps per millisecond=53 ) properties (out of 1) seen :0
Finished Best-First random walk after 3643 steps, including 1 resets, run visited all 1 properties in 12 ms. (steps per millisecond=303 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 116 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Support contains 1 out of 510 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 510/510 places, 28438/28438 transitions.
Applied a total of 0 rules in 112 ms. Remains 510 /510 variables (removed 0) and now considering 28438/28438 (removed 0) transitions.
[2023-03-17 21:24:50] [INFO ] Flow matrix only has 18682 transitions (discarded 9756 similar events)
[2023-03-17 21:24:50] [INFO ] Invariant cache hit.
[2023-03-17 21:24:51] [INFO ] Implicit Places using invariants in 757 ms returned []
Implicit Place search using SMT only with invariants took 759 ms to find 0 implicit places.
[2023-03-17 21:24:51] [INFO ] Flow matrix only has 18682 transitions (discarded 9756 similar events)
[2023-03-17 21:24:51] [INFO ] Invariant cache hit.
[2023-03-17 21:24:59] [INFO ] Dead Transitions using invariants and state equation in 7912 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 8785 ms. Remains : 510/510 places, 28438/28438 transitions.
Computed a total of 118 stabilizing places and 10295 stable transitions
Computed a total of 118 stabilizing places and 10295 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 128 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 198 ms. (steps per millisecond=50 ) properties (out of 1) seen :0
Finished Best-First random walk after 3715 steps, including 1 resets, run visited all 1 properties in 12 ms. (steps per millisecond=309 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 129 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Product exploration explored 100000 steps with 0 reset in 2149 ms.
Product exploration explored 100000 steps with 0 reset in 1850 ms.
Support contains 1 out of 510 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 510/510 places, 28438/28438 transitions.
Applied a total of 0 rules in 110 ms. Remains 510 /510 variables (removed 0) and now considering 28438/28438 (removed 0) transitions.
[2023-03-17 21:25:04] [INFO ] Flow matrix only has 18682 transitions (discarded 9756 similar events)
[2023-03-17 21:25:04] [INFO ] Invariant cache hit.
[2023-03-17 21:25:05] [INFO ] Implicit Places using invariants in 769 ms returned []
Implicit Place search using SMT only with invariants took 770 ms to find 0 implicit places.
[2023-03-17 21:25:05] [INFO ] Flow matrix only has 18682 transitions (discarded 9756 similar events)
[2023-03-17 21:25:05] [INFO ] Invariant cache hit.
[2023-03-17 21:25:12] [INFO ] Dead Transitions using invariants and state equation in 7765 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 8650 ms. Remains : 510/510 places, 28438/28438 transitions.
Treatment of property RERS2020-PT-pb103-LTLCardinality-01 finished in 37935 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(F(p0))))'
Support contains 2 out of 513 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 513/513 places, 28429/28429 transitions.
Applied a total of 0 rules in 35 ms. Remains 513 /513 variables (removed 0) and now considering 28429/28429 (removed 0) transitions.
[2023-03-17 21:25:14] [INFO ] Flow matrix only has 18674 transitions (discarded 9755 similar events)
// Phase 1: matrix 18674 rows 513 cols
[2023-03-17 21:25:14] [INFO ] Computed 8 place invariants in 55 ms
[2023-03-17 21:25:15] [INFO ] Implicit Places using invariants in 886 ms returned []
Implicit Place search using SMT only with invariants took 887 ms to find 0 implicit places.
[2023-03-17 21:25:15] [INFO ] Flow matrix only has 18674 transitions (discarded 9755 similar events)
[2023-03-17 21:25:15] [INFO ] Invariant cache hit.
[2023-03-17 21:25:23] [INFO ] Dead Transitions using invariants and state equation in 8087 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9010 ms. Remains : 513/513 places, 28429/28429 transitions.
Stuttering acceptance computed with spot in 116 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : RERS2020-PT-pb103-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(OR (EQ s60 0) (EQ s179 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 3049 ms.
Product exploration explored 100000 steps with 33333 reset in 3388 ms.
Computed a total of 121 stabilizing places and 10286 stable transitions
Computed a total of 121 stabilizing places and 10286 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p0))
Knowledge based reduction with 2 factoid took 48 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA RERS2020-PT-pb103-LTLCardinality-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property RERS2020-PT-pb103-LTLCardinality-02 finished in 15769 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)||(p1 U p2))))'
Support contains 3 out of 513 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 513/513 places, 28429/28429 transitions.
Applied a total of 0 rules in 32 ms. Remains 513 /513 variables (removed 0) and now considering 28429/28429 (removed 0) transitions.
[2023-03-17 21:25:29] [INFO ] Flow matrix only has 18674 transitions (discarded 9755 similar events)
[2023-03-17 21:25:29] [INFO ] Invariant cache hit.
[2023-03-17 21:25:30] [INFO ] Implicit Places using invariants in 789 ms returned []
Implicit Place search using SMT only with invariants took 790 ms to find 0 implicit places.
[2023-03-17 21:25:30] [INFO ] Flow matrix only has 18674 transitions (discarded 9755 similar events)
[2023-03-17 21:25:30] [INFO ] Invariant cache hit.
[2023-03-17 21:25:38] [INFO ] Dead Transitions using invariants and state equation in 7864 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8688 ms. Remains : 513/513 places, 28429/28429 transitions.
Stuttering acceptance computed with spot in 166 ms :[true, (NOT p2), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p0)]
Running random walk in product with property : RERS2020-PT-pb103-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p2) p1), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=3 dest: 1}, { cond=(AND p0 (NOT p2) p1), acceptance={} source=3 dest: 3}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={} source=4 dest: 0}, { cond=p0, acceptance={} source=4 dest: 4}]], initial=2, aps=[p2:(EQ s393 1), p1:(OR (EQ s201 0) (EQ s510 1)), p0:(AND (EQ s510 0) (EQ s201 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 60 steps with 0 reset in 2 ms.
FORMULA RERS2020-PT-pb103-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RERS2020-PT-pb103-LTLCardinality-03 finished in 8903 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X(X(F(p1)))))'
Support contains 4 out of 513 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 513/513 places, 28429/28429 transitions.
Applied a total of 0 rules in 32 ms. Remains 513 /513 variables (removed 0) and now considering 28429/28429 (removed 0) transitions.
[2023-03-17 21:25:38] [INFO ] Flow matrix only has 18674 transitions (discarded 9755 similar events)
[2023-03-17 21:25:38] [INFO ] Invariant cache hit.
[2023-03-17 21:25:39] [INFO ] Implicit Places using invariants in 742 ms returned []
Implicit Place search using SMT only with invariants took 743 ms to find 0 implicit places.
[2023-03-17 21:25:39] [INFO ] Flow matrix only has 18674 transitions (discarded 9755 similar events)
[2023-03-17 21:25:39] [INFO ] Invariant cache hit.
[2023-03-17 21:25:47] [INFO ] Dead Transitions using invariants and state equation in 7721 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8499 ms. Remains : 513/513 places, 28429/28429 transitions.
Stuttering acceptance computed with spot in 207 ms :[(NOT p1), (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : RERS2020-PT-pb103-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 1}, { cond=p0, acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 4}]], initial=2, aps=[p1:(AND (EQ s225 0) (EQ s140 1)), p0:(OR (EQ s439 0) (EQ s189 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 412 steps with 0 reset in 11 ms.
FORMULA RERS2020-PT-pb103-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RERS2020-PT-pb103-LTLCardinality-04 finished in 8765 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(X((X(F(X((F(p0) U !p0)))) U p1))))'
Support contains 3 out of 513 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 513/513 places, 28429/28429 transitions.
Applied a total of 0 rules in 33 ms. Remains 513 /513 variables (removed 0) and now considering 28429/28429 (removed 0) transitions.
[2023-03-17 21:25:47] [INFO ] Flow matrix only has 18674 transitions (discarded 9755 similar events)
[2023-03-17 21:25:47] [INFO ] Invariant cache hit.
[2023-03-17 21:25:48] [INFO ] Implicit Places using invariants in 906 ms returned []
Implicit Place search using SMT only with invariants took 907 ms to find 0 implicit places.
[2023-03-17 21:25:48] [INFO ] Flow matrix only has 18674 transitions (discarded 9755 similar events)
[2023-03-17 21:25:48] [INFO ] Invariant cache hit.
[2023-03-17 21:25:56] [INFO ] Dead Transitions using invariants and state equation in 7853 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8797 ms. Remains : 513/513 places, 28429/28429 transitions.
Stuttering acceptance computed with spot in 161 ms :[(NOT p1), (NOT p1), (OR (NOT p1) p0), p0]
Running random walk in product with property : RERS2020-PT-pb103-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}, { cond=p1, acceptance={0} source=2 dest: 3}], [{ cond=p0, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(OR (EQ s419 0) (EQ s33 1)), p0:(EQ s132 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]]
Product exploration explored 100000 steps with 0 reset in 2187 ms.
Product exploration explored 100000 steps with 0 reset in 2283 ms.
Computed a total of 121 stabilizing places and 10286 stable transitions
Computed a total of 121 stabilizing places and 10286 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X p1), true, (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 198 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 167 ms :[(NOT p1), (NOT p1), (OR (NOT p1) p0), p0]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 332 ms. (steps per millisecond=30 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-17 21:26:01] [INFO ] Flow matrix only has 18674 transitions (discarded 9755 similar events)
[2023-03-17 21:26:01] [INFO ] Invariant cache hit.
[2023-03-17 21:26:02] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2023-03-17 21:26:05] [INFO ] After 3345ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-17 21:26:05] [INFO ] State equation strengthened by 1379 read => feed constraints.
[2023-03-17 21:26:07] [INFO ] After 1756ms SMT Verify possible using 1379 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-17 21:26:07] [INFO ] After 5364ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-17 21:26:07] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2023-03-17 21:26:10] [INFO ] After 3189ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-17 21:26:15] [INFO ] After 5381ms SMT Verify possible using 1379 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-17 21:26:18] [INFO ] Deduced a trap composed of 85 places in 1960 ms of which 1 ms to minimize.
[2023-03-17 21:26:20] [INFO ] Deduced a trap composed of 96 places in 1791 ms of which 0 ms to minimize.
[2023-03-17 21:26:22] [INFO ] Deduced a trap composed of 53 places in 1573 ms of which 0 ms to minimize.
[2023-03-17 21:26:23] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 7001 ms
[2023-03-17 21:26:23] [INFO ] After 12700ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 1908 ms.
[2023-03-17 21:26:25] [INFO ] After 17904ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 5 ms.
Support contains 1 out of 513 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 513/513 places, 28429/28429 transitions.
Drop transitions removed 1062 transitions
Reduce isomorphic transitions removed 1062 transitions.
Iterating post reduction 0 with 1062 rules applied. Total rules applied 1062 place count 513 transition count 27367
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 11 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 1064 place count 512 transition count 27366
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 1 places in 10 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 1066 place count 511 transition count 27377
Free-agglomeration rule applied 12 times.
Iterating global reduction 1 with 12 rules applied. Total rules applied 1078 place count 511 transition count 27365
Reduce places removed 12 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 86 transitions
Reduce isomorphic transitions removed 88 transitions.
Iterating post reduction 1 with 100 rules applied. Total rules applied 1178 place count 499 transition count 27277
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 1179 place count 499 transition count 27457
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1180 place count 498 transition count 27457
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 1181 place count 497 transition count 27456
Applied a total of 1181 rules in 687 ms. Remains 497 /513 variables (removed 16) and now considering 27456/28429 (removed 973) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 703 ms. Remains : 497/513 places, 27456/28429 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 205 ms. (steps per millisecond=48 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 37352 steps, run timeout after 3001 ms. (steps per millisecond=12 ) properties seen :{}
Probabilistic random walk after 37352 steps, saw 26433 distinct states, run finished after 3001 ms. (steps per millisecond=12 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-17 21:26:29] [INFO ] Flow matrix only has 18727 transitions (discarded 8729 similar events)
// Phase 1: matrix 18727 rows 497 cols
[2023-03-17 21:26:29] [INFO ] Computed 8 place invariants in 55 ms
[2023-03-17 21:26:29] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-17 21:26:32] [INFO ] After 3391ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-17 21:26:32] [INFO ] State equation strengthened by 1374 read => feed constraints.
[2023-03-17 21:26:34] [INFO ] After 1202ms SMT Verify possible using 1374 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-17 21:26:34] [INFO ] After 4794ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-17 21:26:34] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2023-03-17 21:26:37] [INFO ] After 3269ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-17 21:26:42] [INFO ] After 5315ms SMT Verify possible using 1374 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-17 21:26:44] [INFO ] Deduced a trap composed of 51 places in 1697 ms of which 13 ms to minimize.
[2023-03-17 21:26:46] [INFO ] Deduced a trap composed of 185 places in 1702 ms of which 0 ms to minimize.
[2023-03-17 21:26:48] [INFO ] Deduced a trap composed of 19 places in 1680 ms of which 0 ms to minimize.
[2023-03-17 21:26:51] [INFO ] Deduced a trap composed of 121 places in 1706 ms of which 0 ms to minimize.
[2023-03-17 21:26:53] [INFO ] Deduced a trap composed of 144 places in 1790 ms of which 0 ms to minimize.
[2023-03-17 21:26:56] [INFO ] Deduced a trap composed of 118 places in 1796 ms of which 0 ms to minimize.
[2023-03-17 21:26:58] [INFO ] Deduced a trap composed of 164 places in 1711 ms of which 0 ms to minimize.
[2023-03-17 21:27:00] [INFO ] Deduced a trap composed of 92 places in 1627 ms of which 1 ms to minimize.
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.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
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 21:27:00] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-17 21:27:00] [INFO ] After 26077ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 5 ms.
Support contains 1 out of 497 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 497/497 places, 27456/27456 transitions.
Applied a total of 0 rules in 97 ms. Remains 497 /497 variables (removed 0) and now considering 27456/27456 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 97 ms. Remains : 497/497 places, 27456/27456 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 497/497 places, 27456/27456 transitions.
Applied a total of 0 rules in 94 ms. Remains 497 /497 variables (removed 0) and now considering 27456/27456 (removed 0) transitions.
[2023-03-17 21:27:00] [INFO ] Flow matrix only has 18727 transitions (discarded 8729 similar events)
[2023-03-17 21:27:00] [INFO ] Invariant cache hit.
[2023-03-17 21:27:01] [INFO ] Implicit Places using invariants in 999 ms returned []
Implicit Place search using SMT only with invariants took 1002 ms to find 0 implicit places.
[2023-03-17 21:27:01] [INFO ] Flow matrix only has 18727 transitions (discarded 8729 similar events)
[2023-03-17 21:27:01] [INFO ] Invariant cache hit.
[2023-03-17 21:27:08] [INFO ] Dead Transitions using invariants and state equation in 7459 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8563 ms. Remains : 497/497 places, 27456/27456 transitions.
Graph (trivial) has 10337 edges and 497 vertex of which 381 / 497 are part of one of the 62 SCC in 2 ms
Free SCC test removed 319 places
Drop transitions removed 11224 transitions
Ensure Unique test removed 13923 transitions
Reduce isomorphic transitions removed 25147 transitions.
Graph (complete) has 2322 edges and 178 vertex of which 171 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.1 ms
Discarding 7 places :
Also discarding 0 output transitions
Drop transitions removed 10 transitions
Reduce isomorphic transitions removed 10 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 12 rules applied. Total rules applied 14 place count 171 transition count 2297
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 16 place count 169 transition count 2297
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 17 place count 168 transition count 2287
Iterating global reduction 2 with 1 rules applied. Total rules applied 18 place count 168 transition count 2287
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 22 place count 166 transition count 2285
Ensure Unique test removed 33 transitions
Reduce isomorphic transitions removed 33 transitions.
Iterating post reduction 2 with 33 rules applied. Total rules applied 55 place count 166 transition count 2252
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 57 place count 165 transition count 2262
Drop transitions removed 1209 transitions
Redundant transition composition rules discarded 1209 transitions
Iterating global reduction 3 with 1209 rules applied. Total rules applied 1266 place count 165 transition count 1053
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 1233 edges and 163 vertex of which 144 are kept as prefixes of interest. Removing 19 places using SCC suffix rule.0 ms
Discarding 19 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Iterating post reduction 3 with 11 rules applied. Total rules applied 1277 place count 144 transition count 1042
Drop transitions removed 111 transitions
Reduce isomorphic transitions removed 111 transitions.
Iterating post reduction 4 with 111 rules applied. Total rules applied 1388 place count 144 transition count 931
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 1390 place count 142 transition count 921
Iterating global reduction 5 with 2 rules applied. Total rules applied 1392 place count 142 transition count 921
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1393 place count 142 transition count 920
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 1395 place count 141 transition count 919
Drop transitions removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 6 with 5 rules applied. Total rules applied 1400 place count 141 transition count 914
Free-agglomeration rule applied 12 times with reduction of 7 identical transitions.
Iterating global reduction 6 with 12 rules applied. Total rules applied 1412 place count 141 transition count 895
Reduce places removed 12 places and 0 transitions.
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 6 with 32 rules applied. Total rules applied 1444 place count 129 transition count 875
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1445 place count 128 transition count 873
Iterating global reduction 7 with 1 rules applied. Total rules applied 1446 place count 128 transition count 873
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 7 with 8 rules applied. Total rules applied 1454 place count 128 transition count 865
Drop transitions removed 58 transitions
Redundant transition composition rules discarded 58 transitions
Iterating global reduction 8 with 58 rules applied. Total rules applied 1512 place count 128 transition count 807
Free-agglomeration rule applied 6 times.
Iterating global reduction 8 with 6 rules applied. Total rules applied 1518 place count 128 transition count 801
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 8 with 10 rules applied. Total rules applied 1528 place count 122 transition count 797
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 9 with 6 rules applied. Total rules applied 1534 place count 122 transition count 791
Free-agglomeration rule applied 2 times.
Iterating global reduction 9 with 2 rules applied. Total rules applied 1536 place count 122 transition count 789
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 9 with 4 rules applied. Total rules applied 1540 place count 120 transition count 787
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 10 with 4 rules applied. Total rules applied 1544 place count 120 transition count 783
Free-agglomeration rule applied 2 times.
Iterating global reduction 10 with 2 rules applied. Total rules applied 1546 place count 120 transition count 781
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 10 with 4 rules applied. Total rules applied 1550 place count 118 transition count 779
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 11 with 2 rules applied. Total rules applied 1552 place count 118 transition count 777
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 11 with 5 rules applied. Total rules applied 1557 place count 118 transition count 855
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 11 with 17 rules applied. Total rules applied 1574 place count 113 transition count 843
Discarding 1 places :
Symmetric choice reduction at 12 with 1 rule applications. Total rules 1575 place count 112 transition count 839
Iterating global reduction 12 with 1 rules applied. Total rules applied 1576 place count 112 transition count 839
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 12 with 9 rules applied. Total rules applied 1585 place count 112 transition count 830
Drop transitions removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 13 with 19 rules applied. Total rules applied 1604 place count 112 transition count 811
Applied a total of 1604 rules in 239 ms. Remains 112 /497 variables (removed 385) and now considering 811/27456 (removed 26645) transitions.
Running SMT prover for 1 properties.
[2023-03-17 21:27:09] [INFO ] Flow matrix only has 779 transitions (discarded 32 similar events)
// Phase 1: matrix 779 rows 112 cols
[2023-03-17 21:27:09] [INFO ] Computed 0 place invariants in 2 ms
[2023-03-17 21:27:09] [INFO ] After 113ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-17 21:27:09] [INFO ] State equation strengthened by 13 read => feed constraints.
[2023-03-17 21:27:09] [INFO ] After 18ms SMT Verify possible using 13 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-17 21:27:09] [INFO ] After 245ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-17 21:27:09] [INFO ] After 107ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-17 21:27:09] [INFO ] After 28ms SMT Verify possible using 13 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-17 21:27:09] [INFO ] After 62ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 16 ms.
[2023-03-17 21:27:09] [INFO ] After 223ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p1 (NOT p0)), (X p1), true, (X (X p1))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 4 factoid took 179 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 139 ms :[(NOT p1), (NOT p1), (OR (NOT p1) p0), p0]
Stuttering acceptance computed with spot in 146 ms :[(NOT p1), (NOT p1), (OR (NOT p1) p0), p0]
Support contains 3 out of 513 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 513/513 places, 28429/28429 transitions.
Applied a total of 0 rules in 30 ms. Remains 513 /513 variables (removed 0) and now considering 28429/28429 (removed 0) transitions.
[2023-03-17 21:27:10] [INFO ] Flow matrix only has 18674 transitions (discarded 9755 similar events)
// Phase 1: matrix 18674 rows 513 cols
[2023-03-17 21:27:10] [INFO ] Computed 8 place invariants in 50 ms
[2023-03-17 21:27:10] [INFO ] Implicit Places using invariants in 806 ms returned []
Implicit Place search using SMT only with invariants took 807 ms to find 0 implicit places.
[2023-03-17 21:27:10] [INFO ] Flow matrix only has 18674 transitions (discarded 9755 similar events)
[2023-03-17 21:27:10] [INFO ] Invariant cache hit.
[2023-03-17 21:27:18] [INFO ] Dead Transitions using invariants and state equation in 7874 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8712 ms. Remains : 513/513 places, 28429/28429 transitions.
Computed a total of 121 stabilizing places and 10286 stable transitions
Computed a total of 121 stabilizing places and 10286 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X p1), true, (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 192 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 124 ms :[(NOT p1), (NOT p1), (OR (NOT p1) p0), p0]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 278 ms. (steps per millisecond=35 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-17 21:27:19] [INFO ] Flow matrix only has 18674 transitions (discarded 9755 similar events)
[2023-03-17 21:27:19] [INFO ] Invariant cache hit.
[2023-03-17 21:27:19] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2023-03-17 21:27:22] [INFO ] After 3284ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-17 21:27:23] [INFO ] State equation strengthened by 1379 read => feed constraints.
[2023-03-17 21:27:24] [INFO ] After 1730ms SMT Verify possible using 1379 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-17 21:27:24] [INFO ] After 5224ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-17 21:27:24] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2023-03-17 21:27:28] [INFO ] After 3210ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-17 21:27:33] [INFO ] After 5169ms SMT Verify possible using 1379 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-17 21:27:35] [INFO ] Deduced a trap composed of 85 places in 1865 ms of which 0 ms to minimize.
[2023-03-17 21:27:37] [INFO ] Deduced a trap composed of 96 places in 1898 ms of which 0 ms to minimize.
[2023-03-17 21:27:39] [INFO ] Deduced a trap composed of 53 places in 1532 ms of which 0 ms to minimize.
[2023-03-17 21:27:40] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 6793 ms
[2023-03-17 21:27:40] [INFO ] After 12268ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 1569 ms.
[2023-03-17 21:27:41] [INFO ] After 17145ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 4 ms.
Support contains 1 out of 513 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 513/513 places, 28429/28429 transitions.
Drop transitions removed 1062 transitions
Reduce isomorphic transitions removed 1062 transitions.
Iterating post reduction 0 with 1062 rules applied. Total rules applied 1062 place count 513 transition count 27367
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 9 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 1064 place count 512 transition count 27366
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 1 places in 9 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 1066 place count 511 transition count 27377
Free-agglomeration rule applied 12 times.
Iterating global reduction 1 with 12 rules applied. Total rules applied 1078 place count 511 transition count 27365
Reduce places removed 12 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 86 transitions
Reduce isomorphic transitions removed 88 transitions.
Iterating post reduction 1 with 100 rules applied. Total rules applied 1178 place count 499 transition count 27277
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 1179 place count 499 transition count 27457
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1180 place count 498 transition count 27457
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 1181 place count 497 transition count 27456
Applied a total of 1181 rules in 558 ms. Remains 497 /513 variables (removed 16) and now considering 27456/28429 (removed 973) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 559 ms. Remains : 497/513 places, 27456/28429 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 188 ms. (steps per millisecond=53 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 39414 steps, run timeout after 3001 ms. (steps per millisecond=13 ) properties seen :{}
Probabilistic random walk after 39414 steps, saw 27886 distinct states, run finished after 3002 ms. (steps per millisecond=13 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-17 21:27:45] [INFO ] Flow matrix only has 18727 transitions (discarded 8729 similar events)
// Phase 1: matrix 18727 rows 497 cols
[2023-03-17 21:27:45] [INFO ] Computed 8 place invariants in 48 ms
[2023-03-17 21:27:45] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2023-03-17 21:27:49] [INFO ] After 3377ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-17 21:27:49] [INFO ] State equation strengthened by 1374 read => feed constraints.
[2023-03-17 21:27:50] [INFO ] After 1179ms SMT Verify possible using 1374 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-17 21:27:50] [INFO ] After 4741ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-17 21:27:50] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2023-03-17 21:27:53] [INFO ] After 3246ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-17 21:27:59] [INFO ] After 5609ms SMT Verify possible using 1374 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-17 21:28:01] [INFO ] Deduced a trap composed of 51 places in 1690 ms of which 0 ms to minimize.
[2023-03-17 21:28:03] [INFO ] Deduced a trap composed of 185 places in 1809 ms of which 1 ms to minimize.
[2023-03-17 21:28:05] [INFO ] Deduced a trap composed of 19 places in 1698 ms of which 2 ms to minimize.
[2023-03-17 21:28:08] [INFO ] Deduced a trap composed of 121 places in 1717 ms of which 1 ms to minimize.
[2023-03-17 21:28:10] [INFO ] Deduced a trap composed of 144 places in 1820 ms of which 0 ms to minimize.
[2023-03-17 21:28:13] [INFO ] Deduced a trap composed of 118 places in 1820 ms of which 1 ms to minimize.
[2023-03-17 21:28:15] [INFO ] Deduced a trap composed of 164 places in 1723 ms of which 0 ms to minimize.
[2023-03-17 21:28:17] [INFO ] Deduced a trap composed of 12 places in 2133 ms of which 0 ms to minimize.
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.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
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 21:28:17] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-17 21:28:17] [INFO ] After 27170ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 3 ms.
Support contains 1 out of 497 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 497/497 places, 27456/27456 transitions.
Applied a total of 0 rules in 98 ms. Remains 497 /497 variables (removed 0) and now considering 27456/27456 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 98 ms. Remains : 497/497 places, 27456/27456 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 497/497 places, 27456/27456 transitions.
Applied a total of 0 rules in 99 ms. Remains 497 /497 variables (removed 0) and now considering 27456/27456 (removed 0) transitions.
[2023-03-17 21:28:17] [INFO ] Flow matrix only has 18727 transitions (discarded 8729 similar events)
[2023-03-17 21:28:17] [INFO ] Invariant cache hit.
[2023-03-17 21:28:18] [INFO ] Implicit Places using invariants in 898 ms returned []
Implicit Place search using SMT only with invariants took 899 ms to find 0 implicit places.
[2023-03-17 21:28:18] [INFO ] Flow matrix only has 18727 transitions (discarded 8729 similar events)
[2023-03-17 21:28:18] [INFO ] Invariant cache hit.
[2023-03-17 21:28:26] [INFO ] Dead Transitions using invariants and state equation in 7623 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8626 ms. Remains : 497/497 places, 27456/27456 transitions.
Graph (trivial) has 10337 edges and 497 vertex of which 381 / 497 are part of one of the 62 SCC in 1 ms
Free SCC test removed 319 places
Drop transitions removed 11224 transitions
Ensure Unique test removed 13923 transitions
Reduce isomorphic transitions removed 25147 transitions.
Graph (complete) has 2322 edges and 178 vertex of which 171 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.1 ms
Discarding 7 places :
Also discarding 0 output transitions
Drop transitions removed 10 transitions
Reduce isomorphic transitions removed 10 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 12 rules applied. Total rules applied 14 place count 171 transition count 2297
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 16 place count 169 transition count 2297
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 17 place count 168 transition count 2287
Iterating global reduction 2 with 1 rules applied. Total rules applied 18 place count 168 transition count 2287
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 22 place count 166 transition count 2285
Ensure Unique test removed 33 transitions
Reduce isomorphic transitions removed 33 transitions.
Iterating post reduction 2 with 33 rules applied. Total rules applied 55 place count 166 transition count 2252
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 57 place count 165 transition count 2262
Drop transitions removed 1209 transitions
Redundant transition composition rules discarded 1209 transitions
Iterating global reduction 3 with 1209 rules applied. Total rules applied 1266 place count 165 transition count 1053
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 1233 edges and 163 vertex of which 144 are kept as prefixes of interest. Removing 19 places using SCC suffix rule.0 ms
Discarding 19 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Iterating post reduction 3 with 11 rules applied. Total rules applied 1277 place count 144 transition count 1042
Drop transitions removed 111 transitions
Reduce isomorphic transitions removed 111 transitions.
Iterating post reduction 4 with 111 rules applied. Total rules applied 1388 place count 144 transition count 931
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 1390 place count 142 transition count 921
Iterating global reduction 5 with 2 rules applied. Total rules applied 1392 place count 142 transition count 921
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1393 place count 142 transition count 920
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 1395 place count 141 transition count 919
Drop transitions removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 6 with 5 rules applied. Total rules applied 1400 place count 141 transition count 914
Free-agglomeration rule applied 12 times with reduction of 7 identical transitions.
Iterating global reduction 6 with 12 rules applied. Total rules applied 1412 place count 141 transition count 895
Reduce places removed 12 places and 0 transitions.
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 6 with 32 rules applied. Total rules applied 1444 place count 129 transition count 875
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1445 place count 128 transition count 873
Iterating global reduction 7 with 1 rules applied. Total rules applied 1446 place count 128 transition count 873
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 7 with 8 rules applied. Total rules applied 1454 place count 128 transition count 865
Drop transitions removed 58 transitions
Redundant transition composition rules discarded 58 transitions
Iterating global reduction 8 with 58 rules applied. Total rules applied 1512 place count 128 transition count 807
Free-agglomeration rule applied 6 times.
Iterating global reduction 8 with 6 rules applied. Total rules applied 1518 place count 128 transition count 801
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 8 with 10 rules applied. Total rules applied 1528 place count 122 transition count 797
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 9 with 6 rules applied. Total rules applied 1534 place count 122 transition count 791
Free-agglomeration rule applied 2 times.
Iterating global reduction 9 with 2 rules applied. Total rules applied 1536 place count 122 transition count 789
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 9 with 4 rules applied. Total rules applied 1540 place count 120 transition count 787
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 10 with 4 rules applied. Total rules applied 1544 place count 120 transition count 783
Free-agglomeration rule applied 2 times.
Iterating global reduction 10 with 2 rules applied. Total rules applied 1546 place count 120 transition count 781
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 10 with 4 rules applied. Total rules applied 1550 place count 118 transition count 779
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 11 with 2 rules applied. Total rules applied 1552 place count 118 transition count 777
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 11 with 5 rules applied. Total rules applied 1557 place count 118 transition count 855
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 11 with 17 rules applied. Total rules applied 1574 place count 113 transition count 843
Discarding 1 places :
Symmetric choice reduction at 12 with 1 rule applications. Total rules 1575 place count 112 transition count 839
Iterating global reduction 12 with 1 rules applied. Total rules applied 1576 place count 112 transition count 839
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 12 with 9 rules applied. Total rules applied 1585 place count 112 transition count 830
Drop transitions removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 13 with 19 rules applied. Total rules applied 1604 place count 112 transition count 811
Applied a total of 1604 rules in 219 ms. Remains 112 /497 variables (removed 385) and now considering 811/27456 (removed 26645) transitions.
Running SMT prover for 1 properties.
[2023-03-17 21:28:26] [INFO ] Flow matrix only has 779 transitions (discarded 32 similar events)
// Phase 1: matrix 779 rows 112 cols
[2023-03-17 21:28:26] [INFO ] Computed 0 place invariants in 6 ms
[2023-03-17 21:28:26] [INFO ] After 111ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-17 21:28:26] [INFO ] State equation strengthened by 13 read => feed constraints.
[2023-03-17 21:28:26] [INFO ] After 21ms SMT Verify possible using 13 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-17 21:28:26] [INFO ] After 167ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-17 21:28:26] [INFO ] After 107ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-17 21:28:27] [INFO ] After 29ms SMT Verify possible using 13 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-17 21:28:27] [INFO ] After 54ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 18 ms.
[2023-03-17 21:28:27] [INFO ] After 208ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p1 (NOT p0)), (X p1), true, (X (X p1))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 4 factoid took 211 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 239 ms :[(NOT p1), (NOT p1), (OR (NOT p1) p0), p0]
Stuttering acceptance computed with spot in 141 ms :[(NOT p1), (NOT p1), (OR (NOT p1) p0), p0]
Stuttering acceptance computed with spot in 151 ms :[(NOT p1), (NOT p1), (OR (NOT p1) p0), p0]
Product exploration explored 100000 steps with 0 reset in 1974 ms.
Product exploration explored 100000 steps with 0 reset in 2219 ms.
Applying partial POR strategy [false, false, false, true]
Stuttering acceptance computed with spot in 203 ms :[(NOT p1), (NOT p1), (OR (NOT p1) p0), p0]
Support contains 3 out of 513 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 513/513 places, 28429/28429 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 10 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 513 transition count 28429
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 2 places in 10 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 513 transition count 28442
Deduced a syphon composed of 2 places in 10 ms
Applied a total of 2 rules in 251 ms. Remains 513 /513 variables (removed 0) and now considering 28442/28429 (removed -13) transitions.
[2023-03-17 21:28:32] [INFO ] Flow matrix only has 18686 transitions (discarded 9756 similar events)
// Phase 1: matrix 18686 rows 513 cols
[2023-03-17 21:28:32] [INFO ] Computed 8 place invariants in 49 ms
[2023-03-17 21:28:40] [INFO ] Dead Transitions using invariants and state equation in 7918 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 513/513 places, 28442/28429 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 8170 ms. Remains : 513/513 places, 28442/28429 transitions.
Support contains 3 out of 513 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 513/513 places, 28429/28429 transitions.
Applied a total of 0 rules in 30 ms. Remains 513 /513 variables (removed 0) and now considering 28429/28429 (removed 0) transitions.
[2023-03-17 21:28:40] [INFO ] Flow matrix only has 18674 transitions (discarded 9755 similar events)
// Phase 1: matrix 18674 rows 513 cols
[2023-03-17 21:28:40] [INFO ] Computed 8 place invariants in 45 ms
[2023-03-17 21:28:41] [INFO ] Implicit Places using invariants in 833 ms returned []
Implicit Place search using SMT only with invariants took 834 ms to find 0 implicit places.
[2023-03-17 21:28:41] [INFO ] Flow matrix only has 18674 transitions (discarded 9755 similar events)
[2023-03-17 21:28:41] [INFO ] Invariant cache hit.
[2023-03-17 21:28:49] [INFO ] Dead Transitions using invariants and state equation in 7994 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8860 ms. Remains : 513/513 places, 28429/28429 transitions.
Treatment of property RERS2020-PT-pb103-LTLCardinality-05 finished in 182759 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((p1||G(p2))))&&p0)))'
Support contains 4 out of 513 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 513/513 places, 28429/28429 transitions.
Applied a total of 0 rules in 32 ms. Remains 513 /513 variables (removed 0) and now considering 28429/28429 (removed 0) transitions.
[2023-03-17 21:28:50] [INFO ] Flow matrix only has 18674 transitions (discarded 9755 similar events)
[2023-03-17 21:28:50] [INFO ] Invariant cache hit.
[2023-03-17 21:28:51] [INFO ] Implicit Places using invariants in 751 ms returned []
Implicit Place search using SMT only with invariants took 752 ms to find 0 implicit places.
[2023-03-17 21:28:51] [INFO ] Flow matrix only has 18674 transitions (discarded 9755 similar events)
[2023-03-17 21:28:51] [INFO ] Invariant cache hit.
[2023-03-17 21:28:58] [INFO ] Dead Transitions using invariants and state equation in 7837 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8623 ms. Remains : 513/513 places, 28429/28429 transitions.
Stuttering acceptance computed with spot in 189 ms :[true, (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p2), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : RERS2020-PT-pb103-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 4}], [{ cond=(NOT p2), acceptance={} source=2 dest: 0}, { cond=p2, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p1) p2), acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}], [{ cond=true, acceptance={} source=5 dest: 1}]], initial=5, aps=[p0:(AND (EQ s179 0) (EQ s134 1)), p2:(AND (EQ s179 0) (EQ s134 1)), p1:(AND (NEQ s226 0) (NEQ s67 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA RERS2020-PT-pb103-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RERS2020-PT-pb103-LTLCardinality-06 finished in 8868 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((X(p0)||F(((p2&&F(p3))||p1)))))'
Support contains 8 out of 513 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 513/513 places, 28429/28429 transitions.
Applied a total of 0 rules in 31 ms. Remains 513 /513 variables (removed 0) and now considering 28429/28429 (removed 0) transitions.
[2023-03-17 21:28:59] [INFO ] Flow matrix only has 18674 transitions (discarded 9755 similar events)
[2023-03-17 21:28:59] [INFO ] Invariant cache hit.
[2023-03-17 21:29:00] [INFO ] Implicit Places using invariants in 835 ms returned []
Implicit Place search using SMT only with invariants took 838 ms to find 0 implicit places.
[2023-03-17 21:29:00] [INFO ] Flow matrix only has 18674 transitions (discarded 9755 similar events)
[2023-03-17 21:29:00] [INFO ] Invariant cache hit.
[2023-03-17 21:29:07] [INFO ] Dead Transitions using invariants and state equation in 7778 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8650 ms. Remains : 513/513 places, 28429/28429 transitions.
Stuttering acceptance computed with spot in 176 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p3) (NOT p0)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p3))]
Running random walk in product with property : RERS2020-PT-pb103-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) p2 (NOT p3)), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p1) p2 (NOT p3) (NOT p0)), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p1) (NOT p3) (NOT p0)), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p1) p2 (NOT p3)), acceptance={0} source=3 dest: 4}], [{ cond=(AND (NOT p1) (NOT p3)), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(OR (EQ s78 0) (EQ s365 1)), p2:(OR (EQ s61 0) (EQ s19 1)), p3:(OR (EQ s265 0) (EQ s245 1)), p0:(AND (EQ s0 0) (EQ s399 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][false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 2166 ms.
Product exploration explored 100000 steps with 0 reset in 2258 ms.
Computed a total of 121 stabilizing places and 10286 stable transitions
Computed a total of 121 stabilizing places and 10286 stable transitions
Detected a total of 121/513 stabilizing places and 10286/28429 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/4 atomic propositions.
Knowledge obtained : [(AND p1 p2 p3 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p1) p2 (NOT p3) (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p3) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p1) p2 (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p3))))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 426 ms. Reduced automaton from 5 states, 9 edges and 4 AP (stutter sensitive) to 5 states, 9 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 193 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p3) (NOT p0)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p3))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 348 ms. (steps per millisecond=28 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 3 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 33526 steps, run timeout after 3001 ms. (steps per millisecond=11 ) properties seen :{}
Probabilistic random walk after 33526 steps, saw 23002 distinct states, run finished after 3002 ms. (steps per millisecond=11 ) properties seen :0
Running SMT prover for 6 properties.
[2023-03-17 21:29:16] [INFO ] Flow matrix only has 18674 transitions (discarded 9755 similar events)
[2023-03-17 21:29:16] [INFO ] Invariant cache hit.
[2023-03-17 21:29:17] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-17 21:29:17] [INFO ] After 167ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-17 21:29:17] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-17 21:29:22] [INFO ] After 5002ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-17 21:29:22] [INFO ] State equation strengthened by 1379 read => feed constraints.
[2023-03-17 21:29:31] [INFO ] After 9356ms SMT Verify possible using 1379 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-17 21:29:34] [INFO ] Deduced a trap composed of 50 places in 1813 ms of which 1 ms to minimize.
[2023-03-17 21:29:36] [INFO ] Deduced a trap composed of 67 places in 1962 ms of which 0 ms to minimize.
[2023-03-17 21:29:38] [INFO ] Deduced a trap composed of 73 places in 1941 ms of which 1 ms to minimize.
[2023-03-17 21:29:41] [INFO ] Deduced a trap composed of 34 places in 1953 ms of which 0 ms to minimize.
[2023-03-17 21:29:43] [INFO ] Deduced a trap composed of 102 places in 2000 ms of which 1 ms to minimize.
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.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
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 21:29:43] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-17 21:29:43] [INFO ] After 26346ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:6
Fused 6 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 15 ms.
Support contains 8 out of 513 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 513/513 places, 28429/28429 transitions.
Drop transitions removed 1062 transitions
Reduce isomorphic transitions removed 1062 transitions.
Iterating post reduction 0 with 1062 rules applied. Total rules applied 1062 place count 513 transition count 27367
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 10 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 1064 place count 512 transition count 27366
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 1 places in 10 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 1066 place count 511 transition count 27377
Free-agglomeration rule applied 12 times.
Iterating global reduction 1 with 12 rules applied. Total rules applied 1078 place count 511 transition count 27365
Reduce places removed 12 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 86 transitions
Reduce isomorphic transitions removed 88 transitions.
Iterating post reduction 1 with 100 rules applied. Total rules applied 1178 place count 499 transition count 27277
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 1179 place count 499 transition count 27457
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1180 place count 498 transition count 27457
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 1181 place count 497 transition count 27456
Applied a total of 1181 rules in 573 ms. Remains 497 /513 variables (removed 16) and now considering 27456/28429 (removed 973) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 573 ms. Remains : 497/513 places, 27456/28429 transitions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 382 ms. (steps per millisecond=26 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 3 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 37371 steps, run timeout after 3001 ms. (steps per millisecond=12 ) properties seen :{}
Probabilistic random walk after 37371 steps, saw 26448 distinct states, run finished after 3001 ms. (steps per millisecond=12 ) properties seen :0
Running SMT prover for 6 properties.
[2023-03-17 21:29:47] [INFO ] Flow matrix only has 18727 transitions (discarded 8729 similar events)
// Phase 1: matrix 18727 rows 497 cols
[2023-03-17 21:29:47] [INFO ] Computed 8 place invariants in 50 ms
[2023-03-17 21:29:48] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2023-03-17 21:29:48] [INFO ] After 159ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-17 21:29:48] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-17 21:29:53] [INFO ] After 4782ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-17 21:29:53] [INFO ] State equation strengthened by 1374 read => feed constraints.
[2023-03-17 21:30:05] [INFO ] After 12200ms SMT Verify possible using 1374 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-17 21:30:07] [INFO ] Deduced a trap composed of 49 places in 1802 ms of which 0 ms to minimize.
[2023-03-17 21:30:09] [INFO ] Deduced a trap composed of 42 places in 1561 ms of which 1 ms to minimize.
[2023-03-17 21:30:12] [INFO ] Deduced a trap composed of 49 places in 1662 ms of which 1 ms to minimize.
[2023-03-17 21:30:14] [INFO ] Deduced a trap composed of 11 places in 1669 ms of which 0 ms to minimize.
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.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
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 21:30:14] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-17 21:30:14] [INFO ] After 26177ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:6
Parikh walk visited 0 properties in 16 ms.
Support contains 8 out of 497 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 497/497 places, 27456/27456 transitions.
Applied a total of 0 rules in 88 ms. Remains 497 /497 variables (removed 0) and now considering 27456/27456 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 88 ms. Remains : 497/497 places, 27456/27456 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 497/497 places, 27456/27456 transitions.
Applied a total of 0 rules in 87 ms. Remains 497 /497 variables (removed 0) and now considering 27456/27456 (removed 0) transitions.
[2023-03-17 21:30:14] [INFO ] Flow matrix only has 18727 transitions (discarded 8729 similar events)
[2023-03-17 21:30:14] [INFO ] Invariant cache hit.
[2023-03-17 21:30:15] [INFO ] Implicit Places using invariants in 871 ms returned []
Implicit Place search using SMT only with invariants took 872 ms to find 0 implicit places.
[2023-03-17 21:30:15] [INFO ] Flow matrix only has 18727 transitions (discarded 8729 similar events)
[2023-03-17 21:30:15] [INFO ] Invariant cache hit.
[2023-03-17 21:30:22] [INFO ] Dead Transitions using invariants and state equation in 7535 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8497 ms. Remains : 497/497 places, 27456/27456 transitions.
Graph (trivial) has 9903 edges and 497 vertex of which 378 / 497 are part of one of the 62 SCC in 2 ms
Free SCC test removed 316 places
Drop transitions removed 10625 transitions
Ensure Unique test removed 14226 transitions
Reduce isomorphic transitions removed 24851 transitions.
Graph (complete) has 2518 edges and 181 vertex of which 173 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.1 ms
Discarding 8 places :
Also discarding 0 output transitions
Drop transitions removed 12 transitions
Reduce isomorphic transitions removed 12 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 14 rules applied. Total rules applied 16 place count 173 transition count 2591
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 18 place count 171 transition count 2591
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 22 place count 169 transition count 2589
Ensure Unique test removed 33 transitions
Reduce isomorphic transitions removed 33 transitions.
Iterating post reduction 2 with 33 rules applied. Total rules applied 55 place count 169 transition count 2556
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 57 place count 168 transition count 2566
Drop transitions removed 1367 transitions
Redundant transition composition rules discarded 1367 transitions
Iterating global reduction 3 with 1367 rules applied. Total rules applied 1424 place count 168 transition count 1199
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 1392 edges and 166 vertex of which 147 are kept as prefixes of interest. Removing 19 places using SCC suffix rule.0 ms
Discarding 19 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Iterating post reduction 3 with 10 rules applied. Total rules applied 1434 place count 147 transition count 1189
Drop transitions removed 108 transitions
Reduce isomorphic transitions removed 108 transitions.
Iterating post reduction 4 with 108 rules applied. Total rules applied 1542 place count 147 transition count 1081
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 1544 place count 145 transition count 1069
Iterating global reduction 5 with 2 rules applied. Total rules applied 1546 place count 145 transition count 1069
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1547 place count 145 transition count 1068
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 6 with 4 rules applied. Total rules applied 1551 place count 145 transition count 1064
Free-agglomeration rule applied 4 times.
Iterating global reduction 6 with 4 rules applied. Total rules applied 1555 place count 145 transition count 1060
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 1561 place count 141 transition count 1058
Drop transitions removed 34 transitions
Redundant transition composition rules discarded 34 transitions
Iterating global reduction 7 with 34 rules applied. Total rules applied 1595 place count 141 transition count 1024
Free-agglomeration rule applied 1 times.
Iterating global reduction 7 with 1 rules applied. Total rules applied 1596 place count 141 transition count 1023
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 1597 place count 140 transition count 1023
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 8 with 4 rules applied. Total rules applied 1601 place count 140 transition count 1019
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 8 with 2 rules applied. Total rules applied 1603 place count 140 transition count 1024
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 8 with 10 rules applied. Total rules applied 1613 place count 138 transition count 1016
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 1614 place count 137 transition count 1010
Iterating global reduction 9 with 1 rules applied. Total rules applied 1615 place count 137 transition count 1010
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 9 with 9 rules applied. Total rules applied 1624 place count 137 transition count 1001
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 10 with 2 rules applied. Total rules applied 1626 place count 137 transition count 1001
Applied a total of 1626 rules in 199 ms. Remains 137 /497 variables (removed 360) and now considering 1001/27456 (removed 26455) transitions.
Running SMT prover for 6 properties.
[2023-03-17 21:30:23] [INFO ] Flow matrix only has 965 transitions (discarded 36 similar events)
// Phase 1: matrix 965 rows 137 cols
[2023-03-17 21:30:23] [INFO ] Computed 0 place invariants in 7 ms
[2023-03-17 21:30:23] [INFO ] After 423ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-17 21:30:23] [INFO ] After 299ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-17 21:30:23] [INFO ] State equation strengthened by 12 read => feed constraints.
[2023-03-17 21:30:24] [INFO ] After 198ms SMT Verify possible using 12 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-17 21:30:24] [INFO ] After 468ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 193 ms.
[2023-03-17 21:30:24] [INFO ] After 1025ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Knowledge obtained : [(AND p1 p2 p3 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p1) p2 (NOT p3) (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p3) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p1) p2 (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p3))))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 404 ms. Reduced automaton from 5 states, 9 edges and 4 AP (stutter sensitive) to 5 states, 9 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 194 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p3) (NOT p0)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p3))]
Stuttering acceptance computed with spot in 194 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p3) (NOT p0)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p3))]
Support contains 8 out of 513 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 513/513 places, 28429/28429 transitions.
Applied a total of 0 rules in 32 ms. Remains 513 /513 variables (removed 0) and now considering 28429/28429 (removed 0) transitions.
[2023-03-17 21:30:25] [INFO ] Flow matrix only has 18674 transitions (discarded 9755 similar events)
// Phase 1: matrix 18674 rows 513 cols
[2023-03-17 21:30:25] [INFO ] Computed 8 place invariants in 50 ms
[2023-03-17 21:30:26] [INFO ] Implicit Places using invariants in 794 ms returned []
Implicit Place search using SMT only with invariants took 798 ms to find 0 implicit places.
[2023-03-17 21:30:26] [INFO ] Flow matrix only has 18674 transitions (discarded 9755 similar events)
[2023-03-17 21:30:26] [INFO ] Invariant cache hit.
[2023-03-17 21:30:34] [INFO ] Dead Transitions using invariants and state equation in 7733 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8564 ms. Remains : 513/513 places, 28429/28429 transitions.
Computed a total of 121 stabilizing places and 10286 stable transitions
Computed a total of 121 stabilizing places and 10286 stable transitions
Detected a total of 121/513 stabilizing places and 10286/28429 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/4 atomic propositions.
Knowledge obtained : [(AND p2 p1 p3 (NOT p0)), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (NOT (AND p2 (NOT p1) (NOT p3) (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p3) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND p2 (NOT p1) (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p3))))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 391 ms. Reduced automaton from 5 states, 9 edges and 4 AP (stutter sensitive) to 5 states, 9 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 172 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p3) (NOT p0)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p3))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 283 ms. (steps per millisecond=35 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 36147 steps, run timeout after 3001 ms. (steps per millisecond=12 ) properties seen :{}
Probabilistic random walk after 36147 steps, saw 24710 distinct states, run finished after 3001 ms. (steps per millisecond=12 ) properties seen :0
Running SMT prover for 6 properties.
[2023-03-17 21:30:38] [INFO ] Flow matrix only has 18674 transitions (discarded 9755 similar events)
[2023-03-17 21:30:38] [INFO ] Invariant cache hit.
[2023-03-17 21:30:38] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-17 21:30:38] [INFO ] After 157ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-17 21:30:38] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2023-03-17 21:30:43] [INFO ] After 4721ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-17 21:30:43] [INFO ] State equation strengthened by 1379 read => feed constraints.
[2023-03-17 21:30:52] [INFO ] After 8831ms SMT Verify possible using 1379 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-17 21:30:54] [INFO ] Deduced a trap composed of 50 places in 1848 ms of which 1 ms to minimize.
[2023-03-17 21:30:57] [INFO ] Deduced a trap composed of 67 places in 1983 ms of which 1 ms to minimize.
[2023-03-17 21:30:59] [INFO ] Deduced a trap composed of 73 places in 1972 ms of which 1 ms to minimize.
[2023-03-17 21:31:01] [INFO ] Deduced a trap composed of 34 places in 1987 ms of which 0 ms to minimize.
[2023-03-17 21:31:04] [INFO ] Deduced a trap composed of 102 places in 1987 ms of which 0 ms to minimize.
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.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
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 21:31:04] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-17 21:31:04] [INFO ] After 25561ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:6
Fused 6 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 16 ms.
Support contains 8 out of 513 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 513/513 places, 28429/28429 transitions.
Drop transitions removed 1062 transitions
Reduce isomorphic transitions removed 1062 transitions.
Iterating post reduction 0 with 1062 rules applied. Total rules applied 1062 place count 513 transition count 27367
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 10 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 1064 place count 512 transition count 27366
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 1 places in 9 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 1066 place count 511 transition count 27377
Free-agglomeration rule applied 12 times.
Iterating global reduction 1 with 12 rules applied. Total rules applied 1078 place count 511 transition count 27365
Reduce places removed 12 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 86 transitions
Reduce isomorphic transitions removed 88 transitions.
Iterating post reduction 1 with 100 rules applied. Total rules applied 1178 place count 499 transition count 27277
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 1179 place count 499 transition count 27457
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1180 place count 498 transition count 27457
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 1181 place count 497 transition count 27456
Applied a total of 1181 rules in 546 ms. Remains 497 /513 variables (removed 16) and now considering 27456/28429 (removed 973) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 547 ms. Remains : 497/513 places, 27456/28429 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 282 ms. (steps per millisecond=35 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 36825 steps, run timeout after 3001 ms. (steps per millisecond=12 ) properties seen :{}
Probabilistic random walk after 36825 steps, saw 26095 distinct states, run finished after 3001 ms. (steps per millisecond=12 ) properties seen :0
Running SMT prover for 6 properties.
[2023-03-17 21:31:08] [INFO ] Flow matrix only has 18727 transitions (discarded 8729 similar events)
// Phase 1: matrix 18727 rows 497 cols
[2023-03-17 21:31:08] [INFO ] Computed 8 place invariants in 63 ms
[2023-03-17 21:31:08] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-17 21:31:08] [INFO ] After 156ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-17 21:31:08] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-17 21:31:13] [INFO ] After 4904ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-17 21:31:13] [INFO ] State equation strengthened by 1374 read => feed constraints.
[2023-03-17 21:31:25] [INFO ] After 12249ms SMT Verify possible using 1374 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-17 21:31:28] [INFO ] Deduced a trap composed of 49 places in 1828 ms of which 3 ms to minimize.
[2023-03-17 21:31:30] [INFO ] Deduced a trap composed of 42 places in 1586 ms of which 0 ms to minimize.
[2023-03-17 21:31:32] [INFO ] Deduced a trap composed of 49 places in 1636 ms of which 0 ms to minimize.
[2023-03-17 21:31:35] [INFO ] Deduced a trap composed of 11 places in 1699 ms of which 1 ms to minimize.
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.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
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 21:31:35] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-17 21:31:35] [INFO ] After 26491ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:6
Parikh walk visited 0 properties in 17 ms.
Support contains 8 out of 497 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 497/497 places, 27456/27456 transitions.
Applied a total of 0 rules in 108 ms. Remains 497 /497 variables (removed 0) and now considering 27456/27456 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 108 ms. Remains : 497/497 places, 27456/27456 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 497/497 places, 27456/27456 transitions.
Applied a total of 0 rules in 85 ms. Remains 497 /497 variables (removed 0) and now considering 27456/27456 (removed 0) transitions.
[2023-03-17 21:31:35] [INFO ] Flow matrix only has 18727 transitions (discarded 8729 similar events)
[2023-03-17 21:31:35] [INFO ] Invariant cache hit.
[2023-03-17 21:31:36] [INFO ] Implicit Places using invariants in 897 ms returned []
Implicit Place search using SMT only with invariants took 898 ms to find 0 implicit places.
[2023-03-17 21:31:36] [INFO ] Flow matrix only has 18727 transitions (discarded 8729 similar events)
[2023-03-17 21:31:36] [INFO ] Invariant cache hit.
[2023-03-17 21:31:43] [INFO ] Dead Transitions using invariants and state equation in 7633 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8620 ms. Remains : 497/497 places, 27456/27456 transitions.
Graph (trivial) has 9903 edges and 497 vertex of which 378 / 497 are part of one of the 62 SCC in 2 ms
Free SCC test removed 316 places
Drop transitions removed 10625 transitions
Ensure Unique test removed 14226 transitions
Reduce isomorphic transitions removed 24851 transitions.
Graph (complete) has 2518 edges and 181 vertex of which 173 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.1 ms
Discarding 8 places :
Also discarding 0 output transitions
Drop transitions removed 12 transitions
Reduce isomorphic transitions removed 12 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 14 rules applied. Total rules applied 16 place count 173 transition count 2591
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 18 place count 171 transition count 2591
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 22 place count 169 transition count 2589
Ensure Unique test removed 33 transitions
Reduce isomorphic transitions removed 33 transitions.
Iterating post reduction 2 with 33 rules applied. Total rules applied 55 place count 169 transition count 2556
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 57 place count 168 transition count 2566
Drop transitions removed 1367 transitions
Redundant transition composition rules discarded 1367 transitions
Iterating global reduction 3 with 1367 rules applied. Total rules applied 1424 place count 168 transition count 1199
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 1392 edges and 166 vertex of which 147 are kept as prefixes of interest. Removing 19 places using SCC suffix rule.0 ms
Discarding 19 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Iterating post reduction 3 with 10 rules applied. Total rules applied 1434 place count 147 transition count 1189
Drop transitions removed 108 transitions
Reduce isomorphic transitions removed 108 transitions.
Iterating post reduction 4 with 108 rules applied. Total rules applied 1542 place count 147 transition count 1081
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 1544 place count 145 transition count 1069
Iterating global reduction 5 with 2 rules applied. Total rules applied 1546 place count 145 transition count 1069
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1547 place count 145 transition count 1068
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 6 with 4 rules applied. Total rules applied 1551 place count 145 transition count 1064
Free-agglomeration rule applied 4 times.
Iterating global reduction 6 with 4 rules applied. Total rules applied 1555 place count 145 transition count 1060
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 1561 place count 141 transition count 1058
Drop transitions removed 34 transitions
Redundant transition composition rules discarded 34 transitions
Iterating global reduction 7 with 34 rules applied. Total rules applied 1595 place count 141 transition count 1024
Free-agglomeration rule applied 1 times.
Iterating global reduction 7 with 1 rules applied. Total rules applied 1596 place count 141 transition count 1023
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 1597 place count 140 transition count 1023
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 8 with 4 rules applied. Total rules applied 1601 place count 140 transition count 1019
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 8 with 2 rules applied. Total rules applied 1603 place count 140 transition count 1024
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 8 with 10 rules applied. Total rules applied 1613 place count 138 transition count 1016
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 1614 place count 137 transition count 1010
Iterating global reduction 9 with 1 rules applied. Total rules applied 1615 place count 137 transition count 1010
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 9 with 9 rules applied. Total rules applied 1624 place count 137 transition count 1001
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 10 with 2 rules applied. Total rules applied 1626 place count 137 transition count 1001
Applied a total of 1626 rules in 198 ms. Remains 137 /497 variables (removed 360) and now considering 1001/27456 (removed 26455) transitions.
Running SMT prover for 6 properties.
[2023-03-17 21:31:44] [INFO ] Flow matrix only has 965 transitions (discarded 36 similar events)
// Phase 1: matrix 965 rows 137 cols
[2023-03-17 21:31:44] [INFO ] Computed 0 place invariants in 6 ms
[2023-03-17 21:31:44] [INFO ] After 377ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-17 21:31:44] [INFO ] After 315ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-17 21:31:44] [INFO ] State equation strengthened by 12 read => feed constraints.
[2023-03-17 21:31:45] [INFO ] After 212ms SMT Verify possible using 12 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-17 21:31:45] [INFO ] After 486ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 205 ms.
[2023-03-17 21:31:45] [INFO ] After 1057ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Knowledge obtained : [(AND p2 p1 p3 (NOT p0)), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (NOT (AND p2 (NOT p1) (NOT p3) (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p3) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND p2 (NOT p1) (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p3))))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 438 ms. Reduced automaton from 5 states, 9 edges and 4 AP (stutter sensitive) to 5 states, 9 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 218 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p3) (NOT p0)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p3))]
Stuttering acceptance computed with spot in 222 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p3) (NOT p0)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p3))]
Stuttering acceptance computed with spot in 217 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p3) (NOT p0)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p3))]
Product exploration explored 100000 steps with 2 reset in 2143 ms.
Product exploration explored 100000 steps with 0 reset in 2169 ms.
Applying partial POR strategy [false, true, true, true, true]
Stuttering acceptance computed with spot in 193 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p3) (NOT p0)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p3))]
Support contains 8 out of 513 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 513/513 places, 28429/28429 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 9 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 513 transition count 28429
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 2 places in 9 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 513 transition count 28442
Deduced a syphon composed of 2 places in 10 ms
Applied a total of 2 rules in 206 ms. Remains 513 /513 variables (removed 0) and now considering 28442/28429 (removed -13) transitions.
[2023-03-17 21:31:51] [INFO ] Flow matrix only has 18686 transitions (discarded 9756 similar events)
// Phase 1: matrix 18686 rows 513 cols
[2023-03-17 21:31:51] [INFO ] Computed 8 place invariants in 52 ms
[2023-03-17 21:31:59] [INFO ] Dead Transitions using invariants and state equation in 8109 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 513/513 places, 28442/28429 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 8317 ms. Remains : 513/513 places, 28442/28429 transitions.
Support contains 8 out of 513 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 513/513 places, 28429/28429 transitions.
Applied a total of 0 rules in 29 ms. Remains 513 /513 variables (removed 0) and now considering 28429/28429 (removed 0) transitions.
[2023-03-17 21:31:59] [INFO ] Flow matrix only has 18674 transitions (discarded 9755 similar events)
// Phase 1: matrix 18674 rows 513 cols
[2023-03-17 21:31:59] [INFO ] Computed 8 place invariants in 53 ms
[2023-03-17 21:32:00] [INFO ] Implicit Places using invariants in 824 ms returned []
Implicit Place search using SMT only with invariants took 825 ms to find 0 implicit places.
[2023-03-17 21:32:00] [INFO ] Flow matrix only has 18674 transitions (discarded 9755 similar events)
[2023-03-17 21:32:00] [INFO ] Invariant cache hit.
[2023-03-17 21:32:08] [INFO ] Dead Transitions using invariants and state equation in 7781 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8637 ms. Remains : 513/513 places, 28429/28429 transitions.
Treatment of property RERS2020-PT-pb103-LTLCardinality-07 finished in 189757 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1 out of 513 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 513/513 places, 28429/28429 transitions.
Applied a total of 0 rules in 115 ms. Remains 513 /513 variables (removed 0) and now considering 28429/28429 (removed 0) transitions.
[2023-03-17 21:32:09] [INFO ] Flow matrix only has 18674 transitions (discarded 9755 similar events)
[2023-03-17 21:32:09] [INFO ] Invariant cache hit.
[2023-03-17 21:32:09] [INFO ] Implicit Places using invariants in 771 ms returned []
Implicit Place search using SMT only with invariants took 772 ms to find 0 implicit places.
[2023-03-17 21:32:09] [INFO ] Flow matrix only has 18674 transitions (discarded 9755 similar events)
[2023-03-17 21:32:09] [INFO ] Invariant cache hit.
[2023-03-17 21:32:17] [INFO ] Dead Transitions using invariants and state equation in 8134 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9024 ms. Remains : 513/513 places, 28429/28429 transitions.
Stuttering acceptance computed with spot in 80 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : RERS2020-PT-pb103-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s238 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 61 steps with 0 reset in 2 ms.
FORMULA RERS2020-PT-pb103-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RERS2020-PT-pb103-LTLCardinality-12 finished in 9162 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))'
Support contains 1 out of 513 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 513/513 places, 28429/28429 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 8 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 511 transition count 28427
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 1 places in 9 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 510 transition count 28438
Applied a total of 4 rules in 219 ms. Remains 510 /513 variables (removed 3) and now considering 28438/28429 (removed -9) transitions.
[2023-03-17 21:32:18] [INFO ] Flow matrix only has 18682 transitions (discarded 9756 similar events)
// Phase 1: matrix 18682 rows 510 cols
[2023-03-17 21:32:18] [INFO ] Computed 8 place invariants in 52 ms
[2023-03-17 21:32:19] [INFO ] Implicit Places using invariants in 827 ms returned []
Implicit Place search using SMT only with invariants took 827 ms to find 0 implicit places.
[2023-03-17 21:32:19] [INFO ] Flow matrix only has 18682 transitions (discarded 9756 similar events)
[2023-03-17 21:32:19] [INFO ] Invariant cache hit.
[2023-03-17 21:32:26] [INFO ] Dead Transitions using invariants and state equation in 7682 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 510/513 places, 28438/28429 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 8730 ms. Remains : 510/513 places, 28438/28429 transitions.
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Running random walk in product with property : RERS2020-PT-pb103-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s11 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 52 steps with 0 reset in 2 ms.
FORMULA RERS2020-PT-pb103-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RERS2020-PT-pb103-LTLCardinality-13 finished in 8822 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 3 out of 513 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 513/513 places, 28429/28429 transitions.
Applied a total of 0 rules in 29 ms. Remains 513 /513 variables (removed 0) and now considering 28429/28429 (removed 0) transitions.
[2023-03-17 21:32:26] [INFO ] Flow matrix only has 18674 transitions (discarded 9755 similar events)
// Phase 1: matrix 18674 rows 513 cols
[2023-03-17 21:32:26] [INFO ] Computed 8 place invariants in 53 ms
[2023-03-17 21:32:27] [INFO ] Implicit Places using invariants in 833 ms returned []
Implicit Place search using SMT only with invariants took 834 ms to find 0 implicit places.
[2023-03-17 21:32:27] [INFO ] Flow matrix only has 18674 transitions (discarded 9755 similar events)
[2023-03-17 21:32:27] [INFO ] Invariant cache hit.
[2023-03-17 21:32:35] [INFO ] Dead Transitions using invariants and state equation in 7770 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8634 ms. Remains : 513/513 places, 28429/28429 transitions.
Stuttering acceptance computed with spot in 64 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : RERS2020-PT-pb103-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s394 1) (EQ s494 0) (EQ s463 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 87 steps with 0 reset in 2 ms.
FORMULA RERS2020-PT-pb103-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RERS2020-PT-pb103-LTLCardinality-15 finished in 8754 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(X((X(F(X((F(p0) U !p0)))) U p1))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(p0)||F(((p2&&F(p3))||p1)))))'
Found a Lengthening insensitive property : RERS2020-PT-pb103-LTLCardinality-07
Stuttering acceptance computed with spot in 191 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p3) (NOT p0)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p3))]
Support contains 8 out of 513 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 513/513 places, 28429/28429 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 9 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 511 transition count 28427
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 1 places in 9 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 510 transition count 28438
Applied a total of 4 rules in 232 ms. Remains 510 /513 variables (removed 3) and now considering 28438/28429 (removed -9) transitions.
[2023-03-17 21:32:36] [INFO ] Flow matrix only has 18682 transitions (discarded 9756 similar events)
// Phase 1: matrix 18682 rows 510 cols
[2023-03-17 21:32:36] [INFO ] Computed 8 place invariants in 47 ms
[2023-03-17 21:32:37] [INFO ] Implicit Places using invariants in 790 ms returned []
Implicit Place search using SMT only with invariants took 791 ms to find 0 implicit places.
[2023-03-17 21:32:37] [INFO ] Flow matrix only has 18682 transitions (discarded 9756 similar events)
[2023-03-17 21:32:37] [INFO ] Invariant cache hit.
[2023-03-17 21:32:44] [INFO ] Dead Transitions using invariants and state equation in 7821 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 510/513 places, 28438/28429 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 8845 ms. Remains : 510/513 places, 28438/28429 transitions.
Running random walk in product with property : RERS2020-PT-pb103-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) p2 (NOT p3)), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p1) p2 (NOT p3) (NOT p0)), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p1) (NOT p3) (NOT p0)), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p1) p2 (NOT p3)), acceptance={0} source=3 dest: 4}], [{ cond=(AND (NOT p1) (NOT p3)), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(OR (EQ s78 0) (EQ s363 1)), p2:(OR (EQ s61 0) (EQ s19 1)), p3:(OR (EQ s264 0) (EQ s244 1)), p0:(AND (EQ s0 0) (EQ s397 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 1857 ms.
Product exploration explored 100000 steps with 0 reset in 2207 ms.
Computed a total of 118 stabilizing places and 10295 stable transitions
Computed a total of 118 stabilizing places and 10295 stable transitions
Detected a total of 118/510 stabilizing places and 10295/28438 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/4 atomic propositions.
Knowledge obtained : [(AND p1 p2 p3 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p1) p2 (NOT p3) (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p3) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p1) p2 (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p3))))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 405 ms. Reduced automaton from 5 states, 9 edges and 4 AP (stutter sensitive) to 5 states, 9 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 199 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p3) (NOT p0)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p3))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 332 ms. (steps per millisecond=30 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 33175 steps, run timeout after 3002 ms. (steps per millisecond=11 ) properties seen :{}
Probabilistic random walk after 33175 steps, saw 22775 distinct states, run finished after 3002 ms. (steps per millisecond=11 ) properties seen :0
Running SMT prover for 6 properties.
[2023-03-17 21:32:53] [INFO ] Flow matrix only has 18682 transitions (discarded 9756 similar events)
[2023-03-17 21:32:53] [INFO ] Invariant cache hit.
[2023-03-17 21:32:53] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-17 21:32:53] [INFO ] After 154ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-17 21:32:53] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-17 21:32:58] [INFO ] After 4954ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-17 21:32:58] [INFO ] State equation strengthened by 1380 read => feed constraints.
[2023-03-17 21:33:06] [INFO ] After 7909ms SMT Verify possible using 1380 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-17 21:33:09] [INFO ] Deduced a trap composed of 56 places in 1822 ms of which 1 ms to minimize.
[2023-03-17 21:33:11] [INFO ] Deduced a trap composed of 11 places in 1933 ms of which 4 ms to minimize.
[2023-03-17 21:33:13] [INFO ] Deduced a trap composed of 84 places in 1971 ms of which 0 ms to minimize.
[2023-03-17 21:33:16] [INFO ] Deduced a trap composed of 13 places in 1957 ms of which 1 ms to minimize.
[2023-03-17 21:33:18] [INFO ] Deduced a trap composed of 95 places in 1911 ms of which 0 ms to minimize.
[2023-03-17 21:33:20] [INFO ] Deduced a trap composed of 106 places in 1980 ms of which 1 ms to minimize.
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.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
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.LTLLengthAwareSolver.runSLCLLTLTest(LTLLengthAwareSolver.java:100)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:764)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-17 21:33:20] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-17 21:33:20] [INFO ] After 26890ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:6
Fused 6 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 17 ms.
Support contains 8 out of 510 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 510/510 places, 28438/28438 transitions.
Drop transitions removed 1062 transitions
Reduce isomorphic transitions removed 1062 transitions.
Iterating post reduction 0 with 1062 rules applied. Total rules applied 1062 place count 510 transition count 27376
Free-agglomeration rule applied 12 times.
Iterating global reduction 1 with 12 rules applied. Total rules applied 1074 place count 510 transition count 27364
Reduce places removed 12 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 86 transitions
Reduce isomorphic transitions removed 88 transitions.
Iterating post reduction 1 with 100 rules applied. Total rules applied 1174 place count 498 transition count 27276
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 1175 place count 498 transition count 27456
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1176 place count 497 transition count 27456
Applied a total of 1176 rules in 365 ms. Remains 497 /510 variables (removed 13) and now considering 27456/28438 (removed 982) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 365 ms. Remains : 497/510 places, 27456/28438 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 377 ms. (steps per millisecond=26 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 36367 steps, run timeout after 3001 ms. (steps per millisecond=12 ) properties seen :{}
Probabilistic random walk after 36367 steps, saw 25800 distinct states, run finished after 3001 ms. (steps per millisecond=12 ) properties seen :0
Running SMT prover for 6 properties.
[2023-03-17 21:33:24] [INFO ] Flow matrix only has 18727 transitions (discarded 8729 similar events)
// Phase 1: matrix 18727 rows 497 cols
[2023-03-17 21:33:24] [INFO ] Computed 8 place invariants in 50 ms
[2023-03-17 21:33:24] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2023-03-17 21:33:24] [INFO ] After 147ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-17 21:33:24] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-17 21:33:29] [INFO ] After 4693ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-17 21:33:29] [INFO ] State equation strengthened by 1374 read => feed constraints.
[2023-03-17 21:33:42] [INFO ] After 12518ms SMT Verify possible using 1374 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-17 21:33:44] [INFO ] Deduced a trap composed of 49 places in 1798 ms of which 0 ms to minimize.
[2023-03-17 21:33:46] [INFO ] Deduced a trap composed of 42 places in 1523 ms of which 1 ms to minimize.
[2023-03-17 21:33:49] [INFO ] Deduced a trap composed of 49 places in 1600 ms of which 3 ms to minimize.
[2023-03-17 21:33:51] [INFO ] Deduced a trap composed of 11 places in 1659 ms of which 2 ms to minimize.
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.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
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.LTLLengthAwareSolver.runSLCLLTLTest(LTLLengthAwareSolver.java:100)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:764)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-17 21:33:51] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-17 21:33:51] [INFO ] After 26373ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:6
Parikh walk visited 0 properties in 18 ms.
Support contains 8 out of 497 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 497/497 places, 27456/27456 transitions.
Applied a total of 0 rules in 92 ms. Remains 497 /497 variables (removed 0) and now considering 27456/27456 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 92 ms. Remains : 497/497 places, 27456/27456 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 497/497 places, 27456/27456 transitions.
Applied a total of 0 rules in 172 ms. Remains 497 /497 variables (removed 0) and now considering 27456/27456 (removed 0) transitions.
[2023-03-17 21:33:51] [INFO ] Flow matrix only has 18727 transitions (discarded 8729 similar events)
[2023-03-17 21:33:51] [INFO ] Invariant cache hit.
[2023-03-17 21:33:52] [INFO ] Implicit Places using invariants in 881 ms returned []
Implicit Place search using SMT only with invariants took 882 ms to find 0 implicit places.
[2023-03-17 21:33:52] [INFO ] Flow matrix only has 18727 transitions (discarded 8729 similar events)
[2023-03-17 21:33:52] [INFO ] Invariant cache hit.
[2023-03-17 21:33:59] [INFO ] Dead Transitions using invariants and state equation in 7474 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8533 ms. Remains : 497/497 places, 27456/27456 transitions.
Graph (trivial) has 9903 edges and 497 vertex of which 378 / 497 are part of one of the 62 SCC in 1 ms
Free SCC test removed 316 places
Drop transitions removed 10625 transitions
Ensure Unique test removed 14226 transitions
Reduce isomorphic transitions removed 24851 transitions.
Graph (complete) has 2518 edges and 181 vertex of which 173 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.1 ms
Discarding 8 places :
Also discarding 0 output transitions
Drop transitions removed 12 transitions
Reduce isomorphic transitions removed 12 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 14 rules applied. Total rules applied 16 place count 173 transition count 2591
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 18 place count 171 transition count 2591
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 22 place count 169 transition count 2589
Ensure Unique test removed 33 transitions
Reduce isomorphic transitions removed 33 transitions.
Iterating post reduction 2 with 33 rules applied. Total rules applied 55 place count 169 transition count 2556
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 57 place count 168 transition count 2566
Drop transitions removed 1367 transitions
Redundant transition composition rules discarded 1367 transitions
Iterating global reduction 3 with 1367 rules applied. Total rules applied 1424 place count 168 transition count 1199
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 1392 edges and 166 vertex of which 147 are kept as prefixes of interest. Removing 19 places using SCC suffix rule.0 ms
Discarding 19 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Iterating post reduction 3 with 10 rules applied. Total rules applied 1434 place count 147 transition count 1189
Drop transitions removed 108 transitions
Reduce isomorphic transitions removed 108 transitions.
Iterating post reduction 4 with 108 rules applied. Total rules applied 1542 place count 147 transition count 1081
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 1544 place count 145 transition count 1069
Iterating global reduction 5 with 2 rules applied. Total rules applied 1546 place count 145 transition count 1069
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1547 place count 145 transition count 1068
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 6 with 4 rules applied. Total rules applied 1551 place count 145 transition count 1064
Free-agglomeration rule applied 4 times.
Iterating global reduction 6 with 4 rules applied. Total rules applied 1555 place count 145 transition count 1060
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 1561 place count 141 transition count 1058
Drop transitions removed 34 transitions
Redundant transition composition rules discarded 34 transitions
Iterating global reduction 7 with 34 rules applied. Total rules applied 1595 place count 141 transition count 1024
Free-agglomeration rule applied 1 times.
Iterating global reduction 7 with 1 rules applied. Total rules applied 1596 place count 141 transition count 1023
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 1597 place count 140 transition count 1023
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 8 with 4 rules applied. Total rules applied 1601 place count 140 transition count 1019
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 8 with 2 rules applied. Total rules applied 1603 place count 140 transition count 1024
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 8 with 10 rules applied. Total rules applied 1613 place count 138 transition count 1016
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 1614 place count 137 transition count 1010
Iterating global reduction 9 with 1 rules applied. Total rules applied 1615 place count 137 transition count 1010
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 9 with 9 rules applied. Total rules applied 1624 place count 137 transition count 1001
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 10 with 2 rules applied. Total rules applied 1626 place count 137 transition count 1001
Applied a total of 1626 rules in 194 ms. Remains 137 /497 variables (removed 360) and now considering 1001/27456 (removed 26455) transitions.
Running SMT prover for 6 properties.
[2023-03-17 21:34:00] [INFO ] Flow matrix only has 965 transitions (discarded 36 similar events)
// Phase 1: matrix 965 rows 137 cols
[2023-03-17 21:34:00] [INFO ] Computed 0 place invariants in 7 ms
[2023-03-17 21:34:00] [INFO ] After 368ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-17 21:34:00] [INFO ] After 297ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-17 21:34:00] [INFO ] State equation strengthened by 12 read => feed constraints.
[2023-03-17 21:34:01] [INFO ] After 195ms SMT Verify possible using 12 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-17 21:34:01] [INFO ] After 450ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 201 ms.
[2023-03-17 21:34:01] [INFO ] After 998ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Knowledge obtained : [(AND p1 p2 p3 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p1) p2 (NOT p3) (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p3) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p1) p2 (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p3))))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 406 ms. Reduced automaton from 5 states, 9 edges and 4 AP (stutter sensitive) to 5 states, 9 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 207 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p3) (NOT p0)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p3))]
Stuttering acceptance computed with spot in 195 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p3) (NOT p0)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p3))]
Support contains 8 out of 510 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 510/510 places, 28438/28438 transitions.
Applied a total of 0 rules in 27 ms. Remains 510 /510 variables (removed 0) and now considering 28438/28438 (removed 0) transitions.
[2023-03-17 21:34:02] [INFO ] Flow matrix only has 18682 transitions (discarded 9756 similar events)
// Phase 1: matrix 18682 rows 510 cols
[2023-03-17 21:34:02] [INFO ] Computed 8 place invariants in 53 ms
[2023-03-17 21:34:03] [INFO ] Implicit Places using invariants in 798 ms returned []
Implicit Place search using SMT only with invariants took 799 ms to find 0 implicit places.
[2023-03-17 21:34:03] [INFO ] Flow matrix only has 18682 transitions (discarded 9756 similar events)
[2023-03-17 21:34:03] [INFO ] Invariant cache hit.
[2023-03-17 21:34:10] [INFO ] Dead Transitions using invariants and state equation in 7730 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8559 ms. Remains : 510/510 places, 28438/28438 transitions.
Computed a total of 118 stabilizing places and 10295 stable transitions
Computed a total of 118 stabilizing places and 10295 stable transitions
Detected a total of 118/510 stabilizing places and 10295/28438 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/4 atomic propositions.
Knowledge obtained : [(AND p2 p1 p3 (NOT p0)), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (NOT (AND p2 (NOT p1) (NOT p3) (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p3) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND p2 (NOT p1) (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p3))))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 377 ms. Reduced automaton from 5 states, 9 edges and 4 AP (stutter sensitive) to 5 states, 9 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 193 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p3) (NOT p0)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p3))]
Incomplete random walk after 10000 steps, including 3 resets, run finished after 362 ms. (steps per millisecond=27 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 37045 steps, run timeout after 3001 ms. (steps per millisecond=12 ) properties seen :{}
Probabilistic random walk after 37045 steps, saw 25275 distinct states, run finished after 3001 ms. (steps per millisecond=12 ) properties seen :0
Running SMT prover for 6 properties.
[2023-03-17 21:34:15] [INFO ] Flow matrix only has 18682 transitions (discarded 9756 similar events)
[2023-03-17 21:34:15] [INFO ] Invariant cache hit.
[2023-03-17 21:34:15] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-17 21:34:15] [INFO ] After 158ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-17 21:34:15] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-17 21:34:20] [INFO ] After 5064ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-17 21:34:20] [INFO ] State equation strengthened by 1380 read => feed constraints.
[2023-03-17 21:34:28] [INFO ] After 7911ms SMT Verify possible using 1380 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-17 21:34:31] [INFO ] Deduced a trap composed of 56 places in 1860 ms of which 2 ms to minimize.
[2023-03-17 21:34:33] [INFO ] Deduced a trap composed of 11 places in 1995 ms of which 3 ms to minimize.
[2023-03-17 21:34:35] [INFO ] Deduced a trap composed of 84 places in 1924 ms of which 1 ms to minimize.
[2023-03-17 21:34:38] [INFO ] Deduced a trap composed of 13 places in 1890 ms of which 1 ms to minimize.
[2023-03-17 21:34:40] [INFO ] Deduced a trap composed of 95 places in 1885 ms of which 0 ms to minimize.
[2023-03-17 21:34:42] [INFO ] Deduced a trap composed of 106 places in 1967 ms of which 0 ms to minimize.
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.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
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.LTLLengthAwareSolver.runSLCLLTLTest(LTLLengthAwareSolver.java:100)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:764)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-17 21:34:42] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-17 21:34:42] [INFO ] After 26931ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:6
Fused 6 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 18 ms.
Support contains 8 out of 510 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 510/510 places, 28438/28438 transitions.
Drop transitions removed 1062 transitions
Reduce isomorphic transitions removed 1062 transitions.
Iterating post reduction 0 with 1062 rules applied. Total rules applied 1062 place count 510 transition count 27376
Free-agglomeration rule applied 12 times.
Iterating global reduction 1 with 12 rules applied. Total rules applied 1074 place count 510 transition count 27364
Reduce places removed 12 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 86 transitions
Reduce isomorphic transitions removed 88 transitions.
Iterating post reduction 1 with 100 rules applied. Total rules applied 1174 place count 498 transition count 27276
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 1175 place count 498 transition count 27456
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1176 place count 497 transition count 27456
Applied a total of 1176 rules in 346 ms. Remains 497 /510 variables (removed 13) and now considering 27456/28438 (removed 982) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 346 ms. Remains : 497/510 places, 27456/28438 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 485 ms. (steps per millisecond=20 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 36042 steps, run timeout after 3001 ms. (steps per millisecond=12 ) properties seen :{}
Probabilistic random walk after 36042 steps, saw 25593 distinct states, run finished after 3001 ms. (steps per millisecond=12 ) properties seen :0
Running SMT prover for 6 properties.
[2023-03-17 21:34:46] [INFO ] Flow matrix only has 18727 transitions (discarded 8729 similar events)
// Phase 1: matrix 18727 rows 497 cols
[2023-03-17 21:34:46] [INFO ] Computed 8 place invariants in 50 ms
[2023-03-17 21:34:46] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2023-03-17 21:34:47] [INFO ] After 159ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-17 21:34:47] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-17 21:34:51] [INFO ] After 4711ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-17 21:34:51] [INFO ] State equation strengthened by 1374 read => feed constraints.
[2023-03-17 21:35:04] [INFO ] After 12047ms SMT Verify possible using 1374 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-17 21:35:06] [INFO ] Deduced a trap composed of 49 places in 1775 ms of which 1 ms to minimize.
[2023-03-17 21:35:08] [INFO ] Deduced a trap composed of 42 places in 1534 ms of which 1 ms to minimize.
[2023-03-17 21:35:10] [INFO ] Deduced a trap composed of 49 places in 1587 ms of which 0 ms to minimize.
[2023-03-17 21:35:12] [INFO ] Deduced a trap composed of 11 places in 1703 ms of which 1 ms to minimize.
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.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
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.LTLLengthAwareSolver.runSLCLLTLTest(LTLLengthAwareSolver.java:100)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:764)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-17 21:35:12] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-17 21:35:12] [INFO ] After 25876ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:6
Parikh walk visited 0 properties in 19 ms.
Support contains 8 out of 497 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 497/497 places, 27456/27456 transitions.
Applied a total of 0 rules in 96 ms. Remains 497 /497 variables (removed 0) and now considering 27456/27456 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 96 ms. Remains : 497/497 places, 27456/27456 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 497/497 places, 27456/27456 transitions.
Applied a total of 0 rules in 94 ms. Remains 497 /497 variables (removed 0) and now considering 27456/27456 (removed 0) transitions.
[2023-03-17 21:35:13] [INFO ] Flow matrix only has 18727 transitions (discarded 8729 similar events)
[2023-03-17 21:35:13] [INFO ] Invariant cache hit.
[2023-03-17 21:35:14] [INFO ] Implicit Places using invariants in 990 ms returned []
Implicit Place search using SMT only with invariants took 991 ms to find 0 implicit places.
[2023-03-17 21:35:14] [INFO ] Flow matrix only has 18727 transitions (discarded 8729 similar events)
[2023-03-17 21:35:14] [INFO ] Invariant cache hit.
[2023-03-17 21:35:21] [INFO ] Dead Transitions using invariants and state equation in 7537 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8624 ms. Remains : 497/497 places, 27456/27456 transitions.
Graph (trivial) has 9903 edges and 497 vertex of which 378 / 497 are part of one of the 62 SCC in 1 ms
Free SCC test removed 316 places
Drop transitions removed 10625 transitions
Ensure Unique test removed 14226 transitions
Reduce isomorphic transitions removed 24851 transitions.
Graph (complete) has 2518 edges and 181 vertex of which 173 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.1 ms
Discarding 8 places :
Also discarding 0 output transitions
Drop transitions removed 12 transitions
Reduce isomorphic transitions removed 12 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 14 rules applied. Total rules applied 16 place count 173 transition count 2591
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 18 place count 171 transition count 2591
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 22 place count 169 transition count 2589
Ensure Unique test removed 33 transitions
Reduce isomorphic transitions removed 33 transitions.
Iterating post reduction 2 with 33 rules applied. Total rules applied 55 place count 169 transition count 2556
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 57 place count 168 transition count 2566
Drop transitions removed 1367 transitions
Redundant transition composition rules discarded 1367 transitions
Iterating global reduction 3 with 1367 rules applied. Total rules applied 1424 place count 168 transition count 1199
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 1392 edges and 166 vertex of which 147 are kept as prefixes of interest. Removing 19 places using SCC suffix rule.1 ms
Discarding 19 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Iterating post reduction 3 with 10 rules applied. Total rules applied 1434 place count 147 transition count 1189
Drop transitions removed 108 transitions
Reduce isomorphic transitions removed 108 transitions.
Iterating post reduction 4 with 108 rules applied. Total rules applied 1542 place count 147 transition count 1081
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 1544 place count 145 transition count 1069
Iterating global reduction 5 with 2 rules applied. Total rules applied 1546 place count 145 transition count 1069
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1547 place count 145 transition count 1068
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 6 with 4 rules applied. Total rules applied 1551 place count 145 transition count 1064
Free-agglomeration rule applied 4 times.
Iterating global reduction 6 with 4 rules applied. Total rules applied 1555 place count 145 transition count 1060
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 1561 place count 141 transition count 1058
Drop transitions removed 34 transitions
Redundant transition composition rules discarded 34 transitions
Iterating global reduction 7 with 34 rules applied. Total rules applied 1595 place count 141 transition count 1024
Free-agglomeration rule applied 1 times.
Iterating global reduction 7 with 1 rules applied. Total rules applied 1596 place count 141 transition count 1023
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 1597 place count 140 transition count 1023
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 8 with 4 rules applied. Total rules applied 1601 place count 140 transition count 1019
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 8 with 2 rules applied. Total rules applied 1603 place count 140 transition count 1024
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 8 with 10 rules applied. Total rules applied 1613 place count 138 transition count 1016
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 1614 place count 137 transition count 1010
Iterating global reduction 9 with 1 rules applied. Total rules applied 1615 place count 137 transition count 1010
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 9 with 9 rules applied. Total rules applied 1624 place count 137 transition count 1001
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 10 with 2 rules applied. Total rules applied 1626 place count 137 transition count 1001
Applied a total of 1626 rules in 184 ms. Remains 137 /497 variables (removed 360) and now considering 1001/27456 (removed 26455) transitions.
Running SMT prover for 6 properties.
[2023-03-17 21:35:21] [INFO ] Flow matrix only has 965 transitions (discarded 36 similar events)
// Phase 1: matrix 965 rows 137 cols
[2023-03-17 21:35:21] [INFO ] Computed 0 place invariants in 3 ms
[2023-03-17 21:35:22] [INFO ] After 372ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-17 21:35:22] [INFO ] After 312ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-17 21:35:22] [INFO ] State equation strengthened by 12 read => feed constraints.
[2023-03-17 21:35:22] [INFO ] After 204ms SMT Verify possible using 12 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-17 21:35:23] [INFO ] After 474ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 195 ms.
[2023-03-17 21:35:23] [INFO ] After 1033ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Knowledge obtained : [(AND p2 p1 p3 (NOT p0)), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (NOT (AND p2 (NOT p1) (NOT p3) (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p3) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND p2 (NOT p1) (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p3))))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 362 ms. Reduced automaton from 5 states, 9 edges and 4 AP (stutter sensitive) to 5 states, 9 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 204 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p3) (NOT p0)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p3))]
Stuttering acceptance computed with spot in 188 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p3) (NOT p0)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p3))]
Stuttering acceptance computed with spot in 193 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p3) (NOT p0)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p3))]
Product exploration explored 100000 steps with 1 reset in 2220 ms.
Product exploration explored 100000 steps with 0 reset in 2299 ms.
Applying partial POR strategy [false, true, true, true, true]
Stuttering acceptance computed with spot in 200 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p3) (NOT p0)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p3))]
Support contains 8 out of 510 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 510/510 places, 28438/28438 transitions.
Applied a total of 0 rules in 176 ms. Remains 510 /510 variables (removed 0) and now considering 28438/28438 (removed 0) transitions.
[2023-03-17 21:35:29] [INFO ] Flow matrix only has 18682 transitions (discarded 9756 similar events)
// Phase 1: matrix 18682 rows 510 cols
[2023-03-17 21:35:29] [INFO ] Computed 8 place invariants in 56 ms
[2023-03-17 21:35:37] [INFO ] Dead Transitions using invariants and state equation in 7856 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 8034 ms. Remains : 510/510 places, 28438/28438 transitions.
Support contains 8 out of 510 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 510/510 places, 28438/28438 transitions.
Applied a total of 0 rules in 28 ms. Remains 510 /510 variables (removed 0) and now considering 28438/28438 (removed 0) transitions.
[2023-03-17 21:35:37] [INFO ] Flow matrix only has 18682 transitions (discarded 9756 similar events)
[2023-03-17 21:35:37] [INFO ] Invariant cache hit.
[2023-03-17 21:35:37] [INFO ] Implicit Places using invariants in 717 ms returned []
Implicit Place search using SMT only with invariants took 717 ms to find 0 implicit places.
[2023-03-17 21:35:37] [INFO ] Flow matrix only has 18682 transitions (discarded 9756 similar events)
[2023-03-17 21:35:37] [INFO ] Invariant cache hit.
[2023-03-17 21:35:45] [INFO ] Dead Transitions using invariants and state equation in 7918 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8664 ms. Remains : 510/510 places, 28438/28438 transitions.
Treatment of property RERS2020-PT-pb103-LTLCardinality-07 finished in 190853 ms.
[2023-03-17 21:35:47] [INFO ] Flatten gal took : 653 ms
[2023-03-17 21:35:47] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 1 ms.
[2023-03-17 21:35:47] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 513 places, 28429 transitions and 113003 arcs took 106 ms.
Total runtime 768330 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2049/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2049/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2049/ltl_2_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : RERS2020-PT-pb103-LTLCardinality-01
Could not compute solution for formula : RERS2020-PT-pb103-LTLCardinality-05
Could not compute solution for formula : RERS2020-PT-pb103-LTLCardinality-07
BK_STOP 1679088970975
--------------------
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 LTLCardinality -timeout 360 -rebuildPNML
mcc2023
ltl formula name RERS2020-PT-pb103-LTLCardinality-01
ltl formula formula --ltl=/tmp/2049/ltl_0_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 513 places, 28429 transitions and 113003 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2049/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2049/ltl_0_
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 5.340 real 0.990 user 0.970 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2049/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2049/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***
Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
0: pnml2lts-mc(+0xa23f4) [0x5560761b83f4]
1: pnml2lts-mc(+0xa2496) [0x5560761b8496]
2: /lib/x86_64-linux-gnu/libpthread.so.0(+0x13140) [0x7f41bcb83140]
3: pnml2lts-mc(+0x405be5) [0x55607651bbe5]
4: pnml2lts-mc(+0x16b3f9) [0x5560762813f9]
5: pnml2lts-mc(+0x164ac4) [0x55607627aac4]
6: pnml2lts-mc(+0x272e0a) [0x556076388e0a]
7: pnml2lts-mc(+0xb61f0) [0x5560761cc1f0]
8: /lib/x86_64-linux-gnu/libc.so.6(+0x3b4d7) [0x7f41bc9d64d7]
9: /lib/x86_64-linux-gnu/libc.so.6(+0x3b67a) [0x7f41bc9d667a]
10: pnml2lts-mc(+0xa1581) [0x5560761b7581]
11: pnml2lts-mc(+0xa1910) [0x5560761b7910]
12: pnml2lts-mc(+0xa32a2) [0x5560761b92a2]
13: pnml2lts-mc(+0xa50f4) [0x5560761bb0f4]
14: pnml2lts-mc(+0x3f34b3) [0x5560765094b3]
15: pnml2lts-mc(+0x7c63d) [0x55607619263d]
16: pnml2lts-mc(+0x67d86) [0x55607617dd86]
17: pnml2lts-mc(+0x60a8a) [0x556076176a8a]
18: pnml2lts-mc(+0x5eb15) [0x556076174b15]
19: /lib/x86_64-linux-gnu/libc.so.6(__libc_start_main+0xea) [0x7f41bc9bed0a]
20: pnml2lts-mc(+0x6075e) [0x55607617675e]
ltl formula name RERS2020-PT-pb103-LTLCardinality-05
ltl formula formula --ltl=/tmp/2049/ltl_1_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 513 places, 28429 transitions and 113003 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2049/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2049/ltl_1_
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 5.430 real 0.950 user 1.020 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2049/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2049/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)
ltl formula name RERS2020-PT-pb103-LTLCardinality-07
ltl formula formula --ltl=/tmp/2049/ltl_2_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 513 places, 28429 transitions and 113003 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2049/ltl_2_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2049/ltl_2_
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 5.370 real 0.900 user 1.060 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2049/ltl_2_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2049/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 5 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)
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-pb103"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool ltsminxred"
echo " Input is RERS2020-PT-pb103, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r329-tall-167889201800235"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/RERS2020-PT-pb103.tgz
mv RERS2020-PT-pb103 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;